bin/ksh/c_ksh.c
1403
int rv = 0, macro = 0, list = 0;
bin/ksh/c_ksh.c
1410
list = 1;
bin/ksh/c_ksh.c
1421
rv = x_bind(NULL, NULL, 0, list);
bin/ksh/emacs.c
1380
x_bind(a1, a2, macro, list)
bin/ksh/emacs.c
1383
int list; /* bind -l */
bin/ksh/emacs.c
1396
if (list) {
bin/ksh/syn.c
429
struct op *list;
bin/ksh/syn.c
443
list = c_list(true);
bin/ksh/syn.c
445
return list;
bin/ls/ls.c
492
display(FTSENT *p, FTSENT *list)
bin/ls/ls.c
519
if (list == NULL)
bin/ls/ls.c
529
for (cur = list, entries = 0; cur; cur = cur->fts_link) {
bin/ls/ls.c
626
d.list = list;
bin/ls/ls.c
676
for (cur = list; cur; cur = cur->fts_link)
bin/ls/ls.h
62
FTSENT *list;
bin/ls/print.c
120
for (p = dp->list; p; p = p->fts_link) {
bin/ls/print.c
141
for (p = dp->list; p; p = p->fts_link) {
bin/ls/print.c
257
for (p = dp->list, num = 0; p; p = p->fts_link)
bin/ls/print.c
312
for (p = dp->list; p; p = p->fts_link) {
bin/ls/print.c
347
for (col = 0, p = dp->list; p != NULL; p = p->fts_link) {
bin/ls/print.c
441
if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) {
bin/pax/extern.h
89
int list(void);
bin/pax/pax.c
332
rval = list();
bin/pax/tables.c
752
pt->list = NULL;
bin/pax/tables.c
802
for (dpt = pt->list; dpt != NULL; dpt = dpt->fow)
bin/pax/tables.c
843
dpt->fow = pt->list;
bin/pax/tables.c
844
pt->list = dpt;
bin/pax/tables.c
875
dpt->fow = pt->list;
bin/pax/tables.c
876
pt->list = dpt;
bin/pax/tables.h
126
struct dlist *list; /* map list based on inode truncation bits */
bin/ps/keyword.c
347
varlist_find(struct varlist *list, const char *name)
bin/ps/keyword.c
351
SIMPLEQ_FOREACH(vent, list, next) {
bin/sh/eval.c
1017
for (sp = varlist.list; sp; sp = sp->next)
bin/sh/eval.c
1175
listmklocal(varlist.list,
bin/sh/eval.c
1312
listmklocal(varlist.list, VDOEXPORT | VEXPORT);
bin/sh/eval.c
1466
cmdenviron = varlist.list;
bin/sh/eval.c
1468
listsetvar(varlist.list,
bin/sh/eval.c
1528
for (sp = varlist.list ; sp ; sp = sp->next)
bin/sh/eval.c
462
arglist.lastp = &arglist.list;
bin/sh/eval.c
471
for (sp = arglist.list ; sp ; sp = sp->next) {
bin/sh/eval.c
516
arglist.lastp = &arglist.list;
bin/sh/eval.c
522
if (casematch(patp, arglist.list->text)) {
bin/sh/eval.c
605
fn.lastp = &fn.list;
bin/sh/eval.c
613
redir->nfile.expfname = fn.list->text;
bin/sh/eval.c
619
fixredir(redir, fn.list->text, 1);
bin/sh/eval.c
918
arglist.lastp = &arglist.list;
bin/sh/eval.c
933
varlist.lastp = &varlist.list;
bin/sh/eval.c
944
for (sp = arglist.list ; sp ; sp = sp->next)
bin/sh/eval.c
948
for (sp = arglist.list ; sp ; sp = sp->next) {
bin/sh/eval.c
964
for (sp = varlist.list ; sp ; sp = sp->next) {
bin/sh/eval.c
986
for (sp = arglist.list ; sp ; sp = sp->next) {
bin/sh/expand.c
1881
msort(struct strlist *list, int len)
bin/sh/expand.c
1889
return list;
bin/sh/expand.c
1891
p = list;
bin/sh/expand.c
1897
q = msort(list, half); /* sort first half of list */
bin/sh/expand.c
1899
lpp = &list;
bin/sh/expand.c
1917
return list;
bin/sh/expand.c
211
exparg.lastp = &exparg.list;
bin/sh/expand.c
218
exparg.lastp = &exparg.list;
bin/sh/expand.c
220
expandmeta(exparg.list, flag);
bin/sh/expand.c
222
add_args(exparg.list);
bin/sh/expand.c
237
if (exparg.list) {
bin/sh/expand.c
238
*arglist->lastp = exparg.list;
bin/sh/expand.h
46
struct strlist *list;
bin/sh/parser.c
110
STATIC union node *list(int);
bin/sh/parser.c
1531
n = list(0);
bin/sh/parser.c
172
n = list(1);
bin/sh/parser.c
377
n1->nif.test = list(0);
bin/sh/parser.c
379
n1->nif.ifpart = list(0);
bin/sh/parser.c
385
n2->nif.test = list(0);
bin/sh/parser.c
387
n2->nif.ifpart = list(0);
bin/sh/parser.c
390
n2->nif.elsepart = list(0);
bin/sh/parser.c
402
n1->nbinary.ch1 = list(0);
bin/sh/parser.c
404
n1->nbinary.ch2 = list(0);
bin/sh/parser.c
455
n1->nfor.body = list(0);
bin/sh/parser.c
506
cp->nclist.body = list(0);
bin/sh/parser.c
527
n1->nredir.n = list(0);
bin/sh/parser.c
535
n1 = list(0);
bin/sh/var.c
644
listsetvar(struct strlist *list, int flags)
bin/sh/var.c
649
for (lp = list ; lp ; lp = lp->next) {
bin/sh/var.c
656
listmklocal(struct strlist *list, int flags)
bin/sh/var.c
660
for (lp = list ; lp ; lp = lp->next)
bin/sh/var.c
964
static struct var **list; /* static in case we are interrupted */
bin/sh/var.c
968
if (!list) {
bin/sh/var.c
970
list = ckmalloc(list_len * sizeof *list);
bin/sh/var.c
980
list = ckrealloc(list,
bin/sh/var.c
981
(list_len << 1) * sizeof *list);
bin/sh/var.c
984
list[count++] = vp;
bin/sh/var.c
988
qsort(list, count, sizeof *list, sort_var);
bin/sh/var.c
990
for (vpp = list; count--; vpp++)
common/dist/zlib/examples/gzappend.c
123
local void rotate(unsigned char *list, unsigned len, unsigned rot)
common/dist/zlib/examples/gzappend.c
135
last = list + (len - 1);
common/dist/zlib/examples/gzappend.c
139
tmp = *list;
common/dist/zlib/examples/gzappend.c
140
memmove(list, list + 1, len - 1);
common/dist/zlib/examples/gzappend.c
148
memmove(list + 1, list, len - 1);
common/dist/zlib/examples/gzappend.c
149
*list = tmp;
common/dist/zlib/examples/gzappend.c
156
start = from = list + cycles; /* start index is arbitrary */
common/dist/zlib/examples/zran.c
102
point_t *next = (point_t *)(index->list) + index->have++;
common/dist/zlib/examples/zran.c
140
index->list = NULL;
common/dist/zlib/examples/zran.c
340
if (index == NULL || index->have < 1 || index->list[0].out != 0 ||
common/dist/zlib/examples/zran.c
350
point_t *point = index->list;
common/dist/zlib/examples/zran.c
77
free(index->list[--index->have].window);
common/dist/zlib/examples/zran.c
78
free(index->list);
common/dist/zlib/examples/zran.c
79
index->list = NULL;
common/dist/zlib/examples/zran.c
95
point_t *next = realloc(index->list, sizeof(point_t) * index->mode);
common/dist/zlib/examples/zran.c
98
index->list = next;
common/dist/zlib/examples/zran.h
23
point_t *list; // allocated list of access points
crypto/dist/ipsec-tools/src/racoon/evt.c
340
evt_subscribe(struct evt_listener_list *list, int fd)
crypto/dist/ipsec-tools/src/racoon/evt.c
351
if (list == NULL)
crypto/dist/ipsec-tools/src/racoon/evt.c
352
list = &evt_listeners;
crypto/dist/ipsec-tools/src/racoon/evt.c
354
LIST_INSERT_HEAD(list, l, ll_chain);
crypto/dist/ipsec-tools/src/racoon/evt.c
365
evt_list_init(struct evt_listener_list *list)
crypto/dist/ipsec-tools/src/racoon/evt.c
367
LIST_INIT(list);
crypto/dist/ipsec-tools/src/racoon/evt.c
371
evt_list_cleanup(struct evt_listener_list *list)
crypto/dist/ipsec-tools/src/racoon/evt.c
373
while (!LIST_EMPTY(list))
crypto/dist/ipsec-tools/src/racoon/evt.c
374
evt_unsubscribe(LIST_FIRST(list));
crypto/dist/ipsec-tools/src/racoon/evt.h
126
int evt_subscribe(struct evt_listener_list *list, int fd);
crypto/dist/ipsec-tools/src/racoon/evt.h
127
void evt_list_init(struct evt_listener_list *list);
crypto/dist/ipsec-tools/src/racoon/evt.h
128
void evt_list_cleanup(struct evt_listener_list *list);
crypto/dist/ipsec-tools/src/racoon/grabmyaddr.c
192
myaddr_flush_list(struct _myaddr_list_ *list)
crypto/dist/ipsec-tools/src/racoon/grabmyaddr.c
196
for (my = LIST_FIRST(list); my; my = next) {
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
298
int splitnet_list_add(struct unity_netentry ** list,
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
307
for (nentry = *list; nentry != NULL; nentry = nentry->next)
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
329
if (*list == NULL)
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
330
*list = nentry;
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
332
struct unity_netentry * tmpentry = *list;
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
344
splitnet_list_free(struct unity_netentry * list, int *count)
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
346
struct unity_netentry * netentry = list;
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
359
splitnet_list_2str(struct unity_netentry * list,
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
370
netentry = list;
crypto/dist/ipsec-tools/src/racoon/isakmp_unity.c
390
netentry = list;
crypto/dist/ipsec-tools/src/racoon/prsa_par.y
394
prsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type)
crypto/dist/ipsec-tools/src/racoon/prsa_par.y
421
prsa_cur_list = list;
crypto/dist/ipsec-tools/src/racoon/rsalist.c
166
rsa_key_dump(struct genlist *list)
crypto/dist/ipsec-tools/src/racoon/rsalist.c
168
genlist_foreach(list, rsa_key_dump_one, NULL);
crypto/dist/ipsec-tools/src/racoon/rsalist.c
181
rsa_list_count(struct genlist *list)
crypto/dist/ipsec-tools/src/racoon/rsalist.c
184
genlist_foreach(list, rsa_list_count_one, &count);
crypto/dist/ipsec-tools/src/racoon/rsalist.c
226
struct genlist *list;
crypto/dist/ipsec-tools/src/racoon/rsalist.c
237
list = iph1->rmconf->rsa_private;
crypto/dist/ipsec-tools/src/racoon/rsalist.c
239
list = iph1->rmconf->rsa_public;
crypto/dist/ipsec-tools/src/racoon/rsalist.c
241
genlist_foreach(list, rsa_lookup_key_one, &r);
crypto/dist/ipsec-tools/src/racoon/rsalist.c
250
rsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type)
crypto/dist/ipsec-tools/src/racoon/rsalist.c
255
ret = prsa_parse_file(list, fname, type);
crypto/dist/ipsec-tools/src/racoon/rsalist.c
257
rsa_key_dump(list);
crypto/dist/ipsec-tools/src/racoon/rsalist.c
262
rsa_try_check_rsasign(vchar_t *source, vchar_t *sig, struct genlist *list)
crypto/dist/ipsec-tools/src/racoon/rsalist.c
267
for(key = genlist_next(list, &gp); key; key = genlist_next(NULL, &gp)) {
crypto/dist/ipsec-tools/src/racoon/rsalist.c
66
rsa_key_insert(struct genlist *list, struct netaddr *src,
crypto/dist/ipsec-tools/src/racoon/rsalist.c
84
genlist_append(list, rsa_key);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
55
int rsa_key_insert(struct genlist *list, struct netaddr *src, struct netaddr *dst, RSA *rsa);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
58
void rsa_key_dump(struct genlist *list);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
61
RSA *rsa_try_check_rsasign(vchar_t *source, vchar_t *sig, struct genlist *list);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
63
unsigned long rsa_list_count(struct genlist *list);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
65
int rsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type);
crypto/dist/ipsec-tools/src/racoon/rsalist.h
68
int prsa_parse_file(struct genlist *list, const char *fname, enum rsa_key_type type);
dist/pf/sbin/pfctl/parse.y
3816
TAILQ_INIT(&binat.rpool.list);
dist/pf/sbin/pfctl/parse.y
3822
TAILQ_INSERT_TAIL(&binat.rpool.list,
dist/pf/sbin/pfctl/parse.y
4786
TAILQ_INIT(&r->rpool.list);
dist/pf/sbin/pfctl/parse.y
4799
TAILQ_INSERT_TAIL(&r->rpool.list, pa, entries);
dist/pf/sbin/pfctl/pfctl.c
1120
TAILQ_FOREACH(pa, &p->list, entries) {
dist/pf/sbin/pfctl/pfctl.c
1170
TAILQ_INIT(&rule->rpool.list);
dist/pf/sbin/pfctl/pfctl.c
1942
pfctl_lookup_option(char *cmd, const char **list)
dist/pf/sbin/pfctl/pfctl.c
1945
for (; *list; list++)
dist/pf/sbin/pfctl/pfctl.c
1946
if (!strncmp(cmd, *list, strlen(cmd)))
dist/pf/sbin/pfctl/pfctl.c
1947
return (*list);
dist/pf/sbin/pfctl/pfctl.c
671
TAILQ_INIT(&pool->list);
dist/pf/sbin/pfctl/pfctl.c
682
TAILQ_INSERT_TAIL(&pool->list, pa, entries);
dist/pf/sbin/pfctl/pfctl.c
693
while ((pa = TAILQ_FIRST(&src->list)) != NULL) {
dist/pf/sbin/pfctl/pfctl.c
694
TAILQ_REMOVE(&src->list, pa, entries);
dist/pf/sbin/pfctl/pfctl.c
695
TAILQ_INSERT_TAIL(&dst->list, pa, entries);
dist/pf/sbin/pfctl/pfctl.c
704
while ((pa = TAILQ_FIRST(&pool->list)) != NULL) {
dist/pf/sbin/pfctl/pfctl.c
705
TAILQ_REMOVE(&pool->list, pa, entries);
dist/pf/sbin/pfctl/pfctl_optimize.c
289
if (TAILQ_FIRST(&r->rpool.list) != NULL) {
dist/pf/sbin/pfctl/pfctl_optimize.c
290
TAILQ_INIT(&por->por_rule.rpool.list);
dist/pf/sbin/pfctl/pfctl_optimize.c
324
TAILQ_INIT(&r->rpool.list);
dist/pf/sbin/pfctl/pfctl_optimize.c
911
if (TAILQ_EMPTY(&por->por_rule.rpool.list))
dist/pf/sbin/pfctl/pfctl_osfp.c
283
pfctl_flush_my_fingerprints(struct name_list *list)
dist/pf/sbin/pfctl/pfctl_osfp.c
287
while ((nm = LIST_FIRST(list)) != NULL) {
dist/pf/sbin/pfctl/pfctl_osfp.c
461
struct name_list *list;
dist/pf/sbin/pfctl/pfctl_osfp.c
490
list = &nm->nm_sublist;
dist/pf/sbin/pfctl/pfctl_osfp.c
491
LIST_FOREACH(nm, list, nm_entry) {
dist/pf/sbin/pfctl/pfctl_osfp.c
496
list = &nm->nm_sublist;
dist/pf/sbin/pfctl/pfctl_osfp.c
497
LIST_FOREACH(nm, list, nm_entry) {
dist/pf/sbin/pfctl/pfctl_osfp.c
537
lookup_name_list(struct name_list *list, const char *name)
dist/pf/sbin/pfctl/pfctl_osfp.c
540
LIST_FOREACH(nm, list, nm_entry)
dist/pf/sbin/pfctl/pfctl_osfp.c
698
fingerprint_name_entry(struct name_list *list, char *name)
dist/pf/sbin/pfctl/pfctl_osfp.c
705
LIST_FOREACH(nm_entry, list, nm_entry) {
dist/pf/sbin/pfctl/pfctl_osfp.c
719
LIST_INSERT_HEAD(list, nm_entry, nm_entry);
dist/pf/sbin/pfctl/pfctl_parser.c
445
if ((TAILQ_FIRST(&pool->list) != NULL) &&
dist/pf/sbin/pfctl/pfctl_parser.c
446
TAILQ_NEXT(TAILQ_FIRST(&pool->list), entries) != NULL)
dist/pf/sbin/pfctl/pfctl_parser.c
448
TAILQ_FOREACH(pooladdr, &pool->list, entries){
dist/pf/sbin/pfctl/pfctl_parser.c
469
else if (TAILQ_NEXT(TAILQ_FIRST(&pool->list), entries) != NULL)
games/backgammon/teachgammon/teach.c
84
wrtext(list);
games/backgammon/teachgammon/ttext1.c
47
const char *const list[] = {
games/backgammon/teachgammon/ttext2.c
158
wrtext(list);
games/backgammon/teachgammon/tutor.h
56
extern const char *const list[];
games/battlestar/init.c
125
for (ptr = list; *ptr; ptr++)
games/battlestar/init.c
92
static const char *const list[] = {
games/fortune/fortune/fortune.c
1173
print_list(FILEDESC *list, int lev)
games/fortune/fortune/fortune.c
1175
while (list != NULL) {
games/fortune/fortune/fortune.c
1177
if (list->percent == NO_PROB)
games/fortune/fortune/fortune.c
1180
fprintf(stderr, "%3d%%", list->percent);
games/fortune/fortune/fortune.c
1181
fprintf(stderr, " %s", STR(list->name));
games/fortune/fortune/fortune.c
1182
DPRINTF(1, (stderr, " (%s, %s, %s)\n", STR(list->path),
games/fortune/fortune/fortune.c
1183
STR(list->datfile), STR(list->posfile)));
games/fortune/fortune/fortune.c
1185
if (list->child != NULL)
games/fortune/fortune/fortune.c
1186
print_list(list->child, lev + 1);
games/fortune/fortune/fortune.c
1187
list = list->next;
games/fortune/fortune/fortune.c
1262
maxlen_in_list(FILEDESC *list)
games/fortune/fortune/fortune.c
1268
for (fp = list; fp != NULL; fp = fp->next) {
games/fortune/fortune/fortune.c
1287
matches_in_list(FILEDESC *list)
games/fortune/fortune/fortune.c
1296
for (fp = list; fp != NULL; fp = fp->next) {
games/monop/monop.c
107
list, /* own holdings |* 3 *| */
games/monop/monop.h
184
void list(void);
include/rpcsvc/yp_prot.h
151
struct ypmaplist *list;
lib/libc/citrus/citrus_esdb.c
251
_citrus_esdb_free_list(char **list, size_t num)
lib/libc/citrus/citrus_esdb.c
256
free(list[i]);
lib/libc/citrus/citrus_esdb.c
257
free(list);
lib/libc/citrus/citrus_esdb.c
271
char **list, **q;
lib/libc/citrus/citrus_esdb.c
293
list = malloc(num * sizeof(char *));
lib/libc/citrus/citrus_esdb.c
295
if (list == NULL) {
lib/libc/citrus/citrus_esdb.c
306
list[num] = strdup(buf);
lib/libc/citrus/citrus_esdb.c
307
if (list[num] == NULL) {
lib/libc/citrus/citrus_esdb.c
327
list[num] = strdup(buf);
lib/libc/citrus/citrus_esdb.c
328
if (list[num] == NULL) {
lib/libc/citrus/citrus_esdb.c
339
q = realloc(list, num * sizeof(char *));
lib/libc/citrus/citrus_esdb.c
344
list = q;
lib/libc/citrus/citrus_esdb.c
345
*rlist = list;
lib/libc/citrus/citrus_esdb.c
349
_citrus_esdb_free_list(list, num);
lib/libc/compat/sys/compat_aio_suspend.c
60
aio_suspend(const struct aiocb * const list[], int nent,
lib/libc/compat/sys/compat_aio_suspend.c
69
return __aio_suspend50(list, nent, tsp);
lib/libc/gen/nlist.c
115
nlist(const char *name, struct nlist *list)
lib/libc/gen/nlist.c
120
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist.c
125
n = __fdnlist(fd, list);
lib/libc/gen/nlist.c
131
__fdnlist(int fd, struct nlist *list)
lib/libc/gen/nlist.c
137
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist.c
140
if ((rv = (*fdnlist_fmts[i].fdnlist)(fd, list)) != -1)
lib/libc/gen/nlist_aout.c
108
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist_aout.c
145
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_aout.c
173
for (p = list, scored = scoreboard; !ISLAST(p);
lib/libc/gen/nlist_aout.c
95
__fdnlist_aout(int fd, struct nlist *list)
lib/libc/gen/nlist_coff.c
142
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_coff.c
171
for (p = list; !ISLAST(p); p++) {
lib/libc/gen/nlist_coff.c
84
__fdnlist_coff(int fd, struct nlist *list)
lib/libc/gen/nlist_coff.c
96
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist_ecoff.c
142
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_ecoff.c
151
for (p = list; !ISLAST(p); p++) {
lib/libc/gen/nlist_ecoff.c
66
__fdnlist_ecoff(int fd, struct nlist *list)
lib/libc/gen/nlist_ecoff.c
81
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist_elf32.c
103
_DIAGASSERT(list != NULL);
lib/libc/gen/nlist_elf32.c
155
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_elf32.c
279
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_elf32.c
288
for (p = list; !ISLAST(p); ++p) {
lib/libc/gen/nlist_elf32.c
77
ELFNAMEEND(__fdnlist)(int fd, struct nlist *list)
lib/libc/iconv/iconv.c
148
__iconv_free_list(char **list, size_t sz)
lib/libc/iconv/iconv.c
150
_citrus_esdb_free_list(list, sz);
lib/libc/include/isc/list.h
103
#define INSERT_AFTER(list, after, elt, link) \
lib/libc/include/isc/list.h
107
APPEND(list, elt, link); \
lib/libc/include/isc/list.h
116
#define ENQUEUE(list, elt, link) APPEND(list, elt, link)
lib/libc/include/isc/list.h
117
#define DEQUEUE(list, elt, link) UNLINK(list, elt, link)
lib/libc/include/isc/list.h
25
#define INIT_LIST(list) \
lib/libc/include/isc/list.h
26
do { (list).head = NULL; (list).tail = NULL; } while (0)
lib/libc/include/isc/list.h
39
#define HEAD(list) ((list).head)
lib/libc/include/isc/list.h
40
#define TAIL(list) ((list).tail)
lib/libc/include/isc/list.h
41
#define EMPTY(list) ((list).head == NULL)
lib/libc/include/isc/list.h
43
#define PREPEND(list, elt, link) \
lib/libc/include/isc/list.h
46
if ((list).head != NULL) \
lib/libc/include/isc/list.h
47
(list).head->link.prev = (elt); \
lib/libc/include/isc/list.h
49
(list).tail = (elt); \
lib/libc/include/isc/list.h
51
(elt)->link.next = (list).head; \
lib/libc/include/isc/list.h
52
(list).head = (elt); \
lib/libc/include/isc/list.h
55
#define APPEND(list, elt, link) \
lib/libc/include/isc/list.h
58
if ((list).tail != NULL) \
lib/libc/include/isc/list.h
59
(list).tail->link.next = (elt); \
lib/libc/include/isc/list.h
61
(list).head = (elt); \
lib/libc/include/isc/list.h
62
(elt)->link.prev = (list).tail; \
lib/libc/include/isc/list.h
64
(list).tail = (elt); \
lib/libc/include/isc/list.h
67
#define UNLINK_TYPE(list, elt, link, type) \
lib/libc/include/isc/list.h
73
INSIST((list).tail == (elt)); \
lib/libc/include/isc/list.h
74
(list).tail = (elt)->link.prev; \
lib/libc/include/isc/list.h
79
INSIST((list).head == (elt)); \
lib/libc/include/isc/list.h
80
(list).head = (elt)->link.next; \
lib/libc/include/isc/list.h
84
#define UNLINK(list, elt, link) \
lib/libc/include/isc/list.h
85
UNLINK_TYPE(list, elt, link, void)
lib/libc/include/isc/list.h
90
#define INSERT_BEFORE(list, before, elt, link) \
lib/libc/include/isc/list.h
94
PREPEND(list, elt, link); \
lib/libc/net/hesiod.c
287
hesiod_free_list(void *context, char **list)
lib/libc/net/hesiod.c
293
if (list == NULL)
lib/libc/net/hesiod.c
295
for (p = list; *p; p++)
lib/libc/net/hesiod.c
297
free(list);
lib/libc/net/hesiod.c
414
char *dst, **list;
lib/libc/net/hesiod.c
460
list = malloc((ancount + 1) * sizeof(char *));
lib/libc/net/hesiod.c
461
if (!list) {
lib/libc/net/hesiod.c
486
list[j] = malloc((size_t)len);
lib/libc/net/hesiod.c
487
if (!list[j]) {
lib/libc/net/hesiod.c
491
dst = list[j++];
lib/libc/net/hesiod.c
518
free(list[i]);
lib/libc/net/hesiod.c
519
free(list);
lib/libc/net/hesiod.c
524
free(list);
lib/libc/net/hesiod.c
527
list[j] = NULL;
lib/libc/net/hesiod.c
528
return list;
lib/libc/net/hesiod.c
566
static char **list;
lib/libc/net/hesiod.c
578
if (list)
lib/libc/net/hesiod.c
579
free(list);
lib/libc/net/hesiod.c
581
list = hesiod_resolve(context, name, type);
lib/libc/net/hesiod.c
582
if (!list)
lib/libc/net/hesiod.c
584
return list;
lib/libc/net/nsdispatch.c
164
LIST_ENTRY(_ns_drec) list;
lib/libc/net/nsdispatch.c
630
LIST_FOREACH(ldrec, &_ns_drec, list) {
lib/libc/net/nsdispatch.c
634
LIST_INSERT_HEAD(&_ns_drec, &drec, list);
lib/libc/net/nsdispatch.c
638
LIST_REMOVE(&drec, list);
lib/libc/net/nsdispatch.c
685
LIST_REMOVE(&drec, list);
lib/libc/rpc/clnt_bcast.c
136
__rpc_getbroadifs(int af, int proto, int socktype, broadlist_t *list)
lib/libc/rpc/clnt_bcast.c
147
_DIAGASSERT(list != NULL);
lib/libc/rpc/clnt_bcast.c
200
TAILQ_INSERT_TAIL(list, bip, link);
lib/libc/rpc/clnt_bcast.c
210
__rpc_freebroadifs(broadlist_t *list)
lib/libc/rpc/clnt_bcast.c
214
_DIAGASSERT(list != NULL);
lib/libc/rpc/clnt_bcast.c
216
bip = TAILQ_FIRST(list);
lib/libc/rpc/getnetconfig.c
250
struct netconfig_list *list;
lib/libc/rpc/getnetconfig.c
318
list = malloc(sizeof(*list));
lib/libc/rpc/getnetconfig.c
319
if (list == NULL) {
lib/libc/rpc/getnetconfig.c
326
free(list);
lib/libc/rpc/getnetconfig.c
329
list->ncp = np;
lib/libc/rpc/getnetconfig.c
330
list->next = NULL;
lib/libc/rpc/getnetconfig.c
331
list->ncp->nc_lookups = NULL;
lib/libc/rpc/getnetconfig.c
332
list->linep = stringp;
lib/libc/rpc/getnetconfig.c
333
if (parse_ncp(stringp, list->ncp) == -1) {
lib/libc/rpc/getnetconfig.c
336
free(list);
lib/libc/rpc/getnetconfig.c
346
ni.head = ni.tail = list;
lib/libc/rpc/getnetconfig.c
348
ni.tail->next = list;
lib/libc/rpc/getnetconfig.c
429
struct netconfig_list *list; /* pointer to cache list */
lib/libc/rpc/getnetconfig.c
444
for (list = ni.head; list; list = list->next) {
lib/libc/rpc/getnetconfig.c
445
if (strcmp(list->ncp->nc_netid, netid) == 0)
lib/libc/rpc/getnetconfig.c
446
return dup_ncp(list->ncp);
lib/libc/yp/xdryp.c
467
if (!xdr_pointer(xdrs, (char **)(void *)&objp->list,
lib/libc/yp/yp_maplist.c
74
*outmaplist = ypml.list;
lib/libcurses/PSD.doc/appen.C
10
.\" notice, this list of conditions and the following disclaimer.
lib/libcurses/PSD.doc/appen.C
12
.\" notice, this list of conditions and the following disclaimer in the
lib/libcurses/PSD.doc/appen.C
95
The calculational routines create a linked list of structures
lib/libcurses/PSD.doc/ex1.c
10
.\" notice, this list of conditions and the following disclaimer.
lib/libcurses/PSD.doc/ex1.c
12
.\" notice, this list of conditions and the following disclaimer in the
lib/libcurses/PSD.doc/ex2.c
10
.\" notice, this list of conditions and the following disclaimer.
lib/libcurses/PSD.doc/ex2.c
12
.\" notice, this list of conditions and the following disclaimer in the
lib/libcurses/PSD.doc/life.c
10
.\" notice, this list of conditions and the following disclaimer.
lib/libcurses/PSD.doc/life.c
12
.\" notice, this list of conditions and the following disclaimer in the
lib/libcurses/PSD.doc/win_st.c
10
.\" notice, this list of conditions and the following disclaimer.
lib/libcurses/PSD.doc/win_st.c
12
.\" notice, this list of conditions and the following disclaimer in the
lib/libcurses/resize.c
184
struct __winlist *list;
lib/libcurses/resize.c
206
for (list = _cursesi_screen->winlistp; list != NULL; list = list->nextp) {
lib/libcurses/resize.c
207
win = list->winp;
lib/libcurses/screen.c
272
struct __winlist *list;
lib/libcurses/screen.c
279
while ((list = screen->winlistp) != NULL) {
lib/libcurses/screen.c
280
delwin(list->winp);
lib/libcurses/screen.c
281
if (list == screen->winlistp)
lib/libedit/history.c
166
hentry_t list; /* Fake list header element */
lib/libedit/history.c
253
h->cursor = h->list.next;
lib/libedit/history.c
254
if (h->cursor != &h->list)
lib/libedit/history.c
273
h->cursor = h->list.prev;
lib/libedit/history.c
274
if (h->cursor != &h->list)
lib/libedit/history.c
293
if (h->cursor == &h->list) {
lib/libedit/history.c
298
if (h->cursor->next == &h->list) {
lib/libedit/history.c
318
if (h->cursor == &h->list) {
lib/libedit/history.c
324
if (h->cursor->prev == &h->list) {
lib/libedit/history.c
344
if (h->cursor != &h->list)
lib/libedit/history.c
369
if (h->cursor == &h->list || h->cursor->ev.num != n) {
lib/libedit/history.c
370
for (h->cursor = h->list.next; h->cursor != &h->list;
lib/libedit/history.c
375
if (h->cursor == &h->list) {
lib/libedit/history.c
396
for (h->cursor = h->list.prev; h->cursor != &h->list;
lib/libedit/history.c
400
if (h->cursor == &h->list) {
lib/libedit/history.c
419
if (h->cursor == &h->list)
lib/libedit/history.c
484
if (hp == &h->list)
lib/libedit/history.c
488
if (h->cursor == &h->list)
lib/libedit/history.c
516
c->next = h->list.next;
lib/libedit/history.c
517
c->prev = &h->list;
lib/libedit/history.c
518
h->list.next->prev = c;
lib/libedit/history.c
519
h->list.next = c;
lib/libedit/history.c
539
if ((h->flags & H_UNIQUE) != 0 && h->list.next != &h->list &&
lib/libedit/history.c
540
Strcmp(h->list.next->ev.str, str) == 0)
lib/libedit/history.c
551
history_def_delete(h, ev, h->list.prev);
lib/libedit/history.c
573
h->list.next = h->list.prev = &h->list;
lib/libedit/history.c
574
h->list.ev.str = NULL;
lib/libedit/history.c
575
h->list.ev.num = 0;
lib/libedit/history.c
576
h->cursor = &h->list;
lib/libedit/history.c
591
while (h->list.prev != &h->list)
lib/libedit/history.c
592
history_def_delete(h, ev, h->list.prev);
lib/libedit/history.c
593
h->cursor = &h->list;
lib/libedit/readline.c
2404
char **list, *match, *a, *b;
lib/libedit/readline.c
2408
if ((list = el_calloc(max, sizeof(*list))) == NULL)
lib/libedit/readline.c
2412
list[len++] = match;
lib/libedit/readline.c
2416
if ((nl = el_realloc(list, max * sizeof(*nl))) == NULL)
lib/libedit/readline.c
2418
list = nl;
lib/libedit/readline.c
2423
list[len] = NULL;
lib/libedit/readline.c
2425
if ((list[0] = strdup(list[1])) == NULL)
lib/libedit/readline.c
2427
return list;
lib/libedit/readline.c
2429
qsort(&list[1], len - 1, sizeof(*list),
lib/libedit/readline.c
2432
for (i = 1, a = list[i]; i < len - 1; i++, a = b) {
lib/libedit/readline.c
2433
b = list[i + 1];
lib/libedit/readline.c
2440
if ((list[0] = strdup(str)) == NULL)
lib/libedit/readline.c
2443
if ((list[0] = el_calloc(min + 1, sizeof(*list[0]))) == NULL)
lib/libedit/readline.c
2445
(void)memcpy(list[0], list[1], min);
lib/libedit/readline.c
2446
list[0][min] = '\0';
lib/libedit/readline.c
2448
return list;
lib/libedit/readline.c
2451
el_free(list);
lib/libnvmm/libnvmm.c
119
LIST_INSERT_HEAD(areas, area, list);
lib/libnvmm/libnvmm.c
131
LIST_FOREACH_SAFE(ent, areas, list, nxt) {
lib/libnvmm/libnvmm.c
133
LIST_REMOVE(ent, list);
lib/libnvmm/libnvmm.c
149
LIST_REMOVE(ent, list);
lib/libnvmm/libnvmm.c
53
LIST_ENTRY(__area) list;
lib/libnvmm/libnvmm.c
536
LIST_FOREACH(ent, areas, list) {
lib/libnvmm/libnvmm.c
73
LIST_FOREACH(ent, areas, list) {
lib/libpam/modules/pam_group/pam_group.c
112
for (list = grp->gr_mem; *list != NULL; ++list)
lib/libpam/modules/pam_group/pam_group.c
113
if (strcmp(*list, pwd->pw_name) == 0)
lib/libpam/modules/pam_group/pam_group.c
72
char *const *list;
lib/libpam/modules/pam_guest/pam_guest.c
55
lookup(const char *str, const char *list)
lib/libpam/modules/pam_guest/pam_guest.c
61
while (*list != '\0') {
lib/libpam/modules/pam_guest/pam_guest.c
62
while (*list == ',')
lib/libpam/modules/pam_guest/pam_guest.c
63
++list;
lib/libpam/modules/pam_guest/pam_guest.c
64
if ((next = strchr(list, ',')) == NULL)
lib/libpam/modules/pam_guest/pam_guest.c
65
next = strchr(list, '\0');
lib/libpam/modules/pam_guest/pam_guest.c
66
if (next - list == (ptrdiff_t)len &&
lib/libpam/modules/pam_guest/pam_guest.c
67
strncmp(list, str, len) == 0)
lib/libpam/modules/pam_guest/pam_guest.c
69
list = next;
lib/libpam/modules/pam_login_access/login_access.c
134
list_match(char *list, const char *item,
lib/libpam/modules/pam_login_access/login_access.c
147
for (tok = strtok(list, sep); tok != 0; tok = strtok((char *) 0, sep)) {
lib/libpthread/pthread_cancelstub.c
189
__aio_suspend50(const struct aiocb * const list[], int nent,
lib/libpthread/pthread_cancelstub.c
197
retval = _sys___aio_suspend50(list, nent, timeout);
lib/librefuse/fuse.h
255
int fuse_getgroups(int size, gid_t list[]);
lib/librefuse/refuse.c
1366
fuse_getgroups(int size, gid_t list[])
lib/librefuse/refuse/fs.c
1506
int fuse_fs_listxattr(struct fuse_fs* fs, const char* path, char* list, size_t size) {
lib/librefuse/refuse/fs.c
1515
return ((const struct __CONCAT(fuse_operations_v,VER)*)fs->op)->listxattr(path, list, size); \
lib/librefuse/refuse/fs.h
100
int fuse_fs_listxattr(struct fuse_fs* fs, const char* path, char* list, size_t size);
lib/libresolv/res_mkupdate.c
1049
findservice(const char *s, struct valuelist **list) {
lib/libresolv/res_mkupdate.c
1050
struct valuelist *lp = *list;
lib/libresolv/res_mkupdate.c
1055
if (lp != *list) {
lib/libresolv/res_mkupdate.c
1059
(*list)->prev = lp;
lib/libresolv/res_mkupdate.c
1060
lp->next = *list;
lib/libresolv/res_mkupdate.c
1061
*list = lp;
lib/libresolv/res_mkupdate.c
1092
struct valuelist **list = &servicelist;
lib/libresolv/res_mkupdate.c
1093
struct valuelist *lp = *list;
lib/libresolv/res_mkupdate.c
1101
if (lp != *list) {
lib/libresolv/res_mkupdate.c
1105
(*list)->prev = lp;
lib/libresolv/res_mkupdate.c
1106
lp->next = *list;
lib/libresolv/res_mkupdate.c
1107
*list = lp;
lib/libresolv/res_mkupdate.c
1120
struct valuelist **list = &protolist;
lib/libresolv/res_mkupdate.c
1121
struct valuelist *lp = *list;
lib/libresolv/res_mkupdate.c
1126
if (lp != *list) {
lib/libresolv/res_mkupdate.c
1130
(*list)->prev = lp;
lib/libresolv/res_mkupdate.c
1131
lp->next = *list;
lib/libresolv/res_mkupdate.c
1132
*list = lp;
lib/libwrap/hosts_access.c
228
list_match(char *list, struct request_info *request,
lib/libwrap/hosts_access.c
242
for (tok = strtok_r(list, sep, &last); tok != 0;
libexec/identd/identd.c
688
const char *list;
libexec/identd/identd.c
692
list = NULL;
libexec/identd/identd.c
700
list = "net.inet.tcp.pcblist";
libexec/identd/identd.c
706
list = "net.inet6.tcp.pcblist";
libexec/identd/identd.c
712
if (list != NULL)
libexec/identd/identd.c
713
rc = sysctlnametomib(list, &name[0], &sz);
libexec/ld.elf_so/load.c
75
_rtld_objlist_push_head(Objlist *list, Obj_Entry *obj)
libexec/ld.elf_so/load.c
81
SIMPLEQ_INSERT_HEAD(list, elm, link);
libexec/ld.elf_so/load.c
85
_rtld_objlist_push_tail(Objlist *list, Obj_Entry *obj)
libexec/ld.elf_so/load.c
91
SIMPLEQ_INSERT_TAIL(list, elm, link);
libexec/ld.elf_so/load.c
95
_rtld_objlist_find(Objlist *list, const Obj_Entry *obj)
libexec/ld.elf_so/load.c
99
SIMPLEQ_FOREACH(elm, list, link) {
libexec/ld.elf_so/rtld.c
1246
_rtld_initlist_visit(Objlist* list, Obj_Entry *obj, int rev)
libexec/ld.elf_so/rtld.c
1273
_rtld_initlist_visit(list, elm->obj, rev);
libexec/ld.elf_so/rtld.c
1278
_rtld_objlist_push_head(list, obj);
libexec/ld.elf_so/rtld.c
1280
_rtld_objlist_push_tail(list, obj);
libexec/ld.elf_so/rtld.c
1285
_rtld_initlist_tsort(Objlist* list, int rev)
libexec/ld.elf_so/rtld.c
1300
_rtld_initlist_visit(list, obj, rev);
libexec/ld.elf_so/rtld.c
2141
_rtld_objlist_clear(Objlist *list)
libexec/ld.elf_so/rtld.c
2143
while (!SIMPLEQ_EMPTY(list)) {
libexec/ld.elf_so/rtld.c
2144
Objlist_Entry* elm = SIMPLEQ_FIRST(list);
libexec/ld.elf_so/rtld.c
2145
SIMPLEQ_REMOVE_HEAD(list, link);
libexec/ld.elf_so/rtld.c
2151
_rtld_objlist_remove(Objlist *list, Obj_Entry *obj)
libexec/ld.elf_so/rtld.c
2155
if ((elm = _rtld_objlist_find(list, obj)) != NULL) {
libexec/ld.elf_so/rtld.c
2156
SIMPLEQ_REMOVE(list, elm, Struct_Objlist_Entry, link);
sbin/cgdconfig/cgdconfig.c
131
LIST_ENTRY(sharedkey) list;
sbin/cgdconfig/cgdconfig.c
465
LIST_FOREACH(sk, &sharedkeys, list) {
sbin/cgdconfig/cgdconfig.c
519
LIST_INSERT_HEAD(&sharedkeys, sk, list);
sbin/cgdconfig/cgdconfig.c
880
LIST_REMOVE(sk, list);
sbin/disklabel/interact.c
677
const char **list = NULL;
sbin/disklabel/interact.c
679
if (reallocarr(&list, numentries, sizeof(char *)) != 0)
sbin/disklabel/interact.c
684
list[i] = olist[i];
sbin/disklabel/interact.c
685
w = strlen(list[i]);
sbin/disklabel/interact.c
691
printf("%s%s", i == 0 ? "" : ", ", list[i]);
sbin/disklabel/interact.c
694
(void)qsort(list, numentries, sizeof(char *), alphacmp);
sbin/disklabel/interact.c
709
p = list[entry];
sbin/disklabel/interact.c
722
free(list);
sbin/disklabel/main.c
2211
const char **list = NULL;
sbin/disklabel/main.c
2214
if (reallocarr(&list, nelems, sizeof(char *)) != 0) {
sbin/disklabel/main.c
2219
list[i] = fstypenames[i];
sbin/disklabel/main.c
2221
qsort(list, nelems, sizeof(char *), qsort_strcmp);
sbin/disklabel/main.c
2224
(void)printf("%s\n", list[i]);
sbin/disklabel/main.c
2226
free(list);
sbin/fsck/fsck.c
464
addentry(struct fstypelist *list, const char *type, const char *opts)
sbin/fsck/fsck.c
471
TAILQ_INSERT_TAIL(list, e, entries);
sbin/fsck_v7fs/datablock.c
266
v7fs_daddr_t *list;
sbin/fsck_v7fs/datablock.c
271
list = (v7fs_daddr_t *)buf;
sbin/fsck_v7fs/datablock.c
272
oldblk = V7FS_VAL32(fs, list[dupidx]);
sbin/fsck_v7fs/datablock.c
273
list[dupidx] = V7FS_VAL32(fs, newblk);
sbin/fsck_v7fs/datablock.c
285
v7fs_daddr_t list[V7FS_DADDR_PER_BLOCK];
sbin/fsck_v7fs/datablock.c
288
prepare_list(fs, listblk, list);
sbin/fsck_v7fs/datablock.c
290
if (list[i] == dupblk) {
sbin/fsck_v7fs/datablock.c
303
v7fs_daddr_t list[V7FS_DADDR_PER_BLOCK];
sbin/fsck_v7fs/datablock.c
307
prepare_list(fs, listblk, list);
sbin/fsck_v7fs/datablock.c
309
if ((blk = list[i]) == dupblk) {
sbin/fsck_v7fs/datablock.c
326
v7fs_daddr_t list[V7FS_DADDR_PER_BLOCK];
sbin/fsck_v7fs/datablock.c
357
prepare_list(fs, blk, list);
sbin/fsck_v7fs/datablock.c
359
if ((blk2 = list[i]) == dupblk) {
sbin/iscsictl/iscsic_daemonif.c
1040
iscsid_get_session_list_rsp_t *list;
sbin/iscsictl/iscsic_daemonif.c
1062
list = (iscsid_get_session_list_rsp_t *)(void *)lrsp->parameter;
sbin/iscsictl/iscsic_daemonif.c
1064
for (i = 0, ent = list->session; i < list->num_entries; i++, ent++) {
sbin/iscsictl/iscsic_daemonif.c
419
iscsid_get_list_rsp_t *list;
sbin/iscsictl/iscsic_daemonif.c
431
list = (iscsid_get_list_rsp_t *)(void *)rsp->parameter;
sbin/iscsictl/iscsic_daemonif.c
434
for (i = 0; i < list->num_entries; i++) {
sbin/iscsictl/iscsic_daemonif.c
435
show_target(list->id[i], kind);
sbin/iscsictl/iscsic_daemonif.c
621
iscsid_get_list_rsp_t *list;
sbin/iscsictl/iscsic_daemonif.c
636
list = (iscsid_get_list_rsp_t *)(void *)rsp->parameter;
sbin/iscsictl/iscsic_daemonif.c
639
for (i = 0; i < list->num_entries; i++) {
sbin/iscsictl/iscsic_daemonif.c
640
req.id = list->id[i];
sbin/iscsictl/iscsic_daemonif.c
647
printf("%6d: %s\n", list->id[i], isns->address);
sbin/iscsictl/iscsic_daemonif.c
753
iscsid_get_list_rsp_t *list;
sbin/iscsictl/iscsic_daemonif.c
768
list = (iscsid_get_list_rsp_t *)(void *)rsp->parameter;
sbin/iscsictl/iscsic_daemonif.c
771
for (i = 0; i < list->num_entries; i++) {
sbin/iscsictl/iscsic_daemonif.c
772
req.id = list->id[i];
sbin/iscsid/iscsid_discover.c
755
TAILQ_INSERT_TAIL(&list[ISNS_LIST].list, &isns->entry, link);
sbin/iscsid/iscsid_discover.c
756
list[ISNS_LIST].num_entries++;
sbin/iscsid/iscsid_discover.c
842
TAILQ_FOREACH(curr, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_discover.c
856
for (curr = TAILQ_FIRST(&list[PORTAL_LIST].list); curr != NULL;
sbin/iscsid/iscsid_discover.c
897
TAILQ_REMOVE(&list[ISNS_LIST].list, &isns->entry, link);
sbin/iscsid/iscsid_discover.c
898
list[ISNS_LIST].num_entries--;
sbin/iscsid/iscsid_discover.c
903
TAILQ_FOREACH(curr, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_discover.c
923
plist = &list[ISNS_LIST].list;
sbin/iscsid/iscsid_driverif.c
424
loginp.session_id = get_id(&list[SESSION_LIST].list, &req->session_id);
sbin/iscsid/iscsid_driverif.c
643
TAILQ_INSERT_TAIL(&list[SESSION_LIST].list, &sess->entry, link);
sbin/iscsid/iscsid_driverif.c
644
list[SESSION_LIST].num_entries++;
sbin/iscsid/iscsid_globals.h
357
generic_list_t list;
sbin/iscsid/iscsid_globals.h
368
extern list_head_t list[NUM_DAEMON_LISTS]; /* the lists this daemon keeps */
sbin/iscsid/iscsid_globals.h
415
(isns_t *)(void *)find_id(&list [ISNS_LIST].list, id)
sbin/iscsid/iscsid_globals.h
417
(session_t *)(void *)find_id(&list [SESSION_LIST].list, id)
sbin/iscsid/iscsid_globals.h
421
(portal_t *)(void *)find_id(&list [PORTAL_LIST].list, id)
sbin/iscsid/iscsid_globals.h
423
(target_t *)(void *)find_id(&list [lst].list, id)
sbin/iscsid/iscsid_globals.h
425
(send_target_t *)(void *)find_id(&list [SEND_TARGETS_LIST].list, id)
sbin/iscsid/iscsid_globals.h
427
(initiator_t *)(void *)find_id(&list [INITIATOR_LIST].list, id)
sbin/iscsid/iscsid_globals.h
429
(isns_t *)(void *)find_name(&list [ISNS_LIST].list, name)
sbin/iscsid/iscsid_globals.h
431
(session_t *)(void *)find_name(&list [SESSION_LIST].list, name)
sbin/iscsid/iscsid_globals.h
435
(portal_t *)(void *)find_name(&list [PORTAL_LIST].list, name)
sbin/iscsid/iscsid_globals.h
437
(target_t *)(void *)find_name(&list [lst].list, name)
sbin/iscsid/iscsid_globals.h
439
(initiator_t *)(void *)find_name(&list [INITIATOR_LIST].list, name)
sbin/iscsid/iscsid_globals.h
441
(isns_t *)(void *)find_sym_id(&list [ISNS_LIST].list, sid)
sbin/iscsid/iscsid_globals.h
443
(session_t *)(void *)find_sym_id(&list [SESSION_LIST].list, sid)
sbin/iscsid/iscsid_globals.h
447
(portal_t *)(void *)find_sym_id(&list [PORTAL_LIST].list, sid)
sbin/iscsid/iscsid_globals.h
449
(initiator_t *)(void *)find_sym_id(&list [INITIATOR_LIST].list, sid)
sbin/iscsid/iscsid_lists.c
199
if ((targ = (target_t *)(void *)find_sym_id (&list [lst].list, sid)) != NULL)
sbin/iscsid/iscsid_lists.c
229
TAILQ_FOREACH(curr, &list[lst].list, link) {
sbin/iscsid/iscsid_lists.c
256
TAILQ_FOREACH(curr, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
290
TAILQ_FOREACH(curr, &list[SEND_TARGETS_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
333
plist = &list[par->list_kind].list;
sbin/iscsid/iscsid_lists.c
334
num = list[par->list_kind].num_entries;
sbin/iscsid/iscsid_lists.c
393
if (!list[par->list_kind].num_entries) {
sbin/iscsid/iscsid_lists.c
402
elem = find_id(&list[par->list_kind].list, par->intval);
sbin/iscsid/iscsid_lists.c
406
elem = find_name(&list[par->list_kind].list, par->strval);
sbin/iscsid/iscsid_lists.c
419
TAILQ_FOREACH(elem, &list[SESSION_LIST].list, link)
sbin/iscsid/iscsid_lists.c
434
TAILQ_FOREACH(elem, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
444
TAILQ_FOREACH(elem, &list[SEND_TARGETS_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
455
TAILQ_FOREACH(elem, &list[ISNS_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
520
plist = &list[SESSION_LIST].list;
sbin/iscsid/iscsid_lists.c
521
num = list[SESSION_LIST].num_entries;
sbin/iscsid/iscsid_lists.c
63
TAILQ_REMOVE(&list[SESSION_LIST].list, &sess->entry, link);
sbin/iscsid/iscsid_lists.c
64
list[SESSION_LIST].num_entries--;
sbin/iscsid/iscsid_lists.c
709
TAILQ_FOREACH(curr, &list[INITIATOR_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
772
TAILQ_INSERT_TAIL(&list[INITIATOR_LIST].list, &init->entry, link);
sbin/iscsid/iscsid_lists.c
773
list[INITIATOR_LIST].num_entries++;
sbin/iscsid/iscsid_lists.c
800
list[INITIATOR_LIST].num_entries--;
sbin/iscsid/iscsid_lists.c
802
TAILQ_REMOVE(&list[INITIATOR_LIST].list, &init->entry, link);
sbin/iscsid/iscsid_lists.c
84
for (curr = list[SESSION_LIST].list.tqh_first; curr != NULL; curr = next) {
sbin/iscsid/iscsid_lists.c
867
if (!list[INITIATOR_LIST].num_entries)
sbin/iscsid/iscsid_lists.c
870
TAILQ_FOREACH(curr, &list[INITIATOR_LIST].list, link) {
sbin/iscsid/iscsid_lists.c
908
TAILQ_REMOVE(&list[SESSION_LIST].list, &sess->entry, link);
sbin/iscsid/iscsid_lists.c
909
list[SESSION_LIST].num_entries--;
sbin/iscsid/iscsid_main.c
171
TAILQ_INIT(&list[i].list);
sbin/iscsid/iscsid_main.c
172
list[i].num_entries = 0;
sbin/iscsid/iscsid_main.c
49
list_head_t list[NUM_DAEMON_LISTS]; /* the lists this daemon keeps */
sbin/iscsid/iscsid_targets.c
1017
TAILQ_FOREACH(curr, &list[ISNS_LIST].list, link)
sbin/iscsid/iscsid_targets.c
114
TAILQ_INSERT_TAIL(&list[PORTAL_LIST].list, &portal->entry, link);
sbin/iscsid/iscsid_targets.c
115
list[PORTAL_LIST].num_entries++;
sbin/iscsid/iscsid_targets.c
139
TAILQ_REMOVE(&list[PORTAL_LIST].list, &portal->entry, link);
sbin/iscsid/iscsid_targets.c
142
list[PORTAL_LIST].num_entries--;
sbin/iscsid/iscsid_targets.c
153
TAILQ_REMOVE(&list[TARGET_LIST].list, &target->entry, link);
sbin/iscsid/iscsid_targets.c
154
list[TARGET_LIST].num_entries--;
sbin/iscsid/iscsid_targets.c
225
TAILQ_REMOVE(&list[TARGET_LIST].list, &target->entry, link);
sbin/iscsid/iscsid_targets.c
226
list[TARGET_LIST].num_entries--;
sbin/iscsid/iscsid_targets.c
282
TAILQ_FOREACH(curr, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_targets.c
289
TAILQ_REMOVE(&list[SEND_TARGETS_LIST].list, &send_target->entry, link);
sbin/iscsid/iscsid_targets.c
290
list[SEND_TARGETS_LIST].num_entries--;
sbin/iscsid/iscsid_targets.c
378
TAILQ_INSERT_TAIL(&list[par->list_kind].list, &target->entry,
sbin/iscsid/iscsid_targets.c
380
list[par->list_kind].num_entries++;
sbin/iscsid/iscsid_targets.c
446
TAILQ_INSERT_TAIL(&list[TARGET_LIST].list, &target->entry, link);
sbin/iscsid/iscsid_targets.c
447
list[TARGET_LIST].num_entries++;
sbin/iscsid/iscsid_targets.c
827
TAILQ_FOREACH(curr, &list[PORTAL_LIST].list, link) {
sbin/iscsid/iscsid_targets.c
899
for (curr = TAILQ_FIRST(&list[PORTAL_LIST].list); curr != NULL;
sbin/iscsid/iscsid_targets.c
936
for (curr = TAILQ_FIRST(&list[PORTAL_LIST].list); curr != NULL;
sbin/iscsid/iscsid_targets.c
999
TAILQ_FOREACH(curr, &list[SEND_TARGETS_LIST].list, link)
sbin/restore/interactive.c
516
struct afile *fp, *list, *listp;
sbin/restore/interactive.c
530
list = &single;
sbin/restore/interactive.c
531
mkentry(name, dp, list);
sbin/restore/interactive.c
543
list = (struct afile *)malloc(entries * sizeof(struct afile));
sbin/restore/interactive.c
544
if (list == NULL) {
sbin/restore/interactive.c
552
listp = list;
sbin/restore/interactive.c
574
free(list);
sbin/restore/interactive.c
577
qsort((char *)list, entries, sizeof(struct afile), fcmp);
sbin/restore/interactive.c
579
formatf(list, entries);
sbin/restore/interactive.c
581
for (fp = listp - 1; fp >= list; fp--)
sbin/restore/interactive.c
584
free(list);
sbin/restore/interactive.c
652
formatf(struct afile *list, int nentry)
sbin/restore/interactive.c
665
endlist = &list[nentry];
sbin/restore/interactive.c
666
for (fp = &list[0]; fp < endlist; fp++) {
sbin/restore/interactive.c
692
fp = &list[j * lines + i];
sbin/sysctl/pathconf.c
132
struct list *lp;
sbin/sysctl/pathconf.c
136
if (lp->list == 0)
sbin/sysctl/pathconf.c
139
if (lp->list[lvl2].ctl_name == 0)
sbin/sysctl/pathconf.c
141
parse(path, lp->list[lvl2].ctl_name, Aflag);
sbin/sysctl/pathconf.c
201
struct list *namelist;
sbin/sysctl/pathconf.c
206
if (namelist->list == 0 || (name = strsep(bufp, ".")) == NULL) {
sbin/sysctl/pathconf.c
211
if (namelist->list[i].ctl_name != NULL &&
sbin/sysctl/pathconf.c
212
strcmp(name, namelist->list[i].ctl_name) == 0)
sbin/sysctl/pathconf.c
73
struct ctlname *list;
sbin/sysctl/pathconf.c
76
struct list pclist = { pcnames, PC_MAXID };
share/doc/psd/20.ipctut/dgramread.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/dgramread.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/dgramsend.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/dgramsend.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/pipe.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/pipe.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/socketpair.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/socketpair.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/strchkread.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/strchkread.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/streamread.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/streamread.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/streamwrite.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/streamwrite.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/udgramread.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/udgramread.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/udgramsend.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/udgramsend.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/ustreamread.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/ustreamread.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/doc/psd/20.ipctut/ustreamwrite.c
10
.\" notice, this list of conditions and the following disclaimer.
share/doc/psd/20.ipctut/ustreamwrite.c
12
.\" notice, this list of conditions and the following disclaimer in the
share/examples/puffs/pgfs/pgfs_db.c
116
TAILQ_FOREACH(xc, &xclist, list) {
share/examples/puffs/pgfs/pgfs_db.c
58
TAILQ_ENTRY(Xconn) list;
share/examples/puffs/pgfs/pgfs_db.c
804
TAILQ_FOREACH(xc, &xclist, list) {
share/examples/puffs/pgfs/pgfs_db.c
891
TAILQ_INSERT_HEAD(&xclist, xc, list);
share/examples/puffs/pgfs/pgfs_subs.c
122
TAILQ_ENTRY(fileid_lock_handle) list;
share/examples/puffs/pgfs/pgfs_subs.c
143
TAILQ_FOREACH(lock, &fileid_lock_list, list) {
share/examples/puffs/pgfs/pgfs_subs.c
157
TAILQ_INSERT_HEAD(&fileid_lock_list, lock, list);
share/examples/puffs/pgfs/pgfs_subs.c
180
TAILQ_REMOVE(&fileid_lock_list, lock, list);
share/examples/puffs/pgfs/pgfs_waitq.c
45
TAILQ_ENTRY(waiter) list;
share/examples/puffs/pgfs/pgfs_waitq.c
66
TAILQ_INSERT_TAIL(wq, &w, list);
share/examples/puffs/pgfs/pgfs_waitq.c
78
TAILQ_REMOVE(wq, w, list);
share/examples/puffs/pgfs/pgfs_waitq.c
93
TAILQ_FOREACH(w, wq, list) {
sys/arch/aarch64/aarch64/pmap.c
574
LIST_INSERT_HEAD(&pm->pm_vmlist, pg, pageq.list);
sys/arch/aarch64/aarch64/pmap.c
603
LIST_REMOVE(pg, pageq.list);
sys/arch/aarch64/aarch64/pmap.c
620
LIST_FOREACH_SAFE(pg, &pm->pm_vmlist, pageq.list, tmp) {
sys/arch/aarch64/aarch64/pmap.c
666
LIST_FOREACH_SAFE(pg, &pm->pm_vmlist, pageq.list, pgtmp) {
sys/arch/alpha/alpha/pmap.c
1913
LIST_MOVE(&pmap->pm_ptpages, &tlbctx.t_freeptq, pageq.list);
sys/arch/alpha/alpha/pmap.c
3697
LIST_INSERT_HEAD(&pmap->pm_ptpages, pg, pageq.list);
sys/arch/alpha/alpha/pmap.c
3738
LIST_REMOVE(pg, pageq.list);
sys/arch/alpha/alpha/pmap.c
3739
LIST_INSERT_HEAD(&tlbctx->t_freeptq, pg, pageq.list);
sys/arch/alpha/alpha/pmap.c
508
pmap_pagelist_free(struct pmap_pagelist * const list)
sys/arch/alpha/alpha/pmap.c
512
while ((pg = LIST_FIRST(list)) != NULL) {
sys/arch/alpha/alpha/pmap.c
513
LIST_REMOVE(pg, pageq.list);
sys/arch/alpha/alpha/pmap.c
525
pmap_pvlist_free(struct pmap_pvlist * const list)
sys/arch/alpha/alpha/pmap.c
529
while ((pv = LIST_FIRST(list)) != NULL) {
sys/arch/arm/arm32/kobj_machdep.c
280
struct be8_marker_list *list = cookie;
sys/arch/arm/arm32/kobj_machdep.c
286
ndx = list->cnt++;
sys/arch/arm/arm32/kobj_machdep.c
287
list->markers[ndx].type = t;
sys/arch/arm/arm32/kobj_machdep.c
288
list->markers[ndx].addr = value;
sys/arch/arm/arm32/kobj_machdep.c
307
be8_ksym_swap(void *start, size_t size, const struct be8_marker_list *list)
sys/arch/arm/arm32/kobj_machdep.c
315
for (i = 0; i < list->cnt; i++)
sys/arch/arm/arm32/kobj_machdep.c
316
if (start <= list->markers[i].addr)
sys/arch/arm/arm32/kobj_machdep.c
320
for ( ; i < list->cnt; i++) {
sys/arch/arm/arm32/kobj_machdep.c
321
switch (list->markers[i].type) {
sys/arch/arm/arm32/kobj_machdep.c
323
p32 = (uint32_t*)list->markers[i].addr;
sys/arch/arm/arm32/kobj_machdep.c
325
if (i+1 < list->cnt) {
sys/arch/arm/arm32/kobj_machdep.c
326
if ((uintptr_t)list->markers[i+1].addr
sys/arch/arm/arm32/kobj_machdep.c
329
list->markers[i+1].addr;
sys/arch/arm/arm32/kobj_machdep.c
337
p16 = (uint16_t*)list->markers[i].addr;
sys/arch/arm/arm32/kobj_machdep.c
339
if (i+1 < list->cnt) {
sys/arch/arm/arm32/kobj_machdep.c
340
if ((uintptr_t)list->markers[i+1].addr
sys/arch/arm/arm32/kobj_machdep.c
343
list->markers[i+1].addr;
sys/arch/arm/arm32/kobj_machdep.c
360
struct be8_marker_list list;
sys/arch/arm/arm32/kobj_machdep.c
371
list.cnt = 0;
sys/arch/arm/arm32/kobj_machdep.c
372
msize = relsym_cnt*sizeof(*list.markers);
sys/arch/arm/arm32/kobj_machdep.c
373
list.markers = kmem_alloc(msize, KM_SLEEP);
sys/arch/arm/arm32/kobj_machdep.c
374
ksyms_mod_foreach(ko->ko_name, be8_ksym_add, &list);
sys/arch/arm/arm32/kobj_machdep.c
375
KASSERT(list.cnt == relsym_cnt);
sys/arch/arm/arm32/kobj_machdep.c
380
if (kheapsort(list.markers, relsym_cnt, sizeof(*list.markers),
sys/arch/arm/arm32/kobj_machdep.c
394
&list);
sys/arch/arm/arm32/kobj_machdep.c
400
kmem_free(list.markers, msize);
sys/arch/arm/cortex/gicv3.c
640
LIST_FOREACH(cb, &sc->sc_lpi_callbacks, list)
sys/arch/arm/cortex/gicv3.c
652
LIST_FOREACH(cb, &sc->sc_lpi_callbacks, list)
sys/arch/arm/cortex/gicv3.c
663
LIST_FOREACH(cb, &sc->sc_lpi_callbacks, list) {
sys/arch/arm/cortex/gicv3.h
49
LIST_ENTRY(gicv3_lpi_callback) list;
sys/arch/arm/cortex/gicv3_its.c
1191
LIST_INSERT_HEAD(&sc->sc_lpi_callbacks, &its->its_cb, list);
sys/arch/arm/s3c2xx0/s3c2xx0_intr.h
196
TAILQ_HEAD(,intrhand) list;
sys/arch/arm/sociox/sni_gpio.c
170
char *list;
sys/arch/arm/xscale/pxa2x0_intr.c
86
TAILQ_HEAD(,intrhand) list;
sys/arch/evbmips/mipssim/mipssim_intr.c
109
struct intrlist *list;
sys/arch/evbmips/mipssim/mipssim_intr.c
118
list = &intrs[level];
sys/arch/evbmips/mipssim/mipssim_intr.c
120
LIST_FOREACH(ih, list, ih_q) {
sys/arch/evbmips/mipssim/mipssim_intr.c
131
struct intrlist *list;
sys/arch/evbmips/mipssim/mipssim_intr.c
140
list = &intrs[irq];
sys/arch/evbmips/mipssim/mipssim_intr.c
148
LIST_INSERT_HEAD(list, ih, ih_q);
sys/arch/hpc/hpc/platid_gen/gram.y
81
%type <node>list
sys/arch/hpc/hpc/platid_gen/gram.y
86
start: list { def_tree = $1; };
sys/arch/hpc/hpc/platid_gen/gram.y
88
list:
sys/arch/hpc/hpc/platid_gen/gram.y
89
list item { LIST_ADD($1, $2); $$ = $1; } |
sys/arch/i386/pci/pci_intr_fixup.c
236
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
303
SIMPLEQ_INSERT_TAIL(&pciintr_link_map_list, l, list);
sys/arch/i386/pci/pci_intr_fixup.c
305
SIMPLEQ_INSERT_HEAD(&pciintr_link_map_list, l, list);
sys/arch/i386/pci/pci_intr_fixup.c
430
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
460
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
502
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
526
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
552
SIMPLEQ_FOREACH(l, &pciintr_link_map_list, list) {
sys/arch/i386/pci/pci_intr_fixup.c
91
SIMPLEQ_ENTRY(pciintr_link_map) list;
sys/arch/i386/stand/efiboot/efidisk.c
137
list);
sys/arch/i386/stand/efiboot/efidisk.c
142
TAILQ_INSERT_TAIL(&efi_disklist, edi, list);
sys/arch/i386/stand/efiboot/efidisk.c
151
TAILQ_REMOVE(&efi_disklist, edi, list);
sys/arch/i386/stand/efiboot/efidisk.c
152
TAILQ_INSERT_TAIL(&efi_disklist, edi, list);
sys/arch/i386/stand/efiboot/efidisk.c
157
TAILQ_FOREACH(edi, &efi_disklist, list) {
sys/arch/i386/stand/efiboot/efidisk.c
173
TAILQ_FOREACH(edi, &efi_disklist, list) {
sys/arch/i386/stand/efiboot/efidisk.c
229
TAILQ_FOREACH(edi, &efi_disklist, list) {
sys/arch/i386/stand/efiboot/efidisk.c
357
TAILQ_FOREACH(edi, &efi_disklist, list) {
sys/arch/i386/stand/efiboot/efidisk.h
32
TAILQ_ENTRY(efidiskinfo) list;
sys/arch/i386/stand/efiboot/efipxe.c
111
TAILQ_INSERT_TAIL(&efi_pxelist, epi, list);
sys/arch/i386/stand/efiboot/efipxe.c
123
TAILQ_FOREACH(epi, &efi_pxelist, list) {
sys/arch/i386/stand/efiboot/efipxe.c
136
TAILQ_FOREACH(epi, &efi_pxelist, list) {
sys/arch/i386/stand/efiboot/efipxe.c
30
TAILQ_ENTRY(efipxeinfo) list;
sys/arch/i386/stand/efiboot/efipxe.c
90
TAILQ_FOREACH(epi, &efi_pxelist, list) {
sys/arch/m68k/m68k/db_disasm.c
2043
int bit, list;
sys/arch/m68k/m68k/db_disasm.c
2046
list = rl;
sys/arch/m68k/m68k/db_disasm.c
2050
if (list & (1 << bit))
sys/arch/m68k/m68k/db_disasm.c
2053
for (bit = 0, list = 0; bit < 16; bit++) {
sys/arch/m68k/m68k/db_disasm.c
2055
if (list == 0) {
sys/arch/m68k/m68k/db_disasm.c
2056
list = 1;
sys/arch/m68k/m68k/db_disasm.c
2058
} else if (list == 1) {
sys/arch/m68k/m68k/db_disasm.c
2059
list++;
sys/arch/m68k/m68k/db_disasm.c
2063
if (list) {
sys/arch/m68k/m68k/db_disasm.c
2064
if (list > 1)
sys/arch/m68k/m68k/db_disasm.c
2067
list = 0;
sys/arch/m68k/m68k/db_disasm.c
2071
list = 1;
sys/arch/m68k/m68k/db_disasm.c
2075
if (list > 1)
sys/arch/m68k/m68k/db_disasm.c
2087
int bit, list, upper;
sys/arch/m68k/m68k/db_disasm.c
2093
list = rl;
sys/arch/m68k/m68k/db_disasm.c
2097
if (list & (1 << bit))
sys/arch/m68k/m68k/db_disasm.c
2100
for (bit = 0, list = 0; bit < upper; bit++) {
sys/arch/m68k/m68k/db_disasm.c
2102
if (list == 0) {
sys/arch/m68k/m68k/db_disasm.c
2107
list = 1;
sys/arch/m68k/m68k/db_disasm.c
2108
} else if (list == 1) {
sys/arch/m68k/m68k/db_disasm.c
2109
list++;
sys/arch/m68k/m68k/db_disasm.c
2113
if (list) {
sys/arch/m68k/m68k/db_disasm.c
2114
if (list > 1)
sys/arch/m68k/m68k/db_disasm.c
2117
list = 0;
sys/arch/m68k/m68k/db_disasm.c
2121
if (list > 1)
sys/arch/m68k/m68k/m68k_intr.c
324
struct m68k_intrhand_list * const list = &m68k_intrhands_autovec[ipl];
sys/arch/m68k/m68k/m68k_intr.c
328
if (LIST_EMPTY(list)) {
sys/arch/m68k/m68k/m68k_intr.c
329
LIST_INSERT_HEAD(list, ih, ih_link);
sys/arch/m68k/m68k/m68k_intr.c
332
for (curih = LIST_FIRST(list);
sys/arch/macppc/dev/pm_direct.c
255
strinlist(const char *targ, char *list, int listlen)
sys/arch/macppc/dev/pm_direct.c
261
str = list;
sys/arch/macppc/stand/ofwboot/alloc.c
113
LIST_ENTRY(ml) list;
sys/arch/macppc/stand/ofwboot/alloc.c
144
f = f->list.le_next)
sys/arch/macppc/stand/ofwboot/alloc.c
163
f = f->list.le_next;
sys/arch/macppc/stand/ofwboot/alloc.c
196
LIST_REMOVE(f, list);
sys/arch/macppc/stand/ofwboot/alloc.c
203
LIST_INSERT_HEAD(&allocatedlist, f, list);
sys/arch/macppc/stand/ofwboot/alloc.c
222
LIST_REMOVE(a, list);
sys/arch/macppc/stand/ofwboot/alloc.c
223
LIST_INSERT_HEAD(&freelist, a, list);
sys/arch/macppc/stand/ofwboot/alloc.c
234
LIST_REMOVE(m, list);
sys/arch/macppc/stand/ofwboot/alloc.c
240
LIST_REMOVE(m, list);
sys/arch/mips/cavium/dev/octeon_smi.c
261
TAILQ_FOREACH(oi, &octsmi_instances, list) {
sys/arch/powerpc/oea/ofwoea_machdep.c
563
rangemap_t region, holes[32], list[32];
sys/arch/powerpc/oea/ofwoea_machdep.c
565
memset(list, 0, sizeof(list));
sys/arch/powerpc/oea/ofwoea_machdep.c
575
find_ranges(node, list, &cur, RANGE_TYPE_FIRSTPCI);
sys/arch/powerpc/oea/ofwoea_machdep.c
602
if (list[i].type == RANGE_IO && size) {
sys/arch/powerpc/oea/ofwoea_machdep.c
604
tag->pbs_offset = list[i].addr;
sys/arch/powerpc/oea/ofwoea_machdep.c
614
if (list[i].type == RANGE_MEM &&
sys/arch/powerpc/oea/ofwoea_machdep.c
615
list[i].size == size) {
sys/arch/powerpc/oea/ofwoea_machdep.c
617
tag->pbs_offset = list[i].addr;
sys/arch/powerpc/oea/ofwoea_machdep.c
628
find_ranges(node, list, &cur, rangetype);
sys/arch/powerpc/oea/ofwoea_machdep.c
633
DPRINTF("addr=0x%x size=0x%x type=%d\n", list[i].addr,
sys/arch/powerpc/oea/ofwoea_machdep.c
634
list[i].size, list[i].type);
sys/arch/powerpc/oea/ofwoea_machdep.c
636
range = find_lowest_range(list, cur, iomem);
sys/arch/powerpc/oea/ofwoea_machdep.c
643
memcpy(®ion, &list[range], sizeof(rangemap_t));
sys/arch/powerpc/oea/ofwoea_machdep.c
644
list[range].addr = 0;
sys/arch/powerpc/oea/ofwoea_machdep.c
646
range = find_lowest_range(list, cur, iomem);
sys/arch/powerpc/oea/ofwoea_machdep.c
649
if (region.addr + region.size < list[range].addr) {
sys/arch/powerpc/oea/ofwoea_machdep.c
653
holes[nrofholes].size = list[range].addr -
sys/arch/powerpc/oea/ofwoea_machdep.c
657
region.size = list[range].size + list[range].addr -
sys/arch/powerpc/oea/ofwoea_machdep.c
659
list[range].addr = 0;
sys/arch/powerpc/oea/ofwoea_machdep.c
660
range = find_lowest_range(list, cur, iomem);
sys/arch/sandpoint/stand/altboot/pci.c
344
_pcilookup(int bus, int (*match)(int, int, int, unsigned long), unsigned long data, struct pcidev *list, int index, int limit)
sys/arch/sandpoint/stand/altboot/pci.c
359
match, data, list, index, limit);
sys/arch/sandpoint/stand/altboot/pci.c
373
list[index].pvd = pciid;
sys/arch/sandpoint/stand/altboot/pci.c
374
list[index].bdf =
sys/arch/sandpoint/stand/altboot/pci.c
86
pcilookup(type, list, max)
sys/arch/sandpoint/stand/altboot/pci.c
88
struct pcidev *list;
sys/arch/sandpoint/stand/altboot/pci.c
92
return _pcilookup(0, clsmatch, type, list, 0, max);
sys/arch/shark/stand/ofwboot/alloc.c
114
LIST_ENTRY(ml) list;
sys/arch/shark/stand/ofwboot/alloc.c
145
f = f->list.le_next)
sys/arch/shark/stand/ofwboot/alloc.c
164
f = f->list.le_next;
sys/arch/shark/stand/ofwboot/alloc.c
197
LIST_REMOVE(f, list);
sys/arch/shark/stand/ofwboot/alloc.c
204
LIST_INSERT_HEAD(&allocatedlist, f, list);
sys/arch/shark/stand/ofwboot/alloc.c
223
LIST_REMOVE(a, list);
sys/arch/shark/stand/ofwboot/alloc.c
224
LIST_INSERT_HEAD(&freelist, a, list);
sys/arch/shark/stand/ofwboot/alloc.c
234
LIST_REMOVE(m, list);
sys/arch/shark/stand/ofwboot/alloc.c
240
LIST_REMOVE(m, list);
sys/arch/sparc/stand/ofwboot/alloc.c
114
LIST_ENTRY(ml) list;
sys/arch/sparc/stand/ofwboot/alloc.c
145
f = f->list.le_next)
sys/arch/sparc/stand/ofwboot/alloc.c
164
f = f->list.le_next;
sys/arch/sparc/stand/ofwboot/alloc.c
197
LIST_REMOVE(f, list);
sys/arch/sparc/stand/ofwboot/alloc.c
204
LIST_INSERT_HEAD(&allocatedlist, f, list);
sys/arch/sparc/stand/ofwboot/alloc.c
223
LIST_REMOVE(a, list);
sys/arch/sparc/stand/ofwboot/alloc.c
224
LIST_INSERT_HEAD(&freelist, a, list);
sys/arch/sparc/stand/ofwboot/alloc.c
235
LIST_REMOVE(m, list);
sys/arch/sparc/stand/ofwboot/alloc.c
241
LIST_REMOVE(m, list);
sys/arch/x86/x86/mp.c
131
LIST_ENTRY(intr_extra_bus) list;
sys/arch/x86/x86/mp.c
147
LIST_INSERT_HEAD(&intr_extra_buses, iebp, list);
sys/arch/x86/x86/mp.c
169
LIST_FOREACH(iebp, &intr_extra_buses, list) {
sys/arch/zaurus/stand/zboot/disk.h
72
TAILQ_ENTRY(diskinfo) list;
sys/arch/zaurus/stand/zboot/diskprobe.c
127
TAILQ_INSERT_TAIL(&disklist, dip, list);
sys/arch/zaurus/stand/zboot/diskprobe.c
253
TAILQ_INSERT_TAIL(&partlist, pip, list);
sys/arch/zaurus/stand/zboot/diskprobe.c
286
dip = TAILQ_NEXT(dip, list)) {
sys/arch/zaurus/stand/zboot/diskprobe.c
350
pip = TAILQ_NEXT(pip, list)) {
sys/arch/zaurus/stand/zboot/diskprobe.c
49
TAILQ_ENTRY(partinfo) list;
sys/compat/common/kern_time_50.c
355
struct aiocb **list;
sys/compat/common/kern_time_50.c
372
list = kmem_alloc(nent * sizeof(*list), KM_SLEEP);
sys/compat/common/kern_time_50.c
373
error = copyin(SCARG(uap, list), list, nent * sizeof(*list));
sys/compat/common/kern_time_50.c
376
error = aio_suspend1(l, list, nent, SCARG(uap, timeout) ? &ts : NULL);
sys/compat/common/kern_time_50.c
378
kmem_free(list, nent * sizeof(*list));
sys/compat/linux/arch/aarch64/linux_syscallargs.h
104
syscallarg(char *) list;
sys/compat/linux/arch/aarch64/linux_syscallargs.h
90
syscallarg(char *) list;
sys/compat/linux/arch/aarch64/linux_syscallargs.h
97
syscallarg(char *) list;
sys/compat/linux/arch/aarch64/linux_systrace_args.c
100
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/aarch64/linux_systrace_args.c
82
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/aarch64/linux_systrace_args.c
91
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/alpha/linux_syscallargs.h
892
syscallarg(char *) list;
sys/compat/linux/arch/alpha/linux_syscallargs.h
899
syscallarg(char *) list;
sys/compat/linux/arch/alpha/linux_syscallargs.h
906
syscallarg(char *) list;
sys/compat/linux/arch/amd64/linux_syscallargs.h
780
syscallarg(char *) list;
sys/compat/linux/arch/amd64/linux_syscallargs.h
787
syscallarg(char *) list;
sys/compat/linux/arch/amd64/linux_syscallargs.h
794
syscallarg(char *) list;
sys/compat/linux/arch/amd64/linux_systrace_args.c
1421
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/amd64/linux_systrace_args.c
1430
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/amd64/linux_systrace_args.c
1439
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/arm/linux_syscallargs.h
852
syscallarg(char *) list;
sys/compat/linux/arch/arm/linux_syscallargs.h
859
syscallarg(char *) list;
sys/compat/linux/arch/arm/linux_syscallargs.h
866
syscallarg(char *) list;
sys/compat/linux/arch/arm/linux_systrace_args.c
1518
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/arm/linux_systrace_args.c
1527
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/arm/linux_systrace_args.c
1536
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/i386/linux_syscallargs.h
881
syscallarg(char *) list;
sys/compat/linux/arch/i386/linux_syscallargs.h
888
syscallarg(char *) list;
sys/compat/linux/arch/i386/linux_syscallargs.h
895
syscallarg(char *) list;
sys/compat/linux/arch/i386/linux_systrace_args.c
1557
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/i386/linux_systrace_args.c
1566
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/i386/linux_systrace_args.c
1575
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/compat/linux/arch/m68k/linux_syscallargs.h
845
syscallarg(char *) list;
sys/compat/linux/arch/m68k/linux_syscallargs.h
852
syscallarg(char *) list;
sys/compat/linux/arch/m68k/linux_syscallargs.h
859
syscallarg(char *) list;
sys/compat/linux/arch/mips/linux_syscallargs.h
893
syscallarg(char *) list;
sys/compat/linux/arch/mips/linux_syscallargs.h
900
syscallarg(char *) list;
sys/compat/linux/arch/mips/linux_syscallargs.h
907
syscallarg(char *) list;
sys/compat/linux/arch/powerpc/linux_syscallargs.h
783
syscallarg(char *) list;
sys/compat/linux/arch/powerpc/linux_syscallargs.h
790
syscallarg(char *) list;
sys/compat/linux/arch/powerpc/linux_syscallargs.h
797
syscallarg(char *) list;
sys/compat/linux32/arch/aarch64/linux32_systrace_args.c
1459
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/linux32/arch/aarch64/linux32_systrace_args.c
1468
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/linux32/arch/aarch64/linux32_systrace_args.c
1477
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/linux32/arch/amd64/linux32_systrace_args.c
1491
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/linux32/arch/amd64/linux32_systrace_args.c
1500
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/linux32/arch/amd64/linux32_systrace_args.c
1509
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/netbsd32/netbsd32_drm.c
410
netbsd32_pointer_t list;
sys/compat/netbsd32/netbsd32_drm.c
423
netbsd32_pointer_t list; /**< Buffer information */
sys/compat/netbsd32/netbsd32_drm.c
429
netbsd32_pointer_t list;
sys/compat/netbsd32/netbsd32_drm.c
443
req64.list = NETBSD32PTR64(req32.list);
sys/compat/netbsd32/netbsd32_netbsd.c
2264
NETBSD32TOP_UAP(list, char);
sys/compat/netbsd32/netbsd32_netbsd.c
2281
NETBSD32TOP_UAP(list, char);
sys/compat/netbsd32/netbsd32_netbsd.c
2298
NETBSD32TOP_UAP(list, char);
sys/compat/netbsd32/netbsd32_syscallargs.h
2046
syscallarg(netbsd32_charp) list;
sys/compat/netbsd32/netbsd32_syscallargs.h
2053
syscallarg(netbsd32_charp) list;
sys/compat/netbsd32/netbsd32_syscallargs.h
2060
syscallarg(netbsd32_charp) list;
sys/compat/netbsd32/netbsd32_systrace_args.c
2755
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/netbsd32/netbsd32_systrace_args.c
2764
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/compat/netbsd32/netbsd32_systrace_args.c
2773
uarg[1] = (intptr_t) SCARG(p, list).i32; /* netbsd32_charp */
sys/ddb/db_command.c
525
struct db_cmd_tbl_en_head *list;
sys/ddb/db_command.c
529
list = &db_base_cmd_list;
sys/ddb/db_command.c
532
list = &db_show_cmd_list;
sys/ddb/db_command.c
535
list = &db_mach_cmd_list;
sys/ddb/db_command.c
541
TAILQ_INSERT_TAIL(list, list_ent, db_cmd_next);
sys/ddb/db_command.c
553
struct db_cmd_tbl_en_head *list;
sys/ddb/db_command.c
558
list=&db_base_cmd_list;
sys/ddb/db_command.c
561
list=&db_show_cmd_list;
sys/ddb/db_command.c
564
list=&db_mach_cmd_list;
sys/ddb/db_command.c
570
TAILQ_FOREACH (list_ent, list, db_cmd_next) {
sys/ddb/db_command.c
572
TAILQ_REMOVE(list,
sys/ddb/db_command.c
760
db_cmd_list(const struct db_cmd_tbl_en_head *list)
sys/ddb/db_command.c
768
TAILQ_FOREACH(list_ent,list,db_cmd_next) {
sys/ddb/db_command.c
783
TAILQ_FOREACH(list_ent,list,db_cmd_next) {
sys/ddb/db_command.c
822
struct db_cmd_tbl_en_head *list;
sys/ddb/db_command.c
826
list = &db_base_cmd_list;
sys/ddb/db_command.c
828
found = db_cmd_search(db_tok_string, list, &command);
sys/ddb/db_command.c
836
list = &db_show_cmd_list;
sys/ddb/db_command.c
838
list = &db_mach_cmd_list;
sys/ddb/db_command.c
847
db_cmd_list(list);
sys/ddb/db_command.c
851
} while (list != NULL);
sys/dev/acpi/acpi_display.c
2219
KASSERT(PSLIST_READER_FIRST(&acpidisp_notifiers.list,
sys/dev/acpi/acpi_display.c
411
struct pslist_head list;
sys/dev/acpi/acpi_display.c
426
PSLIST_WRITER_INSERT_HEAD(&acpidisp_notifiers.list, adn, adn_entry);
sys/dev/acpi/acpi_display.c
451
PSLIST_READER_FOREACH(adn, &acpidisp_notifiers.list,
sys/dev/ic/tulip.c
4015
int (*set)(struct tulip_softc *), const uint8_t *list,
sys/dev/ic/tulip.c
4023
tsti = tlp_srom_to_ifmedia(list[i]);
sys/dev/lockstat.c
418
LIST_FOREACH(lb, ll, lb_chain.list) {
sys/dev/lockstat.c
429
LIST_REMOVE(lb, lb_chain.list);
sys/dev/lockstat.c
430
LIST_INSERT_HEAD(ll, lb, lb_chain.list);
sys/dev/lockstat.c
439
LIST_INSERT_HEAD(ll, lb, lb_chain.list);
sys/dev/lockstat.h
128
LIST_ENTRY(lsbuf) list;
sys/dev/pci/gcscaudio.c
650
LIST_INSERT_HEAD(&sc->sc_dmalist, p, list);
sys/dev/pci/gcscaudio.c
662
LIST_FOREACH(p, &sc->sc_dmalist, list) {
sys/dev/pci/gcscaudio.c
669
LIST_REMOVE(p, list);
sys/dev/pci/gcscaudio.c
704
LIST_FOREACH(p, &sc->sc_dmalist, list) {
sys/dev/pci/gcscaudio.c
71
LIST_ENTRY(gcscaudio_dma) list;
sys/dev/pci/if_iavf.c
4980
vcaddr = addrs->list;
sys/dev/pci/if_iavfvar.h
199
struct iavf_vc_eth_addr list[1];
sys/dev/pci/ixgbe/if_sriov.c
431
u16 *list = (u16*)&msg[1];
sys/dev/pci/ixgbe/if_sriov.c
444
vf->mc_hash[i] = list[i];
sys/dev/pci/mfii.c
2728
struct mfii_ccb *list;
sys/dev/pci/mfii.c
2731
list = SIMPLEQ_FIRST(&sc->sc_abort_list);
sys/dev/pci/mfii.c
2735
while (list != NULL) {
sys/dev/pci/mfii.c
2736
struct mfii_ccb *ccb = list;
sys/dev/pci/mfii.c
2741
list = SIMPLEQ_NEXT(ccb, ccb_link);
sys/dev/pci/pci_resource.c
1125
KASSERT(!SIMPLEQ_EMPTY(&info->ranges[PCI_RANGE_BUS]->list));
sys/dev/pci/pci_resource.c
144
SIMPLEQ_HEAD(, pci_resource_range) list;
sys/dev/pci/pci_resource.c
173
SIMPLEQ_FOREACH(range, &pr->pr_busranges->list, entry) {
sys/dev/pci/pci_resource.c
211
SIMPLEQ_INIT(&arena->list);
sys/dev/pci/pci_resource.c
237
SIMPLEQ_FOREACH(range, &arena->list, entry) {
sys/dev/pci/pci_resource.c
244
SIMPLEQ_INSERT_AFTER(&arena->list, prev, new, entry);
sys/dev/pci/pci_resource.c
246
SIMPLEQ_INSERT_HEAD(&arena->list, new, entry);
sys/dev/pci/pci_resource.c
347
&pd->pd_bridge.ranges[PCI_RANGE_IO]->list,
sys/dev/pci/pci_resource.c
360
&pd->pd_bridge.ranges[PCI_RANGE_MEM]->list,
sys/dev/pci/pci_resource.c
373
&pd->pd_bridge.ranges[PCI_RANGE_PMEM]->list,
sys/dev/pci/pci_resource.c
902
&bridge->pd_bridge.ranges[prtype]->list,
sys/dev/pci/pci_resource.c
955
uint8_t startbus = SIMPLEQ_FIRST(&busarena->list)->start;
sys/dev/pci/pci_resource.c
956
uint8_t endbus = SIMPLEQ_LAST(&busarena->list, pci_resource_range,
sys/dev/pci/radeonfb.c
4531
radeonfb_hasres(struct videomode *list, int nlist, int x, int y)
sys/dev/pci/radeonfb.c
4536
if ((x == list[i].hdisplay) &&
sys/dev/pci/radeonfb.c
4537
(y == list[i].vdisplay)) {
sys/dev/raidframe/rf_shutdown.c
113
*list = NULL;
sys/dev/raidframe/rf_shutdown.c
87
rf_ShutdownList(RF_ShutdownList_t **list)
sys/dev/raidframe/rf_shutdown.c
95
for (r = *list; r; r = next) {
sys/dev/wsfont/wsfont.c
347
static TAILQ_HEAD(,font) list;
sys/dev/wsfont/wsfont.c
445
TAILQ_FOREACH(ent, &list, chain) {
sys/dev/wsfont/wsfont.c
588
TAILQ_INIT(&list);
sys/dev/wsfont/wsfont.c
595
TAILQ_INSERT_TAIL(&list, ent, chain);
sys/dev/wsfont/wsfont.c
604
TAILQ_FOREACH(ent, &list, chain) {
sys/dev/wsfont/wsfont.c
666
TAILQ_FOREACH(ent, &list, chain) {
sys/dev/wsfont/wsfont.c
686
TAILQ_FOREACH(ent, &list, chain) {
sys/dev/wsfont/wsfont.c
721
TAILQ_INSERT_TAIL(&list, ent, chain);
sys/dev/wsfont/wsfont.c
761
TAILQ_REMOVE(&list, ent, chain);
sys/dist/pf/net/pf.c
2383
rpool->cur = TAILQ_FIRST(&rpool->list);
sys/dist/pf/net/pf.c
5313
if (TAILQ_EMPTY(&r->rpool.list)) {
sys/dist/pf/net/pf.c
5518
if (TAILQ_EMPTY(&r->rpool.list)) {
sys/dist/pf/net/pf_ioctl.c
1451
TAILQ_INIT(&rule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
1546
pf_mv_pool(&pf_pabuf, &rule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
1550
(TAILQ_FIRST(&rule->rpool.list) == NULL))
sys/dist/pf/net/pf_ioctl.c
1557
rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
1706
TAILQ_INIT(&newrule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
1799
pf_mv_pool(&pf_pabuf, &newrule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
1805
(TAILQ_FIRST(&newrule->rpool.list) == NULL))
sys/dist/pf/net/pf_ioctl.c
1812
newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
sys/dist/pf/net/pf_ioctl.c
2444
TAILQ_FOREACH(pa, &pool->list, entries)
sys/dist/pf/net/pf_ioctl.c
2459
pa = TAILQ_FIRST(&pool->list);
sys/dist/pf/net/pf_ioctl.c
2545
oldpa = TAILQ_FIRST(&pool->list);
sys/dist/pf/net/pf_ioctl.c
2547
oldpa = TAILQ_LAST(&pool->list, pf_palist);
sys/dist/pf/net/pf_ioctl.c
2551
oldpa = TAILQ_FIRST(&pool->list);
sys/dist/pf/net/pf_ioctl.c
2563
TAILQ_REMOVE(&pool->list, oldpa, entries);
sys/dist/pf/net/pf_ioctl.c
2570
TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
sys/dist/pf/net/pf_ioctl.c
2575
TAILQ_INSERT_AFTER(&pool->list, oldpa,
sys/dist/pf/net/pf_ioctl.c
2579
pool->cur = TAILQ_FIRST(&pool->list);
sys/dist/pf/net/pf_ioctl.c
586
pf_empty_pool(&rule->rpool.list);
sys/dist/pf/net/pf_osfp.c
271
pf_osfp_match(struct pf_osfp_enlist *list, pf_osfp_t os)
sys/dist/pf/net/pf_osfp.c
279
if (list == NULL) {
sys/dist/pf/net/pf_osfp.c
284
SLIST_FOREACH(entry, list, fp_entry) {
sys/dist/pf/net/pf_osfp.c
433
pf_osfp_find(struct pf_osfp_list *list, struct pf_os_fingerprint *find,
sys/dist/pf/net/pf_osfp.c
449
SLIST_FOREACH(f, list, fp_next) {
sys/dist/pf/net/pf_osfp.c
507
pf_osfp_find_exact(struct pf_osfp_list *list, struct pf_os_fingerprint *find)
sys/dist/pf/net/pf_osfp.c
511
SLIST_FOREACH(f, list, fp_next) {
sys/dist/pf/net/pf_osfp.c
528
pf_osfp_insert(struct pf_osfp_list *list, struct pf_os_fingerprint *ins)
sys/dist/pf/net/pf_osfp.c
534
SLIST_FOREACH(f, list, fp_next)
sys/dist/pf/net/pf_osfp.c
539
SLIST_INSERT_HEAD(list, ins, fp_next);
sys/dist/pf/net/pfvar.h
397
struct pf_palist list;
sys/fs/nfs/common/nfs_commonsubs.c
3712
SLIST_ENTRY(list) next;
sys/fs/nfs/common/nfs_commonsubs.c
3716
SLIST_HEAD(, list) head;
sys/fs/nfs/common/nfs_commonsubs.c
3801
lsp = (struct list *)malloc(sizeof (struct list)
sys/fs/nfs/common/nfs_fha.c
243
LIST_FOREACH(fhe, &fhs->list, link)
sys/fs/nfs/common/nfs_fha.c
248
LIST_INSERT_HEAD(&fhs->list, fhe, link);
sys/fs/nfs/common/nfs_fha.c
491
if (!LIST_EMPTY(&softc->fha_hash[i].list))
sys/fs/nfs/common/nfs_fha.c
502
if (LIST_EMPTY(&softc->fha_hash[i].list)) {
sys/fs/nfs/common/nfs_fha.c
508
LIST_FOREACH(fhe, &softc->fha_hash[i].list, link) {
sys/fs/nfs/common/nfs_fha.h
75
struct fha_hash_entry_list list;
sys/fs/nfs/common/nfsrvstate.h
72
struct nfssessionhashhead list;
sys/fs/nfs/server/nfs_nfsdstate.c
5896
LIST_FOREACH(sep, &shp->list, sess_hash) {
sys/fs/nfs/server/nfs_nfsdstate.c
635
LIST_INSERT_HEAD(&shp->list, nsep, sess_hash);
sys/fs/nfs/server/nfs_nfsdsubs.c
2062
LIST_INIT(&nfssessionhash[i].list);
sys/fs/v7fs/v7fs_datablock.c
502
v7fs_daddr_t *list;
sys/fs/v7fs/v7fs_datablock.c
510
list = (v7fs_daddr_t *)buf;
sys/fs/v7fs/v7fs_datablock.c
511
blk = V7FS_VAL32(fs, list[n]);
sys/kern/kern_entropy.c
1834
LIST_INSERT_HEAD(&E->sources, rs, list);
sys/kern/kern_entropy.c
1865
LIST_REMOVE(rs, list);
sys/kern/kern_entropy.c
1876
LIST_REMOVE(rs, list);
sys/kern/kern_entropy.c
1995
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
2602
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
2610
rs = LIST_NEXT(rs, list);
sys/kern/kern_entropy.c
2638
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
2646
rs = LIST_NEXT(rs, list);
sys/kern/kern_entropy.c
2670
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
2701
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
2733
LIST_FOREACH(rs, &E->sources, list) {
sys/kern/kern_entropy.c
422
LIST_FOREACH(rs, &E->sources, list)
sys/kern/kern_event.c
1176
struct klist *list = &fdp->fd_knhash[KN_HASH(kntrack->kn_id,
sys/kern/kern_event.c
1178
SLIST_INSERT_HEAD(list, kntrack, kn_link);
sys/kern/kern_event.c
1179
SLIST_INSERT_HEAD(list, knchild, kn_link);
sys/kern/kern_event.c
1900
struct klist *list;
sys/kern/kern_event.c
1950
list = &fdp->fd_knhash[
sys/kern/kern_event.c
1952
SLIST_FOREACH(kn, list, kn_link) {
sys/kern/kern_event.c
2013
list = &fdp->fd_knhash[KN_HASH(kn->kn_id,
sys/kern/kern_event.c
2017
list = (struct klist *)
sys/kern/kern_event.c
2022
SLIST_INSERT_HEAD(list, kn, kn_link);
sys/kern/kern_event.c
2654
kqueue_doclose(struct kqueue *kq, struct klist *list, int fd)
sys/kern/kern_event.c
2664
for (kn = SLIST_FIRST(list); kn != NULL;) {
sys/kern/kern_event.c
2675
kn = SLIST_FIRST(list);
sys/kern/kern_event.c
2775
knote(struct klist *list, long hint)
sys/kern/kern_event.c
2779
SLIST_FOREACH_SAFE(kn, list, kn_selnext, tmpkn) {
sys/kern/kern_event.c
2800
struct klist *list;
sys/kern/kern_event.c
2807
list = (struct klist *)&fdp->fd_dt->dt_ff[fd]->ff_knlist;
sys/kern/kern_event.c
2808
while ((kn = SLIST_FIRST(list)) != NULL) {
sys/kern/kern_event.c
2825
struct klist *list;
sys/kern/kern_event.c
2844
list = (struct klist *)&fdp->fd_dt->dt_ff[kn->kn_id]->ff_knlist;
sys/kern/kern_event.c
2846
list = &fdp->fd_knhash[KN_HASH(kn->kn_id, fdp->fd_knhashmask)];
sys/kern/kern_event.c
2848
SLIST_REMOVE(list, kn, knote, kn_link);
sys/kern/kern_event.c
2993
klist_init(struct klist *list)
sys/kern/kern_event.c
2995
SLIST_INIT(list);
sys/kern/kern_event.c
3002
klist_fini(struct klist *list)
sys/kern/kern_event.c
3014
SLIST_FOREACH(kn, list, kn_selnext) {
sys/kern/kern_event.c
3030
klist_insert(struct klist *list, struct knote *kn)
sys/kern/kern_event.c
3032
SLIST_INSERT_HEAD(list, kn, kn_selnext);
sys/kern/kern_event.c
3040
klist_remove(struct klist *list, struct knote *kn)
sys/kern/kern_event.c
3042
SLIST_REMOVE(list, kn, knote, kn_selnext);
sys/kern/kern_event.c
3043
return SLIST_EMPTY(list);
sys/kern/kern_exec.c
660
char const * const *list;
sys/kern/kern_exec.c
663
list = nexecs == 0 ? native : compat;
sys/kern/kern_exec.c
664
for (i = 0; list[i] != NULL; i++) {
sys/kern/kern_exec.c
665
if (module_autoload(list[i], MODULE_CLASS_EXEC) != 0) {
sys/kern/kern_history.c
263
LIST_FOREACH(h, &kern_histories, list) {
sys/kern/kern_history.c
329
LIST_FOREACH(h, &kern_histories, list) {
sys/kern/kern_history.c
447
LIST_FOREACH(h, &kern_histories, list) {
sys/kern/kern_hook.c
108
LIST_INSERT_HEAD(list, hd, hk_list);
sys/kern/kern_hook.c
117
hook_disestablish(hook_list_t *list, krwlock_t *lock, void *vhook)
sys/kern/kern_hook.c
125
LIST_FOREACH(hd, list, hk_list) {
sys/kern/kern_hook.c
140
hook_destroy(hook_list_t *list)
sys/kern/kern_hook.c
144
while ((hd = LIST_FIRST(list)) != NULL) {
sys/kern/kern_hook.c
151
hook_proc_run(hook_list_t *list, krwlock_t *lock, struct proc *p)
sys/kern/kern_hook.c
159
LIST_FOREACH(hd, list, hk_list) {
sys/kern/kern_hook.c
95
hook_establish(hook_list_t *list, krwlock_t *lock,
sys/kern/kern_proc.c
1763
proclist_foreach_call(struct proclist *list,
sys/kern/kern_proc.c
1772
for (p = LIST_FIRST(list); ret == 0 && p != NULL;) {
sys/kern/kern_timeout.c
135
#define CIRCQ_INIT(list) \
sys/kern/kern_timeout.c
137
(list)->cq_next_l = (list); \
sys/kern/kern_timeout.c
138
(list)->cq_prev_l = (list); \
sys/kern/kern_timeout.c
141
#define CIRCQ_INSERT(elem, list) \
sys/kern/kern_timeout.c
143
(elem)->cq_prev_e = (list)->cq_prev_e; \
sys/kern/kern_timeout.c
144
(elem)->cq_next_l = (list); \
sys/kern/kern_timeout.c
145
(list)->cq_prev_l->cq_next_l = (elem); \
sys/kern/kern_timeout.c
146
(list)->cq_prev_l = (elem); \
sys/kern/kern_timeout.c
166
#define CIRCQ_FIRST(list) ((list)->cq_next_e)
sys/kern/kern_timeout.c
168
#define CIRCQ_LAST(elem,list) ((elem)->cq_next_l == (list))
sys/kern/kern_timeout.c
169
#define CIRCQ_EMPTY(list) ((list)->cq_next_l == (list))
sys/kern/subr_kcov.c
224
LIST_ENTRY(kcov_remote) list;
sys/kern/subr_kcov.c
240
LIST_FOREACH(kr, &kcov_remote_list, list) {
sys/kern/subr_kcov.c
270
LIST_INSERT_HEAD(&kcov_remote_list, kr, list);
sys/kern/subr_pool.c
3086
if (quar->list[i] == 0)
sys/kern/subr_pool.c
3088
pool_do_put(pp, (void *)quar->list[i], &pq);
sys/kern/subr_pool.c
3107
old = quar->list[quar->rotor];
sys/kern/subr_pool.c
3108
quar->list[quar->rotor] = (uintptr_t)v;
sys/kern/subr_vmem.c
1190
struct vmem_freelist *list;
sys/kern/subr_vmem.c
1255
for (list = first; list < end; list++) {
sys/kern/subr_vmem.c
1256
bt = LIST_FIRST(list);
sys/kern/subr_vmem.c
1284
for (list = first; list < end; list++) {
sys/kern/subr_vmem.c
1285
LIST_FOREACH(bt, list, bt_freelist) {
sys/kern/subr_vmem.c
480
struct vmem_hashlist *list;
sys/kern/subr_vmem.c
484
list = &vm->vm_hashlist[hash & vm->vm_hashmask];
sys/kern/subr_vmem.c
486
return list;
sys/kern/subr_vmem.c
492
struct vmem_hashlist *list;
sys/kern/subr_vmem.c
495
list = bt_hashhead(vm, addr);
sys/kern/subr_vmem.c
496
LIST_FOREACH(bt, list, bt_hashlist) {
sys/kern/subr_vmem.c
518
struct vmem_hashlist *list;
sys/kern/subr_vmem.c
522
list = bt_hashhead(vm, bt->bt_start);
sys/kern/subr_vmem.c
523
LIST_INSERT_HEAD(list, bt, bt_hashlist);
sys/kern/subr_vmem.c
565
struct vmem_freelist *list;
sys/kern/subr_vmem.c
567
list = bt_freehead_tofree(vm, bt->bt_size);
sys/kern/subr_vmem.c
568
LIST_INSERT_HEAD(list, bt, bt_freelist);
sys/kern/subr_workqueue.c
139
workqueue_runlist(struct workqueue *wq, struct workqhead *list)
sys/kern/subr_workqueue.c
148
for (wk = SIMPLEQ_FIRST(list); wk != NULL; wk = next) {
sys/kern/sys_aio.c
1141
TAILQ_FOREACH(st, &aiosp->active, list) {
sys/kern/sys_aio.c
1148
TAILQ_FOREACH(job, &st->fg->queue, list) {
sys/kern/sys_aio.c
1267
TAILQ_FOREACH(aiocbp, &aiosp->aio_hash[hash], list) {
sys/kern/sys_aio.c
1303
TAILQ_FOREACH(aiocbp, &aiosp->aio_hash[hash], list) {
sys/kern/sys_aio.c
1310
TAILQ_REMOVE(&aiosp->aio_hash[hash], aiocbp, list);
sys/kern/sys_aio.c
1339
TAILQ_FOREACH(found, &aiosp->aio_hash[hash], list) {
sys/kern/sys_aio.c
1347
TAILQ_INSERT_HEAD(&aiosp->aio_hash[hash], aiocbp, list);
sys/kern/sys_aio.c
1393
TAILQ_FOREACH_SAFE(aiocbp, &aiosp->aio_hash[i], list, tmp) {
sys/kern/sys_aio.c
1394
TAILQ_REMOVE(&aiosp->aio_hash[i], aiocbp, list);
sys/kern/sys_aio.c
1818
TAILQ_FOREACH_SAFE(job, &aiosp->jobs, list, tmp) {
sys/kern/sys_aio.c
1909
struct aiocb **list;
sys/kern/sys_aio.c
1930
list = kmem_alloc(nent * sizeof(*list), KM_SLEEP);
sys/kern/sys_aio.c
1931
error = copyin(SCARG(uap, list), list, nent * sizeof(*list));
sys/kern/sys_aio.c
1936
error = aiosp_suspend(&aio->aiosp, list, nent, SCARG(uap, timeout) ?
sys/kern/sys_aio.c
1939
kmem_free(list, nent * sizeof(*list));
sys/kern/sys_aio.c
2024
error = copyin(SCARG(uap, list), aiocbp_list,
sys/kern/sys_aio.c
2201
TAILQ_FOREACH(job, &sp->jobs, list) {
sys/kern/sys_aio.c
2215
TAILQ_FOREACH(st, &sp->active, list) {
sys/kern/sys_aio.c
2253
TAILQ_FOREACH(hc, &sp->aio_hash[b], list) {
sys/kern/sys_aio.c
402
TAILQ_REMOVE(&aiosp->jobs, job, list);
sys/kern/sys_aio.c
457
TAILQ_FOREACH_SAFE(job, &sp->jobs, list, tmp) {
sys/kern/sys_aio.c
499
TAILQ_REMOVE(&sp->jobs, job, list);
sys/kern/sys_aio.c
505
TAILQ_INSERT_TAIL(&fg->queue, job, list);
sys/kern/sys_aio.c
645
TAILQ_REMOVE(&sp->freelist, *aiost, list);
sys/kern/sys_aio.c
647
TAILQ_INSERT_TAIL(&sp->active, *aiost, list);
sys/kern/sys_aio.c
704
TAILQ_INSERT_TAIL(&aiosp->jobs, job, list);
sys/kern/sys_aio.c
732
TAILQ_INSERT_TAIL(&sp->freelist, st, list);
sys/kern/sys_aio.c
780
TAILQ_REMOVE(&fg->queue, job, list);
sys/kern/sys_aio.c
875
TAILQ_REMOVE(&sp->active, st, list);
sys/kern/sys_aio.c
878
TAILQ_INSERT_TAIL(&sp->freelist, st, list);
sys/kern/sys_aio.c
894
TAILQ_REMOVE(&fg->queue, job, list);
sys/kern/sys_aio.c
913
TAILQ_REMOVE(&sp->freelist, st, list);
sys/kern/sys_aio.c
916
TAILQ_REMOVE(&sp->active, st, list);
sys/kern/systrace_args.c
2858
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/kern/systrace_args.c
2867
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/kern/systrace_args.c
2876
uarg[1] = (intptr_t) SCARG(p, list); /* char * */
sys/kern/systrace_args.c
3039
uarg[0] = (intptr_t) SCARG(p, list); /* const struct aiocb *const * */
sys/kern/systrace_args.c
3056
uarg[1] = (intptr_t) SCARG(p, list); /* struct aiocb *const * */
sys/kern/systrace_args.c
3323
uarg[0] = (intptr_t) SCARG(p, list); /* const struct aiocb *const * */
sys/kern/vfs_cache.c
1114
TAILQ_INIT(&cache_lru.list[LRU_ACTIVE]);
sys/kern/vfs_cache.c
1115
TAILQ_INIT(&cache_lru.list[LRU_INACTIVE]);
sys/kern/vfs_cache.c
1334
TAILQ_REMOVE(&cache_lru.list[ncp->nc_lrulist], ncp, nc_lru);
sys/kern/vfs_cache.c
1335
TAILQ_INSERT_TAIL(&cache_lru.list[LRU_ACTIVE], ncp, nc_lru);
sys/kern/vfs_cache.c
1372
ncp = TAILQ_FIRST(&cache_lru.list[LRU_ACTIVE]);
sys/kern/vfs_cache.c
1378
TAILQ_REMOVE(&cache_lru.list[LRU_ACTIVE], ncp, nc_lru);
sys/kern/vfs_cache.c
1379
TAILQ_INSERT_TAIL(&cache_lru.list[LRU_INACTIVE], ncp, nc_lru);
sys/kern/vfs_cache.c
1418
ncp = TAILQ_FIRST(&cache_lru.list[LRU_INACTIVE]);
sys/kern/vfs_cache.c
1433
TAILQ_REMOVE(&cache_lru.list[LRU_INACTIVE],
sys/kern/vfs_cache.c
1435
TAILQ_INSERT_TAIL(&cache_lru.list[LRU_INACTIVE],
sys/kern/vfs_cache.c
1551
TAILQ_FOREACH(ncp, &cache_lru.list[id], nc_lru) {
sys/kern/vfs_cache.c
1564
TAILQ_FOREACH(ncp, &cache_lru.list[id], nc_lru) {
sys/kern/vfs_cache.c
249
TAILQ_HEAD(, namecache) list[LRU_COUNT];
sys/kern/vfs_cache.c
411
TAILQ_REMOVE(&cache_lru.list[ncp->nc_lrulist], ncp, nc_lru);
sys/kern/vfs_cache.c
986
TAILQ_INSERT_TAIL(&cache_lru.list[LRU_ACTIVE], ncp, nc_lru);
sys/kern/vfs_xattr.c
1060
char *list;
sys/kern/vfs_xattr.c
1070
list = SCARG(uap, list);
sys/kern/vfs_xattr.c
1074
list, size, 0, l, &listsize_usr);
sys/kern/vfs_xattr.c
1078
if (list)
sys/kern/vfs_xattr.c
1079
list += listsize_usr;
sys/kern/vfs_xattr.c
1084
list, size, 0, l, &listsize_sys);
sys/kern/vfs_xattr.c
1114
char *list;
sys/kern/vfs_xattr.c
1124
list = SCARG(uap, list);
sys/kern/vfs_xattr.c
1128
list, size, 0, l, &listsize_usr);
sys/kern/vfs_xattr.c
1131
if (list)
sys/kern/vfs_xattr.c
1132
list += listsize_usr;
sys/kern/vfs_xattr.c
1137
list, size, 0, l, &listsize_sys);
sys/kern/vfs_xattr.c
1168
char *list;
sys/kern/vfs_xattr.c
1178
list = SCARG(uap, list);
sys/kern/vfs_xattr.c
1182
list, size, 0, l, &listsize_usr);
sys/kern/vfs_xattr.c
1186
if (list)
sys/kern/vfs_xattr.c
1187
list += listsize_usr;
sys/kern/vfs_xattr.c
1192
list, size, 0, l, &listsize_sys);
sys/net/if_gif.c
101
LIST_HEAD(gif_sclist, gif_softc) list;
sys/net/if_gif.c
1107
LIST_FOREACH(sc2, &gif_softcs.list, gif_list) {
sys/net/if_gif.c
334
LIST_INIT(&gif_softcs.list);
sys/net/if_gif.c
348
if (!LIST_EMPTY(&gif_softcs.list)) {
sys/net/if_gif.c
393
LIST_INSERT_HEAD(&gif_softcs.list, sc, gif_list);
sys/net/if_ipsec.c
1215
LIST_FOREACH(sc2, &ipsec_softcs.list, ipsec_list) {
sys/net/if_ipsec.c
142
LIST_HEAD(ipsec_sclist, ipsec_softc) list;
sys/net/if_ipsec.c
1507
LIST_FOREACH(sc2, &ipsec_softcs.list, ipsec_list) {
sys/net/if_ipsec.c
1558
LIST_FOREACH(sc2, &ipsec_softcs.list, ipsec_list) {
sys/net/if_ipsec.c
241
if (!LIST_EMPTY(&ipsec_softcs.list)) {
sys/net/if_ipsec.c
267
if (!LIST_EMPTY(&ipsec_softcs.list)) {
sys/net/if_ipsec.c
293
if (!LIST_EMPTY(&ipsec_softcs.list)) {
sys/net/if_ipsec.c
424
LIST_INIT(&ipsec_softcs.list);
sys/net/if_ipsec.c
460
LIST_INSERT_HEAD(&ipsec_softcs.list, sc, ipsec_list);
sys/net/if_l2tp.c
202
LIST_INIT(&l2tp_softcs.list);
sys/net/if_l2tp.c
218
if (!LIST_EMPTY(&l2tp_softcs.list)) {
sys/net/if_l2tp.c
274
LIST_INSERT_HEAD(&l2tp_softcs.list, sc, l2tp_list);
sys/net/if_l2tp.c
98
LIST_HEAD(l2tp_sclist, l2tp_softc) list;
sys/net/if_ppp.c
196
LIST_HEAD(ppp_sclist, ppp_softc) list;
sys/net/if_ppp.c
237
LIST_INIT(&ppp_softcs.list);
sys/net/if_ppp.c
246
if (!LIST_EMPTY(&ppp_softcs.list))
sys/net/if_ppp.c
271
LIST_FOREACH(sci, &ppp_softcs.list, sc_iflist) {
sys/net/if_ppp.c
286
LIST_FOREACH(sci, &ppp_softcs.list, sc_iflist) {
sys/net/if_ppp.c
303
LIST_INSERT_HEAD(&ppp_softcs.list, sc, sc_iflist);
sys/net/if_ppp.c
373
LIST_FOREACH(scf, &ppp_softcs.list, sc_iflist) {
sys/net/lagg/if_lagg_lacp.c
427
tlv_parse(void *vp, size_t len, struct tlv *list)
sys/net/lagg/if_lagg_lacp.c
445
for (i = 0; list[i].tlv_t != TLV_TYPE_TERMINATE; i++) {
sys/net/lagg/if_lagg_lacp.c
446
if (th->tlv_type != list[i].tlv_t)
sys/net/lagg/if_lagg_lacp.c
449
if (th->tlv_length - sizeof(*th) != list[i].tlv_l)
sys/net/lagg/if_lagg_lacp.c
452
if (list[i].tlv_v == NULL) {
sys/net/lagg/if_lagg_lacp.c
453
list[i].tlv_v =
sys/net/npf/lpm.c
182
lpm_ent_t *list = hmap->bucket[n];
sys/net/npf/lpm.c
184
while (list) {
sys/net/npf/lpm.c
185
lpm_ent_t *entry = list;
sys/net/npf/lpm.c
189
list = entry->next;
sys/net/npf/npf_params.c
106
npf_paramreg_t *paramreg = pinfo->list;
sys/net/npf/npf_params.c
145
for (npf_paramreg_t *pr = npf->paraminfo->list; pr; pr = pr->next) {
sys/net/npf/npf_params.c
215
paramreg->next = pinfo->list;
sys/net/npf/npf_params.c
216
pinfo->list = paramreg;
sys/net/npf/npf_params.c
48
npf_paramreg_t * list;
sys/net80211/ieee80211_ioctl.c
1890
struct ieee80211req_chanlist list;
sys/net80211/ieee80211_ioctl.c
1894
if (ireq->i_len != sizeof(list))
sys/net80211/ieee80211_ioctl.c
1896
error = copyin(ireq->i_data, &list, sizeof(list));
sys/net80211/ieee80211_ioctl.c
1913
if (isset(list.ic_channels, j) && isset(ic->ic_chan_avail, i))
sys/netbt/rfcomm_session.c
169
rfcomm_session_alloc(struct rfcomm_session_list *list,
sys/netbt/rfcomm_session.c
204
LIST_INSERT_HEAD(list, rs, rs_next);
sys/netinet/ip_encap.c
130
struct pslist_head list;
sys/netinet/ip_encap.c
134
.list = PSLIST_INITIALIZER,
sys/netinet/ip_encap.c
136
#define encap_table encaptab.list
sys/netinet/ip_mroute.c
2248
free_bw_list(struct bw_meter *list)
sys/netinet/ip_mroute.c
2250
while (list != NULL) {
sys/netinet/ip_mroute.c
2251
struct bw_meter *x = list;
sys/netinet/ip_mroute.c
2253
list = list->bm_mfc_next;
sys/netinet/ip_mroute.c
2282
struct bw_meter *list;
sys/netinet/ip_mroute.c
2284
list = mfc->mfc_bw_meter;
sys/netinet/ip_mroute.c
2286
free_bw_list(list);
sys/netinet/sctp_input.c
2599
uint16_t *list, temp;
sys/netinet/sctp_input.c
2607
list = resp->list_of_streams;
sys/netinet/sctp_input.c
2609
temp = ntohs(list[i]);
sys/netinet/sctp_input.c
2610
list[i] = temp;
sys/netinet/sctp_input.c
2611
if (list[i] >= stcb->asoc.streamincnt) {
sys/netinet/sctp_input.c
2612
printf("Invalid stream in-stream reset %d\n", list[i]);
sys/netinet/sctp_input.c
2615
stcb->asoc.strmin[(list[i])].last_sequence_delivered = 0xffff;
sys/netinet/sctp_input.c
2618
list = NULL;
sys/netinet/sctp_input.c
2623
sctp_ulp_notify(SCTP_NOTIFY_STR_RESET_RECV, stcb, number_entries, (void *)list);
sys/netinet/sctp_output.c
8660
struct sctp_stream_reset_request *req, int number_entries, uint16_t *list)
sys/netinet/sctp_output.c
8670
if (list[i] >= stcb->asoc.streamoutcnt) {
sys/netinet/sctp_output.c
8674
stcb->asoc.strmout[(list[i])].next_sequence_sent = 0;
sys/netinet/sctp_output.c
8677
sctp_ulp_notify(SCTP_NOTIFY_STR_RESET_SEND, stcb, number_entries, (void *)list);
sys/netinet/sctp_output.c
8690
uint16_t *list=NULL;
sys/netinet/sctp_output.c
8778
list = req->list_of_streams;
sys/netinet/sctp_output.c
8781
strack->sr_resp.list_of_streams[i] = list[i];
sys/netinet/sctp_output.c
8792
temp = ntohs(list[i]);
sys/netinet/sctp_output.c
8793
list[i] = temp;
sys/netinet/sctp_output.c
8798
sctp_reset_the_streams(stcb, req , number_entries, list);
sys/netinet/sctp_output.c
8802
sctp_send_str_reset_req(stcb, number_entries, list, two_way, not_peer);
sys/netinet/sctp_output.c
8819
int number_entrys, uint16_t *list, uint8_t two_way, uint8_t not_peer)
sys/netinet/sctp_output.c
8935
strreq->sr_req.list_of_streams[i] = htons(list[i]);
sys/netinet/sctp_pcb.c
3595
sctp_insert_laddr(struct sctpladdr *list, struct ifaddr *ifa) {
sys/netinet/sctp_pcb.c
3612
LIST_INSERT_HEAD(list, laddr, sctp_nxt_addr);
sys/netinet/sctputil.c
2371
int number_entries, uint16_t *list, int flag)
sys/netinet/sctputil.c
2413
strreset->strreset_list[i] = list[i];
sys/opencrypto/crypto.c
93
struct cryptocap *list;
sys/opencrypto/crypto.c
97
#define crypto_drivers (crypto_drv.list)
sys/rump/librump/rumpkern/rump_syscalls.c
4245
rump___sysimpl_listxattr(const char * path, char * list, size_t size)
sys/rump/librump/rumpkern/rump_syscalls.c
4254
SPARG(&callarg, list) = list;
sys/rump/librump/rumpkern/rump_syscalls.c
4275
rump___sysimpl_llistxattr(const char * path, char * list, size_t size)
sys/rump/librump/rumpkern/rump_syscalls.c
4284
SPARG(&callarg, list) = list;
sys/rump/librump/rumpkern/rump_syscalls.c
4305
rump___sysimpl_flistxattr(int fd, char * list, size_t size)
sys/rump/librump/rumpkern/rump_syscalls.c
4314
SPARG(&callarg, list) = list;
sys/rump/librump/rumpkern/rump_syscalls.c
4845
rump___sysimpl_lio_listio(int mode, struct aiocb *const * list, int nent, struct sigevent * sig)
sys/rump/librump/rumpkern/rump_syscalls.c
4854
SPARG(&callarg, list) = list;
sys/rump/librump/rumpkern/rump_syscalls.c
5434
rump___sysimpl_aio_suspend50(const struct aiocb *const * list, int nent, const struct timespec * timeout)
sys/rump/librump/rumpkern/rump_syscalls.c
5442
SPARG(&callarg, list) = list;
sys/stand/efiboot/efipxe.c
111
TAILQ_INSERT_TAIL(&efi_pxelist, epi, list);
sys/stand/efiboot/efipxe.c
121
TAILQ_FOREACH(epi, &efi_pxelist, list) {
sys/stand/efiboot/efipxe.c
30
TAILQ_ENTRY(efipxeinfo) list;
sys/stand/efiboot/efipxe.c
90
TAILQ_FOREACH(epi, &efi_pxelist, list) {
sys/sys/aio.h
126
TAILQ_ENTRY(aio_job) list;
sys/sys/aio.h
150
TAILQ_ENTRY(aiost) list;
sys/sys/aio.h
162
TAILQ_ENTRY(aiocbp) list;
sys/sys/callout.h
76
struct callout_circq *list;
sys/sys/callout.h
81
struct callout_circq *list;
sys/sys/callout.h
86
#define cq_next_l cq_next.list
sys/sys/callout.h
87
#define cq_prev_l cq_prev.list
sys/sys/event.h
207
#define KNOTE(list, hint) if (!SLIST_EMPTY(list)) knote(list, hint)
sys/sys/futex.h
167
struct futex_robust_list list;
sys/sys/kernhist.h
152
LIST_INSERT_HEAD(&kern_histories, &(NAME), list); \
sys/sys/kernhist.h
62
LIST_ENTRY(kern_history) list; /* link on list of all histories */
sys/sys/pool.h
112
intptr_t list[POOL_QUARANTINE_DEPTH];
sys/sys/rndsource.h
69
LIST_ENTRY(krndsource) list; /* the linked list */
sys/sys/syscallargs.h
2481
syscallarg(char *) list;
sys/sys/syscallargs.h
2488
syscallarg(char *) list;
sys/sys/syscallargs.h
2495
syscallarg(char *) list;
sys/sys/syscallargs.h
2625
syscallarg(const struct aiocb *const *) list;
sys/sys/syscallargs.h
2639
syscallarg(struct aiocb *const *) list;
sys/sys/syscallargs.h
2868
syscallarg(const struct aiocb *const *) list;
sys/ufs/chfs/chfs_nodeops.c
111
*list = new;
sys/ufs/chfs/chfs_nodeops.c
122
struct chfs_node_ref *old_nref, struct chfs_node_ref **list)
sys/ufs/chfs/chfs_nodeops.c
129
if (*list == (struct chfs_node_ref *)vc) {
sys/ufs/chfs/chfs_nodeops.c
136
if (*list == old_nref) {
sys/ufs/chfs/chfs_nodeops.c
137
*list = old_nref->nref_next;
sys/ufs/chfs/chfs_nodeops.c
139
tmpnref = *list;
sys/ufs/chfs/chfs_nodeops.c
159
struct chfs_node_ref *old_nref, struct chfs_node_ref **list)
sys/ufs/chfs/chfs_nodeops.c
164
chfs_remove_node_from_list(chmp, vc, old_nref, list);
sys/ufs/chfs/chfs_nodeops.c
73
struct chfs_node_ref *new, struct chfs_node_ref **list)
sys/ufs/chfs/chfs_nodeops.c
77
struct chfs_node_ref *nextref = *list;
sys/uvm/pmap/pmap_pvt.c
101
pvt->pvt_next = pv_unmanaged.list;
sys/uvm/pmap/pmap_pvt.c
102
atomic_store_release(&pv_unmanaged.list, pvt);
sys/uvm/pmap/pmap_pvt.c
119
for (pvtp = &pv_unmanaged.list;
sys/uvm/pmap/pmap_pvt.c
164
for (pvt = atomic_load_consume(&pv_unmanaged.list);
sys/uvm/pmap/pmap_pvt.c
65
struct pv_track *list;
sys/uvm/pmap/pmap_pvt.c
74
pv_unmanaged.list = NULL;
sys/uvm/pmap/pmap_segtab.c
389
pmap_page_detach(pmap_t pmap, struct pglist *list, vaddr_t va)
sys/uvm/pmap/pmap_segtab.c
393
(uintptr_t)pmap, (uintptr_t)va, (uintptr_t)list, 0);
sys/uvm/pmap/pmap_segtab.c
403
(uintptr_t)va, (uintptr_t)uobj, (uintptr_t)pg, (uintptr_t)list);
sys/uvm/pmap/pmap_segtab.c
409
TAILQ_REMOVE(list, pg, pageq.queue);
sys/uvm/pmap/pmap_segtab.c
421
pmap_segtab_pagefree(pmap_t pmap, struct pglist *list, vaddr_t kva, size_t size)
sys/uvm/pmap/pmap_segtab.c
426
(uintptr_t)pmap, (uintptr_t)list, kva, size);
sys/uvm/pmap/pmap_segtab.c
431
uvm_pagefree(pmap_page_detach(pmap, list, kva));
sys/uvm/pmap/pmap_segtab.c
436
(void)pmap_page_detach(pmap, list, kva + i);
sys/uvm/uvm_aobj.c
114
LIST_ENTRY(uao_swhash_elt) list; /* the hash list */
sys/uvm/uvm_aobj.c
1175
elt = LIST_NEXT(elt, list)) {
sys/uvm/uvm_aobj.c
1337
next = LIST_NEXT(elt, list);
sys/uvm/uvm_aobj.c
1373
LIST_REMOVE(elt, list);
sys/uvm/uvm_aobj.c
217
LIST_FOREACH(elt, swhash, list) {
sys/uvm/uvm_aobj.c
234
LIST_INSERT_HEAD(swhash, elt, list);
sys/uvm/uvm_aobj.c
342
LIST_REMOVE(elt, list);
sys/uvm/uvm_bio.c
105
LIST_ENTRY(ubc_map) list; /* per-object list */
sys/uvm/uvm_bio.c
1106
LIST_REMOVE(umap, list);
sys/uvm/uvm_bio.c
539
LIST_REMOVE(umap, list);
sys/uvm/uvm_bio.c
547
LIST_INSERT_HEAD(&uobj->uo_ubc, umap, list);
sys/uvm/uvm_bio.c
718
LIST_REMOVE(umap, list);
sys/uvm/uvm_object.c
132
struct pglist *list)
sys/uvm/uvm_object.c
188
if (list != NULL)
sys/uvm/uvm_object.c
189
TAILQ_INSERT_TAIL(list, pgs[i], pageq.queue);
sys/uvm/uvm_page.c
1046
LIST_REMOVE(pg, pageq.list);
sys/uvm/uvm_page.c
1564
LIST_INSERT_HEAD(&pgb->pgb_colors[VM_PGCOLOR(pg)], pg, pageq.list);
sys/uvm/uvm_page.c
2182
LIST_FOREACH(tpg, pgl, pageq.list) {
sys/uvm/uvm_page.c
795
LIST_REMOVE(pg, pageq.list);
sys/uvm/uvm_page.c
823
LIST_INSERT_HEAD(nhead, pg, pageq.list);
sys/uvm/uvm_page.h
164
LIST_ENTRY(vm_page) list; /* f: global free page queue */
sys/uvm/uvm_pgflcache.c
145
pg = LIST_NEXT(pg, pageq.list);
sys/uvm/uvm_pgflcache.c
151
pg->pageq.list.le_prev = &head->lh_first;
sys/uvm/uvm_pgflcache.c
189
LIST_INSERT_HEAD(head, pcc->pages[pcc->count], pageq.list);
sys/uvm/uvm_pglist.c
101
LIST_REMOVE(pg, pageq.list);
sys/uvm/uvm_pglist.c
738
uvm_pglistfree(struct pglist *list)
sys/uvm/uvm_pglist.c
745
while ((pg = TAILQ_FIRST(list)) != NULL) {
sys/uvm/uvm_pglist.c
746
TAILQ_REMOVE(list, pg, pageq.queue);
sys/uvm/uvm_pglist.c
94
LIST_FOREACH(tp, &pgb->pgb_colors[VM_PGCOLOR(pg)], pageq.list) {
tests/lib/libc/sys/t_aio_cancel.c
113
const struct aiocb *list[1];
tests/lib/libc/sys/t_aio_cancel.c
141
list[0] = &cb;
tests/lib/libc/sys/t_aio_cancel.c
142
wait_all(list, 1);
tests/lib/libc/sys/t_aio_cancel.c
169
const struct aiocb *list[1];
tests/lib/libc/sys/t_aio_cancel.c
186
list[0] = &cb;
tests/lib/libc/sys/t_aio_cancel.c
187
wait_all(list, 1);
tests/lib/libc/sys/t_aio_cancel.c
74
wait_all(const struct aiocb * const list[], size_t nent)
tests/lib/libc/sys/t_aio_cancel.c
85
if (list[i] == NULL) {
tests/lib/libc/sys/t_aio_cancel.c
89
err = aio_error(list[i]);
tests/lib/libc/sys/t_aio_cancel.c
99
rv = aio_suspend(list, (int)nent, NULL);
tests/lib/libc/sys/t_aio_lio.c
113
struct aiocb *list[NW_REQS];
tests/lib/libc/sys/t_aio_lio.c
133
list[i] = &cbs[i];
tests/lib/libc/sys/t_aio_lio.c
137
rv = lio_listio(LIO_NOWAIT, list, (int)NW_REQS, NULL);
tests/lib/libc/sys/t_aio_lio.c
141
wait_all((const struct aiocb * const *)list, NW_REQS);
tests/lib/libc/sys/t_aio_lio.c
73
wait_all(const struct aiocb * const list[], size_t nent)
tests/lib/libc/sys/t_aio_lio.c
84
if (list[i] == NULL) {
tests/lib/libc/sys/t_aio_lio.c
88
err = aio_error(list[i]);
tests/lib/libc/sys/t_aio_lio.c
98
rv = aio_suspend(list, (int)nent, NULL);
tests/lib/libc/sys/t_aio_rw.c
74
wait_all(const struct aiocb * const list[], size_t nent)
tests/lib/libc/sys/t_aio_rw.c
83
if (list[i] == NULL) {
tests/lib/libc/sys/t_aio_rw.c
87
error = aio_error(list[i]);
tests/lib/libc/sys/t_aio_rw.c
97
rv = aio_suspend(list, (int)nent, NULL);
tests/lib/libc/sys/t_aio_suspend.c
123
list[0] = &cb0;
tests/lib/libc/sys/t_aio_suspend.c
124
list[1] = &cb1;
tests/lib/libc/sys/t_aio_suspend.c
126
rv = aio_suspend(list, 2, NULL);
tests/lib/libc/sys/t_aio_suspend.c
97
const struct aiocb *list[2];
tests/lib/libc/sys/t_futex_robust.c
104
d->rhead.list.next = &d->rhead.list;
tests/lib/libc/sys/t_futex_robust.c
106
offsetof(struct futex_lock_pos, list);
tests/lib/libc/sys/t_futex_robust.c
120
pos_locks[i].list.next = d->rhead.list.next;
tests/lib/libc/sys/t_futex_robust.c
121
d->rhead.list.next = &pos_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
125
d->rhead.pending_list = &pos_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
136
d->rhead.list.next = &d->rhead.list;
tests/lib/libc/sys/t_futex_robust.c
138
offsetof(struct futex_lock_neg, list);
tests/lib/libc/sys/t_futex_robust.c
152
neg_locks[i].list.next = d->rhead.list.next;
tests/lib/libc/sys/t_futex_robust.c
153
d->rhead.list.next = &neg_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
157
d->rhead.pending_list = &neg_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
167
d->rhead.list.next = &d->rhead.list;
tests/lib/libc/sys/t_futex_robust.c
169
offsetof(struct futex_lock_pos, list);
tests/lib/libc/sys/t_futex_robust.c
191
d->rhead.list.next = &d->rhead.list;
tests/lib/libc/sys/t_futex_robust.c
193
offsetof(struct futex_lock_pos, list);
tests/lib/libc/sys/t_futex_robust.c
207
pos_locks[i].list.next = d->rhead.list.next;
tests/lib/libc/sys/t_futex_robust.c
208
d->rhead.list.next = &pos_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
212
pos_locks[0].list.next = pos_locks[NLOCKS-1].list.next;
tests/lib/libc/sys/t_futex_robust.c
223
d->rhead.list.next = &d->rhead.list;
tests/lib/libc/sys/t_futex_robust.c
225
offsetof(struct futex_lock_pos, list);
tests/lib/libc/sys/t_futex_robust.c
239
pos_locks[i].list.next = d->rhead.list.next;
tests/lib/libc/sys/t_futex_robust.c
240
d->rhead.list.next = &pos_locks[i].list;
tests/lib/libc/sys/t_futex_robust.c
48
struct futex_robust_list list;
tests/lib/libc/sys/t_futex_robust.c
55
struct futex_robust_list list;
tests/lib/libc/sys/t_ptrace_wait.h
811
find_event_count(struct lwp_event_count list[], lwpid_t lwp, size_t max_lwps)
tests/lib/libc/sys/t_ptrace_wait.h
816
if (list[i].lec_lwp == 0)
tests/lib/libc/sys/t_ptrace_wait.h
817
list[i].lec_lwp = lwp;
tests/lib/libc/sys/t_ptrace_wait.h
818
if (list[i].lec_lwp == lwp)
tests/lib/libc/sys/t_ptrace_wait.h
819
return &list[i].lec_count;
tests/lib/libc/sys/t_ptrace_wait.h
825
#define FIND_EVENT_COUNT(list, lwp) \
tests/lib/libc/sys/t_ptrace_wait.h
826
find_event_count(list, lwp, __arraycount(list))
tests/usr.bin/indent/fmt_decl.c
607
CachedDirList list;
tests/usr.bin/indent/lsym_for.c
53
#define foreach(list, it) for (it = list.first; it != NULL; it = it->next)
tests/usr.bin/indent/lsym_for.c
66
foreach(list, it)
tests/usr.bin/indent/lsym_for.c
70
foreach(list, it) {
tests/usr.bin/xlint/lint1/d_cast_typeof.c
15
((char *)&((typeof(hole))0)->list) :
tests/usr.bin/xlint/lint1/d_cast_typeof.c
16
((char *)&((typeof(*hole) *)0)->list);
tests/usr.bin/xlint/lint1/d_cast_typeof.c
7
char list;
usr.bin/cap_mkdb/cap_mkdb.c
294
count_records(char **list)
usr.bin/cap_mkdb/cap_mkdb.c
302
for(nelem = 0, slash = 0; *list && (fp = fopen(*list++, "r")); ) {
usr.bin/chpass/chpass.h
51
extern ENTRY list[];
usr.bin/chpass/edit.c
125
list[E_SHELL].restricted = 1;
usr.bin/chpass/edit.c
172
for (ep = list;; ++ep) {
usr.bin/chpass/edit.c
206
len = strlen(list[E_NAME].save) + strlen(list[E_BPHONE].save) +
usr.bin/chpass/edit.c
207
strlen(list[E_HPHONE].save) + strlen(list[E_LOCATE].save) + 4;
usr.bin/chpass/edit.c
210
(void)snprintf(p, len, "%s,%s,%s,%s", list[E_NAME].save,
usr.bin/chpass/edit.c
211
list[E_LOCATE].save, list[E_BPHONE].save, list[E_HPHONE].save);
usr.bin/chpass/table.c
48
ENTRY list[] = {
usr.bin/column/column.c
148
for (chcnt = col = 0, lp = list;; ++lp) {
usr.bin/column/column.c
181
chcnt += printf("%s", list[base]);
usr.bin/column/column.c
200
for (cnt = entries, lp = list; cnt--; ++lp)
usr.bin/column/column.c
205
char **list;
usr.bin/column/column.c
223
for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) {
usr.bin/column/column.c
239
t->list = ecalloc(coloff, sizeof(*(t->list)));
usr.bin/column/column.c
242
t->list[coloff] = cols[coloff];
usr.bin/column/column.c
250
(void)printf("%s%*s", t->list[coloff],
usr.bin/column/column.c
252
(void)printf("%s\n", t->list[coloff]);
usr.bin/column/column.c
270
if (!list)
usr.bin/column/column.c
271
list = ecalloc((maxentry = DEFNUM), sizeof(*list));
usr.bin/column/column.c
290
n = erealloc(list, (maxentry + DEFNUM) * sizeof(*n));
usr.bin/column/column.c
293
list = n;
usr.bin/column/column.c
295
list[entries++] = buf;
usr.bin/column/column.c
73
static char **list; /* array of pointers to records */
usr.bin/config/gram.y
159
struct nvlist *list;
usr.bin/config/gram.y
204
%type <list> atlist
usr.bin/config/gram.y
212
%type <list> dev_spec
usr.bin/config/gram.y
220
%type <list> deffses
usr.bin/config/gram.y
224
%type <list> optdepends
usr.bin/config/gram.y
225
%type <list> optdepend_list
usr.bin/config/gram.y
227
%type <list> subarches
usr.bin/config/gram.y
230
%type <list> devnodes devnodetype devnodeflags devnode_dims
usr.bin/cut/cut.c
158
get_list(char *list)
usr.bin/cut/cut.c
174
for (; (p = strtok(list, ", \t")) != NULL; list = NULL) {
usr.bin/ftp/complete.c
101
if (!list) {
usr.bin/ftp/complete.c
131
complete_command(char *word, int list)
usr.bin/ftp/complete.c
148
rv = complete_ambiguous(word, list, words);
usr.bin/ftp/complete.c
161
complete_local(char *word, int list)
usr.bin/ftp/complete.c
218
rv = complete_ambiguous(file, list, words);
usr.bin/ftp/complete.c
243
complete_option(char *word, int list)
usr.bin/ftp/complete.c
260
rv = complete_ambiguous(word, list, words);
usr.bin/ftp/complete.c
273
complete_remote(char *word, int list)
usr.bin/ftp/complete.c
343
rv = complete_ambiguous(file, list, words);
usr.bin/ftp/complete.c
79
complete_ambiguous(char *word, int list, StringList *words)
usr.bin/grep/queue.c
50
STAILQ_ENTRY(qentry) list;
usr.bin/grep/queue.c
72
STAILQ_INSERT_TAIL(&queue, item, list);
usr.bin/grep/queue.c
90
STAILQ_REMOVE_HEAD(&queue, list);
usr.bin/hesinfo/hesinfo.c
108
for (p = list; *p; p++)
usr.bin/hesinfo/hesinfo.c
111
hesiod_free_list(context, list);
usr.bin/hesinfo/hesinfo.c
41
char **list, **p, *bindname, *name, *type;
usr.bin/hesinfo/hesinfo.c
97
list = hesiod_resolve(context, name, type);
usr.bin/hesinfo/hesinfo.c
98
if (!list) {
usr.bin/hexdump/conv.c
105
static const char *list[] = {
usr.bin/hexdump/conv.c
118
(void)printf(pr->fmt, list[*p]);
usr.bin/iconv/iconv.c
77
char **list;
usr.bin/iconv/iconv.c
80
if (__iconv_get_list(&list, &sz))
usr.bin/iconv/iconv.c
83
qsort(list, sz, sizeof(char *), scmp);
usr.bin/iconv/iconv.c
86
(void)printf("%s\n", list[i]);
usr.bin/iconv/iconv.c
88
__iconv_free_list(list, sz);
usr.bin/kdump/kdump.c
162
int list = 0;
usr.bin/kdump/kdump.c
176
list = 1;
usr.bin/kdump/kdump.c
187
if (argc < 1 && !list)
usr.bin/kdump/kdump.c
190
if (list) {
usr.bin/mail/cmd2.c
131
list[0] = get_msgnum(dot);
usr.bin/mail/cmd2.c
132
list[1] = 0;
usr.bin/mail/cmd2.c
133
return type(list);
usr.bin/mail/cmd2.c
369
int list[2];
usr.bin/mail/cmd2.c
375
list[0] = get_msgnum(dot);
usr.bin/mail/cmd2.c
376
if (list[0] > lastdot) {
usr.bin/mail/cmd2.c
378
list[1] = 0;
usr.bin/mail/cmd2.c
379
return type(list);
usr.bin/mail/cmd2.c
508
ignore1(char *list[], struct ignoretab *tab, const char *which)
usr.bin/mail/cmd2.c
512
if (*list == NULL)
usr.bin/mail/cmd2.c
515
for (ap = list; *ap != 0; ap++)
usr.bin/mail/cmd2.c
528
char **list;
usr.bin/mail/cmd2.c
530
list = v;
usr.bin/mail/cmd2.c
531
return ignore1(list, ignore + 1, "retained");
usr.bin/mail/cmd2.c
541
char **list;
usr.bin/mail/cmd2.c
543
list = v;
usr.bin/mail/cmd2.c
544
return ignore1(list, ignore, "ignored");
usr.bin/mail/cmd2.c
554
char **list;
usr.bin/mail/cmd2.c
556
list = v;
usr.bin/mail/cmd2.c
557
return ignore1(list, saveignore + 1, "retained");
usr.bin/mail/cmd2.c
567
char **list;
usr.bin/mail/cmd2.c
569
list = v;
usr.bin/mail/cmd2.c
570
return ignore1(list, saveignore, "ignored");
usr.bin/mail/cmd2.c
66
int list[2], mdot;
usr.bin/mail/cmd3.c
72
sort(const char **list)
usr.bin/mail/cmd3.c
76
for (ap = list; *ap != NULL; ap++)
usr.bin/mail/cmd3.c
78
if (ap - list < 2)
usr.bin/mail/cmd3.c
80
qsort(list, (size_t)(ap - list), sizeof(*list), diction);
usr.bin/mail/complete.c
425
find_execs(char *word, char *path, StringList *list)
usr.bin/mail/complete.c
477
mail_sl_add(list, tcp);
usr.bin/mail/main.c
155
char *list;
usr.bin/mail/main.c
159
list = estrdup(str);
usr.bin/mail/main.c
160
word = list;
usr.bin/mail/main.c
161
for (word = list; *word; word = p) {
usr.bin/mail/main.c
172
free(list);
usr.bin/mail/names.c
410
put(struct name *list, struct name *node)
usr.bin/mail/names.c
412
node->n_flink = list;
usr.bin/mail/names.c
414
if (list != NULL)
usr.bin/mail/names.c
415
list->n_blink = node;
usr.bin/make/dir.c
1642
for (ln = openDirs.list.first; ln != NULL; ln = ln->next) {
usr.bin/make/dir.c
235
CachedDirList list;
usr.bin/make/dir.c
347
Lst_Init(&odirs->list);
usr.bin/make/dir.c
355
CachedDirListNode *ln = odirs->list.first;
usr.bin/make/dir.c
366
Lst_Done(&odirs->list);
usr.bin/make/dir.c
383
Lst_Append(&odirs->list, cdir);
usr.bin/make/dir.c
384
HashTable_Set(&odirs->table, cdir->name, odirs->list.last);
usr.bin/make/dir.c
396
Lst_Remove(&odirs->list, ln);
usr.bin/make/lst.c
100
ln = LstNodeNew(NULL, list->first, datum);
usr.bin/make/lst.c
102
if (list->first == NULL) {
usr.bin/make/lst.c
103
list->first = ln;
usr.bin/make/lst.c
104
list->last = ln;
usr.bin/make/lst.c
106
list->first->prev = ln;
usr.bin/make/lst.c
107
list->first = ln;
usr.bin/make/lst.c
113
Lst_Append(List *list, void *datum)
usr.bin/make/lst.c
119
ln = LstNodeNew(list->last, NULL, datum);
usr.bin/make/lst.c
121
if (list->last == NULL) {
usr.bin/make/lst.c
122
list->first = ln;
usr.bin/make/lst.c
123
list->last = ln;
usr.bin/make/lst.c
125
list->last->next = ln;
usr.bin/make/lst.c
126
list->last = ln;
usr.bin/make/lst.c
135
Lst_Remove(List *list, ListNode *ln)
usr.bin/make/lst.c
144
if (list->first == ln)
usr.bin/make/lst.c
145
list->first = ln->next;
usr.bin/make/lst.c
146
if (list->last == ln)
usr.bin/make/lst.c
147
list->last = ln->prev;
usr.bin/make/lst.c
177
Lst_FindDatum(List *list, const void *datum)
usr.bin/make/lst.c
183
for (ln = list->first; ln != NULL; ln = ln->next)
usr.bin/make/lst.c
234
Lst_Dequeue(List *list)
usr.bin/make/lst.c
236
void *datum = list->first->datum;
usr.bin/make/lst.c
237
Lst_Remove(list, list->first);
usr.bin/make/lst.c
52
Lst_Done(List *list)
usr.bin/make/lst.c
56
for (ln = list->first; ln != NULL; ln = next) {
usr.bin/make/lst.c
63
Lst_DoneFree(List *list)
usr.bin/make/lst.c
67
for (ln = list->first; ln != NULL; ln = next) {
usr.bin/make/lst.c
76
Lst_InsertBefore(List *list, ListNode *ln, void *datum)
usr.bin/make/lst.c
88
if (ln == list->first)
usr.bin/make/lst.c
89
list->first = newNode;
usr.bin/make/lst.c
94
Lst_Prepend(List *list, void *datum)
usr.bin/make/lst.h
110
Lst_Init(List *list)
usr.bin/make/lst.h
112
list->first = NULL;
usr.bin/make/lst.h
113
list->last = NULL;
usr.bin/make/lst.h
119
Lst_IsEmpty(List *list)
usr.bin/make/lst.h
121
return list->first == NULL;
usr.bin/make/lst.h
152
Lst_Enqueue(List *list, void *datum)
usr.bin/make/lst.h
154
Lst_Append(list, datum);
usr.bin/make/meta.c
975
append_if_new(StringList *list, const char *str)
usr.bin/make/meta.c
979
for (ln = list->first; ln != NULL; ln = ln->next)
usr.bin/make/meta.c
982
Lst_Append(list, bmake_strdup(str));
usr.bin/make/parse.c
313
List *list = bmake_malloc(sizeof *list);
usr.bin/make/parse.c
314
Lst_Init(list);
usr.bin/make/parse.c
315
return list;
usr.bin/make/parse.c
319
Lst_Free(List *list)
usr.bin/make/parse.c
322
Lst_Done(list);
usr.bin/make/parse.c
323
free(list);
usr.bin/make/suff.c
1004
CandidateList_AddCandidatesFor(CandidateList *list, Candidate *cand)
usr.bin/make/suff.c
1016
CandidateList_Add(list, bmake_strdup(cand->prefix),
usr.bin/make/suff.c
1020
CandidateList_Add(list, str_concat2(cand->prefix, suff->name),
usr.bin/make/suff.c
1953
while (RemoveCandidate(&cs->list))
usr.bin/make/suff.c
1955
assert(Lst_IsEmpty(&cs->list));
usr.bin/make/suff.c
228
CandidateList list;
usr.bin/make/suff.c
358
SuffixList_Unref(SuffixList *list, Suffix *suff)
usr.bin/make/suff.c
360
SuffixListNode *ln = Lst_FindDatum(list, suff);
usr.bin/make/suff.c
362
Lst_Remove(list, ln);
usr.bin/make/suff.c
394
SuffixList_Remove(SuffixList *list, Suffix *suff)
usr.bin/make/suff.c
396
SuffixList_Unref(list, suff);
usr.bin/make/suff.c
410
SuffixList_Insert(SuffixList *list, Suffix *suff)
usr.bin/make/suff.c
415
for (ln = list->first; ln != NULL; ln = ln->next) {
usr.bin/make/suff.c
424
Lst_Append(list, Suffix_Ref(suff));
usr.bin/make/suff.c
428
Lst_InsertBefore(list, ln, Suffix_Ref(suff));
usr.bin/make/suff.c
916
Lst_Init(&cs->list);
usr.bin/make/suff.c
922
Lst_Done(&cs->list);
usr.bin/make/suff.c
929
Lst_Append(&cs->list, cand);
usr.bin/make/suff.c
936
if (Lst_FindDatum(&cs->list, cand) == NULL)
usr.bin/make/suff.c
937
Lst_Append(&cs->list, cand);
usr.bin/make/suff.c
941
CandidateSearcher_MoveAll(CandidateSearcher *cs, CandidateList *list)
usr.bin/make/suff.c
944
Lst_MoveAll(&cs->list, list);
usr.bin/make/suff.c
950
CandidateList_PrintAddrs(CandidateList *list)
usr.bin/make/suff.c
954
for (ln = list->first; ln != NULL; ln = ln->next) {
usr.bin/make/suff.c
983
CandidateList_Add(CandidateList *list, char *srcName, Candidate *targ,
usr.bin/make/suff.c
989
Lst_Append(list, cand);
usr.bin/make/suff.c
994
debug_tag, targ, targ->file, cand, cand->file, list);
usr.bin/make/suff.c
995
CandidateList_PrintAddrs(list);
usr.bin/mklocale/yacc.y
107
rune_list *list;
usr.bin/mklocale/yacc.y
124
%type <list> list
usr.bin/mklocale/yacc.y
125
%type <list> map
usr.bin/mklocale/yacc.y
184
| LIST list
usr.bin/mklocale/yacc.y
194
list : RUNE
usr.bin/mklocale/yacc.y
208
| list RUNE
usr.bin/mklocale/yacc.y
215
| list RUNE THRU RUNE
usr.bin/mklocale/yacc.y
374
set_map(rune_map *map, rune_list *list, u_int32_t flag)
usr.bin/mklocale/yacc.y
376
list->map &= charsetmask;
usr.bin/mklocale/yacc.y
377
list->map |= charsetbits;
usr.bin/mklocale/yacc.y
378
while (list) {
usr.bin/mklocale/yacc.y
379
rune_list *nlist = list->next;
usr.bin/mklocale/yacc.y
380
add_map(map, list, flag);
usr.bin/mklocale/yacc.y
381
list = nlist;
usr.bin/mklocale/yacc.y
386
set_digitmap(rune_map *map, rune_list *list)
usr.bin/mklocale/yacc.y
390
while (list) {
usr.bin/mklocale/yacc.y
391
rune_list *nlist = list->next;
usr.bin/mklocale/yacc.y
392
for (i = list->min; i <= list->max; ++i) {
usr.bin/mklocale/yacc.y
398
_RuneType digit = list->map + (i - list->min);
usr.bin/mklocale/yacc.y
407
free(list);
usr.bin/mklocale/yacc.y
408
list = nlist;
usr.bin/mklocale/yacc.y
413
add_map(rune_map *map, rune_list *list, u_int32_t flag)
usr.bin/mklocale/yacc.y
420
while (list->min < _CTYPE_CACHE_SIZE && list->min <= list->max) {
usr.bin/mklocale/yacc.y
422
map->map[list->min++] |= flag;
usr.bin/mklocale/yacc.y
424
map->map[list->min++] = list->map++;
usr.bin/mklocale/yacc.y
427
if (list->min > list->max) {
usr.bin/mklocale/yacc.y
428
free(list);
usr.bin/mklocale/yacc.y
432
run = list->max - list->min + 1;
usr.bin/mklocale/yacc.y
434
if (!(r = map->root) || (list->max < r->min - 1)
usr.bin/mklocale/yacc.y
435
|| (!flag && list->max == r->min - 1)) {
usr.bin/mklocale/yacc.y
437
list->types = xlalloc(run);
usr.bin/mklocale/yacc.y
439
list->types[i] = flag;
usr.bin/mklocale/yacc.y
441
list->next = map->root;
usr.bin/mklocale/yacc.y
442
map->root = list;
usr.bin/mklocale/yacc.y
446
for (r = map->root; r && r->max + 1 < list->min; r = r->next)
usr.bin/mklocale/yacc.y
454
list->types = xlalloc(run);
usr.bin/mklocale/yacc.y
456
list->types[i] = flag;
usr.bin/mklocale/yacc.y
458
list->next = 0;
usr.bin/mklocale/yacc.y
459
lr->next = list;
usr.bin/mklocale/yacc.y
463
if (list->max < r->min - 1) {
usr.bin/mklocale/yacc.y
469
list->types = xlalloc(run);
usr.bin/mklocale/yacc.y
471
list->types[i] = flag;
usr.bin/mklocale/yacc.y
473
list->next = lr->next;
usr.bin/mklocale/yacc.y
474
lr->next = list;
usr.bin/mklocale/yacc.y
484
if (!flag && list->map - list->min != r->map - r->min) {
usr.bin/mklocale/yacc.y
490
if (list->max + 1 == r->min) {
usr.bin/mklocale/yacc.y
491
lr->next = list;
usr.bin/mklocale/yacc.y
492
list->next = r;
usr.bin/mklocale/yacc.y
495
if (list->min - 1 == r->max) {
usr.bin/mklocale/yacc.y
496
list->next = r->next;
usr.bin/mklocale/yacc.y
497
r->next = list;
usr.bin/mklocale/yacc.y
504
if (list->min >= r->min && list->max <= r->max) {
usr.bin/mklocale/yacc.y
510
for (i = list->min; i <= list->max; ++i)
usr.bin/mklocale/yacc.y
513
free(list);
usr.bin/mklocale/yacc.y
516
if (list->min <= r->min && list->max >= r->max) {
usr.bin/mklocale/yacc.y
522
list->types = xlalloc(list->max - list->min + 1);
usr.bin/mklocale/yacc.y
524
for (i = list->min; i <= list->max; ++i)
usr.bin/mklocale/yacc.y
525
list->types[i - list->min] = flag;
usr.bin/mklocale/yacc.y
528
list->types[i - list->min] |= r->types[i - r->min];
usr.bin/mklocale/yacc.y
531
r->types = list->types;
usr.bin/mklocale/yacc.y
533
r->map = list->map;
usr.bin/mklocale/yacc.y
535
r->min = list->min;
usr.bin/mklocale/yacc.y
536
r->max = list->max;
usr.bin/mklocale/yacc.y
537
free(list);
usr.bin/mklocale/yacc.y
538
} else if (list->min < r->min) {
usr.bin/mklocale/yacc.y
543
list->types = xlalloc(r->max - list->min + 1);
usr.bin/mklocale/yacc.y
546
list->types[i - list->min] = r->types[i - r->min];
usr.bin/mklocale/yacc.y
548
for (i = list->min; i < r->min; ++i)
usr.bin/mklocale/yacc.y
549
list->types[i - list->min] = flag;
usr.bin/mklocale/yacc.y
551
for (i = r->min; i <= list->max; ++i)
usr.bin/mklocale/yacc.y
552
list->types[i - list->min] |= flag;
usr.bin/mklocale/yacc.y
555
r->types = list->types;
usr.bin/mklocale/yacc.y
557
r->map = list->map;
usr.bin/mklocale/yacc.y
559
r->min = list->min;
usr.bin/mklocale/yacc.y
560
free(list);
usr.bin/mklocale/yacc.y
568
r->types = xrelalloc(r->types, list->max - r->min + 1);
usr.bin/mklocale/yacc.y
570
for (i = list->min; i <= r->max; ++i)
usr.bin/mklocale/yacc.y
573
for (i = r->max+1; i <= list->max; ++i)
usr.bin/mklocale/yacc.y
576
r->max = list->max;
usr.bin/mklocale/yacc.y
577
free(list);
usr.bin/mklocale/yacc.y
622
rune_list *list;
usr.bin/mklocale/yacc.y
629
for(list = types.root; list; list = list->next) {
usr.bin/mklocale/yacc.y
630
list->map = list->types[0];
usr.bin/mklocale/yacc.y
631
for (x = 1; x < list->max - list->min + 1; ++x) {
usr.bin/mklocale/yacc.y
632
if (list->types[x] != list->map) {
usr.bin/mklocale/yacc.y
633
list->map = 0;
usr.bin/mklocale/yacc.y
654
list = types.root;
usr.bin/mklocale/yacc.y
657
while (list) {
usr.bin/mklocale/yacc.y
659
list = list->next;
usr.bin/mklocale/yacc.y
664
list = maplower.root;
usr.bin/mklocale/yacc.y
667
while (list) {
usr.bin/mklocale/yacc.y
669
list = list->next;
usr.bin/mklocale/yacc.y
674
list = mapupper.root;
usr.bin/mklocale/yacc.y
677
while (list) {
usr.bin/mklocale/yacc.y
679
list = list->next;
usr.bin/mklocale/yacc.y
696
for (list = types.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
700
re.fre_min = htonl(list->min);
usr.bin/mklocale/yacc.y
701
re.fre_max = htonl(list->max);
usr.bin/mklocale/yacc.y
702
re.fre_map = htonl(list->map);
usr.bin/mklocale/yacc.y
710
for (list = maplower.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
714
re.fre_min = htonl(list->min);
usr.bin/mklocale/yacc.y
715
re.fre_max = htonl(list->max);
usr.bin/mklocale/yacc.y
716
re.fre_map = htonl(list->map);
usr.bin/mklocale/yacc.y
724
for (list = mapupper.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
728
re.fre_min = htonl(list->min);
usr.bin/mklocale/yacc.y
729
re.fre_max = htonl(list->max);
usr.bin/mklocale/yacc.y
730
re.fre_map = htonl(list->map);
usr.bin/mklocale/yacc.y
738
for (list = types.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
739
for (x = 0; x < list->max - list->min + 1; ++x)
usr.bin/mklocale/yacc.y
740
list->types[x] = htonl(list->types[x]);
usr.bin/mklocale/yacc.y
742
if (!list->map) {
usr.bin/mklocale/yacc.y
743
if (fwrite((char *)list->types,
usr.bin/mklocale/yacc.y
744
(list->max - list->min + 1) * sizeof(u_int32_t),
usr.bin/mklocale/yacc.y
783
for (list = maplower.root; list; list = list->next)
usr.bin/mklocale/yacc.y
784
fprintf(stderr, "\t%04x - %04x : %04x\n", list->min, list->max, list->map);
usr.bin/mklocale/yacc.y
802
for (list = mapupper.root; list; list = list->next)
usr.bin/mklocale/yacc.y
803
fprintf(stderr, "\t%04x - %04x : %04x\n", list->min, list->max, list->map);
usr.bin/mklocale/yacc.y
835
for (list = types.root; list; list = list->next) {
usr.bin/mklocale/yacc.y
836
if (list->map && list->min + 3 < list->max) {
usr.bin/mklocale/yacc.y
837
u_int32_t r = list->map;
usr.bin/mklocale/yacc.y
839
fprintf(stderr, "%04x:%2d", list->min, r & 0xff);
usr.bin/mklocale/yacc.y
857
fprintf(stderr, "%04x:%2d", list->max, r & 0xff);
usr.bin/mklocale/yacc.y
876
for (x = list->min; x <= list->max; ++x) {
usr.bin/mklocale/yacc.y
877
u_int32_t r = ntohl(list->types[x - list->min]);
usr.bin/msgc/msgparse.y
56
%start list
usr.bin/msgc/msgparse.y
60
list : /* empty */
usr.bin/msgc/msgparse.y
61
| list msg
usr.bin/pkill/pkill.c
103
static struct listhead euidlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
104
static struct listhead ruidlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
105
static struct listhead rgidlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
106
static struct listhead pgrplist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
107
static struct listhead ppidlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
108
static struct listhead tdevlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
109
static struct listhead sidlist = SLIST_HEAD_INITIALIZER(list);
usr.bin/pkill/pkill.c
125
struct list *li;
usr.bin/pkill/pkill.c
586
struct list *li;
usr.bin/pkill/pkill.c
79
SLIST_ENTRY(list) li_chain;
usr.bin/pkill/pkill.c
83
SLIST_HEAD(listhead, list);
usr.bin/quota/quotautil.c
112
oneof(const char *target, char *list[], int cnt)
usr.bin/quota/quotautil.c
117
if (strcmp(target, list[i]) == 0)
usr.bin/rdist/docmd.c
607
inlist(struct namelist *list, char *file)
usr.bin/rdist/docmd.c
611
for (nl = list; nl != NULL; nl = nl->n_next)
usr.bin/rdist/expand.c
100
prnames(list);
usr.bin/rdist/expand.c
106
for (nl = list; nl != NULL; nl = nl->n_next)
usr.bin/rdist/expand.c
109
return(list);
usr.bin/rdist/expand.c
124
for (nl = list; nl != NULL; nl = nl->n_next)
usr.bin/rdist/expand.c
129
list = prev = NULL;
usr.bin/rdist/expand.c
134
list = prev = nl;
usr.bin/rdist/expand.c
142
prnames(list);
usr.bin/rdist/expand.c
148
return(list);
usr.bin/rdist/expand.c
91
expand(struct namelist *list, int wh)
usr.bin/rdist/expand.c
99
printf("expand(%lx, %d)\nlist = ", (long)list, wh);
usr.bin/rpcgen/rpc_clntout.c
68
list *l;
usr.bin/rpcgen/rpc_hout.c
528
list *l;
usr.bin/rpcgen/rpc_main.c
562
list *l;
usr.bin/rpcgen/rpc_sample.c
250
list *l;
usr.bin/rpcgen/rpc_svcout.c
158
list *l;
usr.bin/rpcgen/rpc_svcout.c
210
list *l;
usr.bin/rpcgen/rpc_svcout.c
265
list *l;
usr.bin/rpcgen/rpc_svcout.c
590
list *l;
usr.bin/rpcgen/rpc_svcout.c
737
list *l;
usr.bin/rpcgen/rpc_svcout.c
888
list *l;
usr.bin/rpcgen/rpc_tblout.c
77
list *l;
usr.bin/rpcgen/rpc_util.c
107
findval(list *lst, const char *val, int (*cmp)(definition *, const char *))
usr.bin/rpcgen/rpc_util.c
121
storeval(list **lstp, definition *val)
usr.bin/rpcgen/rpc_util.c
123
list **l;
usr.bin/rpcgen/rpc_util.c
124
list *lst;
usr.bin/rpcgen/rpc_util.c
127
for (l = lstp; *l != NULL; l = (list **) & (*l)->next);
usr.bin/rpcgen/rpc_util.c
128
lst = ALLOC(list);
usr.bin/rpcgen/rpc_util.c
75
list *defined; /* list of defined things */
usr.bin/rpcgen/rpc_util.h
100
storeval(list,item)
usr.bin/rpcgen/rpc_util.h
102
#define FINDVAL(list,item,finder) \
usr.bin/rpcgen/rpc_util.h
103
findval(list, item, finder)
usr.bin/rpcgen/rpc_util.h
107
definition *findval(list *, const char *,
usr.bin/rpcgen/rpc_util.h
109
void storeval(list **, definition *);
usr.bin/rpcgen/rpc_util.h
46
struct list *next;
usr.bin/rpcgen/rpc_util.h
48
typedef struct list list;
usr.bin/rpcgen/rpc_util.h
66
extern list *defined;
usr.bin/rpcgen/rpc_util.h
99
#define STOREVAL(list,item) \
usr.bin/rpcinfo/rpcinfo.c
743
rpcblist_ptr list, prev = NULL;
usr.bin/rpcinfo/rpcinfo.c
758
list = malloc(sizeof (rpcblist));
usr.bin/rpcinfo/rpcinfo.c
759
if (list == NULL)
usr.bin/rpcinfo/rpcinfo.c
762
head = list;
usr.bin/rpcinfo/rpcinfo.c
764
prev->rpcb_next = (rpcblist_ptr) list;
usr.bin/rpcinfo/rpcinfo.c
766
list->rpcb_next = NULL;
usr.bin/rpcinfo/rpcinfo.c
767
list->rpcb_map.r_prog = pmaphead->pml_map.pm_prog;
usr.bin/rpcinfo/rpcinfo.c
768
list->rpcb_map.r_vers = pmaphead->pml_map.pm_vers;
usr.bin/rpcinfo/rpcinfo.c
770
list->rpcb_map.r_netid = strdup("udp");
usr.bin/rpcinfo/rpcinfo.c
772
list->rpcb_map.r_netid = strdup("tcp");
usr.bin/rpcinfo/rpcinfo.c
774
(void)asprintf(&list->rpcb_map.r_netid, "%6ld",
usr.bin/rpcinfo/rpcinfo.c
776
if (list->rpcb_map.r_netid == NULL)
usr.bin/rpcinfo/rpcinfo.c
779
list->rpcb_map.r_owner = unknown;
usr.bin/rpcinfo/rpcinfo.c
782
(void)asprintf(&list->rpcb_map.r_addr,
usr.bin/rpcinfo/rpcinfo.c
784
if (list->rpcb_map.r_addr == NULL)
usr.bin/rpcinfo/rpcinfo.c
786
prev = list;
usr.bin/rpcinfo/rpcinfo.c
875
rpcblist_ptr list = head->rpcb_next;
usr.bin/rpcinfo/rpcinfo.c
881
head = list;
usr.bin/rs/rs.c
513
getlist(short **list, char *p)
usr.bin/rs/rs.c
527
if (!(*list = (short *) malloc(count * sizeof(short))))
usr.bin/rs/rs.c
531
(*list)[count++] = atoi(t);
usr.bin/rs/rs.c
532
printf("++ %d ", (*list)[count-1]);
usr.bin/rs/rs.c
539
(*list)[count] = 0;
usr.bin/sdpquery/print.c
1044
sdp_data_t list;
usr.bin/sdpquery/print.c
1049
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1053
while (list.next < list.end) {
usr.bin/sdpquery/print.c
1058
if (!sdp_get_uint16(&list, &v))
usr.bin/sdpquery/print.c
1070
if (!sdp_get_uint16(&list, &v))
usr.bin/sdpquery/print.c
1083
if (!sdp_get_uint16(&list, &v))
usr.bin/sdpquery/print.c
1095
if (list.next != list.end)
usr.bin/sdpquery/print.c
1159
sdp_data_t list;
usr.bin/sdpquery/print.c
1163
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1167
while (sdp_get_uint16(&list, &v)) {
usr.bin/sdpquery/print.c
1172
if (list.next != list.end)
usr.bin/sdpquery/print.c
1257
sdp_data_t list;
usr.bin/sdpquery/print.c
1261
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1265
while (sdp_get_uint8(&list, &v)) {
usr.bin/sdpquery/print.c
1278
if (list.next != list.end)
usr.bin/sdpquery/print.c
1287
sdp_data_t list;
usr.bin/sdpquery/print.c
1291
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1295
while (sdp_get_uint8(&list, &v)) {
usr.bin/sdpquery/print.c
1311
if (list.next != list.end)
usr.bin/sdpquery/print.c
1400
sdp_data_t list, seq;
usr.bin/sdpquery/print.c
1406
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1410
while (list.next < list.end) {
usr.bin/sdpquery/print.c
1411
if (!sdp_get_seq(&list, &seq)
usr.bin/sdpquery/print.c
1433
sdp_data_t list, seq;
usr.bin/sdpquery/print.c
1436
if (!sdp_get_seq(data, &list))
usr.bin/sdpquery/print.c
1439
while (list.next < list.end) {
usr.bin/sdpquery/print.c
1440
if (!sdp_get_seq(&list, &seq)
usr.bin/soelim/soelim.c
101
if ((p->list[p->c++] = strdup(dir)) == NULL)
usr.bin/soelim/soelim.c
104
p->list[p->c] = NULL;
usr.bin/soelim/soelim.c
119
if (p->list[i][0] == '\0')
usr.bin/soelim/soelim.c
123
p->list[i], name);
usr.bin/soelim/soelim.c
71
char **list;
usr.bin/soelim/soelim.c
84
p->list = NULL;
usr.bin/soelim/soelim.c
93
if (p->list == NULL || p->n <= p->c - 2) {
usr.bin/soelim/soelim.c
94
n = realloc(p->list, (p->n + 10) * sizeof(p->list[0]));
usr.bin/soelim/soelim.c
97
p->list = n;
usr.bin/units/units.c
867
int list = 0, listexpand = 0;
usr.bin/units/units.c
873
list = 1;
usr.bin/units/units.c
876
list = 1;
usr.bin/units/units.c
901
|| (list && argc != 0))
usr.bin/units/units.c
904
if (list)
usr.bin/units/units.c
909
if (list)
usr.bin/unzip/unzip.c
279
add_pattern(struct pattern_list *list, const char *pattern)
usr.bin/unzip/unzip.c
291
STAILQ_INSERT_TAIL(list, entry, link);
usr.bin/unzip/unzip.c
298
match_pattern(struct pattern_list *list, const char *str)
usr.bin/unzip/unzip.c
302
STAILQ_FOREACH(entry, list, link) {
usr.bin/unzip/unzip.c
937
list(a, e);
usr.bin/vmstat/vmstat.c
2228
histkva = LIST_NEXT(&hist, list)) {
usr.bin/xlint/lint1/cgram.y
115
attribute_list_add(attribute_list *list, attribute attr)
usr.bin/xlint/lint1/cgram.y
117
if (list->len >= list->cap) {
usr.bin/xlint/lint1/cgram.y
118
attribute *old_attrs = list->attrs;
usr.bin/xlint/lint1/cgram.y
119
list->cap = 16 + 2 * list->cap;
usr.bin/xlint/lint1/cgram.y
120
list->attrs = block_zero_alloc(
usr.bin/xlint/lint1/cgram.y
121
list->cap * sizeof(*list->attrs), "attribute[]");
usr.bin/xlint/lint1/cgram.y
122
if (list->len > 0)
usr.bin/xlint/lint1/cgram.y
123
memcpy(list->attrs, old_attrs,
usr.bin/xlint/lint1/cgram.y
124
list->len * sizeof(*list->attrs));
usr.bin/xlint/lint1/cgram.y
126
list->attrs[list->len++] = attr;
usr.bin/xlint/lint1/debug.c
604
debug_attribute_list(const attribute_list *list)
usr.bin/xlint/lint1/debug.c
606
for (size_t i = 0, n = list->len; i < n; i++) {
usr.bin/xlint/lint1/debug.c
607
const attribute *attr = list->attrs + i;
usr.bin/xlint/lint1/externs1.h
180
#define debug_attribute_list(list) debug_noop()
usr.bin/xlint/lint2/hash.c
122
hte_list_add(struct hte_list *list, hte_t *item)
usr.bin/xlint/lint2/hash.c
124
if (list->len >= list->cap) {
usr.bin/xlint/lint2/hash.c
125
list->cap = list->cap == 0 ? 1024 : 2 * list->cap;
usr.bin/xlint/lint2/hash.c
126
list->items = xrealloc(list->items,
usr.bin/xlint/lint2/hash.c
127
sizeof(list->items[0]) * list->cap);
usr.bin/xlint/lint2/hash.c
129
list->items[list->len++] = item;
usr.bin/xlint/xlint/xlint.c
113
list_add_ref(list *l, char *s)
usr.bin/xlint/xlint/xlint.c
124
list_add(list *l, const char *s)
usr.bin/xlint/xlint/xlint.c
131
list_add_flag(list *l, int c)
usr.bin/xlint/xlint/xlint.c
138
list_add_unique(list *l, const char *s)
usr.bin/xlint/xlint/xlint.c
148
list_add_all(list *dst, const list *src)
usr.bin/xlint/xlint/xlint.c
156
list_clear(list *l)
usr.bin/xlint/xlint/xlint.c
290
run_child(const char *path, const list *args, const char *crfn, int fdout)
usr.bin/xlint/xlint/xlint.c
365
list args = { NULL, 0, 0 };
usr.bin/xlint/xlint/xlint.c
394
list args = { NULL, 0, 0 };
usr.bin/xlint/xlint/xlint.c
496
find_libs(const list *l)
usr.bin/xlint/xlint/xlint.c
511
list args = { NULL, 0, 0 };
usr.bin/xlint/xlint/xlint.c
523
cat(const list *srcs, const char *dest)
usr.bin/xlint/xlint/xlint.c
71
list flags; /* flags always passed */
usr.bin/xlint/xlint/xlint.c
72
list lcflags; /* flags, controlled by sflag/tflag */
usr.bin/xlint/xlint/xlint.c
771
list *lp;
usr.bin/xlint/xlint/xlint.c
79
list flags;
usr.bin/xlint/xlint/xlint.c
80
list outfiles;
usr.bin/xlint/xlint/xlint.c
85
list flags;
usr.bin/xlint/xlint/xlint.c
86
list input_files; /* without libraries */
usr.bin/xlint/xlint/xlint.c
87
list input_libraries;
usr.bin/xlint/xlint/xlint.c
92
static list default_libraries;
usr.bin/xlint/xlint/xlint.c
93
static list additional_libraries;
usr.bin/xlint/xlint/xlint.c
94
static list library_search_path;
usr.bin/ypwhich/ypwhich.c
356
ypml = yprespmlist.list;
usr.sbin/ac/ac.c
341
show_users(struct user_list *list)
usr.sbin/ac/ac.c
345
for (lp = list; lp; lp = lp->next)
usr.sbin/acpitools/acpidump/acpi.c
2319
struct iort_node_list *list;
usr.sbin/acpitools/acpidump/acpi.c
2330
for (list = iort_node_list; list->gname != NULL; list++) {
usr.sbin/acpitools/acpidump/acpi.c
2331
if (node->Type == list->Type) {
usr.sbin/acpitools/acpidump/acpi.c
2332
printf("%s\n", list->gname);
usr.sbin/acpitools/acpidump/acpi.c
2334
(*list->func)(node);
usr.sbin/acpitools/acpidump/acpi.c
2338
if (list->gname == NULL)
usr.sbin/btdevctl/sdp.c
434
sdp_data_t list, desc;
usr.sbin/btdevctl/sdp.c
439
if (!sdp_get_seq(value, &list))
usr.sbin/btdevctl/sdp.c
442
while (sdp_get_seq(&list, &desc)) {
usr.sbin/fssconfig/fssconfig.c
201
list(1, argv);
usr.sbin/fssconfig/fssconfig.c
214
list(1, argv);
usr.sbin/fssconfig/fssconfig.c
56
static void list(int, char **);
usr.sbin/fssconfig/fssconfig.c
79
action = list;
usr.sbin/inetd/parse_v2.c
481
next_value(vlist list)
usr.sbin/inetd/parse_v2.c
483
char *cp = list->cp;
usr.sbin/inetd/parse_v2.c
485
if (list->state != VALS_PARSING) {
usr.sbin/inetd/parse_v2.c
491
list->state = VALS_ERROR;
usr.sbin/inetd/parse_v2.c
497
list->state = (*cp == ',' ? VALS_END_KEY : VALS_END_DEF);
usr.sbin/inetd/parse_v2.c
498
list->cp = cp + 1;
usr.sbin/inetd/parse_v2.c
504
list->state = VALS_ERROR;
usr.sbin/inetd/parse_v2.c
518
list->state = VALS_ERROR;
usr.sbin/inetd/parse_v2.c
530
list->cp = cp;
usr.sbin/inetd/parse_v2.c
538
list->cp = cp;
usr.sbin/inetd/parse_v2.c
543
list->state = VALS_END_KEY;
usr.sbin/inetd/parse_v2.c
545
list->state = VALS_END_DEF;
usr.sbin/inetd/parse_v2.c
550
list->cp = cp + 1;
usr.sbin/intrctl/intrctl_io.c
101
struct intrio_list *list = handle;
usr.sbin/intrctl/intrctl_io.c
103
return list->il_nintrs;
usr.sbin/intrctl/intrctl_io.c
109
struct intrio_list *list = handle;
usr.sbin/intrctl/intrctl_io.c
113
buf_end = (char *)list + list->il_bufsize;
usr.sbin/intrctl/intrctl_io.c
114
next = (struct intrio_list_line *)((char *)list + list->il_lineoffset);
usr.sbin/intrctl/intrctl_io.c
124
struct intrio_list *list;
usr.sbin/intrctl/intrctl_io.c
129
list = handle;
usr.sbin/intrctl/intrctl_io.c
130
buf_end = (char *)list + list->il_bufsize;
usr.sbin/intrctl/intrctl_io.c
132
line_size = list->il_linesize;
usr.sbin/intrctl/intrctl_io.c
93
struct intrio_list *list = handle;
usr.sbin/intrctl/intrctl_io.c
95
return list->il_ncpus;
usr.sbin/makefs/walk.c
102
list = listptr = ecalloc(num, sizeof(*list));
usr.sbin/makefs/walk.c
106
qsort(list, num, sizeof(*list), fsnode_cmp);
usr.sbin/makefs/walk.c
109
list[i]->next = list[i + 1];
usr.sbin/makefs/walk.c
110
list[num - 1]->next = NULL;
usr.sbin/makefs/walk.c
111
first = list[0];
usr.sbin/makefs/walk.c
113
free(list);
usr.sbin/makefs/walk.c
93
fsnode **list, **listptr;
usr.sbin/mdsetimage/mdsetimage.c
247
const char **list;
usr.sbin/mdsetimage/mdsetimage.c
252
for (list = bin_supported_targets(); *list != NULL; list++)
usr.sbin/mdsetimage/mdsetimage.c
253
fprintf(stderr, " %s", *list);
usr.sbin/mtree/misc.c
179
addtag(slist_t *list, char *elem)
usr.sbin/mtree/misc.c
184
if ((list->count % TAG_CHUNK) == 0) {
usr.sbin/mtree/misc.c
187
new = (char **)realloc(list->list, (list->count + TAG_CHUNK)
usr.sbin/mtree/misc.c
191
list->list = new;
usr.sbin/mtree/misc.c
193
list->list[list->count] = elem;
usr.sbin/mtree/misc.c
194
list->count++;
usr.sbin/mtree/misc.c
198
parsetags(slist_t *list, char *args)
usr.sbin/mtree/misc.c
204
addtag(list, NULL);
usr.sbin/mtree/misc.c
214
addtag(list, e);
usr.sbin/mtree/misc.c
231
if (strstr(node->tags, excludetags.list[i]))
usr.sbin/mtree/misc.c
237
if (strstr(node->tags, includetags.list[i]))
usr.sbin/mtree/mtree.h
112
char **list;
usr.sbin/npf/npfctl/npf_parse.y
208
%type <var> element list_elems list_trail list value filt_addr_list
usr.sbin/npf/npfctl/npf_parse.y
294
| list
usr.sbin/npf/npfctl/npf_parse.y
297
list
usr.sbin/npf/npfctl/npf_show.c
101
list_push(elem_list_t *list, char *val)
usr.sbin/npf/npfctl/npf_show.c
103
const unsigned n = list->count;
usr.sbin/npf/npfctl/npf_show.c
110
values[i] = list->values[i];
usr.sbin/npf/npfctl/npf_show.c
113
free(list->values);
usr.sbin/npf/npfctl/npf_show.c
114
list->values = values;
usr.sbin/npf/npfctl/npf_show.c
115
list->count++;
usr.sbin/npf/npfctl/npf_show.c
119
list_join_free(elem_list_t *list, const bool use_br, const char *sep)
usr.sbin/npf/npfctl/npf_show.c
123
if (!join(buf, sizeof(buf), list->count, list->values, sep)) {
usr.sbin/npf/npfctl/npf_show.c
126
easprintf(&s, (use_br && list->count > 1) ? "{ %s }" : "%s", buf);
usr.sbin/npf/npfctl/npf_show.c
127
for (unsigned i = 0; i < list->count; i++) {
usr.sbin/npf/npfctl/npf_show.c
128
free(list->values[i]);
usr.sbin/npf/npfctl/npf_show.c
130
free(list->values);
usr.sbin/npf/npfctl/npf_show.c
131
list->values = NULL;
usr.sbin/npf/npfctl/npf_show.c
132
list->count = 0;
usr.sbin/npf/npfctl/npf_show.c
404
target_list = mk->format ? &sublist : &ctx->list[mk->list_id];
usr.sbin/npf/npfctl/npf_show.c
443
list_push(&ctx->list[mk->list_id], val);
usr.sbin/npf/npfctl/npf_show.c
462
elem_list_t *list = &ctx->list[plist];
usr.sbin/npf/npfctl/npf_show.c
464
if (list->count) {
usr.sbin/npf/npfctl/npf_show.c
465
char *elements = list_join_free(list, false, " ");
usr.sbin/npf/npfctl/npf_show.c
496
elem_list_t *list;
usr.sbin/npf/npfctl/npf_show.c
499
list = &ctx->list[refs[which].alist];
usr.sbin/npf/npfctl/npf_show.c
500
if (list->count != 0) {
usr.sbin/npf/npfctl/npf_show.c
502
elements = list_join_free(list, true, ", ");
usr.sbin/npf/npfctl/npf_show.c
507
list = &ctx->list[refs[which].plist];
usr.sbin/npf/npfctl/npf_show.c
508
if (list->count != 0) {
usr.sbin/npf/npfctl/npf_show.c
513
elements = list_join_free(list, true, ", ");
usr.sbin/npf/npfctl/npf_show.c
542
elem_list_t *list;
usr.sbin/npf/npfctl/npf_show.c
545
list = &ctx->list[refs[which].alist];
usr.sbin/npf/npfctl/npf_show.c
546
if (list->count != 0) {
usr.sbin/npf/npfctl/npf_show.c
548
elements = list_join_free(list, true, ", ");
usr.sbin/npf/npfctl/npf_show.c
84
elem_list_t list[LIST_COUNT];
usr.sbin/paxctl/paxctl.c
172
int clear, int list, int many)
usr.sbin/paxctl/paxctl.c
203
fd = open(name, list ? O_RDONLY: O_RDWR, 0);
usr.sbin/paxctl/paxctl.c
269
if (list) {
usr.sbin/paxctl/paxctl.c
312
if (list && !flagged) {
usr.sbin/paxctl/paxctl.c
326
int i, clear = 0, list = 0, bad = 0, many, minus;
usr.sbin/paxctl/paxctl.c
379
list = 1;
usr.sbin/paxctl/paxctl.c
390
clear, list, many);
usr.sbin/quotaon/quotaon.c
276
oneof(const char *target, char *list[], int cnt)
usr.sbin/quotaon/quotaon.c
281
if (strcmp(target, list[i]) == 0)
usr.sbin/quotaon/quotaon.c
75
static int oneof(const char *target, char *list[], int cnt);
usr.sbin/repquota/repquota.c
558
oneof(const char *target, char *list[], int cnt)
usr.sbin/repquota/repquota.c
563
if (strcmp(target, list[i]) == 0)
usr.sbin/rpcbind/warmstart.c
101
read_struct(const char *filename, xdrproc_t structproc, void *list)
usr.sbin/rpcbind/warmstart.c
123
if (structproc(&xdrs, list) == FALSE) {
usr.sbin/rpcbind/warmstart.c
74
write_struct(const char *filename, xdrproc_t structproc, void *list)
usr.sbin/rpcbind/warmstart.c
90
if (structproc(&xdrs, list) == FALSE) {
usr.sbin/rtadvd/config.c
1045
TAILQ_FOREACH(rdnsa, &rdns->list, next)
usr.sbin/rtadvd/config.c
1051
TAILQ_FOREACH(dnsd, &dnsl->list, next)
usr.sbin/rtadvd/config.c
1190
TAILQ_FOREACH(rdnsa, &rdns->list, next) {
usr.sbin/rtadvd/config.c
1207
TAILQ_FOREACH(dnsd, &dnsl->list, next) {
usr.sbin/rtadvd/config.c
135
while ((rdnsa = TAILQ_FIRST(&rdnss->list))) {
usr.sbin/rtadvd/config.c
136
TAILQ_REMOVE(&rdnss->list, rdnsa, next);
usr.sbin/rtadvd/config.c
144
while ((dnsd = TAILQ_FIRST(&dnssl->list))) {
usr.sbin/rtadvd/config.c
145
TAILQ_REMOVE(&dnssl->list, dnsd, next);
usr.sbin/rtadvd/config.c
660
TAILQ_INIT(&rdnss->list);
usr.sbin/rtadvd/config.c
667
TAILQ_INSERT_TAIL(&rdnss->list, rdnsa, next);
usr.sbin/rtadvd/config.c
698
TAILQ_INIT(&dnssl->list);
usr.sbin/rtadvd/config.c
705
TAILQ_INSERT_TAIL(&dnssl->list, dnsd, next);
usr.sbin/rtadvd/dump.c
235
TAILQ_FOREACH(rdnsa, &rdns->list, next)
usr.sbin/rtadvd/dump.c
248
TAILQ_FOREACH(dnsd, &dnsl->list, next) {
usr.sbin/rtadvd/rtadvd.c
113
TAILQ_HEAD(, nd_optlist) list;
usr.sbin/rtadvd/rtadvd.c
121
#define nd_opts_list nd_opt_each.list
usr.sbin/rtadvd/rtadvd.h
111
TAILQ_HEAD(, rdnss_addr) list;
usr.sbin/rtadvd/rtadvd.h
125
TAILQ_HEAD(, dnssl_domain) list;
usr.sbin/sysinst/disks.c
1720
process_found_fs(struct data *list, size_t num, const struct lookfor *item,
usr.sbin/sysinst/disks.c
1732
if (num < 2 || strstr(list[2].u.s_val, "noauto") != NULL)
usr.sbin/sysinst/disks.c
1735
is_root = strcmp(list[1].u.s_val, "/") == 0;
usr.sbin/sysinst/disks.c
1744
for (src = list[0].u.s_val, dst =src; src[0] != 0; ) {
usr.sbin/sysinst/disks.c
1751
if (!find_part_by_name(list[0].u.s_val,
usr.sbin/sysinst/disks.c
1774
len = strlen(list[0].u.s_val);
usr.sbin/sysinst/disks.c
1775
if (list[0].u.s_val[len-1] >= 'a' &&
usr.sbin/sysinst/disks.c
1776
list[0].u.s_val[len-1] <=
usr.sbin/sysinst/disks.c
1778
strlcat(rdev, &list[0].u.s_val[len-1],
usr.sbin/sysinst/disks.c
1780
strlcat(dev, &list[0].u.s_val[len-1],
usr.sbin/sysinst/disks.c
1785
strlcat(rdev, list[0].u.s_val, sizeof(rdev));
usr.sbin/sysinst/disks.c
1787
strlcat(dev, list[0].u.s_val, sizeof(dev));
usr.sbin/sysinst/disks.c
1803
strlcpy(tmp, list[2].u.s_val, sizeof(tmp));
usr.sbin/sysinst/disks.c
1822
error = target_mount(options, dev, list[1].u.s_val);
usr.sbin/sysinst/disks.c
1824
msg_fmt_display(MSG_mount_failed, "%s", list[0].u.s_val);
usr.sbin/sysinst/disks.c
1833
found_fs(struct data *list, size_t num, const struct lookfor *item)
usr.sbin/sysinst/disks.c
1835
return process_found_fs(list, num, item, true);
usr.sbin/sysinst/disks.c
1840
found_fs_nocheck(struct data *list, size_t num, const struct lookfor *item)
usr.sbin/sysinst/disks.c
1842
return process_found_fs(list, num, item, false);
usr.sbin/sysinst/disks.c
585
dev_in_list(const char *dev, const char **list)
usr.sbin/sysinst/disks.c
588
for ( ; *list; list++) {
usr.sbin/sysinst/disks.c
590
size_t len = strlen(*list);
usr.sbin/sysinst/disks.c
593
if (strncmp(dev, *list, len) == 0) {
usr.sbin/sysinst/gpt.c
599
struct gpt_part_entry **list,
usr.sbin/sysinst/gpt.c
606
for (pno = 0, last = NULL, p = *list; p != NULL;
usr.sbin/sysinst/gpt.c
638
*list = entry;
usr.sbin/sysinst/gpt.c
640
if (*list == NULL)
usr.sbin/sysinst/gpt.c
641
*list = entry;
usr.sbin/sysinst/txtwalk.h
56
int (*func) (struct data *list, size_t num, const struct lookfor*);
usr.sbin/sysinst/util.c
2493
usage_info_list_from_parts(struct part_usage_info **list, size_t *count,
usr.sbin/sysinst/util.c
2507
*list = calloc(num, sizeof(**list));
usr.sbin/sysinst/util.c
2508
if (*list == NULL)
usr.sbin/sysinst/util.c
2515
(*list)[no].size = info.size;
usr.sbin/sysinst/util.c
2517
strlcpy((*list)[no].mount, info.last_mounted,
usr.sbin/sysinst/util.c
2518
sizeof((*list)[no].mount));
usr.sbin/sysinst/util.c
2519
(*list)[no].instflags |= PUIINST_MOUNT;
usr.sbin/sysinst/util.c
2521
(*list)[no].parts = parts;
usr.sbin/sysinst/util.c
2522
(*list)[no].cur_part_id = pno;
usr.sbin/sysinst/util.c
2523
(*list)[no].cur_start = info.start;
usr.sbin/sysinst/util.c
2524
(*list)[no].cur_flags = info.flags;
usr.sbin/sysinst/util.c
2525
(*list)[no].type = info.nat_type->generic_ptype;
usr.sbin/sysinst/util.c
2526
if ((*list)[no].type == PT_swap) {
usr.sbin/sysinst/util.c
2527
(*list)[no].fs_type = FS_SWAP;
usr.sbin/sysinst/util.c
2528
(*list)[no].fs_version = 0;
usr.sbin/sysinst/util.c
2530
(*list)[no].fs_type = info.fs_type;
usr.sbin/sysinst/util.c
2531
(*list)[no].fs_version = info.fs_sub_type;
usr.sbin/sysinst/util.c
2533
(*list)[no].fs_opt1 = info.fs_opt1;
usr.sbin/sysinst/util.c
2534
(*list)[no].fs_opt2 = info.fs_opt2;
usr.sbin/sysinst/util.c
2535
(*list)[no].fs_opt3 = info.fs_opt3;
usr.sbin/tcpdchk/tcpdchk.c
282
static void print_list(char *title, char *list)
usr.sbin/tcpdchk/tcpdchk.c
289
strlcpy(buf, list, sizeof(buf));
usr.sbin/tcpdchk/tcpdchk.c
302
static void check_daemon_list(char *list)
usr.sbin/tcpdchk/tcpdchk.c
309
strlcpy(buf, list, sizeof(buf));
usr.sbin/tcpdchk/tcpdchk.c
329
static void check_client_list(char *list)
usr.sbin/tcpdchk/tcpdchk.c
339
strlcpy(buf, list, sizeof(buf));
usr.sbin/tpctl/data.c
125
TAILQ_INSERT_TAIL(&data->list, elem, link);
usr.sbin/tpctl/data.c
148
TAILQ_INSERT_TAIL(&data->list, elem, link);
usr.sbin/tpctl/data.c
289
TAILQ_FOREACH(elem, &data->list, link) {
usr.sbin/tpctl/data.c
341
while (!TAILQ_EMPTY(&data->list)) {
usr.sbin/tpctl/data.c
342
elem = TAILQ_FIRST(&data->list);
usr.sbin/tpctl/data.c
343
TAILQ_REMOVE(&data->list, elem, link);
usr.sbin/tpctl/data.c
363
TAILQ_FOREACH(elem, &data->list, link) {
usr.sbin/tpctl/data.c
379
TAILQ_INSERT_TAIL(&data->list, elem, link);
usr.sbin/tpctl/data.c
389
TAILQ_FOREACH(elem, &data->list, link) {
usr.sbin/tpctl/data.c
83
TAILQ_INIT(&data->list);
usr.sbin/tpctl/tpctl.h
69
TAILQ_HEAD(,tpctl_data_elem) list;
usr.sbin/wsmoused/wsmoused.c
449
attach_modes(char *list)
usr.sbin/wsmoused/wsmoused.c
456
for (count = 0, (p = strtok_r(list, " ", &last)); p;
usr.sbin/wsmuxctl/wsmuxctl.c
114
int wsfd, list, c, add, rem, recursive;
usr.sbin/wsmuxctl/wsmuxctl.c
122
list = 0;
usr.sbin/wsmuxctl/wsmuxctl.c
146
list++;
usr.sbin/wsmuxctl/wsmuxctl.c
171
if (list) {
usr.sbin/ypserv/common/yplib_host.c
308
*outmaplist = ypml.list;
usr.sbin/ypserv/ypserv/ypserv_proc.c
495
m->ypml_next = res.list;
usr.sbin/ypserv/ypserv/ypserv_proc.c
496
res.list = m;
