dist
uint32_t color, best, dist, k;
dist = diff * diff;
dist += diff * diff;
dist += diff * diff;
if (dist == 0)
if (dist < best) {
best = dist;
#define d_code(dist) \
((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
int dist; /* distance index */
dist = 0;
base_dist[code] = dist;
dist_code[dist++] = (uch)code;
Assert (dist == 256, "ct_static_init: dist != 256");
dist >>= 7; /* from now on, all distances are divided by 128 */
base_dist[code] = dist << 7;
dist_code[256 + dist++] = (uch)code;
Assert (dist == 256, "ct_static_init: 256+dist != 512");
local int ct_tally (s, dist, lc)
int dist; /* distance of matched string */
s->d_buf[s->last_lit] = (ush)dist;
if (dist == 0) {
dist--; /* dist = match distance - 1 */
Assert((ush)dist < (ush)MAX_DIST(s) &&
(ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
s->dyn_dtree[d_code(dist)].Freq++;
unsigned dist; /* distance of matched string */
dist = s->d_buf[lx];
if (dist == 0) {
dist--; /* dist is now the match distance - 1 */
code = d_code(dist);
dist -= base_dist[code];
send_bits(s, dist, extra); /* send the extra distance bits */
local int ct_tally OF((deflate_state *s, int dist, int lc));
uInt dist; /* distance back to copy from */
c->sub.copy.dist = t->base;
c->sub.copy.dist += (uInt)b & inflate_mask[j];
Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));
f = (uInt)(q - s->window) < c->sub.copy.dist ?
s->end - (c->sub.copy.dist - (q - s->window)) :
q - c->sub.copy.dist;
f = q - c->sub.copy.dist;
if ((uInt)(q - s->window) < c->sub.copy.dist)
f = s->end - (c->sub.copy.dist - (q - s->window));
long dist;
dist = (long)(Fs * BLKSIZ);
dist = (long)(V_labl.v_offset * BLKSIZ);
if (lseek(lfdes, dist, 0) < 0)
int dist = 0;
if (++dist > maxdist)
dist += strlen(s1) + strlen(s2);
return dist > maxdist ? INT_MAX : dist;
int dist, mindist;
dist = similar(nch->string, *testsec);
if (dist < mindist) {
mindist = dist;
const char *dist = " Distribution ";
n = (NCHARS - strlen(dist)) / 2;
mdb_printf("%*s %s%s%s %s\n", width, label, dashes, dist, dashes,
int dist = end - beg + 1;
out[pos] = beg + (pos * dist)/buckets;
uintbits_t dist = kg->kg_dist; \
(uintbits_t)(cur - pattern) >= dist) \
uintmax_t dist = 0;
'd', MDB_OPT_UINT64, &dist,
if (dist != 0)
if (dist > 0 &&
((dist & ~size_mask) || size_mask + 1 - dist < pattern)) {
"%d (max: %llx)\n", pattern, dist, size, size_mask);
kg.kg_dist = dist;
dist == 0 && minaddr == 0 && maxaddr == 0)
numdots = (dist(x[i],y[i], x[i+1],y[i+1]) + dist(x[i+1],y[i+1], x[i+2],y[i+2])) / 2;
uint32_t best, dist, k;
dist = diff * diff;
dist += diff * diff;
dist += diff * diff;
if (dist < best) {
best = dist;
if (dist == 0)
int i, dist;
dist = SWAB32(pBt, pInfo->aFree[0]) - nearby;
if( dist<0 ) dist = -dist;
if( d2<dist ) closest = i;
int parm_cursor, one_step, dist;
dist = orow - nrow;
dist = nrow - orow;
add_op(try, parm_cursor, dist, 0);
add_op(try, one_step, dist, 0);
int dist, tabs, tabstop;
tabs = tabstop = dist = 0;
dist = nc - oc;
dist = oc - nc;
add_op(best, dir->_one, dist, 0);
int parm_cursor, dist;
dist = ocol - ncol;
dist = ncol - ocol;
add_op(try, parm_cursor, dist, 0);
int parm_cursor, one_step, dist;
dist = orow - nrow;
dist = nrow - orow;
add_op(try, parm_cursor, dist, 0);
add_op(try, one_step, dist, 0);
int dist, tabs, tabstop;
dist = nc - oc;
dist = oc - nc;
add_op(best, dir->_one, dist, 0);
int parm_cursor, dist;
dist = ocol - ncol;
dist = ncol - ocol;
add_op(try, parm_cursor, dist, 0);
distributions:/v/adm/dist:/v/bin/sh distributions:/v/adm/dist:/v/bin/sh
dist dist sorry 9999 4 file distributions /v/adm/dist /v/bin/sh
int dist; /* distance index */
dist = 0;
base_dist[code] = dist;
_dist_code[dist++] = (uch)code;
Assert(dist == 256, "tr_static_init: dist != 256");
dist >>= 7; /* from now on, all distances are divided by 128 */
base_dist[code] = dist << 7;
_dist_code[256 + dist++] = (uch)code;
Assert(dist == 256, "tr_static_init: 256+dist != 512");
_tr_tally(s, dist, lc)
unsigned dist; /* distance of matched string */
s->d_buf[s->last_lit] = (ush)dist;
if (dist == 0) {
dist--; /* dist = match distance - 1 */
Assert((ush)dist < (ush)MAX_DIST(s) &&
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
s->dyn_dtree[d_code(dist)].Freq++;
unsigned dist; /* distance of matched string */
dist = s->d_buf[lx];
if (dist == 0) {
dist--;
code = d_code(dist);
dist -= base_dist[code];
send_bits(s, dist, extra);
uInt dist; /* distance back to copy from */
c->sub.copy.dist = t->base;
c->sub.copy.dist += (uInt)b & inflate_mask[j];
c->sub.copy.dist));
f = (uInt)(q - s->window) < c->sub.copy.dist ?
s->end - (c->sub.copy.dist - (q - s->window)) :
q - c->sub.copy.dist;
f = q - c->sub.copy.dist;
if ((uInt)(q - s->window) < c->sub.copy.dist)
f = s->end - (c->sub.copy.dist -
int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
#define d_code(dist) \
((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
ush dist = (distance); \
s->d_buf[s->last_lit] = dist; \
dist--; \
s->dyn_dtree[d_code(dist)].Freq++; \
int dist = abs(val - sc->sc_abs[idx].value);
if (dist < sc->sc_abs[idx].fuzz >> 1) {
} else if (dist < sc->sc_abs[idx].fuzz) {
} else if (dist < sc->sc_abs[idx].fuzz << 1) {