games/atc/update.c

400

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

games/atc/update.c

402

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

games/atc/update.c

403

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

games/hack/hack.apply.c

157

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

games/hack/hack.apply.c

293

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

games/hack/hack.apply.c

330

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

games/hack/hack.c

187

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

games/hack/hack.c

660

d = dist(x,y);

games/hack/hack.c

703

if (dist(x,y) < 3)

games/hack/hack.dog.c

132

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

games/hack/hack.dog.c

226

udist = dist(omx,omy);

games/hack/hack.dog.c

297

if(dist(gx,gy) >

games/hack/hack.dog.c

298

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

games/hack/hack.fight.c

102

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

games/hack/hack.h

457

int dist(int, int);

games/hack/hack.mon.c

208

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

games/hack/hack.mon.c

266

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

games/hack/hack.mon.c

430

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

games/hack/hack.potion.c

299

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

games/hack/hack.read.c

285

if(dist(oux, ouy) > 100) known = TRUE;

games/hack/hack.read.c

455

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

games/hack/hack.read.c

580

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

games/hack/hack.shk.c

1013

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

games/hack/hack.shk.c

1103

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

games/hack/hack.shk.c

455

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

games/hack/hack.shk.c

951

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

games/hack/hack.steal.c

118

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

games/hack/hack.track.c

100

if(dist < 3)

games/hack/hack.track.c

101

return(dist ? &(utrack[i]) : 0);

games/hack/hack.track.c

92

int i,cnt,dist;

games/hack/hack.track.c

99

dist = (x-tc.x)*(x-tc.x) + (y-tc.y)*(y-tc.y);

games/hack/hack.unix.c

354

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

games/hack/hack.unix.c

377

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

games/hack/hack.vault.c

263

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

games/hack/hack.wizard.c

94

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

games/hunt/hunt/otto.c

192

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

games/hunt/hunt/otto.c

206

itemp->distance = dist;

games/hunt/hunt/otto.c

223

itemp->distance = dist;

games/hunt/hunt/otto.c

237

itemp->distance = dist;

games/hunt/hunt/otto.c

251

itemp->distance = dist;

games/hunt/hunt/otto.c

486

int i, rel_dir, dist;

games/hunt/hunt/otto.c

489

dist = WIDTH;

games/hunt/hunt/otto.c

491

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

games/hunt/hunt/otto.c

493

dist = flbr[i].distance;

games/hunt/hunt/otto.c

501

if (dist > 4)

games/hunt/hunt/otto.c

502

dist = 4;

games/hunt/hunt/otto.c

503

face_and_move_direction(rel_dir, dist);

games/sail/dr_2.c

183

int dist;

games/sail/dr_2.c

200

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

games/sail/dr_2.c

202

dist = *p - '0';

games/sail/dr_2.c

203

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

games/sail/dr_2.c

204

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

games/sail/dr_3.c

221

int dist;

games/sail/dr_3.c

235

dist = dtab[com - '0'];

games/sail/dr_3.c

237

dist = com - '0';

games/sail/dr_3.c

238

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

games/sail/dr_3.c

239

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

games/sail/misc.c

81

int olddist = 30000, dist;

games/sail/misc.c

94

dist = range(from, sp);

games/sail/misc.c

95

if (dist < olddist) {

games/sail/misc.c

97

olddist = dist;

games/trek/autover.c

58

double dist;

games/trek/autover.c

67

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

games/trek/autover.c

68

if (dist > 1.4142)

games/trek/autover.c

69

dist = 1.4142;

games/trek/autover.c

73

warp(-1, course, dist);

games/trek/compkl.c

105

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

games/trek/compkl.c

71

temp = Etc.klingon[i].dist;

games/trek/compkl.c

79

Etc.klingon[i].dist = d;

games/trek/computer.c

112

double dist, time;

games/trek/computer.c

180

course = kalc(Ship.quadx, Ship.quady, Etc.klingon[i].x, Etc.klingon[i].y, &dist);

games/trek/computer.c

181

prkalc(course, dist);

games/trek/computer.c

208

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

games/trek/computer.c

211

warp(-1, course, dist);

games/trek/computer.c

216

prkalc(course, dist);

games/trek/computer.c

224

dist = getfltpar("range");

games/trek/computer.c

225

if (dist < 0.0)

games/trek/computer.c

227

dist *= 10.0;

games/trek/computer.c

228

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

games/trek/computer.c

233

dist = getfltpar("distance");

games/trek/computer.c

234

if (dist < 0.0)

games/trek/computer.c

239

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

games/trek/computer.c

240

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

games/trek/computer.c

242

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

games/trek/computer.c

246

dist = getfltpar("distance");

games/trek/computer.c

247

if (dist < 0.0)

games/trek/computer.c

249

cost = 20 + 100 * dist;

games/trek/computer.c

250

time = dist / 0.095;

games/trek/computer.c

252

dist, time, cost);

games/trek/computer.c

313

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

games/trek/computer.c

333

*dist = sqrt(dx);

games/trek/computer.c

338

prkalc(int course, double dist)

games/trek/computer.c

340

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

games/trek/destruct.c

110

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

games/trek/events.c

377

compkldist(Etc.klingon[0].dist == Etc.klingon[0].avgdist ? 0 : 1);

games/trek/help.c

105

if (x < dist)

games/trek/help.c

107

dist = x;

games/trek/help.c

119

dist = 0.0;

games/trek/help.c

127

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

games/trek/help.c

65

double dist, x;

games/trek/help.c

92

dist = 1e50;

games/trek/impulse.c

46

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

119

dist = time * speed;

games/trek/move.c

125

xn = NSECTS * dist * bigger;

games/trek/move.c

208

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

games/trek/move.c

209

time = dist / speed;

games/trek/move.c

78

double dist, sectsize, xn, evtime;

games/trek/move.c

96

dist = fabs(dy);

games/trek/move.c

97

if (dist > bigger)

games/trek/move.c

98

bigger = dist;

games/trek/phaser.c

228

distfactor = k->dist;

games/trek/phaser.c

343

anglefactor = k->dist;

games/trek/trek.h

164

double dist; /* distance to Enterprise */

games/trek/warp.c

101

time = dist / speed;

games/trek/warp.c

117

dist *= frac;

games/trek/warp.c

126

dist = Move.time * speed;

games/trek/warp.c

127

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

games/trek/warp.c

138

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

games/trek/warp.c

152

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

games/trek/warp.c

71

double power, dist, time, speed, frac;

games/trek/warp.c

86

dist = d;

games/trek/warp.c

89

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

lib/libz/deflate.h

310

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

lib/libz/deflate.h

318

#define d_code(dist) \

lib/libz/deflate.h

319

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

lib/libz/deflate.h

346

ush dist = (ush)(distance); \

lib/libz/deflate.h

347

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

lib/libz/deflate.h

349

dist--; \

lib/libz/deflate.h

351

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

lib/libz/deflate.h

365

ush dist = (ush)(distance); \

lib/libz/deflate.h

366

s->sym_buf[s->sym_next++] = (uch)dist; \

lib/libz/deflate.h

367

s->sym_buf[s->sym_next++] = (uch)(dist >> 8); \

lib/libz/deflate.h

369

dist--; \

lib/libz/deflate.h

371

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

lib/libz/inffast.c

145

dist = (unsigned)(here->val);

lib/libz/inffast.c

155

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

lib/libz/inffast.c

157

if (dist > dmax) {

lib/libz/inffast.c

166

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

lib/libz/inffast.c

168

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

lib/libz/inffast.c

169

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

lib/libz/inffast.c

193

from = out - dist;

lib/libz/inffast.c

209

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

lib/libz/inffast.c

227

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

lib/libz/inffast.c

238

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

lib/libz/inffast.c

254

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

lib/libz/inffast.c

74

unsigned dist; /* match distance */

lib/libz/inflate.c

254

unsigned dist;

lib/libz/inflate.c

280

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

lib/libz/inflate.c

281

if (dist > copy) dist = copy;

lib/libz/inflate.c

282

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

lib/libz/inflate.c

283

copy -= dist;

lib/libz/inflate.c

290

state->wnext += dist;

lib/libz/inflate.c

292

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

lib/libz/trees.c

1093

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

lib/libz/trees.c

1095

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

lib/libz/trees.c

1098

s->sym_buf[s->sym_next++] = (uch)dist;

lib/libz/trees.c

1099

s->sym_buf[s->sym_next++] = (uch)(dist >> 8);

lib/libz/trees.c

1102

if (dist == 0) {

lib/libz/trees.c

1108

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

lib/libz/trees.c

1109

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

lib/libz/trees.c

1111

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

lib/libz/trees.c

1114

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

lib/libz/trees.c

300

int dist; /* distance index */

lib/libz/trees.c

331

dist = 0;

lib/libz/trees.c

333

base_dist[code] = dist;

lib/libz/trees.c

335

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

lib/libz/trees.c

338

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

lib/libz/trees.c

339

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

lib/libz/trees.c

341

base_dist[code] = dist << 7;

lib/libz/trees.c

343

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

lib/libz/trees.c

346

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

lib/libz/trees.c

900

unsigned dist; /* distance of matched string */

lib/libz/trees.c

908

dist = s->d_buf[sx];

lib/libz/trees.c

911

dist = s->sym_buf[sx++] & 0xff;

lib/libz/trees.c

912

dist += (unsigned)(s->sym_buf[sx++] & 0xff) << 8;

lib/libz/trees.c

915

if (dist == 0) {

lib/libz/trees.c

927

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

lib/libz/trees.c

928

code = d_code(dist);

lib/libz/trees.c

934

dist -= (unsigned)base_dist[code];

lib/libz/trees.c

935

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

sys/dev/pci/drm/amd/amdgpu/mmhub_v9_4.c

595

int dist = mmDAGB1_CNTL_MISC2 - mmDAGB0_CNTL_MISC2;

sys/dev/pci/drm/amd/amdgpu/mmhub_v9_4.c

615

j * dist);

sys/dev/pci/drm/amd/amdgpu/mmhub_v9_4.c

639

j * dist, data1);

sys/dev/wscons/wstpad.c

645

int dx, dy, dist, limit;

sys/dev/wscons/wstpad.c

653

dist = (dx >= dy ? dx + 3 * dy / 8 : dy + 3 * dx / 8);

sys/dev/wscons/wstpad.c

657

if (dist > limit)

sys/dev/wscons/wstpad.c

708

int dx, dy, dist = 0;

sys/dev/wscons/wstpad.c

713

dist = (dx >= dy ? dx + 3 * dy / 8 : dy + 3 * dx / 8);

sys/dev/wscons/wstpad.c

715

tp->tap.valid = (CENTERED(t) && dist <= (tp->tap.maxdist << 12));

sys/kern/exec_subr.c

378

vsize_t dist = 0;

sys/kern/exec_subr.c

390

dist = USRSTACK - MAXSSIZ - MAXSSIZ_GUARD - VM_MIN_STACK_ADDRESS;

sys/kern/exec_subr.c

391

if (dist >> PAGE_SHIFT > 0xffffffff)

sys/kern/exec_subr.c

392

dist = (vsize_t)arc4random() << PAGE_SHIFT;

sys/kern/exec_subr.c

394

dist = (vsize_t)arc4random_uniform(dist >> PAGE_SHIFT) << PAGE_SHIFT;

sys/kern/exec_subr.c

397

dist = arc4random() & (stackgap_random - 1);

sys/kern/exec_subr.c

398

dist = trunc_page(dist);

sys/kern/exec_subr.c

403

epp->ep_maxsaddr += dist;

sys/kern/exec_subr.c

404

epp->ep_minsaddr += dist;

sys/kern/exec_subr.c

406

epp->ep_maxsaddr -= dist;

sys/kern/exec_subr.c

407

epp->ep_minsaddr -= dist;

sys/lib/libz/deflate.h

310

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

sys/lib/libz/deflate.h

318

#define d_code(dist) \

sys/lib/libz/deflate.h

319

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

sys/lib/libz/deflate.h

346

ush dist = (ush)(distance); \

sys/lib/libz/deflate.h

347

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

sys/lib/libz/deflate.h

349

dist--; \

sys/lib/libz/deflate.h

351

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

sys/lib/libz/deflate.h

365

ush dist = (ush)(distance); \

sys/lib/libz/deflate.h

366

s->sym_buf[s->sym_next++] = (uch)dist; \

sys/lib/libz/deflate.h

367

s->sym_buf[s->sym_next++] = (uch)(dist >> 8); \

sys/lib/libz/deflate.h

369

dist--; \

sys/lib/libz/deflate.h

371

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

sys/lib/libz/inffast.c

145

dist = (unsigned)(here->val);

sys/lib/libz/inffast.c

155

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

sys/lib/libz/inffast.c

157

if (dist > dmax) {

sys/lib/libz/inffast.c

166

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

sys/lib/libz/inffast.c

168

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

sys/lib/libz/inffast.c

169

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

sys/lib/libz/inffast.c

193

from = out - dist;

sys/lib/libz/inffast.c

209

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

sys/lib/libz/inffast.c

227

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

sys/lib/libz/inffast.c

238

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

sys/lib/libz/inffast.c

254

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

sys/lib/libz/inffast.c

74

unsigned dist; /* match distance */

sys/lib/libz/inflate.c

254

unsigned dist;

sys/lib/libz/inflate.c

280

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

sys/lib/libz/inflate.c

281

if (dist > copy) dist = copy;

sys/lib/libz/inflate.c

282

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

sys/lib/libz/inflate.c

283

copy -= dist;

sys/lib/libz/inflate.c

290

state->wnext += dist;

sys/lib/libz/inflate.c

292

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

sys/lib/libz/trees.c

1093

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

sys/lib/libz/trees.c

1095

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

sys/lib/libz/trees.c

1098

s->sym_buf[s->sym_next++] = (uch)dist;

sys/lib/libz/trees.c

1099

s->sym_buf[s->sym_next++] = (uch)(dist >> 8);

sys/lib/libz/trees.c

1102

if (dist == 0) {

sys/lib/libz/trees.c

1108

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

sys/lib/libz/trees.c

1109

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

sys/lib/libz/trees.c

1111

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

sys/lib/libz/trees.c

1114

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

sys/lib/libz/trees.c

300

int dist; /* distance index */

sys/lib/libz/trees.c

331

dist = 0;

sys/lib/libz/trees.c

333

base_dist[code] = dist;

sys/lib/libz/trees.c

335

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

sys/lib/libz/trees.c

338

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

sys/lib/libz/trees.c

339

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

sys/lib/libz/trees.c

341

base_dist[code] = dist << 7;

sys/lib/libz/trees.c

343

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

sys/lib/libz/trees.c

346

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

sys/lib/libz/trees.c

900

unsigned dist; /* distance of matched string */

sys/lib/libz/trees.c

908

dist = s->d_buf[sx];

sys/lib/libz/trees.c

911

dist = s->sym_buf[sx++] & 0xff;

sys/lib/libz/trees.c

912

dist += (unsigned)(s->sym_buf[sx++] & 0xff) << 8;

sys/lib/libz/trees.c

915

if (dist == 0) {

sys/lib/libz/trees.c

927

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

sys/lib/libz/trees.c

928

code = d_code(dist);

sys/lib/libz/trees.c

934

dist -= (unsigned)base_dist[code];

sys/lib/libz/trees.c

935

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

sys/uvm/uvm_addr.c

924

vsize_t dist;

sys/uvm/uvm_addr.c

950

dist = MAX((maxaddr - minaddr) / 32, 2 * (vaddr_t)PAGE_SIZE);

sys/uvm/uvm_addr.c

951

if (dist >> PAGE_SHIFT > 0xffffffff) {

sys/uvm/uvm_addr.c

955

minaddr += (vsize_t)arc4random_uniform(dist >> PAGE_SHIFT) <<

sys/uvm/uvm_addr.c

957

maxaddr -= (vsize_t)arc4random_uniform(dist >> PAGE_SHIFT) <<

usr.bin/mandoc/mdoc_validate.c

2442

int dist = 0;

usr.bin/mandoc/mdoc_validate.c

2450

if (++dist > maxdist)

usr.bin/mandoc/mdoc_validate.c

2465

dist += strlen(s1) + strlen(s2);

usr.bin/mandoc/mdoc_validate.c

2466

return dist > maxdist ? INT_MAX : dist;

usr.bin/mandoc/mdoc_validate.c

2475

int dist, mindist;

usr.bin/mandoc/mdoc_validate.c

2522

dist = similar(nch->string, *testsec);

usr.bin/mandoc/mdoc_validate.c

2523

if (dist < mindist) {

usr.bin/mandoc/mdoc_validate.c

2525

mindist = dist;

usr.bin/split/split.c

176

ssize_t bcnt, dist, len;

usr.bin/split/split.c

190

dist = bytecnt - bcnt;

usr.bin/split/split.c

191

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

usr.bin/split/split.c

193

len -= dist;

usr.bin/split/split.c

194

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