/freebsd-11-stable/contrib/groff/src/devices/grohtml/ |
H A D | html-text.cpp | 129 p = p->next; 286 stackptr = stackptr->next; 303 p = p->next; 320 p = p->next; 355 lastptr->next = p; 357 p->next = NULL; 359 p->next = stackptr; 510 stackptr = stackptr->next; 517 p->next = temp; 532 stackptr = stackptr->next; [all...] |
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | thread.c | 77 for (tp = thread_list; tp; tp = tp->next) 112 tpnext = tp->next; 131 tp->next = thread_list; 143 for (tp = thread_list; tp; tpprev = tp, tp = tp->next) 151 tpprev->next = tp->next; 153 thread_list = tp->next; 163 for (tp = thread_list; tp; tp = tp->next) 176 for (tp = thread_list; tp; tp = tp->next) 203 for (tp = thread_list; tp; tp = tp->next) 397 struct thread_info *tp, *next; local [all...] |
/freebsd-11-stable/crypto/heimdal/lib/hx509/ |
H A D | error.c | 43 hx509_error next; member in struct:hx509_error_data 52 hx509_error m2 = msg->next; 113 msg->next = context->error; 178 for (msg = context->error; msg; msg = msg->next) 180 msg->next != NULL ? "; " : "");
|
/freebsd-11-stable/sys/netinet/libalias/ |
H A D | alias_mod.c | 136 SLIST_FOREACH(b, &dll_chain, next) { 140 SLIST_INSERT_HEAD(&dll_chain, p, next); 152 SLIST_FOREACH_SAFE(b, &dll_chain, next, b_tmp) 154 SLIST_REMOVE(&dll_chain, b, dll, next); 169 SLIST_REMOVE_HEAD(&dll_chain, next);
|
/freebsd-11-stable/usr.bin/find/ |
H A D | find.c | 95 * plan->next pointer. 103 tail->next = new; 124 new->next = plan; 128 tail->next = new; 132 tail->next = new; 233 for (p = plan; p && (p->execute)(p, entry); p = p->next);
|
/freebsd-11-stable/usr.bin/mkuzip/ |
H A D | mkuz_blockcache.c | 46 struct mkuz_blkcache_itm *next; member in struct:mkuz_blkcache_itm 111 for (bcep = &blkcache.first[h]; bcep != NULL; bcep = bcep->next) { 143 bcep->next = blkcache.first[h].next; 144 blkcache.first[h].next = bcep;
|
/freebsd-11-stable/contrib/ipfilter/ipsend/ |
H A D | 44arp.c | 65 char *lim, *buf, *next; local 105 for (next = buf; next < lim; next += rtm->rtm_msglen) 107 rtm = (struct rt_msghdr *)next;
|
/freebsd-11-stable/contrib/tcsh/ |
H A D | ed.xmap.c | 106 struct Xmapnode *next; /* ptr to next char of this Xkey */ member in struct:Xmapnode 177 if (ptr->next) { 178 /* Xkey not complete so get next char */ 184 return (TraverseMap(ptr->next, ch, val)); 196 /* try next sibling */ 200 /* no next sibling -- mismatch */ 257 if (ptr->next != NULL) { 258 PutFreeNode(ptr->next); /* lose longer Xkeys with this prefix */ 259 ptr->next [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | MetaRenamer.cpp | 48 unsigned long next; member in struct:__anon2788::PRNG 51 next = seed; 55 next = next * 1103515245 + 12345; 56 return (unsigned int)(next / 65536) % 32768;
|
/freebsd-11-stable/contrib/gdb/gdb/cli/ |
H A D | cli-script.c | 58 struct user_args *next; member in struct:user_args 83 cmd->next = NULL; 141 list = list->next; 151 list = list->next; 160 list = list->next; 174 list = list->next; 200 list = list->next; 204 /* ignore illegal command type and try next */ 205 list = list->next; 286 cmdlines = cmdlines->next; 781 struct command_line **body_ptr, *child_tail, *next; local 890 struct command_line *head, *tail, *next; local 978 struct command_line *next; local [all...] |
/freebsd-11-stable/contrib/binutils/ld/ |
H A D | ldctor.c | 66 for (p = sets; p != NULL; p = p->next) 73 p->next = sets; 109 e->next = NULL; 114 for (epp = &p->elements; *epp != NULL; epp = &(*epp)->next) 213 for (p = sets; p != NULL; p = p->next) 223 for (e = p->elements; e != NULL; e = e->next) 229 for (e = p->elements; e != NULL; e = e->next) 240 array[i]->next = array[i + 1]; 241 array[i]->next = NULL; 253 for (p = sets; p != NULL; p = p->next) [all...] |
/freebsd-11-stable/crypto/heimdal/lib/krb5/ |
H A D | keytab_any.c | 39 struct any_data *next; member in struct:any_data 45 struct any_data *next; local 47 for (; a != NULL; a = next) { 48 next = a->next; 80 prev->next = a; 81 a->next = NULL; 139 for (ed->a = a; ed->a != NULL; ed->a = ed->a->next) { 173 while ((ed->a = ed->a->next) != NULL) { 216 a = a->next; [all...] |
/freebsd-11-stable/contrib/ofed/libibverbs/ |
H A D | init.c | 61 struct ibv_sysfs_dev *next; member in struct:ibv_sysfs_dev 68 struct ibv_driver_name *next; member in struct:ibv_driver_name 74 struct ibv_driver *next; member in struct:ibv_driver 115 sysfs_dev->next = sysfs_dev_list; 147 driver->next = NULL; 150 tail_driver->next = driver; 214 for (driver = head_driver; driver; driver = driver->next) { 313 for (sysfs_dev = sysfs_dev_list; sysfs_dev; sysfs_dev = sysfs_dev->next) { 345 for (sysfs_dev = sysfs_dev_list; sysfs_dev; sysfs_dev = sysfs_dev->next) { 358 next_dev = sysfs_dev ? sysfs_dev->next [all...] |
/freebsd-11-stable/sbin/kldconfig/ |
H A D | kldconfig.c | 52 TAILQ_ENTRY(pathentry) next; 164 TAILQ_FOREACH(pe, pathq, next) 180 TAILQ_INSERT_TAIL(pathq, pe, next); 183 pskip = TAILQ_NEXT(pskip, next); 185 TAILQ_INSERT_BEFORE(pskip, pe, next); 187 TAILQ_INSERT_TAIL(pathq, pe, next); 211 TAILQ_FOREACH(pe, pathq, next) 221 TAILQ_REMOVE(pathq, pe, next); 253 TAILQ_INSERT_TAIL(pathq, pe, next); 267 TAILQ_FOREACH(pe, pathq, next) { [all...] |
/freebsd-11-stable/contrib/apr/network_io/unix/ |
H A D | inet_ntop.c | 106 char *next = dst; local 115 *next++ = '0' + u/100; 117 *next++ = '0' + u/10; 121 *next++ = '0' + u/10; 124 *next++ = '0' + u; 125 *next++ = '.'; 128 *--next = 0;
|
/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)
|
/freebsd-11-stable/sys/dev/drm/ |
H A D | drm_auth.c | 13 * The above copyright notice and this permission notice (including the next 56 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) { 85 entry->next = NULL; 88 dev->magiclist[hash].tail->next = entry; 113 for (pt = dev->magiclist[hash].head; pt; prev = pt, pt = pt->next) { 116 dev->magiclist[hash].head = pt->next; 122 prev->next = pt->next;
|
/freebsd-11-stable/contrib/binutils/bfd/ |
H A D | hash.c | 267 <<next>>. 443 hashp = hashp->next) 471 hashp->next = table->table[index]; 501 while (chain_end->next && chain_end->next->hash == chain->hash) 502 chain_end = chain_end->next; 504 table->table[hi] = chain_end->next; 506 chain_end->next = newtable[index]; 529 pph = &(*pph)->next) 581 for (p = table->table[i]; p != NULL; p = p->next) 627 struct strtab_hash_entry *next; member in struct:strtab_hash_entry [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/ |
H A D | LibCxxList.cpp | 35 ListEntry next() { function in class:__anon1457::ListEntry 87 next(); 91 next(); 104 void next() { m_entry = m_entry.next(); } function in class:__anon1457::ListIterator 205 m_slow_runner = ListEntry(m_head).next(); 206 m_fast_runner = m_slow_runner.next(); 218 m_slow_runner = m_slow_runner.next(); 219 m_fast_runner = m_fast_runner.next().next(); [all...] |
/freebsd-11-stable/contrib/groff/src/devices/xditview/ |
H A D | font.c | 37 for (f = dw->dvi.fonts; f; f = f->next) 49 for (f = dw->dvi.fonts; f; f = f->next) 67 for (best = f->sizes; best; best = best->next) 71 best->next = f->sizes; 88 for (fs = f->sizes; fs; fs=fs->next) { 172 new_size->next = sizes; 187 DviFontSizeList *next; local 189 for (; fs; fs=next) { 190 next = fs->next; 344 DviFontMap *next; local [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/ |
H A D | llex.c | 26 #define next(ls) (ls->current = zgetc(ls->z)) macro 44 #define save_and_next(ls) (save(ls, ls->current), next(ls)) 149 next(ls); /* skip `\n' or `\r' */ 151 next(ls); /* skip `\n\r' or `\r\n' */ 293 else next(ls); 318 c[i] = next(ls); 333 next(ls); 354 next(ls); /* do not save the `\' */ 368 case EOZ: goto no_save; /* will raise an error next loop */ 370 next(l [all...] |
/freebsd-11-stable/contrib/mtree/ |
H A D | spec.c | 113 char *p, *e, *next; local 140 next = buf; 141 while ((p = strsep(&next, " \t")) != NULL && *p == '\0') 148 set(next, &ginfo); 150 unset(next, &ginfo); 192 cur = cur->next; 215 set(next, centry); 270 NODE *cur, *next; local 275 next = NULL; 276 for (cur = root; cur != NULL; cur = next) { [all...] |
/freebsd-11-stable/sys/contrib/zlib/ |
H A D | gzwrite.c | 65 state->x.next = strm->next_out; 110 while (strm->next_out > state->x.next) { 111 put = strm->next_out - state->x.next > (int)max ? max : 112 (unsigned)(strm->next_out - state->x.next); 113 writ = write(state->fd, state->x.next, put); 118 state->x.next += writ; 123 state->x.next = state->out; 386 char *next; local 416 next = (char *)(state->in + (strm->next_in - state->in) + strm->avail_in); 417 next[stat 476 char *next; local [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | jump.c | 112 rtx insn, next, prev; 113 for (insn = get_insns (); insn; insn = next) 115 next = NEXT_INSN (insn); 134 NULL, /* next */ 190 NULL, /* next */ 218 rtx note, next; 220 for (note = REG_NOTES (insn); note; note = next) 222 next = XEXP (note, 1); 280 rtx next; 284 for (insn = start; insn != past_end; insn = next) 110 rtx insn, next, prev; local 215 rtx note, next; local 276 rtx next; local 1048 rtx next; local 1349 rtx note, next; local 1403 rtx next = NEXT_INSN (insn), prev = PREV_INSN (insn); local 1533 rtx next = NEXT_INSN (insn); local [all...] |
H A D | tree-flow-inline.h | 59 /* Advance the hashtable iterator pointed to by HTI to the next element of the 97 /* Make ITER point to the next referenced_var in the referenced_var hashtable, 299 modified. This will force the next call to update_stmt_operands to scan 312 linknode->prev->next = linknode->next; 313 linknode->next->prev = linknode->prev; 315 linknode->next = NULL; 325 linknode->next = list->next; 326 list->next [all...] |