/freebsd-11-stable/contrib/binutils/libiberty/ |
H A D | objalloc.c | 61 struct objalloc_chunk *next; member in struct:objalloc_chunk 103 chunk->next = NULL; 141 chunk->next = (struct objalloc_chunk *) o->chunks; 155 chunk->next = (struct objalloc_chunk *) o->chunks; 177 struct objalloc_chunk *next; local 179 next = l->next; 181 l = next; 199 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next) 234 struct objalloc_chunk *next; local 276 struct objalloc_chunk *next; local [all...] |
H A D | partition.c | 54 part->elements[e].next = &(part->elements[e]); 108 for (p = e2->next; p != e2; p = p->next) 113 old_next = e1->next; 114 e1->next = e2->next; 115 e2->next = old_next; 168 c = elements[c].next - elements;
|
H A D | regex.c | 1460 unsigned long int avail; /* Offset of next open position. */ 1487 unsigned avail; /* Offset of next open position. */ 1613 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\ 1730 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \ 1885 /* Fetch the next character in the uncompiled pattern---translating it 1908 /* Fetch the next character in the uncompiled pattern, with no 2142 unsigned avail; /* Offset of next open position. */ 2151 /* The next available element. */ 2163 /* Get the next unsigned number in the uncompiled pattern. */ 2493 /* Otherwise, depends on what's next 4308 const CHAR_T *next = p; local [all...] |
H A D | xatexit.c | 51 struct xatexit *next; /* next in list */ member in struct:xatexit 52 int ind; /* next index in this table */ 81 p->next = xatexit_head; 96 for (p = xatexit_head; p; p = p->next)
|
/freebsd-11-stable/contrib/binutils/opcodes/ |
H A D | arc-ext.c | 83 for (r = arc_extension_map.auxRegisters; r; r = r->next) { 96 if (r -> next) 98 clean_aux_registers( r->next); 100 free(r -> next); 101 r ->next = NULL; 224 newAuxRegister->next = arc_extension_map.auxRegisters; 233 p += p[0]; /* move to next record */ 249 for (p = text_bfd->sections; p != NULL; p = p->next)
|
H A D | arc-ext.h | 42 struct ExtAuxRegister *next; member in struct:ExtAuxRegister
|
H A D | arc-opc.c | 1056 ext_oper = ext_oper->next; 1705 ext_oper = ext_oper->next; 1757 suffix = suffix->next;
|
H A D | cgen-asm.c | 61 The result is a pointer to the next entry to use. 84 hentbuf->next = htable[hash]; 104 for (ilist = insns; ilist != NULL; ilist = ilist->next, ++ hentbuf) 111 hentbuf->next = htable[hash];
|
H A D | cgen-dis.c | 71 current_buf = current_buf->next) 81 hentbuf->next = current_buf; 85 previous_buf->next = hentbuf; 95 The result is a pointer to the next entry to use. 149 for (ilist = insns; ilist != NULL; ilist = ilist->next, ++ hentbuf)
|
H A D | cgen-opc.c | 174 /* Return the next keyword specified by SEARCH. 175 The result is the next entry or NULL if there are no more. */ 193 /* Move to next hash chain [unless we haven't started yet]. */ 343 for ( ; rt_insns != NULL; rt_insns = rt_insns->next) 358 for ( ; rt_insns != NULL; rt_insns = rt_insns->next) 518 insn_list = insn_list->next;
|
H A D | i386-gen.c | 78 /* Find next field separated by '.' and terminate it. Return a 82 next_field (char *str, char **next) argument 92 *next = str + 1;
|
H A D | ia64-gen.c | 86 struct main_entry *next; member in struct:main_entry 154 /* The next entry sharing the same decode. */ 157 /* The next entry in the name list. */ 1794 struct bittree *next; 1812 next = curr_ent->bits[b]; 1813 if (next == NULL) 1815 next = make_bittree_entry (); 1816 curr_ent->bits[b] = next; 1818 insert_bit_table_ent (next, bit - 1, opcode, mask, opcodenum, order, 1874 struct bittree *next 1786 struct bittree *next; local 1864 struct bittree *next = ent->bits[2]; local [all...] |
H A D | mep-dis.c | 132 the core insn, we need to print the + on the next line. */ 1090 struct cpu_desc_list *next; 1151 for (cl = cd_list; cl; cl = cl->next) 1190 cl->next = cd_list; 1086 struct cpu_desc_list *next; member in struct:cpu_desc_list
|
H A D | sparc-dis.c | 52 struct sparc_opcode_hash *next; member in struct:sparc_opcode_hash 195 for (op = opcode_hash_table[HASH_INSN (insn)]; op; op = op->next) 416 h->next = hash_table[hash]; 509 for (op = opcode_hash_table[HASH_INSN (insn)]; op; op = op->next)
|
/freebsd-11-stable/contrib/blacklist/port/ |
H A D | popenve.c | 68 struct pid *next; member in struct:pid 129 for (old = pidlist; old; old = old->next) 176 cur->next = pidlist; 244 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next) 259 pidlist = cur->next; 261 last->next = cur->next;
|
/freebsd-11-stable/contrib/bmake/ |
H A D | dir.c | 738 goto next; 748 next:
|
H A D | hash.c | 182 nexth = h->next; 230 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) 278 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) { 295 e->next = *hp; 332 (p = *hp) != NULL; hp = &p->next) { 334 *hp = p->next; 386 * The return value is a pointer to the next HashEntry 392 * next entry. 406 * to start at the next one in the chain. 410 e = e->next; 444 Hash_Entry *e, *next = NULL, **hp, **xp; local [all...] |
H A D | hash.h | 89 struct Hash_Entry *next; /* Used to link together all the member in struct:Hash_Entry
|
/freebsd-11-stable/contrib/bmake/lst.lib/ |
H A D | lstForEachFrom.c | 78 ListNode next; local 92 next = tln->nextPtr; 96 * - the next node to examine is the first in the queue or 101 done = (next == NULL || next == list->firstPtr); 112 if (next != tln->nextPtr) { 113 next = tln->nextPtr; 120 tln = next;
|
/freebsd-11-stable/contrib/bmake/mk/ |
H A D | dirdeps.mk | 700 # we pass _DEP_TARGET_SPEC to tell the next step what we want
|
H A D | sys.clean-env.mk | 90 # This next bit may need tweaking
|
/freebsd-11-stable/contrib/bmake/unit-tests/ |
H A D | escape.mk | 19 # <newline>, and the next line, except that the first character of 20 # the next line shall not be included if it is a <tab>. 164 # on the next line, is replaced by a single space.
|
H A D | forloop.mk | 43 @echo We expect an error next:
|
H A D | posix1.mk | 17 # Escaped newlines and leading whitespace from the next line are replaced 19 # are retained, but a single leading tab (if any) from the next line is
|
/freebsd-11-stable/contrib/bsnmp/lib/ |
H A D | snmpagent.c | 296 snmp_debug("next: searching %s", 307 snmp_debug("next: found scalar %s", 311 /* try next */ 314 snmp_debug("next: found column %s", 321 snmp_debug("next: found %s", 329 snmp_debug("next: failed"); 339 int ret, next; local 341 if ((tp = next_node(inb, &next)) == NULL) 346 if (tp->type == SNMP_NODE_LEAF || next) 371 /* object has no data - try next */ [all...] |