/openbsd-current/lib/libcurses/tinfo/ |
H A D | entries.c | 56 * | ----+-->| ----+-->| NULL | next 75 for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) { 78 last->next = ep->next; 80 if (ep->next != 0) { 81 ep->next->last = last; 84 _nc_head = ep->next; 138 for (p = _nc_prescreen.allocated; p != 0; p = p->next) {
|
/openbsd-current/gnu/gcc/gcc/ |
H A D | ipa.c | 45 for (node = cgraph_nodes; node; node = node->next) 47 for (node = cgraph_nodes; node; node = node->next) 86 for (node = cgraph_nodes; node; node = node->next) 100 struct cgraph_node *node, *next; local 110 for (node = cgraph_nodes; node; node = node->next) 113 for (node = cgraph_nodes; node; node = node->next) 154 for (node = cgraph_nodes; node; node = next) 156 next = node->next; 205 for (node = cgraph_nodes; node; node = node->next) [all...] |
H A D | gengtype-yacc.y | 131 for (p = $3; p->next != NULL; p = p->next) 138 p->next = $1; 147 for (p = $6; p->next != NULL; p = p->next) 153 p->next = $1; 164 p->next = $1; 168 p->opt->next = NULL; 175 p->next = $1; 179 p->opt->next [all...] |
H A D | et-forest.c | 47 struct et_occ *next; /* Right son in the splay-tree. */ member in struct:et_occ 99 /* Sets next field of OCC to P. */ 108 occ->next = t; 121 || (occ->next 122 && mson->min > occ->next->min)) 123 mson = occ->next; 148 gcc_assert (occ->next != occ); 149 gcc_assert (!occ->next || occ->next != occ->prev); 151 if (occ->next) [all...] |
H A D | lists.c | 116 alloc_INSN_LIST (rtx val, rtx next) argument 125 XEXP (r, 1) = next; 131 r = gen_rtx_INSN_LIST (VOIDmode, val, next); 140 alloc_EXPR_LIST (int kind, rtx val, rtx next) argument 149 XEXP (r, 1) = next; 153 r = gen_rtx_EXPR_LIST (kind, val, next); 162 alloc_DEPS_LIST (rtx val, rtx next, int ds) argument 171 XEXP (r, 1) = next; 178 r = gen_rtx_DEPS_LIST (VOIDmode, val, next, ds);
|
H A D | tree-ssa-math-opts.c | 122 /* Pointer to the next "struct occurrence"s in the list of blocks 124 struct occurrence *next; member in struct:occurrence 185 *p_occ = occ->next; 186 occ->next = new_occ->children; 189 /* Try the next block (it may as well be dominated by BB). */ 206 *p_occ = occ->next; 207 new_occ->next = occ; 208 occ->next = NULL; 218 /* Nothing special, go on with the next element. */ 219 p_occ = &occ->next; 369 struct occurrence *child, *next; local [all...] |
/openbsd-current/gnu/llvm/compiler-rt/lib/orc/tests/unit/ |
H A D | interval_set_test.cpp | 34 EXPECT_EQ(std::next(S.begin()), S.end()); 47 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. 59 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. 77 EXPECT_EQ(std::next(S.begin()), S.end()); // Should see just one range. 90 EXPECT_EQ(std::next(S.begin()), S.end()); 103 EXPECT_EQ(std::next(S.begin()), S.end()); 116 EXPECT_EQ(std::next(std::next(S.begin())), S.end()); 119 EXPECT_EQ(std::next(S.begin())->first, 9U); 120 EXPECT_EQ(std::next( [all...] |
/openbsd-current/usr.sbin/npppd/common/ |
H A D | hash.c | 74 /* hash_next - Get next item from hash table. 75 * Returns a pointer of next bucket on success. Otherwise returns 85 htbl->bucket_cur = hlink->next; 91 htbl->bucket_cur = hlink->next; 112 for (w = htbl->bucket[c]; w != NULL; w = w->next) 138 n->next = htbl->bucket[c]; 159 for (w = htbl->bucket[i], b = NULL; w != NULL; w = w->next) { 162 b->next = w->next; 164 htbl->bucket[i] = w->next; [all...] |
/openbsd-current/gnu/usr.bin/binutils/gdb/ |
H A D | frame-unwind.c | 35 struct frame_unwind_table_entry *next; member in struct:frame_unwind_table_entry 55 table->osabi_head = &table->list->next; 67 for (ip = table->osabi_head; (*ip) != NULL; ip = &(*ip)->next); 82 entry->next = (*table->osabi_head); 93 for (entry = table->list; entry != NULL; entry = entry->next)
|
H A D | solib-osf.c | 72 CORE_ADDR next; member in struct:__anon4634 139 ldr_module_t next; member in struct:read_map_ctxt 141 CORE_ADDR next; /* next element in module list */ 372 ctxt->next = LDR_NULL_MODULE; 374 CORE_ADDR ldr_context_addr, prev, next; 385 ctxt->next = ldr_context.head; 437 store the next element in SO, advance CTXT to the next element, and return 450 /* Retrieve the next elemen [all...] |
/openbsd-current/sys/lib/libsa/ |
H A D | alloc.c | 107 * 'next' is only used when the block is unallocated (i.e. on the free list). 117 struct fl *next; member in struct:fl 152 f = &((*f)->next); 168 f = &((*f)->next); 205 *f = (*f)->next; 243 f->next = freelist;
|
/openbsd-current/usr.sbin/sasyncd/ |
H A D | timer.c | 45 * at this time. The queue is always sorted so the next event to happen is 49 TAILQ_ENTRY (event) next; 66 * Return the number of seconds until the next event happens. Used for 100 TAILQ_REMOVE(&events, e, next); 136 for (e = TAILQ_FIRST(&events); e; e = TAILQ_NEXT(e, next)) { 139 TAILQ_INSERT_BEFORE(e, new, next); 142 TAILQ_INSERT_TAIL(&events, new, next);
|
/openbsd-current/gnu/usr.bin/binutils/ld/ |
H A D | mri.c | 38 struct section_name_struct *next; member in struct:section_name_struct 66 *ptr = (*ptr)->next; 68 ptr = &((*ptr)->next); 87 (*ptr)->next = NULL; 150 alist = alist->next) 154 for (olist = order; done == 0 && olist != NULL; olist = olist->next) 182 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next) 183 for (ptr2 = order; ptr2; ptr2 = ptr2->next) 192 for (ptr = order; ptr; ptr = ptr->next) 210 for (aptr = alignment; aptr; aptr = aptr->next) [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/ |
H A D | gengtype-yacc.y | 128 for (p = $3; p->next != NULL; p = p->next) 135 p->next = $1; 144 for (p = $6; p->next != NULL; p = p->next) 150 p->next = $1; 161 p->next = $1; 165 p->opt->next = NULL; 172 p->next = $1; 176 p->opt->next [all...] |
/openbsd-current/gnu/usr.bin/binutils-2.17/ld/ |
H A D | mri.c | 38 struct section_name_struct *next; member in struct:section_name_struct 66 *ptr = (*ptr)->next; 68 ptr = &((*ptr)->next); 87 (*ptr)->next = NULL; 137 alist = alist->next) 141 for (olist = order; done == 0 && olist != NULL; olist = olist->next) 169 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next) 170 for (ptr2 = order; ptr2; ptr2 = ptr2->next) 179 for (ptr = order; ptr; ptr = ptr->next) 197 for (aptr = alignment; aptr; aptr = aptr->next) [all...] |
/openbsd-current/gnu/usr.sbin/mkhybrid/src/ |
H A D | files.c | 37 struct file_adds *next; member in struct:file_adds 104 f->next = NULL; 110 for (tmp = f->child; tmp->next != NULL; tmp =tmp->next) { 113 goto next; 118 goto next; 121 tmp->next = e_malloc (sizeof (*tmp->next)); 122 f=tmp->next; 125 f->next [all...] |
H A D | hash.c | 50 s_hash->next = hash_table[hash_number]; 67 spnt = spnt->next; 82 fh1 = fh->next; 101 s_hash->next = directory_hash_table[hash_number]; 116 spnt = spnt->next; 123 struct name_hash * next; member in struct:name_hash 164 new->next = NULL; 168 new->next = name_hash_table[hash]; 178 for(nh = name_hash_table[name_hash(name)]; nh; nh = nh->next) 217 for(nh = name_hash_table[hash]; nh; nh = nh->next) { [all...] |
/openbsd-current/regress/lib/libz/ |
H A D | infcover.c | 51 allocation routines on the next zlib initialization 59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item 99 item->next = zone->first; 114 struct mem_item *item, *next; local 123 /* point next to the item that matches ptr, or NULL if not found -- remove 125 next = zone->first; 126 if (next) { 127 if (next->ptr == ptr) 128 zone->first = next 203 struct mem_item *item, *next; local 248 unsigned next, val; local 449 static unsigned int next = 0; local 622 code *next, table[ENOUGH_DISTS]; local [all...] |
/openbsd-current/gnu/usr.bin/cvs/src/ |
H A D | hash.c | 58 listcache = listcache->next; 59 list->next = (List *) NULL; 71 node->next = node->prev = node; 92 while (p->next != p) 93 delnode (p->next); 106 p->next = nodecache; 119 (*listp)->next = listcache; 140 nodecache = p->next; 166 p->next->prev = p->prev; 167 p->prev->next [all...] |
/openbsd-current/sys/dev/pci/drm/amd/amdgpu/ |
H A D | amdgpu_res_cursor.h | 59 struct list_head *head, *next; local 82 next = block->link.next; 83 if (next != head) 84 block = list_entry(next, struct drm_buddy_block, link); 124 * Move the cursor @size bytes forwrad, walking to the next node if necessary. 130 struct list_head *next; local 148 next = block->link.next; 149 block = list_entry(next, struc [all...] |
/openbsd-current/usr.sbin/makefs/ |
H A D | walk.c | 87 while (cur->next != NULL) 88 cur = cur->next; 118 cur = join->next; 126 cur = cur->next; 146 cur->next = first; 153 prev->next = cur; 186 for (cur = first->next; cur != NULL; cur = cur->next) 224 fsnode *cur, *next; local 239 for (cur = node->first; cur->next; cu [all...] |
/openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | p2746.C | 20 Link::Link(Link *next) : next_(next) argument 105 void next(); 128 void IListIterBase::next() function in class:IListIterBase 139 IListIterBase::next; member in class:IListIter::IListIterBase 153 for (IListIter<Link> iter(list); !iter.done(); iter.next())
|
/openbsd-current/gnu/usr.bin/cvs/diff/ |
H A D | util.c | 35 struct msg *next; member in struct:msg 141 new->next = 0; 143 msg_chain_end = &new->next; 160 for (m = msg_chain; m; m = m->next) 565 struct change *next = script; 567 while (next) 572 this = next; 573 end = (*hunkfun) (next); 576 making them a hunk, and remember the rest for next iteration. */ 577 next 559 struct change *next = script; local 753 struct change *next; local [all...] |
/openbsd-current/usr.sbin/tcpdump/ |
H A D | print-igrp.c | 84 u_int nint, nsys, next; local 97 next = EXTRACT_16BITS(&hdr->ig_nx); 106 next); 118 } else if (next > 0) { 121 --next; 129 if (nint == 0 && nsys == 0 && next == 0)
|
/openbsd-current/usr.sbin/dhcpd/ |
H A D | hash.c | 112 bp->next = table->buckets[hashno]; 134 for (bp = table->buckets[hashno]; bp; bp = bp->next) { 139 pbp->next = bp->next; 141 table->buckets[hashno] = bp->next; 163 for (bp = table->buckets[hashno]; bp; bp = bp->next)
|