bin/cpdup/cpdup.c

1393

char *nl, *next;

bin/cpdup/cpdup.c

1412

for (next = buf; (nl = strchr(next, '\n')); next = nl+1) {

bin/cpdup/cpdup.c

1414

AddList(list, next, 1, NULL);

bin/cpdup/cpdup.c

1416

bufused = strlen(next);

bin/cpdup/cpdup.c

1418

bcopy(next, buf, bufused);

bin/cpdup/cpdup.c

527

for (hl = hltable[n]; hl; hl = hl->next) {

bin/cpdup/cpdup.c

557

new->next = hltable[n];

bin/cpdup/cpdup.c

577

if (hl->next)

bin/cpdup/cpdup.c

578

hl->next->prev = hl->prev;

bin/cpdup/cpdup.c

579

hl->prev->next = hl->next;

bin/cpdup/cpdup.c

581

if (hl->next)

bin/cpdup/cpdup.c

582

hl->next->prev = NULL;

bin/cpdup/cpdup.c

584

hltable[hl->ino & HLMASK] = hl->next;

bin/cpdup/cpdup.c

91

struct hlink *next;

bin/cpdup/hclink.c

418

hnew->next = hd;

bin/cpdup/hclink.c

428

for (hd = hc->hostdescs; hd; hd = hd->next) {

bin/cpdup/hclink.c

441

for (hdp = &hc->hostdescs; (hd = *hdp) != NULL; hdp = &hd->next) {

bin/cpdup/hclink.c

447

*hdp = hd->next;

bin/cpdup/hclink.c

458

hd->next = hc->hostdescs;

bin/cpdup/hclink.h

14

struct HCHostDesc *next;

bin/cpdup/misc.c

107

struct malloc_info *next;

bin/cpdup/misc.c

126

info->next = InfoList;

bin/cpdup/misc.c

128

info->next->prev = info;

bin/cpdup/misc.c

129

info->prev->next = info;

bin/cpdup/misc.c

140

for (scan = DummyInfo.next; scan != &DummyInfo; scan = scan->next) {

bin/cpdup/misc.c

144

info->next->prev = info->prev;

bin/cpdup/misc.c

145

info->prev->next = info->next;

bin/cpdup/misc.c

155

for (scan = DummyInfo.next; scan != &DummyInfo; scan = scan->next) {

bin/date/vary.c

436

for (v = vb; v; v = v->next) {

bin/date/vary.c

650

n = v->next;

bin/date/vary.c

90

while (v->next)

bin/date/vary.c

91

v = v->next;

bin/date/vary.c

92

nextp = &v->next;

bin/date/vary.c

99

(*nextp)->next = NULL;

bin/date/vary.h

32

struct vary *next;

bin/hostname/hostname.c

111

char *buf, *next, *p;

bin/hostname/hostname.c

193

for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {

bin/hostname/hostname.c

194

rtm = (struct rt_msghdr *)(void *)next;

bin/hostname/hostname.c

226

next = buf + needed;

bin/hostname/hostname.c

237

next = buf + needed;

bin/mined/mined.h

132

struct Line *next;

bin/mined/mined1.c

1311

for (line = header->next; line != tail; line = next_line) {

bin/mined/mined1.c

1312

next_line = line->next;

bin/mined/mined1.c

1318

line->next = line->prev = line;

bin/mined/mined1.c

1394

cur_line = header->next;

bin/mined/mined1.c

1401

reset(header->next, 0); /* Initialize pointers */

bin/mined/mined1.c

1404

display (0, 0, header->next, last_y);

bin/mined/mined1.c

1503

header->next = tail->prev = header;

bin/mined/mined1.c

1721

LINE *line = header->next;

bin/mined/mined1.c

1726

line = line->next;

bin/mined/mined1.c

1748

for (line = header->next; line != tail; line = line->next)

bin/mined/mined1.c

531

for (line = header->next; line != tail; line = line->next) {

bin/mined/mined1.c

533

if (line->next == tail && line->text[0] == '\n')

bin/mined/mined1.c

626

line = line->next;

bin/mined/mined1.c

762

line = line->next;

bin/mined/mined1.c

888

&& line->next != tail; last_y++)

bin/mined/mined1.c

889

line = line->next;

bin/mined/mined1.c

964

line = line->next;

bin/mined/mined2.c

1009

for (line = header->next; line != tail; line = line->next) {

bin/mined/mined2.c

1070

line = line->next;

bin/mined/mined2.c

119

if (bot_line->next == tail && bot_line->text[0] != '\n') {

bin/mined/mined2.c

1297

line = line->next;

bin/mined/mined2.c

1417

for (line = top_line; line != match_line && line != bot_line->next;

bin/mined/mined2.c

1418

line = line->next)

bin/mined/mined2.c

1420

if (line != bot_line->next)

bin/mined/mined2.c

1427

for (line = header->next; line != match_line; line = line->next)

bin/mined/mined2.c

1429

line = header->next;

bin/mined/mined2.c

156

if (cur_line->next != tail) { /* Last char of file */

bin/mined/mined2.c

1664

line = (method == FORWARD) ? line->next : line->prev;

bin/mined/mined2.c

1842

bot_line = bot_line->next;

bin/mined/mined2.c

213

if (number <= 0 || (line = proceed(header->next, number - 1)) == tail)

bin/mined/mined2.c

274

reset(header->next, 0);/* Reset top_line, etc. */

bin/mined/mined2.c

335

if (bot_line->next == tail) /* Last line of file. No dice */

bin/mined/mined2.c

337

top_line = top_line->next;

bin/mined/mined2.c

338

bot_line = bot_line->next;

bin/mined/mined2.c

339

cur_line = cur_line->next;

bin/mined/mined2.c

461

if (*textp == '\n' && cur_line->next != tail) {

bin/mined/mined2.c

485

delete(cur_line,cur_text, cur_line->next,cur_line->next->text);

bin/mined/mined2.c

620

new_line->next = line->next;

bin/mined/mined2.c

621

line->next = new_line;

bin/mined/mined2.c

622

new_line->next->prev = new_line;

bin/mined/mined2.c

675

LINE *next_line = line->next;

bin/mined/mined2.c

678

line->prev->next = line->next;

bin/mined/mined2.c

679

line->next->prev = line->prev;

bin/mined/mined2.c

726

line = start_line->next;

bin/mined/mined2.c

727

stop = end_line->next;

bin/mined/mined2.c

736

line_delete(start_line->next);

bin/mined/mined2.c

848

line = line->next;

bin/mined/mined2.c

863

while (page != line && page != bot_line->next)

bin/mined/mined2.c

864

page = page->next;

bin/mined/mined2.c

865

if (page != bot_line->next || old_pos == TRUE)

bin/mined/mined2.c

872

move_to(0, find_y(line->next));

bin/sh/alias.c

107

*app = ap->next;

bin/sh/alias.c

132

app = &(*app)->next;

bin/sh/alias.c

134

*app = ap->next;

bin/sh/alias.c

150

for (ap = *hashalias(name); ap; ap = ap->next) {

bin/sh/alias.c

188

for (ap = atab[i]; ap; ap = ap->next)

bin/sh/alias.c

73

ap->next = *app;

bin/sh/alias.c

94

for (ap = *app; ap; app = &(ap->next), ap = ap->next) {

bin/sh/alias.h

39

struct alias *next;

bin/sh/eval.c

194

union node *next;

bin/sh/eval.c

205

next = NULL;

bin/sh/eval.c

215

next = n->nbinary.ch2;

bin/sh/eval.c

222

next = n->nbinary.ch2;

bin/sh/eval.c

228

next = n->nbinary.ch2;

bin/sh/eval.c

245

next = n->nif.ifpart;

bin/sh/eval.c

247

next = n->nif.elsepart;

bin/sh/eval.c

260

next = evalcase(n);

bin/sh/eval.c

263

next = n->nclist.body;

bin/sh/eval.c

271

next = n->nclist.next;

bin/sh/eval.c

274

defun(n->narg.text, n->narg.next);

bin/sh/eval.c

297

n = next;

bin/sh/eval.c

358

for (argp = n->nfor.args ; argp ; argp = argp->narg.next) {

bin/sh/eval.c

400

for (cp = n->ncase.cases ; cp ; cp = cp->nclist.next) {

bin/sh/eval.c

401

for (patp = cp->nclist.pattern ; patp ; patp = patp->narg.next) {

bin/sh/eval.c

403

while (cp->nclist.next &&

bin/sh/eval.c

406

cp = cp->nclist.next;

bin/sh/eval.c

407

if (cp->nclist.next &&

bin/sh/eval.c

532

for (redir = n ; redir ; redir = redir->nfile.next) {

bin/sh/eval.c

578

for (lp = n->npipe.cmdlist ; lp ; lp = lp->next)

bin/sh/eval.c

583

for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {

bin/sh/eval.c

586

if (lp->next) {

bin/sh/eval.c

740

arg = &arg->next->narg;

bin/sh/eval.c

855

for (argp = cmd->ncmd.args ; argp ; argp = argp->narg.next) {

bin/sh/exec.c

279

for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {

bin/sh/exec.c

538

*pp = cmdp->next;

bin/sh/exec.c

541

pp = &cmdp->next;

bin/sh/exec.c

575

for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {

bin/sh/exec.c

578

pp = &cmdp->next;

bin/sh/exec.c

584

cmdp->next = NULL;

bin/sh/exec.c

604

*lastcmdentry = cmdp->next;

bin/sh/exec.c

85

struct tblentry *next; /* next entry in hash chain */

bin/sh/expand.c

1541

for (n = args; n != NULL; n = n->narg.next) {

bin/sh/expand.c

1549

for (n = args; n != NULL; n = n->narg.next)

bin/sh/expand.c

324

*argbackq = (*argbackq)->next;

bin/sh/expand.c

816

*argbackq = (*argbackq)->next;

bin/sh/jobs.c

111

struct job *next; /* job used after this one */

bin/sh/jobs.c

1415

for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {

bin/sh/jobs.c

1417

if (lp->next)

bin/sh/jobs.c

1466

for (np = n->ncmd.args ; np ; np = np->narg.next) {

bin/sh/jobs.c

1468

if (np->narg.next)

bin/sh/jobs.c

1471

for (np = n->ncmd.redirect ; np ; np = np->nfile.next) {

bin/sh/jobs.c

781

if (jp[i].next != NULL)

bin/sh/jobs.c

782

jp[i].next = &jp[jp[i].next -

bin/sh/jobs.c

813

jp->next = NULL;

bin/sh/jobs.c

832

for (prev = NULL, jp = jobmru; jp != NULL; prev = jp, jp = jp->next) {

bin/sh/jobs.c

835

prev->next = jp->next;

bin/sh/jobs.c

837

jobmru = jp->next;

bin/sh/jobs.c

838

jp->next = jobmru;

bin/sh/jobs.c

843

cj->next = jobmru;

bin/sh/jobs.c

852

for (prev = NULL, jp = jobmru; jp != NULL; prev = jp, jp = jp->next) {

bin/sh/jobs.c

855

prev->next = jp->next;

bin/sh/jobs.c

857

jobmru = jp->next;

bin/sh/jobs.c

873

for (jp = jobmru; jp != NULL; jp = jp->next)

bin/sh/jobs.c

877

for (jp = jobmru; jp != NULL; jp = jp->next)

bin/sh/parser.c

1179

nlpp = &(*nlpp)->next;

bin/sh/parser.c

1181

(*nlpp)->next = NULL;

bin/sh/parser.c

1221

while (here->next != NULL)

bin/sh/parser.c

1222

here = here->next;

bin/sh/parser.c

1223

here->next = heredoclist;

bin/sh/parser.c

146

t->next = parser_temp;

bin/sh/parser.c

178

parser_temp = t->next;

bin/sh/parser.c

197

parser_temp = t->next;

bin/sh/parser.c

2182

n.narg.next = NULL;

bin/sh/parser.c

266

pnext = &n->narg.next;

bin/sh/parser.c

399

prev->next = lp;

bin/sh/parser.c

401

lp->next = NULL;

bin/sh/parser.c

435

rpp = &n2->nfile.next;

bin/sh/parser.c

490

app = &n2->narg.next;

bin/sh/parser.c

504

n2->narg.next = NULL;

bin/sh/parser.c

545

app = &ap->narg.next;

bin/sh/parser.c

548

ap->narg.next = NULL;

bin/sh/parser.c

563

cpp = &cp->nclist.next;

bin/sh/parser.c

607

rpp = &n2->nfile.next;

bin/sh/parser.c

656

app = &n->narg.next;

bin/sh/parser.c

661

rpp = &n->nfile.next;

bin/sh/parser.c

663

} else if (lasttoken == TLP && app == &args->narg.next

bin/sh/parser.c

684

n->narg.next = command();

bin/sh/parser.c

708

n->narg.next = NULL;

bin/sh/parser.c

774

here->next = NULL;

bin/sh/parser.c

778

for (p = heredoclist ; p->next ; p = p->next);

bin/sh/parser.c

779

p->next = here;

bin/sh/parser.c

801

heredoclist = here->next;

bin/sh/parser.c

86

struct heredoc *next; /* next here document in list */

bin/sh/parser.c

93

struct parser_temp *next;

bin/sh/pregenerated/nodes.c

184

calcsize(n->nclist.next, result);

bin/sh/pregenerated/nodes.c

190

calcsize(n->narg.next, result);

bin/sh/pregenerated/nodes.c

198

calcsize(n->nfile.next, result);

bin/sh/pregenerated/nodes.c

203

calcsize(n->ndup.next, result);

bin/sh/pregenerated/nodes.c

208

calcsize(n->nhere.next, result);

bin/sh/pregenerated/nodes.c

224

lp = lp->next;

bin/sh/pregenerated/nodes.c

280

new->nclist.next = copynode(n->nclist.next, state);

bin/sh/pregenerated/nodes.c

286

new->narg.next = copynode(n->narg.next, state);

bin/sh/pregenerated/nodes.c

294

new->nfile.next = copynode(n->nfile.next, state);

bin/sh/pregenerated/nodes.c

301

new->ndup.next = copynode(n->ndup.next, state);

bin/sh/pregenerated/nodes.c

307

new->nhere.next = copynode(n->nhere.next, state);

bin/sh/pregenerated/nodes.c

331

lp = lp->next;

bin/sh/pregenerated/nodes.c

332

lpp = &(*lpp)->next;

bin/sh/pregenerated/nodes.h

105

union node *next;

bin/sh/pregenerated/nodes.h

114

union node *next;

bin/sh/pregenerated/nodes.h

123

union node *next;

bin/sh/pregenerated/nodes.h

154

struct nodelist *next;

bin/sh/pregenerated/nodes.h

88

union node *next;

bin/sh/pregenerated/nodes.h

96

union node *next;

bin/sh/redir.c

131

sv->next = redirlist;

bin/sh/redir.c

136

for (n = redir ; n ; n = n->nfile.next) {

bin/sh/redir.c

340

redirlist = rp->next;

bin/sh/redir.c

362

for (rp = redirlist ; rp ; rp = rp->next) {

bin/sh/redir.c

72

struct redirtab *next;

bin/sh/show.c

103

for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {

bin/sh/show.c

105

if (lp->next)

bin/sh/show.c

132

for (np = cmd->ncmd.args ; np ; np = np->narg.next) {

bin/sh/show.c

138

for (np = cmd->ncmd.redirect ; np ; np = np->nfile.next) {

bin/sh/var.c

170

vp->next = *vpp;

bin/sh/var.c

180

vps1.next = *vpp;

bin/sh/var.c

387

vp->next = *vpp;

bin/sh/var.c

560

for (vp = *vpp ; vp ; vp = vp->next)

bin/sh/var.c

566

for (vp = *vpp ; vp ; vp = vp->next)

bin/sh/var.c

610

for (vp = *vpp; vp; vp = vp->next) {

bin/sh/var.c

620

for (vp = *vpp; vp; vp = vp->next) {

bin/sh/var.c

696

for (vp = *vpp ; vp ; vp = vp->next) {

bin/sh/var.c

784

lvp->next = localvars;

bin/sh/var.c

803

localvars = lvp->next;

bin/sh/var.c

909

*vpp = vp->next;

bin/sh/var.c

961

for (vp = *vpp ; vp ; vpp = &vp->next, vp = *vpp) {

bin/sh/var.h

55

struct var *next; /* next entry in hash list */

bin/sh/var.h

66

struct localvar *next; /* next local variable in list */

crypto/libressl/apps/openssl/certhash.c

141

while (hi->next != NULL)

crypto/libressl/apps/openssl/certhash.c

142

hi = hi->next;

crypto/libressl/apps/openssl/certhash.c

143

hi->next = entry;

crypto/libressl/apps/openssl/certhash.c

151

struct hashinfo *next;

crypto/libressl/apps/openssl/certhash.c

154

next = hi->next;

crypto/libressl/apps/openssl/certhash.c

156

hi = next;

crypto/libressl/apps/openssl/certhash.c

167

hi = hi->next;

crypto/libressl/apps/openssl/certhash.c

186

for (entry = *head, i = 0; entry != NULL; entry = entry->next, i++)

crypto/libressl/apps/openssl/certhash.c

192

entry->next = list[i];

crypto/libressl/apps/openssl/certhash.c

195

entry->next = NULL;

crypto/libressl/apps/openssl/certhash.c

385

for (link = links; link != NULL; link = link->next) {

crypto/libressl/apps/openssl/certhash.c

407

for (entry = head; entry != NULL; entry = entry->next) {

crypto/libressl/apps/openssl/certhash.c

445

for (cert = *certs; cert != NULL; cert = cert->next) {

crypto/libressl/apps/openssl/certhash.c

450

for (crl = *crls; crl != NULL; crl = crl->next) {

crypto/libressl/apps/openssl/certhash.c

457

for (cert = *certs; cert != NULL; cert = cert->next) {

crypto/libressl/apps/openssl/certhash.c

463

for (crl = *crls; crl != NULL; crl = crl->next) {

crypto/libressl/apps/openssl/certhash.c

593

for (link = links; link != NULL; link = link->next) {

crypto/libressl/apps/openssl/certhash.c

611

for (link = links; link != NULL; link = link->next) {

crypto/libressl/apps/openssl/certhash.c

68

struct hashinfo *next;

crypto/libressl/apps/openssl/cms.c

105

struct cms_key_param *next;

crypto/libressl/apps/openssl/cms.c

1478

kparam = kparam->next) {

crypto/libressl/apps/openssl/cms.c

1595

kparam = kparam->next) {

crypto/libressl/apps/openssl/cms.c

1772

tparam = cms_config.key_param->next;

crypto/libressl/apps/openssl/cms.c

287

nparam->next = NULL;

crypto/libressl/apps/openssl/cms.c

291

cms_config.key_param->next = nparam;

crypto/libressl/crypto/asn1/bio_asn1.c

124

asn1_ps_func *cleanup, asn1_bio_state_t next);

crypto/libressl/crypto/asn1/bio_asn1.c

285

asn1_bio_state_t next)

crypto/libressl/crypto/asn1/bio_asn1.c

303

ctx->state = next;

crypto/libressl/crypto/bio/bio_lib.c

717

BIO_set_next(BIO *b, BIO *next)

crypto/libressl/crypto/bio/bio_lib.c

719

b->next_bio = next;

crypto/libressl/crypto/bn/bn_ctx.c

171

item = item->next;

crypto/libressl/crypto/bn/bn_ctx.c

257

pool = pool->next;

crypto/libressl/crypto/bn/bn_ctx.c

406

p->current = p->head->next;

crypto/libressl/crypto/bn/bn_ctx.c

425

item = item->next;

crypto/libressl/crypto/bn/bn_ctx.c

446

item->next = NULL;

crypto/libressl/crypto/bn/bn_ctx.c

451

p->tail->next = item;

crypto/libressl/crypto/bn/bn_ctx.c

463

p->current = p->current->next;

crypto/libressl/crypto/bn/bn_ctx.c

98

struct bignum_pool_item *prev, *next;

crypto/libressl/crypto/ec/ec_key.c

181

for (d = src->method_data; d != NULL; d = d->next) {

crypto/libressl/crypto/ec/ec_lcl.h

193

struct ec_extra_data_st *next;

crypto/libressl/crypto/ec/ec_lib.c

178

for (d = src->extra_data; d != NULL; d = d->next) {

crypto/libressl/crypto/ec/ec_lib.c

684

for (d = *ex_data; d != NULL; d = d->next) {

crypto/libressl/crypto/ec/ec_lib.c

705

d->next = *ex_data;

crypto/libressl/crypto/ec/ec_lib.c

720

for (d = ex_data; d != NULL; d = d->next) {

crypto/libressl/crypto/ec/ec_lib.c

740

for (p = ex_data; *p != NULL; p = &((*p)->next)) {

crypto/libressl/crypto/ec/ec_lib.c

744

EC_EXTRA_DATA *next = (*p)->next;

crypto/libressl/crypto/ec/ec_lib.c

749

*p = next;

crypto/libressl/crypto/ec/ec_lib.c

767

for (p = ex_data; *p != NULL; p = &((*p)->next)) {

crypto/libressl/crypto/ec/ec_lib.c

771

EC_EXTRA_DATA *next = (*p)->next;

crypto/libressl/crypto/ec/ec_lib.c

776

*p = next;

crypto/libressl/crypto/ec/ec_lib.c

793

EC_EXTRA_DATA *next = d->next;

crypto/libressl/crypto/ec/ec_lib.c

798

d = next;

crypto/libressl/crypto/ec/ec_lib.c

814

EC_EXTRA_DATA *next = d->next;

crypto/libressl/crypto/ec/ec_lib.c

819

d = next;

crypto/libressl/crypto/engine/eng_int.h

198

struct engine_st *next;

crypto/libressl/crypto/engine/eng_list.c

114

iterator = iterator->next;

crypto/libressl/crypto/engine/eng_list.c

134

(engine_list_tail->next != NULL)) {

crypto/libressl/crypto/engine/eng_list.c

138

engine_list_tail->next = e;

crypto/libressl/crypto/engine/eng_list.c

147

e->next = NULL;

crypto/libressl/crypto/engine/eng_list.c

163

iterator = iterator->next;

crypto/libressl/crypto/engine/eng_list.c

169

if (e->next)

crypto/libressl/crypto/engine/eng_list.c

170

e->next->prev = e->prev;

crypto/libressl/crypto/engine/eng_list.c

172

e->prev->next = e->next;

crypto/libressl/crypto/engine/eng_list.c

175

engine_list_head = e->next;

crypto/libressl/crypto/engine/eng_list.c

224

ret = e->next;

crypto/libressl/crypto/engine/eng_list.c

349

iterator = iterator->next;

crypto/libressl/crypto/lhash/lh_stats.c

107

for (n = lh->b[i], num = 0; n != NULL; n = n->next)

crypto/libressl/crypto/lhash/lh_stats.c

122

for (n = lh->b[i], num = 0; n != NULL; n = n->next)

crypto/libressl/crypto/lhash/lh_stats.c

221

for (n = lh->b[i], num = 0; n != NULL; n = n->next)

crypto/libressl/crypto/lhash/lh_stats.c

236

for (n = lh->b[i], num = 0; n != NULL; n = n->next)

crypto/libressl/crypto/lhash/lhash.c

149

nn = n->next;

crypto/libressl/crypto/lhash/lhash.c

177

nn->next = NULL;

crypto/libressl/crypto/lhash/lhash.c

210

*rn = nn->next;

crypto/libressl/crypto/lhash/lhash.c

263

n = a->next;

crypto/libressl/crypto/lhash/lhash.c

308

*n1 = (*n1)->next;

crypto/libressl/crypto/lhash/lhash.c

309

np->next= *n2;

crypto/libressl/crypto/lhash/lhash.c

312

n1 = &((*n1)->next);

crypto/libressl/crypto/lhash/lhash.c

365

while (n1->next != NULL)

crypto/libressl/crypto/lhash/lhash.c

366

n1 = n1->next;

crypto/libressl/crypto/lhash/lhash.c

367

n1->next = np;

crypto/libressl/crypto/lhash/lhash.c

387

for (n1 = *ret; n1 != NULL; n1 = n1->next) {

crypto/libressl/crypto/lhash/lhash.c

391

ret = &(n1->next);

crypto/libressl/crypto/lhash/lhash.c

398

ret = &(n1->next);

crypto/libressl/include/openssl/bio.h

584

void BIO_set_next(BIO *b, BIO *next);

crypto/libressl/include/openssl/lhash.h

80

struct lhash_node_st *next;

crypto/libressl/include/pqueue.h

71

struct _pitem *next;

crypto/libressl/ssl/pqueue.c

107

pitem *curr, *next;

crypto/libressl/ssl/pqueue.c

114

for (curr = NULL, next = pq->items; next != NULL;

crypto/libressl/ssl/pqueue.c

115

curr = next, next = next->next) {

crypto/libressl/ssl/pqueue.c

118

int cmp = memcmp(next->priority, item->priority,

crypto/libressl/ssl/pqueue.c

121

item->next = next;

crypto/libressl/ssl/pqueue.c

126

curr->next = item;

crypto/libressl/ssl/pqueue.c

133

item->next = NULL;

crypto/libressl/ssl/pqueue.c

134

curr->next = item;

crypto/libressl/ssl/pqueue.c

151

pq->items = pq->items->next;

crypto/libressl/ssl/pqueue.c

159

pitem *next;

crypto/libressl/ssl/pqueue.c

161

for (next = pq->items; next != NULL; next = next->next)

crypto/libressl/ssl/pqueue.c

162

if (memcmp(next->priority, prio64be,

crypto/libressl/ssl/pqueue.c

163

sizeof(next->priority)) == 0)

crypto/libressl/ssl/pqueue.c

164

return next;

crypto/libressl/ssl/pqueue.c

185

*item = (*item)->next;

crypto/libressl/ssl/pqueue.c

198

item = item->next;

crypto/libressl/ssl/pqueue.c

81

item->next = NULL;

crypto/libressl/ssl/ssl_ciph.c

1377

for (curr = head; curr != NULL; curr = curr->next) {

crypto/libressl/ssl/ssl_ciph.c

164

struct cipher_order_st *next, *prev;

crypto/libressl/ssl/ssl_ciph.c

610

*head = curr->next;

crypto/libressl/ssl/ssl_ciph.c

612

curr->prev->next = curr->next;

crypto/libressl/ssl/ssl_ciph.c

613

if (curr->next != NULL)

crypto/libressl/ssl/ssl_ciph.c

614

curr->next->prev = curr->prev;

crypto/libressl/ssl/ssl_ciph.c

615

(*tail)->next = curr;

crypto/libressl/ssl/ssl_ciph.c

617

curr->next = NULL;

crypto/libressl/ssl/ssl_ciph.c

629

if (curr->next != NULL)

crypto/libressl/ssl/ssl_ciph.c

630

curr->next->prev = curr->prev;

crypto/libressl/ssl/ssl_ciph.c

632

curr->prev->next = curr->next;

crypto/libressl/ssl/ssl_ciph.c

634

curr->next= *head;

crypto/libressl/ssl/ssl_ciph.c

695

co_list[co_list_num].next = NULL;

crypto/libressl/ssl/ssl_ciph.c

709

co_list[0].next = &co_list[1];

crypto/libressl/ssl/ssl_ciph.c

713

co_list[i].next = &co_list[i + 1];

crypto/libressl/ssl/ssl_ciph.c

720

co_list[co_list_num - 1].next = NULL;

crypto/libressl/ssl/ssl_ciph.c

750

ciph_curr = ciph_curr->next;

crypto/libressl/ssl/ssl_ciph.c

799

CIPHER_ORDER *head, *tail, *curr, *next, *last;

crypto/libressl/ssl/ssl_ciph.c

810

next = tail;

crypto/libressl/ssl/ssl_ciph.c

813

next = head;

crypto/libressl/ssl/ssl_ciph.c

821

curr = next;

crypto/libressl/ssl/ssl_ciph.c

822

next = reverse ? curr->prev : curr->next;

crypto/libressl/ssl/ssl_ciph.c

877

head = curr->next;

crypto/libressl/ssl/ssl_ciph.c

879

curr->prev->next = curr->next;

crypto/libressl/ssl/ssl_ciph.c

883

if (curr->next != NULL)

crypto/libressl/ssl/ssl_ciph.c

884

curr->next->prev = curr->prev;

crypto/libressl/ssl/ssl_ciph.c

886

curr->prev->next = curr->next;

crypto/libressl/ssl/ssl_ciph.c

887

curr->next = NULL;

crypto/libressl/ssl/ssl_ciph.c

913

curr = curr->next;

crypto/libressl/ssl/ssl_ciph.c

929

curr = curr->next;

crypto/libressl/ssl/ssl_locl.h

514

struct ssl_session_st *prev, *next;

crypto/libressl/ssl/ssl_sess.c

1057

if (s->next == NULL || s->prev == NULL)

crypto/libressl/ssl/ssl_sess.c

1060

if (s->next == (SSL_SESSION *)&(ctx->internal->session_cache_tail)) {

crypto/libressl/ssl/ssl_sess.c

1068

s->prev->next =

crypto/libressl/ssl/ssl_sess.c

1074

ctx->internal->session_cache_head = s->next;

crypto/libressl/ssl/ssl_sess.c

1075

s->next->prev =

crypto/libressl/ssl/ssl_sess.c

1079

s->next->prev = s->prev;

crypto/libressl/ssl/ssl_sess.c

1080

s->prev->next = s->next;

crypto/libressl/ssl/ssl_sess.c

1083

s->prev = s->next = NULL;

crypto/libressl/ssl/ssl_sess.c

1089

if (s->next != NULL && s->prev != NULL)

crypto/libressl/ssl/ssl_sess.c

1096

s->next = (SSL_SESSION *)&(ctx->internal->session_cache_tail);

crypto/libressl/ssl/ssl_sess.c

1098

s->next = ctx->internal->session_cache_head;

crypto/libressl/ssl/ssl_sess.c

1099

s->next->prev = s;

crypto/libressl/ssl/ssl_sess.c

230

ss->next = NULL;

crypto/libressl/tls/tls.c

712

nsni = sni->next;

crypto/libressl/tls/tls_config.c

169

nkp = kp->next;

crypto/libressl/tls/tls_config.c

193

while (kp->next != NULL)

crypto/libressl/tls/tls_config.c

194

kp = kp->next;

crypto/libressl/tls/tls_config.c

196

kp->next = keypair;

crypto/libressl/tls/tls_config.c

210

for (kp = config->keypair; kp != NULL; kp = kp->next)

crypto/libressl/tls/tls_internal.h

173

struct tls_sni_ctx *next;

crypto/libressl/tls/tls_internal.h

54

struct tls_keypair *next;

crypto/libressl/tls/tls_server.c

117

for (sni_ctx = ctx->sni_ctx; sni_ctx != NULL; sni_ctx = sni_ctx->next) {

crypto/libressl/tls/tls_server.c

317

if (ctx->config->keypair->next == NULL)

crypto/libressl/tls/tls_server.c

322

for (kp = ctx->config->keypair->next; kp != NULL; kp = kp->next) {

crypto/libressl/tls/tls_server.c

333

sni_ctx = &(*sni_ctx)->next;

crypto/libressl/tls/tls_signer.c

139

skey->next = signer->keys;

crypto/libressl/tls/tls_signer.c

286

for (skey = signer->keys; skey; skey = skey->next)

crypto/libressl/tls/tls_signer.c

31

struct tls_signer_key *next;

crypto/libressl/tls/tls_signer.c

64

signer->keys = skey->next;

crypto/openssh/match.c

274

match_list(const char *client, const char *server, u_int *next)

crypto/openssh/match.c

297

if (next != NULL)

crypto/openssh/match.c

298

*next = (cp == NULL) ?

crypto/openssh/match.c

306

if (next != NULL)

crypto/openssh/match.c

307

*next = strlen(c);

crypto/openssh/nchan.c

103

chan_set_ostate(Channel *c, u_int next)

crypto/openssh/nchan.c

105

if (c->ostate > CHAN_OUTPUT_CLOSED || next > CHAN_OUTPUT_CLOSED)

crypto/openssh/nchan.c

106

fatal("chan_set_ostate: bad state %d -> %d", c->ostate, next);

crypto/openssh/nchan.c

108

ostates[next]);

crypto/openssh/nchan.c

109

c->ostate = next;

crypto/openssh/nchan.c

93

chan_set_istate(Channel *c, u_int next)

crypto/openssh/nchan.c

95

if (c->istate > CHAN_INPUT_CLOSED || next > CHAN_INPUT_CLOSED)

crypto/openssh/nchan.c

96

fatal("chan_set_istate: bad state %d -> %d", c->istate, next);

crypto/openssh/nchan.c

98

istates[next]);

crypto/openssh/nchan.c

99

c->istate = next;

crypto/openssh/packet.c

116

TAILQ_ENTRY(packet) next;

crypto/openssh/packet.c

1370

TAILQ_INSERT_TAIL(&state->outgoing, p, next);

crypto/openssh/packet.c

1411

TAILQ_REMOVE(&state->outgoing, p, next);

crypto/openssh/packet.h

48

TAILQ_ENTRY(key_entry) next;

crypto/openssh/scp.c

1416

goto next;

crypto/openssh/scp.c

1420

goto next;

crypto/openssh/scp.c

1429

goto next;

crypto/openssh/scp.c

1434

goto next;

crypto/openssh/scp.c

1443

goto next;

crypto/openssh/scp.c

1453

goto next;

crypto/openssh/scp.c

1455

next: if (fd != -1) {

crypto/openssh/ssh-agent.c

1014

TAILQ_REMOVE(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

1032

TAILQ_REMOVE(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

1051

nxt = TAILQ_NEXT(id, next);

crypto/openssh/ssh-agent.c

1056

TAILQ_REMOVE(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

140

TAILQ_ENTRY(identity) next;

crypto/openssh/ssh-agent.c

1415

TAILQ_INSERT_TAIL(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

1552

TAILQ_INSERT_TAIL(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

1667

nxt = TAILQ_NEXT(id, next);

crypto/openssh/ssh-agent.c

1672

TAILQ_REMOVE(&idtab->idlist, id, next);

crypto/openssh/ssh-agent.c

580

TAILQ_FOREACH(id, &idtab->idlist, next) {

crypto/openssh/ssh-agent.c

630

TAILQ_FOREACH(id, &idtab->idlist, next) {

crypto/openssh/ssh-keygen.c

1094

goto next;

crypto/openssh/ssh-keygen.c

1165

goto next;

crypto/openssh/ssh-keygen.c

1167

next:

crypto/openssh/ssh-pkcs11-helper.c

100

TAILQ_FOREACH(ki, &pkcs11_keylist, next) {

crypto/openssh/ssh-pkcs11-helper.c

54

TAILQ_ENTRY(pkcs11_keyinfo) next;

crypto/openssh/ssh-pkcs11-helper.c

74

TAILQ_INSERT_TAIL(&pkcs11_keylist, ki, next);

crypto/openssh/ssh-pkcs11-helper.c

83

nxt = TAILQ_NEXT(ki, next);

crypto/openssh/ssh-pkcs11-helper.c

85

TAILQ_REMOVE(&pkcs11_keylist, ki, next);

crypto/openssh/ssh-pkcs11.c

156

TAILQ_REMOVE(&pkcs11_providers, p, next);

crypto/openssh/ssh-pkcs11.c

1659

TAILQ_INSERT_TAIL(&pkcs11_providers, p, next);

crypto/openssh/ssh-pkcs11.c

168

TAILQ_FOREACH(p, &pkcs11_providers, next) {

crypto/openssh/ssh-pkcs11.c

1696

TAILQ_REMOVE(&pkcs11_providers, p, next);

crypto/openssh/ssh-pkcs11.c

183

TAILQ_REMOVE(&pkcs11_providers, p, next);

crypto/openssh/ssh-pkcs11.c

68

TAILQ_ENTRY(pkcs11_provider) next;

crypto/openssh/ssh_api.c

174

TAILQ_REMOVE(&ssh->public_keys, k, next);

crypto/openssh/ssh_api.c

180

TAILQ_REMOVE(&ssh->private_keys, k, next);

crypto/openssh/ssh_api.c

217

TAILQ_INSERT_TAIL(&ssh->private_keys, k_prv, next);

crypto/openssh/ssh_api.c

221

TAILQ_INSERT_TAIL(&ssh->public_keys, k, next);

crypto/openssh/ssh_api.c

227

TAILQ_INSERT_TAIL(&ssh->public_keys, k, next);

crypto/openssh/ssh_api.c

487

TAILQ_FOREACH(k, &ssh->public_keys, next) {

crypto/openssh/ssh_api.c

502

TAILQ_FOREACH(k, &ssh->private_keys, next) {

crypto/openssh/ssh_api.c

517

TAILQ_FOREACH(k, &ssh->public_keys, next) {

crypto/openssh/ssh_api.c

552

TAILQ_FOREACH(k, &ssh->public_keys, next) {

crypto/openssh/sshconnect2.c

1341

TAILQ_FOREACH(private_id, &authctxt->keys, next) {

crypto/openssh/sshconnect2.c

1358

TAILQ_FOREACH(private_id, &authctxt->keys, next) {

crypto/openssh/sshconnect2.c

1701

TAILQ_INSERT_TAIL(&files, id, next);

crypto/openssh/sshconnect2.c

1724

TAILQ_INSERT_TAIL(preferred, id, next);

crypto/openssh/sshconnect2.c

1736

TAILQ_FOREACH(id, &files, next) {

crypto/openssh/sshconnect2.c

1742

TAILQ_REMOVE(&files, id, next);

crypto/openssh/sshconnect2.c

1743

TAILQ_INSERT_TAIL(preferred, id, next);

crypto/openssh/sshconnect2.c

1757

TAILQ_INSERT_TAIL(&agent, id, next);

crypto/openssh/sshconnect2.c

1762

TAILQ_CONCAT(preferred, &agent, next);

crypto/openssh/sshconnect2.c

1766

TAILQ_FOREACH_SAFE(id, &files, next, tmp) {

crypto/openssh/sshconnect2.c

1770

TAILQ_FOREACH(id2, &files, next) {

crypto/openssh/sshconnect2.c

1775

TAILQ_REMOVE(&files, id, next);

crypto/openssh/sshconnect2.c

1776

TAILQ_INSERT_TAIL(preferred, id, next);

crypto/openssh/sshconnect2.c

1783

TAILQ_REMOVE(&files, id, next);

crypto/openssh/sshconnect2.c

1788

TAILQ_CONCAT(preferred, &files, next);

crypto/openssh/sshconnect2.c

1790

TAILQ_FOREACH_SAFE(id, preferred, next, id2) {

crypto/openssh/sshconnect2.c

1811

TAILQ_REMOVE(preferred, id, next);

crypto/openssh/sshconnect2.c

1817

TAILQ_FOREACH_SAFE(id, preferred, next, id2) {

crypto/openssh/sshconnect2.c

1837

TAILQ_REMOVE(&authctxt->keys, id, next);

crypto/openssh/sshconnect2.c

1849

TAILQ_FOREACH(id, &authctxt->keys, next)

crypto/openssh/sshconnect2.c

1871

TAILQ_REMOVE(&authctxt->keys, id, next);

crypto/openssh/sshconnect2.c

1872

TAILQ_INSERT_TAIL(&authctxt->keys, id, next);

crypto/openssh/sshconnect2.c

2306

u_int next;

crypto/openssh/sshconnect2.c

2323

if ((name = match_list(preferred, supported, &next)) == NULL) {

crypto/openssh/sshconnect2.c

2328

preferred += next;

crypto/openssh/sshconnect2.c

302

TAILQ_ENTRY(identity) next;

crypto/openssh/sshconnect2.c

719

TAILQ_FOREACH_REVERSE(id, &authctxt->keys, idlist, next) {

games/adventure/hdr.h

110

struct travlist *next; /* ptr to next list entry */

games/adventure/hdr.h

68

#define FLUSHLF while (next()!=LF)

games/adventure/io.c

200

sect = next() - '0'; /* 1st digit of section number */

games/adventure/io.c

204

if ((ch = next()) != LF) { /* is there a second digit? */

games/adventure/io.c

256

putchar(next());

games/adventure/io.c

272

if ((*s = next()) == TAB || *s == '\n' || *s == LF)

games/adventure/io.c

359

t->next = 0; /* terminate the old entry */

games/adventure/io.c

374

if ((*s = next()) == TAB || *s == LF)

games/adventure/io.c

391

t->next = calloc(1, sizeof(*t));

games/adventure/io.c

392

if (t->next == NULL)

games/adventure/io.c

394

t = t->next;

games/adventure/io.c

413

for (t = travel[loq]; t != 0; t = t->next) {

games/adventure/io.c

439

if ((*s = next()) == TAB || *s == '\n' || *s == LF

games/adventure/io.c

47

static int next(void);

games/adventure/subr.c

189

for (kk = travel[dloc[i]]; kk != 0; kk = kk->next) {

games/adventure/subr.c

327

for (; tkk != 0; tkk = tkk->next)

games/adventure/subr.c

367

for (; tkk != 0; tkk = tkk->next)

games/adventure/subr.c

390

for (; tkk != 0; tkk = tkk->next) { /* 21 */

games/arithmetic/arithmetic.c

284

struct penalty *next;

games/arithmetic/arithmetic.c

302

p->next = penlist[op][operand];

games/arithmetic/arithmetic.c

335

for (pp = &penlist[op][operand]; (p = *pp) != NULL; pp = &p->next) {

games/arithmetic/arithmetic.c

340

p = p->next;

games/atc/graphics.c

323

for (pp = air.head; pp != NULL; pp = pp->next) {

games/atc/graphics.c

331

for (pp = ground.head; pp != NULL; pp = pp->next) {

games/atc/graphics.c

79

for (pp = air.head; pp != NULL; pp = pp->next) {

games/atc/graphics.c

94

for (pp = air.head; pp != NULL; pp = pp->next) {

games/atc/list.c

101

l->head = p->next;

games/atc/list.c

105

l->tail->next = NULL;

games/atc/list.c

107

p->prev->next = p->next;

games/atc/list.c

108

p->next->prev = p->prev;

games/atc/list.c

61

p->next = p->prev = NULL;

games/atc/list.c

68

q = q -> next;

games/atc/list.c

74

r->next = p;

games/atc/list.c

75

p->next = q;

games/atc/list.c

78

p->next = q;

games/atc/list.c

84

l->tail->next = p;

games/atc/list.c

85

p->next = NULL;

games/atc/struct.h

72

struct plane *next, *prev;

games/atc/update.c

183

p2 = pp->next;

games/atc/update.c

192

for (p1 = air.head; p1 != NULL; p1 = p1->next)

games/atc/update.c

193

for (p2 = p1->next; p2 != NULL; p2 = p2->next)

games/atc/update.c

275

for (pp = air.head; pp != NULL; pp = pp->next)

games/atc/update.c

281

for (pp = ground.head; pp != NULL; pp = pp->next)

games/atc/update.c

327

for (p1 = air.head; p1 != NULL; p1 = p1->next)

games/atc/update.c

368

for (pp = air.head; pp != NULL; pp = pp->next)

games/atc/update.c

371

for (pp = ground.head; pp != NULL; pp = pp->next)

games/atc/update.c

67

for (pp = ground.head; pp != NULL; pp = pp->next) {

games/atc/update.c

78

for (pp = air.head; pp != NULL; pp = pp->next) {

games/backgammon/backgammon/move.c

375

struct BOARD *next; /* next move */

games/backgammon/backgammon/move.c

385

next = checkq->b_next;

games/backgammon/backgammon/move.c

387

checkq = next;

games/battlestar/battlestar.c

46

char *next;

games/battlestar/battlestar.c

76

next = getcom(mainbuf, sizeof mainbuf, ">-: ",

games/battlestar/battlestar.c

78

for (wordcount = 0; next && wordcount < NWORD - 1; wordcount++)

games/battlestar/battlestar.c

79

next = getword(next, words[wordcount], -1);

games/battlestar/command7.c

41

char *next;

games/battlestar/command7.c

57

next = getcom(auxbuf, LINELENGTH, "<fight!>-: ", 0);

games/battlestar/command7.c

58

for (i = 0; next && i < 10; i++)

games/battlestar/command7.c

59

next = getword(next, words[i], -1);

games/battlestar/extern.h

319

struct wlist *next;

games/battlestar/parse.c

72

for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next)

games/battlestar/parse.c

85

wp->next = hashtab[hashval];

games/bs/bs.c

1000

next = HUNT_DIRECT;

games/bs/bs.c

1004

next = (hit == S_SUNK) ? RANDOM_FIRE : FIRST_PASS;

games/bs/bs.c

1015

next = (hit == S_SUNK) ? RANDOM_FIRE : FIRST_PASS;

games/bs/bs.c

1018

next = REVERSE_JUMP;

games/bs/bs.c

1028

next = (hit == S_SUNK) ? RANDOM_FIRE : SECOND_PASS;

games/bs/bs.c

1031

next = RANDOM_FIRE;

games/bs/bs.c

1040

next = (hit == S_SUNK) ? RANDOM_FIRE: SECOND_PASS;

games/bs/bs.c

1044

next = RANDOM_FIRE;

games/bs/bs.c

1060

next, x, y, d);

games/bs/bs.c

950

static int next = RANDOM_FIRE;

games/bs/bs.c

955

switch(next)

games/bs/bs.c

961

next = RANDOM_FIRE;

games/bs/bs.c

966

next = (hit == S_SUNK) ? RANDOM_FIRE : RANDOM_HIT;

games/canfield/canfield/canfield.c

1062

for (ptr = talon; ptr != NIL; ptr = ptr->next) {

games/canfield/canfield/canfield.c

1066

for (ptr = hand; ptr != NIL; ptr = ptr->next) {

games/canfield/canfield/canfield.c

1081

for (ptr = stock, row = stockrow; ptr != NIL; ptr = ptr->next, row++) {

games/canfield/canfield/canfield.c

1208

tempcard = tempcard->next;

games/canfield/canfield/canfield.c

1230

temp->next = tableau[des];

games/canfield/canfield/canfield.c

134

struct cardtype *next;

games/canfield/canfield/canfield.c

456

ptr = ptr->next, row++) {

games/canfield/canfield/canfield.c

494

ptr = ptr->next, row++)

games/canfield/canfield/canfield.c

518

cards[i].next = NIL;

games/canfield/canfield/canfield.c

623

*source = (*source)->next;

games/canfield/canfield/canfield.c

624

temp->next = *dest;

games/canfield/canfield/canfield.c

689

deck[i]->next = deck[i - 1];

games/canfield/canfield/canfield.c

690

deck[0]->next = NIL;

games/canfield/canfield/canfield.c

692

deck[13]->next = NIL;

games/canfield/canfield/canfield.c

698

deck[i]->next = NIL;

games/canfield/canfield/canfield.c

706

deck[i]->next = deck[i + 1];

games/canfield/canfield/canfield.c

707

deck[decksize-1]->next = NIL;

games/canfield/canfield/canfield.c

969

ptr = ptr->next ) {

games/canfield/canfield/canfield.c

981

ptr = ptr->next ) {

games/fortune/fortune/fortune.c

1015

for (fp = parent->child; choice--; fp = fp->next)

games/fortune/fortune/fortune.c

1026

fp = fp->next) {

games/fortune/fortune/fortune.c

1052

fp = fp->next;

games/fortune/fortune/fortune.c

1149

for (child = fp->child; child != NULL; child = child->next) {

games/fortune/fortune/fortune.c

1214

list = list->next;

games/fortune/fortune/fortune.c

1290

for (fp = list; fp != NULL; fp = fp->next) {

games/fortune/fortune/fortune.c

1317

for (fp = list; fp != NULL; fp = fp->next) {

games/fortune/fortune/fortune.c

568

(*tail)->next = fp;

games/fortune/fortune/fortune.c

574

fp->next = *head;

games/fortune/fortune/fortune.c

599

fp->next = NULL;

games/fortune/fortune/fortune.c

663

scene->next = obscene;

games/fortune/fortune/fortune.c

664

obscene->next = NULL;

games/fortune/fortune/fortune.c

86

struct fd *next, *prev;

games/fortune/fortune/fortune.c

949

if (File_list->next == NULL || File_list->percent == NO_PROB)

games/fortune/fortune/fortune.c

954

for (fp = File_list; fp->percent != NO_PROB; fp = fp->next)

games/fortune/fortune/fortune.c

969

if (fp->next != NULL) {

games/fortune/fortune/fortune.c

976

fp = fp->next;

games/gomoku/pickmove.c

1275

goto next;

games/gomoku/pickmove.c

1306

next:

games/grdc/grdc.c

190

new[5] = (new[5] & ~mask) | (next[k] & mask);

games/grdc/grdc.c

192

new[k] = (new[k] & ~mask) | (next[k] & mask);

games/grdc/grdc.c

194

next[k] = 0;

games/grdc/grdc.c

300

next[i] |= ((disp[t] >> (4 - i) * 3) & 07) << n;

games/grdc/grdc.c

301

mask |= (next[i] ^ old[i]) & m;

games/grdc/grdc.c

34

static long old[6], next[6], new[6], mask;

games/hunt/huntd/answer.c

129

if ((sp->next = Spawn) != NULL)

games/hunt/huntd/answer.c

130

Spawn->prevnext = &sp->next;

games/hunt/huntd/answer.c

281

*sp->prevnext = sp->next;

games/hunt/huntd/answer.c

282

if (sp->next) sp->next->prevnext = sp->prevnext;

games/hunt/huntd/answer.c

540

for (sp = Spawn; sp; sp = sp->next) {

games/hunt/huntd/driver.c

195

spnext = sp->next;

games/hunt/huntd/driver.c

202

*sp->prevnext = sp->next;

games/hunt/huntd/driver.c

203

if (sp->next)

games/hunt/huntd/driver.c

204

sp->next->prevnext = sp->prevnext;

games/hunt/huntd/server.h

206

struct spawn * next;

games/hunt/huntd/shots.c

1016

move_slime(nbp, speed - 1, next);

games/hunt/huntd/shots.c

1023

move_slime(nbp, speed - 1, next);

games/hunt/huntd/shots.c

1030

move_slime(nbp, speed - 1, next);

games/hunt/huntd/shots.c

1037

move_slime(nbp, speed - 1, next);

games/hunt/huntd/shots.c

115

for (bp = blist; bp != NULL; bp = next) {

games/hunt/huntd/shots.c

116

next = bp->b_next;

games/hunt/huntd/shots.c

170

for (bp = blist; bp != NULL; bp = next) {

games/hunt/huntd/shots.c

171

next = bp->b_next;

games/hunt/huntd/shots.c

191

chkshot(bp, next);

games/hunt/huntd/shots.c

751

chkshot(BULLET *bp, BULLET *next)

games/hunt/huntd/shots.c

771

chkslime(bp, next);

games/hunt/huntd/shots.c

775

chkslime(bp, next);

games/hunt/huntd/shots.c

842

chkslime(BULLET *bp, BULLET *next)

games/hunt/huntd/shots.c

881

conf_lavaspeed, next);

games/hunt/huntd/shots.c

890

move_slime(BULLET *bp, int speed, BULLET *next)

games/hunt/huntd/shots.c

924

explshot(next, bp->b_y, bp->b_x);

games/hunt/huntd/shots.c

94

BULLET *bp, *next;

games/monop/cards.c

306

for (op = cur_p->own_list; op; op = op->next)

games/monop/houses.c

232

while (op->next && op->sqr->desc->mon_desc == mp

games/monop/houses.c

233

&& (op = op->next));

games/monop/houses.c

237

op = op->next;

games/monop/houses.c

64

for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next)

games/monop/houses.c

77

op = op->next;

games/monop/houses.c

83

op = op->next;

games/monop/misc.c

141

op = op->next)

games/monop/misc.c

153

op = op->next) {

games/monop/misc.c

182

op = op->next;

games/monop/misc.c

200

orig_op->next);

games/monop/misc.c

208

printf("op->next = %p\n", op->next);

games/monop/monop.h

111

struct own_st *next; /* next in list */

games/monop/morg.c

115

for (op = cur_p->own_list; op; op = op->next)

games/monop/morg.c

182

for (op = cur_p->own_list; op; op = op->next)

games/monop/print.c

182

for (op = pp->own_list; op; op = op->next) {

games/monop/prop.c

104

for (op = *head; op; op = op->next)

games/monop/prop.c

112

*head = op->next;

games/monop/prop.c

114

last_op->next = op->next;

games/monop/prop.c

210

for (op = plp->own_list; op; op = op->next) {

games/monop/prop.c

68

for (tp = *head; tp && value(tp->sqr) < val; tp = tp->next)

games/monop/prop.c

75

op->next = tp;

games/monop/prop.c

77

last_tp->next = op;

games/monop/trade.c

125

for (op = pp->own_list; propnum--; op = op->next)

games/monop/trade.c

156

for (op = the_list; op; op = op->next)

games/monop/trade.c

186

for (op = tp->prop_list; op; op = op->next)

games/monop/trade.c

221

for (op = from->prop_list; op; op = op->next) {

games/monop/trade.c

291

for (op = cur_p->own_list; op; op = op->next) {

games/quiz/quiz.c

208

int next;

games/quiz/quiz.c

216

next = random() % qsize;

games/quiz/quiz.c

218

for (i = 0; i < next; i++)

games/quiz/quiz.c

223

qsize = next;

games/random/randomize_fd.c

207

for (j = 0, prev = n = rand_root; n != NULL; j++, prev = n, n = n->next) {

games/random/randomize_fd.c

217

rand_root = n->next;

games/random/randomize_fd.c

221

prev->next = n->next;

games/random/randomize_fd.c

55

n->next = NULL;

games/random/randomize_fd.c

74

if (n->next != NULL)

games/random/randomize_fd.c

75

rand_node_free_rec(n->next);

games/random/randomize_fd.c

87

rand_tail->next = n;

games/random/randomize_fd.h

41

struct rand_node *next;

games/sail/dr_main.c

111

if (next() < 0)

games/sail/extern.h

267

int next(void);

games/worm/worm.c

142

head->next = NULL;

games/worm/worm.c

146

np->next = bp;

games/worm/worm.c

235

tail->next->prev = NULL;

games/worm/worm.c

236

nh = tail->next;

games/worm/worm.c

255

nh->next = NULL;

games/worm/worm.c

257

head->next = nh;

games/worm/worm.c

59

struct body *next;

games/wump/wump.c

392

int chance, next, roomcnt;

games/wump/wump.c

421

next = atoi(p);

games/wump/wump.c

423

if (cave[arrow_location].tunnel[j] == next)

games/wump/wump.c

427

if (next > room_num) {

games/wump/wump.c

432

arrow_location = next;

games/wump/wump.c

439

arrow_location, next);

games/wump/wump.c

449

arrow_location, next,

include/res_update.h

38

struct ns_updrec *next;

include/search.h

43

struct que_elem *next;

lib/i18n_module/iconv_std/citrus_iconv_std.c

537

goto next;

lib/i18n_module/iconv_std/citrus_iconv_std.c

567

goto next;

lib/i18n_module/iconv_std/citrus_iconv_std.c

577

next:

lib/libalias/alias_db.c

1356

link->server = link->server->next;

lib/libalias/alias_db.c

1810

link->server = link->server->next;

lib/libalias/alias_db.c

2423

server->next = server;

lib/libalias/alias_db.c

2427

for (s = head; s->next != head; s = s->next);

lib/libalias/alias_db.c

2428

s->next = server;

lib/libalias/alias_db.c

2429

server->next = head;

lib/libalias/alias_db.c

280

struct server *next;

lib/libalias/alias_db.c

922

struct server *head, *curr, *next;

lib/libalias/alias_db.c

926

next = curr->next;

lib/libalias/alias_db.c

928

} while ((curr = next) != head);

lib/libalias/alias_proxy.c

106

struct proxy_entry *next;

lib/libalias/alias_proxy.c

210

entry->next = NULL;

lib/libalias/alias_proxy.c

223

entry->next = proxyList;

lib/libalias/alias_proxy.c

230

ptr_last->next = entry;

lib/libalias/alias_proxy.c

233

entry->next = ptr;

lib/libalias/alias_proxy.c

237

ptr = ptr->next;

lib/libalias/alias_proxy.c

240

ptr_last->next = entry;

lib/libalias/alias_proxy.c

242

entry->next = NULL;

lib/libalias/alias_proxy.c

249

entry->last->next = entry->next;

lib/libalias/alias_proxy.c

251

proxyList = entry->next;

lib/libalias/alias_proxy.c

253

if (entry->next != NULL)

lib/libalias/alias_proxy.c

254

entry->next->last = entry->last;

lib/libalias/alias_proxy.c

271

ptr_next = ptr->next;

lib/libalias/alias_proxy.c

489

ptr = ptr->next;

lib/libc/db/btree/bt_search.c

123

next: BT_PUSH(t, h->pgno, idx);

lib/libc/db/btree/bt_search.c

82

goto next;

lib/libc/db/hash/hash.h

46

BUFHEAD *next; /* LRU links */

lib/libc/db/hash/hash_buf.c

304

bfp->next = bfp;

lib/libc/db/hash/hash_buf.c

72

(B)->prev->next = (B)->next; \

lib/libc/db/hash/hash_buf.c

73

(B)->next->prev = (B)->prev; \

lib/libc/db/hash/hash_buf.c

78

(B)->next = (P)->next; \

lib/libc/db/hash/hash_buf.c

80

(P)->next = (B); \

lib/libc/db/hash/hash_buf.c

81

(B)->next->prev = (B); \

lib/libc/db/hash/hash_buf.c

84

#define MRU hashp->bufhead.next

lib/libc/db/test/btree.tests/main.c

102

"n", 0, 0, next, "next", "move cursor forward one record",

lib/libc/db/test/btree.tests/main.c

75

void next(DB *, char **);

lib/libc/gen/fts.c

389

next: tmp = p;

lib/libc/gen/fts.c

412

goto next;

lib/libc/gen/popen.c

141

SLIST_FOREACH(p, &pidlist, next)

lib/libc/gen/popen.c

162

SLIST_INSERT_HEAD(&pidlist, cur, next);

lib/libc/gen/popen.c

189

SLIST_FOREACH(cur, &pidlist, next) {

lib/libc/gen/popen.c

199

SLIST_REMOVE_HEAD(&pidlist, next);

lib/libc/gen/popen.c

201

SLIST_REMOVE_AFTER(last, next);

lib/libc/gen/popen.c

57

SLIST_ENTRY(pid) next;

lib/libc/include/isc/list.h

100

(elt)->link.next = (before); \

lib/libc/include/isc/list.h

107

if ((after)->link.next == NULL) \

lib/libc/include/isc/list.h

110

(elt)->link.next = (after)->link.next; \

lib/libc/include/isc/list.h

111

(after)->link.next = (elt); \

lib/libc/include/isc/list.h

112

(elt)->link.next->link.prev = (elt); \

lib/libc/include/isc/list.h

30

#define LINK(type) struct { type *prev, *next; }

lib/libc/include/isc/list.h

34

(elt)->link.next = (type *)(-1); \

lib/libc/include/isc/list.h

52

(elt)->link.next = (list).head; \

lib/libc/include/isc/list.h

60

(list).tail->link.next = (elt); \

lib/libc/include/isc/list.h

64

(elt)->link.next = NULL; \

lib/libc/include/isc/list.h

71

if ((elt)->link.next != NULL) \

lib/libc/include/isc/list.h

72

(elt)->link.next->link.prev = (elt)->link.prev; \

lib/libc/include/isc/list.h

78

(elt)->link.prev->link.next = (elt)->link.next; \

lib/libc/include/isc/list.h

81

(list).head = (elt)->link.next; \

lib/libc/include/isc/list.h

89

#define NEXT(elt, link) ((elt)->link.next)

lib/libc/include/isc/list.h

99

(elt)->link.prev->link.next = (elt); \

lib/libc/isc/ev_streams.c

117

new->next = ctx->streams;

lib/libc/isc/ev_streams.c

165

old->prev->next = old->next;

lib/libc/isc/ev_streams.c

167

ctx->streams = old->next;

lib/libc/isc/ev_streams.c

168

if (old->next != NULL)

lib/libc/isc/ev_streams.c

169

old->next->prev = old->prev;

lib/libc/isc/ev_streams.c

83

new->next = ctx->streams;

lib/libc/isc/eventlib_p.h

122

struct evFile * next;

lib/libc/isc/eventlib_p.h

143

struct evStream *prev, *next;

lib/libc/isc/eventlib_p.h

159

struct evWait * next;

lib/libc/isc/eventlib_p.h

166

struct evWaitList * next;

lib/libc/isc/eventlib_p.h

177

struct { struct evEvent_p *next; } free;

lib/libc/isc/eventlib_p.h

88

struct evConn * next;

lib/libc/locale/collate.c

229

int next, compar, l;

lib/libc/locale/collate.c

237

next = (low + high) / 2;

lib/libc/locale/collate.c

238

p = tab + next;

lib/libc/locale/collate.c

249

low = next + 1;

lib/libc/locale/collate.c

251

high = next - 1;

lib/libc/locale/collate.c

261

int next, compar;

lib/libc/locale/collate.c

269

next = (low + high) / 2;

lib/libc/locale/collate.c

270

p = tab + next;

lib/libc/locale/collate.c

275

low = next + 1;

lib/libc/locale/collate.c

277

high = next - 1;

lib/libc/nameser/ns_name.c

766

goto next;

lib/libc/nameser/ns_name.c

771

goto next;

lib/libc/nameser/ns_name.c

777

goto next;

lib/libc/nameser/ns_name.c

787

next: ;

lib/libc/net/getaddrinfo.c

2019

q.next = &q2;

lib/libc/net/getaddrinfo.c

203

struct res_target *next;

lib/libc/net/getaddrinfo.c

2060

if (q.next) {

lib/libc/net/getaddrinfo.c

2377

for (t = target; t; t = t->next) {

lib/libc/net/getaddrinfo.c

322

struct addrinfo *next;

lib/libc/net/getaddrinfo.c

325

next = ai->ai_next;

lib/libc/net/getaddrinfo.c

330

ai = next;

lib/libc/net/getaddrinfo.c

726

goto next; /* not match */

lib/libc/net/getaddrinfo.c

743

next:

lib/libc/net/getifaddrs.c

128

for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {

lib/libc/net/getifaddrs.c

129

rtm = (struct rt_msghdr *)(void *)next;

lib/libc/net/getifaddrs.c

206

for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {

lib/libc/net/getifaddrs.c

207

rtm = (struct rt_msghdr *)(void *)next;

lib/libc/net/getifaddrs.c

81

char *next;

lib/libc/net/name6.c

812

goto next; /* not match */

lib/libc/net/name6.c

829

next:

lib/libc/resolv/res_mkupdate.c

1006

slp_next = slp->next;

lib/libc/resolv/res_mkupdate.c

1035

slp->next = protolist;

lib/libc/resolv/res_mkupdate.c

1050

plp_next = plp->next;

lib/libc/resolv/res_mkupdate.c

1063

for (; lp != NULL; lp = lp->next)

lib/libc/resolv/res_mkupdate.c

1066

lp->prev->next = lp->next;

lib/libc/resolv/res_mkupdate.c

1067

if (lp->next)

lib/libc/resolv/res_mkupdate.c

1068

lp->next->prev = lp->prev;

lib/libc/resolv/res_mkupdate.c

1070

lp->next = *list;

lib/libc/resolv/res_mkupdate.c

1114

for (; lp != NULL; lp = lp->next) {

lib/libc/resolv/res_mkupdate.c

1119

lp->prev->next = lp->next;

lib/libc/resolv/res_mkupdate.c

1120

if (lp->next)

lib/libc/resolv/res_mkupdate.c

1121

lp->next->prev = lp->prev;

lib/libc/resolv/res_mkupdate.c

1123

lp->next = *list;

lib/libc/resolv/res_mkupdate.c

1141

for (; lp != NULL; lp = lp->next)

lib/libc/resolv/res_mkupdate.c

1144

lp->prev->next = lp->next;

lib/libc/resolv/res_mkupdate.c

1145

if (lp->next)

lib/libc/resolv/res_mkupdate.c

1146

lp->next->prev = lp->prev;

lib/libc/resolv/res_mkupdate.c

1148

lp->next = *list;

lib/libc/resolv/res_mkupdate.c

960

struct valuelist * next;

lib/libc/resolv/res_mkupdate.c

991

slp->next = servicelist;

lib/libc/rpc/clnt_bcast.c

191

struct broadif *bip, *next;

lib/libc/rpc/clnt_bcast.c

196

next = TAILQ_NEXT(bip, link);

lib/libc/rpc/clnt_bcast.c

198

bip = next;

lib/libc/rpc/getnetconfig.c

107

struct netconfig_list *next;

lib/libc/rpc/getnetconfig.c

255

else if (ncp->nc_configs != NULL && ncp->nc_configs->next != NULL) {

lib/libc/rpc/getnetconfig.c

256

ncp->nc_configs = ncp->nc_configs->next;

lib/libc/rpc/getnetconfig.c

305

list->next = NULL;

lib/libc/rpc/getnetconfig.c

325

ni.tail->next = list;

lib/libc/rpc/getnetconfig.c

326

ni.tail = ni.tail->next;

lib/libc/rpc/getnetconfig.c

376

p = q->next;

lib/libc/rpc/getnetconfig.c

422

for (list = ni.head; list; list = list->next) {

lib/libc/rpc/pmap_prot2.c

118

next = &((*rp)->pml_next);

lib/libc/rpc/pmap_prot2.c

122

rp = (freeing) ? next : &((*rp)->pml_next);

lib/libc/rpc/pmap_prot2.c

99

struct pmaplist **next = NULL; /* pacify gcc */

lib/libc/rpc/rpcb_prot.c

105

rpcblist_ptr next;

lib/libc/rpc/rpcb_prot.c

108

next = NULL;

lib/libc/rpc/rpcb_prot.c

123

next = (*rp)->rpcb_next;

lib/libc/rpc/rpcb_prot.c

129

next_copy = next;

lib/libc/rpc/rpcb_prot.c

188

rpcb_entry_list_ptr next;

lib/libc/rpc/rpcb_prot.c

191

next = NULL;

lib/libc/rpc/rpcb_prot.c

206

next = (*rp)->rpcb_entry_next;

lib/libc/rpc/rpcb_prot.c

213

next_copy = next;

lib/libc/rpc/rpcb_st_xdr.c

119

if (!xdr_pointer(xdrs, (char **)&objp->next,

lib/libc/rpc/rpcb_st_xdr.c

157

if (!xdr_pointer(xdrs, (char **)&objp->next,

lib/libc/rpc/rpcb_st_xdr.c

185

if (!xdr_pointer(xdrs, (char **)&objp->next,

lib/libc/rpc/rpcb_st_xdr.c

69

pnext = &objp->next;

lib/libc/rpc/svc_auth.c

123

for (asp = Auths; asp; asp = asp->next) {

lib/libc/rpc/svc_auth.c

176

for (asp = Auths; asp; asp = asp->next) {

lib/libc/rpc/svc_auth.c

192

asp->next = Auths;

lib/libc/rpc/svc_auth.c

67

struct authsvc *next;

lib/libc/rpc/svc_generic.c

120

l->next = xprtlist;

lib/libc/rpc/svc_generic.c

78

struct xlist *next; /* Next item */

lib/libc/rpc/svc_generic.c

94

for (l = xprtlist; l; l = l->next) {

lib/libc/stdio/findfp.c

103

g->next = NULL;

lib/libc/stdio/findfp.c

127

for (g = &__sglue; g != NULL; g = g->next) {

lib/libc/stdio/findfp.c

136

SET_GLUE_PTR(lastglue->next, g); /* atomically append glue to list */

lib/libc/stdio/fwalk.c

57

for (g = &__sglue; g != NULL; g = g->next)

lib/libc/stdio/priv_stdio.h

115

struct glue *next;

lib/libc/stdlib/atexit.c

108

p->next = __atexit;

lib/libc/stdlib/atexit.c

186

for (p = __atexit; p; p = p->next) {

lib/libc/stdlib/atexit.c

60

struct atexit *next; /* next in list */

lib/libc/stdlib/dmalloc.c

1098

slab->next = stmp;

lib/libc/stdlib/dmalloc.c

1103

zinfo->avail_base = slab->next;

lib/libc/stdlib/dmalloc.c

1121

slabp = &stmp->next;

lib/libc/stdlib/dmalloc.c

1122

*slabp = slab->next;

lib/libc/stdlib/dmalloc.c

1147

slab->next = stmp->next;

lib/libc/stdlib/dmalloc.c

1157

slab->next = zinfo->empty_base;

lib/libc/stdlib/dmalloc.c

1183

slabp = &(*slabp)->next;

lib/libc/stdlib/dmalloc.c

1184

*slabp = slab->next;

lib/libc/stdlib/dmalloc.c

1192

slab->next = zinfo->empty_base;

lib/libc/stdlib/dmalloc.c

1197

zinfo->empty_base = slab->next;

lib/libc/stdlib/dmalloc.c

1266

zinfo->avail_base = slab->next;

lib/libc/stdlib/dmalloc.c

1605

slab->next = zinfo->empty_base;

lib/libc/stdlib/dmalloc.c

1610

slab->next = zinfo->avail_base;

lib/libc/stdlib/dmalloc.c

1620

zinfo->empty_base = slab->next;

lib/libc/stdlib/dmalloc.c

218

struct slab *next; /* slabs with available space */

lib/libc/stdlib/dmalloc.c

509

zinfo->empty_base = slab->next;

lib/libc/stdlib/dmalloc.c

515

zinfo->avail_base = slab->next;

lib/libc/stdlib/dmalloc.c

852

slab->next = zinfo->avail_base;

lib/libc/stdlib/dmalloc.c

863

zinfo->empty_base = slab->next;

lib/libc/stdlib/dmalloc.c

864

slab->next = zinfo->avail_base;

lib/libc/stdlib/dmalloc.c

897

zinfo->avail_base = slab->next;

lib/libc/stdlib/insque.c

23

struct que_elem *prev, *next, *elem;

lib/libc/stdlib/insque.c

29

elem->prev = elem->next = NULL;

lib/libc/stdlib/insque.c

33

next = prev->next;

lib/libc/stdlib/insque.c

34

if (next != NULL) {

lib/libc/stdlib/insque.c

36

if (next->prev != prev) {

lib/libc/stdlib/insque.c

39

next, next->prev, prev);

lib/libc/stdlib/insque.c

42

next->prev = elem;

lib/libc/stdlib/insque.c

44

prev->next = elem;

lib/libc/stdlib/insque.c

46

elem->next = next;

lib/libc/stdlib/nmalloc.c

1022

big->next = *bigp;

lib/libc/stdlib/nmalloc.c

1043

big->next = *bigp;

lib/libc/stdlib/nmalloc.c

1178

big->next = *bigp;

lib/libc/stdlib/nmalloc.c

1463

*bigp = big->next;

lib/libc/stdlib/nmalloc.c

1468

big->next = *bigp;

lib/libc/stdlib/nmalloc.c

148

struct bigalloc *next; /* hash link */

lib/libc/stdlib/nmalloc.c

1482

bigp = &big->next;

lib/libc/stdlib/nmalloc.c

1554

bigp = &big->next;

lib/libc/stdlib/nmalloc.c

1620

*bigp = big->next;

lib/libc/stdlib/nmalloc.c

1642

bigp = &big->next;

lib/libc/stdlib/nmalloc.c

675

for (big = *bigp; big; big = big->next) {

lib/libc/stdlib/quick_exit.c

41

struct quick_exit_fn *next;

lib/libc/stdlib/quick_exit.c

67

fn->next = quick_exit_fns;

lib/libc/stdlib/quick_exit.c

88

for (fn = quick_exit_fns; fn != NULL; fn = fn->next) {

lib/libc/stdlib/rand.c

114

if (_read(fd, (void *) &next, sizeof(next)) == sizeof(next))

lib/libc/stdlib/rand.c

120

size_t len = sizeof(next);

lib/libc/stdlib/rand.c

122

if (sysctlbyname("kern.random", &next, &len, NULL, 0) == 0)

lib/libc/stdlib/rand.c

84

static u_long next = 1;

lib/libc/stdlib/rand.c

89

return (do_rand(&next));

lib/libc/stdlib/rand.c

95

next = seed;

lib/libc/stdlib/remque.c

19

struct que_elem *prev, *next, *elem;

lib/libc/stdlib/remque.c

24

next = elem->next;

lib/libc/stdlib/remque.c

27

prev->next = next;

lib/libc/stdlib/remque.c

28

if (next != NULL)

lib/libc/stdlib/remque.c

29

next->prev = prev;

lib/libc/sysvipc/msg.c

195

short next;

lib/libc/sysvipc/msg.c

200

next = msqpptr->msgmaps[msghdr->msg_spot].next;

lib/libc/sysvipc/msg.c

201

msqpptr->msgmaps[msghdr->msg_spot].next =

lib/libc/sysvipc/msg.c

205

msghdr->msg_spot = next;

lib/libc/sysvipc/msg.c

382

short next;

lib/libc/sysvipc/msg.c

507

next = msqpptr->free_msgmaps;

lib/libc/sysvipc/msg.c

508

if (next < 0 || next > msginfo.msgseg) {

lib/libc/sysvipc/msg.c

509

sysv_print_err("out of range free_msgmaps %d #1\n", next);

lib/libc/sysvipc/msg.c

513

msqpptr->free_msgmaps = msqpptr->msgmaps[next].next;

lib/libc/sysvipc/msg.c

515

msqpptr->msgmaps[next].next = msghdr->msg_spot;

lib/libc/sysvipc/msg.c

516

msghdr->msg_spot = next;

lib/libc/sysvipc/msg.c

542

next = msghdr->msg_spot;

lib/libc/sysvipc/msg.c

549

if (next < 0 || next > msginfo.msgseg) {

lib/libc/sysvipc/msg.c

550

sysv_print_err("out of range free_msgmaps %d #2\n", next);

lib/libc/sysvipc/msg.c

554

memcpy(&msqpptr->msgpool[next * msginfo.msgssz], auxmsgp, tlen);

lib/libc/sysvipc/msg.c

557

next = msqpptr->msgmaps[next].next;

lib/libc/sysvipc/msg.c

598

short next;

lib/libc/sysvipc/msg.c

784

next = msghdr->msg_spot;

lib/libc/sysvipc/msg.c

792

if (next < 0 || next > msginfo.msgseg) {

lib/libc/sysvipc/msg.c

793

sysv_print_err("out of range free_msgmaps %d #3\n", next);

lib/libc/sysvipc/msg.c

797

memcpy(auxmsgp, (caddr_t)&msqpptr->msgpool[next * msginfo.msgssz], tlen);

lib/libc/sysvipc/msg.c

799

next = msqpptr->msgmaps[next].next;

lib/libc/sysvipc/sysvipc_msg.h

100

short next; /* next segment in buffer */

lib/libcompat/4.3/rexec.c

159

next:

lib/libcompat/4.3/rexec.c

196

goto next;

lib/libdm/dm_task.c

640

vers[i].next = sizeof(struct dm_versions);

lib/libdm/dm_task.c

652

vers[i-1].next = 0;

lib/libdm/dm_task.c

689

names[i].next = sizeof(struct dm_names);

lib/libdm/dm_task.c

701

names[i-1].next = 0;

lib/libdm/libdm.h

49

uint32_t next;

lib/libdm/libdm.h

60

uint32_t next;

lib/libevtr/evtr.c

135

struct hashentry *next;

lib/libevtr/evtr.c

1421

struct hashentry *ent, *next;

lib/libevtr/evtr.c

1424

for (ent = h->buckets[i]; ent; ent = next) {

lib/libevtr/evtr.c

1425

next = ent->next;

lib/libevtr/evtr.c

569

ent = ent->next);

lib/libevtr/evtr.c

588

ent->next = tab->buckets[hsh];

lib/libexecinfo/builtin.c

48

struct frameinfo *next;

lib/libexecinfo/builtin.c

62

frame = frame->next;

lib/libkvm/kvm_minidump_x86_64.c

55

struct hpte *next;

lib/libkvm/kvm_minidump_x86_64.c

86

hpte->next = kd->vmst->hpt_head[fnv];

lib/libkvm/kvm_minidump_x86_64.c

98

for (hpte = kd->vmst->hpt_head[fnv]; hpte != NULL; hpte = hpte->next) {

lib/libpam/modules/pam_guest/pam_guest.c

52

const char *next;

lib/libpam/modules/pam_guest/pam_guest.c

59

if ((next = strchr(list, ',')) == NULL)

lib/libpam/modules/pam_guest/pam_guest.c

60

next = strchr(list, '\0');

lib/libpam/modules/pam_guest/pam_guest.c

61

if (next - list == (ptrdiff_t)len &&

lib/libpam/modules/pam_guest/pam_guest.c

64

list = next;

lib/libtcplay/crypto.c

121

cipher_chain = cipher_chain->next) {

lib/libtcplay/crypto.c

169

for (; cipher_chain->next != NULL; cipher_chain = cipher_chain->next)

lib/libtcplay/crypto.c

63

dummy_chain = dummy_chain->next) {

lib/libtcplay/crypto.c

89

for (; cipher_chain != NULL; cipher_chain = cipher_chain->next) {

lib/libtcplay/safe_mem.c

143

hdr->prev->next = hdr->next;

lib/libtcplay/safe_mem.c

144

if (hdr->next != NULL)

lib/libtcplay/safe_mem.c

145

hdr->next->prev = hdr->prev;

lib/libtcplay/safe_mem.c

147

safe_mem_hdr_first = hdr->next;

lib/libtcplay/safe_mem.c

40

struct safe_mem_hdr *next;

lib/libtcplay/safe_mem.c

88

hdr->next = NULL;

lib/libtcplay/safe_mem.c

94

while (hdrp->next != NULL)

lib/libtcplay/safe_mem.c

95

hdrp = hdrp->next;

lib/libtcplay/safe_mem.c

97

hdrp->next = hdr;

lib/libtcplay/tcplay.c

1443

void *next = NULL;

lib/libtcplay/tcplay.c

1469

next = dm_get_next_target(dmt, next, &start, &length,

lib/libtcplay/tcplay.c

1519

} while (next != NULL);

lib/libtcplay/tcplay.c

172

prev->next = elem;

lib/libtcplay/tcplay.c

1731

for (cipher_chain = info->cipher_chain; cipher_chain->next != NULL;

lib/libtcplay/tcplay.c

1732

cipher_chain = cipher_chain->next)

lib/libtcplay/tcplay.c

177

elem->next = NULL;

lib/libtcplay/tcplay.c

212

for (; src != NULL; src = src->next) {

lib/libtcplay/tcplay.c

234

elem->next = NULL;

lib/libtcplay/tcplay.c

238

prev->next = elem;

lib/libtcplay/tcplay.c

250

struct tc_cipher_chain *next = chain;

lib/libtcplay/tcplay.c

252

while ((chain = next) != NULL) {

lib/libtcplay/tcplay.c

253

next = chain->next;

lib/libtcplay/tcplay.c

268

for (; chain != NULL; chain = chain->next)

lib/libtcplay/tcplay.c

279

for (; chain != NULL; chain = chain->next) {

lib/libtcplay/tcplay.c

297

for (; chain != NULL; chain = chain->next) {

lib/libtcplay/tcplay.c

299

(chain->next != NULL) ? "," : "\0");

lib/libtcplay/tcplay.c

401

for (; cipher_chain != NULL; cipher_chain = cipher_chain->next) {

lib/libtcplay/tcplay.h

117

struct tc_cipher_chain *next;

lib/libthread_xu/thread/thr_clean.c

52

new->next = curthread->cleanup;

lib/libthread_xu/thread/thr_clean.c

65

curthread->cleanup = old->next;

lib/libthread_xu/thread/thr_printf.c

72

next: c = *fmt++;

lib/libthread_xu/thread/thr_printf.c

84

goto next;

lib/libthread_xu/thread/thr_private.h

200

struct pthread_cleanup *next;

lib/libthread_xu/thread/thr_private.h

212

__cup.next = (td)->cleanup; \

lib/libthread_xu/thread/thr_private.h

216

(td)->cleanup = __cup.next; \

lib/libthread_xu/thread/thr_sem.c

103

LIST_ENTRY(sem_info) next;

lib/libthread_xu/thread/thr_sem.c

442

LIST_FOREACH(ni, &sem_list, next) {

lib/libthread_xu/thread/thr_sem.c

451

LIST_REMOVE(ni, next);

lib/libthread_xu/thread/thr_sem.c

481

LIST_INSERT_HEAD(&sem_list, ni, next);

lib/libthread_xu/thread/thr_sem.c

500

LIST_REMOVE(ni, next);

lib/libu4bhid/usbhid.h

74

struct hid_item *next;

lib/libusb/libusb01.c

54

ent->next = begin; \

lib/libusb/libusb01.c

55

ent->next->prev = ent; \

lib/libusb/libusb01.c

57

ent->next = NULL; \

lib/libusb/libusb01.c

66

ent->prev->next = ent->next; \

lib/libusb/libusb01.c

68

begin = ent->next; \

lib/libusb/libusb01.c

70

if (ent->next) { \

lib/libusb/libusb01.c

71

ent->next->prev = ent->prev; \

lib/libusb/libusb01.c

74

ent->next = NULL; \

lib/libusb/usb.h

227

struct usb_device *next;

lib/libusb/usb.h

246

struct usb_bus *next;

lib/libutil/libutil.h

54

struct _property *next;

lib/libutil/property.c

210

if ((ptr->next = property_alloc(hold_n, hold_v)) == NULL) {

lib/libutil/property.c

214

ptr = ptr->next;

lib/libutil/property.c

239

list = list->next;

lib/libutil/property.c

250

tmp = list->next;

lib/libutil/property.c

50

n->next = NULL;

libexec/bootpd/hash.c

108

nextbucket = bucketptr->next;

libexec/bootpd/hash.c

191

memberptr = memberptr->next;

libexec/bootpd/hash.c

223

temp->next = (hashtable->table)[hashcode];

libexec/bootpd/hash.c

254

(hashtable->table)[hashcode] = memberptr->next;

libexec/bootpd/hash.c

258

memberptr->next = NULL;

libexec/bootpd/hash.c

269

memberptr = memberptr->next;

libexec/bootpd/hash.c

274

previous->next = memberptr = memberptr->next;

libexec/bootpd/hash.c

278

tempptr->next = NULL;

libexec/bootpd/hash.c

283

memberptr = memberptr->next;

libexec/bootpd/hash.c

309

memberptr = memberptr->next;

libexec/bootpd/hash.c

331

hashtable->member = memberptr->next; /* Set up for next call */

libexec/bootpd/hash.c

362

hashtable->member = memberptr->next; /* Set up for next call */

libexec/bootpd/hash.h

103

hash_member *next;

libexec/dma/aliases_parse.y

109

SLIST_NEXT(it, next) = $3;

libexec/dma/aliases_parse.y

61

LIST_INSERT_AFTER($2, $1, next);

libexec/dma/conf.c

138

SLIST_INSERT_HEAD(&authusers, au, next);

libexec/dma/dma.c

165

LIST_FOREACH(al, &aliases, next) {

libexec/dma/dma.c

168

SLIST_FOREACH(sit, &al->dests, next) {

libexec/dma/dma.c

200

LIST_FOREACH(tit, &queue->queue, next) {

libexec/dma/dma.c

208

LIST_INSERT_HEAD(&queue->queue, it, next);

libexec/dma/dma.c

223

LIST_REMOVE(it, next);

libexec/dma/dma.c

262

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/dma.c

264

if (LIST_NEXT(it, next) == NULL)

libexec/dma/dma.c

401

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/dma.c

409

if (LIST_NEXT(it, next) != NULL)

libexec/dma/dma.h

103

LIST_ENTRY(alias) next;

libexec/dma/dma.h

110

LIST_ENTRY(qitem) next;

libexec/dma/dma.h

149

SLIST_ENTRY(authuser) next;

libexec/dma/dma.h

97

SLIST_ENTRY(stritem) next;

libexec/dma/net.c

530

SLIST_FOREACH(a, &authusers, next) {

libexec/dma/spool.c

112

SLIST_INSERT_HEAD(&tmpfs, t, next);

libexec/dma/spool.c

219

LIST_INSERT_HEAD(&queue->queue, it, next);

libexec/dma/spool.c

246

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/spool.c

265

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/spool.c

274

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/spool.c

392

LIST_FOREACH(it, &queue->queue, next) {

libexec/dma/util.c

248

SLIST_FOREACH(t, &tmpfs, next) {

libexec/ftpd/ftpd.c

147

struct ftphost *next;

libexec/ftpd/ftpd.c

685

hrp->next = NULL;

libexec/ftpd/ftpd.c

757

for (hrp = firsthost; hrp != NULL; hrp = hrp->next) {

libexec/ftpd/ftpd.c

843

hrp->next = NULL;

libexec/ftpd/ftpd.c

844

lhrp->next = hrp;

libexec/ftpd/ftpd.c

898

hrp = hrp->next;

libexec/mknetid/hash.c

120

cur = cur->next;

libexec/mknetid/hash.c

144

tmp->next = NULL;

libexec/mknetid/hash.c

150

tmp->next = cur->groups;

libexec/mknetid/hash.c

154

cur = cur->next;

libexec/mknetid/hash.c

164

new->next = table[i];

libexec/mknetid/hash.h

39

struct grouplist *next;

libexec/mknetid/hash.h

46

struct member_entry *next;

libexec/mknetid/mknetid.c

231

glist = glist->next;

libexec/rbootd/defs.h

110

struct client_s *next; /* ptr to next */

libexec/rbootd/defs.h

121

struct rmpconn_s *next; /* ptr to next */

libexec/rbootd/parseconf.c

201

client->next = Clients;

libexec/rbootd/rbootd.c

306

for (rtmp = RmpConns; rtmp != NULL; rtmp = rtmp->next)

libexec/rbootd/rbootd.c

336

for (ctmp = Clients; ctmp != NULL; ctmp = ctmp->next)

libexec/rbootd/utils.c

303

Clients = Clients->next;

libexec/rbootd/utils.c

377

rtmp->next = NULL;

libexec/rbootd/utils.c

436

RmpConns = RmpConns->next;

libexec/rbootd/utils.c

465

rconn->next = RmpConns;

libexec/rbootd/utils.c

493

for (rtmp = RmpConns; rtmp != NULL; rtmp = rtmp->next)

libexec/rbootd/utils.c

523

RmpConns = RmpConns->next;

libexec/rbootd/utils.c

527

thisrconn = lastrconn->next; /* set current ptr */

libexec/rbootd/utils.c

530

lastrconn->next = thisrconn->next;

libexec/rbootd/utils.c

535

thisrconn = thisrconn->next;

libexec/revnetgroup/hash.c

120

cur = cur->next;

libexec/revnetgroup/hash.c

154

new->next = table[i];

libexec/revnetgroup/hash.c

184

tmp->next = NULL;

libexec/revnetgroup/hash.c

189

tmp->next = cur->groups;

libexec/revnetgroup/hash.c

193

cur = cur->next;

libexec/revnetgroup/hash.c

201

new->next = table[i];

libexec/revnetgroup/hash.h

39

struct grouplist *next;

libexec/revnetgroup/hash.h

47

struct member_entry *next;

libexec/revnetgroup/hash.h

54

struct group_entry *next;

libexec/revnetgroup/revnetgroup.c

149

gcur = gcur->next;

libexec/revnetgroup/revnetgroup.c

165

tmp = tmp->next;

libexec/revnetgroup/revnetgroup.c

169

mcur = mcur->next;

libexec/rtld-elf/debug.c

65

for (obj = obj0; obj != NULL; obj = obj->next) {

libexec/rtld-elf/libmap.c

112

TAILQ_FOREACH(p, &lmc_head, next) {

libexec/rtld-elf/libmap.c

144

TAILQ_INSERT_HEAD(&lmc_head, p, next);

libexec/rtld-elf/libmap.c

163

TAILQ_FOREACH(p, &lmc_head, next) {

libexec/rtld-elf/libmap.c

177

TAILQ_INSERT_HEAD(&lmc_head, p, next);

libexec/rtld-elf/libmap.c

330

TAILQ_REMOVE(&lmc_head, p, next);

libexec/rtld-elf/libmap.c

42

TAILQ_ENTRY(lmc) next;

libexec/rtld-elf/map_object.c

402

obj->needed = needed->next;

libexec/rtld-elf/rtld.c

1123

nep->next = NULL;

libexec/rtld-elf/rtld.c

1126

needed_tail = &nep->next;

libexec/rtld-elf/rtld.c

1135

nep->next = NULL;

libexec/rtld-elf/rtld.c

1138

needed_filtees_tail = &nep->next;

libexec/rtld-elf/rtld.c

1147

nep->next = NULL;

libexec/rtld-elf/rtld.c

1150

needed_aux_filtees_tail = &nep->next;

libexec/rtld-elf/rtld.c

1453

for (obj = obj_list; obj != NULL; obj = obj->next)

libexec/rtld-elf/rtld.c

1846

for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

1951

if (needed->next != NULL)

libexec/rtld-elf/rtld.c

1952

initlist_add_neededs(needed->next, list);

libexec/rtld-elf/rtld.c

1956

initlist_add_objects(needed->obj, &needed->obj->next, list);

libexec/rtld-elf/rtld.c

1977

if (&obj->next != tail)

libexec/rtld-elf/rtld.c

1978

initlist_add_objects(obj->next, tail, list);

libexec/rtld-elf/rtld.c

2010

for (needed = n; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

2017

needed1 = needed->next;

libexec/rtld-elf/rtld.c

2038

for (; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

2062

for (; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

2081

for (obj = first; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

2154

for (obj = obj_list->next; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

2199

for (obj = obj_list->next; obj != NULL; obj = obj->next)

libexec/rtld-elf/rtld.c

2269

obj_tail = &obj->next;

libexec/rtld-elf/rtld.c

2292

for (obj = obj_list; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

2426

for (obj = obj_list; obj != NULL; obj = obj->next)

libexec/rtld-elf/rtld.c

2715

for (error = 0, obj = first; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

2756

for (obj = first; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

3117

initlist_add_objects(obj, &obj->next, &initlist);

libexec/rtld-elf/rtld.c

3228

obj = obj->next;

libexec/rtld-elf/rtld.c

3229

for (; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

3504

for (obj = obj_list; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

3978

for (n = needed; n != NULL; n = n->next) {

libexec/rtld-elf/rtld.c

4263

for (; obj; obj = obj->next) {

libexec/rtld-elf/rtld.c

4270

for (needed = obj->needed; needed; needed = needed->next) {

libexec/rtld-elf/rtld.c

4354

linkp = &obj_list->next;

libexec/rtld-elf/rtld.c

4363

*linkp = obj->next;

libexec/rtld-elf/rtld.c

4367

linkp = &obj->next;

libexec/rtld-elf/rtld.c

4497

for (obj = objs; obj; obj = obj->next) {

libexec/rtld-elf/rtld.c

4550

for (obj = obj_list; obj; obj = obj->next) {

libexec/rtld-elf/rtld.c

4699

for (needed = obj->needed; needed != NULL; needed = needed->next) {

libexec/rtld-elf/rtld.c

561

obj_tail = &obj_main->next;

libexec/rtld-elf/rtld.c

584

for (obj = obj_list; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.c

759

for (obj = obj_list->next; obj != NULL; obj = obj->next) {

libexec/rtld-elf/rtld.h

140

struct Struct_Obj_Entry *next;

libexec/rtld-elf/rtld.h

80

struct Struct_Needed_Entry *next;

libexec/rtld-elf/x86_64/reloc.c

94

for (srcobj = dstobj->next; srcobj != NULL; srcobj = srcobj->next) {

libexec/talkd/table.c

122

for (ptr = table; ptr != NULL; ptr = ptr->next) {

libexec/talkd/table.c

163

ptr->next = table;

libexec/talkd/table.c

164

if (ptr->next != NULL)

libexec/talkd/table.c

165

ptr->next->last = ptr;

libexec/talkd/table.c

196

for (ptr = table; ptr != NULL; ptr = ptr->next) {

libexec/talkd/table.c

219

table = ptr->next;

libexec/talkd/table.c

221

ptr->last->next = ptr->next;

libexec/talkd/table.c

222

if (ptr->next != NULL)

libexec/talkd/table.c

223

ptr->next->last = ptr->last;

libexec/talkd/table.c

63

TABLE_ENTRY *next;

libexec/talkd/table.c

85

for (ptr = table; ptr != NULL; ptr = ptr->next) {

libexec/telnetd/utility.c

194

char *thisitem, *next;

libexec/telnetd/utility.c

205

while ((next = nextitem(thisitem)) <= nbackp) {

libexec/telnetd/utility.c

206

thisitem = next;

libexec/telnetd/utility.c

221

next = thisitem;

libexec/telnetd/utility.c

223

next = nextitem(next);

libexec/telnetd/utility.c

224

} while (wewant(next) && (nfrontp > next));

libexec/telnetd/utility.c

225

length = next-thisitem;

libexec/telnetd/utility.c

228

thisitem = next;

sbin/cryptdisks/safe_mem.c

144

hdr->prev->next = hdr->next;

sbin/cryptdisks/safe_mem.c

145

if (hdr->next != NULL)

sbin/cryptdisks/safe_mem.c

146

hdr->next->prev = hdr->prev;

sbin/cryptdisks/safe_mem.c

148

safe_mem_hdr_first = hdr->next;

sbin/cryptdisks/safe_mem.c

39

struct safe_mem_hdr *next;

sbin/cryptdisks/safe_mem.c

88

hdr->next = NULL;

sbin/cryptdisks/safe_mem.c

94

while (hdrp->next != NULL)

sbin/cryptdisks/safe_mem.c

95

hdrp = hdrp->next;

sbin/cryptdisks/safe_mem.c

97

hdrp->next = hdr;

sbin/devfsctl/devfsctl.h

66

struct groupdevid *next;

sbin/dhclient/clparse.c

440

for (lp = client->leases; lp; lp = lp->next) {

sbin/dhclient/clparse.c

443

pl->next = lp->next;

sbin/dhclient/clparse.c

445

client->leases = lp->next;

sbin/dhclient/clparse.c

457

lease->next = client->leases;

sbin/dhclient/clparse.c

482

client->active->next = client->leases;

sbin/dhclient/clparse.c

739

list->next = config->reject_list;

sbin/dhclient/dhclient.c

1104

for (lp = client->leases; lp->next; lp = lp->next)

sbin/dhclient/dhclient.c

1106

lp->next = client->active;

sbin/dhclient/dhclient.c

1107

if (lp->next)

sbin/dhclient/dhclient.c

1108

lp->next->next = NULL;

sbin/dhclient/dhclient.c

1110

client->leases = client->leases->next;

sbin/dhclient/dhclient.c

1466

for (lp = client->leases; lp; lp = lp->next) {

sbin/dhclient/dhclient.c

203

for (l = client->leases; l != NULL; l = l->next)

sbin/dhclient/dhclient.c

592

struct client_lease *lp, *next, *picked;

sbin/dhclient/dhclient.c

603

for (lp = client->offered_leases; lp; lp = next) {

sbin/dhclient/dhclient.c

604

next = lp->next;

sbin/dhclient/dhclient.c

623

picked->next = NULL;

sbin/dhclient/dhclient.c

814

lease; lease = lease->next) {

sbin/dhclient/dhclient.c

849

lease->next = client->offered_leases;

sbin/dhclient/dhclient.c

853

lease->next = NULL;

sbin/dhclient/dhclient.c

857

for (lp = client->offered_leases; lp->next;

sbin/dhclient/dhclient.c

858

lp = lp->next)

sbin/dhclient/dhclient.c

860

lp->next = lease;

sbin/dhclient/dhcpd.h

107

struct client_lease *next;

sbin/dhclient/dhcpd.h

86

struct string_list *next;

sbin/dhclient/dhcpd.h

96

struct iaddrlist *next;

sbin/dhclient/options.c

532

for (ap = config->reject_list; ap && handler; ap = ap->next)

sbin/fsck/fsck.h

154

struct dups *next;

sbin/fsck/fsck.h

164

struct zlncnt *next;

sbin/fsck/main.c

301

for (dp = duplist; dp; dp = dp->next)

sbin/fsck/main.c

307

for (zlnp = zlnhead; zlnp; zlnp = zlnp->next)

sbin/fsck/memzone.c

55

chunk->next = zone->list;

sbin/fsck/memzone.c

92

chunk->next = zone->list;

sbin/fsck/memzone.c

97

zone->list = chunk->next;

sbin/fsck/memzone.h

36

struct memchunk *next;

sbin/fsck/pass1.c

299

zlnp->next = zlnhead;

sbin/fsck/pass1.c

403

new->next = 0;

sbin/fsck/pass1.c

405

new->next = muldup->next;

sbin/fsck/pass1.c

406

muldup->next = new;

sbin/fsck/pass1.c

408

for (dlp = duplist; dlp != muldup; dlp = dlp->next)

sbin/fsck/pass1b.c

89

for (dlp = duphead; dlp; dlp = dlp->next) {

sbin/fsck/pass1b.c

94

duphead = duphead->next;

sbin/fsck/pass1b.c

99

if (muldup == 0 || duphead == muldup->next)

sbin/fsck/pass4.c

128

for (dlp = duplist; dlp; dlp = dlp->next) {

sbin/fsck/pass4.c

133

duplist = duplist->next;

sbin/fsck/pass4.c

79

for (zlnp = zlnhead; zlnp; zlnp = zlnp->next) {

sbin/fsck/pass4.c

83

zlnhead = zlnhead->next;

sbin/fsck/preen.c

122

nextdisk = nextdisk->next;

sbin/fsck/preen.c

125

for (dk = disks; dk; dk = dk->next)

sbin/fsck/preen.c

145

badnext = &dk->part->next;

sbin/fsck/preen.c

146

dk->part = dk->part->next;

sbin/fsck/preen.c

149

dk->part = dk->part->next;

sbin/fsck/preen.c

165

if ((nextdisk = nextdisk->next) == NULL)

sbin/fsck/preen.c

183

badlist->next ? "S" : "", "UNEXPECTED INCONSISTENCY:");

sbin/fsck/preen.c

184

for (pt = badlist; pt; pt = pt->next)

sbin/fsck/preen.c

186

pt->next ? ", " : "\n");

sbin/fsck/preen.c

207

for (dk = disks, dkp = &disks; dk; dkp = &dk->next, dk = dk->next) {

sbin/fsck/preen.c

224

dk->next = NULL;

sbin/fsck/preen.c

236

for (pt = dk->part; pt; ppt = &pt->next, pt = pt->next)

sbin/fsck/preen.c

256

pt->next = NULL;

sbin/fsck/preen.c

49

struct part *next; /* forward link of partitions on disk */

sbin/fsck/preen.c

57

struct disk *next; /* forward link for list of disks */

sbin/fsck_msdosfs/dir.c

1054

struct dirTodoNode *n = pendingDirectories->next;

sbin/fsck_msdosfs/dir.c

1095

for (lostDir = rootDir->child; lostDir; lostDir = lostDir->next) {

sbin/fsck_msdosfs/dir.c

111

freede = de->next;

sbin/fsck_msdosfs/dir.c

118

de->next = freede;

sbin/fsck_msdosfs/dir.c

136

freedt = dt->next;

sbin/fsck_msdosfs/dir.c

143

dt->next = freedt;

sbin/fsck_msdosfs/dir.c

268

np = p->next;

sbin/fsck_msdosfs/dir.c

277

if (!(nd = d->next))

sbin/fsck_msdosfs/dir.c

803

dirent.next = dir->child;

sbin/fsck_msdosfs/dir.c

991

n->next = pendingDirectories;

sbin/fsck_msdosfs/dosfs.h

112

*next, /* next brother */

sbin/fsck_msdosfs/dosfs.h

130

struct dirTodoNode *next;

sbin/hammer/cmd_cleanup.c

213

for (didpfs = FirstPFS; didpfs; didpfs = didpfs->next) {

sbin/hammer/cmd_cleanup.c

222

didpfs->next = FirstPFS;

sbin/hammer/cmd_cleanup.c

66

struct didpfs *next;

sbin/hammer/cmd_recover.c

40

struct recover_dict *next;

sbin/hammer/cmd_recover.c

630

for (dict = RDHash[i]; dict; dict = dict->next) {

sbin/hammer/cmd_recover.c

640

dict->next = RDHash[i];

sbin/hammer/cmd_recover.c

661

char *next;

sbin/hammer/cmd_recover.c

681

info.next = info.base;

sbin/hammer/cmd_recover.c

723

strcpy(info->next, TargetDir);

sbin/hammer/cmd_recover.c

724

info->next += strlen(info->next);

sbin/hammer/cmd_recover.c

727

*info->next++ = '/';

sbin/hammer/cmd_recover.c

729

snprintf(info->next, STRLEN_PFSID + 1,

sbin/hammer/cmd_recover.c

732

strcpy(info->next, dict->name);

sbin/hammer/cmd_recover.c

734

snprintf(info->next, STRLEN_OBJID + 1,

sbin/hammer/cmd_recover.c

737

info->next += strlen(info->next);

sbin/hammer/cmd_softprune.c

141

if (base->next) {

sbin/hammer/cmd_softprune.c

150

for (scan = base; scan; scan = scan->next) {

sbin/hammer/cmd_softprune.c

40

struct softprune *next;

sbin/hammer/cmd_softprune.c

437

for (scan = *basep; scan; scan = scan->next) {

sbin/hammer/cmd_softprune.c

458

scan->next = *basep;

sbin/hammer2/cmd_recover.c

103

struct neg_entry *next;

sbin/hammer2/cmd_recover.c

108

struct topo_bref_entry *next;

sbin/hammer2/cmd_recover.c

114

struct topo_inode_entry *next;

sbin/hammer2/cmd_recover.c

1333

iscan = iscan->next;

sbin/hammer2/cmd_recover.c

392

iscan = iscan->next)

sbin/hammer2/cmd_recover.c

409

iscan = iscan->next)

sbin/hammer2/cmd_recover.c

480

InodeHash[i] = iscan->next;

sbin/hammer2/cmd_recover.c

486

TopologyHash[i] = top_scan->next;

sbin/hammer2/cmd_recover.c

492

NegativeHash[i] = negscan->next;

sbin/hammer2/cmd_recover.c

497

TopoBRefHash[i] = topo_bref->next;

sbin/hammer2/cmd_recover.c

502

TopoInodeHash[i] = topo_inode->next;

sbin/hammer2/cmd_recover.c

621

for (entry = DirHash[hv]; entry; entry = entry->next) {

sbin/hammer2/cmd_recover.c

632

entry->next = DirHash[hv];

sbin/hammer2/cmd_recover.c

664

for (topo = TopologyHash[hv]; topo; topo = topo->next) {

sbin/hammer2/cmd_recover.c

671

topo->next = TopologyHash[hv];

sbin/hammer2/cmd_recover.c

689

for (scan = TopoInodeHash[hv]; scan; scan = scan->next) {

sbin/hammer2/cmd_recover.c

701

scan->next = TopoInodeHash[hv];

sbin/hammer2/cmd_recover.c

719

for (scan = TopoBRefHash[hv]; scan; scan = scan->next) {

sbin/hammer2/cmd_recover.c

731

scan->next = TopoBRefHash[hv];

sbin/hammer2/cmd_recover.c

74

struct dirent_entry *next;

sbin/hammer2/cmd_recover.c

83

struct inode_entry *next;

sbin/hammer2/cmd_recover.c

838

scan->next = InodeHash[hv];

sbin/hammer2/cmd_recover.c

889

scan->next = InodeHash[hv];

sbin/hammer2/cmd_recover.c

903

for (entry = InodeHash[hv]; entry; entry = entry->next) {

sbin/hammer2/cmd_recover.c

926

for (neg = NegativeHash[hv]; neg; neg = neg->next) {

sbin/hammer2/cmd_recover.c

949

neg->next = NegativeHash[hv];

sbin/hammer2/cmd_recover.c

97

struct topology_entry *next;

sbin/hammer2/cmd_service.c

527

struct autoconn *next;

sbin/hammer2/cmd_service.c

644

next = TAILQ_FIRST(&autolist);

sbin/hammer2/cmd_service.c

645

while ((ac = next) != NULL) {

sbin/hammer2/cmd_service.c

646

next = TAILQ_NEXT(ac, entry);

sbin/hammer2/hammer2.h

99

struct hammer2_idmap *next;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

126

state->lencode = state->distcode = state->next = state->codes;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

251

static code *next;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

259

next = fixed;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

260

lenfix = next;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

262

inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

267

distfix = next;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

269

inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

408

next = strm->next_in; \

sbin/hammer2/zlib/hammer2_zlib_inflate.c

419

strm->next_in = next; \

sbin/hammer2/zlib/hammer2_zlib_inflate.c

438

hold += (unsigned long)(*next++) << bits; \

sbin/hammer2/zlib/hammer2_zlib_inflate.c

554

z_const unsigned char FAR *next; /* next input */

sbin/hammer2/zlib/hammer2_zlib_inflate.c

690

zmemcpy(put, next, copy);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

692

next += copy;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

728

state->next = state->codes;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

729

state->lencode = (const code FAR *)(state->next);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

731

ret = inflate_table(CODES, state->lens, 19, &(state->next),

sbin/hammer2/zlib/hammer2_zlib_inflate.c

803

state->next = state->codes;

sbin/hammer2/zlib/hammer2_zlib_inflate.c

804

state->lencode = (const code FAR *)(state->next);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

806

ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),

sbin/hammer2/zlib/hammer2_zlib_inflate.c

813

state->distcode = (const code FAR *)(state->next);

sbin/hammer2/zlib/hammer2_zlib_inflate.c

816

&(state->next), &(state->distbits), state->work);

sbin/hammer2/zlib/hammer2_zlib_inflate.h

106

code FAR *next; /* next available space in codes[] */

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

201

next = *table; /* current table to fill in */

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

236

next[(huff >> drop) + fill] = here;

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

264

next += min; /* here min is 1 << curr */

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

286

(*table)[low].val = (unsigned short)(next - *table);

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

297

next[huff] = here;

sbin/hammer2/zlib/hammer2_zlib_inftrees.c

52

code FAR *next; /* next available space in table */

sbin/ifconfig/ifclone.c

110

SLIST_INSERT_HEAD(&clone_defcbh, dcp, next);

sbin/ifconfig/ifclone.c

131

SLIST_FOREACH(dcp, &clone_defcbh, next) {

sbin/ifconfig/ifclone.c

96

SLIST_ENTRY(clone_defcb) next;

sbin/ifconfig/ifconfig.c

124

p->next = opts;

sbin/ifconfig/ifconfig.c

136

for (p = opts; p != NULL; p = p->next) {

sbin/ifconfig/ifconfig.c

240

struct ifaddrs *right, *temp, *last, *result, *next, *tail;

sbin/ifconfig/ifconfig.c

243

result = next = tail = NULL;

sbin/ifconfig/ifconfig.c

261

next = list;

sbin/ifconfig/ifconfig.c

264

next = right;

sbin/ifconfig/ifconfig.c

267

next = list;

sbin/ifconfig/ifconfig.c

270

next = right;

sbin/ifconfig/ifconfig.c

275

result = next;

sbin/ifconfig/ifconfig.c

277

tail->ifa_next = next;

sbin/ifconfig/ifconfig.c

279

tail = next;

sbin/ifconfig/ifconfig.c

382

for (p = opts; p != NULL; p = p->next)

sbin/ifconfig/ifconfig.c

425

for (p = opts; p != NULL; p = p->next)

sbin/ifconfig/ifconfig.h

138

struct option *next;

sbin/ifconfig/ifieee80211.c

2094

LIST_FOREACH(nb, bands, next) {

sbin/ifconfig/ifieee80211.c

2305

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/ifieee80211.c

2312

LIST_FOREACH(dp, &rdp->domains, next) {

sbin/ifconfig/regdomain.c

100

LIST_INSERT_HEAD(&mt->rdp->domains, mt->rd, next);

sbin/ifconfig/regdomain.c

149

LIST_INSERT_HEAD(mt->curband, mt->netband, next);

sbin/ifconfig/regdomain.c

168

LIST_INSERT_HEAD(&mt->rdp->countries, mt->country, next);

sbin/ifconfig/regdomain.c

176

LIST_INSERT_HEAD(&mt->rdp->freqbands, mt->freqband, next);

sbin/ifconfig/regdomain.c

454

LIST_FOREACH(dp, &rdp->domains, next) {

sbin/ifconfig/regdomain.c

460

LIST_FOREACH(fp, &rdp->freqbands, next) {

sbin/ifconfig/regdomain.c

466

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/regdomain.c

474

LIST_FOREACH(dp, &rdp->domains, next) {

sbin/ifconfig/regdomain.c

485

LIST_FOREACH(nb, &dp->bands_11b, next) {

sbin/ifconfig/regdomain.c

494

LIST_FOREACH(nb, &dp->bands_11g, next) {

sbin/ifconfig/regdomain.c

503

LIST_FOREACH(nb, &dp->bands_11a, next) {

sbin/ifconfig/regdomain.c

512

LIST_FOREACH(nb, &dp->bands_11ng, next) {

sbin/ifconfig/regdomain.c

521

LIST_FOREACH(nb, &dp->bands_11na, next) {

sbin/ifconfig/regdomain.c

530

LIST_FOREACH(nb, &dp->bands_11ac, next) {

sbin/ifconfig/regdomain.c

539

LIST_FOREACH(nb, &dp->bands_11acg, next) {

sbin/ifconfig/regdomain.c

549

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/regdomain.c

572

LIST_REMOVE(nb, next);

sbin/ifconfig/regdomain.c

590

LIST_REMOVE(dp, next);

sbin/ifconfig/regdomain.c

605

LIST_REMOVE(cp, next);

sbin/ifconfig/regdomain.c

614

LIST_REMOVE(fp, next);

sbin/ifconfig/regdomain.c

684

LIST_FOREACH(dp, &rdp->domains, next) {

sbin/ifconfig/regdomain.c

699

LIST_FOREACH(dp, &rdp->domains, next) {

sbin/ifconfig/regdomain.c

714

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/regdomain.c

730

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/regdomain.c

735

LIST_FOREACH(cp, &rdp->countries, next) {

sbin/ifconfig/regdomain.h

45

LIST_ENTRY(freqband) next;

sbin/ifconfig/regdomain.h

62

LIST_ENTRY(netband) next;

sbin/ifconfig/regdomain.h

81

LIST_ENTRY(regdomain) next;

sbin/ifconfig/regdomain.h

91

LIST_ENTRY(country) next;

sbin/ipfw/ipfw2.c

1424

void *next = data;

sbin/ipfw/ipfw2.c

1434

for (; nbytes >= (int)sizeof(*p); p = (struct dn_ioc_pipe *)next) {

sbin/ipfw/ipfw2.c

1446

next = (uint8_t *)p + l;

sbin/ipfw/ipfw2.c

1473

for (fs = next; nbytes >= (int)sizeof(*fs); fs = next) {

sbin/ipfw/ipfw2.c

1479

next = (uint8_t *)fs + l;

sbin/ipfw3/ipfw3dummynet.c

499

void *next = data;

sbin/ipfw3/ipfw3dummynet.c

509

for (; nbytes >= sizeof(*p); p = (struct dn_ioc_pipe *)next) {

sbin/ipfw3/ipfw3dummynet.c

521

next = (void *)p + l;

sbin/ipfw3/ipfw3dummynet.c

549

for (fs = next; nbytes >= sizeof(*fs); fs = next) {

sbin/ipfw3/ipfw3dummynet.c

555

next = (void *)fs + l;

sbin/jscan/dump_mirror.c

316

data->next = malloc(sizeof(jattr->data));

sbin/jscan/dump_mirror.c

317

data = data->next;

sbin/jscan/dump_mirror.c

320

data->next = NULL;

sbin/jscan/dump_mirror.c

443

for (data = &jattr->data; data; data = data->next) {

sbin/jscan/dump_mirror.c

532

for (data = &jattr->data; data; data = data->next) {

sbin/jscan/dump_mirror.c

615

for (data = &jattr->data; data; data = data->next) {

sbin/jscan/jattr.h

55

struct jattr_data *next;

sbin/jscan/subs.c

261

while ((data = jattr->data.next) != NULL) {

sbin/jscan/subs.c

262

jattr->data.next = data->next;

sbin/kldconfig/kldconfig.c

172

TAILQ_FOREACH(pe, pathq, next)

sbin/kldconfig/kldconfig.c

188

TAILQ_INSERT_TAIL(pathq, pe, next);

sbin/kldconfig/kldconfig.c

191

pskip = TAILQ_NEXT(pskip, next);

sbin/kldconfig/kldconfig.c

193

TAILQ_INSERT_BEFORE(pskip, pe, next);

sbin/kldconfig/kldconfig.c

195

TAILQ_INSERT_TAIL(pathq, pe, next);

sbin/kldconfig/kldconfig.c

228

TAILQ_FOREACH(pe, pathq, next)

sbin/kldconfig/kldconfig.c

238

TAILQ_REMOVE(pathq, pe, next);

sbin/kldconfig/kldconfig.c

270

TAILQ_INSERT_TAIL(pathq, pe, next);

sbin/kldconfig/kldconfig.c

284

TAILQ_FOREACH(pe, pathq, next) {

sbin/kldconfig/kldconfig.c

286

s, pe->path, (TAILQ_NEXT(pe, next) != NULL? ";": ""));

sbin/kldconfig/kldconfig.c

51

TAILQ_ENTRY(pathentry) next;

sbin/mount_hammer/mount_hammer.c

201

char **ary, *ptr, *next, *orig;

sbin/mount_hammer/mount_hammer.c

215

orig = next = strdup(*av);

sbin/mount_hammer/mount_hammer.c

216

while ((ptr = next) != NULL) {

sbin/mount_hammer/mount_hammer.c

219

if ((next = strchr(ptr, ':')) != NULL)

sbin/mount_hammer/mount_hammer.c

220

*next++ = 0;

sbin/mount_nfs/mount_nfs.c

823

struct nc_entry *next;

sbin/mount_nfs/mount_nfs.c

828

for (p = head; p != NULL; p = p->next)

sbin/mount_nfs/mount_nfs.c

837

p->next = head;

sbin/natd/natd.c

675

char *buf, *lim, *next;

sbin/natd/natd.c

704

next = buf;

sbin/natd/natd.c

705

while (next < lim) {

sbin/natd/natd.c

706

ifm = (struct if_msghdr *)next;

sbin/natd/natd.c

707

next += ifm->ifm_msglen;

sbin/natd/natd.c

730

while (next < lim) {

sbin/natd/natd.c

731

ifam = (struct ifa_msghdr *)next;

sbin/natd/natd.c

732

next += ifam->ifam_msglen;

sbin/newfs/mkfs.c

533

goto next;

sbin/newfs/mkfs.c

559

goto next;

sbin/newfs/mkfs.c

582

next:

sbin/rconfig/client.c

221

ntag->next = tag->next;

sbin/rconfig/client.c

222

tag->next = ntag;

sbin/rconfig/client.c

53

for (tag = AddrBase; tag && !done; tag = tag->next) {

sbin/rconfig/defs.h

68

struct tag *next;

sbin/rconfig/rconfig.c

114

basep = &(*basep)->next;

sbin/rconfig/rconfig.c

93

if (AddrBase && AddrBase->name == NULL && AddrBase->next) {

sbin/rconfig/server.c

53

for (tag = AddrBase; tag; tag = tag->next) {

sbin/rcorder/hash.c

148

nexth = h->next;

sbin/rcorder/hash.c

195

for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next)

sbin/rcorder/hash.c

245

for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) {

sbin/rcorder/hash.c

262

e->next = *hp;

sbin/rcorder/hash.c

298

(p = *hp) != NULL; hp = &p->next) {

sbin/rcorder/hash.c

300

*hp = p->next;

sbin/rcorder/hash.c

379

e = e->next;

sbin/rcorder/hash.c

413

Hash_Entry *e, *next = NULL, **hp, **xp;

sbin/rcorder/hash.c

427

for (e = *hp++; e != NULL; e = next) {

sbin/rcorder/hash.c

428

next = e->next;

sbin/rcorder/hash.c

430

e->next = *xp;

sbin/rcorder/hash.h

56

struct Hash_Entry *next; /* Used to link together all the

sbin/rcorder/rcorder.c

103

f_reqnode *next;

sbin/rcorder/rcorder.c

108

strnodelist *next;

sbin/rcorder/rcorder.c

115

filenode *next, *last;

sbin/rcorder/rcorder.c

220

ent->next = *listp;

sbin/rcorder/rcorder.c

251

temp->next = fn_head->next;

sbin/rcorder/rcorder.c

252

if (temp->next != NULL)

sbin/rcorder/rcorder.c

253

temp->next->last = temp;

sbin/rcorder/rcorder.c

255

fn_head->next = temp;

sbin/rcorder/rcorder.c

274

rnode->next = fnode->req_list;

sbin/rcorder/rcorder.c

299

head->last = head->next = NULL;

sbin/rcorder/rcorder.c

338

head->next->fnode->filename);

sbin/rcorder/rcorder.c

346

pnode->next = head->next;

sbin/rcorder/rcorder.c

349

head->next = pnode;

sbin/rcorder/rcorder.c

350

if (pnode->next != NULL)

sbin/rcorder/rcorder.c

351

pnode->next->last = pnode;

sbin/rcorder/rcorder.c

355

f_pnode->next = fnode->prov_list;

sbin/rcorder/rcorder.c

370

bf_ent->next = bl_list;

sbin/rcorder/rcorder.c

534

head->last = head->next = NULL;

sbin/rcorder/rcorder.c

541

pnode->next = head->next;

sbin/rcorder/rcorder.c

544

head->next = pnode;

sbin/rcorder/rcorder.c

545

if (pnode->next != NULL)

sbin/rcorder/rcorder.c

546

pnode->next->last = pnode;

sbin/rcorder/rcorder.c

550

f_pnode->next = node->prov_list;

sbin/rcorder/rcorder.c

573

bl = bl_list->next;

sbin/rcorder/rcorder.c

582

for (pnode = Hash_GetValue(entry); pnode; pnode = pnode->next) {

sbin/rcorder/rcorder.c

588

rnode->next = pnode->fnode->req_list;

sbin/rcorder/rcorder.c

644

if (head->next == NULL)

sbin/rcorder/rcorder.c

664

while (head->next != NULL)

sbin/rcorder/rcorder.c

665

do_file(head->next->fnode);

sbin/rcorder/rcorder.c

674

for (s = skip_list; s; s = s->next)

sbin/rcorder/rcorder.c

675

for (k = fnode->keyword_list; k; k = k->next)

sbin/rcorder/rcorder.c

688

for (s = keep_list; s; s = s->next)

sbin/rcorder/rcorder.c

689

for (k = fnode->keyword_list; k; k = k->next)

sbin/rcorder/rcorder.c

738

r = r->next;

sbin/rcorder/rcorder.c

750

if (pnode->next != NULL) {

sbin/rcorder/rcorder.c

751

pnode->next->last = pnode->last;

sbin/rcorder/rcorder.c

754

pnode->last->next = pnode->next;

sbin/rcorder/rcorder.c

757

p = p->next;

sbin/rcorder/rcorder.c

769

if (fnode->next != NULL) {

sbin/rcorder/rcorder.c

770

fnode->next->last = fnode->last;

sbin/rcorder/rcorder.c

773

fnode->last->next = fnode->next;

sbin/rcorder/rcorder.c

804

for (file = fn_head->next; file; file = file->next) {

sbin/rcorder/rcorder.c

805

for (f_prov = file->prov_list; f_prov; f_prov = f_prov->next) {

sbin/rcorder/rcorder.c

819

for (scan = onetime_list; scan; scan = scan->next) {

sbin/rcorder/rcorder.c

820

for (file = fn_head->next; file; file = file->next) {

sbin/rcorder/rcorder.c

821

for (f_prov = file->prov_list; f_prov; f_prov = f_prov->next) {

sbin/rcorder/rcorder.c

832

while (fn_head->next != NULL) {

sbin/rcorder/rcorder.c

834

fn_head->next->filename));

sbin/rcorder/rcorder.c

835

do_file(fn_head->next);

sbin/rcorder/rcorder.c

92

provnode *next, *last;

sbin/rcorder/rcorder.c

98

f_provnode *next;

sbin/restore/restore.c

624

goto next;

sbin/restore/restore.c

647

next:

sbin/restore/restore.c

663

ufs1_ino_t first, next, last;

sbin/restore/restore.c

703

next = lowerbnd(curfile.ino);

sbin/restore/restore.c

704

while (next > curfile.ino && volno == curvol)

sbin/restore/restore.c

717

next = first;

sbin/restore/restore.c

729

while (next < curfile.ino) {

sbin/restore/restore.c

730

ep = lookupino(next);

sbin/restore/restore.c

735

next = lowerbnd(next);

sbin/restore/restore.c

741

if (next == curfile.ino && next <= last) {

sbin/restore/restore.c

742

ep = lookupino(next);

sbin/restore/symtab.c

114

struct entry *next;

sbin/restore/symtab.c

120

for (next = *prev; next != NULL; next = next->e_next) {

sbin/restore/symtab.c

121

if (next->e_ino == inum) {

sbin/restore/symtab.c

122

next->e_ino = 0;

sbin/restore/symtab.c

123

*prev = next->e_next;

sbin/restore/symtab.c

126

prev = &next->e_next;

sbin/restore/symtab.c

365

struct strhdr *next;

sbin/restore/symtab.c

387

np = strtblhdr[len / STRTBLINCR].next;

sbin/restore/symtab.c

389

strtblhdr[len / STRTBLINCR].next = np->next;

sbin/restore/symtab.c

411

np->next = tp->next;

sbin/restore/symtab.c

412

tp->next = np;

sbin/route/route.c

1253

char *buf, *lim, *next;

sbin/route/route.c

1269

for (next = buf; next < lim; next += rtm->rtm_msglen) {

sbin/route/route.c

1270

rtm = (struct rt_msghdr *)next;

sbin/route/route.c

231

char *buf, *next, *lim;

sbin/route/route.c

283

for (next = buf; next < lim; next += rtm->rtm_msglen) {

sbin/route/route.c

284

rtm = (struct rt_msghdr *)next;

sbin/route/route.c

299

rlen = write(s, next, rtm->rtm_msglen);

sbin/route/show.c

104

char *buf = NULL, *next, *lim = NULL;

sbin/route/show.c

165

for (next = buf; next < lim; next += rtm->rtm_msglen) {

sbin/route/show.c

166

rtm = (struct rt_msghdr *)next;

sbin/routed/rtquery/rtquery.c

340

struct seen *next;

sbin/routed/rtquery/rtquery.c

416

for (sp = seen; sp != NULL; sp = sp->next) {

sbin/routed/rtquery/rtquery.c

428

sp->next = seen;

sbin/routed/table.c

1026

char *next, *lim;

sbin/routed/table.c

1067

for (next = sysctl_buf; next < lim; next += rtm->rtm_msglen) {

sbin/routed/table.c

1068

rtm = (struct rt_msghdr *)next;

sbin/routed/table.c

1078

(struct sockaddr *)(next + rtm->rtm_msglen),

sbin/svc/remote.c

179

CHead = scan->next;

sbin/svc/remote.c

223

conn->next = *CNextP;

sbin/svc/remote.c

41

struct SvcConnect *next;

sbin/svc/remote.c

78

conn->next = *CNextP;

share/examples/sunrpc/dir/dir_proc.c

45

nlp = &nl->next;

share/examples/sunrpc/dir/rls.c

78

for (nl = result->readdir_res_u.list; nl != NULL; nl = nl->next) {

stand/boot/common/do_dloader.c

218

struct includeline *next;

stand/boot/common/do_dloader.c

273

sp->next = NULL;

stand/boot/common/do_dloader.c

278

se->next = sp;

stand/boot/common/do_dloader.c

289

for (sp = script; sp != NULL; sp = sp->next) {

stand/boot/common/do_dloader.c

321

script = script->next;

stand/boot/common/isapnp.h

276

struct pnp_dlist_node *next;

stand/boot/dloader/cmds.c

625

dvar_execp = &(*dvar_execp)->next;

stand/boot/dloader/cmds.c

632

for (dvar = dvar_exec; dvar; dvar = dvar->next) {

stand/boot/dloader/dloader.h

41

struct dvar *next;

stand/boot/dloader/subs.c

116

lastp = &var->next;

stand/boot/dloader/subs.c

125

lastp = &var->next;

stand/boot/dloader/subs.c

139

return(var->next);

stand/boot/dloader/subs.c

151

return(&var->next);

stand/boot/dloader/subs.c

159

if (dvlastp == &dvar->next)

stand/boot/dloader/subs.c

161

*lastp = dvar->next;

stand/boot/dloader/subs.c

48

for (var = dvbase; var; var = var->next) {

stand/boot/dloader/subs.c

60

for (var = dvbase; var; var = var->next) {

stand/boot/dloader/subs.c

68

var->next = NULL;

stand/boot/dloader/subs.c

70

dvlastp = &var->next;

stand/boot/efi/boot1/boot1.c

341

for (dev = mod->devices(); dev != NULL; dev = dev->next) {

stand/boot/efi/boot1/boot1.c

545

devinfo->next = NULL;

stand/boot/efi/boot1/boot1.c

733

for (dev = *devinfop; dev->next != NULL; dev = dev->next)

stand/boot/efi/boot1/boot1.c

736

dev->next = devinfo;

stand/boot/efi/boot1/boot_module.h

54

struct dev_info *next;

stand/boot/efi/boot1/ufs_module.c

178

for (dev = devices, i = 0; dev != NULL; dev = dev->next, i++)

stand/lib/ext2fs.c

769

goto next;

stand/lib/ext2fs.c

777

next:

stand/lib/ufs.c

373

goto next;

stand/lib/ufs.c

375

goto next;

stand/lib/ufs.c

388

next:

sys/bus/firewire/firewire.c

1591

struct fw_device *fwdev, *next;

sys/bus/firewire/firewire.c

1597

for (fwdev = STAILQ_FIRST(&fc->devices); fwdev != NULL; fwdev = next) {

sys/bus/firewire/firewire.c

1598

next = STAILQ_NEXT(fwdev, link);

sys/bus/firewire/firewire.c

457

struct csrdir *csrd, *next;

sys/bus/firewire/firewire.c

479

for (csrd = SLIST_FIRST(&sc->fc->csrfree); csrd != NULL; csrd = next) {

sys/bus/firewire/firewire.c

480

next = SLIST_NEXT(csrd, link);

sys/bus/firewire/firewire.c

859

struct fw_xfer *xfer, *next;

sys/bus/firewire/firewire.c

876

for (xfer = STAILQ_FIRST(&fwb->xferlist); xfer != NULL; xfer = next) {

sys/bus/firewire/firewire.c

877

next = STAILQ_NEXT(xfer, link);

sys/bus/firewire/fwohci.c

2242

struct fwohcidb *prev, *next = NULL;

sys/bus/firewire/fwohci.c

2291

next = np->db;

sys/bus/firewire/fwohci.c

2293

next = NULL;

sys/bus/firewire/fwohci.c

2314

print_db(np, next, ch, dbch->ndesc);

sys/bus/u4b/audio/uaudio.c

172

struct uaudio_mixer_node *next;

sys/bus/u4b/audio/uaudio.c

2754

for (pmc = sc->sc_mixer_root; pmc != NULL; pmc = pmc->next) {

sys/bus/u4b/audio/uaudio.c

2794

sc->sc_mixer_root = p_mc->next;

sys/bus/u4b/audio/uaudio.c

2817

pmc = pmc->next, n++) {

sys/bus/u4b/audio/uaudio.c

3020

for (pmc = sc->sc_mixer_root; pmc != NULL; pmc = pmc->next) {

sys/bus/u4b/audio/uaudio.c

3043

p_mc_new->next = sc->sc_mixer_root;

sys/bus/u4b/audio/uaudio.c

5205

mc = mc->next;

sys/bus/u4b/audio/uaudio.c

5332

mc = mc->next) {

sys/bus/u4b/audio/uaudio.c

5397

for (mc = sc->sc_mixer_root; mc != NULL; mc = mc->next) {

sys/bus/u4b/audio/uaudio.c

5418

mc = mc->next) {

sys/bus/u4b/controller/ehci.c

1013

sqh->next = last->next;

sys/bus/u4b/controller/ehci.c

1024

last->next = sqh;

sys/bus/u4b/controller/ehci.c

1040

std->prev->next = std->next;

sys/bus/u4b/controller/ehci.c

1045

if (std->next) {

sys/bus/u4b/controller/ehci.c

1046

std->next->prev = std->prev;

sys/bus/u4b/controller/ehci.c

1047

usb_pc_cpu_flush(std->next->page_cache);

sys/bus/u4b/controller/ehci.c

1060

std->prev->next = std->next;

sys/bus/u4b/controller/ehci.c

1065

if (std->next) {

sys/bus/u4b/controller/ehci.c

1066

std->next->prev = std->prev;

sys/bus/u4b/controller/ehci.c

1067

usb_pc_cpu_flush(std->next->page_cache);

sys/bus/u4b/controller/ehci.c

1083

sqh->prev->next = sqh->next;

sys/bus/u4b/controller/ehci.c

1088

if (sqh->next) {

sys/bus/u4b/controller/ehci.c

1089

sqh->next->prev = sqh->prev;

sys/bus/u4b/controller/ehci.c

1090

usb_pc_cpu_flush(sqh->next->page_cache);

sys/bus/u4b/controller/ehci.c

956

std->next = last->next;

sys/bus/u4b/controller/ehci.c

966

last->next = std;

sys/bus/u4b/controller/ehci.c

982

std->next = last->next;

sys/bus/u4b/controller/ehci.c

992

last->next = std;

sys/bus/u4b/controller/ehci.h

113

struct ehci_itd *next;

sys/bus/u4b/controller/ehci.h

161

struct ehci_sitd *next;

sys/bus/u4b/controller/ehci.h

269

struct ehci_qh *next;

sys/bus/u4b/controller/ohci.c

364

ed_x->next = NULL;

sys/bus/u4b/controller/ohci.c

381

ed_int->next = ed_isc;

sys/bus/u4b/controller/ohci.c

662

sed->next = last->next;

sys/bus/u4b/controller/ohci.c

674

last->next = sed;

sys/bus/u4b/controller/ohci.c

693

sed->prev->next = sed->next;

sys/bus/u4b/controller/ohci.c

698

if (sed->next) {

sys/bus/u4b/controller/ohci.c

699

sed->next->prev = sed->prev;

sys/bus/u4b/controller/ohci.c

700

usb_pc_cpu_flush(sed->next->page_cache);

sys/bus/u4b/controller/ohci.h

100

struct ohci_ed *next;

sys/bus/u4b/controller/uhci.c

550

td_x->next = NULL;

sys/bus/u4b/controller/uhci.c

605

td_lst->next = 0;

sys/bus/u4b/controller/uhci.c

74

#define alt_next next

sys/bus/u4b/controller/uhci.c

898

std->next = last->next;

sys/bus/u4b/controller/uhci.c

908

last->next = std;

sys/bus/u4b/controller/uhci.c

960

std->prev->next = std->next;

sys/bus/u4b/controller/uhci.c

965

if (std->next) {

sys/bus/u4b/controller/uhci.c

966

std->next->prev = std->prev;

sys/bus/u4b/controller/uhci.c

967

usb_pc_cpu_flush(std->next->page_cache);

sys/bus/u4b/controller/uhci.h

107

struct uhci_td *next;

sys/bus/u4b/controller/xhci.h

382

struct xhci_td *next;

sys/bus/u4b/usb_generic.c

1828

struct usb_device *next;

sys/bus/u4b/usb_generic.c

1838

next = udev;

sys/bus/u4b/usb_generic.c

1839

while (next->parent_hub != NULL) {

sys/bus/u4b/usb_generic.c

1841

next = next->parent_hub;

sys/bus/u4b/usb_generic.c

1852

next = udev;

sys/bus/u4b/usb_generic.c

1853

while (next->parent_hub != NULL) {

sys/bus/u4b/usb_generic.c

1854

dpp->udp_port_no[--nlevel] = next->port_no;

sys/bus/u4b/usb_generic.c

1855

next = next->parent_hub;

sys/bus/u4b/wlan/if_mtw.c

2773

STAILQ_INSERT_TAIL(&pq->tx_fh, data, next);

sys/bus/u4b/wlan/if_mtw.c

2808

STAILQ_REMOVE_HEAD(&pq->tx_qh, next);

sys/bus/u4b/wlan/if_mtw.c

3149

STAILQ_REMOVE_HEAD(&sc->sc_epq[qid].tx_fh, next);

sys/bus/u4b/wlan/if_mtw.c

3219

STAILQ_INSERT_TAIL(&sc->sc_epq[qid].tx_qh, data, next);

sys/bus/u4b/wlan/if_mtw.c

3267

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_mtw.c

3292

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_mtw.c

3334

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_mtw.c

3358

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_mtw.c

3412

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_mtw.c

3442

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_mtw.c

962

STAILQ_INSERT_TAIL(&pq->tx_fh, data, next);

sys/bus/u4b/wlan/if_mtwvar.h

124

STAILQ_ENTRY(mtw_tx_data) next;

sys/bus/u4b/wlan/if_mtwvar.h

139

STAILQ_ENTRY(mtw_rx_data) next;

sys/bus/u4b/wlan/if_mtwvar.h

193

int next;

sys/bus/u4b/wlan/if_rum.c

1054

STAILQ_REMOVE_HEAD(&sc->tx_q, next);

sys/bus/u4b/wlan/if_rum.c

1413

STAILQ_REMOVE_HEAD(&sc->tx_free, next);

sys/bus/u4b/wlan/if_rum.c

1422

STAILQ_INSERT_TAIL(&sc->tx_q, data, next);

sys/bus/u4b/wlan/if_rum.c

1479

STAILQ_REMOVE_HEAD(&sc->tx_free, next);

sys/bus/u4b/wlan/if_rum.c

1531

STAILQ_INSERT_TAIL(&sc->tx_q, data, next);

sys/bus/u4b/wlan/if_rum.c

1577

STAILQ_REMOVE_HEAD(&sc->tx_free, next);

sys/bus/u4b/wlan/if_rum.c

1591

STAILQ_INSERT_TAIL(&sc->tx_q, data, next);

sys/bus/u4b/wlan/if_rum.c

1671

STAILQ_REMOVE_HEAD(&sc->tx_free, next);

sys/bus/u4b/wlan/if_rum.c

1695

STAILQ_INSERT_TAIL(&sc->tx_q, data, next);

sys/bus/u4b/wlan/if_rum.c

783

STAILQ_INSERT_TAIL(&sc->tx_free, data, next);

sys/bus/u4b/wlan/if_rum.c

801

STAILQ_INSERT_TAIL(&sc->tx_free, data, next);

sys/bus/u4b/wlan/if_rumvar.h

65

STAILQ_ENTRY(rum_tx_data) next;

sys/bus/u4b/wlan/if_run.c

1083

STAILQ_INSERT_TAIL(&pq->tx_fh, data, next);

sys/bus/u4b/wlan/if_run.c

3050

STAILQ_INSERT_TAIL(&pq->tx_fh, data, next);

sys/bus/u4b/wlan/if_run.c

3086

STAILQ_REMOVE_HEAD(&pq->tx_qh, next);

sys/bus/u4b/wlan/if_run.c

3367

STAILQ_REMOVE_HEAD(&sc->sc_epq[qid].tx_fh, next);

sys/bus/u4b/wlan/if_run.c

3433

STAILQ_INSERT_TAIL(&sc->sc_epq[qid].tx_qh, data, next);

sys/bus/u4b/wlan/if_run.c

3482

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_run.c

3503

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_run.c

3567

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_run.c

3591

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_run.c

3647

STAILQ_REMOVE_HEAD(&sc->sc_epq[0].tx_fh, next);

sys/bus/u4b/wlan/if_run.c

3670

STAILQ_INSERT_TAIL(&sc->sc_epq[0].tx_qh, data, next);

sys/bus/u4b/wlan/if_runvar.h

89

STAILQ_ENTRY(run_tx_data) next;

sys/bus/u4b/wlan/if_urtwn.c

1137

struct mbuf *m = NULL, *next;

sys/bus/u4b/wlan/if_urtwn.c

1148

STAILQ_REMOVE_HEAD(&sc->sc_rx_active, next);

sys/bus/u4b/wlan/if_urtwn.c

1150

STAILQ_INSERT_TAIL(&sc->sc_rx_inactive, data, next);

sys/bus/u4b/wlan/if_urtwn.c

1159

STAILQ_REMOVE_HEAD(&sc->sc_rx_inactive, next);

sys/bus/u4b/wlan/if_urtwn.c

1160

STAILQ_INSERT_TAIL(&sc->sc_rx_active, data, next);

sys/bus/u4b/wlan/if_urtwn.c

1171

next = m->m_next;

sys/bus/u4b/wlan/if_urtwn.c

1197

m = next;

sys/bus/u4b/wlan/if_urtwn.c

1204

STAILQ_REMOVE_HEAD(&sc->sc_rx_active, next);

sys/bus/u4b/wlan/if_urtwn.c

1205

STAILQ_INSERT_TAIL(&sc->sc_rx_inactive, data, next);

sys/bus/u4b/wlan/if_urtwn.c

1251

STAILQ_INSERT_TAIL(&sc->sc_tx_inactive, data, next);

sys/bus/u4b/wlan/if_urtwn.c

1294

STAILQ_INSERT_HEAD(&sc->sc_rx_inactive, &sc->sc_rx[i], next);

sys/bus/u4b/wlan/if_urtwn.c

1314

STAILQ_INSERT_HEAD(&sc->sc_tx_inactive, &sc->sc_tx[i], next);

sys/bus/u4b/wlan/if_urtwn.c

1366

STAILQ_REMOVE_HEAD(&sc->sc_tx_active, next);

sys/bus/u4b/wlan/if_urtwn.c

1378

STAILQ_REMOVE_HEAD(&sc->sc_tx_pending, next);

sys/bus/u4b/wlan/if_urtwn.c

1379

STAILQ_INSERT_TAIL(&sc->sc_tx_active, data, next);

sys/bus/u4b/wlan/if_urtwn.c

1388

STAILQ_REMOVE_HEAD(&sc->sc_tx_active, next);

sys/bus/u4b/wlan/if_urtwn.c

1437

STAILQ_REMOVE_HEAD(&sc->sc_tx_inactive, next);

sys/bus/u4b/wlan/if_urtwn.c

3231

STAILQ_INSERT_TAIL(&sc->sc_tx_pending, data, next);

sys/bus/u4b/wlan/if_urtwn.c

3281

STAILQ_INSERT_HEAD(&sc->sc_tx_inactive, bf, next);

sys/bus/u4b/wlan/if_urtwn.c

5560

STAILQ_INSERT_HEAD(&sc->sc_tx_inactive, bf, next);

sys/bus/u4b/wlan/if_urtwnvar.h

74

STAILQ_ENTRY(urtwn_data) next;

sys/cpu/x86_64/misc/cputimer_tsc.c

56

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/acpica/Osd/OsdMemory.c

105

track->next = acpi_mapbase;

sys/dev/acpica/Osd/OsdMemory.c

134

for (ptrack = &acpi_mapbase; (track = *ptrack); ptrack = &track->next) {

sys/dev/acpica/Osd/OsdMemory.c

143

*ptrack = track->next;

sys/dev/acpica/Osd/OsdMemory.c

160

*ptrack = track->next;

sys/dev/acpica/Osd/OsdMemory.c

191

for (track = acpi_mapbase; track != NULL; track = track->next) {

sys/dev/acpica/Osd/OsdMemory.c

45

struct acpi_memtrack *next;

sys/dev/acpica/Osd/OsdMemory.c

96

for (track = acpi_mapbase; track != NULL; track = track->next) {

sys/dev/acpica/acpi_hpet.c

88

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/acpica/acpi_timer.c

65

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/acpica/acpi_video/acpi_video.c

49

STAILQ_ENTRY(acpi_video_output) next;

sys/dev/acpica/acpi_video/acpi_video.c

504

STAILQ_FOREACH(vn, voqh, vo_unit.next) {

sys/dev/acpica/acpi_video/acpi_video.c

532

STAILQ_INSERT_AFTER(voqh, vp, vo, vo_unit.next);

sys/dev/acpica/acpi_video/acpi_video.c

534

STAILQ_INSERT_TAIL(voqh, vo, vo_unit.next);

sys/dev/acpica/acpi_video/acpi_video.c

653

STAILQ_REMOVE(voqh, vo, acpi_video_output, vo_unit.next);

sys/dev/disk/dm/delay/dm_target_delay.c

275

int next = -1;

sys/dev/disk/dm/delay/dm_target_delay.c

291

next = dp->expire;

sys/dev/disk/dm/delay/dm_target_delay.c

293

next = min(next, dp->expire);

sys/dev/disk/dm/delay/dm_target_delay.c

300

callout_reset(&di->cal, next - ticks, _timeout, di);

sys/dev/disk/dm/device-mapper.c

416

TAILQ_FOREACH(table_en, tbl, next) {

sys/dev/disk/dm/device-mapper.c

493

TAILQ_FOREACH(table_en, tbl, next) {

sys/dev/disk/dm/dm.h

75

TAILQ_ENTRY(dm_mapping) next;

sys/dev/disk/dm/dm.h

89

TAILQ_ENTRY(dm_table_entry) next;

sys/dev/disk/dm/dm_ioctl.c

1040

TAILQ_FOREACH(table_en, tbl, next) {

sys/dev/disk/dm/dm_ioctl.c

625

TAILQ_FOREACH(table_en, tbl, next)

sys/dev/disk/dm/dm_ioctl.c

646

TAILQ_FOREACH(map, &table_en->pdev_maps, next) {

sys/dev/disk/dm/dm_ioctl.c

774

TAILQ_INSERT_TAIL(tbl, table_en, next);

sys/dev/disk/dm/dm_ioctl.c

931

TAILQ_FOREACH(table_en, tbl, next) {

sys/dev/disk/dm/dm_table.c

148

TAILQ_REMOVE(tbl, table_en, next);

sys/dev/disk/dm/dm_table.c

187

TAILQ_FOREACH(table_en, tbl, next) {

sys/dev/disk/dm/dm_table.c

225

TAILQ_FOREACH(table_en, tbl, next)

sys/dev/disk/dm/dm_table.c

282

TAILQ_FOREACH(map, &table_en->pdev_maps, next) {

sys/dev/disk/dm/dm_table.c

291

TAILQ_INSERT_TAIL(&table_en->pdev_maps, map, next);

sys/dev/disk/dm/dm_table.c

308

TAILQ_REMOVE(&table_en->pdev_maps, map, next);

sys/dev/disk/isp/isp_freebsd.c

1021

tptr->ntfree = ntp->next;

sys/dev/disk/isp/isp_freebsd.c

1042

ntp->next = tptr->ntfree;

sys/dev/disk/isp/isp_freebsd.c

1073

tptr->atpool[i].next = &tptr->atpool[i+1];

sys/dev/disk/isp/isp_freebsd.c

1074

tptr->ntpool[i].next = &tptr->ntpool[i+1];

sys/dev/disk/isp/isp_freebsd.c

1080

SLIST_INSERT_HEAD(lhp, tptr, next);

sys/dev/disk/isp/isp_freebsd.c

1092

SLIST_REMOVE(lhp, tptr, tstate, next);

sys/dev/disk/isp/isp_freebsd.c

771

isp->isp_osinfo.pcmd_free = ((struct isp_pcmd *)ISP_PCMD(ccb))->next;

sys/dev/disk/isp/isp_freebsd.c

778

((struct isp_pcmd *)ISP_PCMD(ccb))->next = isp->isp_osinfo.pcmd_free;

sys/dev/disk/isp/isp_freebsd.c

828

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

849

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

866

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

888

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

911

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

941

SLIST_FOREACH(tptr, lhp, next) {

sys/dev/disk/isp/isp_freebsd.c

978

tptr->atfree = atp->next;

sys/dev/disk/isp/isp_freebsd.c

995

atp->next = tptr->atfree;

sys/dev/disk/isp/isp_freebsd.h

103

inot_private_data_t *next;

sys/dev/disk/isp/isp_freebsd.h

112

SLIST_ENTRY(tstate) next;

sys/dev/disk/isp/isp_freebsd.h

135

struct isp_pcmd * next;

sys/dev/disk/isp/isp_freebsd.h

77

void * next;

sys/dev/disk/isp/isp_pci.c

1658

pcmd->next = NULL;

sys/dev/disk/isp/isp_pci.c

1660

pcmd->next = &isp->isp_osinfo.pcmd_pool[i+1];

sys/dev/disk/nvme/nvme.c

430

nvme_request_t *next;

sys/dev/disk/nvme/nvme.c

470

next = req->next_avail;

sys/dev/disk/nvme/nvme.c

471

if (atomic_cmpset_ptr(&queue->first_avail, req, next))

sys/dev/disk/nvme/nvme.c

610

nvme_request_t *next;

sys/dev/disk/nvme/nvme.c

618

next = queue->first_avail;

sys/dev/disk/nvme/nvme.c

620

req->next_avail = next;

sys/dev/disk/nvme/nvme.c

621

if (atomic_cmpset_ptr(&queue->first_avail, next, req))

sys/dev/disk/nvme/nvme_disk.c

205

goto next;

sys/dev/disk/nvme/nvme_disk.c

210

next:

sys/dev/disk/sbp/sbp.c

1995

struct fw_xfer *xfer, *next;

sys/dev/disk/sbp/sbp.c

2005

xfer != NULL; xfer = next) {

sys/dev/disk/sbp/sbp.c

2006

next = STAILQ_NEXT(xfer, link);

sys/dev/disk/sbp/sbp.c

2021

struct fw_xfer *xfer, *next;

sys/dev/disk/sbp/sbp.c

2044

xfer != NULL; xfer = next) {

sys/dev/disk/sbp/sbp.c

2045

next = STAILQ_NEXT(xfer, link);

sys/dev/disk/sbp/sbp.c

2574

struct sbp_ocb *next;

sys/dev/disk/sbp/sbp.c

2584

for (ocb = STAILQ_FIRST(&sdev->ocbs); ocb != NULL; ocb = next) {

sys/dev/disk/sbp/sbp.c

2585

next = STAILQ_NEXT(ocb, ocb);

sys/dev/disk/sbp/sbp.c

2601

if (next != NULL)

sys/dev/disk/sbp/sbp.c

2602

sbp_orb_pointer(sdev, next);

sys/dev/disk/sbp/sbp.c

2715

struct sbp_ocb *ocb, *next;

sys/dev/disk/sbp/sbp.c

2721

for (ocb = STAILQ_FIRST(&temp); ocb != NULL; ocb = next) {

sys/dev/disk/sbp/sbp.c

2722

next = STAILQ_NEXT(ocb, ocb);

sys/dev/disk/sbp/sbp.c

478

goto next;

sys/dev/disk/sbp/sbp.c

497

goto next;

sys/dev/disk/sbp/sbp.c

507

goto next;

sys/dev/disk/sbp/sbp.c

526

goto next;

sys/dev/disk/sbp/sbp.c

530

next:

sys/dev/disk/sym/sym_hipd.c

380

struct m_link *next;

sys/dev/disk/sym/sym_hipd.c

384

struct m_vtob *next;

sys/dev/disk/sym/sym_hipd.c

407

struct m_pool *next;

sys/dev/disk/sym/sym_hipd.c

428

while (!h[j].next) {

sys/dev/disk/sym/sym_hipd.c

430

h[j].next = (m_link_s *) M_GETP();

sys/dev/disk/sym/sym_hipd.c

431

if (h[j].next)

sys/dev/disk/sym/sym_hipd.c

432

h[j].next->next = NULL;

sys/dev/disk/sym/sym_hipd.c

438

a = (m_addr_t) h[j].next;

sys/dev/disk/sym/sym_hipd.c

440

h[j].next = h[j].next->next;

sys/dev/disk/sym/sym_hipd.c

444

h[j].next = (m_link_s *) (a+s);

sys/dev/disk/sym/sym_hipd.c

445

h[j].next->next = NULL;

sys/dev/disk/sym/sym_hipd.c

485

while (q->next && q->next != (m_link_s *) b) {

sys/dev/disk/sym/sym_hipd.c

486

q = q->next;

sys/dev/disk/sym/sym_hipd.c

488

if (!q->next) {

sys/dev/disk/sym/sym_hipd.c

489

((m_link_s *) a)->next = h[i].next;

sys/dev/disk/sym/sym_hipd.c

490

h[i].next = (m_link_s *) a;

sys/dev/disk/sym/sym_hipd.c

493

q->next = q->next->next;

sys/dev/disk/sym/sym_hipd.c

614

vbp->next = mp->vtob[hc];

sys/dev/disk/sym/sym_hipd.c

640

vbpp = &(*vbpp)->next;

sys/dev/disk/sym/sym_hipd.c

643

*vbpp = (*vbpp)->next;

sys/dev/disk/sym/sym_hipd.c

656

for (mp = mp0.next; mp && mp->dev_dmat != dev_dmat; mp = mp->next);

sys/dev/disk/sym/sym_hipd.c

677

mp->next = mp0.next;

sys/dev/disk/sym/sym_hipd.c

678

mp0.next = mp;

sys/dev/disk/sym/sym_hipd.c

690

struct m_pool **pp = &mp0.next;

sys/dev/disk/sym/sym_hipd.c

693

pp = &(*pp)->next;

sys/dev/disk/sym/sym_hipd.c

695

*pp = (*pp)->next;

sys/dev/disk/sym/sym_hipd.c

750

vp = vp->next;

sys/dev/drm/amd/amdgpu/amdgpu_device.c

3175

struct dma_fence *fence = NULL, *next = NULL;

sys/dev/drm/amd/amdgpu/amdgpu_device.c

3193

r = amdgpu_bo_restore_shadow(shadow, &next);

sys/dev/drm/amd/amdgpu/amdgpu_device.c

3200

fence = next;

sys/dev/drm/amd/amdgpu/amdgpu_device.c

3204

fence = next;

sys/dev/drm/amd/amdgpu/amdgpu_gfx.c

125

char *next;

sys/dev/drm/amd/amdgpu/amdgpu_gfx.c

140

next = strchr(p, ',');

sys/dev/drm/amd/amdgpu/amdgpu_gfx.c

141

if (!next)

sys/dev/drm/amd/amdgpu/amdgpu_gfx.c

143

p = next + 1;

sys/dev/drm/amd/amdgpu/amdgpu_mn.c

521

head = bo->mn_list.next;

sys/dev/drm/amd/amdgpu/amdgpu_sa.c

118

if (sa_manager->hole->next == &sa_manager->olist)

sys/dev/drm/amd/amdgpu/amdgpu_sa.c

121

sa_bo = list_entry(sa_manager->hole->next, struct amdgpu_sa_bo, olist);

sys/dev/drm/amd/amdgpu/amdgpu_sa.c

145

if (hole->next != &sa_manager->olist) {

sys/dev/drm/amd/amdgpu/amdgpu_sa.c

146

return list_entry(hole->next, struct amdgpu_sa_bo, olist)->soffset;

sys/dev/drm/amd/amdgpu/amdgpu_sa.c

214

if (sa_manager->hole->next == &sa_manager->olist) {

sys/dev/drm/amd/amdgpu/amdgpu_ttm.c

434

struct dma_fence *next;

sys/dev/drm/amd/amdgpu/amdgpu_ttm.c

472

resv, &next, false, true);

sys/dev/drm/amd/amdgpu/amdgpu_ttm.c

477

fence = next;

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

1252

for (base = bo->vm_bo; base; base = base->next) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2675

struct amdgpu_bo_va_mapping *before, *after, *tmp, *next;

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2727

list_for_each_entry_safe(tmp, next, &removed, list) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2824

struct amdgpu_bo_va_mapping *mapping, *next;

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2834

base = &(*base)->next) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2838

*base = bo_va->base.next;

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2847

list_for_each_entry_safe(mapping, next, &bo_va->valids, list) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2854

list_for_each_entry_safe(mapping, next, &bo_va->invalids, list) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

2883

for (bo_base = bo->vm_bo; bo_base; bo_base = bo_base->next) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

397

base->next = NULL;

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

402

base->next = bo->vm_bo;

sys/dev/drm/amd/amdgpu/amdgpu_vm.h

132

struct amdgpu_vm_bo_base *next;

sys/dev/drm/amd/powerplay/inc/power_state.h

41

struct pp_power_state *next;

sys/dev/drm/amd/powerplay/inc/smu_ucode_xfer_cz.h

116

uint16_t next;

sys/dev/drm/amd/powerplay/smumgr/smu8_smumgr.c

343

task->next = is_last ? END_OF_TASK_LIST : smu8_smu->toc_entry_used_count;

sys/dev/drm/amd/powerplay/smumgr/smu8_smumgr.c

380

task->next = is_last ? END_OF_TASK_LIST : smu8_smu->toc_entry_used_count;

sys/dev/drm/drm_agpsupport.c

240

entry->next = dev->agp->memory;

sys/dev/drm/drm_agpsupport.c

284

for (entry = dev->agp->memory; entry; entry = entry->next) {

sys/dev/drm/drm_agpsupport.c

439

entry->prev->next = entry->next;

sys/dev/drm/drm_agpsupport.c

441

dev->agp->memory = entry->next;

sys/dev/drm/drm_agpsupport.c

442

if (entry->next)

sys/dev/drm/drm_agpsupport.c

443

entry->next->prev = entry->prev;

sys/dev/drm/drm_agpsupport.c

530

nexte = entry->next;

sys/dev/drm/drm_bridge.c

141

previous->next = bridge;

sys/dev/drm/drm_bridge.c

201

ret = ret && drm_bridge_mode_fixup(bridge->next, mode, adjusted_mode);

sys/dev/drm/drm_bridge.c

236

return drm_bridge_mode_valid(bridge->next, mode);

sys/dev/drm/drm_bridge.c

255

drm_bridge_disable(bridge->next);

sys/dev/drm/drm_bridge.c

280

drm_bridge_post_disable(bridge->next);

sys/dev/drm/drm_bridge.c

306

drm_bridge_mode_set(bridge->next, mode, adjusted_mode);

sys/dev/drm/drm_bridge.c

326

drm_bridge_pre_enable(bridge->next);

sys/dev/drm/drm_bridge.c

351

drm_bridge_enable(bridge->next);

sys/dev/drm/drm_bufs.c

1152

buf->next = NULL;

sys/dev/drm/drm_bufs.c

790

buf->next = NULL;

sys/dev/drm/drm_bufs.c

989

buf->next = NULL;

sys/dev/drm/drm_connector.c

632

if (lhead->next == &config->connector_list) {

sys/dev/drm/drm_connector.c

637

lhead = lhead->next;

sys/dev/drm/drm_dp_mst_topology.c

1009

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

1037

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

1180

list_add(&port->next, &mstb->ports);

sys/dev/drm/drm_dp_mst_topology.c

1209

list_del(&port->next);

sys/dev/drm/drm_dp_mst_topology.c

1285

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

1314

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

1353

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

1559

txmsg = list_first_entry(&mgr->tx_msg_downq, struct drm_dp_sideband_msg_tx, next);

sys/dev/drm/drm_dp_mst_topology.c

1563

list_del(&txmsg->next);

sys/dev/drm/drm_dp_mst_topology.c

1566

list_del(&txmsg->next);

sys/dev/drm/drm_dp_mst_topology.c

1593

list_add_tail(&txmsg->next, &mgr->tx_msg_downq);

sys/dev/drm/drm_dp_mst_topology.c

2967

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

3105

port = list_first_entry_or_null(&mgr->destroy_connector_list, struct drm_dp_mst_port, next);

sys/dev/drm/drm_dp_mst_topology.c

3110

list_del(&port->next);

sys/dev/drm/drm_dp_mst_topology.c

3114

INIT_LIST_HEAD(&port->next);

sys/dev/drm/drm_dp_mst_topology.c

826

list_del(&txmsg->next);

sys/dev/drm/drm_dp_mst_topology.c

862

if (list_empty(&mstb->port_parent->next))

sys/dev/drm/drm_dp_mst_topology.c

880

if (mstb->port_parent && list_empty(&mstb->port_parent->next))

sys/dev/drm/drm_dp_mst_topology.c

888

list_for_each_entry_safe(port, tmp, &mstb->ports, next) {

sys/dev/drm/drm_dp_mst_topology.c

889

list_del(&port->next);

sys/dev/drm/drm_dp_mst_topology.c

959

list_add(&port->next, &mgr->destroy_connector_list);

sys/dev/drm/drm_dp_mst_topology.c

985

list_for_each_entry(port, &mstb->ports, next) {

sys/dev/drm/drm_encoder.c

168

struct drm_bridge *next;

sys/dev/drm/drm_encoder.c

171

next = bridge->next;

sys/dev/drm/drm_encoder.c

173

bridge = next;

sys/dev/drm/drm_file.c

530

struct pci_bus *b = list_entry(pci_root_buses.next,

sys/dev/drm/drm_legacy.h

102

struct drm_agp_mem *next;

sys/dev/drm/i915/i915_gem.c

5347

freed->next = NULL;

sys/dev/drm/i915/i915_gem_batch_pool.c

57

struct drm_i915_gem_object *obj, *next;

sys/dev/drm/i915/i915_gem_batch_pool.c

59

list_for_each_entry_safe(obj, next,

sys/dev/drm/i915/i915_gem_evict.c

135

struct i915_vma *vma, *next;

sys/dev/drm/i915/i915_gem_evict.c

187

list_for_each_entry_safe(vma, next, &eviction_list, evict_link) {

sys/dev/drm/i915/i915_gem_evict.c

243

list_for_each_entry_safe(vma, next, &eviction_list, evict_link) {

sys/dev/drm/i915/i915_gem_evict.c

252

list_for_each_entry_safe(vma, next, &eviction_list, evict_link) {

sys/dev/drm/i915/i915_gem_evict.c

285

struct i915_vma *vma, *next;

sys/dev/drm/i915/i915_gem_evict.c

373

list_for_each_entry_safe(vma, next, &eviction_list, evict_link) {

sys/dev/drm/i915/i915_gem_evict.c

402

struct i915_vma *vma, *next;

sys/dev/drm/i915/i915_gem_evict.c

432

list_for_each_entry_safe(vma, next, &eviction_list, evict_link) {

sys/dev/drm/i915/i915_gem_execbuffer.c

1829

capture->next = eb->request->capture_list;

sys/dev/drm/i915/i915_gem_shrinker.c

471

struct i915_vma *vma, *next;

sys/dev/drm/i915/i915_gem_shrinker.c

495

list_for_each_entry_safe(vma, next,

sys/dev/drm/i915/i915_gpu_error.c

1419

for (c = request->capture_list; c; c = c->next)

sys/dev/drm/i915/i915_gpu_error.c

1434

for (c = request->capture_list; c; c = c->next) {

sys/dev/drm/i915/i915_request.c

1423

struct i915_request *request, *next;

sys/dev/drm/i915/i915_request.c

1425

list_for_each_entry_safe(request, next,

sys/dev/drm/i915/i915_request.c

341

struct i915_capture_list *next = capture->next;

sys/dev/drm/i915/i915_request.c

344

capture = next;

sys/dev/drm/i915/i915_request.c

411

struct i915_gem_active *active, *next;

sys/dev/drm/i915/i915_request.c

438

list_for_each_entry_safe(active, next, &request->active_list, link) {

sys/dev/drm/i915/i915_request.c

449

prefetchw(next);

sys/dev/drm/i915/i915_request.h

55

struct i915_capture_list *next;

sys/dev/drm/i915/i915_sw_fence.c

138

wait_queue_entry_t *pos, *next;

sys/dev/drm/i915/i915_sw_fence.c

153

list_for_each_entry_safe(pos, next, &x->head, entry) {

sys/dev/drm/i915/i915_sw_fence.c

163

list_for_each_entry_safe(pos, next, &x->head, entry)

sys/dev/drm/i915/i915_syncmap.c

279

struct i915_syncmap *next;

sys/dev/drm/i915/i915_syncmap.c

285

next = kzalloc(sizeof(*next) + KSYNCMAP * sizeof(next),

sys/dev/drm/i915/i915_syncmap.c

287

if (unlikely(!next))

sys/dev/drm/i915/i915_syncmap.c

293

next->height = above + p->height;

sys/dev/drm/i915/i915_syncmap.c

294

next->prefix = __sync_branch_prefix(next, id);

sys/dev/drm/i915/i915_syncmap.c

299

__sync_child(p->parent)[idx] = next;

sys/dev/drm/i915/i915_syncmap.c

302

next->parent = p->parent;

sys/dev/drm/i915/i915_syncmap.c

306

__sync_set_child(next, idx, p);

sys/dev/drm/i915/i915_syncmap.c

307

p->parent = next;

sys/dev/drm/i915/i915_syncmap.c

310

p = next;

sys/dev/drm/i915/i915_syncmap.c

319

next = __sync_child(p)[idx];

sys/dev/drm/i915/i915_syncmap.c

320

if (!next) {

sys/dev/drm/i915/i915_syncmap.c

321

next = __sync_alloc_leaf(p, id);

sys/dev/drm/i915/i915_syncmap.c

322

if (unlikely(!next))

sys/dev/drm/i915/i915_syncmap.c

325

__sync_set_child(p, idx, next);

sys/dev/drm/i915/i915_syncmap.c

326

p = next;

sys/dev/drm/i915/i915_syncmap.c

330

p = next;

sys/dev/drm/i915/i915_utils.h

126

return head->next == list;

sys/dev/drm/i915/i915_utils.h

133

WRITE_ONCE(head->next, first);

sys/dev/drm/i915/i915_vma.c

836

struct i915_vma *vma, *next;

sys/dev/drm/i915/i915_vma.c

838

list_for_each_entry_safe(vma, next, &i915->gt.closed_vma, closed_link) {

sys/dev/drm/i915/intel_breadcrumbs.c

373

struct rb_node *next)

sys/dev/drm/i915/intel_breadcrumbs.c

380

b->irq_wait = to_wait(next);

sys/dev/drm/i915/intel_breadcrumbs.c

387

if (next)

sys/dev/drm/i915/intel_breadcrumbs.c

388

wake_up_process(to_wait(next)->tsk);

sys/dev/drm/i915/intel_breadcrumbs.c

480

struct rb_node *next = rb_next(completed);

sys/dev/drm/i915/intel_breadcrumbs.c

481

GEM_BUG_ON(next == &wait->node);

sys/dev/drm/i915/intel_breadcrumbs.c

482

__intel_breadcrumbs_next(engine, next);

sys/dev/drm/i915/intel_breadcrumbs.c

541

struct rb_node *next;

sys/dev/drm/i915/intel_breadcrumbs.c

550

next = rb_next(&wait->node);

sys/dev/drm/i915/intel_breadcrumbs.c

551

if (chain_wakeup(next, priority)) {

sys/dev/drm/i915/intel_breadcrumbs.c

565

while (i915_seqno_passed(seqno, to_wait(next)->seqno)) {

sys/dev/drm/i915/intel_breadcrumbs.c

566

struct rb_node *n = rb_next(next);

sys/dev/drm/i915/intel_breadcrumbs.c

568

__intel_breadcrumbs_finish(b, to_wait(next));

sys/dev/drm/i915/intel_breadcrumbs.c

569

next = n;

sys/dev/drm/i915/intel_breadcrumbs.c

570

if (!chain_wakeup(next, priority))

sys/dev/drm/i915/intel_breadcrumbs.c

575

__intel_breadcrumbs_next(engine, next);

sys/dev/drm/i915/intel_display.c

12734

struct intel_atomic_state *state, *next;

sys/dev/drm/i915/intel_display.c

12738

llist_for_each_entry_safe(state, next, freed, freed)

sys/dev/drm/i915/intel_dsi_vbt.c

461

const u8 *next = data + operation_size;

sys/dev/drm/i915/intel_dsi_vbt.c

466

if (operation_size && data != next) {

sys/dev/drm/i915/intel_lrc.c

1247

if (stack.dfs_link.next == stack.dfs_link.prev)

sys/dev/drm/i915/intel_lrc.c

535

const struct intel_context *next)

sys/dev/drm/i915/intel_lrc.c

537

if (prev != next)

sys/dev/drm/include/drm/drm_bridge.h

280

struct drm_bridge *next;

sys/dev/drm/include/drm/drm_dp_mst_helper.h

375

struct list_head next;

sys/dev/drm/include/drm/drm_dp_mst_helper.h

82

struct list_head next;

sys/dev/drm/include/drm/drm_legacy.h

58

struct drm_buf *next; /**< Kernel-only: used for free list */

sys/dev/drm/include/drm/drm_mm.h

274

return mm->hole_stack.next;

sys/dev/drm/include/drm/drm_mm.h

371

#define drm_mm_for_each_node_safe(entry, next, mm) \

sys/dev/drm/include/drm/drm_mm.h

372

list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list)

sys/dev/drm/include/drm/spsc_queue.h

101

next = READ_ONCE(node->next);

sys/dev/drm/include/drm/spsc_queue.h

102

WRITE_ONCE(queue->head, next);

sys/dev/drm/include/drm/spsc_queue.h

104

if (unlikely(!next)) {

sys/dev/drm/include/drm/spsc_queue.h

108

(long)&node->next, (long) &queue->head) != (long)&node->next) {

sys/dev/drm/include/drm/spsc_queue.h

112

} while (unlikely(!(queue->head = READ_ONCE(node->next))));

sys/dev/drm/include/drm/spsc_queue.h

35

struct spsc_node *next;

sys/dev/drm/include/drm/spsc_queue.h

69

node->next = NULL;

sys/dev/drm/include/drm/spsc_queue.h

73

tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next);

sys/dev/drm/include/drm/spsc_queue.h

91

struct spsc_node *next, *node;

sys/dev/drm/include/linux/interval_tree.h

34

struct interval_tree_node *next;

sys/dev/drm/include/linux/list.h

100

entry->next->prev = entry->prev;

sys/dev/drm/include/linux/list.h

101

entry->prev->next = entry->next;

sys/dev/drm/include/linux/list.h

107

new->next = old->next;

sys/dev/drm/include/linux/list.h

108

new->next->prev = new;

sys/dev/drm/include/linux/list.h

110

new->prev->next = new;

sys/dev/drm/include/linux/list.h

122

struct list_head *next)

sys/dev/drm/include/linux/list.h

125

next->prev = new;

sys/dev/drm/include/linux/list.h

126

new->next = next;

sys/dev/drm/include/linux/list.h

128

prev->next = new;

sys/dev/drm/include/linux/list.h

142

list_entry((ptr)->next, type, member)

sys/dev/drm/include/linux/list.h

151

list_entry(((ptr)->member.next), typeof(*(ptr)), member)

sys/dev/drm/include/linux/list.h

160

for (p = (head)->next; p != (head); p = p->next)

sys/dev/drm/include/linux/list.h

163

for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)

sys/dev/drm/include/linux/list.h

166

for (p = list_entry((h)->next, typeof(*p), field); &p->field != (h); \

sys/dev/drm/include/linux/list.h

167

p = list_entry(p->field.next, typeof(*p), field))

sys/dev/drm/include/linux/list.h

170

for (p = list_entry((h)->next, typeof(*p), field), \

sys/dev/drm/include/linux/list.h

171

n = list_entry(p->field.next, typeof(*p), field); &p->field != (h);\

sys/dev/drm/include/linux/list.h

172

p = n, n = list_entry(n->field.next, typeof(*n), field))

sys/dev/drm/include/linux/list.h

176

p = list_entry((p)->field.next, typeof(*p), field))

sys/dev/drm/include/linux/list.h

193

for (n = list_entry(pos->member.next, typeof(*pos), member); \

sys/dev/drm/include/linux/list.h

195

pos = n, n = list_entry(n->member.next, typeof(*n), member))

sys/dev/drm/include/linux/list.h

212

_list_add(new, head, head->next);

sys/dev/drm/include/linux/list.h

242

first->prev->next = last->next;

sys/dev/drm/include/linux/list.h

243

last->next->prev = first->prev;

sys/dev/drm/include/linux/list.h

244

head->prev->next = first;

sys/dev/drm/include/linux/list.h

246

last->next = head;

sys/dev/drm/include/linux/list.h

252

struct list_head *next)

sys/dev/drm/include/linux/list.h

259

first = list->next;

sys/dev/drm/include/linux/list.h

262

prev->next = first;

sys/dev/drm/include/linux/list.h

263

last->next = next;

sys/dev/drm/include/linux/list.h

264

next->prev = last;

sys/dev/drm/include/linux/list.h

271

_list_splice(list, head, head->next);

sys/dev/drm/include/linux/list.h

285

_list_splice(list, head, head->next);

sys/dev/drm/include/linux/list.h

305

struct hlist_node *next, **pprev;

sys/dev/drm/include/linux/list.h

313

(node)->next = NULL; \

sys/dev/drm/include/linux/list.h

335

if (n->next)

sys/dev/drm/include/linux/list.h

336

n->next->pprev = n->pprev;

sys/dev/drm/include/linux/list.h

337

*n->pprev = n->next;

sys/dev/drm/include/linux/list.h

354

n->next = h->first;

sys/dev/drm/include/linux/list.h

356

h->first->pprev = &n->next;

sys/dev/drm/include/linux/list.h

362

hlist_add_before(struct hlist_node *n, struct hlist_node *next)

sys/dev/drm/include/linux/list.h

365

n->pprev = next->pprev;

sys/dev/drm/include/linux/list.h

366

n->next = next;

sys/dev/drm/include/linux/list.h

367

next->pprev = &n->next;

sys/dev/drm/include/linux/list.h

372

hlist_add_after(struct hlist_node *n, struct hlist_node *next)

sys/dev/drm/include/linux/list.h

375

next->next = n->next;

sys/dev/drm/include/linux/list.h

376

n->next = next;

sys/dev/drm/include/linux/list.h

377

next->pprev = &n->next;

sys/dev/drm/include/linux/list.h

378

if (next->next)

sys/dev/drm/include/linux/list.h

379

next->next->pprev = &next->next;

sys/dev/drm/include/linux/list.h

398

return !list_empty(head) && (head->next == head->prev);

sys/dev/drm/include/linux/list.h

404

struct list_head *new_first = entry->next;

sys/dev/drm/include/linux/list.h

405

list->next = head->next;

sys/dev/drm/include/linux/list.h

406

list->next->prev = list;

sys/dev/drm/include/linux/list.h

408

entry->next = list;

sys/dev/drm/include/linux/list.h

409

head->next = new_first;

sys/dev/drm/include/linux/list.h

43

struct list_head *next;

sys/dev/drm/include/linux/list.h

433

(head->next != entry && head != entry))

sys/dev/drm/include/linux/list.h

449

return list->next == head;

sys/dev/drm/include/linux/list.h

455

for (p = (head)->first; p; p = p->next)

sys/dev/drm/include/linux/list.h

458

for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)

sys/dev/drm/include/linux/list.h

466

pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))

sys/dev/drm/include/linux/list.h

469

for (p = (p)->next; \

sys/dev/drm/include/linux/list.h

47

#define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }

sys/dev/drm/include/linux/list.h

470

p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)

sys/dev/drm/include/linux/list.h

473

for (; p ? (tp = hlist_entry(p, typeof(*tp), field)): NULL; p = p->next)

sys/dev/drm/include/linux/list.h

477

(pos) && ({ n = (pos)->member.next; 1; }); \

sys/dev/drm/include/linux/list.h

56

list->next = list->prev = list;

sys/dev/drm/include/linux/list.h

62

return head->next;

sys/dev/drm/include/linux/list.h

74

return (head->next == head);

sys/dev/drm/include/linux/list.h

80

return (head == head->next) && (head == head->prev);

sys/dev/drm/include/linux/list.h

84

__list_del(struct list_head *prev, struct list_head *next)

sys/dev/drm/include/linux/list.h

86

next->prev = prev;

sys/dev/drm/include/linux/list.h

87

WRITE_ONCE(prev->next, next);

sys/dev/drm/include/linux/list.h

93

__list_del(entry->prev, entry->next);

sys/dev/drm/include/linux/llist.h

32

struct llist_node *next;

sys/dev/drm/include/linux/llist.h

51

struct llist_node *first, *next;

sys/dev/drm/include/linux/llist.h

57

next = first->next;

sys/dev/drm/include/linux/llist.h

58

} while (atomic_cas_ptr(&head->first, first, next) != first);

sys/dev/drm/include/linux/llist.h

69

new->next = first = head->first;

sys/dev/drm/include/linux/llist.h

90

(n = llist_entry(pos->member.next, __typeof(*pos), member), pos); \

sys/dev/drm/include/linux/llist.h

96

(pos) = llist_entry((pos)->member.next, __typeof(*(pos)), member))

sys/dev/drm/include/linux/notifier.h

49

struct notifier_block *next;

sys/dev/drm/include/uapi/drm/drm.h

109

unsigned char next;

sys/dev/drm/linux_interval_tree.c

104

scan = node->next;

sys/dev/drm/linux_interval_tree.c

110

scan = scan->next;

sys/dev/drm/linux_interval_tree.c

40

node->next = scan->next;

sys/dev/drm/linux_interval_tree.c

42

scan->next = node;

sys/dev/drm/linux_interval_tree.c

46

node->next = node;

sys/dev/drm/linux_interval_tree.c

57

while (scan->next != node) {

sys/dev/drm/linux_interval_tree.c

58

scan = scan->next;

sys/dev/drm/linux_interval_tree.c

60

scan->next = node->next;

sys/dev/drm/linux_interval_tree.c

91

scan = scan->next;

sys/dev/drm/linux_list_sort.c

137

tail = tail->next = *first;

sys/dev/drm/linux_list_sort.c

138

*first = (*first)->next;

sys/dev/drm/linux_list_sort.c

144

tail->next = (a != NULL? a : b);

sys/dev/drm/linux_list_sort.c

145

return head.next;

sys/dev/drm/linux_list_sort.c

169

prev = prev->next = *first;

sys/dev/drm/linux_list_sort.c

170

*first = (*first)->next;

sys/dev/drm/linux_list_sort.c

179

prev->next = tail;

sys/dev/drm/linux_list_sort.c

181

prev = prev->next;

sys/dev/drm/linux_list_sort.c

182

tail = tail->next;

sys/dev/drm/linux_list_sort.c

188

prev->next = list;

sys/dev/drm/linux_list_sort.c

70

struct list_head *next;

sys/dev/drm/linux_list_sort.c

78

list_for_each_safe(sorted, next, list) {

sys/dev/drm/linux_list_sort.c

80

sorted->next = NULL;

sys/dev/drm/linux_radix.c

100

if (next == NULL) {

sys/dev/drm/linux_radix.c

106

node = next;

sys/dev/drm/linux_radix.c

94

struct radix_tree_node *next;

sys/dev/drm/linux_radix.c

99

next = node->slots[pos];

sys/dev/drm/linux_scatterlist.c

120

struct scatterlist *sgl, *next;

sys/dev/drm/linux_scatterlist.c

137

next = sgl[max_ents - 1].sl_un.sg;

sys/dev/drm/linux_scatterlist.c

142

next = NULL;

sys/dev/drm/linux_scatterlist.c

147

sgl = next;

sys/dev/drm/linux_wait.c

52

wait_queue_entry_t *curr, *next;

sys/dev/drm/linux_wait.c

55

list_for_each_entry_safe(curr, next, &q->head, entry) {

sys/dev/drm/radeon/radeon_mn.c

328

head = bo->mn_list.next;

sys/dev/drm/radeon/radeon_sa.c

158

if (sa_manager->hole->next == &sa_manager->olist)

sys/dev/drm/radeon/radeon_sa.c

161

sa_bo = list_entry(sa_manager->hole->next, struct radeon_sa_bo, olist);

sys/dev/drm/radeon/radeon_sa.c

184

if (hole->next != &sa_manager->olist) {

sys/dev/drm/radeon/radeon_sa.c

185

return list_entry(hole->next, struct radeon_sa_bo, olist)->soffset;

sys/dev/drm/radeon/radeon_sa.c

255

if (sa_manager->hole->next == &sa_manager->olist) {

sys/dev/drm/radeon/rv6xx_dpm.c

198

struct rv6xx_sclk_stepping next;

sys/dev/drm/radeon/rv6xx_dpm.c

200

next.post_divider = cur->post_divider;

sys/dev/drm/radeon/rv6xx_dpm.c

203

next.vco_frequency = (cur->vco_frequency * (100 + step_size)) / 100;

sys/dev/drm/radeon/rv6xx_dpm.c

205

next.vco_frequency = (cur->vco_frequency * 100 + 99 + step_size) / (100 + step_size);

sys/dev/drm/radeon/rv6xx_dpm.c

207

return next;

sys/dev/drm/radeon/rv6xx_dpm.c

223

struct rv6xx_sclk_stepping next = *cur;

sys/dev/drm/radeon/rv6xx_dpm.c

225

while (rv6xx_can_step_post_div(rdev, &next, target))

sys/dev/drm/radeon/rv6xx_dpm.c

226

next.post_divider--;

sys/dev/drm/radeon/rv6xx_dpm.c

228

return next;

sys/dev/drm/radeon/rv6xx_dpm.c

260

struct rv6xx_sclk_stepping next;

sys/dev/drm/radeon/rv6xx_dpm.c

263

next = rv6xx_next_post_div_step(rdev, &cur, &target);

sys/dev/drm/radeon/rv6xx_dpm.c

265

next = rv6xx_next_vco_step(rdev, &cur, increasing_vco, R600_VCOSTEPPCT_DFLT);

sys/dev/drm/radeon/rv6xx_dpm.c

267

if (rv6xx_reached_stepping_target(rdev, &next, &target, increasing_vco)) {

sys/dev/drm/radeon/rv6xx_dpm.c

270

tiny.post_divider = next.post_divider;

sys/dev/drm/radeon/rv6xx_dpm.c

275

if ((next.post_divider != target.post_divider) &&

sys/dev/drm/radeon/rv6xx_dpm.c

276

(next.vco_frequency != target.vco_frequency)) {

sys/dev/drm/radeon/rv6xx_dpm.c

280

final_vco.post_divider = next.post_divider;

sys/dev/drm/radeon/rv6xx_dpm.c

288

rv6xx_output_stepping(rdev, step_index++, &next);

sys/dev/drm/radeon/rv6xx_dpm.c

290

cur = next;

sys/dev/drm/ttm/ttm_page_alloc_dma.c

1005

list_for_each_entry_safe(d_page, next, &ttm_dma->pages_list,

sys/dev/drm/ttm/ttm_page_alloc_dma.c

1035

list_for_each_entry_safe(d_page, next, &ttm_dma->pages_list,

sys/dev/drm/ttm/ttm_page_alloc_dma.c

993

struct dma_page *d_page, *next;

sys/dev/misc/kbdmux/kbdmux.c

1022

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

1038

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

1068

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

1078

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

1163

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

209

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

215

SLIST_REMOVE(&state->ks_kbds, k, kbdmux_kbd, next);

sys/dev/misc/kbdmux/kbdmux.c

454

SLIST_REMOVE_HEAD(&state->ks_kbds, next);

sys/dev/misc/kbdmux/kbdmux.c

605

SLIST_FOREACH(k, &state->ks_kbds, next) {

sys/dev/misc/kbdmux/kbdmux.c

80

SLIST_ENTRY(kbdmux_kbd) next; /* link to next */

sys/dev/misc/kbdmux/kbdmux.c

906

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

948

SLIST_INSERT_HEAD(&state->ks_kbds, k, next);

sys/dev/misc/kbdmux/kbdmux.c

959

SLIST_FOREACH(k, &state->ks_kbds, next)

sys/dev/misc/kbdmux/kbdmux.c

967

SLIST_REMOVE(&state->ks_kbds, k, kbdmux_kbd, next);

sys/dev/misc/musycc/musycc.c

1275

sc->mdt[ch][i].next = vtophys(sc->mdt[ch][i].snext);

sys/dev/misc/musycc/musycc.c

1277

sc->mdr[ch][i].next = vtophys(sc->mdr[ch][i].snext);

sys/dev/misc/musycc/musycc.c

1280

sc->mdt[ch][i].next = vtophys(sc->mdt[ch][i].snext);

sys/dev/misc/musycc/musycc.c

1282

sc->mdr[ch][i].next = vtophys(sc->mdr[ch][i].snext);

sys/dev/misc/musycc/musycc.c

148

u_int32_t next;

sys/dev/misc/psm/psm.c

3042

goto next;

sys/dev/misc/psm/psm.c

3140

next:

sys/dev/misc/psm/psm.c

5123

goto next;

sys/dev/misc/psm/psm.c

5128

goto next;

sys/dev/misc/psm/psm.c

5136

goto next;

sys/dev/misc/psm/psm.c

5190

goto next;

sys/dev/misc/psm/psm.c

5242

next:

sys/dev/misc/tbridge/safe_mem.c

101

hdrp->next = hdr;

sys/dev/misc/tbridge/safe_mem.c

146

hdr->prev->next = hdr->next;

sys/dev/misc/tbridge/safe_mem.c

147

if (hdr->next != NULL)

sys/dev/misc/tbridge/safe_mem.c

148

hdr->next->prev = hdr->prev;

sys/dev/misc/tbridge/safe_mem.c

150

safe_mem_hdr_first = hdr->next;

sys/dev/misc/tbridge/safe_mem.c

43

struct safe_mem_hdr *next;

sys/dev/misc/tbridge/safe_mem.c

92

hdr->next = NULL;

sys/dev/misc/tbridge/safe_mem.c

98

while (hdrp->next != NULL)

sys/dev/misc/tbridge/safe_mem.c

99

hdrp = hdrp->next;

sys/dev/netif/ath/ath/if_ath.c

3253

struct mbuf *next;

sys/dev/netif/ath/ath/if_ath.c

3445

next = m->m_nextpkt;

sys/dev/netif/ath/ath/if_ath.c

3476

if (next != NULL) {

sys/dev/netif/ath/ath/if_ath.c

3487

ieee80211_free_mbuf(next);

sys/dev/netif/ath/ath/if_ath.c

3490

m = next;

sys/dev/netif/ath/ath/if_ath_rx_edma.c

523

struct ath_buf *bf, *next;

sys/dev/netif/ath/ath/if_ath_rx_edma.c

549

TAILQ_FOREACH_SAFE(bf, &rxlist, bf_list, next) {

sys/dev/netif/ath/ath/if_ath_tx.c

251

struct ath_buf *bf, *next;

sys/dev/netif/ath/ath/if_ath_tx.c

255

TAILQ_FOREACH_SAFE(bf, frags, bf_list, next) {

sys/dev/netif/ath/ath/if_ath_tx.c

3543

goto next;

sys/dev/netif/ath/ath/if_ath_tx.c

3567

next:

sys/dev/netif/ath/ath/if_ath_tx.c

5773

struct ath_tid *tid, *next, *last;

sys/dev/netif/ath/ath/if_ath_tx.c

5797

TAILQ_FOREACH_SAFE(tid, &txq->axq_tidq, axq_qelem, next) {

sys/dev/netif/ath/ath_hal/ah.h

1448

struct ath_desc *next, uint64_t tsf,

sys/dev/netif/ath/ath_hal/ah_regdomain.c

381

int next, b;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

402

next = 0;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

524

if (next >= maxchans){

sys/dev/netif/ath/ath_hal/ah_regdomain.c

577

ic++, next++;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

582

*nchans = next;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

640

int i, j, next, freq;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

642

next = 0;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

652

if (next >= N(AH_PRIVATE(ah)->ah_channels)) {

sys/dev/netif/ath/ath_hal/ah_regdomain.c

669

__func__, next, c->ic_freq, c->ic_flags, freq);

sys/dev/netif/ath/ath_hal/ah_regdomain.c

671

ic = &AH_PRIVATE(ah)->ah_channels[next];

sys/dev/netif/ath/ath_hal/ah_regdomain.c

679

c->ic_devdata = next;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

680

next++;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

683

AH_PRIVATE(ah)->ah_nchan = next;

sys/dev/netif/ath/ath_hal/ah_regdomain.c

685

__func__, nchans, next);

sys/dev/netif/fwe/if_fwe.c

250

struct fw_xfer *xfer, *next;

sys/dev/netif/fwe/if_fwe.c

273

xfer = next) {

sys/dev/netif/fwe/if_fwe.c

274

next = STAILQ_NEXT(xfer, link);

sys/dev/netif/fxp/if_fxp.c

1121

txp = sc->cbl_last->next;

sys/dev/netif/fxp/if_fxp.c

1321

txp = txp->next) {

sys/dev/netif/fxp/if_fxp.c

1486

txp = txp->next) {

sys/dev/netif/fxp/if_fxp.c

1838

txp[i].next = &txp[(i + 1) & FXP_TXCB_MASK];

sys/dev/netif/fxp/if_fxp.c

2195

txp = sc->cbl_last->next;

sys/dev/netif/fxp/if_fxp.c

2224

mcsp->next = sc->cbl_base;

sys/dev/netif/fxp/if_fxpreg.h

216

struct fxp_cb_tx *next;

sys/dev/netif/fxp/if_fxpreg.h

248

struct fxp_cb_tx *next;

sys/dev/netif/iwi/if_iwi.c

1683

while (txq->next != hw) {

sys/dev/netif/iwi/if_iwi.c

1684

data = &txq->data[txq->next];

sys/dev/netif/iwi/if_iwi.c

1685

DPRINTFN(15, ("tx done idx=%u\n", txq->next));

sys/dev/netif/iwi/if_iwi.c

1693

txq->next = (txq->next + 1) % IWI_TX_RING_COUNT;

sys/dev/netif/iwi/if_iwi.c

2802

int i, next, band, b, bstart;

sys/dev/netif/iwi/if_iwi.c

2809

next = 0; /* next open slot */

sys/dev/netif/iwi/if_iwi.c

2819

(next - bstart) | band;

sys/dev/netif/iwi/if_iwi.c

2821

band = b, bstart = next++;

sys/dev/netif/iwi/if_iwi.c

2823

if (next >= IWI_SCAN_CHANNELS) {

sys/dev/netif/iwi/if_iwi.c

2827

scan.channels[next] = ieee80211_chan2ieee(ic, chan);

sys/dev/netif/iwi/if_iwi.c

2828

set_scan_type(&scan, next, scan_type(ss, chan));

sys/dev/netif/iwi/if_iwi.c

2829

next++;

sys/dev/netif/iwi/if_iwi.c

2831

scan.channels[bstart] = (next - bstart) | band;

sys/dev/netif/iwi/if_iwi.c

580

ring->cur = ring->next = 0;

sys/dev/netif/iwi/if_iwi.c

622

ring->cur = ring->next = 0;

sys/dev/netif/iwi/if_iwi.c

647

ring->cur = ring->next = 0;

sys/dev/netif/iwi/if_iwi.c

741

ring->cur = ring->next = 0;

sys/dev/netif/iwi/if_iwivar.h

68

int next;

sys/dev/netif/iwi/if_iwivar.h

89

int next;

sys/dev/netif/iwn/if_iwn.c

1678

uint16_t prev, base, next;

sys/dev/netif/iwn/if_iwn.c

1714

error = iwn_read_prom_data(sc, base, &next, 2);

sys/dev/netif/iwn/if_iwn.c

1717

if (next == 0) /* End of linked-list. */

sys/dev/netif/iwn/if_iwn.c

1720

base = le16toh(next);

sys/dev/netif/iwn/if_iwn.c

8288

goto next;

sys/dev/netif/iwn/if_iwn.c

8356

next: /* TLV fields are 32-bit aligned. */

sys/dev/netif/ix/ixgbe_common.c

2584

u32 addr_count, ixgbe_mc_addr_itr next)

sys/dev/netif/ix/ixgbe_common.c

2613

addr = next(hw, &addr_list, &vmdq);

sys/dev/netif/ix/ixgbe_common.c

2727

u32 mc_addr_count, ixgbe_mc_addr_itr next,

sys/dev/netif/ix/ixgbe_common.c

2751

ixgbe_set_mta(hw, next(hw, &mc_addr_list, &vmdq));

sys/dev/netif/mn/if_mn.c

1170

dp->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

1172

sc->ch[chan]->rl->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

136

vm_offset_t next;

sys/dev/netif/mn/if_mn.c

618

dp->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

620

sc->ch[chan]->xl->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

691

dp->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

708

dp->next = vtophys(dp);

sys/dev/netif/mn/if_mn.c

722

dp->next = vtophys(dp2);

sys/dev/netif/msk/if_msk.c

972

int next;

sys/dev/netif/msk/if_msk.c

992

for (i = 0, next = 0; i < sc->msk_num_port; i++) {

sys/dev/netif/msk/if_msk.c

993

sc->msk_rxqstart[i] = next;

sys/dev/netif/msk/if_msk.c

994

sc->msk_rxqend[i] = next + sc->msk_rxqsize - 1;

sys/dev/netif/msk/if_msk.c

995

next = sc->msk_rxqend[i] + 1;

sys/dev/netif/msk/if_msk.c

996

sc->msk_txqstart[i] = next;

sys/dev/netif/msk/if_msk.c

997

sc->msk_txqend[i] = next + sc->msk_txqsize - 1;

sys/dev/netif/msk/if_msk.c

998

next = sc->msk_txqend[i] + 1;

sys/dev/netif/nfe/if_nfe.c

1161

while (ring->next != ring->cur) {

sys/dev/netif/nfe/if_nfe.c

1165

flags = le16toh(ring->desc64[ring->next].flags);

sys/dev/netif/nfe/if_nfe.c

1167

flags = le16toh(ring->desc32[ring->next].flags);

sys/dev/netif/nfe/if_nfe.c

1172

data = &ring->data[ring->next];

sys/dev/netif/nfe/if_nfe.c

1211

ring->next = (ring->next + 1) % sc->sc_tx_ring_count;

sys/dev/netif/nfe/if_nfe.c

1658

ring->cur = ring->next = 0;

sys/dev/netif/nfe/if_nfe.c

1749

ring->cur = ring->next = 0;

sys/dev/netif/nfe/if_nfe.c

1945

ring->cur = ring->next = 0;

sys/dev/netif/nfe/if_nfe.c

2016

ring->cur = ring->next = 0;

sys/dev/netif/nfe/if_nfevar.h

35

int next;

sys/dev/netif/nfe/if_nfevar.h

73

int next;

sys/dev/netif/oce/oce_if.c

1204

struct mbuf *next = NULL;

sys/dev/netif/oce/oce_if.c

1220

while ((next = drbr_peek(ifp, br)) != NULL) {

sys/dev/netif/oce/oce_if.c

1221

if (oce_tx(sc, &next, queue_index)) {

sys/dev/netif/oce/oce_if.c

1222

if (next == NULL) {

sys/dev/netif/oce/oce_if.c

1225

drbr_putback(ifp, br, next);

sys/dev/netif/oce/oce_if.c

1228

status = drbr_enqueue(ifp, br, next);

sys/dev/netif/oce/oce_if.c

1233

ifp->if_obytes += next->m_pkthdr.len;

sys/dev/netif/oce/oce_if.c

1234

if (next->m_flags & M_MCAST)

sys/dev/netif/oce/oce_if.c

1236

ETHER_BPF_MTAP(ifp, next);

sys/dev/netif/oce/oce_if.c

1472

SLIST_REMOVE_HEAD(&lro->lro_active, next);

sys/dev/netif/ral/rt2560.c

1031

DPRINTFN(sc, 15, "tx done idx=%u\n", sc->txq.next);

sys/dev/netif/ral/rt2560.c

1034

sc->txq.next = (sc->txq.next + 1) % RT2560_TX_RING_COUNT;

sys/dev/netif/ral/rt2560.c

1060

desc = &sc->prioq.desc[sc->prioq.next];

sys/dev/netif/ral/rt2560.c

1061

data = &sc->prioq.data[sc->prioq.next];

sys/dev/netif/ral/rt2560.c

1102

DPRINTFN(sc, 15, "prio done idx=%u\n", sc->prioq.next);

sys/dev/netif/ral/rt2560.c

1105

sc->prioq.next = (sc->prioq.next + 1) % RT2560_PRIO_RING_COUNT;

sys/dev/netif/ral/rt2560.c

1355

data = &sc->bcnq.data[sc->bcnq.next];

sys/dev/netif/ral/rt2560.c

1372

sc->bcnq.next = (sc->bcnq.next + 1) % RT2560_BEACON_RING_COUNT;

sys/dev/netif/ral/rt2560.c

474

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2560.c

577

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2560.c

632

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2560.c

742

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2560.c

963

desc = &sc->txq.desc[sc->txq.next];

sys/dev/netif/ral/rt2560.c

964

data = &sc->txq.data[sc->txq.next];

sys/dev/netif/ral/rt2560var.h

74

int next;

sys/dev/netif/ral/rt2560var.h

94

int next;

sys/dev/netif/ral/rt2661.c

484

ring->cur = ring->next = ring->stat = 0;

sys/dev/netif/ral/rt2661.c

584

ring->cur = ring->next = ring->stat = 0;

sys/dev/netif/ral/rt2661.c

638

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2661.c

745

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2661.c

976

desc = &txq->desc[txq->next];

sys/dev/netif/ral/rt2661.c

977

data = &txq->data[txq->next];

sys/dev/netif/ral/rt2661.c

990

DPRINTFN(sc, 15, "tx dma done q=%p idx=%u\n", txq, txq->next);

sys/dev/netif/ral/rt2661.c

992

if (++txq->next >= txq->count) /* faster than % count */

sys/dev/netif/ral/rt2661.c

993

txq->next = 0;

sys/dev/netif/ral/rt2661var.h

70

int next;

sys/dev/netif/ral/rt2661var.h

88

int next;

sys/dev/netif/ral/rt2860.c

1177

while (ring->next != hw) {

sys/dev/netif/ral/rt2860.c

1178

struct rt2860_tx_data *data = ring->data[ring->next];

sys/dev/netif/ral/rt2860.c

1191

SLIST_INSERT_HEAD(&sc->data_pool, data, next);

sys/dev/netif/ral/rt2860.c

1192

ring->data[ring->next] = NULL;

sys/dev/netif/ral/rt2860.c

1195

ring->next = (ring->next + 1) % RT2860_TX_RING_COUNT;

sys/dev/netif/ral/rt2860.c

1744

SLIST_REMOVE_HEAD(&sc->data_pool, next);

sys/dev/netif/ral/rt2860.c

2002

SLIST_REMOVE_HEAD(&sc->data_pool, next);

sys/dev/netif/ral/rt2860.c

592

SLIST_INSERT_HEAD(&sc->data_pool, data, next);

sys/dev/netif/ral/rt2860.c

597

ring->cur = ring->next = 0;

sys/dev/netif/ral/rt2860.c

628

SLIST_INSERT_HEAD(&sc->data_pool, data, next);

sys/dev/netif/ral/rt2860.c

691

SLIST_INSERT_HEAD(&sc->data_pool, data, next);

sys/dev/netif/ral/rt2860.c

716

SLIST_REMOVE_HEAD(&sc->data_pool, next);

sys/dev/netif/ral/rt2860var.h

71

SLIST_ENTRY(rt2860_tx_data) next;

sys/dev/netif/ral/rt2860var.h

82

int next;

sys/dev/netif/tx/if_tx.c

1414

desc->next = vtophys(sc->rx_desc + ((i+1) & RX_RING_MASK));

sys/dev/netif/tx/if_tx.c

1416

if ((desc->next & 3) ||

sys/dev/netif/tx/if_tx.c

1417

((desc->next & PAGE_MASK) + sizeof *desc) > PAGE_SIZE) {

sys/dev/netif/tx/if_tx.c

1438

desc->next = vtophys(sc->tx_desc + ((i+1) & TX_RING_MASK));

sys/dev/netif/tx/if_tx.c

1440

if ((desc->next & 3) ||

sys/dev/netif/tx/if_tx.c

1441

((desc->next & PAGE_MASK) + sizeof *desc) > PAGE_SIZE) {

sys/dev/netif/tx/if_txreg.h

198

volatile u_int32_t next;

sys/dev/netif/tx/if_txreg.h

205

volatile u_int32_t next;

sys/dev/netif/txp/if_txp.c

667

goto next;

sys/dev/netif/txp/if_txp.c

691

goto next;

sys/dev/netif/txp/if_txp.c

698

goto next;

sys/dev/netif/txp/if_txp.c

730

next:

sys/dev/netif/wpi/if_wpi.c

2208

hw = le32toh(sc->shared->next) & 0xfff;

sys/dev/netif/wpi/if_wpi.c

2964

struct mbuf *next = m->m_nextpkt;

sys/dev/netif/wpi/if_wpi.c

2966

tx->lnext = htole16(next->m_pkthdr.len);

sys/dev/netif/wpi/if_wpi.c

3389

mrr.rates[i].next =

sys/dev/netif/wpi/if_wpi.c

3400

mrr.rates[i].next = (i == WPI_RIDX_OFDM6) ?

sys/dev/netif/wpi/if_wpi.c

5348

offsetof(struct wpi_shared, next));

sys/dev/netif/wpi/if_wpireg.h

235

uint32_t next;

sys/dev/netif/wpi/if_wpireg.h

575

uint8_t next;

sys/dev/netif/xl/if_xl.c

1845

int error, i, next;

sys/dev/netif/xl/if_xl.c

1856

next = 0;

sys/dev/netif/xl/if_xl.c

1858

next = i + 1;

sys/dev/netif/xl/if_xl.c

1860

next * sizeof(struct xl_list_onefrag);

sys/dev/netif/xl/if_xl.c

1861

cd->xl_rx_chain[i].xl_next = &cd->xl_rx_chain[next];

sys/dev/raid/aac/aac.c

2950

for (ctx = sc->fibctx; ctx; ctx = ctx->next)

sys/dev/raid/aac/aac.c

3228

int next, current, found;

sys/dev/raid/aac/aac.c

3371

next = (current + 1) % AAC_AIFQ_LENGTH;

sys/dev/raid/aac/aac.c

3372

if (next == 0)

sys/dev/raid/aac/aac.c

3377

for (ctx = sc->fibctx; ctx; ctx = ctx->next) {

sys/dev/raid/aac/aac.c

3378

if (next == ctx->ctx_idx)

sys/dev/raid/aac/aac.c

3381

ctx->ctx_idx = next;

sys/dev/raid/aac/aac.c

3384

sc->aifq_idx = next;

sys/dev/raid/aac/aac.c

3460

for (ctx = sc->fibctx; ctx->next; ctx = ctx->next)

sys/dev/raid/aac/aac.c

3462

ctx->next = fibctx;

sys/dev/raid/aac/aac.c

3474

ctx = ctx->next;

sys/dev/raid/aac/aac.c

3496

for (ctx = sc->fibctx; ctx; ctx = ctx->next) {

sys/dev/raid/aac/aac.c

3501

ctx->prev->next = ctx->next;

sys/dev/raid/aac/aac.c

3502

if (ctx->next)

sys/dev/raid/aac/aac.c

3503

ctx->next->prev = ctx->prev;

sys/dev/raid/aac/aac.c

3528

for (ctx = sc->fibctx; ctx; ctx = ctx->next) {

sys/dev/raid/aac/aacvar.h

304

struct aac_fib_context *next, *prev;

sys/dev/raid/asr/asr.c

1528

int next, base, span;

sys/dev/raid/asr/asr.c

1531

next = base = KVTOPHYS(v);

sys/dev/raid/asr/asr.c

1535

while ((len > 0) && (base == next)) {

sys/dev/raid/asr/asr.c

1538

next = trunc_page(base) + PAGE_SIZE;

sys/dev/raid/asr/asr.c

1539

size = next - base;

sys/dev/raid/asr/asr.c

1710

int next, span, base, rw;

sys/dev/raid/asr/asr.c

1815

next = base = KVTOPHYS(v);

sys/dev/raid/asr/asr.c

1819

while ((len > 0) && (base == next)) {

sys/dev/raid/asr/asr.c

1820

next = trunc_page(base) + PAGE_SIZE;

sys/dev/raid/asr/asr.c

1821

size = next - base;

sys/dev/raid/asr/asr.c

3368

int next, base, span;

sys/dev/raid/asr/asr.c

3371

next = base = KVTOPHYS(v);

sys/dev/raid/asr/asr.c

3376

while ((len > 0) && (base == next)) {

sys/dev/raid/asr/asr.c

3379

next = trunc_page(base) + PAGE_SIZE;

sys/dev/raid/asr/asr.c

3380

size = next - base;

sys/dev/raid/hpt27xx/array.h

163

struct _raw_partition * next;

sys/dev/raid/hpt27xx/him.h

268

struct _HIM *next;

sys/dev/raid/hpt27xx/him.h

393

struct tq_item *next;

sys/dev/raid/hpt27xx/him.h

397

do { (t)->proc = p; (t)->arg = a; (t)->next = 0; } while (0)

sys/dev/raid/hpt27xx/hpt27xx_os_bsd.c

148

list->next = vbus_ext->freelist_head;

sys/dev/raid/hpt27xx/hpt27xx_os_bsd.c

187

list->next = vbus_ext->freelist_dma_head;

sys/dev/raid/hpt27xx/hpt27xx_os_bsd.c

255

HPT_ASSERT(task->next==0);

sys/dev/raid/hpt27xx/hpt27xx_os_bsd.c

261

while (t->next) t = t->next;

sys/dev/raid/hpt27xx/hpt27xx_os_bsd.c

262

t->next = task;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

1062

ext->next = vbus_ext->cmdext_list;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

1112

for (hba = vbus_ext->hba_list; hba; hba = hba->next) {

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

112

hba->next = vbus_ext->hba_list;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

143

for (hba = vbus_ext->hba_list; hba; hba = hba->next)

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

148

for (f=vbus_ext->freelist_head; f; f=f->next) {

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

159

for (f=vbus_ext->freelist_dma_head; f; f=f->next) {

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

201

for (f=vbus_ext->freelist_head; f; f=f->next) {

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

217

for (f=vbus_ext->freelist_dma_head; f; f=f->next) {

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

245

for (hba = vbus_ext->hba_list; hba; hba = hba->next)

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

354

for (hba=vbus_ext->hba_list; hba; hba=hba->next)

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

360

vbus_ext->hba_list = hba->next;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

377

tasks = t->next;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

378

t->next = NULL;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

401

vbus_ext->cmdext_list = p->next;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

407

p->next = p->vbus_ext->cmdext_list;

sys/dev/raid/hpt27xx/hpt27xx_osm_bsd.c

41

for (him = him_list; him; him = him->next) {

sys/dev/raid/hpt27xx/ldm.h

114

struct lock_request *next;

sys/dev/raid/hpt27xx/ldm.h

122

(req)->next = 0;\

sys/dev/raid/hpt27xx/ldm.h

139

struct dmapool_order *next;

sys/dev/raid/hpt27xx/ldm.h

146

struct dmapool_client *next;

sys/dev/raid/hpt27xx/ldm.h

175

struct timer_call * next;

sys/dev/raid/hpt27xx/ldm.h

178

#define ldm_init_timer(timer) do { (timer)->next=0; (timer)->pprev=0; } while (0)

sys/dev/raid/hpt27xx/ldm.h

182

HPT_ASSERT((timer)->next==0 && (timer)->pprev==0);\

sys/dev/raid/hpt27xx/ldm.h

195

struct _LDM_ADAPTER *next;

sys/dev/raid/hpt27xx/ldm.h

287

struct vdev_class *next;

sys/dev/raid/hpt27xx/ldm.h

79

struct freelist *next;

sys/dev/raid/hpt27xx/list.h

119

for (pos = (head)->next; pos != (head); pos = pos->next)

sys/dev/raid/hpt27xx/list.h

122

for (pos = (head)->next, n = pos->next; pos != (head); \

sys/dev/raid/hpt27xx/list.h

123

pos = n, n = pos->next)

sys/dev/raid/hpt27xx/list.h

126

((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))

sys/dev/raid/hpt27xx/list.h

41

struct list_head *next, *prev;

sys/dev/raid/hpt27xx/list.h

44

#define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)

sys/dev/raid/hpt27xx/list.h

46

static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)

sys/dev/raid/hpt27xx/list.h

48

next->prev = _new;

sys/dev/raid/hpt27xx/list.h

49

_new->next = next;

sys/dev/raid/hpt27xx/list.h

51

prev->next = _new;

sys/dev/raid/hpt27xx/list.h

56

__list_add(_new, head, head->next);

sys/dev/raid/hpt27xx/list.h

64

static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)

sys/dev/raid/hpt27xx/list.h

66

next->prev = prev;

sys/dev/raid/hpt27xx/list.h

67

prev->next = next;

sys/dev/raid/hpt27xx/list.h

72

__list_del(entry->prev, entry->next);

sys/dev/raid/hpt27xx/list.h

77

__list_del(entry->prev, entry->next);

sys/dev/raid/hpt27xx/list.h

83

HPT_ASSERT(!(head->next==head && head->prev!=head));

sys/dev/raid/hpt27xx/list.h

84

return head->next == head;

sys/dev/raid/hpt27xx/list.h

90

struct list_head *first = list->next;

sys/dev/raid/hpt27xx/list.h

92

struct list_head *at = head->next;

sys/dev/raid/hpt27xx/list.h

95

head->next = first;

sys/dev/raid/hpt27xx/list.h

97

last->next = at;

sys/dev/raid/hpt27xx/os_bsd.h

135

struct _hba *next;

sys/dev/raid/hpt27xx/os_bsd.h

152

struct _os_cmdext *next;

sys/dev/raid/hpt27xx/os_bsd.h

161

struct _vbus_ext *next;

sys/dev/raid/hpt27xx/osm.h

187

struct _OSM_TASK *next;

sys/dev/raid/hptiop/hptiop.c

2258

hba->srb_list = srb->next;

sys/dev/raid/hptiop/hptiop.c

2267

srb->next = hba->srb_list;

sys/dev/raid/hptiop/hptiop.h

366

struct hpt_iop_hba *next;

sys/dev/raid/hptiop/hptiop.h

456

struct hpt_iop_srb *next;

sys/dev/raid/hptmv/entry.c

1245

pAdapter->pbus_dmamap_list = p-> next;

sys/dev/raid/hptmv/entry.c

1252

p->next = p->pAdapter->pbus_dmamap_list;

sys/dev/raid/hptmv/entry.c

1278

pAdapter->next = 0;

sys/dev/raid/hptmv/entry.c

1285

pCurAdapter->next = pAdapter;

sys/dev/raid/hptmv/entry.c

2455

pAdapter = pAdapter->next;

sys/dev/raid/hptmv/entry.c

2486

for (pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next) {

sys/dev/raid/hptmv/gui_lib.c

1331

pAdapter = pAdapter->next;

sys/dev/raid/hptmv/gui_lib.c

1395

for (pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next)

sys/dev/raid/hptmv/gui_lib.c

1418

for (pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next)

sys/dev/raid/hptmv/gui_lib.c

409

pAdapTemp = pAdapTemp->next;

sys/dev/raid/hptmv/gui_lib.c

420

for (pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next) {

sys/dev/raid/hptmv/gui_lib.c

455

pAdapTemp = pAdapTemp->next;

sys/dev/raid/hptmv/gui_lib.c

490

for (pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next) {

sys/dev/raid/hptmv/gui_lib.c

501

if (pIds[j]==VDEV_TO_ID(pLogical)) goto next;

sys/dev/raid/hptmv/gui_lib.c

504

next:;

sys/dev/raid/hptmv/gui_lib.c

81

pAdapter = pAdapter->next;

sys/dev/raid/hptmv/gui_lib.c

95

pAdapter = pAdapter->next;

sys/dev/raid/hptmv/hptproc.c

272

for (pAdapter=gIal_Adapter; pAdapter; pAdapter=pAdapter->next) {

sys/dev/raid/hptmv/hptproc.c

597

for (pAdapter=gIal_Adapter; pAdapter; pAdapter=pAdapter->next) {

sys/dev/raid/hptmv/ioctl.c

302

for (pAdapter=gIal_Adapter; pAdapter; pAdapter=pAdapter->next) {

sys/dev/raid/hptmv/ioctl.c

75

for (i=1, pAdapTemp = gIal_Adapter; pAdapTemp; pAdapTemp = pAdapTemp->next, i++) {

sys/dev/raid/hptmv/mvSata.h

238

struct mvQueuedCommandEntry *next;

sys/dev/raid/hptmv/osbsd.h

140

{ struct _BUS_DMAMAP *next;

sys/dev/raid/hptmv/osbsd.h

158

struct IALAdapter *next;

sys/dev/raid/hptmv/raid5n.h

90

struct free_heap_block *next;

sys/dev/raid/hptmv/raid5n.h

95

struct list_head *next, *prev;

sys/dev/raid/hptrr/array.h

164

struct _raw_partition * next;

sys/dev/raid/hptrr/him.h

242

struct _HIM *next;

sys/dev/raid/hptrr/him.h

354

struct tq_item *next;

sys/dev/raid/hptrr/him.h

358

do { (t)->proc = p; (t)->arg = a; (t)->next = 0; } while (0)

sys/dev/raid/hptrr/hptrr_os_bsd.c

130

list->next = vbus_ext->freelist_head;

sys/dev/raid/hptrr/hptrr_os_bsd.c

169

list->next = vbus_ext->freelist_dma_head;

sys/dev/raid/hptrr/hptrr_os_bsd.c

237

HPT_ASSERT(task->next==0);

sys/dev/raid/hptrr/hptrr_os_bsd.c

243

while (t->next) t = t->next;

sys/dev/raid/hptrr/hptrr_os_bsd.c

244

t->next = task;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

1037

ext->next = vbus_ext->cmdext_list;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

1093

for (hba = vbus_ext->hba_list; hba; hba = hba->next) {

sys/dev/raid/hptrr/hptrr_osm_bsd.c

127

hba->next = vbus_ext->hba_list;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

158

for (hba = vbus_ext->hba_list; hba; hba = hba->next)

sys/dev/raid/hptrr/hptrr_osm_bsd.c

163

for (f=vbus_ext->freelist_head; f; f=f->next) {

sys/dev/raid/hptrr/hptrr_osm_bsd.c

174

for (f=vbus_ext->freelist_dma_head; f; f=f->next) {

sys/dev/raid/hptrr/hptrr_osm_bsd.c

217

for (f=vbus_ext->freelist_head; f; f=f->next) {

sys/dev/raid/hptrr/hptrr_osm_bsd.c

233

for (f=vbus_ext->freelist_dma_head; f; f=f->next) {

sys/dev/raid/hptrr/hptrr_osm_bsd.c

261

for (hba = vbus_ext->hba_list; hba; hba = hba->next)

sys/dev/raid/hptrr/hptrr_osm_bsd.c

367

for (hba=vbus_ext->hba_list; hba; hba=hba->next)

sys/dev/raid/hptrr/hptrr_osm_bsd.c

373

vbus_ext->hba_list = hba->next;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

392

tasks = t->next;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

393

t->next = NULL;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

416

vbus_ext->cmdext_list = p->next;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

422

p->next = p->vbus_ext->cmdext_list;

sys/dev/raid/hptrr/hptrr_osm_bsd.c

50

for (him = him_list; him; him = him->next) {

sys/dev/raid/hptrr/ldm.h

109

struct lock_request *next;

sys/dev/raid/hptrr/ldm.h

117

(req)->next = 0;\

sys/dev/raid/hptrr/ldm.h

134

struct dmapool_order *next;

sys/dev/raid/hptrr/ldm.h

141

struct dmapool_client *next;

sys/dev/raid/hptrr/ldm.h

170

struct timer_call * next;

sys/dev/raid/hptrr/ldm.h

173

#define ldm_init_timer(timer) do { (timer)->next=0; (timer)->pprev=0; } while (0)

sys/dev/raid/hptrr/ldm.h

177

HPT_ASSERT((timer)->next==0 && (timer)->pprev==0);\

sys/dev/raid/hptrr/ldm.h

190

struct _LDM_ADAPTER *next;

sys/dev/raid/hptrr/ldm.h

283

struct vdev_class *next;

sys/dev/raid/hptrr/ldm.h

74

struct freelist *next;

sys/dev/raid/hptrr/list.h

121

for (pos = (head)->next; pos != (head); pos = pos->next)

sys/dev/raid/hptrr/list.h

124

for (pos = (head)->next, n = pos->next; pos != (head); \

sys/dev/raid/hptrr/list.h

125

pos = n, n = pos->next)

sys/dev/raid/hptrr/list.h

128

((type *)((char *)((attached)->next)-(HPT_UPTR)(&((type *)0)->member)))

sys/dev/raid/hptrr/list.h

43

struct list_head *next, *prev;

sys/dev/raid/hptrr/list.h

46

#define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)

sys/dev/raid/hptrr/list.h

48

static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next)

sys/dev/raid/hptrr/list.h

50

next->prev = _new;

sys/dev/raid/hptrr/list.h

51

_new->next = next;

sys/dev/raid/hptrr/list.h

53

prev->next = _new;

sys/dev/raid/hptrr/list.h

58

__list_add(_new, head, head->next);

sys/dev/raid/hptrr/list.h

66

static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next)

sys/dev/raid/hptrr/list.h

68

next->prev = prev;

sys/dev/raid/hptrr/list.h

69

prev->next = next;

sys/dev/raid/hptrr/list.h

74

__list_del(entry->prev, entry->next);

sys/dev/raid/hptrr/list.h

79

__list_del(entry->prev, entry->next);

sys/dev/raid/hptrr/list.h

85

HPT_ASSERT(!(head->next==head && head->prev!=head));

sys/dev/raid/hptrr/list.h

86

return head->next == head;

sys/dev/raid/hptrr/list.h

92

struct list_head *first = list->next;

sys/dev/raid/hptrr/list.h

94

struct list_head *at = head->next;

sys/dev/raid/hptrr/list.h

97

head->next = first;

sys/dev/raid/hptrr/list.h

99

last->next = at;

sys/dev/raid/hptrr/os_bsd.h

136

struct _hba *next;

sys/dev/raid/hptrr/os_bsd.h

153

struct _os_cmdext *next;

sys/dev/raid/hptrr/os_bsd.h

163

struct _vbus_ext *next;

sys/dev/raid/hptrr/osm.h

153

struct _OSM_TASK *next;

sys/dev/raid/ida/idavar.h

57

u_int16_t next; /* offset of next request */

sys/dev/raid/ips/ips.c

184

SLIST_INSERT_HEAD(&sc->free_cmd_list, command, next);

sys/dev/raid/ips/ips.c

224

SLIST_REMOVE_HEAD(&sc->free_cmd_list, next);

sys/dev/raid/ips/ips.c

246

SLIST_INSERT_HEAD(&sc->free_cmd_list, command, next);

sys/dev/raid/ips/ips.h

402

SLIST_ENTRY(ips_command) next;

sys/dev/raid/ips/ips.h

410

STAILQ_ENTRY(ips_wait_list) next;

sys/dev/raid/mfi/mfi_tbolt.c

511

TAILQ_INSERT_TAIL(&(sc->mfi_cmd_tbolt_tqh), cmd, next);

sys/dev/raid/mfi/mfi_tbolt.c

631

TAILQ_INSERT_TAIL(&sc->mfi_cmd_tbolt_tqh, cmd, next);

sys/dev/raid/mfi/mfi_tbolt.c

785

TAILQ_REMOVE(&sc->mfi_cmd_tbolt_tqh, cmd, next);

sys/dev/raid/mfi/mfivar.h

394

TAILQ_ENTRY(mfi_cmd_tbolt) next;

sys/dev/raid/mrsas/mrsas.c

2062

TAILQ_INSERT_TAIL(&(sc->mrsas_mpt_cmd_list_head), cmd, next);

sys/dev/raid/mrsas/mrsas.c

2216

TAILQ_REMOVE(&sc->mrsas_mfi_cmd_list_head, cmd, next);

sys/dev/raid/mrsas/mrsas.c

2578

TAILQ_INSERT_TAIL(&(sc->mrsas_mfi_cmd_list_head), cmd, next);

sys/dev/raid/mrsas/mrsas.h

1279

TAILQ_ENTRY(mrsas_mpt_cmd) next;

sys/dev/raid/mrsas/mrsas.h

1308

TAILQ_ENTRY(mrsas_mfi_cmd) next;

sys/dev/raid/mrsas/mrsas_cam.c

585

TAILQ_REMOVE(&sc->mrsas_mpt_cmd_list_head, cmd, next);

sys/dev/raid/mrsas/mrsas_cam.c

611

TAILQ_INSERT_TAIL(&(sc->mrsas_mpt_cmd_list_head), cmd, next);

sys/dev/raid/mrsas/mrsas_ioctl.c

418

TAILQ_INSERT_TAIL(&(sc->mrsas_mfi_cmd_list_head), cmd, next);

sys/dev/raid/twa/tw_cl_misc.c

965

req->link.next, req->link.prev);

sys/dev/raid/twa/tw_cl_share.h

214

struct tw_cl_link *next;

sys/dev/raid/twa/tw_cl_share.h

270

(head)->prev = (head)->next = head; \

sys/dev/raid/twa/tw_cl_share.h

276

(item)->next = (head)->next; \

sys/dev/raid/twa/tw_cl_share.h

278

(head)->next->prev = item; \

sys/dev/raid/twa/tw_cl_share.h

279

(head)->next = item; \

sys/dev/raid/twa/tw_cl_share.h

285

(item)->next = head; \

sys/dev/raid/twa/tw_cl_share.h

287

(head)->prev->next = item; \

sys/dev/raid/twa/tw_cl_share.h

294

(item)->prev->next = (item)->next; \

sys/dev/raid/twa/tw_cl_share.h

295

(item)->next->prev = (item)->prev; \

sys/dev/raid/twa/tw_cl_share.h

301

(((head)->next != head) ? ((head)->next) : TW_CL_NULL)

sys/dev/raid/twa/tw_cl_share.h

311

(((item)->next != head) ? ((item)->next) : TW_CL_NULL)

sys/dev/raid/twa/tw_osl_freebsd.c

1595

req->link.next, req->link.prev, req->dma_map);

sys/dev/raid/twe/twe.c

1479

int next, nextnext;

sys/dev/raid/twe/twe.c

1488

next = ((sc->twe_aen_head + 1) % TWE_Q_LENGTH);

sys/dev/raid/twe/twe.c

1496

if (next != sc->twe_aen_tail) {

sys/dev/raid/twe/twe.c

1498

sc->twe_aen_head = next;

sys/dev/raid/tws/tws.c

813

r->next = r->prev = NULL;

sys/dev/raid/tws/tws_hdm.h

418

struct tws_request *next; /* pointer to next request */

sys/dev/raid/tws/tws_services.c

225

req->next = req->prev = NULL;

sys/dev/raid/tws/tws_services.c

240

req->next = sc->q_head[q_type];

sys/dev/raid/tws/tws_services.c

259

req->next = NULL;

sys/dev/raid/tws/tws_services.c

260

sc->q_tail[q_type]->next = req;

sys/dev/raid/tws/tws_services.c

277

if ( r->next == NULL && r->prev == NULL ) {

sys/dev/raid/tws/tws_services.c

281

sc->q_head[q_type] = r->next;

sys/dev/raid/tws/tws_services.c

282

r->next->prev = NULL;

sys/dev/raid/tws/tws_services.c

283

r->next = NULL;

sys/dev/raid/tws/tws_services.c

300

if ( r->next == NULL && r->prev == NULL ) {

sys/dev/raid/tws/tws_services.c

305

r->prev->next = NULL;

sys/dev/raid/tws/tws_services.c

306

r->next = NULL;

sys/dev/raid/tws/tws_services.c

338

if ( req->next == NULL || req->prev == NULL ) {

sys/dev/raid/tws/tws_services.c

348

r = r->next;

sys/dev/raid/tws/tws_services.c

357

req->prev->next = r->next;

sys/dev/raid/tws/tws_services.c

358

req->next->prev = r->prev;

sys/dev/raid/tws/tws_services.c

359

req->next = NULL;

sys/dev/raid/vinum/request.h

132

struct rqgroup *next; /* pointer to next group */

sys/dev/raid/vinum/request.h

162

struct request *next; /* link of waiting requests */

sys/dev/raid/vinum/request.h

269

struct daemonq *next; /* pointer to next element in queue */

sys/dev/raid/vinum/vinumdaemon.c

149

daemonq = daemonq->next; /* and detach it */

sys/dev/raid/vinum/vinumdaemon.c

234

qelt->next = NULL; /* end of the chain */

sys/dev/raid/vinum/vinumdaemon.c

239

dqend->next = qelt;

sys/dev/raid/vinum/vinumdaemon.c

91

daemonq = daemonq->next; /* and detach it */

sys/dev/raid/vinum/vinuminterrupt.c

258

nrqg = rqg->next; /* note the next one */

sys/dev/raid/vinum/vinumrequest.c

1045

rq->lrqg->next = rqg; /* hang it off the end */

sys/dev/raid/vinum/vinumrequest.c

1072

rqg->rq->rqg = rqg->next; /* unhook ourselves */

sys/dev/raid/vinum/vinumrequest.c

1074

while ((rqgc->next != NULL) /* find the group */

sys/dev/raid/vinum/vinumrequest.c

1075

&&(rqgc->next != rqg))

sys/dev/raid/vinum/vinumrequest.c

1076

rqgc = rqgc->next;

sys/dev/raid/vinum/vinumrequest.c

1077

if (rqgc->next == NULL)

sys/dev/raid/vinum/vinumrequest.c

1083

rqgc->next = rqg->next; /* make the chain jump over us */

sys/dev/raid/vinum/vinumrequest.c

335

while (waitlist->next != NULL) /* find the end */

sys/dev/raid/vinum/vinumrequest.c

336

waitlist = waitlist->next;

sys/dev/raid/vinum/vinumrequest.c

337

waitlist->next = rq; /* hook our request there */

sys/dev/raid/vinum/vinumrequest.c

378

for (rqg = rq->rqg; rqg != NULL; rqg = rqg->next) { /* through the whole request chain */

sys/dev/raid/vinum/vinumrequest.c

409

rqg = rqg->next;

sys/dev/raid/vinum/vinumrevive.c

217

sd->waitlist = sd->waitlist->next; /* and move on to the next */

sys/dev/serial/sio/sio.c

2546

struct lbq *next;

sys/dev/serial/sio/sio.c

2557

while ((next = qp->l_next) != NULL)

sys/dev/serial/sio/sio.c

2558

qp = next;

sys/dev/serial/sio/sio.c

2577

while ((next = qp->l_next) != NULL)

sys/dev/serial/sio/sio.c

2578

qp = next;

sys/dev/sound/pci/atiixp.c

600

ch->sgd_table[i].next = htole32((uint32_t)ch->sgd_addr +

sys/dev/sound/pci/atiixp.c

88

volatile uint32_t next;

sys/dev/sound/pcm/feeder.c

158

struct feedertab_entry *fte, *next;

sys/dev/sound/pcm/feeder.c

160

next = SLIST_FIRST(&feedertab);

sys/dev/sound/pcm/feeder.c

161

while (next != NULL) {

sys/dev/sound/pcm/feeder.c

162

fte = next;

sys/dev/sound/pcm/feeder.c

163

next = SLIST_NEXT(fte, link);

sys/dev/virtual/hyperv/hyperv.c

83

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/virtual/hyperv/vmbus/vmbus.c

173

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/virtual/hyperv/x86_64/hyperv_machdep.c

54

.next = SLIST_ENTRY_INITIALIZER,

sys/dev/virtual/virtio/net/if_vtnet.c

1810

next:

sys/dev/virtual/virtio/net/if_vtnet.c

1824

goto next;

sys/dev/virtual/virtio/net/if_vtnet.c

2181

next:

sys/dev/virtual/virtio/net/if_vtnet.c

2195

goto next;

sys/dev/virtual/virtio/virtio/virtio_ring.h

64

uint16_t next;

sys/dev/virtual/virtio/virtio/virtqueue.c

290

indirect[i].next = i + 1;

sys/dev/virtual/virtio/virtio/virtqueue.c

291

indirect[i].next = VQ_RING_DESC_CHAIN_END;

sys/dev/virtual/virtio/virtio/virtqueue.c

638

vr->desc[i].next = i + 1;

sys/dev/virtual/virtio/virtio/virtqueue.c

639

vr->desc[i].next = VQ_RING_DESC_CHAIN_END;

sys/dev/virtual/virtio/virtio/virtqueue.c

677

i++, idx = dp->next, seg++) {

sys/dev/virtual/virtio/virtio/virtqueue.c

741

vq->vq_desc_head_idx = dp->next;

sys/dev/virtual/virtio/virtio/virtqueue.c

791

VQ_RING_ASSERT_VALID_IDX(vq, dp->next);

sys/dev/virtual/virtio/virtio/virtqueue.c

792

dp = &vq->vq_ring.desc[dp->next];

sys/dev/virtual/virtio/virtio/virtqueue.c

803

dp->next = vq->vq_desc_head_idx;

sys/kern/init_main.c

562

char *var, *path, *next, *s;

sys/kern/init_main.c

620

for (path = init_path; *path != '\0'; path = next) {

sys/kern/init_main.c

625

for (next = path; *next != '\0' && *next != ':'; next++)

sys/kern/init_main.c

628

kprintf("start_init: trying %.*s\n", (int)(next - path),

sys/kern/init_main.c

661

for (s = next - 1; s >= path; s--)

sys/kern/init_main.c

701

kprintf("exec %.*s: error %d\n", (int)(next - path),

sys/kern/kern_cputimer.c

137

SLIST_FOREACH(scan, &cputimerhead, next) {

sys/kern/kern_cputimer.c

141

SLIST_INSERT_HEAD(&cputimerhead, timer, next);

sys/kern/kern_cputimer.c

157

SLIST_FOREACH(scan, &cputimerhead, next) {

sys/kern/kern_cputimer.c

161

SLIST_REMOVE(&cputimerhead, timer, cputimer, next);

sys/kern/kern_cputimer.c

171

SLIST_FOREACH(scan, &cputimerhead, next) {

sys/kern/kern_cputimer.c

247

SLIST_FOREACH(scan, &cputimerhead, next) {

sys/kern/kern_cputimer.c

308

SLIST_FOREACH(scan, &cputimer_intr_head, next) {

sys/kern/kern_cputimer.c

313

SLIST_INSERT_HEAD(&cputimer_intr_head, cti, next);

sys/kern/kern_cputimer.c

320

SLIST_REMOVE(&cputimer_intr_head, cti, cputimer_intr, next);

sys/kern/kern_cputimer.c

382

SLIST_FOREACH(cti, &cputimer_intr_head, next)

sys/kern/kern_cputimer.c

391

SLIST_FOREACH(cti, &cputimer_intr_head, next)

sys/kern/kern_cputimer.c

400

SLIST_FOREACH(cti, &cputimer_intr_head, next)

sys/kern/kern_cputimer.c

427

SLIST_FOREACH(cti, &cputimer_intr_head, next) {

sys/kern/kern_cputimer.c

457

SLIST_FOREACH_MUTABLE(cti, &cputimer_intr_head, next, ncti) {

sys/kern/kern_cputimer.c

479

SLIST_FOREACH(scan, &cputimer_intr_head, next) {

sys/kern/kern_cputimer.c

511

SLIST_FOREACH(cti, &cputimer_intr_head, next) {

sys/kern/kern_cputimer.c

55

.next = SLIST_ENTRY_INITIALIZER,

sys/kern/kern_exit.c

1526

TAILQ_INSERT_TAIL(&exit_list, ep, next);

sys/kern/kern_exit.c

1539

TAILQ_FOREACH(ep, &exit_list, next) {

sys/kern/kern_exit.c

1541

TAILQ_REMOVE(&exit_list, ep, next);

sys/kern/kern_exit.c

361

TAILQ_FOREACH(ep, &exit_list, next)

sys/kern/kern_exit.c

86

TAILQ_ENTRY(exitlist) next;

sys/kern/kern_fork.c

1122

reaper_drop(struct sysreaper *next)

sys/kern/kern_fork.c

1126

while ((reap = next) != NULL) {

sys/kern/kern_fork.c

1128

next = reap->parent;

sys/kern/kern_fork.c

1135

next = NULL;

sys/kern/kern_fork.c

1208

struct sysreaper *next;

sys/kern/kern_fork.c

1247

next = reap->parent;

sys/kern/kern_fork.c

1248

while (next) {

sys/kern/kern_fork.c

1249

reaper_hold(next);

sys/kern/kern_fork.c

1250

if (next->refs == 2 && next->p == NULL) {

sys/kern/kern_fork.c

1253

if (next->refs == 2 &&

sys/kern/kern_fork.c

1254

reap->parent == next &&

sys/kern/kern_fork.c

1255

next->p == NULL) {

sys/kern/kern_fork.c

1259

reap->parent = next->parent;

sys/kern/kern_fork.c

1260

next->parent = NULL;

sys/kern/kern_fork.c

1261

reaper_drop(next); /* ours */

sys/kern/kern_fork.c

1262

reaper_drop(next); /* old parent */

sys/kern/kern_fork.c

1263

next = reap->parent;

sys/kern/kern_fork.c

1271

reap = next;

sys/kern/kern_fork.c

1323

struct proc *starting, *parent, *cur, *next;

sys/kern/kern_fork.c

1404

next = LIST_FIRST(&cur->p_children);

sys/kern/kern_fork.c

1405

PHOLD(next);

sys/kern/kern_fork.c

1409

lwkt_gettoken(&next->p_token); /* [cur, next> */

sys/kern/kern_fork.c

1415

next = LIST_NEXT(cur, p_sibling);

sys/kern/kern_fork.c

1416

PHOLD(next);

sys/kern/kern_fork.c

1419

lwkt_gettoken(&next->p_token); /* [p, next> */

sys/kern/kern_fork.c

1431

next = parent;

sys/kern/kern_fork.c

1432

parent = next->p_pptr;

sys/kern/kern_fork.c

1441

cur = next;

sys/kern/kern_fork.c

703

TAILQ_FOREACH(ep, &fork_list, next) {

sys/kern/kern_fork.c

79

TAILQ_ENTRY(forklist) next;

sys/kern/kern_fork.c

906

TAILQ_INSERT_TAIL(&fork_list, ep, next);

sys/kern/kern_fork.c

919

TAILQ_FOREACH(ep, &fork_list, next) {

sys/kern/kern_fork.c

921

TAILQ_REMOVE(&fork_list, ep, next);

sys/kern/kern_intr.c

1049

nrec = rec->next;

sys/kern/kern_intr.c

1106

for (rec = info->i_reclist; rec; rec = rec->next) {

sys/kern/kern_intr.c

299

rec->next = NULL;

sys/kern/kern_intr.c

379

list = &(*list)->next;

sys/kern/kern_intr.c

443

list = &rec->next;

sys/kern/kern_intr.c

448

*list = rec->next;

sys/kern/kern_intr.c

460

for (rec0 = info->i_reclist; rec0; rec0 = rec0->next) {

sys/kern/kern_intr.c

51

struct intrec *next;

sys/kern/kern_intr.c

770

nrec = rec->next;

sys/kern/kern_intr.c

897

nrec = rec->next;

sys/kern/kern_jail.c

173

next:

sys/kern/kern_jail.c

182

goto next;

sys/kern/kern_kmalloc.c

143

struct kmalloc_slab *next;

sys/kern/kern_kmalloc.c

169

resp = &slab->next;

sys/kern/kern_kmalloc.c

170

slab = slab->next;

sys/kern/kern_kmalloc.c

183

slabp = &slab->next;

sys/kern/kern_kmalloc.c

187

while ((next = *slabp) != NULL &&

sys/kern/kern_kmalloc.c

188

next->orig_cpuid == cpuid &&

sys/kern/kern_kmalloc.c

191

KKASSERT(((uintptr_t)next & KMALLOC_SLAB_MASK) == 0);

sys/kern/kern_kmalloc.c

192

next->type = NULL;

sys/kern/kern_kmalloc.c

194

slabp = &next->next;

sys/kern/kern_kmalloc.c

228

slab = next;

sys/kern/kern_kmalloc.c

261

gd->gd_kmslab.free_slabs = slab->next;

sys/kern/kern_kmalloc.c

262

slab->next = NULL;

sys/kern/kern_kmalloc.c

332

slabp = &(*slabp)->next;

sys/kern/kern_kmalloc.c

386

*slabp = slab->next; /* unlink */

sys/kern/kern_kmalloc.c

388

basep = &slab->next;

sys/kern/kern_kmalloc.c

395

slabp = &slab->next;

sys/kern/kern_kmalloc.c

412

base = slab->next;

sys/kern/kern_kmalloc.c

413

slab->next = (void *)(uintptr_t)-1;

sys/kern/kern_kmalloc.c

458

ggm->empty = slab->next;

sys/kern/kern_kmalloc.c

459

slab->next = NULL;

sys/kern/kern_kmalloc.c

461

if (ggm->empty_tailp == &slab->next)

sys/kern/kern_kmalloc.c

477

KKASSERT(slab->next == NULL);

sys/kern/kern_kmalloc.c

479

slab->next = ggm->full;

sys/kern/kern_kmalloc.c

487

KKASSERT(slab->next == NULL);

sys/kern/kern_kmalloc.c

488

slab->next = ggm->partial;

sys/kern/kern_kmalloc.c

496

KKASSERT(slab->next == NULL);

sys/kern/kern_kmalloc.c

498

ggm->empty_tailp = &slab->next;

sys/kern/kern_kmalloc.c

578

*slabp = slab->next;

sys/kern/kern_kmalloc.c

580

basep = &slab->next;

sys/kern/kern_kmalloc.c

586

slabp = &slab->next;

sys/kern/kern_kmalloc.c

607

base = base->next;

sys/kern/kern_kmalloc.c

608

slab->next = NULL;

sys/kern/kern_kmalloc.c

788

ggm->partial = ggm->partial->next;

sys/kern/kern_kmalloc.c

789

mgt->active->next = NULL;

sys/kern/kern_kmalloc.c

792

KKASSERT(slab->next == NULL);

sys/kern/kern_kmalloc.c

794

ggm->empty_tailp = &slab->next;

sys/kern/kern_kmalloc.c

805

ggm->full = ggm->full->next;

sys/kern/kern_kmalloc.c

806

mgt->active->next = NULL;

sys/kern/kern_kmalloc.c

810

KKASSERT(slab->next == NULL);

sys/kern/kern_kmalloc.c

812

ggm->empty_tailp = &slab->next;

sys/kern/kern_kmalloc.c

882

slab_tmp->next = NULL;

sys/kern/kern_kmalloc.c

884

ggm->empty_tailp = &slab_tmp->next;

sys/kern/kern_linker.c

479

module_t mod, next;

sys/kern/kern_linker.c

518

next = module_getfnext(mod);

sys/kern/kern_linker.c

520

mod = next;

sys/kern/kern_lockf.c

302

struct lockf_range *next;

sys/kern/kern_lockf.c

585

next = first_match;

sys/kern/kern_lockf.c

587

while ((range = next) != NULL) {

sys/kern/kern_lockf.c

588

next = TAILQ_NEXT(range, lf_link);

sys/kern/kern_lockf.c

624

if (next == brange)

sys/kern/kern_lockf.c

625

next = TAILQ_NEXT(next, lf_link);

sys/kern/kern_lockf.c

668

lf_insert(&lock->lf_range, range, next);

sys/kern/kern_mutex.c

1087

if (link->next == link) {

sys/kern/kern_mutex.c

1094

mtx->mtx_exlink = link->next;

sys/kern/kern_mutex.c

1095

link->next->prev = link->prev;

sys/kern/kern_mutex.c

1096

link->prev->next = link->next;

sys/kern/kern_mutex.c

1118

if (link->next == link) {

sys/kern/kern_mutex.c

1125

mtx->mtx_shlink = link->next;

sys/kern/kern_mutex.c

1126

link->next->prev = link->prev;

sys/kern/kern_mutex.c

1127

link->prev->next = link->next;

sys/kern/kern_mutex.c

171

link->next = mtx->mtx_exlink;

sys/kern/kern_mutex.c

172

link->prev = link->next->prev;

sys/kern/kern_mutex.c

173

link->next->prev = link;

sys/kern/kern_mutex.c

174

link->prev->next = link;

sys/kern/kern_mutex.c

176

link->next = link;

sys/kern/kern_mutex.c

323

link->next = mtx->mtx_shlink;

sys/kern/kern_mutex.c

324

link->prev = link->next->prev;

sys/kern/kern_mutex.c

325

link->next->prev = link;

sys/kern/kern_mutex.c

326

link->prev->next = link;

sys/kern/kern_mutex.c

328

link->next = link;

sys/kern/kern_mutex.c

762

if (link->next == link) {

sys/kern/kern_mutex.c

766

mtx->mtx_exlink = link->next;

sys/kern/kern_mutex.c

767

link->next->prev = link->prev;

sys/kern/kern_mutex.c

768

link->prev->next = link->next;

sys/kern/kern_mutex.c

836

for (link = mtx->mtx_shlink->next; link != mtx->mtx_shlink;

sys/kern/kern_mutex.c

837

link = link->next) {

sys/kern/kern_mutex.c

848

if (link->next == link) {

sys/kern/kern_mutex.c

851

mtx->mtx_shlink = link->next;

sys/kern/kern_mutex.c

852

link->next->prev = link->prev;

sys/kern/kern_mutex.c

853

link->prev->next = link->next;

sys/kern/kern_mutex.c

855

link->next = NULL;

sys/kern/kern_mutex.c

916

if (link->next == link) {

sys/kern/kern_mutex.c

920

mtx->mtx_exlink = link->next;

sys/kern/kern_mutex.c

921

link->next->prev = link->prev;

sys/kern/kern_mutex.c

922

link->prev->next = link->next;

sys/kern/kern_mutex.c

926

if (link->next == link) {

sys/kern/kern_mutex.c

930

mtx->mtx_shlink = link->next;

sys/kern/kern_mutex.c

931

link->next->prev = link->prev;

sys/kern/kern_mutex.c

932

link->prev->next = link->next;

sys/kern/kern_objcache.c

1009

LIST_REMOVE(&marker, next);

sys/kern/kern_objcache.c

127

LIST_ENTRY(objcache_desc) next;

sys/kern/kern_objcache.c

345

LIST_INSERT_HEAD(&allobjcaches, desc, next);

sys/kern/kern_objcache.c

917

LIST_REMOVE(desc, next);

sys/kern/kern_objcache.c

956

LIST_INSERT_HEAD(&allobjcaches, &marker, next);

sys/kern/kern_objcache.c

957

while ((desc = LIST_NEXT(&marker, next)) != NULL) {

sys/kern/kern_objcache.c

961

LIST_REMOVE(&marker, next);

sys/kern/kern_objcache.c

962

LIST_INSERT_AFTER(desc, &marker, next);

sys/kern/kern_sysctl.c

721

int *next, int *len, int level, struct sysctl_oid **oidpp)

sys/kern/kern_sysctl.c

727

*next = oidp->oid_number;

sys/kern/kern_sysctl.c

740

if (!sysctl_sysctl_next_ls(lsp, 0, 0, next+1,

sys/kern/kern_sysctl.c

756

next+1, len, level+1, oidpp))

sys/kern/kern_sysctl.c

758

goto next;

sys/kern/kern_sysctl.c

767

if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1, next+1,

sys/kern/kern_sysctl.c

770

next:

sys/kern/kern_sysctl.c

796

SYSCTL_NODE(_sysctl, CTL_SYSCTL_NEXT, next, CTLFLAG_RD | CTLFLAG_NOLOCK,

sys/kern/kern_timeout.c

1011

if (sc->next == c)

sys/kern/kern_timeout.c

1012

sc->next = TAILQ_NEXT(c, entry);

sys/kern/kern_timeout.c

139

struct _callout * volatile next;

sys/kern/kern_timeout.c

222

if (sc->next == c)

sys/kern/kern_timeout.c

223

sc->next = TAILQ_NEXT(c, entry);

sys/kern/kern_timeout.c

240

if (sc->next == c)

sys/kern/kern_timeout.c

241

sc->next = TAILQ_NEXT(c, entry);

sys/kern/kern_timeout.c

270

if (sc->next == c)

sys/kern/kern_timeout.c

271

sc->next = TAILQ_NEXT(c, entry);

sys/kern/kern_timeout.c

520

sc->next = TAILQ_FIRST(&wheel->list);

sys/kern/kern_timeout.c

521

while ((c = sc->next) != NULL) {

sys/kern/kern_timeout.c

527

sc->next = TAILQ_NEXT(c, entry);

sys/kern/subr_module.c

115

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

116

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

117

curp += next;

sys/kern/subr_module.c

131

int next;

sys/kern/subr_module.c

140

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

141

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

142

curp += next;

sys/kern/subr_module.c

156

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

157

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

158

curp += next;

sys/kern/subr_module.c

174

int next;

sys/kern/subr_module.c

202

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

203

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

204

curp += next;

sys/kern/subr_module.c

217

int next;

sys/kern/subr_module.c

239

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

240

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

241

curp += next;

sys/kern/subr_module.c

253

int next;

sys/kern/subr_module.c

275

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

276

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

277

curp += next;

sys/kern/subr_module.c

51

int next;

sys/kern/subr_module.c

79

next = sizeof(u_int32_t) * 2 + hdr[1];

sys/kern/subr_module.c

80

next = roundup(next, sizeof(u_long));

sys/kern/subr_module.c

81

curp += next;

sys/kern/subr_module.c

94

int next;

sys/kern/sys_pipe.c

1283

pipe->next = gd->gd_pipeq;

sys/kern/sys_pipe.c

422

gd->gd_pipeq = pipe->next;

sys/kern/sys_pipe.c

424

pipe->next = NULL;

sys/kern/sysv_msg.c

1031

next = msghdr->msg_spot;

sys/kern/sysv_msg.c

1039

if (next <= -1)

sys/kern/sysv_msg.c

1041

if (next >= msginfo.msgseg)

sys/kern/sysv_msg.c

1043

eval = copyout((caddr_t)&msgpool[next * msginfo.msgssz],

sys/kern/sysv_msg.c

105

short next; /* next segment in buffer */

sys/kern/sysv_msg.c

1055

next = msgmaps[next].next;

sys/kern/sysv_msg.c

154

msgmaps[i-1].next = i;

sys/kern/sysv_msg.c

155

msgmaps[i].next = -1; /* implies entry is available */

sys/kern/sysv_msg.c

180

short next;

sys/kern/sysv_msg.c

183

next = msgmaps[msghdr->msg_spot].next;

sys/kern/sysv_msg.c

184

msgmaps[msghdr->msg_spot].next = free_msgmaps;

sys/kern/sysv_msg.c

187

msghdr->msg_spot = next;

sys/kern/sysv_msg.c

467

short next;

sys/kern/sysv_msg.c

662

next = free_msgmaps;

sys/kern/sysv_msg.c

663

if (next <= -1)

sys/kern/sysv_msg.c

665

if (next >= msginfo.msgseg)

sys/kern/sysv_msg.c

668

kprintf("allocating segment %d to message\n", next);

sys/kern/sysv_msg.c

670

free_msgmaps = msgmaps[next].next;

sys/kern/sysv_msg.c

672

msgmaps[next].next = msghdr->msg_spot;

sys/kern/sysv_msg.c

673

msghdr->msg_spot = next;

sys/kern/sysv_msg.c

712

next = msghdr->msg_spot;

sys/kern/sysv_msg.c

719

if (next <= -1)

sys/kern/sysv_msg.c

721

if (next >= msginfo.msgseg)

sys/kern/sysv_msg.c

723

if ((eval = copyin(user_msgp, &msgpool[next * msginfo.msgssz],

sys/kern/sysv_msg.c

735

next = msgmaps[next].next;

sys/kern/sysv_msg.c

737

if (next != -1)

sys/kern/sysv_msg.c

801

short next;

sys/kern/uipc_usrreq.c

118

SLIST_ENTRY(unp_defdiscard) next;

sys/kern/uipc_usrreq.c

2388

SLIST_INSERT_HEAD(&unp_defdiscard_head, d, next);

sys/kern/uipc_usrreq.c

2562

SLIST_REMOVE_HEAD(&unp_defdiscard_head, next);

sys/kern/vfs_cache.c

1823

struct namecache *next;

sys/kern/vfs_cache.c

1832

if ((next = TAILQ_NEXT(ncp, nc_vnode)) != NULL)

sys/kern/vfs_cache.c

1833

_cache_hold(next);

sys/kern/vfs_cache.c

1840

if (next)

sys/kern/vfs_cache.c

1841

_cache_drop(next);

sys/kern/vfs_cache.c

1846

ncp = next;

sys/kern/vfs_cache.c

1871

struct namecache *next;

sys/kern/vfs_cache.c

1881

if ((next = TAILQ_NEXT(ncp, nc_vnode)) != NULL)

sys/kern/vfs_cache.c

1882

_cache_hold(next);

sys/kern/vfs_cache.c

1886

if (next)

sys/kern/vfs_cache.c

1887

_cache_drop(next);

sys/kern/vfs_cache.c

1894

if (next)

sys/kern/vfs_cache.c

1895

_cache_drop(next);

sys/kern/vfs_cache.c

1900

ncp = next;

sys/kern/vfs_cluster.c

1118

struct buf *next;

sys/kern/vfs_cluster.c

1161

next = tbp->b_cluster_next;

sys/kern/vfs_cluster.c

1192

tbp = next;

sys/kern/vfs_mount.c

932

goto next;

sys/kern/vfs_mount.c

943

goto next;

sys/kern/vfs_mount.c

972

goto next;

sys/kern/vfs_mount.c

999

next:

sys/kern/vfs_sync.c

650

static long start, incr, next;

sys/kern/vfs_sync.c

666

next += incr;

sys/kern/vfs_sync.c

667

if (next == 0 || next > SYNCER_MAXDELAY) {

sys/kern/vfs_sync.c

674

next = start;

sys/kern/vfs_sync.c

683

vn_syncer_add(vp, syncdelay > 0 ? next % syncdelay : 0);

sys/libprop/prop_rb.c

150

struct rb_node *prev = NULL, *next = NULL;

sys/libprop/prop_rb.c

155

next = parent;

sys/libprop/prop_rb.c

161

KASSERT(next == NULL || !RB_SENTINEL_P(next));

sys/libprop/prop_rb.c

162

if (prev != NULL && next == NULL)

sys/libprop/prop_rb.c

163

next = TAILQ_NEXT(prev, rb_link);

sys/libprop/prop_rb.c

164

if (prev == NULL && next != NULL)

sys/libprop/prop_rb.c

165

prev = TAILQ_PREV(next, rb_node_qh, rb_link);

sys/libprop/prop_rb.c

167

KASSERT(next == NULL || !RB_SENTINEL_P(next));

sys/libprop/prop_rb.c

170

KASSERT(next == NULL || (*compare_nodes)(rbto->rbto_context,

sys/libprop/prop_rb.c

171

RB_NODETOITEM(rbto, self), RB_NODETOITEM(rbto, next)) < 0);

sys/net/altq/altq_fairq.c

749

b->next = b;

sys/net/altq/altq_fairq.c

752

b->next = cl->cl_head;

sys/net/altq/altq_fairq.c

754

b->prev->next = b;

sys/net/altq/altq_fairq.c

755

b->next->prev = b;

sys/net/altq/altq_fairq.c

920

cl->cl_head = b->next;

sys/net/altq/altq_fairq.c

925

b->next->prev = b->prev;

sys/net/altq/altq_fairq.c

926

b->prev->next = b->next;

sys/net/altq/altq_fairq.c

942

cl->cl_head = b->next;

sys/net/altq/altq_fairq.c

946

cl->cl_head = b->next;

sys/net/altq/altq_fairq.c

989

b = b->next;

sys/net/altq/altq_fairq.h

84

struct fairq_bucket *next; /* circular list */

sys/net/if.c

791

struct ifaddr_container *ifac, *next;

sys/net/if.c

802

ifa_link, next) {

sys/net/if_media.c

395

struct ifmedia_entry *match, *next;

sys/net/if_media.c

400

LIST_FOREACH(next, &ifm->ifm_list, ifm_list) {

sys/net/if_media.c

401

if ((next->ifm_media & mask) == (target & mask)) {

sys/net/if_media.c

408

match = next;

sys/net/ip_mroute/ip_mroute.c

1023

struct rtdetq *n = rte->next;

sys/net/ip_mroute/ip_mroute.c

1354

for (p = &rt->mfc_stall; *p != NULL; p = &(*p)->next)

sys/net/ip_mroute/ip_mroute.c

1372

rte->next = NULL;

sys/net/ip_mroute/ip_mroute.c

1411

struct rtdetq *n = rte->next;

sys/net/ip_mroute/ip_mroute.c

654

struct rtdetq *n = rte->next;

sys/net/ip_mroute/ip_mroute.h

318

struct rtdetq *next; /* Next in list of packets */

sys/net/ipfw/ip_fw2.c

3010

for (rule = me->next; rule; rule = rule->next) {

sys/net/ipfw/ip_fw2.c

3016

rule = me->next;

sys/net/ipfw/ip_fw2.c

3581

f = f->next;

sys/net/ipfw/ip_fw2.c

3595

for (; f; f = f->next) {

sys/net/ipfw/ip_fw2.c

4468

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next)

sys/net/ipfw/ip_fw2.c

4545

struct ip_fw *prev, *next;

sys/net/ipfw/ip_fw2.c

4550

next = fwmsg->next_rule;

sys/net/ipfw/ip_fw2.c

4551

KKASSERT(next->cpuid == mycpuid);

sys/net/ipfw/ip_fw2.c

4553

rule->next = next;

sys/net/ipfw/ip_fw2.c

4554

prev->next = rule;

sys/net/ipfw/ip_fw2.c

4561

fwmsg->next_rule = next->sibling;

sys/net/ipfw/ip_fw2.c

4564

rule->next = ctx->ipfw_layer3_chain;

sys/net/ipfw/ip_fw2.c

4638

for (f = ctx->ipfw_layer3_chain; f; f = f->next) {

sys/net/ipfw/ip_fw2.c

4654

prev = f, f = f->next) {

sys/net/ipfw/ip_fw2.c

4717

n = rule->next;

sys/net/ipfw/ip_fw2.c

4721

prev->next = n;

sys/net/ipfw/ip_fw2.c

4742

rule->next = ipfw_gd.ipfw_crossref_free;

sys/net/ipfw/ip_fw2.c

4914

prev = rule, rule = rule->next)

sys/net/ipfw/ip_fw2.c

4966

rule = rule->next;

sys/net/ipfw/ip_fw2.c

4990

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next) {

sys/net/ipfw/ip_fw2.c

5029

rule = rule->next;

sys/net/ipfw/ip_fw2.c

5048

rule = rule->next) {

sys/net/ipfw/ip_fw2.c

5077

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next) {

sys/net/ipfw/ip_fw2.c

5112

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next) {

sys/net/ipfw/ip_fw2.c

5230

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next)

sys/net/ipfw/ip_fw2.c

5243

rule = rule->next)

sys/net/ipfw/ip_fw2.c

5286

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next) {

sys/net/ipfw/ip_fw2.c

5817

for (rule = ctx->ipfw_layer3_chain; rule; rule = rule->next)

sys/net/ipfw/ip_fw2.c

6520

rule = rule->next;

sys/net/ipfw/ip_fw2.c

6522

prev->next = rule;

sys/net/ipfw/ip_fw2.c

6543

rule = rule->next;

sys/net/ipfw/ip_fw2.c

7325

for (f = ctx->ipfw_layer3_chain; f != NULL; f = f->next) {

sys/net/ipfw/ip_fw2.h

324

struct ip_fw *next; /* linked list of rules */

sys/net/ipfw3/ip_fw3.c

1005

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3.c

200

for (; fw; fw = fw->next) {

sys/net/ipfw3/ip_fw3.c

297

for (rule = me->next; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3.c

303

rule = me->next;

sys/net/ipfw3/ip_fw3.c

463

f = f->next;

sys/net/ipfw3/ip_fw3.c

485

for (; f; f = f->next) {

sys/net/ipfw3/ip_fw3.c

645

struct ip_fw *rule, *prev,*next;

sys/net/ipfw3/ip_fw3.c

657

for (prev = NULL, next = ctx->rules;

sys/net/ipfw3/ip_fw3.c

658

next; prev = next, next = next->next) {

sys/net/ipfw3/ip_fw3.c

660

if (next->rulenum >= ioc_rule->rulenum) {

sys/net/ipfw3/ip_fw3.c

664

if (next->rulenum > ioc_rule->rulenum) {

sys/net/ipfw3/ip_fw3.c

669

KASSERT(next != NULL, ("no default rule?!"));

sys/net/ipfw3/ip_fw3.c

675

rule->next = next;

sys/net/ipfw3/ip_fw3.c

676

prev->next = rule;

sys/net/ipfw3/ip_fw3.c

678

rule->next = ctx->rules;

sys/net/ipfw3/ip_fw3.c

723

for (f = ctx->rules; f; f = f->next) {

sys/net/ipfw3/ip_fw3.c

761

ctx->rules = rule->next;

sys/net/ipfw3/ip_fw3.c

763

prev->next = rule->next;

sys/net/ipfw3/ip_fw3.c

785

rule = rule->next;

sys/net/ipfw3/ip_fw3.c

837

rule = rule->next;

sys/net/ipfw3/ip_fw3.c

883

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3.c

887

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3.c

926

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3.h

261

struct ip_fw *next; /* linked list of rules */

sys/net/ipfw3/ip_fw3_set.c

125

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3_set.c

160

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3/ip_fw3_set.c

231

rule = rule->next;

sys/net/ipfw3/ip_fw3_set.c

90

for (rule = ctx->rules; rule; rule = rule->next) {

sys/net/ipfw3_basic/ip_fw3_basic.c

114

for (rule = me->next; rule; rule = rule->next) {

sys/net/ipfw3_basic/ip_fw3_basic.c

120

rule = me->next;

sys/net/ipfw3_nat/ip_fw3_nat.c

193

LIST_FOREACH(alias, &nat->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

262

LIST_FOREACH(alias, &nat->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

495

LIST_FOREACH(alias, &nat->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

555

LIST_FOREACH(a1, &the->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

610

LIST_FOREACH(a1, &the->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

666

LIST_FOREACH(a1, &the->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

714

LIST_FOREACH(alias, &nat->alias, next) {

sys/net/ipfw3_nat/ip_fw3_nat.c

761

LIST_INSERT_HEAD((&nat->alias), alias, next);

sys/net/ipfw3_nat/ip_fw3_nat.c

843

LIST_FOREACH_MUTABLE(alias, &nat->alias, next, tmp3) {

sys/net/ipfw3_nat/ip_fw3_nat.c

948

LIST_FOREACH_MUTABLE(a1, &nat->alias, next, tmp2) {

sys/net/ipfw3_nat/ip_fw3_nat.c

967

LIST_FOREACH_MUTABLE(a1, &nat->alias, next, tmp2) {

sys/net/ipfw3_nat/ip_fw3_nat.c

985

LIST_FOREACH_MUTABLE(a1, &nat->alias, next, tmp2) {

sys/net/ipfw3_nat/ip_fw3_nat.h

129

LIST_ENTRY(cfg_alias) next;

sys/net/netmap/netmap_vale.c

1225

u_int dst_nr, lim, j, sent = 0, d_i, next, brd_next;

sys/net/netmap/netmap_vale.c

1257

next = d->bq_head;

sys/net/netmap/netmap_vale.c

1314

if (next < brd_next) {

sys/net/netmap/netmap_vale.c

1315

ft_p = ft + next;

sys/net/netmap/netmap_vale.c

1316

next = ft_p->ft_next;

sys/net/netmap/netmap_vale.c

1355

if (next == NM_FT_NULL && brd_next == NM_FT_NULL)

sys/net/pf/pf.c

1415

struct pf_src_node *cur, *next;

sys/net/pf/pf.c

1421

cur = next) {

sys/net/pf/pf.c

1422

next = RB_NEXT(pf_src_tree, &tree_src_tracking[cpu], cur);

sys/net/pf/pf.c

1427

next = RB_NEXT(pf_src_tree,

sys/net/pf/pf_ioctl.c

495

struct pf_tagname *p, *next;

sys/net/pf/pf_ioctl.c

500

for (p = TAILQ_FIRST(head); p != NULL; p = next) {

sys/net/pf/pf_ioctl.c

501

next = TAILQ_NEXT(p, entries);

sys/net/pf/pf_norm.c

337

struct pf_frent *frea, *next;

sys/net/pf/pf_norm.c

422

frea = next)

sys/net/pf/pf_norm.c

441

next = LIST_NEXT(frea, fr_next);

sys/net/pf/pf_norm.c

467

for (frep = LIST_FIRST(&(*frag)->fr_queue); frep; frep = next) {

sys/net/pf/pf_norm.c

468

next = LIST_NEXT(frep, fr_next);

sys/net/pf/pf_norm.c

472

(next == NULL || FR_IP_OFF(next) != off))

sys/net/pf/pf_norm.c

475

off, next == NULL ? -1 : FR_IP_OFF(next),

sys/net/pf/pf_norm.c

493

next = LIST_NEXT(frent, fr_next);

sys/net/pf/pf_norm.c

503

for (frent = next; frent != NULL; frent = next) {

sys/net/pf/pf_norm.c

504

next = LIST_NEXT(frent, fr_next);

sys/net/pf/pf_table.c

1667

struct pfr_kentry *p, *q, *next;

sys/net/pf/pf_table.c

1677

for (p = SLIST_FIRST(&addrq); p != NULL; p = next) {

sys/net/pf/pf_table.c

1678

next = SLIST_NEXT(p, pfrke_workq); /* XXX */

sys/net/radix.c

1079

struct radix_node *rn, *base, *next, *last;

sys/net/radix.c

1146

next = rn;

sys/net/radix.c

1154

rn = next;

sys/net/radix.c

1169

struct radix_node *rn, *base, *next;

sys/net/radix.c

1198

next = rn;

sys/net/radix.c

1205

rn = next;

sys/net/wg/wg_noise.c

1296

struct noise_keypair *kp, *next, *current, *previous;

sys/net/wg/wg_noise.c

1325

next = atomic_load_ptr(&r->r_keypair_next);

sys/net/wg/wg_noise.c

1337

if (next != NULL) {

sys/net/wg/wg_noise.c

1339

atomic_store_ptr(&r->r_keypair_previous, next);

sys/net/wg/wg_noise.c

1355

noise_keypair_drop(next);

sys/net/zlib.c

4354

*(t = &(q->next)) = Z_NULL;

sys/net/zlib.c

4363

r.next = q; /* pointer to this table */

sys/net/zlib.c

4590

r = (q - 1)->next;

sys/net/zlib.c

4591

(q - 1)->next = p;

sys/net/zlib.c

4598

q = (--p)->next;

sys/net/zlib.c

4770

c->sub.code.tree = t->next;

sys/net/zlib.c

4808

c->sub.code.tree = t->next;

sys/net/zlib.c

5092

e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;

sys/net/zlib.c

5105

if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)

sys/netbt/hci.h

2444

LIST_ENTRY(hci_memo) next;

sys/netbt/hci_event.c

1049

struct hci_link *link, *next;

sys/netbt/hci_event.c

1064

next = TAILQ_FIRST(&unit->hci_links);

sys/netbt/hci_event.c

1065

while ((link = next) != NULL) {

sys/netbt/hci_event.c

1066

next = TAILQ_NEXT(link, hl_next);

sys/netbt/hci_event.c

372

struct hci_link *link, *next;

sys/netbt/hci_event.c

420

next = TAILQ_NEXT(link, hl_next);

sys/netbt/hci_event.c

430

link = next;

sys/netbt/hci_link.c

326

struct l2cap_channel *chan, *next;

sys/netbt/hci_link.c

350

next = LIST_FIRST(&l2cap_active_list);

sys/netbt/hci_link.c

351

while ((chan = next) != NULL) {

sys/netbt/hci_link.c

352

next = LIST_NEXT(chan, lc_ncid);

sys/netbt/hci_link.c

935

struct l2cap_channel *chan, *next;

sys/netbt/hci_link.c

945

next = LIST_FIRST(&l2cap_active_list);

sys/netbt/hci_link.c

946

while ((chan = next) != NULL) {

sys/netbt/hci_link.c

947

next = LIST_NEXT(chan, lc_ncid);

sys/netbt/hci_misc.c

122

m0 = LIST_NEXT(memo, next);

sys/netbt/hci_misc.c

164

LIST_INSERT_HEAD(&unit->hci_memos, memo, next);

sys/netbt/hci_misc.c

179

LIST_REMOVE(memo, next);

sys/netbt/hci_unit.c

220

struct hci_link *link, *next;

sys/netbt/hci_unit.c

239

next = TAILQ_FIRST(&unit->hci_links);

sys/netbt/hci_unit.c

240

while ((link = next) != NULL) {

sys/netbt/hci_unit.c

241

next = TAILQ_NEXT(link, hl_next);

sys/netbt/l2cap_signal.c

1066

uint8_t *next, buf[L2CAP_MTU_MINIMUM];

sys/netbt/l2cap_signal.c

1078

next = buf + sizeof(l2cap_cfg_req_cp);

sys/netbt/l2cap_signal.c

1082

opt = (l2cap_cfg_opt_t *)next;

sys/netbt/l2cap_signal.c

1089

next += sizeof(l2cap_cfg_opt_t) + L2CAP_OPT_MTU_SIZE;

sys/netbt/l2cap_signal.c

1094

opt = (l2cap_cfg_opt_t *)next;

sys/netbt/l2cap_signal.c

1101

next += sizeof(l2cap_cfg_opt_t) + L2CAP_OPT_FLUSH_TIMO_SIZE;

sys/netbt/l2cap_signal.c

1112

chan->lc_link->hl_lastid, (int)(next - buf), buf);

sys/netbt/rfcomm_session.c

1430

struct rfcomm_dlc *dlc, *next;

sys/netbt/rfcomm_session.c

1437

next = LIST_FIRST(&rs->rs_dlcs);

sys/netbt/rfcomm_session.c

1438

while ((dlc = next) != NULL) {

sys/netbt/rfcomm_session.c

1439

next = LIST_NEXT(dlc, rd_next);

sys/netbt/rfcomm_session.c

507

struct rfcomm_dlc *dlc, *next;

sys/netbt/rfcomm_session.c

524

next = LIST_FIRST(&rs->rs_dlcs);

sys/netbt/rfcomm_session.c

525

while ((dlc = next) != NULL) {

sys/netbt/rfcomm_session.c

526

next = LIST_NEXT(dlc, rd_next);

sys/netgraph/bridge/ng_bridge.c

108

SLIST_ENTRY(ng_bridge_hent) next; /* next entry in bucket */

sys/netgraph/bridge/ng_bridge.c

489

SLIST_FOREACH(hent, &priv->tab[bucket], next)

sys/netgraph/bridge/ng_bridge.c

787

SLIST_FOREACH(hent, &priv->tab[bucket], next) {

sys/netgraph/bridge/ng_bridge.c

809

SLIST_FOREACH(hent, &priv->tab[bucket], next) {

sys/netgraph/bridge/ng_bridge.c

825

SLIST_INSERT_HEAD(&priv->tab[bucket], hent, next);

sys/netgraph/bridge/ng_bridge.c

873

SLIST_REMOVE_HEAD(oldList, next);

sys/netgraph/bridge/ng_bridge.c

875

SLIST_INSERT_HEAD(&newTab[newBucket], hent, next);

sys/netgraph/bridge/ng_bridge.c

912

*hptr = SLIST_NEXT(hent, next);

sys/netgraph/bridge/ng_bridge.c

916

hptr = &SLIST_NEXT(hent, next);

sys/netgraph/bridge/ng_bridge.c

967

*hptr = SLIST_NEXT(hent, next);

sys/netgraph/bridge/ng_bridge.c

973

hptr = &SLIST_NEXT(hent, next);

sys/netgraph/eiface/ng_eiface.c

86

struct private *next; /* When hung on the free list */

sys/netgraph/etf/ng_etf.c

137

LIST_ENTRY(filter) next;

sys/netgraph/etf/ng_etf.c

165

LIST_FOREACH(fil, chain, next) {

sys/netgraph/etf/ng_etf.c

337

fil, next);

sys/netgraph/etf/ng_etf.c

474

LIST_FOREACH(fil, (etfp->hashtable + i), next) {

sys/netgraph/etf/ng_etf.c

476

LIST_REMOVE(fil, next);

sys/netgraph/netgraph/ng_base.c

1854

struct ng_queue_entry *next;

sys/netgraph/netgraph/ng_base.c

1898

ngqfree = q->next;

sys/netgraph/netgraph/ng_base.c

1912

(q)->next = ngqfree; \

sys/netgraph/netgraph/ng_base.c

1941

q->next = NULL;

sys/netgraph/netgraph/ng_base.c

1950

ngqlast->next = q;

sys/netgraph/netgraph/ng_base.c

1990

q->next = NULL;

sys/netgraph/netgraph/ng_base.c

1999

ngqlast->next = q;

sys/netgraph/netgraph/ng_base.c

2039

ngqbase = ngq->next;

sys/netgraph7/bluetooth/hci/ng_hci_evnt.c

264

LIST_FOREACH(con, &unit->con_list, next) {

sys/netgraph7/bluetooth/hci/ng_hci_evnt.c

453

LIST_FOREACH(con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_evnt.c

613

LIST_FOREACH(con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_main.c

460

ng_hci_neighbor_p nn = LIST_NEXT(n, next);

sys/netgraph7/bluetooth/hci/ng_hci_main.c

485

LIST_FOREACH(n, &unit->neighbors, next) {

sys/netgraph7/bluetooth/hci/ng_hci_main.c

508

LIST_FOREACH(c, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_main.c

526

LIST_FOREACH(c, &unit->con_list, next) {

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

182

LIST_INSERT_HEAD(&unit->neighbors, n, next);

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

195

LIST_REMOVE(n, next);

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

221

ng_hci_neighbor_p nn = LIST_NEXT(n, next);

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

295

LIST_INSERT_HEAD(&unit->con_list, con, next);

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

308

LIST_REMOVE(con, next);

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

335

LIST_FOREACH(con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_misc.c

351

LIST_FOREACH(con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c

329

LIST_FOREACH(acl_con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c

375

LIST_FOREACH(sco_con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c

750

LIST_FOREACH(con, &unit->con_list, next)

sys/netgraph7/bluetooth/hci/ng_hci_var.h

193

LIST_ENTRY(ng_hci_unit_con) next; /* next */

sys/netgraph7/bluetooth/hci/ng_hci_var.h

213

LIST_ENTRY(ng_hci_neighbor) next;

sys/netgraph7/bluetooth/include/ng_btsocket_hci_raw.h

53

LIST_ENTRY(ng_btsocket_hci_raw_pcb) next; /* link to next */

sys/netgraph7/bluetooth/include/ng_btsocket_l2cap.h

169

LIST_ENTRY(ng_btsocket_l2cap_pcb) next; /* link to next PCB */

sys/netgraph7/bluetooth/include/ng_btsocket_l2cap.h

47

LIST_ENTRY(ng_btsocket_l2cap_rtentry) next; /* link to next */

sys/netgraph7/bluetooth/include/ng_btsocket_l2cap.h

80

LIST_ENTRY(ng_btsocket_l2cap_raw_pcb) next; /* link to next PCB */

sys/netgraph7/bluetooth/include/ng_btsocket_rfcomm.h

257

LIST_ENTRY(ng_btsocket_rfcomm_session) next; /* link to next */

sys/netgraph7/bluetooth/include/ng_btsocket_rfcomm.h

302

LIST_ENTRY(ng_btsocket_rfcomm_pcb) next; /* link to next */

sys/netgraph7/bluetooth/l2cap/ng_l2cap_cmds.c

312

LIST_FOREACH(ch, &l2cap->chan_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_cmds.c

71

TAILQ_FOREACH(cmd, &con->cmd_list, next) {

sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c

557

LIST_FOREACH(con, &l2cap->con_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c

575

LIST_FOREACH(con, &l2cap->con_list, next) {

sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c

604

LIST_FOREACH(ch, &l2cap->chan_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c

623

LIST_FOREACH(ch, &l2cap->chan_list, next) {

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

140

LIST_INSERT_HEAD(&l2cap->con_list, con, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

261

n = LIST_NEXT(f, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

284

LIST_REMOVE(con, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

299

LIST_FOREACH(con, &l2cap->con_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

315

LIST_FOREACH(con, &l2cap->con_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

355

LIST_INSERT_HEAD(&l2cap->chan_list, ch, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

376

LIST_FOREACH(ch, &l2cap->chan_list, next)

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

394

n = TAILQ_NEXT(f, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

406

LIST_REMOVE(ch, next);

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c

452

TAILQ_FOREACH(cmd, &con->cmd_list, next) {

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.h

64

TAILQ_INSERT_TAIL(&(con)->cmd_list, (cmd), next); \

sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.h

70

TAILQ_REMOVE(&((cmd)->con->cmd_list), (cmd), next); \

sys/netgraph7/bluetooth/l2cap/ng_l2cap_var.h

129

LIST_ENTRY(ng_l2cap_con) next; /* link */

sys/netgraph7/bluetooth/l2cap/ng_l2cap_var.h

162

LIST_ENTRY(ng_l2cap_chan) next; /* link */

sys/netgraph7/bluetooth/l2cap/ng_l2cap_var.h

185

TAILQ_ENTRY(ng_l2cap_cmd) next; /* link */

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

1550

LIST_REMOVE(pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

493

LIST_FOREACH(pcb, &ng_btsocket_hci_raw_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

504

goto next;

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

512

goto next;

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

537

next:

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

558

LIST_FOREACH(pcb, &ng_btsocket_hci_raw_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_hci_raw.c

951

LIST_INSERT_HEAD(&ng_btsocket_hci_raw_sockets, pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1509

LIST_FOREACH(pcb, &ng_btsocket_l2cap_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1519

goto next;

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1532

next:

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1570

LIST_INSERT_HEAD(&ng_btsocket_l2cap_rt, rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1755

pcb_next = LIST_NEXT(pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1780

ng_btsocket_l2cap_rtentry_p rt_next = LIST_NEXT(rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

1783

LIST_REMOVE(rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2023

LIST_INSERT_HEAD(&ng_btsocket_l2cap_sockets, pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2076

LIST_FOREACH(pcb, &ng_btsocket_l2cap_sockets, next)

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2167

LIST_FOREACH(rt, &ng_btsocket_l2cap_rt, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2364

LIST_REMOVE(pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2686

LIST_FOREACH(p, &ng_btsocket_l2cap_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2716

LIST_FOREACH(p, &ng_btsocket_l2cap_sockets, next)

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap.c

2735

LIST_FOREACH(p, &ng_btsocket_l2cap_sockets, next)

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

1172

LIST_REMOVE(pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

388

rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

415

LIST_FOREACH(pcb,&ng_btsocket_l2cap_raw_sockets,next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

462

LIST_FOREACH(pcb, &ng_btsocket_l2cap_raw_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

486

ng_btsocket_l2cap_rtentry_p rt_next = LIST_NEXT(rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

489

LIST_REMOVE(rt, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

647

LIST_INSERT_HEAD(&ng_btsocket_l2cap_raw_sockets, pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

694

LIST_FOREACH(rt, &ng_btsocket_l2cap_raw_rt, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_l2cap_raw.c

787

LIST_FOREACH(rt, &ng_btsocket_l2cap_raw_rt, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

1129

s_next = LIST_NEXT(s, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

1135

LIST_REMOVE(s, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

1445

LIST_INSERT_HEAD(&ng_btsocket_rfcomm_sessions, s, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

1886

LIST_FOREACH(s, &ng_btsocket_rfcomm_sessions, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

3487

LIST_FOREACH(pcb, &ng_btsocket_rfcomm_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

441

LIST_INSERT_HEAD(&ng_btsocket_rfcomm_sockets, pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

489

LIST_FOREACH(pcb1, &ng_btsocket_rfcomm_sockets, next) {

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

794

LIST_REMOVE(pcb, next);

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

900

LIST_FOREACH(pcb1, &ng_btsocket_rfcomm_sockets, next)

sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c

946

LIST_FOREACH(s, &ng_btsocket_rfcomm_sessions, next)

sys/netgraph7/bridge/ng_bridge.c

113

SLIST_ENTRY(ng_bridge_hent) next; /* next entry in bucket */

sys/netgraph7/bridge/ng_bridge.c

492

SLIST_FOREACH(hent, &priv->tab[bucket], next)

sys/netgraph7/bridge/ng_bridge.c

828

SLIST_FOREACH(hent, &priv->tab[bucket], next) {

sys/netgraph7/bridge/ng_bridge.c

849

SLIST_FOREACH(hent, &priv->tab[bucket], next) {

sys/netgraph7/bridge/ng_bridge.c

865

SLIST_INSERT_HEAD(&priv->tab[bucket], hent, next);

sys/netgraph7/bridge/ng_bridge.c

913

SLIST_REMOVE_HEAD(oldList, next);

sys/netgraph7/bridge/ng_bridge.c

915

SLIST_INSERT_HEAD(&newTab[newBucket], hent, next);

sys/netgraph7/bridge/ng_bridge.c

952

*hptr = SLIST_NEXT(hent, next);

sys/netgraph7/bridge/ng_bridge.c

956

hptr = &SLIST_NEXT(hent, next);

sys/netgraph7/bridge/ng_bridge.c

991

*hptr = SLIST_NEXT(hent, next);

sys/netgraph7/bridge/ng_bridge.c

997

hptr = &SLIST_NEXT(hent, next);

sys/netgraph7/etf/ng_etf.c

135

LIST_ENTRY(filter) next;

sys/netgraph7/etf/ng_etf.c

163

LIST_FOREACH(fil, chain, next) {

sys/netgraph7/etf/ng_etf.c

332

fil, next);

sys/netgraph7/etf/ng_etf.c

464

fil2 = LIST_NEXT(fil1, next);

sys/netgraph7/etf/ng_etf.c

466

LIST_REMOVE(fil1, next);

sys/netgraph7/ng_vlan.c

130

LIST_ENTRY(filter) next;

sys/netgraph7/ng_vlan.c

152

LIST_FOREACH(f, chain, next)

sys/netgraph7/ng_vlan.c

257

&priv->hashtable[HASH(f->vlan)], f, next);

sys/netgraph7/ng_vlan.c

275

LIST_REMOVE(f, next);

sys/netgraph7/ng_vlan.c

290

LIST_FOREACH(f, &priv->hashtable[i], next) {

sys/netgraph7/ng_vlan.c

322

LIST_FOREACH(f, chain, next) {

sys/netgraph7/ng_vlan.c

460

LIST_REMOVE(f, next);

sys/netinet/in_pcb.c

911

goto next;

sys/netinet/in_pcb.c

919

goto next;

sys/netinet/in_pcb.c

928

next:

sys/netinet/ip_input.c

1232

next = 0;

sys/netinet/ip_input.c

1241

if (fp_off != next) {

sys/netinet/ip_input.c

1248

next += fp_len;

sys/netinet/ip_input.c

1265

if (next + (IP_VHL_HL(ip->ip_vhl) << 2) > IP_MAXPACKET) {

sys/netinet/ip_input.c

1307

ip->ip_len = htons(next + hlen);

sys/netinet/ip_input.c

986

int i, next;

sys/netinet/tcp_input.c

3345

tcp_seq next;

sys/netinet/tcp_input.c

3356

next = tp->snd_nxt = tp->snd_max;

sys/netinet/tcp_input.c

3363

sent = tp->snd_nxt - next;

sys/netinet6/frag6.c

161

int offset = *offp, nxt, i, next;

sys/netinet6/frag6.c

423

next = 0;

sys/netinet6/frag6.c

426

if (af6->ip6af_off != next) {

sys/netinet6/frag6.c

430

next += af6->ip6af_frglen;

sys/netinet6/frag6.c

462

if ((u_int)next + (u_int)offset - sizeof(struct ip6_hdr) >

sys/netinet6/frag6.c

470

ip6->ip6_plen = htons((u_short)next + offset - sizeof(struct ip6_hdr));

sys/netinet6/in6.c

1343

struct ifaddr_container *ifac, *next;

sys/netinet6/in6.c

1346

ifa_link, next) {

sys/netinet6/in6_cksum.c

191

goto next;

sys/netinet6/in6_cksum.c

208

next:

sys/netinet6/in6_ifattach.c

787

struct ifaddr_container *ifac, *next;

sys/netinet6/in6_ifattach.c

799

next) {

sys/netinet6/ip6_mroute.c

1176

for (p = &rt->mf6c_stall; *p != NULL; p = &(*p)->next)

sys/netinet6/ip6_mroute.c

1189

rte->next = NULL;

sys/netinet6/ip6_mroute.c

1245

struct rtdetq *n = rte->next;

sys/netinet6/ip6_mroute.c

531

struct rtdetq *n = rte->next;

sys/netinet6/ip6_mroute.c

763

struct rtdetq *n = rte->next;

sys/netinet6/ip6_mroute.h

271

struct rtdetq *next;

sys/netinet6/nd6.c

1030

struct llinfo_nd6 *ln = (struct llinfo_nd6 *)rt->rt_llinfo, *next;

sys/netinet6/nd6.c

1103

next = ln->ln_next;

sys/netinet6/nd6.c

1117

return (next);

sys/netinet6/nd6.c

1584

struct nd_prefix *pr, *next;

sys/netinet6/nd6.c

1587

for (pr = nd_prefix.lh_first; pr; pr = next) {

sys/netinet6/nd6.c

1590

next = pr->ndpr_next;

sys/netinet6/nd6.c

1614

struct nd_defrouter *dr, *next;

sys/netinet6/nd6.c

1622

for (dr = TAILQ_NEXT(dr, dr_entry); dr; dr = next) {

sys/netinet6/nd6.c

1623

next = TAILQ_NEXT(dr, dr_entry);

sys/netinet6/nd6.c

467

struct llinfo_nd6 *next = ln->ln_next;

sys/netinet6/nd6.c

472

ln = next;

sys/netinet6/nd6.c

476

ln = next;

sys/netinet6/nd6.c

483

ln = next;

sys/netinet6/nd6.c

498

next = nd6_free(rt);

sys/netinet6/nd6.c

542

next = nd6_free(rt);

sys/netinet6/nd6.c

569

next = nd6_free(rt);

sys/netinet6/nd6.c

573

ln = next;

sys/netinet6/nd6_rtr.c

806

struct nd_pfxrouter *pfr, *next;

sys/netinet6/nd6_rtr.c

838

for (pfr = pr->ndpr_advrtrs.lh_first; pfr; pfr = next) {

sys/netinet6/nd6_rtr.c

839

next = pfr->pfr_next;

sys/netproto/802_11/wlan/ieee80211_ageq.c

92

struct mbuf *next;

sys/netproto/802_11/wlan/ieee80211_ageq.c

94

for (; m != NULL; m = next) {

sys/netproto/802_11/wlan/ieee80211_ageq.c

95

next = m->m_nextpkt;

sys/netproto/802_11/wlan/ieee80211_hwmp.c

1382

struct mbuf *m, *next;

sys/netproto/802_11/wlan/ieee80211_hwmp.c

1639

for (; m != NULL; m = next) {

sys/netproto/802_11/wlan/ieee80211_hwmp.c

1640

next = m->m_nextpkt;

sys/netproto/802_11/wlan/ieee80211_mesh.c

1097

struct mbuf *m, *mcopy, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

1149

for (; mcopy != NULL; mcopy = next) {

sys/netproto/802_11/wlan/ieee80211_mesh.c

1150

next = mcopy->m_nextpkt;

sys/netproto/802_11/wlan/ieee80211_mesh.c

2614

struct ieee80211_mesh_gate_route *gr, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

2646

TAILQ_FOREACH_SAFE(gr, &ms->ms_known_gates, gr_next, next) {

sys/netproto/802_11/wlan/ieee80211_mesh.c

373

struct ieee80211_mesh_route *rt, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

376

TAILQ_FOREACH_SAFE(rt, &ms->ms_routes, rt_next, next) {

sys/netproto/802_11/wlan/ieee80211_mesh.c

397

struct ieee80211_mesh_route *rt, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

402

TAILQ_FOREACH_SAFE(rt, &ms->ms_routes, rt_next, next)

sys/netproto/802_11/wlan/ieee80211_mesh.c

412

struct ieee80211_mesh_route *rt, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

415

TAILQ_FOREACH_SAFE(rt, &ms->ms_routes, rt_next, next) {

sys/netproto/802_11/wlan/ieee80211_mesh.c

430

struct ieee80211_mesh_route *rt, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

435

TAILQ_FOREACH_SAFE(rt, &ms->ms_routes, rt_next, next) {

sys/netproto/802_11/wlan/ieee80211_mesh.c

883

struct ieee80211_mesh_gate_route *gr = NULL, *next;

sys/netproto/802_11/wlan/ieee80211_mesh.c

887

TAILQ_FOREACH_SAFE(gr, &ms->ms_known_gates, gr_next, next) {

sys/netproto/802_11/wlan/ieee80211_node.c

1981

struct ieee80211_node *ni, *next;

sys/netproto/802_11/wlan/ieee80211_node.c

1984

TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, next) {

sys/netproto/802_11/wlan/ieee80211_node.c

2007

TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, next)

sys/netproto/802_11/wlan/ieee80211_output.c

1753

struct mbuf *next;

sys/netproto/802_11/wlan/ieee80211_output.c

1759

next = m->m_nextpkt;

sys/netproto/802_11/wlan/ieee80211_output.c

1762

} while ((m = next) != NULL);

sys/netproto/802_11/wlan/ieee80211_proto.c

819

goto next;

sys/netproto/802_11/wlan/ieee80211_proto.c

824

next:

sys/netproto/802_11/wlan/ieee80211_scan_sta.c

1681

struct sta_entry *se, *next;

sys/netproto/802_11/wlan/ieee80211_scan_sta.c

1684

TAILQ_FOREACH_SAFE(se, &st->st_entry, se_list, next) {

sys/netproto/802_11/wlan/ieee80211_scan_sta.c

222

struct sta_entry *se, *next;

sys/netproto/802_11/wlan/ieee80211_scan_sta.c

224

TAILQ_FOREACH_SAFE(se, &st->st_entry, se_list, next) {

sys/netproto/802_11/wlan/ieee80211_superg.c

609

struct mbuf *m, *next;

sys/netproto/802_11/wlan/ieee80211_superg.c

613

for (m = head; m != last; m = next) {

sys/netproto/802_11/wlan/ieee80211_superg.c

614

next = m->m_nextpkt;

sys/netproto/802_11/wlan/ieee80211_wds.c

106

struct mbuf *m, *next;

sys/netproto/802_11/wlan/ieee80211_wds.c

117

for (; m != NULL; m = next) {

sys/netproto/802_11/wlan/ieee80211_wds.c

118

next = m->m_nextpkt;

sys/platform/pc64/apic/lapic.c

102

.next = SLIST_ENTRY_INITIALIZER,

sys/platform/pc64/include/md_var.h

119

thread_t cpu_exit_switch (struct thread *next);

sys/platform/pc64/isa/clock.c

154

.next = SLIST_ENTRY_INITIALIZER,

sys/platform/pc64/isa/clock.c

1579

tsc_uclock_t next;

sys/platform/pc64/isa/clock.c

1587

next = rdtsc();

sys/platform/pc64/isa/clock.c

1589

last = next;

sys/platform/pc64/isa/clock.c

1593

delta = next - last;

sys/platform/pc64/isa/clock.c

1604

last = next;

sys/platform/pc64/isa/clock.c

1609

next = rdtsc();

sys/platform/pc64/isa/clock.c

1610

delta = next - last;

sys/platform/pc64/isa/clock.c

1621

last = next;

sys/platform/pc64/isa/clock.c

179

.next = SLIST_ENTRY_INITIALIZER,

sys/platform/vkernel64/include/md_var.h

109

thread_t cpu_exit_switch (struct thread *next);

sys/platform/vkernel64/platform/systimer.c

115

.next = SLIST_ENTRY_INITIALIZER,

sys/platform/vkernel64/platform/systimer.c

91

.next = SLIST_ENTRY_INITIALIZER,

sys/sys/_malloc.h

62

struct kmalloc_slab *next; /* next mag in list */

sys/sys/devfs.h

344

struct devfs_unit_hash *next;

sys/sys/device.h

314

struct dev_ops_link *next;

sys/sys/mutex.h

56

struct mtx_link *next;

sys/sys/pipe.h

95

struct pipe *next;

sys/sys/systimer.h

121

SLIST_ENTRY(cputimer) next;

sys/sys/systimer.h

215

SLIST_ENTRY(cputimer_intr) next;

sys/vfs/hammer/hammer.h

775

int next; /* next unallocated flg seqno */

sys/vfs/hammer/hammer_blockmap.c

730

resv->flg_no = hmp->flusher.next + 1;

sys/vfs/hammer/hammer_blockmap.c

736

resv->flg_no = hmp->flusher.next + 1;

sys/vfs/hammer/hammer_flusher.c

120

seq = hmp->flusher.next;

sys/vfs/hammer/hammer_flusher.c

121

++hmp->flusher.next;

sys/vfs/hammer/hammer_flusher.c

178

int seq = hmp->flusher.next - 1;

sys/vfs/hammer/hammer_flusher.c

201

hmp->flusher.next = 1;

sys/vfs/hammer/hammer_flusher.c

334

if (seq == hmp->flusher.next) {

sys/vfs/hammer/hammer_inode.c

1769

flg->seq = hmp->flusher.next++;

sys/vfs/hammer/hammer_inode.c

2909

hammer_record_t next;

sys/vfs/hammer/hammer_inode.c

2932

next = TAILQ_FIRST(&ip->target_list);

sys/vfs/hammer/hammer_inode.c

2933

while ((depend = next) != NULL) {

sys/vfs/hammer/hammer_inode.c

2934

next = TAILQ_NEXT(depend, target_entry);

sys/vfs/hammer/hammer_recover.c

1204

rte->next = rterm->term_list;

sys/vfs/hammer/hammer_recover.c

1287

rterm->term_list = rte->next;

sys/vfs/hammer/hammer_recover.c

138

struct hammer_rterm_entry *next;

sys/vfs/hammer/hammer_recover.c

734

rterm->term_list = rte->next;

sys/vfs/hammer2/hammer2.h

231

struct hammer2_reptrack *next;

sys/vfs/hammer2/hammer2.h

270

struct hammer2_io *next;

sys/vfs/hammer2/hammer2.h

691

struct hammer2_inode *next; /* inode tree */

sys/vfs/hammer2/hammer2_bulkfree.c

1025

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1027

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1067

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1077

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1103

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1123

goto next;

sys/vfs/hammer2/hammer2_bulkfree.c

1133

next:

sys/vfs/hammer2/hammer2_chain.c

2245

reptrack.next = parent->core.reptrack;

sys/vfs/hammer2/hammer2_chain.c

2285

repp = &(*repp)->next;

sys/vfs/hammer2/hammer2_chain.c

2286

*repp = reptrack.next;

sys/vfs/hammer2/hammer2_chain.c

2325

chain->core.reptrack = reptrack->next;

sys/vfs/hammer2/hammer2_chain.c

2327

reptrack->next = parent->core.reptrack;

sys/vfs/hammer2/hammer2_inode.c

560

for (ip = hash->base; ip; ip = ip->next) {

sys/vfs/hammer2/hammer2_inode.c

625

xipp = &(*xipp)->next;

sys/vfs/hammer2/hammer2_inode.c

626

*xipp = ip->next;

sys/vfs/hammer2/hammer2_inode.c

627

ip->next = NULL;

sys/vfs/hammer2/hammer2_inode.c

963

xipp = &xip->next)

sys/vfs/hammer2/hammer2_inode.c

972

nip->next = NULL;

sys/vfs/hammer2/hammer2_io.c

811

for (dio = hash->base; dio; dio = dio->next) {

sys/vfs/hammer2/hammer2_io.c

841

for (xiop = &hash->base; (xio = *xiop) != NULL; xiop = &xio->next) {

sys/vfs/hammer2/hammer2_io.c

850

dio->next = NULL;

sys/vfs/hammer2/hammer2_io.c

889

diop = &dio->next;

sys/vfs/hammer2/hammer2_io.c

899

diop = &dio->next;

sys/vfs/hammer2/hammer2_io.c

903

*diop = dio->next;

sys/vfs/hammer2/hammer2_io.c

904

dio->next = NULL;

sys/vfs/hammer2/hammer2_io.c

906

cleanapp = &dio->next;

sys/vfs/hammer2/hammer2_io.c

919

cleanbase = dio->next;

sys/vfs/hammer2/hammer2_io.c

920

dio->next = NULL;

sys/vfs/hammer2/hammer2_io.c

948

hash->base = dio->next;

sys/vfs/hammer2/hammer2_io.c

949

dio->next = NULL;

sys/vfs/hammer2/hammer2_synchro.c

216

list.base = defer->next;

sys/vfs/hammer2/hammer2_synchro.c

233

list.base = defer->next;

sys/vfs/hammer2/hammer2_synchro.c

53

struct hammer2_deferred_ip *next;

sys/vfs/hammer2/hammer2_synchro.c

610

defer->next = list->base;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

131

state->lencode = state->distcode = state->next = state->codes;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

256

static code *next;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

264

next = fixed;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

265

lenfix = next;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

267

inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

272

distfix = next;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

274

inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

413

next = strm->next_in; \

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

424

strm->next_in = next; \

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

443

hold += (unsigned long)(*next++) << bits; \

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

559

z_const unsigned char FAR *next; /* next input */

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

690

zmemcpy(put, next, copy);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

692

next += copy;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

727

state->next = state->codes;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

728

state->lencode = (const code FAR *)(state->next);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

730

ret = inflate_table(CODES, state->lens, 19, &(state->next),

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

801

state->next = state->codes;

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

802

state->lencode = (const code FAR *)(state->next);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

804

ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

811

state->distcode = (const code FAR *)(state->next);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c

814

&(state->next), &(state->distbits), state->work);

sys/vfs/hammer2/zlib/hammer2_zlib_inflate.h

106

code FAR *next; /* next available space in codes[] */

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

201

next = *table; /* current table to fill in */

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

236

next[(huff >> drop) + fill] = here;

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

264

next += min; /* here min is 1 << curr */

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

286

(*table)[low].val = (unsigned short)(next - *table);

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

297

next[huff] = here;

sys/vfs/hammer2/zlib/hammer2_zlib_inftrees.c

52

code FAR *next; /* next available space in table */

sys/vfs/nfs/bootp_subr.c

109

struct bootpc_ifcontext *next;

sys/vfs/nfs/bootp_subr.c

1567

gctx->lastinterface->next = ifctx;

sys/vfs/nfs/bootp_subr.c

1591

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next)

sys/vfs/nfs/bootp_subr.c

1594

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next)

sys/vfs/nfs/bootp_subr.c

1612

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next)

sys/vfs/nfs/bootp_subr.c

1623

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

1629

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next)

sys/vfs/nfs/bootp_subr.c

1635

ifctx = ifctx->next)

sys/vfs/nfs/bootp_subr.c

1681

nctx = ifctx->next;

sys/vfs/nfs/bootp_subr.c

670

ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

680

ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

812

ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

837

ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

913

ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

937

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next) {

sys/vfs/nfs/bootp_subr.c

953

for (ifctx = gctx->interfaces; ifctx != NULL; ifctx = ifctx->next) {

sys/vfs/smbfs/smbfs_smb.c

1056

u_int32_t size, next, dattr;

sys/vfs/smbfs/smbfs_smb.c

1073

next = 0;

sys/vfs/smbfs/smbfs_smb.c

1091

recsz = next = 24 + nmlen; /* docs misses zero byte at end */

sys/vfs/smbfs/smbfs_smb.c

1094

md_get_uint32le(mbp, &next);

sys/vfs/smbfs/smbfs_smb.c

1110

recsz = next ? next : fxsz + size;

sys/vfs/smbfs/smbfs_smb.c

1121

if (next) {

sys/vfs/smbfs/smbfs_smb.c

1122

cnt = next - nmlen - fxsz;

sys/vfs/smbfs/smbfs_smb.c

1135

next = ctx->f_eofs + recsz;

sys/vfs/smbfs/smbfs_smb.c

1137

(ctx->f_rnameofs >= ctx->f_eofs && ctx->f_rnameofs < next)) {

sys/vfs/smbfs/smbfs_smb.c

1152

ctx->f_eofs = next;

sys/vfs/ufs/ffs_softdep.c

2967

struct worklist *next;

sys/vfs/ufs/ffs_softdep.c

2969

next = LIST_NEXT(marker, wk_list);

sys/vfs/ufs/ffs_softdep.c

2971

return next;

sys/vfs/ufs/ffs_softdep.c

4785

static int next = 0;

sys/vfs/ufs/ffs_softdep.c

4793

pagedephd = &pagedep_hashtbl[next++];

sys/vfs/ufs/ffs_softdep.c

4794

if (next >= pagedep_hash)

sys/vfs/ufs/ffs_softdep.c

4795

next = 0;

sys/vfs/ufs/ffs_softdep.c

4843

static int next = 0;

sys/vfs/ufs/ffs_softdep.c

4857

inodedephd = &inodedep_hashtbl[next++];

sys/vfs/ufs/ffs_softdep.c

4858

if (next >= inodedep_hash)

sys/vfs/ufs/ffs_softdep.c

4859

next = 0;

sys/vm/vm_fault.c

1989

goto next;

sys/vm/vm_fault.c

2201

goto next;

sys/vm/vm_fault.c

2290

next:

sys/vm/vm_map.c

1103

vm_map_backing_t next;

sys/vm/vm_map.c

1110

next = ba->backing_ba;

sys/vm/vm_map.c

1112

ba = next;

sys/vm/vm_map.c

1257

vm_map_entry_t next;

sys/vm/vm_map.c

1292

next = vm_map_rb_tree_RB_NEXT(prev_entry);

sys/vm/vm_map.c

1294

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

1295

if (next && next->ba.start < end)

sys/vm/vm_map.c

1715

vm_map_entry_t next, prev;

sys/vm/vm_map.c

1756

next = vm_map_rb_tree_RB_NEXT(entry);

sys/vm/vm_map.c

1757

if (next) {

sys/vm/vm_map.c

1759

if ((entry->ba.end == next->ba.start) &&

sys/vm/vm_map.c

1760

(next->maptype == entry->maptype) &&

sys/vm/vm_map.c

1761

(next->ba.object == entry->ba.object) &&

sys/vm/vm_map.c

1762

(next->ba.backing_ba == entry->ba.backing_ba) &&

sys/vm/vm_map.c

1764

(entry->ba.offset + esize == next->ba.offset)) &&

sys/vm/vm_map.c

1765

(next->eflags == entry->eflags) &&

sys/vm/vm_map.c

1766

(next->protection == entry->protection) &&

sys/vm/vm_map.c

1767

(next->max_protection == entry->max_protection) &&

sys/vm/vm_map.c

1768

(next->inheritance == entry->inheritance) &&

sys/vm/vm_map.c

1769

(next->id == entry->id) &&

sys/vm/vm_map.c

1770

(next->wired_count == entry->wired_count)) {

sys/vm/vm_map.c

1776

vm_map_entry_unlink(map, next);

sys/vm/vm_map.c

1777

vm_map_backing_adjust_end(entry, next->ba.end);

sys/vm/vm_map.c

1778

vm_map_entry_dispose(map, next, countp);

sys/vm/vm_map.c

1977

vm_map_entry_t next;

sys/vm/vm_map.c

2016

next = vm_map_rb_tree_RB_NEXT(entry);

sys/vm/vm_map.c

2017

if (next == NULL || next->ba.start >= end)

sys/vm/vm_map.c

2020

if (next->ba.start > entry->ba.end) {

sys/vm/vm_map.c

2027

if (next->eflags & MAP_ENTRY_IN_TRANSITION) {

sys/vm/vm_map.c

2029

next->eflags |= MAP_ENTRY_NEEDS_WAKEUP;

sys/vm/vm_map.c

2046

vm_map_clip_end(map, next, end, countp);

sys/vm/vm_map.c

2047

next->eflags |= MAP_ENTRY_IN_TRANSITION;

sys/vm/vm_map.c

2048

entry = next;

sys/vm/vm_map.c

3001

vm_map_entry_t next;

sys/vm/vm_map.c

3026

next = vm_map_rb_tree_RB_NEXT(current);

sys/vm/vm_map.c

3028

(next == NULL ||

sys/vm/vm_map.c

3029

current->ba.end != next->ba.start)) {

sys/vm/vm_map.c

3034

current = next;

sys/vm/vm_map.c

3270

vm_map_entry_t next;

sys/vm/vm_map.c

3294

next = vm_map_rb_tree_RB_NEXT(entry);

sys/vm/vm_map.c

3379

entry = next;

sys/vm/vm_map.c

3981

vm_map_entry_t next;

sys/vm/vm_map.c

4038

next = vm_map_rb_tree_RB_NEXT(prev_entry);

sys/vm/vm_map.c

4040

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4042

if (next && next->ba.start < *addrbos + max_ssize) {

sys/vm/vm_map.c

4069

next = vm_map_rb_tree_RB_NEXT(prev_entry);

sys/vm/vm_map.c

4071

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4078

if (next->ba.end != *addrbos + max_ssize ||

sys/vm/vm_map.c

4079

next->ba.start != *addrbos + max_ssize - init_ssize){

sys/vm/vm_map.c

4082

next->aux.avail_ssize = max_ssize - init_ssize;

sys/vm/vm_map.c

4105

vm_map_entry_t next;

sys/vm/vm_map.c

4257

next = vm_map_rb_tree_RB_NEXT(prev_entry);

sys/vm/vm_map.c

4259

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4261

if (next->ba.end != stack_entry->ba.start ||

sys/vm/vm_map.c

4262

next->ba.start != addr) {

sys/vm/vm_map.c

4265

next->aux.avail_ssize =

sys/vm/vm_map.c

4267

(next->ba.end - next->ba.start);

sys/vm/vm_map.c

4269

vm->vm_ssize += next->ba.end -

sys/vm/vm_map.c

4270

next->ba.start;

sys/vm/vm_map.c

4276

next->ba.start,

sys/vm/vm_map.c

4277

next->ba.end,

sys/vm/vm_map.c

4710

for (scan = map->ilock_base; scan; scan = scan->next) {

sys/vm/vm_map.c

4717

ilock->next = map->ilock_base;

sys/vm/vm_map.c

4732

*scanp = ilock->next;

sys/vm/vm_map.c

4738

scanp = &scan->next;

sys/vm/vm_map.h

301

struct vm_map_ilock *next;

sys/vm/vm_object.h

244

struct vm_object_dealloc_list *next;

sys/vm/vm_page.c

1882

vm_page_t next;

sys/vm/vm_page.c

1884

next = vm_page_rb_tree_RB_NEXT(m);

sys/vm/vm_page.c

1885

if (next && next->pindex != m->pindex + 1)

sys/vm/vm_page.c

1886

next = NULL;

sys/vm/vm_page.c

1887

return (next);

sys/vm/vm_pageout.c

1496

goto next;

sys/vm/vm_pageout.c

1505

goto next;

sys/vm/vm_pageout.c

1526

goto next;

sys/vm/vm_pageout.c

1637

next:

sys/vm/vm_pageout.c

2058

goto next;

sys/vm/vm_pageout.c

2070

goto next;

sys/vm/vm_pageout.c

2099

goto next;

sys/vm/vm_pageout.c

2136

next:

test/crypto/cryptoapi/cryptoapi_test.c

29

struct test_fixture *next;

test/crypto/cryptoapi/cryptoapi_test.c

331

fixture->next = NULL;

test/crypto/cryptoapi/cryptoapi_test.c

335

prev->next = fixture;

test/crypto/cryptoapi/cryptoapi_test.c

422

fixture = fixture->next) {

test/crypto/cryptoapi/cryptoapi_test.c

491

struct test_fixture *next = fixtures->next;

test/crypto/cryptoapi/cryptoapi_test.c

493

fixtures = next;

test/debug/crc32hw.c

100

next += 8;

test/debug/crc32hw.c

104

crc = crc32c_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);

test/debug/crc32hw.c

228

const unsigned char *next = buf;

test/debug/crc32hw.c

240

while (len && ((uintptr_t)next & 7) != 0) {

test/debug/crc32hw.c

243

: "r"(next), "0"(crc0));

test/debug/crc32hw.c

244

next++;

test/debug/crc32hw.c

255

end = next + LONG;

test/debug/crc32hw.c

261

: "r"(next), "0"(crc0), "1"(crc1), "2"(crc2));

test/debug/crc32hw.c

262

next += 8;

test/debug/crc32hw.c

263

} while (next < end);

test/debug/crc32hw.c

266

next += LONG*2;

test/debug/crc32hw.c

275

end = next + SHORT;

test/debug/crc32hw.c

281

: "r"(next), "0"(crc0), "1"(crc1), "2"(crc2));

test/debug/crc32hw.c

282

next += 8;

test/debug/crc32hw.c

283

} while (next < end);

test/debug/crc32hw.c

286

next += SHORT*2;

test/debug/crc32hw.c

292

end = next + (len - (len & 7));

test/debug/crc32hw.c

293

while (next < end) {

test/debug/crc32hw.c

296

: "r"(next), "0"(crc0));

test/debug/crc32hw.c

297

next += 8;

test/debug/crc32hw.c

305

: "r"(next), "0"(crc0));

test/debug/crc32hw.c

306

next++;

test/debug/crc32hw.c

80

const unsigned char *next = buf;

test/debug/crc32hw.c

86

while (len && ((uintptr_t)next & 7) != 0) {

test/debug/crc32hw.c

87

crc = crc32c_table[0][(crc ^ *next++) & 0xff] ^ (crc >> 8);

test/debug/crc32hw.c

91

crc ^= *(uint64_t *)next;

test/debug/vmpagehash.c

339

struct SLTrack *next;

test/debug/vmpagehash.c

362

for (slt = SLHash[i]; slt; slt = slt->next) {

test/debug/vmpagehash.c

369

slt->next = SLHash[i];

test/debug/vmpageinfo.c

527

struct SLTrack *next;

test/debug/vmpageinfo.c

550

for (slt = SLHash[i]; slt; slt = slt->next) {

test/debug/vmpageinfo.c

557

slt->next = SLHash[i];

test/debug/vmpageinfo.c

573

for (slt = SLHash[i]; slt; slt = slt->next) {

test/debug/vmpageinfo.c

601

struct dup_entry *next;

test/debug/vmpageinfo.c

615

for (hen = dup_hash[hv]; hen; hen = hen->next) {

test/debug/vmpageinfo.c

620

hen->next = dup_hash[hv];

test/debug/vmpqinactive.c

559

struct SLTrack *next;

test/debug/vmpqinactive.c

582

for (slt = SLHash[i]; slt; slt = slt->next) {

test/debug/vmpqinactive.c

589

slt->next = SLHash[i];

test/debug/vmpqinactive.c

605

for (slt = SLHash[i]; slt; slt = slt->next) {

test/debug/vmpqinactive.c

633

struct dup_entry *next;

test/debug/vmpqinactive.c

647

for (hen = dup_hash[hv]; hen; hen = hen->next) {

test/debug/vmpqinactive.c

652

hen->next = dup_hash[hv];

tools/regression/lib/libm/test-next.c

102

#define stest(next, eps, prec) \

tools/regression/lib/libm/test-next.c

103

test##prec(next(-0.0, 42.0), eps, ex_under); \

tools/regression/lib/libm/test-next.c

104

test##prec(next(0.0, -42.0), -eps, ex_under); \

tools/regression/lib/libm/test-next.c

105

test##prec(next(0.0, INFINITY), eps, ex_under); \

tools/regression/lib/libm/test-next.c

106

test##prec(next(-0.0, -INFINITY), -eps, ex_under)

tools/tools/drm/radeon/mkregtable/mkregtable.c

109

static inline void __list_del(struct list_head *prev, struct list_head *next)

tools/tools/drm/radeon/mkregtable/mkregtable.c

111

next->prev = prev;

tools/tools/drm/radeon/mkregtable/mkregtable.c

112

prev->next = next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

124

__list_del(entry->prev, entry->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

125

entry->next = (void *)0xDEADBEEF;

tools/tools/drm/radeon/mkregtable/mkregtable.c

141

new->next = old->next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

142

new->next->prev = new;

tools/tools/drm/radeon/mkregtable/mkregtable.c

144

new->prev->next = new;

tools/tools/drm/radeon/mkregtable/mkregtable.c

160

__list_del(entry->prev, entry->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

171

__list_del(list->prev, list->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

183

__list_del(list->prev, list->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

195

return list->next == head;

tools/tools/drm/radeon/mkregtable/mkregtable.c

204

return head->next == head;

tools/tools/drm/radeon/mkregtable/mkregtable.c

222

struct list_head *next = head->next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

223

return (next == head) && (next == head->prev);

tools/tools/drm/radeon/mkregtable/mkregtable.c

232

return !list_empty(head) && (head->next == head->prev);

tools/tools/drm/radeon/mkregtable/mkregtable.c

239

struct list_head *new_first = entry->next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

240

list->next = head->next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

241

list->next->prev = list;

tools/tools/drm/radeon/mkregtable/mkregtable.c

243

entry->next = list;

tools/tools/drm/radeon/mkregtable/mkregtable.c

244

head->next = new_first;

tools/tools/drm/radeon/mkregtable/mkregtable.c

268

if (list_is_singular(head) && (head->next != entry && head != entry))

tools/tools/drm/radeon/mkregtable/mkregtable.c

277

struct list_head *prev, struct list_head *next)

tools/tools/drm/radeon/mkregtable/mkregtable.c

279

struct list_head *first = list->next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

283

prev->next = first;

tools/tools/drm/radeon/mkregtable/mkregtable.c

285

last->next = next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

286

next->prev = last;

tools/tools/drm/radeon/mkregtable/mkregtable.c

298

__list_splice(list, head, head->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

324

__list_splice(list, head, head->next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

364

list_entry((ptr)->next, type, member)

tools/tools/drm/radeon/mkregtable/mkregtable.c

372

for (pos = (head)->next; prefetch(pos->next), pos != (head); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

373

pos = pos->next)

tools/tools/drm/radeon/mkregtable/mkregtable.c

391

for (pos = (head)->next, n = pos->next; pos != (head); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

392

pos = n, n = pos->next)

tools/tools/drm/radeon/mkregtable/mkregtable.c

412

for (pos = list_entry((head)->next, typeof(*pos), member); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

414

pos = list_entry(pos->member.next, typeof(*pos), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

42

struct list_head *next, *prev;

tools/tools/drm/radeon/mkregtable/mkregtable.c

448

for (pos = list_entry(pos->member.next, typeof(*pos), member); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

449

prefetch(pos->member.next), &pos->member != (head); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

450

pos = list_entry(pos->member.next, typeof(*pos), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

475

for (; prefetch(pos->member.next), &pos->member != (head); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

476

pos = list_entry(pos->member.next, typeof(*pos), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

486

for (pos = list_entry((head)->next, typeof(*pos), member), \

tools/tools/drm/radeon/mkregtable/mkregtable.c

487

n = list_entry(pos->member.next, typeof(*pos), member); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

489

pos = n, n = list_entry(n->member.next, typeof(*n), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

502

for (pos = list_entry(pos->member.next, typeof(*pos), member), \

tools/tools/drm/radeon/mkregtable/mkregtable.c

503

n = list_entry(pos->member.next, typeof(*pos), member); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

505

pos = n, n = list_entry(n->member.next, typeof(*n), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

518

for (n = list_entry(pos->member.next, typeof(*pos), member); \

tools/tools/drm/radeon/mkregtable/mkregtable.c

52

list->next = list;

tools/tools/drm/radeon/mkregtable/mkregtable.c

520

pos = n, n = list_entry(n->member.next, typeof(*n), member))

tools/tools/drm/radeon/mkregtable/mkregtable.c

64

struct list_head *prev, struct list_head *next)

tools/tools/drm/radeon/mkregtable/mkregtable.c

66

next->prev = new;

tools/tools/drm/radeon/mkregtable/mkregtable.c

67

new->next = next;

tools/tools/drm/radeon/mkregtable/mkregtable.c

69

prev->next = new;

tools/tools/drm/radeon/mkregtable/mkregtable.c

73

struct list_head *prev, struct list_head *next);

tools/tools/drm/radeon/mkregtable/mkregtable.c

86

__list_add(new, head, head->next);

tools/tools/net80211/stumbler/stumbler.c

105

next = nodes->next;

tools/tools/net80211/stumbler/stumbler.c

107

nodes = next;

tools/tools/net80211/stumbler/stumbler.c

227

node = node->next;

tools/tools/net80211/stumbler/stumbler.c

478

if (!node->next) {

tools/tools/net80211/stumbler/stumbler.c

479

node->next = (struct node_info*)

tools/tools/net80211/stumbler/stumbler.c

481

if (!node->next)

tools/tools/net80211/stumbler/stumbler.c

484

memset(node->next, 0, sizeof(*node->next));

tools/tools/net80211/stumbler/stumbler.c

485

memcpy(node->next->mac, data->mac, 6);

tools/tools/net80211/stumbler/stumbler.c

486

node->next->prev = node;

tools/tools/net80211/stumbler/stumbler.c

487

node->next->pos = node->pos+1;

tools/tools/net80211/stumbler/stumbler.c

489

node = node->next;

tools/tools/net80211/stumbler/stumbler.c

495

node = node->next;

tools/tools/net80211/stumbler/stumbler.c

508

ni = ni->next;

tools/tools/net80211/stumbler/stumbler.c

585

goto next;

tools/tools/net80211/stumbler/stumbler.c

595

goto next;

tools/tools/net80211/stumbler/stumbler.c

601

goto next;

tools/tools/net80211/stumbler/stumbler.c

611

goto next;

tools/tools/net80211/stumbler/stumbler.c

619

goto next;

tools/tools/net80211/stumbler/stumbler.c

622

goto next;

tools/tools/net80211/stumbler/stumbler.c

676

next:

tools/tools/net80211/stumbler/stumbler.c

93

struct node_info* next;

tools/tools/net80211/stumbler/stumbler.c

950

node = node->next;

tools/tools/net80211/stumbler/stumbler.c

97

struct node_info* next;

tools/tools/net80211/w00t/ap/ap.c

44

struct client *next;

tools/tools/net80211/w00t/ap/ap.c

574

c = c->next;

tools/tools/net80211/w00t/ap/ap.c

591

c->next = p->clients;

tools/tools/net80211/w00t/expand/expand.c

132

q = q->next;

tools/tools/net80211/w00t/expand/expand.c

147

last->next = q;

tools/tools/net80211/w00t/expand/expand.c

57

struct queue *next;

tools/tools/net80211/w00t/redir/redir.c

173

q = q->next;

tools/tools/net80211/w00t/redir/redir.c

188

last->next = q;

tools/tools/net80211/w00t/redir/redir.c

540

if (q->next) {

tools/tools/net80211/w00t/redir/redir.c

542

p->q = q->next;

tools/tools/net80211/w00t/redir/redir.c

545

if (!last->next) {

tools/tools/net80211/w00t/redir/redir.c

546

last->next = q;

tools/tools/net80211/w00t/redir/redir.c

547

q->next = NULL;

tools/tools/net80211/w00t/redir/redir.c

550

last = last->next;

tools/tools/net80211/w00t/redir/redir.c

59

struct queue *next;

tools/tools/net80211/wesside/wesside/wesside.c

2365

static unsigned char *next = buf;

tools/tools/net80211/wesside/wesside/wesside.c

2378

next = buf;

tools/tools/net80211/wesside/wesside/wesside.c

2382

pkt = get_80211(&next, &totlen, &plen);

tools/tools/net80211/wlanwds/wlanwds.c

276

p->next = wds;

tools/tools/net80211/wlanwds/wlanwds.c

375

for (p = wds; p != NULL; p = p->next)

tools/tools/net80211/wlanwds/wlanwds.c

400

p->next = wds;

tools/tools/net80211/wlanwds/wlanwds.c

421

for (pp = &wds; (p = *pp) != NULL; pp = &p->next)

tools/tools/net80211/wlanwds/wlanwds.c

425

*pp = p->next;

tools/tools/net80211/wlanwds/wlanwds.c

440

for (pp = &wds; (p = *pp) != NULL; pp = &p->next)

tools/tools/net80211/wlanwds/wlanwds.c

444

*pp = p->next;

tools/tools/net80211/wlanwds/wlanwds.c

75

struct wds *next;

tools/tools/netrate/pktgen/pktgen.c

423

struct mbuf *m, *head = NULL, **next;

tools/tools/netrate/pktgen/pktgen.c

447

next = &head;

tools/tools/netrate/pktgen/pktgen.c

450

*next = m;

tools/tools/netrate/pktgen/pktgen.c

451

next = &m->m_nextpkt;

usr.bin/calendar/dates.c

139

dp->events = e->next;

usr.bin/calendar/dates.c

201

e->next = dp->events;

usr.bin/calendar/dates.c

216

for (e = dp->events; e != NULL; e = e->next) {

usr.bin/calendar/dates.c

222

for (line = desc->firstline; line; line = line->next) {

usr.bin/calendar/dates.c

55

struct event *next;

usr.bin/calendar/io.c

365

for (line = desc->firstline; line; line = line->next)

usr.bin/calendar/io.c

574

desc->next = *head;

usr.bin/calendar/io.c

588

head = head->next;

usr.bin/calendar/io.c

590

desc->firstline = desc->firstline->next;

usr.bin/calendar/io.c

606

desc->lastline->next = cline;

usr.bin/calendar/io.h

40

struct cal_line *next;

usr.bin/calendar/io.h

45

struct cal_desc *next;

usr.bin/calendar/utils.c

147

struct node *next;

usr.bin/calendar/utils.c

171

newp->next = listp;

usr.bin/calendar/utils.c

184

for ( ; listp; listp = listp->next) {

usr.bin/calendar/utils.c

207

listp = listp->next;

usr.bin/crunch/crunchgen/crunchgen.c

1013

for (l = libs_int; l != NULL; l = l->next)

usr.bin/crunch/crunchgen/crunchgen.c

1015

for (p = progs; p != NULL; p = p->next) {

usr.bin/crunch/crunchgen/crunchgen.c

1017

for (l = p->libs_int; l != NULL; l = l->next)

usr.bin/crunch/crunchgen/crunchgen.c

1060

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

1065

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

1068

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

1076

for (l = intlibs; l != NULL; l = l->next)

usr.bin/crunch/crunchgen/crunchgen.c

1079

for (l = intlibs; l != NULL; l = l->next)

usr.bin/crunch/crunchgen/crunchgen.c

1124

for (lst = p->objs; lst != NULL; lst = lst->next)

usr.bin/crunch/crunchgen/crunchgen.c

1163

for (lst = p->libs_int; lst != NULL; lst = lst->next)

usr.bin/crunch/crunchgen/crunchgen.c

1196

for (lst = p->keeplist; lst != NULL; lst = lst->next)

usr.bin/crunch/crunchgen/crunchgen.c

1248

for (; lst != NULL; lst = lst->next)

usr.bin/crunch/crunchgen/crunchgen.c

1295

for (p1 = NULL, p2 = *listp; p2 != NULL; p1 = p2, p2 = p2->next)

usr.bin/crunch/crunchgen/crunchgen.c

1301

p2->next = NULL;

usr.bin/crunch/crunchgen/crunchgen.c

1310

p1->next = p2;

usr.bin/crunch/crunchgen/crunchgen.c

1319

for (p1 = *listb; p1 != NULL; p1 = p1->next)

usr.bin/crunch/crunchgen/crunchgen.c

1334

for (p1 = *listp; p1 != NULL; p1 = p1->next)

usr.bin/crunch/crunchgen/crunchgen.c

1347

head = head->next;

usr.bin/crunch/crunchgen/crunchgen.c

417

for (p1 = NULL, p2 = progs; p2 != NULL; p1 = p2, p2 = p2->next)

usr.bin/crunch/crunchgen/crunchgen.c

429

p2->next = NULL;

usr.bin/crunch/crunchgen/crunchgen.c

433

p1->next = p2;

usr.bin/crunch/crunchgen/crunchgen.c

57

struct strlst *next;

usr.bin/crunch/crunchgen/crunchgen.c

610

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

64

struct prog *next; /* link field */

usr.bin/crunch/crunchgen/crunchgen.c

647

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

771

for (s = p->buildopts; s != NULL; s = s->next)

usr.bin/crunch/crunchgen/crunchgen.c

825

p1 = p2, p2 = p2->next;

usr.bin/crunch/crunchgen/crunchgen.c

831

p1->next = p2->next;

usr.bin/crunch/crunchgen/crunchgen.c

833

progs = p2->next;

usr.bin/crunch/crunchgen/crunchgen.c

834

p2 = p2->next;

usr.bin/crunch/crunchgen/crunchgen.c

859

for (p = progs; p != NULL; p = p->next) {

usr.bin/crunch/crunchgen/crunchgen.c

907

for (l = intlibs; l != NULL; l = l->next)

usr.bin/crunch/crunchgen/crunchgen.c

911

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

945

for (p = progs; p != NULL; p = p->next)

usr.bin/crunch/crunchgen/crunchgen.c

949

for (p = progs; p != NULL; p = p->next) {

usr.bin/crunch/crunchgen/crunchgen.c

952

for (s = p->links; s != NULL; s = s->next)

usr.bin/crunch/crunchgen/crunchgen.c

993

for (dir = srcdirs; dir != NULL; dir = dir->next) {

usr.bin/crunch/crunchide/crunchide.c

133

struct keep *next;

usr.bin/crunch/crunchide/crunchide.c

145

for(curp = keep_list, prevp = NULL; curp; prevp = curp, curp = curp->next)

usr.bin/crunch/crunchide/crunchide.c

158

newp->next = curp;

usr.bin/crunch/crunchide/crunchide.c

159

if(prevp) prevp->next = newp;

usr.bin/crunch/crunchide/crunchide.c

171

for(curp = keep_list; curp; curp = curp->next)

usr.bin/diff/diff.c

324

entry->next = excludes_list;

usr.bin/diff/diff.h

81

struct excludes *next;

usr.bin/diff/diffdir.c

232

for (excl = excludes_list; excl != NULL; excl = excl->next)

usr.bin/dsynth/build.c

1781

pkg_t *spkg = pkg->idepon_list.next->pkg;

usr.bin/dsynth/build.c

2168

for (benv = BuildEnv; benv; benv = benv->next) {

usr.bin/dsynth/build.c

2948

stack.next = parent;

usr.bin/dsynth/bulk.c

116

BulkSubmit = bulk->next;

usr.bin/dsynth/bulk.c

141

BulkResponse = bulk->next;

usr.bin/dsynth/bulk.c

175

BulkSubmitTail = &bulk->next;

usr.bin/dsynth/bulk.c

204

BulkSubmit = bulk->next;

usr.bin/dsynth/bulk.c

231

BulkResponse = bulk->next;

usr.bin/dsynth/bulk.c

356

bulk->next = NULL;

usr.bin/dsynth/bulk.c

358

BulkResponseTail = &bulk->next;

usr.bin/dsynth/bulk.c

367

BulkSubmit = bulk->next;

usr.bin/dsynth/dsynth.h

120

struct pkglink *next;

usr.bin/dsynth/dsynth.h

198

#define PKGLIST_EMPTY(pkglink) ((pkglink)->next == (pkglink))

usr.bin/dsynth/dsynth.h

200

for (var = (head)->next; var != (head); var = (var)->next)

usr.bin/dsynth/dsynth.h

203

struct bulk *next;

usr.bin/dsynth/dsynth.h

366

struct buildenv *next;

usr.bin/dsynth/dsynth.h

490

struct runstats *next;

usr.bin/dsynth/pkglist.c

131

ddassert(scan->idepon_list.next == &scan->idepon_list);

usr.bin/dsynth/pkglist.c

132

ddassert(scan->deponi_list.next == &scan->deponi_list);

usr.bin/dsynth/pkglist.c

72

pkg->idepon_list.next = &pkg->idepon_list;

usr.bin/dsynth/pkglist.c

74

pkg->deponi_list.next = &pkg->deponi_list;

usr.bin/dsynth/pkglist.c

759

link->next = &pkg->idepon_list;

usr.bin/dsynth/pkglist.c

761

link->next->prev = link;

usr.bin/dsynth/pkglist.c

762

link->prev->next = link;

usr.bin/dsynth/pkglist.c

767

link->next = &dpkg->deponi_list;

usr.bin/dsynth/pkglist.c

769

link->next->prev = link;

usr.bin/dsynth/pkglist.c

770

link->prev->next = link;

usr.bin/dsynth/pkglist.c

870

link->next = &pkg->idepon_list;

usr.bin/dsynth/pkglist.c

872

link->next->prev = link;

usr.bin/dsynth/pkglist.c

873

link->prev->next = link;

usr.bin/dsynth/pkglist.c

878

link->next = &dpkg->deponi_list;

usr.bin/dsynth/pkglist.c

880

link->next->prev = link;

usr.bin/dsynth/pkglist.c

881

link->prev->next = link;

usr.bin/dsynth/repo.c

355

list = list->next;

usr.bin/dsynth/repo.c

41

struct pinfo *next;

usr.bin/dsynth/repo.c

576

*list_tailp = &item->next;

usr.bin/dsynth/runstats.c

172

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

181

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

190

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

200

for (rs = RSBase; rs; rs = rs->next) {

usr.bin/dsynth/runstats.c

55

RSTailp = &(*RSTailp)->next;

usr.bin/dsynth/runstats.c

58

RSTailp = &(*RSTailp)->next;

usr.bin/dsynth/runstats.c

61

RSTailp = &(*RSTailp)->next;

usr.bin/dsynth/runstats.c

63

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

72

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

81

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/runstats.c

90

for (rs = RSBase; rs; rs = rs->next)

usr.bin/dsynth/subs.c

267

BuildEnvTail = &env->next;

usr.bin/dsynth/subs.c

279

*envp = env->next;

usr.bin/dsynth/subs.c

286

envp = &env->next;

usr.bin/dsynth/subs.c

302

envp = &env->next;

usr.bin/dsynth/subs.c

41

struct logerrinfo *next;

usr.bin/dsynth/subs.c

499

for (benv = BuildEnv; benv; benv = benv->next) {

usr.bin/dsynth/subs.c

601

einfo->next = *einfohash(pid);

usr.bin/dsynth/subs.c

637

einfop = &einfo->next;

usr.bin/dsynth/subs.c

699

einfo = einfo->next;

usr.bin/dsynth/subs.c

707

*einfop = einfo->next;

usr.bin/dsynth/subs.c

712

einfop = &einfo->next;

usr.bin/dsynth/subs.c

749

einfo = einfo->next;

usr.bin/du/du.c

317

struct links_entry *next;

usr.bin/du/du.c

356

free_list = le->next;

usr.bin/du/du.c

371

buckets[i] = le->next;

usr.bin/du/du.c

378

le->next = new_buckets[hash];

usr.bin/du/du.c

391

for (le = buckets[hash]; le != NULL; le = le->next) {

usr.bin/du/du.c

399

le->previous->next = le->next;

usr.bin/du/du.c

400

if (le->next != NULL)

usr.bin/du/du.c

401

le->next->previous = le->previous;

usr.bin/du/du.c

403

buckets[hash] = le->next;

usr.bin/du/du.c

409

le->next = free_list;

usr.bin/du/du.c

424

free_list = le->next;

usr.bin/du/du.c

437

le->next = buckets[hash];

usr.bin/du/du.c

477

SLIST_INSERT_HEAD(&ignores, ign, next);

usr.bin/du/du.c

487

SLIST_REMOVE_HEAD(&ignores, next);

usr.bin/du/du.c

498

SLIST_FOREACH(ign, &ignores, next)

usr.bin/du/du.c

60

SLIST_ENTRY(ignentry) next;

usr.bin/evtranalyze/evtranalyze.c

118

struct hashentry *next;

usr.bin/evtranalyze/evtranalyze.c

134

ent = ent->next);

usr.bin/evtranalyze/evtranalyze.c

153

ent->next = tab->buckets[hsh];

usr.bin/evtranalyze/evtranalyze.c

168

prev = ent, ent = ent->next);

usr.bin/evtranalyze/evtranalyze.c

172

prev->next = ent->next;

usr.bin/evtranalyze/evtranalyze.c

174

tab->buckets[tab->hashfunc(key)] = ent->next;

usr.bin/evtranalyze/xml.c

114

STAILQ_FOREACH(at, &el->attributes, next) {

usr.bin/evtranalyze/xml.h

42

STAILQ_ENTRY(xml_attribute) next;

usr.bin/evtranalyze/xml.h

94

STAILQ_INSERT_TAIL(&el->attributes, at, next);

usr.bin/find/find.c

100

tail->next = new;

usr.bin/find/find.c

121

new->next = plan;

usr.bin/find/find.c

125

tail->next = new;

usr.bin/find/find.c

129

tail->next = new;

usr.bin/find/find.c

229

for (p = plan; p && (p->execute)(p, entry); p = p->next);

usr.bin/find/find.h

78

struct _plandata *next; /* next node */

usr.bin/find/function.c

1618

p && (state = (p->execute)(p, entry)); p = p->next);

usr.bin/find/function.c

1665

p && (state = (p->execute)(p, entry)); p = p->next);

usr.bin/find/function.c

1684

p && (state = (p->execute)(p, entry)); p = p->next);

usr.bin/find/function.c

1690

p && (state = (p->execute)(p, entry)); p = p->next);

usr.bin/find/function.c

91

new->next = NULL;

usr.bin/find/operator.c

107

tail = subplan = next;

usr.bin/find/operator.c

109

tail->next = next;

usr.bin/find/operator.c

110

tail = next;

usr.bin/find/operator.c

112

tail->next = NULL;

usr.bin/find/operator.c

147

tail->next = expr;

usr.bin/find/operator.c

150

tail->next = NULL;

usr.bin/find/operator.c

162

PLAN *next; /* next node being processed */

usr.bin/find/operator.c

169

while ((next = yanknode(&plan))) {

usr.bin/find/operator.c

174

if (next->execute == f_expr)

usr.bin/find/operator.c

175

next->p_data[0] = not_squish(next->p_data[0]);

usr.bin/find/operator.c

182

if (next->execute == f_not) {

usr.bin/find/operator.c

201

next = node;

usr.bin/find/operator.c

203

next->p_data[0] = node;

usr.bin/find/operator.c

208

tail = result = next;

usr.bin/find/operator.c

210

tail->next = next;

usr.bin/find/operator.c

211

tail = next;

usr.bin/find/operator.c

213

tail->next = NULL;

usr.bin/find/operator.c

225

PLAN *next; /* next node being processed */

usr.bin/find/operator.c

229

tail = result = next = NULL;

usr.bin/find/operator.c

231

while ((next = yanknode(&plan)) != NULL) {

usr.bin/find/operator.c

236

if (next->execute == f_expr)

usr.bin/find/operator.c

237

next->p_data[0] = or_squish(next->p_data[0]);

usr.bin/find/operator.c

240

if (next->execute == f_not)

usr.bin/find/operator.c

241

next->p_data[0] = or_squish(next->p_data[0]);

usr.bin/find/operator.c

248

if (next->execute == f_or) {

usr.bin/find/operator.c

251

next->p_data[0] = result;

usr.bin/find/operator.c

252

next->p_data[1] = or_squish(plan);

usr.bin/find/operator.c

253

if (next->p_data[1] == NULL)

usr.bin/find/operator.c

255

return (next);

usr.bin/find/operator.c

260

tail = result = next;

usr.bin/find/operator.c

262

tail->next = next;

usr.bin/find/operator.c

263

tail = next;

usr.bin/find/operator.c

265

tail->next = NULL;

usr.bin/find/operator.c

59

(*planp) = (*planp)->next;

usr.bin/find/operator.c

60

node->next = NULL;

usr.bin/find/operator.c

73

PLAN *next; /* temp node holding subexpression results */

usr.bin/find/operator.c

90

if ((next = yankexpr(planp)) == NULL)

usr.bin/find/operator.c

99

if (next->execute == f_closeparen) {

usr.bin/finger/finger.c

223

for (; ep; ep = ep->next) {

usr.bin/finger/finger.c

358

for (; ep; ep = ep->next) {

usr.bin/finger/finger.h

56

struct where *next; /* next place user is or has been */

usr.bin/finger/lprint.c

164

for (w = pn->whead, maxlen = -1; w != NULL; w = w->next)

usr.bin/finger/lprint.c

168

for (w = pn->whead; w != NULL; w = w->next) {

usr.bin/finger/sprint.c

94

for (w = pn->whead; w != NULL; w = w->next) {

usr.bin/finger/util.c

112

for (; !doit && w != NULL; w = w->next)

usr.bin/finger/util.c

121

for (w = pn->whead; doit && w != NULL; w = w->next)

usr.bin/finger/util.c

228

pn->wtail->next = w;

usr.bin/finger/util.c

231

w->next = NULL;

usr.bin/flame_graph/process.c

110

scanp = &scan->next;

usr.bin/flame_graph/process.c

129

for (elm = elm_hash_array[i]; elm; elm = elm->next) {

usr.bin/flame_graph/process.c

38

struct elm *next;

usr.bin/fstat/fstat.c

1031

cur->next = devs;

usr.bin/fstat/fstat.c

553

for (d = devs; d != NULL; d = d->next)

usr.bin/fstat/fstat.c

710

struct mtab *next;

usr.bin/fstat/fstat.c

785

for (mt = mhead; mt != NULL; mt = mt->next) {

usr.bin/fstat/fstat.c

797

mt->next = mhead;

usr.bin/fstat/fstat.h

38

struct devs *next;

usr.bin/fstat/msdosfs.c

65

struct dosmount *next;

usr.bin/fstat/msdosfs.c

89

for (mnt = mounts; mnt; mnt = mnt->next)

usr.bin/fstat/msdosfs.c

96

mnt->next = mounts;

usr.bin/gcore/elfcore.c

362

vm_map_entry_t next = map->rb_entry.rbe_parent;

usr.bin/gcore/elfcore.c

364

map = next;

usr.bin/hexdump/display.c

251

if (!length || (ateof && !next(NULL))) {

usr.bin/hexdump/hexdump.c

70

(void)next(argv);

usr.bin/hexdump/hexdump.h

94

int next(char **);

usr.bin/killall/killall.c

468

chain->next = phash[hv];

usr.bin/killall/killall.c

479

for (chain = phash[hv]; chain; chain = chain->next) {

usr.bin/killall/killall.c

484

for (pchain = phash[hv]; pchain; pchain = pchain->next) {

usr.bin/killall/killall.c

50

struct pchain *next;

usr.bin/last/last.c

212

cur->next = arglist;

usr.bin/last/last.c

229

cur->next = ttylist;

usr.bin/last/last.c

355

for (T = ttylist; T; T = T->next)

usr.bin/last/last.c

402

for (T = ttylist;; T = T->next) {

usr.bin/last/last.c

478

for (step = arglist; step; step = step->next)

usr.bin/last/last.c

81

struct arg *next; /* linked list pointer */

usr.bin/last/last.c

88

struct ttytab *next; /* linked list pointer */

usr.bin/m4/gnum4.c

132

for (pe = first; pe; pe = pe->next) {

usr.bin/m4/gnum4.c

64

struct path_entry *next;

usr.bin/m4/gnum4.c

82

n->next = NULL;

usr.bin/m4/gnum4.c

94

last->next = n;

usr.bin/m4/look.c

163

n->d->next = NULL;

usr.bin/m4/look.c

176

d->next = n->d;

usr.bin/m4/look.c

189

r2 = r->next;

usr.bin/m4/look.c

206

n->d = r->next;

usr.bin/m4/look.c

244

n->d->next = NULL;

usr.bin/m4/manual_tokenizer.c

1825

char *next;

usr.bin/m4/manual_tokenizer.c

1830

base = strtol(yytext + 2, &next, 0);

usr.bin/m4/manual_tokenizer.c

1831

if (base > 36 || next == NULL) {

usr.bin/m4/manual_tokenizer.c

1834

next++;

usr.bin/m4/manual_tokenizer.c

1835

while (*next != 0) {

usr.bin/m4/manual_tokenizer.c

1836

if (*next >= '0' && *next <= '9')

usr.bin/m4/manual_tokenizer.c

1837

d = *next - '0';

usr.bin/m4/manual_tokenizer.c

1838

else if (*next >= 'a' && *next <= 'z')

usr.bin/m4/manual_tokenizer.c

1839

d = *next - 'a' + 10;

usr.bin/m4/manual_tokenizer.c

1841

assert(*next >= 'A' && *next <= 'Z');

usr.bin/m4/manual_tokenizer.c

1842

d = *next - 'A' + 10;

usr.bin/m4/manual_tokenizer.c

1850

next++;

usr.bin/m4/mdef.h

134

struct macro_definition *next;

usr.bin/mail/cmdtab.c

47

{ "next", next, NDMLIST, 0, MMNDEL },

usr.bin/mail/extern.h

176

int next(int *);

usr.bin/msgs/msgs.c

142

int next(char *);

usr.bin/msgs/msgs.c

553

msg = next(in);

usr.bin/netstat/mroute6.c

167

rtep = rte.next;

usr.bin/netstat/netgraph.c

129

for (; this != NULL; this = next) {

usr.bin/netstat/netgraph.c

137

next = LIST_NEXT(&ngpcb, socks);

usr.bin/netstat/netgraph.c

69

struct ngpcb *this, *next;

usr.bin/netstat/route.c

521

char *buf, *next, *lim;

usr.bin/netstat/route.c

547

for (next = buf; next < lim; next += rtm->rtm_msglen) {

usr.bin/netstat/route.c

548

rtm = (struct rt_msghdr *)next;

usr.bin/paste/paste.c

111

struct _list *next;

usr.bin/paste/paste.c

135

lp->next = NULL;

usr.bin/paste/paste.c

141

tmp->next = lp;

usr.bin/paste/paste.c

147

for (output = 0, lp = head; lp; lp = lp->next) {

usr.bin/quota/quota.c

301

for (qup = quplist; qup; qup = qup->next) {

usr.bin/quota/quota.c

476

quptail->next = qup;

usr.bin/quota/quota.c

478

quptail->next = NULL;

usr.bin/quota/quota.c

69

struct quotause *next;

usr.bin/rpcgen/rpc_clntout.c

135

for (l = proc->args.decls; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_clntout.c

211

for (l = proc->args.decls; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_clntout.c

61

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_clntout.c

74

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_clntout.c

75

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_cout.c

289

for (vlist = def->def.pr.versions; vlist != NULL; vlist = vlist->next)

usr.bin/rpcgen/rpc_cout.c

290

for (plist = vlist->procs; plist != NULL; plist = plist->next) {

usr.bin/rpcgen/rpc_cout.c

295

dl = dl->next)

usr.bin/rpcgen/rpc_cout.c

314

for (cl = def->def.un.cases; cl != NULL; cl = cl->next) {

usr.bin/rpcgen/rpc_cout.c

388

for (dl = def->def.st.decls; dl != NULL; dl = dl->next) { /* xxx */

usr.bin/rpcgen/rpc_cout.c

436

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

463

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

471

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

490

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

512

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

519

cur = cur->next;

usr.bin/rpcgen/rpc_cout.c

536

for (dl = def->def.st.decls; dl != NULL; dl = dl->next)

usr.bin/rpcgen/rpc_cout.c

541

for (dl = def->def.st.decls; dl != NULL; dl = dl->next) {

usr.bin/rpcgen/rpc_cout.c

553

for (dl = def->def.st.decls; dl != NULL; dl = dl->next) {

usr.bin/rpcgen/rpc_cout.c

576

for (dl = def->def.st.decls; dl != NULL; dl = dl->next)

usr.bin/rpcgen/rpc_cout.c

592

for (dl = def->def.st.decls; dl != NULL; dl = dl->next)

usr.bin/rpcgen/rpc_hout.c

123

xdrptr->next = NULL;

usr.bin/rpcgen/rpc_hout.c

128

xdrfunc_tail->next = xdrptr;

usr.bin/rpcgen/rpc_hout.c

158

for (vers = def->def.pr.versions; vers != NULL; vers = vers->next) {

usr.bin/rpcgen/rpc_hout.c

159

for (plist = vers->procs; plist != NULL; plist = plist->next) {

usr.bin/rpcgen/rpc_hout.c

165

for (l = plist->args.decls; l != NULL; l = l->next)

usr.bin/rpcgen/rpc_hout.c

183

for (l = def->def.st.decls; l != NULL; l = l->next)

usr.bin/rpcgen/rpc_hout.c

205

for (l = def->def.un.cases; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_hout.c

236

for (vers = start; vers != NULL; vers = vers->next) {

usr.bin/rpcgen/rpc_hout.c

237

for (proc = vers->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_hout.c

275

for (vers = def->def.pr.versions; vers != NULL; vers = vers->next) {

usr.bin/rpcgen/rpc_hout.c

291

for (proc = vers->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_hout.c

339

for (dl = proc->args.decls; dl != NULL; dl = dl->next) {

usr.bin/rpcgen/rpc_hout.c

365

for (l = def->def.en.vals; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_hout.c

377

if (l->next)

usr.bin/rpcgen/rpc_hout.c

491

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_main.c

517

for (l = defined; l != NULL; l = l->next)

usr.bin/rpcgen/rpc_main.c

532

xdrfuncp = xdrfuncp->next;

usr.bin/rpcgen/rpc_parse.c

123

tailp = &decls->next;

usr.bin/rpcgen/rpc_parse.c

181

tailp = &decls->next;

usr.bin/rpcgen/rpc_parse.c

192

tailp = &decls->next;

usr.bin/rpcgen/rpc_parse.c

207

ptailp = &plist->next;

usr.bin/rpcgen/rpc_parse.c

212

vtailp = &vlist->next;

usr.bin/rpcgen/rpc_parse.c

218

for (plist = vlist->procs; plist != NULL; plist = plist->next) {

usr.bin/rpcgen/rpc_parse.c

257

tailp = &elist->next;

usr.bin/rpcgen/rpc_parse.c

308

tailp = &cases->next;

usr.bin/rpcgen/rpc_parse.c

316

tailp = &cases->next;

usr.bin/rpcgen/rpc_parse.c

324

tailp = &cases->next;

usr.bin/rpcgen/rpc_parse.h

117

struct decl_list *next;

usr.bin/rpcgen/rpc_parse.h

130

struct case_list *next;

usr.bin/rpcgen/rpc_parse.h

155

struct proc_list *next;

usr.bin/rpcgen/rpc_parse.h

163

struct version_list *next;

usr.bin/rpcgen/rpc_parse.h

193

struct bas_type *next;

usr.bin/rpcgen/rpc_parse.h

97

struct enumval_list *next;

usr.bin/rpcgen/rpc_sample.c

112

for (l = proc->args.decls; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_sample.c

134

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_sample.c

160

for (l = proc->args.decls; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_sample.c

189

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_sample.c

190

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_sample.c

272

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_sample.c

276

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_sample.c

69

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_sample.c

90

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

210

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

214

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

241

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

245

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

295

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

302

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

324

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

325

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

357

l = l->next)

usr.bin/rpcgen/rpc_svcout.c

375

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

388

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

413

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

458

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

555

for (; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_svcout.c

614

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

618

vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

830

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

834

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_svcout.c

968

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_svcout.c

972

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_tblout.c

101

for (proc = vp->procs; proc != NULL; proc = proc->next) {

usr.bin/rpcgen/rpc_tblout.c

70

for (l = defined; l != NULL; l = l->next) {

usr.bin/rpcgen/rpc_tblout.c

88

for (vp = def->def.pr.versions; vp != NULL; vp = vp->next) {

usr.bin/rpcgen/rpc_util.c

108

for (l = lstp; *l != NULL; l = (list **) & (*l)->next)

usr.bin/rpcgen/rpc_util.c

112

lst->next = NULL;

usr.bin/rpcgen/rpc_util.c

426

ptr->next = NULL;

usr.bin/rpcgen/rpc_util.c

431

typ_list_t->next = ptr;

usr.bin/rpcgen/rpc_util.c

448

ptr = ptr->next;

usr.bin/rpcgen/rpc_util.c

92

for (; lst != NULL; lst = lst->next) {

usr.bin/rpcgen/rpc_util.h

75

struct list *next;

usr.bin/rpcgen/rpc_util.h

82

struct xdrfunc *next;

usr.bin/rpcinfo/rpcinfo.c

1036

pa = pa->next)

usr.bin/rpcinfo/rpcinfo.c

104

struct netidlist *next;

usr.bin/rpcinfo/rpcinfo.c

1043

pr = pr->next)

usr.bin/rpcinfo/rpcinfo.c

1089

pa = pa->next)

usr.bin/rpcinfo/rpcinfo.c

109

struct verslist *next;

usr.bin/rpcinfo/rpcinfo.c

1096

pr = pr->next)

usr.bin/rpcinfo/rpcinfo.c

1145

pa = pa->next)

usr.bin/rpcinfo/rpcinfo.c

1152

pr = pr->next)

usr.bin/rpcinfo/rpcinfo.c

116

struct rpcbdump_short *next;

usr.bin/rpcinfo/rpcinfo.c

1617

for (pr = infp->rmtinfo; pr; pr = pr->next) {

usr.bin/rpcinfo/rpcinfo.c

1638

for (al = infp->addrinfo; al; al = al->next) {

usr.bin/rpcinfo/rpcinfo.c

626

for (vl = rs->vlist; vl; vl = vl->next)

usr.bin/rpcinfo/rpcinfo.c

635

vl->next = rs->vlist;

usr.bin/rpcinfo/rpcinfo.c

645

for (nl = rs->nlist; nl; nl = nl->next)

usr.bin/rpcinfo/rpcinfo.c

654

nl->next = rs->nlist;

usr.bin/rpcinfo/rpcinfo.c

799

for (rs = rs_head; rs; rs = rs->next)

usr.bin/rpcinfo/rpcinfo.c

807

rs->next = NULL;

usr.bin/rpcinfo/rpcinfo.c

812

rs_tail->next = rs;

usr.bin/rpcinfo/rpcinfo.c

827

for (rs = rs_head; rs; rs = rs->next) {

usr.bin/rpcinfo/rpcinfo.c

834

for (vl = rs->vlist; vl; vl = vl->next) {

usr.bin/rpcinfo/rpcinfo.c

836

vl->next ? "," : "");

usr.bin/rpcinfo/rpcinfo.c

845

for (nl = rs->nlist; nl; nl = nl->next) {

usr.bin/rpcinfo/rpcinfo.c

847

nl->next ? "," : "");

usr.bin/rup/rup.c

53

struct host_list *next;

usr.bin/rup/rup.c

65

for (hp = hosts; hp != NULL; hp = hp->next) {

usr.bin/rup/rup.c

80

hp->next = hosts;

usr.bin/rusers/rusers.c

57

struct host_list *next;

usr.bin/rusers/rusers.c

69

for (hp = hosts; hp != NULL; hp = hp->next) {

usr.bin/rusers/rusers.c

84

hp->next = hosts;

usr.bin/sed/compile.c

1054

struct labhash *lh, *next;

usr.bin/sed/compile.c

1058

for (lh = labels[i]; lh != NULL; lh = next) {

usr.bin/sed/compile.c

1059

next = lh->lh_next;

usr.bin/sed/compile.c

184

link = &cmd->next;

usr.bin/sed/compile.c

233

cmd->next = stack;

usr.bin/sed/compile.c

248

stack = cmd2->next;

usr.bin/sed/compile.c

249

cmd2->next = cmd;

usr.bin/sed/compile.c

256

link = &cmd->next;

usr.bin/sed/compile.c

346

link = &cmd->next;

usr.bin/sed/compile.c

356

link = &cmd->next;

usr.bin/sed/compile.c

976

for (; cp != end; cp = cp->next)

usr.bin/sed/compile.c

995

fixuplabel(cp->u.c, cp->next);

usr.bin/sed/defs.h

95

struct s_command *next; /* Pointer to next command */

usr.bin/sed/main.c

269

script = script->next;

usr.bin/sed/main.c

289

script = script->next;

usr.bin/sed/main.c

292

script = script->next;

usr.bin/sed/main.c

391

files = files->next;

usr.bin/sed/main.c

484

cu->next = NULL;

usr.bin/sed/main.c

486

cu_nextp = &cu->next;

usr.bin/sed/main.c

499

fp->next = NULL;

usr.bin/sed/main.c

502

fl_nextp = &fp->next;

usr.bin/sed/main.c

513

while ((file = file->next) != NULL) {

usr.bin/sed/main.c

68

struct s_compunit *next;

usr.bin/sed/main.c

84

struct s_flist *next;

usr.bin/sed/process.c

114

cp = cp->next;

usr.bin/sed/process.c

276

cp = cp->next;

usr.bin/sed/process.c

367

for (cp = prog; cp; cp = cp->code == '{' ? cp->u.c : cp->next)

usr.bin/sed/process.c

773

for (; cp != end; cp = cp->next)

usr.bin/sed/process.c

786

cfclose(cp->u.c, cp->next);

usr.bin/showmount/showmount.c

287

goto next;

usr.bin/showmount/showmount.c

295

goto next;

usr.bin/showmount/showmount.c

302

goto next;

usr.bin/showmount/showmount.c

316

next:

usr.bin/sockstat/sockstat.c

286

sock->next = sockhash[hash];

usr.bin/sockstat/sockstat.c

351

sock->next = sockhash[hash];

usr.bin/sockstat/sockstat.c

488

for (s = sockhash[hash]; s != NULL; s = s->next)

usr.bin/sockstat/sockstat.c

525

for (s = sockhash[hash]; s != NULL; s = s->next)

usr.bin/sockstat/sockstat.c

84

struct sock *next;

usr.bin/sort/radixsort.c

147

new_ls->next = g_ls;

usr.bin/sort/radixsort.c

175

g_ls = g_ls->next;

usr.bin/sort/radixsort.c

200

g_ls = g_ls->next;

usr.bin/sort/radixsort.c

78

struct level_stack *next;

usr.bin/systat/vmstat.c

727

for (; ep; ep = ep->next)

usr.bin/telnet/commands.c

1571

struct env_lst *next; /* pointer to next structure */

usr.bin/telnet/commands.c

1586

for (ep = envlisthead.next; ep; ep = ep->next) {

usr.bin/telnet/commands.c

1655

ep->next = envlisthead.next;

usr.bin/telnet/commands.c

1656

envlisthead.next = ep;

usr.bin/telnet/commands.c

1658

if (ep->next)

usr.bin/telnet/commands.c

1659

ep->next->prev = ep;

usr.bin/telnet/commands.c

1674

ep->prev->next = ep->next;

usr.bin/telnet/commands.c

1675

if (ep->next)

usr.bin/telnet/commands.c

1676

ep->next->prev = ep->prev;

usr.bin/telnet/commands.c

1734

for (ep = envlisthead.next; ep; ep = ep->next) {

usr.bin/telnet/commands.c

1750

while ((nep = nep->next)) {

usr.bin/telnet/commands.c

2372

struct addrinfo *next;

usr.bin/telnet/commands.c

2374

next = res->ai_next;

usr.bin/telnet/commands.c

2377

while (next != NULL && next->ai_family != res->ai_family)

usr.bin/telnet/commands.c

2378

next = next->ai_next;

usr.bin/telnet/commands.c

2380

if (next != NULL) {

usr.bin/telnet/commands.c

2381

res = next;

usr.bin/telnet/telnet.c

677

static const char **next;

usr.bin/telnet/telnet.c

695

next = tnamep;

usr.bin/telnet/telnet.c

697

if (*next == NULL)

usr.bin/telnet/telnet.c

698

next = tnamep;

usr.bin/telnet/telnet.c

699

return(*next++);

usr.bin/tip/remote.c

248

static char *next;

usr.bin/tip/remote.c

255

next = DV;

usr.bin/tip/remote.c

262

if (next == NULL)

usr.bin/tip/remote.c

264

if ((cp = index(next, ',')) == NULL) {

usr.bin/tip/remote.c

265

DV = next;

usr.bin/tip/remote.c

266

next = NULL;

usr.bin/tip/remote.c

269

DV = next;

usr.bin/tip/remote.c

270

next = cp;

usr.bin/tip/tip.c

477

goto next;

usr.bin/tip/tip.c

485

next:

usr.bin/top/color.c

154

ce->next = entries;

usr.bin/top/color.c

226

entryp = entryp->next;

usr.bin/top/color.c

352

ep = ep -> next;

usr.bin/top/color.c

71

struct color_entry *next;

usr.bin/top/hash.c

174

new->next = q->head;

usr.bin/top/hash.c

184

q->head = qi->next;

usr.bin/top/hash.c

188

last->next = qi->next;

usr.bin/top/hash.c

190

qi->next = NULL;

usr.bin/top/hash.c

202

#define LL_NEXT(q, qi) ((qi) != NULL ? (qi)->next : NULL)

usr.bin/top/hash.c

207

return (qi != NULL ? qi->next : NULL);

usr.bin/top/hash.h

51

struct llistitem *next;

usr.bin/tr/extern.h

50

wint_t next(STR *);

usr.bin/tr/str.c

104

return (next(s));

usr.bin/tr/str.c

114

return (next(s));

usr.bin/tr/str.c

121

return (next(s));

usr.bin/tr/str.c

77

return (next(s));

usr.bin/tr/str.c

92

return (next(s));

usr.bin/tr/str.c

97

return (next(s));

usr.bin/tr/tr.c

193

if (!next(&s2))

usr.bin/tr/tr.c

203

while (next(&s1)) {

usr.bin/tr/tr.c

213

if (!next(&s1))

usr.bin/tr/tr.c

218

if (!next(&s2))

usr.bin/tr/tr.c

230

if (!next(&s1))

usr.bin/tr/tr.c

235

if (!next(&s2))

usr.bin/tr/tr.c

244

(void)next(&s2);

usr.bin/tr/tr.c

265

if (next(&s2))

usr.bin/tr/tr.c

290

(void)next(&s2);

usr.bin/tr/tr.c

334

while (next(str))

usr.bin/tset/map.c

121

goto next;

usr.bin/tset/map.c

124

next: if (*arg == ':') {

usr.bin/tset/map.c

187

for (mapp = maplist; mapp; mapp = mapp->next)

usr.bin/tset/map.c

53

struct map *next; /* Linked list of maps. */

usr.bin/tset/map.c

77

mapp->next = NULL;

usr.bin/tset/map.c

81

cur->next = mapp;

usr.bin/tsort/tsort.c

295

NODE *n, *next;

usr.bin/tsort/tsort.c

305

for (cnt = 0, n = graph; n != NULL; n = next) {

usr.bin/tsort/tsort.c

306

next = n->n_next;

usr.bin/u4bhidctl/usbhid.c

110

pnext = &var->next;

usr.bin/u4bhidctl/usbhid.c

131

pnext = &var->next;

usr.bin/u4bhidctl/usbhid.c

318

for (var = vars; var; var = var->next) {

usr.bin/u4bhidctl/usbhid.c

357

for (var = vars; var; var = var->next) {

usr.bin/u4bhidctl/usbhid.c

388

for (var = vars; var; var = var->next) {

usr.bin/u4bhidctl/usbhid.c

420

for (var = vars; var; var = var->next) {

usr.bin/u4bhidctl/usbhid.c

50

struct variable *next;

usr.bin/usbhidaction/usbhidaction.c

202

for (cmd = commands; cmd; cmd = cmd->next) {

usr.bin/usbhidaction/usbhidaction.c

221

goto next;

usr.bin/usbhidaction/usbhidaction.c

226

goto next;

usr.bin/usbhidaction/usbhidaction.c

233

goto next;

usr.bin/usbhidaction/usbhidaction.c

235

next:

usr.bin/usbhidaction/usbhidaction.c

329

cmd->next = cmds;

usr.bin/usbhidaction/usbhidaction.c

513

struct command *next;

usr.bin/usbhidaction/usbhidaction.c

516

next = cmd->next;

usr.bin/usbhidaction/usbhidaction.c

518

cmd = next;

usr.bin/usbhidaction/usbhidaction.c

55

struct command *next;

usr.bin/users/users.c

68

for (; ep; ep = ep->next) {

usr.bin/w/w.c

101

struct entry *next;

usr.bin/w/w.c

245

nextp = &(ep->next);

usr.bin/w/w.c

284

for (ep = ehead; ep != NULL; ep = ep->next) {

usr.bin/w/w.c

304

scan->next = ep->list;

usr.bin/w/w.c

322

for (ep = ehead; ep != NULL; ep = ep->next) {

usr.bin/w/w.c

341

nextp = &(*nextp)->next)

usr.bin/w/w.c

344

from = from->next;

usr.bin/w/w.c

345

save->next = *nextp;

usr.bin/w/w.c

355

nextp = &(*nextp)->next)

usr.bin/w/w.c

358

from = from->next;

usr.bin/w/w.c

359

save->next = *nextp;

usr.bin/w/w.c

374

for (ep = ehead; ep != NULL; ep = ep->next) {

usr.bin/w/w.c

411

for (scan = ep->list; scan; scan = scan->next) {

usr.bin/w/w.c

93

struct kplist *next;

usr.bin/wall/wall.c

108

for (g = grouplist; g; g = g->next) {

usr.bin/wall/wall.c

123

for (; ep; ep = ep->next) {

usr.bin/wall/wall.c

129

for (g = grouplist; g && ingroup == 0; g = g->next) {

usr.bin/wall/wall.c

62

struct wallgroup *next;

usr.bin/wall/wall.c

94

g->next = grouplist;

usr.bin/who/utmpentry.c

118

ep = ep->next;

usr.bin/who/utmpentry.c

153

nextp = &(ep->next);

usr.bin/who/utmpentry.c

164

nextp = &(*nextp)->next)

usr.bin/who/utmpentry.c

167

from = from->next;

usr.bin/who/utmpentry.c

168

save->next = *nextp;

usr.bin/who/utmpentry.h

48

struct utmpentry *next;

usr.bin/who/who.c

244

for (ep = ehead; ep; ep = ep->next)

usr.bin/who/who.c

268

for (ep = ehead; ep != NULL; ep = ep->next)

usr.bin/who/who.c

373

for (ep = ehead; ep != NULL; ep = ep->next) {

usr.bin/write/write.c

134

for (; ep; ep = ep->next) {

usr.bin/write/write.c

167

for (; ep; ep = ep->next)

usr.sbin/ac/ac.c

124

SLIST_INSERT_HEAD(&Ttys, tp, next);

usr.sbin/ac/ac.c

136

SLIST_FOREACH(tp, &Ttys, next) {

usr.sbin/ac/ac.c

159

SLIST_FOREACH(up, &CurUtmpx, next)

usr.sbin/ac/ac.c

178

SLIST_FOREACH(up, &Users, next) {

usr.sbin/ac/ac.c

197

SLIST_INSERT_HEAD(&Users, up, next);

usr.sbin/ac/ac.c

199

SLIST_INSERT_AFTER(aup, up, next);

usr.sbin/ac/ac.c

273

SLIST_FOREACH(lp, &Users, next)

usr.sbin/ac/ac.c

296

SLIST_FOREACH(lp, &CurUtmpx, next) {

usr.sbin/ac/ac.c

302

SLIST_FOREACH(up, &Users, next) {

usr.sbin/ac/ac.c

332

lp = SLIST_NEXT(lp, next);

usr.sbin/ac/ac.c

334

SLIST_REMOVE_HEAD(&CurUtmpx, next);

usr.sbin/ac/ac.c

336

SLIST_REMOVE_AFTER(lp2, next);

usr.sbin/ac/ac.c

340

lp = SLIST_NEXT(lp, next);

usr.sbin/ac/ac.c

394

SLIST_INSERT_HEAD(&CurUtmpx, lp, next);

usr.sbin/ac/ac.c

452

SLIST_FOREACH(lp, &CurUtmpx, next)

usr.sbin/ac/ac.c

51

SLIST_ENTRY(utmpx_entry) next;

usr.sbin/ac/ac.c

64

SLIST_ENTRY(user_entry) next;

usr.sbin/ac/ac.c

73

SLIST_ENTRY(tty_entry) next;

usr.sbin/arp/arp.c

479

char *lim, *buf, *next;

usr.sbin/arp/arp.c

503

for (next = buf; next < lim; next += rtm->rtm_msglen) {

usr.sbin/arp/arp.c

504

rtm = (struct rt_msghdr *)next;

usr.sbin/autofs/popen.c

124

SLIST_FOREACH(p, &pidlist, next)

usr.sbin/autofs/popen.c

140

SLIST_INSERT_HEAD(&pidlist, cur, next);

usr.sbin/autofs/popen.c

155

SLIST_FOREACH(cur, &pidlist, next) {

usr.sbin/autofs/popen.c

164

SLIST_REMOVE_HEAD(&pidlist, next);

usr.sbin/autofs/popen.c

166

SLIST_REMOVE_AFTER(last, next);

usr.sbin/autofs/popen.c

59

SLIST_ENTRY(pid) next;

usr.sbin/bthcid/bthcid.h

68

LIST_ENTRY(link_key) next; /* link to the next */

usr.sbin/bthcid/client.c

173

LIST_INSERT_HEAD(&client_list, cl, next);

usr.sbin/bthcid/client.c

194

LIST_REMOVE(cl, next);

usr.sbin/bthcid/client.c

203

LIST_FOREACH(item, &item_list, next) {

usr.sbin/bthcid/client.c

217

LIST_REMOVE(item, next);

usr.sbin/bthcid/client.c

233

LIST_INSERT_HEAD(&item_list, item, next);

usr.sbin/bthcid/client.c

244

LIST_REMOVE(item, next);

usr.sbin/bthcid/client.c

265

LIST_FOREACH(cl, &client_list, next) {

usr.sbin/bthcid/client.c

295

LIST_INSERT_HEAD(&item_list, item, next);

usr.sbin/bthcid/client.c

308

LIST_REMOVE(item, next);

usr.sbin/bthcid/client.c

323

LIST_FOREACH(item, &item_list, next) {

usr.sbin/bthcid/client.c

337

LIST_REMOVE(item, next);

usr.sbin/bthcid/client.c

56

LIST_ENTRY(client) next;

usr.sbin/bthcid/client.c

68

LIST_ENTRY(item) next;

usr.sbin/bthcid/parser.y

234

LIST_REMOVE(lkey, next);

usr.sbin/bthcid/parser.y

245

LIST_FOREACH(lkey, &link_keys, next) {

usr.sbin/bthcid/parser.y

266

LIST_FOREACH(lkey, &link_keys, next) {

usr.sbin/bthcid/parser.y

367

LIST_FOREACH(lkey, &link_keys, next) {

usr.sbin/bthcid/parser.y

96

LIST_INSERT_HEAD(&link_keys, key, next);

usr.sbin/cdcontrol/cdcontrol.c

1002

int block, next, len;

usr.sbin/cdcontrol/cdcontrol.c

1025

next = msf2lba (e[1].addr.msf.minute, e[1].addr.msf.second,

usr.sbin/cdcontrol/cdcontrol.c

1028

next = ntohl(e[1].addr.lba);

usr.sbin/cdcontrol/cdcontrol.c

1029

len = next - block;

usr.sbin/clog/clog.c

131

uint32_t next;

usr.sbin/clog/clog.c

156

next = pcf->cf_next;

usr.sbin/clog/clog.c

158

if (start>next) {

usr.sbin/clog/clog.c

164

iov[iovcnt++].iov_len = next - start;

usr.sbin/clog/clog.c

169

start = next;

usr.sbin/config/mkmakefile.c

247

next:

usr.sbin/config/mkmakefile.c

265

goto next;

usr.sbin/config/mkmakefile.c

276

goto next;

usr.sbin/config/mkmakefile.c

281

goto next;

usr.sbin/config/mkmakefile.c

286

goto next;

usr.sbin/config/mkmakefile.c

477

goto next;

usr.sbin/config/mkmakefile.c

513

goto next;

usr.sbin/config/mkoptions.c

294

next:

usr.sbin/config/mkoptions.c

305

goto next;

usr.sbin/config/mkoptions.c

315

goto next;

usr.sbin/config/mkoptions.c

320

goto next;

usr.sbin/config/mkoptions.c

325

goto next;

usr.sbin/config/mkoptions.c

356

goto next;

usr.sbin/cpucontrol/cpucontrol.c

396

SLIST_FOREACH(dir, &datadirs, next) {

usr.sbin/cpucontrol/cpucontrol.c

435

SLIST_INSERT_HEAD(&datadirs, newdir, next);

usr.sbin/cpucontrol/cpucontrol.c

82

SLIST_ENTRY(datadir) next;

usr.sbin/cron/cron/cron.c

144

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

145

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.c

189

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

190

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.c

204

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

205

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.c

219

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

220

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.c

245

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

246

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.c

365

for (u = db->head; u != NULL; u = u->next) {

usr.sbin/cron/cron/cron.c

366

for (e = u->crontab; e != NULL; e = e->next) {

usr.sbin/cron/cron/cron.h

157

struct _entry *next;

usr.sbin/cron/cron/cron.h

189

struct _user *next, *prev; /* links */

usr.sbin/cron/cron/database.c

129

nu = u->next;

usr.sbin/cron/cron/database.c

147

db->tail->next = u;

usr.sbin/cron/cron/database.c

149

u->next = NULL;

usr.sbin/cron/cron/database.c

158

db->head = u->next;

usr.sbin/cron/cron/database.c

160

u->prev->next = u->next;

usr.sbin/cron/cron/database.c

162

if (u->next == NULL)

usr.sbin/cron/cron/database.c

165

u->next->prev = u->prev;

usr.sbin/cron/cron/database.c

174

for (u = db->head; u != NULL; u = u->next)

usr.sbin/cron/cron/job.c

25

struct _job *next;

usr.sbin/cron/cron/job.c

40

for (j=jhead; j; j=j->next)

usr.sbin/cron/cron/job.c

46

j->next = NULL;

usr.sbin/cron/cron/job.c

52

else { jtail->next=j; }

usr.sbin/cron/cron/job.c

65

jn = j->next;

usr.sbin/cron/cron/user.c

100

e->next = u->crontab;

usr.sbin/cron/cron/user.c

35

ne = e->next;

usr.sbin/edquota/edquota.c

176

curprivs->next = qup;

usr.sbin/edquota/edquota.c

193

for (qup = protoprivs; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

224

qup = qup->next) {

usr.sbin/edquota/edquota.c

388

quptail->next = qup;

usr.sbin/edquota/edquota.c

390

qup->next = NULL;

usr.sbin/edquota/edquota.c

406

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

478

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

552

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

589

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

618

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

64

struct quotause *next;

usr.sbin/edquota/edquota.c

674

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

688

for (qup = quplist; qup; qup = qup->next) {

usr.sbin/edquota/edquota.c

757

nextqup = qup->next;

usr.sbin/efibootmgr/efibootmgr.c

350

char *next, *cp;

usr.sbin/efibootmgr/efibootmgr.c

365

while ((next = strsep(&cp, ",")) != NULL) {

usr.sbin/efibootmgr/efibootmgr.c

366

new_data[i] = strtoul(next, NULL, 16);

usr.sbin/efibootmgr/efibootmgr.c

368

warnx("can't parse %s as a numb", next);

usr.sbin/fwcontrol/fwdv.c

178

goto next;

usr.sbin/fwcontrol/fwdv.c

234

next:

usr.sbin/fwcontrol/fwdv.c

334

next:

usr.sbin/fwcontrol/fwdv.c

393

goto next;

usr.sbin/gifconfig/gifconfig.c

190

static char *buf, *lim, *next;

usr.sbin/gifconfig/gifconfig.c

255

for (next = buf; next < lim; next += ifm->ifm_msglen) {

usr.sbin/gifconfig/gifconfig.c

257

ifm = (struct if_msghdr *)next;

usr.sbin/gifconfig/gifconfig.c

480

mynext = next + ifm->ifm_msglen;

usr.sbin/gifconfig/gifconfig.c

490

next = mynext;

usr.sbin/gifconfig/gifconfig.c

492

ifm = (struct if_msghdr *)next;

usr.sbin/installer/dfuibe_installer/fn_zonetab.c

130

c->next = malloc(sizeof(struct zonetab));

usr.sbin/installer/dfuibe_installer/fn_zonetab.c

131

c = c->next;

usr.sbin/installer/dfuibe_installer/fn_zonetab.c

136

c->next = malloc(sizeof(struct zonetab));

usr.sbin/installer/dfuibe_installer/fn_zonetab.c

137

c = c->next;

usr.sbin/installer/dfuibe_installer/fn_zonetab.c

147

c->next = NULL;

usr.sbin/installer/dfuibe_installer/fn_zonetab.h

58

struct zonetab *next;

usr.sbin/installer/dfuife_curses/curses_form.c

114

t = w->next;

usr.sbin/installer/dfuife_curses/curses_form.c

188

cf->widget_tail->next = w;

usr.sbin/installer/dfuife_curses/curses_form.c

213

w->next = cw->next;

usr.sbin/installer/dfuife_curses/curses_form.c

214

if (cw->next == NULL)

usr.sbin/installer/dfuife_curses/curses_form.c

217

cw->next->prev = w;

usr.sbin/installer/dfuife_curses/curses_form.c

218

cw->next = w;

usr.sbin/installer/dfuife_curses/curses_form.c

230

w->form->widget_head = w->next;

usr.sbin/installer/dfuife_curses/curses_form.c

232

w->prev->next = w->next;

usr.sbin/installer/dfuife_curses/curses_form.c

234

if (w->next == NULL)

usr.sbin/installer/dfuife_curses/curses_form.c

237

w->next->prev = w->prev;

usr.sbin/installer/dfuife_curses/curses_form.c

239

w->next = NULL;

usr.sbin/installer/dfuife_curses/curses_form.c

390

for (w = cf->widget_head; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

419

cf->widget_focus = cf->widget_focus->next;

usr.sbin/installer/dfuife_curses/curses_form.c

443

cf->widget_focus = cf->widget_focus->next;

usr.sbin/installer/dfuife_curses/curses_form.c

488

for (w = cf->widget_head; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

505

for (w = cf->widget_head; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

523

for (w = cf->widget_head; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

540

for (w = cf->widget_head; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

562

for (best = w; w != NULL && w->y == y; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

587

for (lw = cf->widget_head; lw != NULL; lw = lw->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

606

for (lw = cf->widget_head; lw != NULL; lw = lw->next) {

usr.sbin/installer/dfuife_curses/curses_form.c

997

for (cw = cf->widget_head; cw != NULL; cw = cw->next) {

usr.sbin/installer/dfuife_curses/curses_widget.c

93

w->next = NULL;

usr.sbin/installer/dfuife_curses/curses_widget.h

54

struct curses_widget *next; /* chain of widgets in form */

usr.sbin/installer/dfuife_curses/curses_xlat.c

104

for (few = cf->widget_head; few != NULL; few = few->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

217

for (few = cf->widget_head; few != NULL; few = few->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

375

for (cw = cf->widget_head; cw != NULL; cw = cw->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

407

for (w = row_start; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

416

for (w = row_start; w != NULL; w = w->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

90

for (few = cf->widget_head; few != NULL; few = few->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

934

for (cw = cf->widget_head; cw != NULL; cw = cw->next) {

usr.sbin/installer/dfuife_curses/curses_xlat.c

968

for (cw = cf->widget_head; cw != NULL; cw = cw->next) {

usr.sbin/installer/libaura/dict.c

134

d->b[bucket_no] = b->next;

usr.sbin/installer/libaura/dict.c

176

b->next = NULL;

usr.sbin/installer/libaura/dict.c

196

for (*b = d->b[*b_index]; *b != NULL; *b = (*b)->next) {

usr.sbin/installer/libaura/dict.c

210

for (*b = d->b[0]; *b != NULL; *b = (*b)->next) {

usr.sbin/installer/libaura/dict.c

247

b->next = d->b[i];

usr.sbin/installer/libaura/dict.c

266

for (b = d->b[0]; b != NULL; b = b->next) {

usr.sbin/installer/libaura/dict.c

286

b->next = d->b[0];

usr.sbin/installer/libaura/dict.c

331

new_b->next = NULL;

usr.sbin/installer/libaura/dict.c

334

for (b = d->b[0]; b != NULL; b = b->next) {

usr.sbin/installer/libaura/dict.c

338

prev->next = new_b;

usr.sbin/installer/libaura/dict.c

341

new_b->next = b;

usr.sbin/installer/libaura/dict.c

348

prev->next = new_b;

usr.sbin/installer/libaura/dict.c

349

new_b->next = NULL;

usr.sbin/installer/libaura/dict.c

442

d->cursor = d->cursor->next;

usr.sbin/installer/libaura/dict.c

456

b = b->next;

usr.sbin/installer/libaura/dict.h

60

struct aura_bucket *next;

usr.sbin/installer/libaura/popen.c

150

for (p = pidlist; p; p = p->next) {

usr.sbin/installer/libaura/popen.c

170

cur->next = pidlist;

usr.sbin/installer/libaura/popen.c

190

for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) {

usr.sbin/installer/libaura/popen.c

206

pidlist = cur->next;

usr.sbin/installer/libaura/popen.c

208

last->next = cur->next;

usr.sbin/installer/libaura/popen.c

220

for (cur = pidlist; cur; cur = cur->next)

usr.sbin/installer/libaura/popen.c

63

struct pid *next;

usr.sbin/installer/libdfui/decode.c

163

fi->next = head;

usr.sbin/installer/libdfui/decode.c

189

o->next = head;

usr.sbin/installer/libdfui/decode.c

221

a->next = head;

usr.sbin/installer/libdfui/decode.c

255

c->next = head;

usr.sbin/installer/libdfui/decode.c

288

h->next = head;

usr.sbin/installer/libdfui/decode.c

315

ds->next = head;

usr.sbin/installer/libdfui/dfui.h

164

struct dfui_dataset *next;

usr.sbin/installer/libdfui/dfui.h

169

struct dfui_celldata *next;

usr.sbin/installer/libdfui/dfui.h

184

struct dfui_property *next;

usr.sbin/installer/libdfui/dfui.h

210

struct dfui_field *next;

usr.sbin/installer/libdfui/dfui.h

218

struct dfui_option *next;

usr.sbin/installer/libdfui/dfui.h

224

struct dfui_action *next;

usr.sbin/installer/libdfui/dump.c

144

for (c = ds->celldata_head; c != NULL; c = c->next) {

usr.sbin/installer/libdfui/dump.c

172

for (fi = f->field_head; fi != NULL; fi = fi->next) {

usr.sbin/installer/libdfui/dump.c

175

for (a = f->action_head; a != NULL; a = a->next) {

usr.sbin/installer/libdfui/dump.c

178

for (ds = f->dataset_head; ds != NULL; ds = ds->next) {

usr.sbin/installer/libdfui/dump.c

198

for (ds = r->dataset_head; ds != NULL; ds = ds->next) {

usr.sbin/installer/libdfui/dump.c

99

for (o = fi->option_head; o != NULL; o = o->next) {

usr.sbin/installer/libdfui/encode.c

120

for (fi = head; fi != NULL; fi = fi->next) {

usr.sbin/installer/libdfui/encode.c

146

for (o = head; o != NULL; o = o->next) {

usr.sbin/installer/libdfui/encode.c

164

for (a = head; a != NULL; a = a->next) {

usr.sbin/installer/libdfui/encode.c

184

for (ds = head; ds != NULL; ds = ds->next) {

usr.sbin/installer/libdfui/encode.c

202

c = c->next;

usr.sbin/installer/libdfui/encode.c

220

h = h->next;

usr.sbin/installer/libdfui/form.c

1016

head = ds->next;

usr.sbin/installer/libdfui/form.c

1031

c->next = ds->celldata_head;

usr.sbin/installer/libdfui/form.c

1058

return(ds->next);

usr.sbin/installer/libdfui/form.c

1133

ds->next = r->dataset_head;

usr.sbin/installer/libdfui/form.c

1157

ds = ds->next;

usr.sbin/installer/libdfui/form.c

158

head = p->next;

usr.sbin/installer/libdfui/form.c

169

for (p = head; p != NULL; p = p->next) {

usr.sbin/installer/libdfui/form.c

202

p->next = *head;

usr.sbin/installer/libdfui/form.c

232

fi->next = NULL;

usr.sbin/installer/libdfui/form.c

258

head = fi->next;

usr.sbin/installer/libdfui/form.c

269

return(fi->next);

usr.sbin/installer/libdfui/form.c

296

o->next = fi->option_head;

usr.sbin/installer/libdfui/form.c

361

o->next = NULL;

usr.sbin/installer/libdfui/form.c

382

head = o->next;

usr.sbin/installer/libdfui/form.c

393

return(o->next);

usr.sbin/installer/libdfui/form.c

414

a->next = NULL;

usr.sbin/installer/libdfui/form.c

436

head = a->next;

usr.sbin/installer/libdfui/form.c

447

return(a->next);

usr.sbin/installer/libdfui/form.c

617

fi->next = f->field_head;

usr.sbin/installer/libdfui/form.c

628

fi->next = f->field_head;

usr.sbin/installer/libdfui/form.c

642

a->next = f->action_head;

usr.sbin/installer/libdfui/form.c

653

a->next = f->action_head;

usr.sbin/installer/libdfui/form.c

664

ds->next = f->dataset_head;

usr.sbin/installer/libdfui/form.c

688

ds = ds->next;

usr.sbin/installer/libdfui/form.c

715

fi = fi->next;

usr.sbin/installer/libdfui/form.c

741

fi = fi->next;

usr.sbin/installer/libdfui/form.c

755

a = a->next;

usr.sbin/installer/libdfui/form.c

781

a = a->next;

usr.sbin/installer/libdfui/form.c

865

for (fi = f->field_head; fi != NULL; fi = fi->next) {

usr.sbin/installer/libdfui/form.c

910

head = c->next;

usr.sbin/installer/libdfui/form.c

925

c = c->next;

usr.sbin/installer/libdfui/form.c

935

return(cd->next);

usr.sbin/installer/libdfui/form.c

981

ds->next = NULL;

usr.sbin/installer/libdfui/form.c

994

for (cd = ds->celldata_head; cd != NULL; cd = cd->next) {

usr.sbin/installer/libinstaller/commands.c

103

cmds->tail->next = cmd;

usr.sbin/installer/libinstaller/commands.c

199

return(cmd->next);

usr.sbin/installer/libinstaller/commands.c

266

for (cmd = cmds->head; cmd != NULL; cmd = cmd->next) {

usr.sbin/installer/libinstaller/commands.c

514

cmd = cmd->next;

usr.sbin/installer/libinstaller/commands.c

527

for (cmd = cmds->head; cmd != NULL; cmd = cmd->next, i++) {

usr.sbin/installer/libinstaller/commands.c

557

struct command *cmd, *next;

usr.sbin/installer/libinstaller/commands.c

561

next = cmd->next;

usr.sbin/installer/libinstaller/commands.c

569

cmd = next;

usr.sbin/installer/libinstaller/commands.c

99

cmd->next = NULL;

usr.sbin/installer/libinstaller/commands.h

63

struct command *next;

usr.sbin/installer/libinstaller/diskutil.c

1030

for (s = d->slice_head; s != NULL; s = s->next)

usr.sbin/installer/libinstaller/diskutil.c

172

d->next = NULL;

usr.sbin/installer/libinstaller/diskutil.c

176

s->disk_tail->next = d;

usr.sbin/installer/libinstaller/diskutil.c

284

d = d->next;

usr.sbin/installer/libinstaller/diskutil.c

293

return(d->next);

usr.sbin/installer/libinstaller/diskutil.c

336

struct disk *d = s->disk_head, *next;

usr.sbin/installer/libinstaller/diskutil.c

339

next = d->next;

usr.sbin/installer/libinstaller/diskutil.c

344

d = next;

usr.sbin/installer/libinstaller/diskutil.c

396

s->next = NULL;

usr.sbin/installer/libinstaller/diskutil.c

400

d->slice_tail->next = s;

usr.sbin/installer/libinstaller/diskutil.c

420

s = s->next;

usr.sbin/installer/libinstaller/diskutil.c

429

return(s->next);

usr.sbin/installer/libinstaller/diskutil.c

500

struct slice *next;

usr.sbin/installer/libinstaller/diskutil.c

503

next = head->next;

usr.sbin/installer/libinstaller/diskutil.c

507

head = next;

usr.sbin/installer/libinstaller/diskutil.c

562

sp->next = NULL;

usr.sbin/installer/libinstaller/diskutil.c

566

s->subpartition_tail->next = sp;

usr.sbin/installer/libinstaller/diskutil.c

625

sp->next = NULL;

usr.sbin/installer/libinstaller/diskutil.c

629

s->subpartition_tail->next = sp;

usr.sbin/installer/libinstaller/diskutil.c

711

sp->next = NULL;

usr.sbin/installer/libinstaller/diskutil.c

715

s->subpartition_tail->next = sp;

usr.sbin/installer/libinstaller/diskutil.c

723

sptmp = sptmp->next) {

usr.sbin/installer/libinstaller/diskutil.c

759

sp = sp->next;

usr.sbin/installer/libinstaller/diskutil.c

792

sp = sp->next;

usr.sbin/installer/libinstaller/diskutil.c

807

sp = sp->next;

usr.sbin/installer/libinstaller/diskutil.c

816

return(sp->next);

usr.sbin/installer/libinstaller/diskutil.c

946

sp = sp->next;

usr.sbin/installer/libinstaller/diskutil.c

955

struct subpartition *sp = s->subpartition_head, *next;

usr.sbin/installer/libinstaller/diskutil.c

958

next = sp->next;

usr.sbin/installer/libinstaller/diskutil.c

961

sp = next;

usr.sbin/installer/libinstaller/diskutil.h

100

struct subpartition *next;

usr.sbin/installer/libinstaller/diskutil.h

68

struct disk *next;

usr.sbin/installer/libinstaller/diskutil.h

85

struct slice *next;

usr.sbin/installer/test/test_storage/test_storage.c

98

dsk_next = dsk->next;

usr.sbin/keyserv/setkey.c

314

struct secretkey_netname_list *next;

usr.sbin/keyserv/setkey.c

331

l = &(*l)->next) {

usr.sbin/keyserv/setkey.c

339

new->next = NULL;

usr.sbin/keyserv/setkey.c

368

for (l = g_secretkey_netname; l != NULL; l = l->next) {

usr.sbin/keyserv/setkey.c

394

for (l = g_secretkey_netname; l != NULL; l = l->next) {

usr.sbin/keyserv/setkey.c

412

l = &(*l)->next) {

usr.sbin/keyserv/setkey.c

423

new->next = NULL;

usr.sbin/keyserv/setkey.c

483

struct cachekey_list *next;

usr.sbin/keyserv/setkey.c

502

new->next = g_cachedkeys;

usr.sbin/keyserv/setkey.c

520

l = &(*l)->next)

usr.sbin/keyserv/setkey.c

526

(*l) = (*l)->next;

usr.sbin/keyserv/setkey.c

527

found->next = g_cachedkeys;

usr.sbin/lpr/chkprintcap/chkprintcap.c

122

goto next;

usr.sbin/lpr/chkprintcap/chkprintcap.c

142

next:

usr.sbin/lpr/chkprintcap/chkprintcap.c

145

goto next;

usr.sbin/lpr/lpd/lpd.c

584

goto next;

usr.sbin/lpr/lpd/lpd.c

600

next:

usr.sbin/makefs/cd9660.c

1008

if ((next = TAILQ_NEXT(end_of_range, cn_next_child)) != NULL)

usr.sbin/makefs/cd9660.c

1009

end_of_range = next;

usr.sbin/makefs/cd9660.c

1172

cd9660node *cn, *next;

usr.sbin/makefs/cd9660.c

1176

if ((next = TAILQ_NEXT(cn, cn_next_child)) == NULL)

usr.sbin/makefs/cd9660.c

1178

else if (strcmp(next->isoDirRecord->name,

usr.sbin/makefs/cd9660.c

1181

TAILQ_REMOVE(&node->cn_children, next, cn_next_child);

usr.sbin/makefs/cd9660.c

1182

TAILQ_INSERT_BEFORE(cn, next, cn_next_child);

usr.sbin/makefs/cd9660.c

1192

cd9660node *iter, *next;

usr.sbin/makefs/cd9660.c

1195

(next = TAILQ_NEXT(iter, cn_next_child)) != NULL;

usr.sbin/makefs/cd9660.c

1196

iter = next) {

usr.sbin/makefs/cd9660.c

1198

next->isoDirRecord->name) == 0)

usr.sbin/makefs/cd9660.c

1204

if ((next = TAILQ_NEXT(iter, cn_next_child)) != NULL) {

usr.sbin/makefs/cd9660.c

1207

next->isoDirRecord->name);

usr.sbin/makefs/cd9660.c

1210

return cd9660_recurse_on_collision(next, count);

usr.sbin/makefs/cd9660.c

1335

root = root->next;

usr.sbin/makefs/cd9660.c

1433

if (iterator->next != NULL) {

usr.sbin/makefs/cd9660.c

1439

iterator = iterator->next;

usr.sbin/makefs/cd9660.c

757

temp->next = t;

usr.sbin/makefs/cd9660.c

769

temp->next = t;

usr.sbin/makefs/cd9660.c

771

t->next = NULL;

usr.sbin/makefs/cd9660.c

984

cd9660node *iter, *next, *prev;

usr.sbin/makefs/cd9660.c

993

iter != NULL && (next = TAILQ_NEXT(iter, cn_next_child)) != NULL;) {

usr.sbin/makefs/cd9660.c

995

next->isoDirRecord->name) != 0) {

usr.sbin/makefs/cd9660.h

203

struct _volume_descriptor *next;

usr.sbin/makefs/cd9660/cd9660_debug.c

172

tmp = tmp->next;

usr.sbin/makefs/cd9660/cd9660_eltorito.c

373

*valid_entry, *default_entry, *temp, *head, **headp, *next;

usr.sbin/makefs/cd9660/cd9660_eltorito.c

510

while ((next = LIST_NEXT(head, ll_struct)) != NULL &&

usr.sbin/makefs/cd9660/cd9660_eltorito.c

511

next->entry_type == ET_ENTRY_SE)

usr.sbin/makefs/cd9660/cd9660_eltorito.c

512

head = next;

usr.sbin/makefs/cd9660/cd9660_eltorito.c

519

LIST_FOREACH(next, &diskStructure->boot_entries, ll_struct) {

usr.sbin/makefs/cd9660/cd9660_eltorito.c

520

if (next->entry_type == ET_ENTRY_SH)

usr.sbin/makefs/cd9660/cd9660_eltorito.c

521

head = next;

usr.sbin/makefs/cd9660/cd9660_write.c

150

vd_temp = vd_temp->next;

usr.sbin/makefs/ffs.c

661

for (node = root; node != NULL; node = node->next) {

usr.sbin/makefs/ffs.c

832

for (cur = root; cur != NULL; cur = cur->next) {

usr.sbin/makefs/ffs.c

866

for (cur = root; cur != NULL; cur = cur->next) {

usr.sbin/makefs/ffs.c

914

for (cur = root; cur != NULL; cur = cur->next) {

usr.sbin/makefs/hammer2.c

1076

for (cur = root->next; cur != NULL; cur = cur->next) {

usr.sbin/makefs/hammer2.c

2127

struct hammer2_link *e, *next;

usr.sbin/makefs/hammer2.c

2129

TAILQ_FOREACH_MUTABLE(e, linkq, entry, next)

usr.sbin/makefs/hammer2.c

974

for (node = root; node != NULL; node = node->next) {

usr.sbin/makefs/hammer2/hammer2.h

270

struct hammer2_reptrack *next;

usr.sbin/makefs/hammer2/hammer2.h

309

struct hammer2_io *next;

usr.sbin/makefs/hammer2/hammer2.h

731

struct hammer2_inode *next; /* inode tree */

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1036

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1038

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1078

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1088

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1114

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1134

goto next;

usr.sbin/makefs/hammer2/hammer2_bulkfree.c

1144

next:

usr.sbin/makefs/hammer2/hammer2_chain.c

2251

reptrack.next = parent->core.reptrack;

usr.sbin/makefs/hammer2/hammer2_chain.c

2291

repp = &(*repp)->next;

usr.sbin/makefs/hammer2/hammer2_chain.c

2292

*repp = reptrack.next;

usr.sbin/makefs/hammer2/hammer2_chain.c

2331

chain->core.reptrack = reptrack->next;

usr.sbin/makefs/hammer2/hammer2_chain.c

2333

reptrack->next = parent->core.reptrack;

usr.sbin/makefs/hammer2/hammer2_inode.c

1858

for (ip = hash->base; ip; ip = ip->next)

usr.sbin/makefs/hammer2/hammer2_inode.c

1862

tmp = ip->next;

usr.sbin/makefs/hammer2/hammer2_inode.c

1878

for (ip = hash->base; ip; ip = ip->next)

usr.sbin/makefs/hammer2/hammer2_inode.c

566

for (ip = hash->base; ip; ip = ip->next) {

usr.sbin/makefs/hammer2/hammer2_inode.c

631

xipp = &(*xipp)->next;

usr.sbin/makefs/hammer2/hammer2_inode.c

632

*xipp = ip->next;

usr.sbin/makefs/hammer2/hammer2_inode.c

633

ip->next = NULL;

usr.sbin/makefs/hammer2/hammer2_inode.c

970

xipp = &xip->next)

usr.sbin/makefs/hammer2/hammer2_inode.c

979

nip->next = NULL;

usr.sbin/makefs/hammer2/hammer2_io.c

830

for (dio = hash->base; dio; dio = dio->next) {

usr.sbin/makefs/hammer2/hammer2_io.c

860

for (xiop = &hash->base; (xio = *xiop) != NULL; xiop = &xio->next) {

usr.sbin/makefs/hammer2/hammer2_io.c

869

dio->next = NULL;

usr.sbin/makefs/hammer2/hammer2_io.c

908

diop = &dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

918

diop = &dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

922

*diop = dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

923

dio->next = NULL;

usr.sbin/makefs/hammer2/hammer2_io.c

925

cleanapp = &dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

938

cleanbase = dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

939

dio->next = NULL;

usr.sbin/makefs/hammer2/hammer2_io.c

967

hash->base = dio->next;

usr.sbin/makefs/hammer2/hammer2_io.c

968

dio->next = NULL;

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

131

state->lencode = state->distcode = state->next = state->codes;

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

256

static code *next;

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

264

next = fixed;

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

265

lenfix = next;

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

267

inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);

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

272

distfix = next;

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

274

inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);

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

413

next = strm->next_in; \

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

424

strm->next_in = next; \

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

443

hold += (unsigned long)(*next++) << bits; \

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

559

z_const unsigned char FAR *next; /* next input */

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

690

zmemcpy(put, next, copy);

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

692

next += copy;

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

727

state->next = state->codes;

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

728

state->lencode = (const code FAR *)(state->next);

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

730

ret = inflate_table(CODES, state->lens, 19, &(state->next),

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

801

state->next = state->codes;

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

802

state->lencode = (const code FAR *)(state->next);

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

804

ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),

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

811

state->distcode = (const code FAR *)(state->next);

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

814

&(state->next), &(state->distbits), state->work);

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

106

code FAR *next; /* next available space in codes[] */

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

201

next = *table; /* current table to fill in */

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

236

next[(huff >> drop) + fill] = here;

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

264

next += min; /* here min is 1 << curr */

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

286

(*table)[low].val = (unsigned short)(next - *table);

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

297

next[huff] = here;

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

52

code FAR *next; /* next available space in table */

usr.sbin/makefs/makefs.h

94

struct _fsnode *next; /* next */

usr.sbin/makefs/msdos.c

226

for (cur = root->next; cur != NULL; cur = cur->next) {

usr.sbin/makefs/mtree.c

103

SLIST_INSERT_HEAD(&mtree_fileinfo, fi, next);

usr.sbin/makefs/mtree.c

67

SLIST_ENTRY(mtree_fileinfo) next;

usr.sbin/makefs/mtree.c

924

node = last->next;

usr.sbin/makefs/mtree.c

944

last->next = node;

usr.sbin/makefs/mtree.c

953

last->next = NULL;

usr.sbin/makefs/walk.c

100

while (cur->next != NULL)

usr.sbin/makefs/walk.c

101

cur = cur->next;

usr.sbin/makefs/walk.c

139

cur = join->next;

usr.sbin/makefs/walk.c

147

cur = cur->next;

usr.sbin/makefs/walk.c

169

cur->next = first;

usr.sbin/makefs/walk.c

176

prev->next = cur;

usr.sbin/makefs/walk.c

213

for (cur = first->next; cur != NULL; cur = cur->next)

usr.sbin/makefs/walk.c

259

fsnode *cur, *next;

usr.sbin/makefs/walk.c

276

for (cur = node->first; cur->next; cur = cur->next) {

usr.sbin/makefs/walk.c

277

if (cur->next == node) {

usr.sbin/makefs/walk.c

278

cur->next = node->next;

usr.sbin/makefs/walk.c

279

node->next = NULL;

usr.sbin/makefs/walk.c

285

for (cur = node; cur != NULL; cur = next) {

usr.sbin/makefs/walk.c

286

next = cur->next;

usr.sbin/makefs/walk.c

370

fsnode *next;

usr.sbin/makefs/walk.c

372

for (curfsnode = dirnode->next; curfsnode != NULL; curfsnode = next) {

usr.sbin/makefs/walk.c

373

next = curfsnode->next;

usr.sbin/makefs/walk.c

375

curnode = curnode->next) {

usr.sbin/makefs/walk.c

390

curnode = curnode->next) {

usr.sbin/makefs/walk.c

394

for (curfsnode = dirnode->next; curfsnode != NULL;

usr.sbin/makefs/walk.c

395

curfsnode = curfsnode->next) {

usr.sbin/makefs/walk.c

451

curfsnode->next = dirnode->next;

usr.sbin/makefs/walk.c

452

dirnode->next = curfsnode;

usr.sbin/makefs/walk.c

570

for (cur = root; cur != NULL; cur = cur->next) {

usr.sbin/mtree/mtree.h

44

struct _node *prev, *next; /* left, right */

usr.sbin/mtree/only.c

51

struct hentry *next;

usr.sbin/mtree/only.c

74

for (e = table[*h]; e; e = e->next)

usr.sbin/mtree/only.c

93

e->next = table[h];

usr.sbin/mtree/spec.c

101

char *p, *e, *next;

usr.sbin/mtree/spec.c

128

next = buf;

usr.sbin/mtree/spec.c

129

while ((p = strsep(&next, " \t")) != NULL && *p == '\0')

usr.sbin/mtree/spec.c

136

set(next, &ginfo);

usr.sbin/mtree/spec.c

138

unset(next, &ginfo);

usr.sbin/mtree/spec.c

180

cur = cur->next;

usr.sbin/mtree/spec.c

203

set(next, centry);

usr.sbin/mtree/spec.c

258

NODE *cur, *next;

usr.sbin/mtree/spec.c

263

next = NULL;

usr.sbin/mtree/spec.c

264

for (cur = root; cur != NULL; cur = next) {

usr.sbin/mtree/spec.c

265

next = cur->next;

usr.sbin/mtree/spec.c

315

for (cur = root; cur != NULL; cur = cur->next) {

usr.sbin/mtree/spec.c

738

for (; cur != NULL; last = cur, cur = cur->next) {

usr.sbin/mtree/spec.c

793

centry->prev->next = centry->next;

usr.sbin/mtree/spec.c

796

pathparent->child = centry->next;

usr.sbin/mtree/spec.c

797

assert(centry->next != NULL);

usr.sbin/mtree/spec.c

799

if (centry->next)

usr.sbin/mtree/spec.c

800

centry->next->prev = centry->prev;

usr.sbin/mtree/spec.c

802

centry->next = NULL;

usr.sbin/mtree/spec.c

808

centry->next = pathparent->child;

usr.sbin/mtree/spec.c

813

centry->next = insertpos->next;

usr.sbin/mtree/spec.c

814

insertpos->next = centry;

usr.sbin/mtree/spec.c

816

if (centry->next)

usr.sbin/mtree/spec.c

817

centry->next->prev = centry;

usr.sbin/mtree/specspec.c

205

n1 = c1->next;

usr.sbin/mtree/specspec.c

207

n2 = c2->next;

usr.sbin/mtree/verify.c

111

for (ep = level; ep; ep = ep->next)

usr.sbin/mtree/verify.c

170

for (; p; p = p->next) {

usr.sbin/ndp/ndp.c

576

char *lim, *buf, *next;

usr.sbin/ndp/ndp.c

613

for (next = buf; next && next < lim; next += rtm->rtm_msglen) {

usr.sbin/ndp/ndp.c

616

rtm = (struct rt_msghdr *)next;

usr.sbin/pfctl/parse.y

1202

for (i = $3; i; i = i->next) {

usr.sbin/pfctl/parse.y

122

struct node_proto *next;

usr.sbin/pfctl/parse.y

1286

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

129

struct node_port *next;

usr.sbin/pfctl/parse.y

1353

nh = h->next;

usr.sbin/pfctl/parse.y

136

struct node_uid *next;

usr.sbin/pfctl/parse.y

1399

for (n = $3; n != NULL; n = n->next) {

usr.sbin/pfctl/parse.y

143

struct node_gid *next;

usr.sbin/pfctl/parse.y

151

struct node_icmp *next;

usr.sbin/pfctl/parse.y

186

struct node_state_opt *next;

usr.sbin/pfctl/parse.y

1873

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

1892

$$->next = NULL;

usr.sbin/pfctl/parse.y

1965

proto = proto->next)

usr.sbin/pfctl/parse.y

200

struct node_queue *next;

usr.sbin/pfctl/parse.y

2161

o = o->next;

usr.sbin/pfctl/parse.y

2242

PF_POOL_NONE && ($5.host->next != NULL ||

usr.sbin/pfctl/parse.y

2257

if ($5.host->next != NULL) {

usr.sbin/pfctl/parse.y

2334

$2->tail->next = filter_opts.uid;

usr.sbin/pfctl/parse.y

2339

$2->tail->next = filter_opts.gid;

usr.sbin/pfctl/parse.y

2622

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

2650

$$->next = NULL;

usr.sbin/pfctl/parse.y

2667

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

2685

$$->next = NULL;

usr.sbin/pfctl/parse.y

2740

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

2801

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

2811

for (n = $2; n != NULL; n = n->next)

usr.sbin/pfctl/parse.y

2820

$$->next = NULL;

usr.sbin/pfctl/parse.y

2829

$$->next = NULL;

usr.sbin/pfctl/parse.y

2861

b->next != NULL || b->not ||

usr.sbin/pfctl/parse.y

2862

e->next != NULL || e->not) {

usr.sbin/pfctl/parse.y

2915

for (n = $1; n != NULL; n = n->next)

usr.sbin/pfctl/parse.y

2933

$$->next = NULL;

usr.sbin/pfctl/parse.y

2952

$$->next = NULL;

usr.sbin/pfctl/parse.y

3021

$$->next = NULL;

usr.sbin/pfctl/parse.y

3032

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3048

$$->next = NULL;

usr.sbin/pfctl/parse.y

3063

$$->next = NULL;

usr.sbin/pfctl/parse.y

3078

$$->next = NULL;

usr.sbin/pfctl/parse.y

3107

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3120

$$->next = NULL;

usr.sbin/pfctl/parse.y

3135

$$->next = NULL;

usr.sbin/pfctl/parse.y

3150

$$->next = NULL;

usr.sbin/pfctl/parse.y

3185

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3198

$$->next = NULL;

usr.sbin/pfctl/parse.y

3213

$$->next = NULL;

usr.sbin/pfctl/parse.y

3228

$$->next = NULL;

usr.sbin/pfctl/parse.y

3283

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3291

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3304

$$->next = NULL;

usr.sbin/pfctl/parse.y

3323

$$->next = NULL;

usr.sbin/pfctl/parse.y

3337

$$->next = NULL;

usr.sbin/pfctl/parse.y

3349

$$->next = NULL;

usr.sbin/pfctl/parse.y

3368

$$->next = NULL;

usr.sbin/pfctl/parse.y

3382

$$->next = NULL;

usr.sbin/pfctl/parse.y

3499

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

3515

$$->next = NULL;

usr.sbin/pfctl/parse.y

3523

$$->next = NULL;

usr.sbin/pfctl/parse.y

3536

$$->next = NULL;

usr.sbin/pfctl/parse.y

3549

$$->next = NULL;

usr.sbin/pfctl/parse.y

3564

$$->next = NULL;

usr.sbin/pfctl/parse.y

3582

$$->next = NULL;

usr.sbin/pfctl/parse.y

3595

$$->next = NULL;

usr.sbin/pfctl/parse.y

3604

$$->next = NULL;

usr.sbin/pfctl/parse.y

3613

$$->next = NULL;

usr.sbin/pfctl/parse.y

3622

$$->next = NULL;

usr.sbin/pfctl/parse.y

3631

$$->next = NULL;

usr.sbin/pfctl/parse.y

3640

$$->next = NULL;

usr.sbin/pfctl/parse.y

3648

$$->next = NULL;

usr.sbin/pfctl/parse.y

3678

$$->next = NULL;

usr.sbin/pfctl/parse.y

3721

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

4003

PF_POOL_NONE && ($9->host->next != NULL ||

usr.sbin/pfctl/parse.y

4019

if ($9->host->next != NULL) {

usr.sbin/pfctl/parse.y

4148

if ($8->next) {

usr.sbin/pfctl/parse.y

4165

if ($9->next) {

usr.sbin/pfctl/parse.y

4197

if ($13->host->next != NULL) {

usr.sbin/pfctl/parse.y

4250

$$->next = NULL;

usr.sbin/pfctl/parse.y

4268

$1->tail->next = $3;

usr.sbin/pfctl/parse.y

4402

for (; h != NULL; h = h->next)

usr.sbin/pfctl/parse.y

4413

for (; h != NULL; h = h->next)

usr.sbin/pfctl/parse.y

4424

for (; h != NULL; h = h->next)

usr.sbin/pfctl/parse.y

4612

node = node->next; \

usr.sbin/pfctl/parse.y

4624

r->next = NULL; \

usr.sbin/pfctl/parse.y

4631

n = n->next; \

usr.sbin/pfctl/parse.y

4892

n->next = NULL;

usr.sbin/pfctl/parse.y

4897

queues->tail->next = n;

usr.sbin/pfctl/parse.y

4983

for (nq = nqueues; nq != NULL; nq = nq->next) {

usr.sbin/pfctl/parse.y

5007

n->next = NULL;

usr.sbin/pfctl/parse.y

5012

queues->tail->next = n;

usr.sbin/pfctl/parse.y

5192

for (h = rpool_hosts; h != NULL; h = h->next) {

usr.sbin/pfctl/parse.y

5238

if (!interfaces || (!interfaces->next && !interfaces->not &&

usr.sbin/pfctl/parse.y

5446

int c, next;

usr.sbin/pfctl/parse.y

5473

next = getc(file->stream);

usr.sbin/pfctl/parse.y

5474

if (next != '\n') {

usr.sbin/pfctl/parse.y

5475

c = next;

usr.sbin/pfctl/parse.y

5532

int quotec, next, c;

usr.sbin/pfctl/parse.y

5582

if ((next = lgetc(quotec)) == EOF)

usr.sbin/pfctl/parse.y

5584

if (next == quotec || c == ' ' || c == '\t')

usr.sbin/pfctl/parse.y

5585

c = next;

usr.sbin/pfctl/parse.y

5586

else if (next == '\n')

usr.sbin/pfctl/parse.y

5589

lungetc(next);

usr.sbin/pfctl/parse.y

5605

next = lgetc(0);

usr.sbin/pfctl/parse.y

5606

if (next == '>') {

usr.sbin/pfctl/parse.y

5610

lungetc(next);

usr.sbin/pfctl/parse.y

5613

next = lgetc(0);

usr.sbin/pfctl/parse.y

5614

if (next == '<') {

usr.sbin/pfctl/parse.y

5618

lungetc(next);

usr.sbin/pfctl/parse.y

5621

next = lgetc(0);

usr.sbin/pfctl/parse.y

5622

if (next == '>')

usr.sbin/pfctl/parse.y

5624

lungetc(next);

usr.sbin/pfctl/parse.y

5811

opt1->next = NULL;

usr.sbin/pfctl/parse.y

5815

opt2->next = NULL;

usr.sbin/pfctl/parse.y

5820

opt1->next = opt2;

usr.sbin/pfctl/parse.y

5948

while ((n = n->next) != NULL) {

usr.sbin/pfctl/parse.y

5964

struct node_host *next = n->next;

usr.sbin/pfctl/parse.y

5971

*nh = next;

usr.sbin/pfctl/parse.y

5973

prev->next = next;

usr.sbin/pfctl/parse.y

5978

n = next;

usr.sbin/pfctl/parse.y

5983

n = n->next;

usr.sbin/pfctl/parse.y

5995

for (n = nh; n != NULL; n = n->next) {

usr.sbin/pfctl/parse.y

856

proto = proto->next)

usr.sbin/pfctl/parse.y

940

if ($6.dst.port->next != NULL) {

usr.sbin/pfctl/parse.y

973

if ($5->next != NULL) {

usr.sbin/pfctl/pfctl_optimize.c

1008

struct pf_skip_step *sk, *next;

usr.sbin/pfctl/pfctl_optimize.c

1029

while ((next = TAILQ_NEXT(sk, ps_entry)) &&

usr.sbin/pfctl/pfctl_optimize.c

1030

next->ps_count > sk->ps_count) {

usr.sbin/pfctl/pfctl_optimize.c

1032

TAILQ_INSERT_AFTER(head, next, sk, ps_entry);

usr.sbin/pfctl/pfctl_optimize.c

1035

next = TAILQ_NEXT(sk, ps_entry);

usr.sbin/pfctl/pfctl_optimize.c

1036

assert(next == NULL || next->ps_count <= sk->ps_count);

usr.sbin/pfctl/pfctl_parser.c

1054

for (h = ti->host; h != NULL; h = h->next) {

usr.sbin/pfctl/pfctl_parser.c

1117

for (n = h; n != NULL; n = n->next) {

usr.sbin/pfctl/pfctl_parser.c

1210

n->next = NULL;

usr.sbin/pfctl/pfctl_parser.c

1215

h->tail->next = n;

usr.sbin/pfctl/pfctl_parser.c

1250

for (n = iftab; n; n = n->next) {

usr.sbin/pfctl/pfctl_parser.c

1290

h->tail->next = n;

usr.sbin/pfctl/pfctl_parser.c

1316

for (p = iftab; p; p = p->next) {

usr.sbin/pfctl/pfctl_parser.c

1372

n->next = NULL;

usr.sbin/pfctl/pfctl_parser.c

1377

h->tail->next = n;

usr.sbin/pfctl/pfctl_parser.c

1493

for (n = h; n != NULL && mask > -1; n = n->next)

usr.sbin/pfctl/pfctl_parser.c

1524

h->next = NULL;

usr.sbin/pfctl/pfctl_parser.c

1553

h->next = NULL;

usr.sbin/pfctl/pfctl_parser.c

1620

n->next = NULL;

usr.sbin/pfctl/pfctl_parser.c

1625

h->tail->next = n;

usr.sbin/pfctl/pfctl_parser.c

1656

n = n->next;

usr.sbin/pfctl/pfctl_parser.c

1700

} while ((n = n->next) != NULL);

usr.sbin/pfctl/pfctl_parser.h

108

struct node_if *next;

usr.sbin/pfctl/pfctl_parser.h

121

struct node_host *next;

usr.sbin/pfctl/pfctl_parser.h

128

struct node_os *next;

usr.sbin/pfctl/pfctl_qstats.c

112

for (node = root; node != NULL; node = node->next) {

usr.sbin/pfctl/pfctl_qstats.c

187

node->next = node->children = NULL;

usr.sbin/pfctl/pfctl_qstats.c

194

while (prev->next != NULL)

usr.sbin/pfctl/pfctl_qstats.c

195

prev = prev->next;

usr.sbin/pfctl/pfctl_qstats.c

196

prev->next = node;

usr.sbin/pfctl/pfctl_qstats.c

208

while (prev->next != NULL)

usr.sbin/pfctl/pfctl_qstats.c

209

prev = prev->next;

usr.sbin/pfctl/pfctl_qstats.c

210

prev->next = node;

usr.sbin/pfctl/pfctl_qstats.c

222

for (node = root; node != NULL; node = node->next) {

usr.sbin/pfctl/pfctl_qstats.c

250

child = child->next) {

usr.sbin/pfctl/pfctl_qstats.c

252

if (child->next != NULL)

usr.sbin/pfctl/pfctl_qstats.c

268

child = child->next)

usr.sbin/pfctl/pfctl_qstats.c

385

node = node->next;

usr.sbin/pfctl/pfctl_qstats.c

64

struct pf_altq_node *next;

usr.sbin/pfctl/pfctl_qstats.c

96

for (node = root; node != NULL; node = node->next) {

usr.sbin/ppp/bundle.c

1007

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1010

} else if (bundle->links && !bundle->links->next)

usr.sbin/ppp/bundle.c

1024

for (dl = arg->bundle->links; dl; dl = dl->next) {

usr.sbin/ppp/bundle.c

1267

for (dlp = &bundle->links; *dlp; dlp = &(*dlp)->next)

usr.sbin/ppp/bundle.c

1269

*dlp = dl->next;

usr.sbin/ppp/bundle.c

1270

dl->next = NULL;

usr.sbin/ppp/bundle.c

1284

dlp = &(*dlp)->next;

usr.sbin/ppp/bundle.c

1287

dl->next = NULL;

usr.sbin/ppp/bundle.c

1306

dlp = &(*dlp)->next;

usr.sbin/ppp/bundle.c

1667

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1769

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1781

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1829

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1841

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1881

for (dl = bundle->links; dl; dl = dl->next) {

usr.sbin/ppp/bundle.c

1936

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

1979

for (autolink = opened = 0, dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

220

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

250

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

337

for (dl = bundle->links; dl; dl = dl->next) {

usr.sbin/ppp/bundle.c

377

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

401

for (dl = bundle->links; dl; dl = dl->next) {

usr.sbin/ppp/bundle.c

433

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

446

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

462

for (nlinks = 0, dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

497

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

516

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

542

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

655

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/bundle.c

958

for (odl = bundle->links; odl; odl = odl->next)

usr.sbin/ppp/bundle.c

984

for (dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/cbcp.c

260

char list[sizeof cbcp->fsm.phone], *next;

usr.sbin/ppp/cbcp.c

282

for (next = strtok(list, ","); next; next = strtok(NULL, ",")) {

usr.sbin/ppp/cbcp.c

283

len = strlen(next);

usr.sbin/ppp/cbcp.c

287

strcpy(addr->addr, next);

usr.sbin/ppp/cbcp.c

291

next);

usr.sbin/ppp/cbcp.c

426

char list[sizeof cbcp->fsm.phone], *next;

usr.sbin/ppp/cbcp.c

430

for (next = strtok(list, ","); next; next = strtok(NULL, ","))

usr.sbin/ppp/cbcp.c

431

if (!strcmp(next, addr->addr)) {

usr.sbin/ppp/cbcp.c

433

strcpy(cbcp->fsm.phone, next);

usr.sbin/ppp/cbcp.c

447

char list[sizeof cbcp->fsm.phone], *next, *end;

usr.sbin/ppp/cbcp.c

456

for (next = strtok(list, ","); next; next = strtok(NULL, ","))

usr.sbin/ppp/cbcp.c

457

if (!strcmp(next, addr->addr)) {

usr.sbin/ppp/cbcp.c

459

strcpy(cbcp->fsm.phone, next);

usr.sbin/ppp/cbcp.c

551

char list[sizeof cbcp->fsm.phone], *next;

usr.sbin/ppp/cbcp.c

555

for (next = strtok(list, ","); next; next = strtok(NULL, ","))

usr.sbin/ppp/cbcp.c

556

if (!strcmp(addr->addr, next)) {

usr.sbin/ppp/cbcp.c

557

strcpy(cbcp->fsm.phone, next);

usr.sbin/ppp/ccp.c

187

o = &(*o)->next;

usr.sbin/ppp/ccp.c

364

for (o = &ccp->out.opt; *o != NULL; o = &(*o)->next)

usr.sbin/ppp/ccp.c

372

(*o)->next = NULL;

usr.sbin/ppp/ccp.c

388

o = &(*o)->next;

usr.sbin/ppp/ccp.c

443

struct ccp_opt *next;

usr.sbin/ppp/ccp.c

459

next = ccp->out.opt->next;

usr.sbin/ppp/ccp.c

461

ccp->out.opt = next;

usr.sbin/ppp/ccp.c

471

struct ccp_opt *next;

usr.sbin/ppp/ccp.c

480

next = ccp->out.opt->next;

usr.sbin/ppp/ccp.c

482

ccp->out.opt = next;

usr.sbin/ppp/ccp.c

537

o = &(*o)->next;

usr.sbin/ppp/ccp.c

622

for (o = ccp->out.opt; o != NULL; o = o->next)

usr.sbin/ppp/ccp.h

87

struct ccp_opt *next;

usr.sbin/ppp/command.c

1980

cx->phone.alt = cx->phone.next = NULL;

usr.sbin/ppp/command.c

2603

dl = cx->next;

usr.sbin/ppp/command.c

2606

for (cx = arg->bundle->links; cx; cx = cx->next)

usr.sbin/ppp/datalink.c

1309

for (cdl = bundle->links; cdl; cdl = cdl->next)

usr.sbin/ppp/datalink.c

133

dl->phone.alt = dl->phone.next = NULL;

usr.sbin/ppp/datalink.c

1336

dl->phone.next = NULL;

usr.sbin/ppp/datalink.c

1341

dl->next = NULL;

usr.sbin/ppp/datalink.c

178

if (dl->phone.next == NULL)

usr.sbin/ppp/datalink.c

193

if (dl->phone.next == NULL) {

usr.sbin/ppp/datalink.c

198

dl->phone.next = dl->phone.list;

usr.sbin/ppp/datalink.c

200

dl->phone.alt = strsep(&dl->phone.next, ":");

usr.sbin/ppp/datalink.c

813

dl->phone.next = NULL;

usr.sbin/ppp/datalink.c

822

dl->next = NULL;

usr.sbin/ppp/datalink.c

890

dl->phone.next = NULL;

usr.sbin/ppp/datalink.c

894

dl->next = NULL;

usr.sbin/ppp/datalink.c

953

result = dl->next;

usr.sbin/ppp/datalink.h

123

struct datalink *next; /* Next in the list */

usr.sbin/ppp/datalink.h

95

char *next; /* Next phone from the list */

usr.sbin/ppp/lcp.c

600

char list[sizeof cb->msg], *next;

usr.sbin/ppp/lcp.c

608

for (next = strtok(list, ","); next; next = strtok(NULL, ",")) {

usr.sbin/ppp/lcp.c

609

len = strlen(next);

usr.sbin/ppp/link.c

253

struct mbuf *bp, *lbp[LAYER_MAX], *next;

usr.sbin/ppp/link.c

293

next = bp->m_nextpkt;

usr.sbin/ppp/link.c

297

bp = next;

usr.sbin/ppp/log.c

111

for (p = promptlist; p; p = p->next)

usr.sbin/ppp/log.c

130

for (p = &promptlist; *p; p = &(*p)->next)

usr.sbin/ppp/log.c

132

*p = prompt->next;

usr.sbin/ppp/log.c

133

prompt->next = NULL;

usr.sbin/ppp/log.c

149

pn = p->next;

usr.sbin/ppp/log.c

152

pl->next = p->next;

usr.sbin/ppp/log.c

154

promptlist = p->next;

usr.sbin/ppp/log.c

155

p->next = NULL;

usr.sbin/ppp/log.c

168

for (p = promptlist; p; p = p->next)

usr.sbin/ppp/log.c

179

for (p = promptlist; p; p = p->next)

usr.sbin/ppp/log.c

190

for (p = promptlist; p; p = p->next)

usr.sbin/ppp/log.c

332

else for (prompt = promptlist; prompt; prompt = prompt->next)

usr.sbin/ppp/log.c

512

for (p = promptlist; p; p = p->next) {

usr.sbin/ppp/log.c

92

prompt->next = promptlist;

usr.sbin/ppp/mbuf.c

129

*mb = (*mb)->u.f.next;

usr.sbin/ppp/mbuf.c

133

(*mb)->u.f.next = NULL;

usr.sbin/ppp/mbuf.c

149

(*mb)->u.f.next = NULL;

usr.sbin/ppp/mbuf.c

177

f->u.f.next = *mb;

usr.sbin/ppp/mbuf.c

55

struct mbucket *next;

usr.sbin/ppp/mp.c

385

struct mbuf *next;

usr.sbin/ppp/mp.c

398

next = mp->inbufs->m_nextpkt;

usr.sbin/ppp/mp.c

400

mp->inbufs = next;

usr.sbin/ppp/mp.c

447

for (dl = mp->bundle->links; dl; dl = dl->next)

usr.sbin/ppp/mp.c

492

struct mbuf *next;

usr.sbin/ppp/mp.c

497

next = mp->inbufs->m_nextpkt;

usr.sbin/ppp/mp.c

499

mp->inbufs = next;

usr.sbin/ppp/mp.c

514

next = mp->inbufs->m_nextpkt;

usr.sbin/ppp/mp.c

517

mp->inbufs = next;

usr.sbin/ppp/mp.c

678

for (fdl = NULL, dl = bundle->links; dl; dl = dl->next) {

usr.sbin/ppp/mp.c

699

for (dl = fdl; nlinks > 0; dl = dl->next, nlinks--, thislink++) {

usr.sbin/ppp/mp.c

789

dl = dl->next;

usr.sbin/ppp/ncp.c

311

for (total = 0, dl = bundle->links; dl; dl = dl->next)

usr.sbin/ppp/prompt.h

59

struct prompt *next; /* Maintained in log.c */

usr.sbin/ppp/route.c

550

for (; r; r = r->next) {

usr.sbin/ppp/route.c

611

*rp = r->next;

usr.sbin/ppp/route.c

613

rp = &(*rp)->next;

usr.sbin/ppp/route.c

619

r->next = NULL;

usr.sbin/ppp/route.c

631

for (; *rp; rp = &(*rp)->next) {

usr.sbin/ppp/route.c

635

*rp = r->next;

usr.sbin/ppp/route.c

648

rn = r->next;

usr.sbin/ppp/route.c

665

for (; r; r = r->next) {

usr.sbin/ppp/route.h

50

struct sticky_route *next; /* next in list */

usr.sbin/ppp/server.c

187

for (p = log_PromptList(); p; p = p->next)

usr.sbin/ppp/server.c

67

for (p = log_PromptList(); p; p = p->next)

usr.sbin/ppp/server.c

82

for (p = log_PromptList(); p; p = p->next)

usr.sbin/ppp/timer.c

105

for (t = TimerList; t; t = t->next) {

usr.sbin/ppp/timer.c

122

tp->next = t;

usr.sbin/ppp/timer.c

124

pt->next = tp;

usr.sbin/ppp/timer.c

150

for (t = TimerList; t != tp && t != NULL; t = t->next)

usr.sbin/ppp/timer.c

155

pt->next = t->next;

usr.sbin/ppp/timer.c

157

TimerList = t->next;

usr.sbin/ppp/timer.c

161

if (t->next) {

usr.sbin/ppp/timer.c

168

t->next->rest += t->rest;

usr.sbin/ppp/timer.c

187

tp->next = tp->enext = NULL;

usr.sbin/ppp/timer.c

194

struct pppTimer *tp, *exp, *next;

usr.sbin/ppp/timer.c

213

next = tp->next;

usr.sbin/ppp/timer.c

216

tp = next;

usr.sbin/ppp/timer.c

257

for (pt = TimerList; pt; pt = pt->next) {

usr.sbin/ppp/timer.h

42

struct pppTimer *next; /* Link to next timer */

usr.sbin/pppctl/pppctl.c

206

char *DoneWord = "x", *next, *start;

usr.sbin/pppctl/pppctl.c

433

next = strchr(start, ';');

usr.sbin/pppctl/pppctl.c

436

if (next)

usr.sbin/pppctl/pppctl.c

437

*next = '\0';

usr.sbin/pppctl/pppctl.c

448

if (next)

usr.sbin/pppctl/pppctl.c

449

start = ++next;

usr.sbin/pppctl/pppctl.c

450

} while (next && *next);

usr.sbin/pstat/pstat.c

583

struct mtab *next;

usr.sbin/pstat/pstat.c

589

for (mt = mhead; mt != NULL; mt = mt->next)

usr.sbin/pstat/pstat.c

596

mt->next = mhead;

usr.sbin/pw/pw_group.c

84

gid_t next = gr_gidpolicy(cnf, args);

usr.sbin/pw/pw_group.c

86

return next;

usr.sbin/pw/pw_group.c

87

printf("%ld\n", (long)next);

usr.sbin/pw/pw_user.c

130

uid_t next = pw_uidpolicy(cnf, args);

usr.sbin/pw/pw_user.c

132

return next;

usr.sbin/pw/pw_user.c

133

printf("%ld:", (long)next);

usr.sbin/rpc.statd/procs.c

120

lp->next = hp->monList;

usr.sbin/rpc.statd/procs.c

143

MonList *lp, *next;

usr.sbin/rpc.statd/procs.c

155

next = lp->next;

usr.sbin/rpc.statd/procs.c

156

if (last) last->next = next;

usr.sbin/rpc.statd/procs.c

157

else hp->monList = next;

usr.sbin/rpc.statd/procs.c

159

lp = next;

usr.sbin/rpc.statd/procs.c

165

lp = lp->next;

usr.sbin/rpc.statd/procs.c

354

lp = lp->next;

usr.sbin/rpc.statd/statd.h

66

struct MonList_s *next; /* Next in list or NULL */

usr.sbin/rpcbind/check_bound.c

119

fdl->next = NULL;

usr.sbin/rpcbind/check_bound.c

124

fdtail->next = fdl;

usr.sbin/rpcbind/check_bound.c

138

for (fdl = fdhead; fdl; fdl = fdl->next)

usr.sbin/rpcbind/check_bound.c

157

for (fdl = fdhead; fdl; fdl = fdl->next)

usr.sbin/rpcbind/check_bound.c

217

for (fdl = fdhead; fdl; fdl = fdl->next)

usr.sbin/rpcbind/check_bound.c

58

struct fdlist *next;

usr.sbin/rpcbind/rpcb_stat.c

111

for (al = inf[rtype].addrinfo; al; al = al->next) {

usr.sbin/rpcbind/rpcb_stat.c

142

al->next = inf[rtype].addrinfo;

usr.sbin/rpcbind/rpcb_stat.c

155

for (rl = inf[rtype].rmtinfo; rl; rl = rl->next) {

usr.sbin/rpcbind/rpcb_stat.c

194

rl->next = inf[rtype].rmtinfo;

usr.sbin/rpcbind/rpcb_svc_com.c

520

rmt->next = NULL;

usr.sbin/rpcbind/rpcb_svc_com.c

525

rmttail->next = rmt;

usr.sbin/rpcbind/rpcb_svc_com.c

540

for (rmt = rmthead; rmt != NULL; rmt = rmt->next) {

usr.sbin/rpcbind/rpcb_svc_com.c

553

for (rmt = rmthead; rmt != NULL; rmt = rmt->next) {

usr.sbin/rpcbind/rpcb_svc_com.c

74

struct rmtcallfd_list *next;

usr.sbin/rtadvd/dump.c

112

for (rai = ralist; rai; rai = rai->next) {

usr.sbin/rtadvd/dump.c

175

for (first = 1, pfx = rai->prefix.next; pfx != &rai->prefix;

usr.sbin/rtadvd/dump.c

176

pfx = pfx->next) {

usr.sbin/rtadvd/rrenum.c

340

goto next;

usr.sbin/rtadvd/rrenum.c

343

next:

usr.sbin/rtadvd/rtadvd.c

465

char msg[2048], *next, *lim;

usr.sbin/rtadvd/rtadvd.c

502

for (next = msg; next < lim; next += len) {

usr.sbin/rtadvd/rtadvd.c

505

next = get_next_msg(next, lim, 0, &len,

usr.sbin/rtadvd/rtadvd.c

514

type = ((struct rt_msghdr *)next)->rtm_type;

usr.sbin/rtadvd/rtadvd.c

518

ifindex = get_rtm_ifindex(next);

usr.sbin/rtadvd/rtadvd.c

522

ifindex = (int)((struct ifa_msghdr *)next)->ifam_index;

usr.sbin/rtadvd/rtadvd.c

525

ifindex = (int)((struct if_msghdr *)next)->ifm_index;

usr.sbin/rtadvd/rtadvd.c

528

ifan = (struct if_announcemsghdr *)next;

usr.sbin/rtsold/dump.c

67

for (ifinfo = iflist; ifinfo; ifinfo = ifinfo->next) {

usr.sbin/rtsold/if.c

252

char *buf, *next, *lim;

usr.sbin/rtsold/if.c

268

for (next = buf; next < lim; next += ifm->ifm_msglen) {

usr.sbin/rtsold/if.c

269

ifm = (struct if_msghdr *)next;

usr.sbin/rtsold/if.c

287

if (next == lim) {

usr.sbin/rtsold/rtsock.c

100

if (lim - next < lenlim)

usr.sbin/rtsold/rtsock.c

87

char *lim, *next;

usr.sbin/rtsold/rtsock.c

98

for (next = msg; next < lim; next += len) {

usr.sbin/rtsold/rtsock.c

99

rtm = (struct rt_msghdr *)next;

usr.sbin/rtsold/rtsold.c

292

for (ifi = iflist; ifi; ifi = ifi->next) {

usr.sbin/rtsold/rtsold.c

379

ifinfo->next = iflist;

usr.sbin/rtsold/rtsold.c

398

for (ifi = iflist; ifi; ifi = ifi->next) {

usr.sbin/rtsold/rtsold.c

403

prev->next = ifi->next;

usr.sbin/rtsold/rtsold.c

422

for (ifi = iflist; ifi; ifi = ifi->next)

usr.sbin/rtsold/rtsold.c

479

for (ifinfo = iflist; ifinfo; ifinfo = ifinfo->next) {

usr.sbin/rtsold/rtsold.h

36

struct ifinfo *next; /* pointer to the next interface */

usr.sbin/rwhod/rwhod.c

173

struct timeval next = { .tv_sec = 0 }, now;

usr.sbin/rwhod/rwhod.c

277

timeadd(&now, delta, &next);

usr.sbin/rwhod/rwhod.c

297

if (now.tv_sec > next.tv_sec) {

usr.sbin/rwhod/rwhod.c

299

timeadd(&now, delta, &next);

usr.sbin/rwhod/rwhod.c

306

timeadd(struct timeval *now, time_t delta, struct timeval *next)

usr.sbin/rwhod/rwhod.c

308

(next)->tv_sec = (now)->tv_sec + delta;

usr.sbin/rwhod/rwhod.c

564

char *buf, *lim, *next;

usr.sbin/rwhod/rwhod.c

611

for (next = buf; next < lim; next += ifm->ifm_msglen) {

usr.sbin/rwhod/rwhod.c

612

ifm = (struct if_msghdr *)next;

usr.sbin/sa/pdb.c

247

goto next;

usr.sbin/sa/pdb.c

253

goto next;

usr.sbin/sa/pdb.c

259

next: rv = DB_SEQ(pacct_db, &key, &data, R_NEXT);

usr.sbin/sensorsd/sensorsd.c

251

struct sdlim_t *sdlim, *next;

usr.sbin/sensorsd/sensorsd.c

278

next = TAILQ_NEXT(sdlim, entries);

usr.sbin/sensorsd/sensorsd.c

283

sdlim = next;

usr.sbin/sensorsd/sensorsd.c

292

next = TAILQ_NEXT(sdlim, entries);

usr.sbin/sensorsd/sensorsd.c

297

sdlim = next;

usr.sbin/sensorsd/sensorsd.c

300

next = create_sdlim(&sensordev);

usr.sbin/sensorsd/sensorsd.c

303

TAILQ_INSERT_BEFORE(sdlim, next, entries);

usr.sbin/sensorsd/sensorsd.c

305

TAILQ_INSERT_TAIL(&sdlims, next, entries);

usr.sbin/sensorsd/sensorsd.c

306

syslog(LOG_INFO, "%s has appeared", next->dxname);

usr.sbin/sensorsd/sensorsd.c

307

sdlim = next;

usr.sbin/sensorsd/sensorsd.c

316

(next = TAILQ_NEXT(sdlim, entries)) != NULL;

usr.sbin/sensorsd/sensorsd.c

317

sdlim = next)

usr.sbin/sensorsd/sensorsd.c

318

if (sdlim->dev > next->dev)

usr.sbin/sshlockout/sshlockout.c

420

ip->next = NULL;

usr.sbin/sshlockout/sshlockout.c

422

hist_tail = &ip->next;

usr.sbin/sshlockout/sshlockout.c

462

scanp = &scan->next;

usr.sbin/sshlockout/sshlockout.c

464

*scanp = ip->next;

usr.sbin/sshlockout/sshlockout.c

465

if (hist_tail == &ip->next)

usr.sbin/sshlockout/sshlockout.c

71

struct iphist *next;

usr.sbin/syslogd/syslogd.c

123

STAILQ_ENTRY(funix) next;

usr.sbin/syslogd/syslogd.c

131

&(funix_secure.next.stqe_next) };

usr.sbin/syslogd/syslogd.c

1513

STAILQ_FOREACH(fx, &funixes, next)

usr.sbin/syslogd/syslogd.c

1528

struct filed *f, *next, **nextp;

usr.sbin/syslogd/syslogd.c

1558

for (f = Files; f != NULL; f = next) {

usr.sbin/syslogd/syslogd.c

1579

next = f->f_next;

usr.sbin/syslogd/syslogd.c

2049

dq_t q, next;

usr.sbin/syslogd/syslogd.c

2070

for (q = TAILQ_FIRST(&deadq_head); q != NULL; q = next) {

usr.sbin/syslogd/syslogd.c

2071

next = TAILQ_NEXT(q, dq_entries);

usr.sbin/syslogd/syslogd.c

421

STAILQ_INSERT_TAIL(&funixes, fx, next);

usr.sbin/syslogd/syslogd.c

517

STAILQ_FOREACH_MUTABLE(fx, &funixes, next, fx1) {

usr.sbin/syslogd/syslogd.c

533

STAILQ_REMOVE(&funixes, fx, funix, next);

usr.sbin/syslogd/syslogd.c

588

STAILQ_FOREACH(fx, &funixes, next)

usr.sbin/syslogd/syslogd.c

614

STAILQ_FOREACH(fx, &funixes, next)

usr.sbin/syslogd/syslogd.c

654

STAILQ_FOREACH(fx, &funixes, next) {

usr.sbin/syslogd/syslogd.c

854

char prev, next;

usr.sbin/syslogd/syslogd.c

877

next = *(s + strlen (name));

usr.sbin/syslogd/syslogd.c

879

if (prev == ',' && (next == '\0' || next == ','))

usr.sbin/sysvipcd/shmd.c

185

msgq->msgmaps[i-1].next = i;

usr.sbin/sysvipcd/shmd.c

186

msgq->msgmaps[i].next = -1; /* implies entry is available */

usr.sbin/usbdump/usbdump.c

569

uint8_t *next;

usr.sbin/usbdump/usbdump.c

573

for (ptr = data; ptr < (data + datalen); ptr = next) {

usr.sbin/usbdump/usbdump.c

597

next = ptr + BPF_WORDALIGN(hdrlen + caplen);

usr.sbin/usbdump/usbdump.c

599

if (next <= ptr)

usr.sbin/usbdump/usbdump.c

609

uint8_t *next;

usr.sbin/usbdump/usbdump.c

611

for (ptr = data; ptr < (data + datalen); ptr = next) {

usr.sbin/usbdump/usbdump.c

624

next = ptr + roundup2(temp.hdrlen + temp.caplen, temp.align);

usr.sbin/usbdump/usbdump.c

626

if (next <= ptr)

usr.sbin/ypbind/ypbind.c

381

struct _dom_binding *ypdb, *next;

usr.sbin/ypbind/ypbind.c

482

for (ypdb = ypbindlist; ypdb; ypdb = next) {

usr.sbin/ypbind/ypbind.c

483

next = ypdb->dom_pnext;

usr.sbin/yppush/yppush_main.c

118

job = job->next;

usr.sbin/yppush/yppush_main.c

177

jptr = jptr->next;

usr.sbin/yppush/yppush_main.c

203

jptr = jptr->next;

usr.sbin/yppush/yppush_main.c

405

job->next = yppush_joblist;

usr.sbin/yppush/yppush_main.c

485

struct hostlist *next;

usr.sbin/yppush/yppush_main.c

509

tmp->next = yppush_hostlist;

usr.sbin/yppush/yppush_main.c

600

tmp = tmp->next;

usr.sbin/yppush/yppush_main.c

79

struct jobs *next;

usr.sbin/ypserv/yp_access.c

115

tmp = securenets->next;

usr.sbin/ypserv/yp_access.c

127

securenets->next = NULL;

usr.sbin/ypserv/yp_access.c

163

tmp->next = securenets;

usr.sbin/ypserv/yp_access.c

277

tmp = tmp->next;

usr.sbin/ypserv/yp_access.c

89

struct securenet *next;

usr.sbin/ypserv/yp_server.c

663

struct ypmaplist *next;

usr.sbin/ypserv/yp_server.c

666

next = yp_maplist->next;

usr.sbin/ypserv/yp_server.c

669

yp_maplist = next;

usr.sbin/ypserv/yp_server.c

713

cur->next = yp_maplist;