games/atc/update.c

378

too_close(const PLANE *p1, const PLANE *p2, int dist)

games/atc/update.c

380

if (ABS(p1->altitude - p2->altitude) <= dist &&

games/atc/update.c

381

ABS(p1->xpos - p2->xpos) <= dist && ABS(p1->ypos - p2->ypos) <= dist)

games/hack/extern.h

255

int dist(int, int);

games/hack/hack.apply.c

156

int tmp = dist(mtmp->mx, mtmp->my);

games/hack/hack.apply.c

298

if (dist(mtmp->mx, mtmp->my) < u.ulevel * 20) {

games/hack/hack.apply.c

337

(!dig_down && dist(dpx, dpy) > 2)))

games/hack/hack.c

181

if (dist(u.ustuck->mx, u.ustuck->my) > 2) {

games/hack/hack.c

697

d = dist(x, y);

games/hack/hack.c

746

if (dist(x, y) < 3)

games/hack/hack.dog.c

129

if (dist(mtmp->mx, mtmp->my) < 3 && follower(mtmp)

games/hack/hack.dog.c

226

udist = dist(omx, omy);

games/hack/hack.dog.c

306

if (dist(gx, gy) >

games/hack/hack.dog.c

307

dist(doors[tmp].x, doors[tmp].y)) {

games/hack/hack.fight.c

105

boolean far = (dist(magr->mx, magr->my) > 15);

games/hack/hack.mon.c

219

if ((dd = dist(mtmp->mx, mtmp->my)) < dist(x, y))

games/hack/hack.mon.c

280

nearby = (dist(mtmp->mx, mtmp->my) < 3);

games/hack/hack.mon.c

449

if (dist(omx, omy) < 10) {

games/hack/hack.potion.c

306

uclose = (dist(mon->mx, mon->my) < 3);

games/hack/hack.read.c

295

if (dist(oux, ouy) > 100)

games/hack/hack.read.c

483

if (dist(mtmp->mx, mtmp->my) < 3) {

games/hack/hack.read.c

612

if (!Blind && dist(zx, zy) > 2) {

games/hack/hack.shk.c

1011

avoid = (u.uinshop && dist(gx, gy) > 8);

games/hack/hack.shk.c

1108

} else if (dist(shopkeeper->mx, shopkeeper->my) < 3) {

games/hack/hack.shk.c

447

if (shkp->isshk && dist(shkp->mx, shkp->my) < 3)

games/hack/hack.shk.c

950

if ((udist = dist(omx, omy)) < 3) {

games/hack/hack.steal.c

119

if (dist(mtmp->mx, mtmp->my) < 3) {

games/hack/hack.unix.c

424

if (dist(md->mx, md->my) > 2)

games/hack/hack.unix.c

446

if (dist(fx, fy) < dist(doors[tmp].x, doors[tmp].y)) {

games/hack/hack.vault.c

274

if (dist(guard->mx, guard->my) > 1 || egd->gddone) {

games/hack/hack.wizard.c

95

if (dist(mtmp->mx, mtmp->my) > 2)

games/hunt/hunt/otto.c

195

stop_look(struct item *itemp, char c, int dist, int side)

games/hunt/hunt/otto.c

209

itemp->distance = dist;

games/hunt/hunt/otto.c

226

itemp->distance = dist;

games/hunt/hunt/otto.c

240

itemp->distance = dist;

games/hunt/hunt/otto.c

254

itemp->distance = dist;

games/hunt/hunt/otto.c

489

int i, rel_dir, dist;

games/hunt/hunt/otto.c

492

dist = WIDTH;

games/hunt/hunt/otto.c

494

if (flbr[i].what == mine && flbr[i].distance < dist) {

games/hunt/hunt/otto.c

496

dist = flbr[i].distance;

games/hunt/hunt/otto.c

504

if (dist > 4)

games/hunt/hunt/otto.c

505

dist = 4;

games/hunt/hunt/otto.c

506

face_and_move_direction(rel_dir, dist);

games/sail/dr_2.c

211

int dist;

games/sail/dr_2.c

228

dist = dtab[*p - '0'];

games/sail/dr_2.c

230

dist = *p - '0';

games/sail/dr_2.c

231

*row -= dr[*dir] * dist;

games/sail/dr_2.c

232

*col -= dc[*dir] * dist;

games/sail/dr_3.c

230

int dist;

games/sail/dr_3.c

244

dist = dtab[com - '0'];

games/sail/dr_3.c

246

dist = com - '0';

games/sail/dr_3.c

247

sp->file->row -= dr[sp->file->dir] * dist;

games/sail/dr_3.c

248

sp->file->col -= dc[sp->file->dir] * dist;

games/sail/misc.c

100

dist = range(from, sp);

games/sail/misc.c

101

if (dist < olddist) {

games/sail/misc.c

103

olddist = dist;

games/sail/misc.c

87

int olddist = 30000, dist;

games/trek/autover.c

57

double dist;

games/trek/autover.c

68

dist = 0.75 * Ship.energy / (Ship.warp3 * (Ship.shldup + 1));

games/trek/autover.c

69

if (dist > 1.4142)

games/trek/autover.c

70

dist = 1.4142;

games/trek/autover.c

74

warp(-1, course, dist);

games/trek/compkl.c

100

if (Etc.klingon[i].dist > Etc.klingon[i+1].dist) {

games/trek/compkl.c

69

temp = Etc.klingon[i].dist;

games/trek/compkl.c

75

Etc.klingon[i].dist = d;

games/trek/computer.c

111

double dist, time;

games/trek/computer.c

175

Etc.klingon[i].y, &dist);

games/trek/computer.c

176

prkalc(course, dist);

games/trek/computer.c

200

course = kalc(tqx, tqy, ix, iy, &dist);

games/trek/computer.c

202

warp(-1, course, dist);

games/trek/computer.c

208

prkalc(course, dist);

games/trek/computer.c

216

dist = getfltpar("range");

games/trek/computer.c

217

if (dist < 0.0)

games/trek/computer.c

219

dist *= 10.0;

games/trek/computer.c

220

cost = pow(0.90, dist) * 98.0 + 0.5;

games/trek/computer.c

226

dist = getfltpar("distance");

games/trek/computer.c

227

if (dist < 0.0)

games/trek/computer.c

232

cost = (dist + 0.05) * warpfact * warpfact * warpfact;

games/trek/computer.c

233

time = Param.warptime * dist / (warpfact * warpfact);

games/trek/computer.c

236

warpfact, dist, time, cost, cost + cost);

games/trek/computer.c

240

dist = getfltpar("distance");

games/trek/computer.c

241

if (dist < 0.0)

games/trek/computer.c

243

cost = 20 + 100 * dist;

games/trek/computer.c

244

time = dist / 0.095;

games/trek/computer.c

246

dist, time, cost);

games/trek/computer.c

308

kalc(int tqx, int tqy, int tsx, int tsy, double *dist)

games/trek/computer.c

328

*dist = sqrt(dx);

games/trek/computer.c

333

prkalc(int course, double dist)

games/trek/computer.c

335

printf(": course %d dist %.3f\n", course, dist);

games/trek/destruct.c

104

if (Etc.klingon[i].power * Etc.klingon[i].dist <= zap)

games/trek/events.c

384

compkldist(Etc.klingon[0].dist ==

games/trek/help.c

103

if (x < dist) {

games/trek/help.c

104

dist = x;

games/trek/help.c

114

dist = 0.0;

games/trek/help.c

122

x = pow(1.0 - pow(0.94, dist), 0.3333333);

games/trek/help.c

68

double dist, x;

games/trek/help.c

92

dist = TOOLARGE;

games/trek/impulse.c

47

double dist, time;

games/trek/impulse.c

58

if (getcodi(&course, &dist))

games/trek/impulse.c

60

power = 20 + 100 * dist;

games/trek/impulse.c

70

time = dist / 0.095;

games/trek/move.c

103

dist = fabs(dy);

games/trek/move.c

104

if (dist > bigger)

games/trek/move.c

105

bigger = dist;

games/trek/move.c

125

dist = time * speed;

games/trek/move.c

131

xn = NSECTS * dist * bigger;

games/trek/move.c

211

dist = sqrt(dx * dx + dy * dy) / NSECTS;

games/trek/move.c

212

time = dist / speed;

games/trek/move.c

82

double dist;

games/trek/phaser.c

211

distfactor = k->dist;

games/trek/phaser.c

317

anglefactor = k->dist;

games/trek/trek.h

182

double dist; /* distance to Enterprise */

games/trek/warp.c

106

time = dist / speed;

games/trek/warp.c

120

dist *= frac;

games/trek/warp.c

130

dist = Move.time * speed;

games/trek/warp.c

131

Ship.energy -= dist * Ship.warp3 * (Ship.shldup + 1);

games/trek/warp.c

142

if (ranf(100) >= 100 * dist) {

games/trek/warp.c

153

time = (Ship.warp - 8.0) * dist * (franf() + 1.0);

games/trek/warp.c

73

double dist;

games/trek/warp.c

91

dist = d;

games/trek/warp.c

94

power = (dist + 0.05) * Ship.warp3;

lib/libdmsg/msg_lnk.c

1062

msg->any.lnk_span.dist = slink->lnk_span.dist + 1;

lib/libdmsg/msg_lnk.c

1120

relay->source_rt->any.link->lnk_span.dist,

lib/libdmsg/msg_lnk.c

1237

slink->lnk_span.dist,

lib/libdmsg/msg_lnk.c

249

if (link1->lnk_span.dist < link2->lnk_span.dist)

lib/libdmsg/msg_lnk.c

251

if (link1->lnk_span.dist > link2->lnk_span.dist)

lib/libdmsg/msg_lnk.c

287

if (link1->lnk_span.dist < link2->lnk_span.dist)

lib/libdmsg/msg_lnk.c

289

if (link1->lnk_span.dist > link2->lnk_span.dist)

lib/libdmsg/msg_lnk.c

636

msg->any.lnk_span.dist);

lib/libdmsg/msg_lnk.c

887

if (lastdist != slink->lnk_span.dist ||

lib/libdmsg/msg_lnk.c

912

if (slink->lnk_span.dist > DMSG_SPAN_MAXDIST)

lib/libdmsg/msg_lnk.c

969

relay->source_rt->any.link->lnk_span.dist >=

lib/libdmsg/msg_lnk.c

970

slink->lnk_span.dist);

lib/libdmsg/msg_lnk.c

973

lastdist = slink->lnk_span.dist;

sbin/hammer2/zlib/hammer2_zlib_deflate.h

288

int ZLIB_INTERNAL _tr_tally(deflate_state *s, unsigned dist, unsigned lc);

sbin/hammer2/zlib/hammer2_zlib_deflate.h

296

#define d_code(dist) \

sbin/hammer2/zlib/hammer2_zlib_deflate.h

297

((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])

sbin/hammer2/zlib/hammer2_zlib_deflate.h

323

ush dist = (distance); \

sbin/hammer2/zlib/hammer2_zlib_deflate.h

324

s->d_buf[s->last_lit] = dist; \

sbin/hammer2/zlib/hammer2_zlib_deflate.h

326

dist--; \

sbin/hammer2/zlib/hammer2_zlib_deflate.h

328

s->dyn_dtree[d_code(dist)].Freq++; \

sbin/hammer2/zlib/hammer2_zlib_inffast.c

165

dist = (unsigned)(here.val);

sbin/hammer2/zlib/hammer2_zlib_inffast.c

175

dist += (unsigned)hold & ((1U << op) - 1);

sbin/hammer2/zlib/hammer2_zlib_inffast.c

177

if (dist > dmax) {

sbin/hammer2/zlib/hammer2_zlib_inffast.c

185

Tracevv((stderr, "inflate: distance %u\n", dist));

sbin/hammer2/zlib/hammer2_zlib_inffast.c

187

if (dist > op) { /* see if copy from window */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

188

op = dist - op; /* distance back in window */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

208

from = out - dist;

sbin/hammer2/zlib/hammer2_zlib_inffast.c

224

from = out - dist; /* rest from output */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

242

from = out - dist; /* rest from output */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

253

from = out - dist; /* rest from output */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

269

from = out - dist; /* copy direct from output */

sbin/hammer2/zlib/hammer2_zlib_inffast.c

94

unsigned dist; /* match distance */

sbin/hammer2/zlib/hammer2_zlib_inflate.c

364

unsigned dist;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

382

dist = state->wsize - state->wnext;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

383

if (dist > copy) dist = copy;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

384

zmemcpy(state->window + state->wnext, end - copy, dist);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

385

copy -= dist;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

392

state->wnext += dist;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

394

if (state->whave < state->wsize) state->whave += dist;

sbin/hammer2/zlib/hammer2_zlib_trees.c

1019

_tr_tally (deflate_state *s, unsigned dist, unsigned lc)

sbin/hammer2/zlib/hammer2_zlib_trees.c

1021

s->d_buf[s->last_lit] = (ush)dist;

sbin/hammer2/zlib/hammer2_zlib_trees.c

1023

if (dist == 0) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

1029

dist--; /* dist = match distance - 1 */

sbin/hammer2/zlib/hammer2_zlib_trees.c

1030

Assert((ush)dist < (ush)MAX_DIST(s) &&

sbin/hammer2/zlib/hammer2_zlib_trees.c

1032

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

sbin/hammer2/zlib/hammer2_zlib_trees.c

1035

s->dyn_dtree[d_code(dist)].Freq++;

sbin/hammer2/zlib/hammer2_zlib_trees.c

1070

unsigned dist; /* distance of matched string */

sbin/hammer2/zlib/hammer2_zlib_trees.c

1077

dist = s->d_buf[lx];

sbin/hammer2/zlib/hammer2_zlib_trees.c

1079

if (dist == 0) {

sbin/hammer2/zlib/hammer2_zlib_trees.c

1091

dist--; /* dist is now the match distance - 1 */

sbin/hammer2/zlib/hammer2_zlib_trees.c

1092

code = d_code(dist);

sbin/hammer2/zlib/hammer2_zlib_trees.c

1098

dist -= base_dist[code];

sbin/hammer2/zlib/hammer2_zlib_trees.c

1099

send_bits(s, dist, extra); /* send the extra distance bits */

sbin/hammer2/zlib/hammer2_zlib_trees.c

243

int dist; /* distance index */

sbin/hammer2/zlib/hammer2_zlib_trees.c

274

dist = 0;

sbin/hammer2/zlib/hammer2_zlib_trees.c

276

base_dist[code] = dist;

sbin/hammer2/zlib/hammer2_zlib_trees.c

278

_dist_code[dist++] = (uch)code;

sbin/hammer2/zlib/hammer2_zlib_trees.c

281

Assert (dist == 256, "tr_static_init: dist != 256");

sbin/hammer2/zlib/hammer2_zlib_trees.c

282

dist >>= 7; /* from now on, all distances are divided by 128 */

sbin/hammer2/zlib/hammer2_zlib_trees.c

284

base_dist[code] = dist << 7;

sbin/hammer2/zlib/hammer2_zlib_trees.c

286

_dist_code[256 + dist++] = (uch)code;

sbin/hammer2/zlib/hammer2_zlib_trees.c

289

Assert (dist == 256, "tr_static_init: 256+dist != 512");

sys/bus/u4b/uvc/uvc_drv.c

486

uint32_t best = -1, dist, val;

sys/bus/u4b/uvc/uvc_drv.c

490

dist = interval > val ? interval - val : val - interval;

sys/bus/u4b/uvc/uvc_drv.c

492

if (dist > best)

sys/bus/u4b/uvc/uvc_drv.c

495

best = dist;

sys/dev/misc/evdev/evdev.h

119

int32_t dist; /* ABS_MT_DISTANCE */

sys/net/zlib.c

1988

#define d_code(dist) \

sys/net/zlib.c

1989

((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])

sys/net/zlib.c

2068

int dist; /* distance index */

sys/net/zlib.c

2090

dist = 0;

sys/net/zlib.c

2092

base_dist[code] = dist;

sys/net/zlib.c

2094

dist_code[dist++] = (uch)code;

sys/net/zlib.c

2097

Assert (dist == 256, "tr_static_init: dist != 256");

sys/net/zlib.c

2098

dist >>= 7; /* from now on, all distances are divided by 128 */

sys/net/zlib.c

2100

base_dist[code] = dist << 7;

sys/net/zlib.c

2102

dist_code[256 + dist++] = (uch)code;

sys/net/zlib.c

2105

Assert (dist == 256, "tr_static_init: 256+dist != 512");

sys/net/zlib.c

2813

_tr_tally(deflate_state *s, unsigned dist, unsigned lc)

sys/net/zlib.c

2815

s->d_buf[s->last_lit] = (ush)dist;

sys/net/zlib.c

2817

if (dist == 0) {

sys/net/zlib.c

2823

dist--; /* dist = match distance - 1 */

sys/net/zlib.c

2824

Assert((ush)dist < (ush)MAX_DIST(s) &&

sys/net/zlib.c

2826

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

sys/net/zlib.c

2829

s->dyn_dtree[d_code(dist)].Freq++;

sys/net/zlib.c

2865

unsigned dist; /* distance of matched string */

sys/net/zlib.c

2872

dist = s->d_buf[lx];

sys/net/zlib.c

2874

if (dist == 0) {

sys/net/zlib.c

2886

dist--; /* dist is now the match distance - 1 */

sys/net/zlib.c

2887

code = d_code(dist);

sys/net/zlib.c

2893

dist -= base_dist[code];

sys/net/zlib.c

2894

send_bits(s, dist, extra); /* send the extra distance bits */

sys/net/zlib.c

4671

uInt dist; /* distance back to copy from */

sys/net/zlib.c

4801

c->sub.copy.dist = t->base;

sys/net/zlib.c

4818

c->sub.copy.dist += (uInt)b & inflate_mask[j];

sys/net/zlib.c

4820

Tracevv((stderr, "inflate: distance %u\n", c->sub.copy.dist));

sys/net/zlib.c

4824

f = (uInt)(q - s->window) < c->sub.copy.dist ?

sys/net/zlib.c

4825

s->end - (c->sub.copy.dist - (q - s->window)) :

sys/net/zlib.c

4826

q - c->sub.copy.dist;

sys/net/zlib.c

4828

f = q - c->sub.copy.dist;

sys/net/zlib.c

4829

if ((uInt)(q - s->window) < c->sub.copy.dist)

sys/net/zlib.c

4830

f = s->end - (c->sub.copy.dist - (uInt)(q - s->window));

sys/net/zlib.c

542

int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));

sys/platform/pc64/x86_64/mptable.c

437

int cur, prev, dist;

sys/platform/pc64/x86_64/mptable.c

445

dist = cur = prev = -1;

sys/platform/pc64/x86_64/mptable.c

454

if (dist < 0)

sys/platform/pc64/x86_64/mptable.c

455

dist = new_dist;

sys/platform/pc64/x86_64/mptable.c

462

if (dist != new_dist)

sys/platform/pc64/x86_64/mptable.c

467

if (dist == 1)

sys/platform/pc64/x86_64/mptable.c

471

if (dist & (dist - 1))

sys/platform/pc64/x86_64/mptable.c

475

if (dist > lcpus_max)

sys/platform/pc64/x86_64/mptable.c

478

logical_cpus = dist;

sys/sys/dmsg.h

512

uint32_t dist; /* span distance */

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

288

int ZLIB_INTERNAL _tr_tally(deflate_state *s, unsigned dist, unsigned lc);

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

296

#define d_code(dist) \

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

297

((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

323

ush dist = (distance); \

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

324

s->d_buf[s->last_lit] = dist; \

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

326

dist--; \

sys/vfs/hammer2/zlib/hammer2_zlib_deflate.h

328

s->dyn_dtree[d_code(dist)].Freq++; \

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

165

dist = (unsigned)(here.val);

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

175

dist += (unsigned)hold & ((1U << op) - 1);

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

177

if (dist > dmax) {

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

185

Tracevv((stderr, "inflate: distance %u\n", dist));

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

187

if (dist > op) { /* see if copy from window */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

188

op = dist - op; /* distance back in window */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

208

from = out - dist;

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

224

from = out - dist; /* rest from output */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

242

from = out - dist; /* rest from output */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

253

from = out - dist; /* rest from output */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

269

from = out - dist; /* copy direct from output */

sys/vfs/hammer2/zlib/hammer2_zlib_inffast.c

94

unsigned dist; /* match distance */

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

369

unsigned dist;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

387

dist = state->wsize - state->wnext;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

388

if (dist > copy) dist = copy;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

389

zmemcpy(state->window + state->wnext, end - copy, dist);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

390

copy -= dist;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

397

state->wnext += dist;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

399

if (state->whave < state->wsize) state->whave += dist;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1019

_tr_tally (deflate_state *s, unsigned dist, unsigned lc)

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1021

s->d_buf[s->last_lit] = (ush)dist;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1023

if (dist == 0) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1029

dist--; /* dist = match distance - 1 */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1030

Assert((ush)dist < (ush)MAX_DIST(s) &&

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1032

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1035

s->dyn_dtree[d_code(dist)].Freq++;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1070

unsigned dist; /* distance of matched string */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1077

dist = s->d_buf[lx];

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1079

if (dist == 0) {

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1091

dist--; /* dist is now the match distance - 1 */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1092

code = d_code(dist);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1098

dist -= base_dist[code];

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

1099

send_bits(s, dist, extra); /* send the extra distance bits */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

243

int dist; /* distance index */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

274

dist = 0;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

276

base_dist[code] = dist;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

278

_dist_code[dist++] = (uch)code;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

281

Assert (dist == 256, "tr_static_init: dist != 256");

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

282

dist >>= 7; /* from now on, all distances are divided by 128 */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

284

base_dist[code] = dist << 7;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

286

_dist_code[256 + dist++] = (uch)code;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

289

Assert (dist == 256, "tr_static_init: 256+dist != 512");

usr.bin/split/split.c

173

ssize_t dist, len;

usr.bin/split/split.c

191

dist = bytecnt - bcnt;

usr.bin/split/split.c

192

if (write(ofd, bfr, dist) != dist)

usr.bin/split/split.c

194

len -= dist;

usr.bin/split/split.c

195

for (C = bfr + dist; len >= bytecnt;

usr.sbin/installer/dfuife_curses/curses_form.c

556

int dist, best_dist = 999;

usr.sbin/installer/dfuife_curses/curses_form.c

565

dist = (w->x + w->width / 2) - x;

usr.sbin/installer/dfuife_curses/curses_form.c

566

if (dist < 0) dist *= -1;

usr.sbin/installer/dfuife_curses/curses_form.c

567

if (dist < best_dist) {

usr.sbin/installer/dfuife_curses/curses_form.c

568

best_dist = dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

288

int ZLIB_INTERNAL _tr_tally(deflate_state *s, unsigned dist, unsigned lc);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

296

#define d_code(dist) \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

297

((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

323

ush dist = (distance); \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

324

s->d_buf[s->last_lit] = dist; \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

326

dist--; \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.h

328

s->dyn_dtree[d_code(dist)].Freq++; \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

165

dist = (unsigned)(here.val);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

175

dist += (unsigned)hold & ((1U << op) - 1);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

177

if (dist > dmax) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

185

Tracevv((stderr, "inflate: distance %u\n", dist));

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

187

if (dist > op) { /* see if copy from window */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

188

op = dist - op; /* distance back in window */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

208

from = out - dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

224

from = out - dist; /* rest from output */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

242

from = out - dist; /* rest from output */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

253

from = out - dist; /* rest from output */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

269

from = out - dist; /* copy direct from output */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inffast.c

94

unsigned dist; /* match distance */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

369

unsigned dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

387

dist = state->wsize - state->wnext;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

388

if (dist > copy) dist = copy;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

389

zmemcpy(state->window + state->wnext, end - copy, dist);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

390

copy -= dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

397

state->wnext += dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c

399

if (state->whave < state->wsize) state->whave += dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1019

_tr_tally (deflate_state *s, unsigned dist, unsigned lc)

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1021

s->d_buf[s->last_lit] = (ush)dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1023

if (dist == 0) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1029

dist--; /* dist = match distance - 1 */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1030

Assert((ush)dist < (ush)MAX_DIST(s) &&

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1032

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1035

s->dyn_dtree[d_code(dist)].Freq++;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1070

unsigned dist; /* distance of matched string */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1077

dist = s->d_buf[lx];

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1079

if (dist == 0) {

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1091

dist--; /* dist is now the match distance - 1 */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1092

code = d_code(dist);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1098

dist -= base_dist[code];

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

1099

send_bits(s, dist, extra); /* send the extra distance bits */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

243

int dist; /* distance index */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

274

dist = 0;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

276

base_dist[code] = dist;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

278

_dist_code[dist++] = (uch)code;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

281

Assert (dist == 256, "tr_static_init: dist != 256");

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

282

dist >>= 7; /* from now on, all distances are divided by 128 */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

284

base_dist[code] = dist << 7;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

286

_dist_code[256 + dist++] = (uch)code;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

289

Assert (dist == 256, "tr_static_init: 256+dist != 512");