/freebsd-10-stable/sbin/rcorder/ |
H A D | hash.c | 160 nexth = h->next; 203 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) 249 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) { 266 e->next = *hp; 303 (p = *hp) != NULL; hp = &p->next) { 305 *hp = p->next; 353 * The return value is a pointer to the next HashEntry 359 * next entry. 375 * to start at the next one in the chain. 379 e = e->next; 413 register Hash_Entry *e, *next = NULL, **hp, **xp; local [all...] |
/freebsd-10-stable/usr.bin/make/ |
H A D | hash.c | 139 nexth = h->next; 179 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) 220 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) { 237 e->next = *hp; 273 (p = *hp) != NULL; hp = &p->next) { 275 *hp = p->next; 320 * The return value is a pointer to the next HashEntry 326 * next entry. 339 * to start at the next one in the chain. 343 e = e->next; 376 Hash_Entry *e, *next = NULL, **hp, **xp; local [all...] |
/freebsd-10-stable/usr.sbin/bluetooth/btpand/ |
H A D | channel.c | 71 LIST_INSERT_HEAD(&channel_list, chan, next); 133 STAILQ_REMOVE_HEAD(&chan->pktlist, next); 156 LIST_REMOVE(chan, next); 190 STAILQ_REMOVE_HEAD(&chan->pktlist, next); 245 LIST_FOREACH(chan, &channel_list, next) { 261 LIST_FOREACH(chan, &channel_list, next) { 285 STAILQ_INSERT_TAIL(&chan->pktlist, ph, next); 315 channel_t *chan, *next; local 321 next = LIST_FIRST(&channel_list); 322 while ((chan = next) ! [all...] |
/freebsd-10-stable/crypto/openssl/crypto/engine/ |
H A D | eng_list.c | 74 * structural reference. Hence, engine_list_head, and each non-null "next" 114 iterator = iterator->next; 134 if ((engine_list_tail == NULL) || (engine_list_tail->next != NULL)) { 138 engine_list_tail->next = e; 148 e->next = NULL; 163 iterator = iterator->next; 170 if (e->next) 171 e->next->prev = e->prev; 173 e->prev->next = e->next; [all...] |
/freebsd-10-stable/contrib/xz/src/liblzma/common/ |
H A D | block_decoder.c | 26 lzma_next_coder next; member in struct:__anon438 89 const lzma_ret ret = coder->next.code(coder->next.coder, 185 lzma_next_end(&coder->next, allocator); 192 lzma_block_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument 195 lzma_next_coder_init(&lzma_block_decoder_init, next, allocator); 204 // Allocate *next->coder if needed. 205 lzma_block_coder *coder = next->coder; 211 next->coder = coder; 212 next [all...] |
/freebsd-10-stable/sys/ia64/ia64/ |
H A D | unwind.c | 72 int32_t next; member in struct:mhdr 89 if (hdr->next == -1) 91 hdr = kdbheap + hdr->next; 98 hfree->next = hdr->next; 100 hdr->next = hfree - kdbheap; 101 if (hfree->next >= 0) { 102 hfree = kdbheap + hfree->next; 103 hfree->prev = hdr->next; 127 hfree->next [all...] |
/freebsd-10-stable/contrib/wpa/wpa_supplicant/ |
H A D | ctrl_iface_named_pipe.c | 63 struct wpa_ctrl_dst *next, *prev; member in struct:wpa_ctrl_dst 116 struct wpa_ctrl_dst *dst, *next; local 121 next = dst->next; 127 dst = next; 209 dst->next = priv->ctrl_dst; 210 if (dst->next) 211 dst->next->prev = dst; 243 dst->prev->next = dst->next; 479 struct wpa_ctrl_dst *dst, *next; local 542 struct wpa_global_dst *next, *prev; member in struct:wpa_global_dst 558 struct wpa_global_dst *dst, *next; local [all...] |
/freebsd-10-stable/contrib/groff/src/roff/troff/ |
H A D | env.cpp | 46 env_list *next; member in struct:env_list 47 env_list(environment *e, env_list *p) : env(e), next(p) {} 75 pending_output_line *next; member in class:pending_output_line 95 next(p) 109 if (next && next->last_line && !no_fill) { 112 next->last_line = 0; // Try to avoid infinite loops. 129 if (widow_control && !pending_lines->no_fill && !pending_lines->next) 134 pending_lines = pending_lines->next; 149 for (p = &pending_lines; *p; p = &(*p)->next) 2538 tab *next; member in struct:tab 2888 make_tab_node(hunits d, node *next) argument 3516 operation *next; member in struct:operation [all...] |
/freebsd-10-stable/sys/dev/twa/ |
H A D | tw_cl_share.h | 214 struct tw_cl_link *next; member in struct:tw_cl_link 270 (head)->prev = (head)->next = head; \ 276 (item)->next = (head)->next; \ 278 (head)->next->prev = item; \ 279 (head)->next = item; \ 285 (item)->next = head; \ 287 (head)->prev->next = item; \ 294 (item)->prev->next = (item)->next; \ [all...] |
/freebsd-10-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-10-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-10-stable/contrib/ipfilter/ipsend/ |
H A D | 44arp.c | 70 char *lim, *buf, *next; local 110 for (next = buf; next < lim; next += rtm->rtm_msglen) 112 rtm = (struct rt_msghdr *)next;
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Utils/ |
H A D | MetaRenamer.cpp | 33 unsigned long next; member in struct:__anon2845::PRNG 36 next = seed; 40 next = next * 1103515245 + 12345; 41 return (unsigned int)(next / 65536) % 32768;
|
/freebsd-10-stable/contrib/mdocml/ |
H A D | chars.c | 34 struct ln *next; member in struct:ln 90 for ( ; pp->next; pp = pp->next) 92 pp->next = &lines[i]; 161 for (pp = tab->htab[hash]; pp; pp = pp->next)
|
/freebsd-10-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-10-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; 232 for (p = plan; p && (p->execute)(p, entry); p = p->next);
|
/freebsd-10-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-10-stable/contrib/tcsh/ |
H A D | ed.xmap.c | 110 struct Xmapnode *next; /* ptr to next char of this Xkey */ member in struct:Xmapnode 181 if (ptr->next) { 182 /* Xkey not complete so get next char */ 188 return (TraverseMap(ptr->next, ch, val)); 200 /* try next sibling */ 204 /* no next sibling -- mismatch */ 261 if (ptr->next != NULL) { 262 PutFreeNode(ptr->next); /* lose longer Xkeys with this prefix */ 263 ptr->next [all...] |
/freebsd-10-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-10-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-10-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-10-stable/sbin/kldconfig/ |
H A D | kldconfig.c | 59 TAILQ_ENTRY(pathentry) next; 180 TAILQ_FOREACH(pe, pathq, next) 196 TAILQ_INSERT_TAIL(pathq, pe, next); 199 pskip = TAILQ_NEXT(pskip, next); 201 TAILQ_INSERT_BEFORE(pskip, pe, next); 203 TAILQ_INSERT_TAIL(pathq, pe, next); 236 TAILQ_FOREACH(pe, pathq, next) 246 TAILQ_REMOVE(pathq, pe, next); 278 TAILQ_INSERT_TAIL(pathq, pe, next); 292 TAILQ_FOREACH(pe, pathq, next) { [all...] |
/freebsd-10-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-10-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-10-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;
|