/freebsd-11-stable/lib/libc/stdlib/ |
H A D | remque.c | 19 struct que_elem *prev, *next, *elem; local 24 next = elem->next; 27 prev->next = next; 28 if (next != NULL) 29 next->prev = prev;
|
H A D | insque.c | 23 struct que_elem *prev, *next, *elem; local 29 elem->prev = elem->next = NULL; 33 next = prev->next; 34 if (next != NULL) { 36 if (next->prev != prev) { 38 " next(%p)->prev(%p) != prev(%p)\n", 39 next, next->prev, prev); 42 next [all...] |
/freebsd-11-stable/contrib/ipfilter/lib/ |
H A D | alist_free.c | 14 alist_t *a, *next; local 16 for (a = hosts; a != NULL; a = next) { 17 next = a->al_next;
|
/freebsd-11-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
H A D | d_c9x_recursive_init.c | 3 void *next; member in union:node 14 .n = { .next = 0, },
|
/freebsd-11-stable/usr.bin/find/ |
H A D | operator.c | 64 (*planp) = (*planp)->next; 65 node->next = NULL; 78 PLAN *next; /* temp node holding subexpression results */ local 95 if ((next = yankexpr(planp)) == NULL) 104 if (next->execute == f_closeparen) { 112 tail = subplan = next; 114 tail->next = next; 115 tail = next; 117 tail->next 167 PLAN *next; /* next node being processed */ local 230 PLAN *next; /* next node being processed */ local [all...] |
/freebsd-11-stable/lib/libc/stdio/ |
H A D | glue.h | 41 struct glue *next; member in struct:glue
|
/freebsd-11-stable/sys/netpfil/ipfw/test/ |
H A D | mylist.h | 11 struct list_head *prev, *next; member in struct:list_head 14 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0) 15 #define list_empty(l) ( (l)->next == l ) 18 struct list_head *next) 20 next->prev = o; 21 o->next = next; 23 prev->next = o; 33 (ty *)((char *)((pL)->next) - offsetof(ty, member)) 36 __list_del(struct list_head *prev, struct list_head *next) argument 17 __list_add(struct list_head *o, struct list_head *prev, struct list_head *next) argument [all...] |
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_hp_fifo.h | 49 struct ck_hp_fifo_entry *next; member in struct:ck_hp_fifo_entry 64 stub->next = NULL; 83 struct ck_hp_fifo_entry *tail, *next; local 86 entry->next = NULL; 95 next = ck_pr_load_ptr(&tail->next); 96 if (next != NULL) { 97 ck_pr_cas_ptr(&fifo->tail, tail, next); 99 } else if (ck_pr_cas_ptr(&fifo->tail->next, next, entr 114 struct ck_hp_fifo_entry *tail, *next; local 142 struct ck_hp_fifo_entry *head, *tail, *next; local 176 struct ck_hp_fifo_entry *head, *tail, *next; local [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_base/util/ |
H A D | fs_skels.c | 64 && skel->children->next->is_atom) 68 && skel->children->next->is_atom) 82 && skel->children->next->is_atom) 107 if (skel->children->next->is_atom 108 && skel->children->next->next->is_atom 109 && (! skel->children->next->next->next->is_atom) 110 && (! skel->children->next [all...] |
/freebsd-11-stable/sys/dev/nxge/include/ |
H A D | xge-list.h | 39 * @next: Next list item. 45 struct xge_list_t* next; member in struct:xge_list_t 57 header->next = header; 73 return header->next == header; 80 * Returns the next item from the header. 81 * Returns NULL if the next item is header itself 87 xge_assert(header->next != NULL); 90 if(header->next == header) 93 return header->next; 106 xge_assert(item->next ! [all...] |
/freebsd-11-stable/sys/dev/hpt27xx/ |
H A D | list.h | 41 struct list_head *next, *prev; member in struct:list_head 44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0) 46 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) argument 48 next->prev = _new; 49 _new->next = next; 51 prev->next = _new; 56 __list_add(_new, head, head->next); 64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 66 next [all...] |
/freebsd-11-stable/sys/dev/hptnr/ |
H A D | list.h | 40 struct list_head *next, *prev; member in struct:list_head 43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0) 45 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) argument 47 next->prev = _new; 48 _new->next = next; 50 prev->next = _new; 55 __list_add(_new, head, head->next); 63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 65 next [all...] |
/freebsd-11-stable/sys/dev/hptrr/ |
H A D | list.h | 43 struct list_head *next, *prev; member in struct:list_head 46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0) 48 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_head * next) argument 50 next->prev = _new; 51 _new->next = next; 53 prev->next = _new; 58 __list_add(_new, head, head->next); 66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument 68 next [all...] |
/freebsd-11-stable/sys/dev/vxge/include/ |
H A D | vxge-list.h | 41 * @next: Next list item. 47 struct vxge_list_t *next; member in struct:vxge_list_t 61 header->next = header; 77 return (header->next == header); 84 * Returns the next item from the header. 85 * Returns NULL if the next item is header itself 91 vxge_assert(header->next != NULL); 94 if (header->next == header) 97 return (header->next); 110 vxge_assert(item->next ! [all...] |
/freebsd-11-stable/sys/dev/drm2/ |
H A D | drm_linux_list.h | 15 * The above copyright notice and this permission notice (including the next 39 struct list_head *next, *prev; member in struct:list_head 46 (head)->next = head; 57 return (head)->next == head; 62 (head)->next->prev = new; 63 (new)->next = (head)->next; 65 (head)->next = new; 71 (entry)->next = head; 72 (head)->prev->next 156 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 188 struct hlist_node *next, **pprev; member in struct:hlist_node 245 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 255 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/freebsd-11-stable/crypto/openssl/crypto/pqueue/ |
H A D | pqueue.c | 78 item->next = NULL; 111 pitem *curr, *next; local 118 for (curr = NULL, next = pq->items; 119 next != NULL; curr = next, next = next->next) { 123 int cmp = memcmp(next->priority, item->priority, 8); 124 if (cmp > 0) { /* next > ite 162 pitem *next; local [all...] |
/freebsd-11-stable/sys/kern/ |
H A D | subr_module.c | 52 int next; local 67 /* skip to next field */ 68 next = sizeof(uint32_t) * 2 + hdr[1]; 69 next = roundup(next, sizeof(u_long)); 70 curp += next; 84 int next; local 104 /* skip to next field */ 105 next = sizeof(uint32_t) * 2 + hdr[1]; 106 next 121 int next; local 164 int next; local 210 int next; local 282 int next; local [all...] |
/freebsd-11-stable/contrib/expat/xmlwf/ |
H A D | xmlmime.c | 119 const char *next, *p; local 122 next = buf; 123 p = getTok(&next); 124 if (matchkey(p, next, "text")) 126 else if (! matchkey(p, next, "application")) 128 p = getTok(&next); 131 p = getTok(&next); 134 if (! matchkey(p, next, "xml") && charset[0] == '\0') 138 p = getTok(&next); 141 p = getTok(&next); [all...] |
H A D | ct.c | 115 const char *next, *p; local 118 next = buf; 119 p = getTok(&next); 120 if (matchkey(p, next, "text")) 122 else if (! matchkey(p, next, "application")) 124 p = getTok(&next); 127 p = getTok(&next); 128 if (matchkey(p, next, "xml")) 130 p = getTok(&next); 133 p = getTok(&next); [all...] |
/freebsd-11-stable/sys/dev/drm/ |
H A D | drm_linux_list.h | 15 * The above copyright notice and this permission notice (including the next 39 struct list_head *next, *prev; member in struct:list_head 47 (head)->next = head; 53 return (head)->next == head; 58 (head)->next->prev = new; 59 (new)->next = (head)->next; 61 (head)->next = new; 67 (entry)->next = head; 68 (head)->prev->next [all...] |
/freebsd-11-stable/libexec/mknetid/ |
H A D | hash.h | 38 struct grouplist *next; member in struct:grouplist 45 struct member_entry *next; member in struct:member_entry
|
/freebsd-11-stable/contrib/xz/src/liblzma/delta/ |
H A D | delta_private.h | 20 lzma_next_coder next; member in struct:__anon4451 34 lzma_next_coder *next, const lzma_allocator *allocator,
|
/freebsd-11-stable/bin/sh/ |
H A D | alias.h | 39 struct alias *next; member in struct:alias
|
/freebsd-11-stable/contrib/xz/src/liblzma/common/ |
H A D | block_decoder.h | 19 extern lzma_ret lzma_block_decoder_init(lzma_next_coder *next,
|
H A D | index_encoder.h | 19 extern lzma_ret lzma_index_encoder_init(lzma_next_coder *next,
|