/freebsd-10.0-release/contrib/bmake/ |
H A D | hash.c | 182 nexth = h->next; 227 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) 275 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) { 292 e->next = *hp; 329 (p = *hp) != NULL; hp = &p->next) { 331 *hp = p->next; 383 * The return value is a pointer to the next HashEntry 389 * next entry. 403 * to start at the next one in the chain. 407 e = e->next; 441 Hash_Entry *e, *next = NULL, **hp, **xp; local [all...] |
/freebsd-10.0-release/contrib/groff/src/include/ |
H A D | search.h | 67 int next(const char **, int *, reference_id * = 0); 75 search_item *next; member in class:search_item 87 virtual int next(const linear_searcher &, const char **ptr, int *lenp,
|
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineLoopInfo.cpp | 67 MachineBasicBlock *NextMBB = llvm::next(MachineFunction::iterator(BotMBB)); 70 if (BotMBB == llvm::next(MachineFunction::iterator(BotMBB))) break; 71 NextMBB = llvm::next(MachineFunction::iterator(BotMBB));
|
/freebsd-10.0-release/crypto/heimdal/lib/roken/ |
H A D | parse_units.c | 74 char *next; local 83 val = strtol(p, &next, 0); 84 if (p == next) { 90 p = next; 278 const struct units *next; local 280 for (next = u + 1; next->name && next->mult == u->mult; ++next) 283 if (next [all...] |
/freebsd-10.0-release/crypto/openssl/crypto/engine/ |
H A D | eng_list.c | 73 * engine_list_head, and each non-null "next" pointer account for 111 iterator = iterator->next; 138 (engine_list_tail->next != NULL)) 144 engine_list_tail->next = e; 153 e->next = NULL; 170 iterator = iterator->next; 178 if(e->next) 179 e->next->prev = e->prev; 181 e->prev->next = e->next; [all...] |
/freebsd-10.0-release/lib/libc/rpc/ |
H A D | pmap_prot2.c | 105 struct pmaplist **next = NULL; /* pacify gcc */ local 120 * the case of freeing we must remember the next object 124 next = &((*rp)->pml_next); 128 rp = (freeing) ? next : &((*rp)->pml_next);
|
/freebsd-10.0-release/lib/libdwarf/ |
H A D | dwarf_cu.c | 36 Dwarf_CU next; local 50 else if ((next = STAILQ_NEXT(dbg->dbg_cu_current, cu_next)) == NULL) { 54 dbg->dbg_cu_current = next;
|
/freebsd-10.0-release/sbin/fsck_msdosfs/ |
H A D | dosfs.h | 83 cl_t next; /* pointer to next cluster */ member in struct:fatEntry 116 *next, /* next brother */ member in struct:dosDirEntry 134 struct dirTodoNode *next; member in struct:dirTodoNode
|
/freebsd-10.0-release/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.0-release/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.0-release/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.0-release/contrib/apr/memory/unix/ |
H A D | apr_pools.c | 148 *ref = node->next; 219 /* Round up the block size to the next boundary, but always 271 if ((*ref = node->next) == NULL && i >= max_index) { 290 node->next = NULL; 316 ref = &node->next; 319 *ref = node->next; 330 node->next = NULL; 353 node->next = NULL; 364 apr_memnode_t *next, *freelist = NULL; local 381 next 475 struct process_chain *next; member in struct:process_chain 484 debug_node_t *next; member in struct:debug_node_t 2196 struct cleanup_t *next; member in struct:cleanup_t [all...] |
/freebsd-10.0-release/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.0-release/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.0-release/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.0-release/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.0-release/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.0-release/contrib/apr/tables/ |
H A D | apr_hash.c | 48 apr_hash_entry_t *next; member in struct:apr_hash_entry_t 58 * We keep a pointer to the next hash entry here to allow the current 64 apr_hash_entry_t *this, *next; member in struct:apr_hash_index_t 129 hi->this = hi->next; 136 hi->next = hi->this->next; 151 hi->next = NULL; 180 hi->this->next = new_array[i]; 277 he; hep = &he->next, he = *hep) { 288 ht->free = he->next; [all...] |
/freebsd-10.0-release/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.0-release/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.0-release/contrib/libarchive/libarchive/ |
H A D | archive_entry_xattr.c | 78 xp = entry->xattr_head->next; 94 for (xp = entry->xattr_head; xp != NULL; xp = xp->next) 108 xp->next = entry->xattr_head; 122 for (xp = entry->xattr_head; xp != NULL; xp = xp->next) 145 entry->xattr_p = entry->xattr_p->next;
|
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | MetaRenamer.cpp | 33 unsigned long next; member in struct:__anon2696::PRNG 36 next = seed; 40 next = next * 1103515245 + 12345; 41 return (unsigned int)(next / 65536) % 32768;
|
/freebsd-10.0-release/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.0-release/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.0-release/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 ? "; " : "");
|