/openbsd-current/usr.bin/find/ |
H A D | operator.c | 56 (*planp) = (*planp)->next; 57 node->next = NULL; 70 PLAN *next; /* temp node holding subexpression results */ local 88 if ((next = yankexpr(planp)) == NULL) 97 if (next->type == N_CLOSEPAREN) { 106 tail = subplan = next; 108 tail->next = next; 109 tail = next; 111 tail->next 161 PLAN *next; /* next node being processed */ local 220 PLAN *next; /* next node being processed */ local [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/f/ |
H A D | stt.c | 85 new->next = list->previous->next; 87 new->next->previous = new; 88 new->previous->next = new; 110 new->next = new->previous = new; 132 ffesttCaseList next; 134 for (next = list->next; next != list; next 131 ffesttCaseList next; local 185 ffesttDimList next; local 422 ffesttDimList next; local 443 ffesttDimList next; local 548 ffesttExprList next; local 573 ffesttExprList next; local 635 ffesttFormatList next; local 765 ffesttImpList next; local 786 ffesttImpList next; local [all...] |
/openbsd-current/usr.sbin/mrouted/ |
H A D | rsrr_var.h | 45 struct rsrr_cache *next; /* next cache item */ member in struct:rsrr_cache
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.dg/ |
H A D | uninit-1.c | 8 struct list *next; member in struct:list 18 for (p = el; p; p = p->next) 20 for (q = el; q != p; q = q->next) 23 r->next = p->next;
|
/openbsd-current/lib/libssl/ |
H A D | pqueue.c | 81 item->next = NULL; 107 pitem *curr, *next; local 114 for (curr = NULL, next = pq->items; next != NULL; 115 curr = next, next = next->next) { 118 int cmp = memcmp(next->priority, item->priority, 120 if (cmp > 0) { /* next > ite 159 pitem *next; local [all...] |
/openbsd-current/sys/dev/usb/dwc2/ |
H A D | list.h | 16 * The above copyright notice and this permission notice (including the next 49 struct list_head *next, *prev; member in struct:list_head 59 (head)->next = head; 65 return (head)->next == head; 70 (head)->next->prev = new; 71 (new)->next = (head)->next; 73 (head)->next = new; 79 (entry)->next = head; 80 (head)->prev->next [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | bb-reorder.c | 102 ordering in RBI()->index and chained through RBI()->next. */ 108 basic_block next, bb; 113 next = NULL; 115 /* Find the next unplaced block. */ 125 next = bb; 129 if (next) 130 prev = make_reorder_chain_1 (next, prev); 132 while (next); 133 RBI (prev)->next = NULL; 143 basic_block next; 107 basic_block next, bb; local 142 basic_block next; local 191 basic_block next; local [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20000801-2.c | 7 struct foo *next; member in struct:foo 15 node = node->next; 34 a.next = &b; 35 b.next = (struct foo *)0;
|
H A D | 990128-1.c | 15 struct s *next; local 19 next = p; 21 next->n = &sss[i]; 22 next = next->n; 24 next->n = 0;
|
/openbsd-current/lib/libc/stdio/ |
H A D | glue.h | 40 struct glue *next; member in struct:glue
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20000420-1.c | 1 struct z_candidate { struct z_candidate *next;int viable;}; member in struct:z_candidate 13 p = &((*p)->next); 15 *p = (*p)->next;
|
/openbsd-current/usr.sbin/ypserv/revnetgroup/ |
H A D | hash.h | 39 struct grouplist *next; member in struct:grouplist 47 struct member_entry *next; member in struct:member_entry 54 struct group_entry *next; member in struct:group_entry
|
/openbsd-current/usr.bin/m4/ |
H A D | tokenizer.l | 80 char *next; 85 base = strtol(yytext+2, &next, 0); 86 if (base > 36 || next == NULL) { 89 next++; 90 while (*next != 0) { 91 if (*next >= '0' && *next <= '9') 92 d = *next - '0'; 93 else if (*next >= 'a' && *next < [all...] |
/openbsd-current/games/battlestar/ |
H A D | battlestar.c | 51 char *next; local 69 next = getcom(mainbuf, sizeof mainbuf, ">-: ", 71 for (wordcount = 0; next && wordcount < NWORD - 1; wordcount++) 72 next = getword(next, words[wordcount], -1);
|
/openbsd-current/sys/dev/pci/drm/include/drm/ |
H A D | spsc_queue.h | 35 struct spsc_node *next; member in struct:spsc_node 69 node->next = NULL; 73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); 91 struct spsc_node *next, *node; local 101 next = READ_ONCE(node->next); 102 WRITE_ONCE(queue->head, next); 104 if (unlikely(!next)) { 108 (long)&node->next, (long) &queue->head) != (long)&node->next) { [all...] |
/openbsd-current/usr.sbin/unbound/services/ |
H A D | outbound_list.c | 59 np = p->next; 72 e->next = list->first; 83 if(e->next) 84 e->next->prev = e->prev; 86 e->prev->next = e->next; 87 else list->first = e->next;
|
/openbsd-current/sbin/unwind/libunbound/services/ |
H A D | outbound_list.c | 59 np = p->next; 72 e->next = list->first; 83 if(e->next) 84 e->next->prev = e->prev; 86 e->prev->next = e->next; 87 else list->first = e->next;
|
/openbsd-current/lib/libelf/ |
H A D | elf_next.c | 38 off_t next; local 53 next = e->e_rawfile - parent->e_rawfile + (off_t) e->e_rawsize; 54 next = (next + 1) & ~1; /* round up to an even boundary */ 58 * next call to 'elf_begin()'. 60 parent->e_u.e_ar.e_next = (next >= (off_t) parent->e_rawsize) ? 61 (off_t) 0 : next; 68 * 'e_next' field so that the next call to elf_begin(3) will terminate 72 if (next > (off_t) parent->e_rawsize) {
|
/openbsd-current/usr.bin/dig/lib/dns/rdata/generic/ |
H A D | talink_58.c | 24 dns_name_t next; local 32 dns_name_init(&next, NULL); 40 dns_name_fromregion(&next, &dregion); 41 isc_region_consume(&dregion, name_length(&next)); 48 sub = name_prefix(&next, tctx->origin, &prefix); 55 dns_name_t next; local 65 dns_name_init(&next, NULL); 68 return(dns_name_fromwire(&next, source, dctx, options, target)); 75 dns_name_t next; local 85 dns_name_init(&next, roffset [all...] |
/openbsd-current/lib/libc/yp/ |
H A D | ypexclude.c | 52 new->next = *headp; 62 for (curr = *headp; curr; curr = curr->next) { 72 struct _ypexclude *curr, *next; local 74 for (curr = *headp; curr; curr = next) { 75 next = curr->next;
|
H A D | ypexclude.h | 36 struct _ypexclude *next; member in struct:_ypexclude
|
/openbsd-current/games/atc/ |
H A D | list.c | 65 p->next = p->prev = NULL; 72 q = q -> next; 78 r->next = p; 79 p->next = q; 82 p->next = q; 88 l->tail->next = p; 89 p->next = NULL; 105 l->head = p->next; 109 l->tail->next = NULL; 111 p->prev->next [all...] |
/openbsd-current/lib/libc/stdlib/ |
H A D | rand.c | 35 static u_int next = 1; variable 55 return (rand_r(&next)); 73 next = seed;
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.benjamin/ |
H A D | p12475.C | 14 enum huh { start =-TEST, next }; // WARNING - enumerator in enum:huh
|
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | crash31.C | 4 struct mbuf *next; member in struct:mbuf
|