Searched refs:next (Results 1 - 25 of 2728) sorted by relevance

1234567891011>>

/freebsd-current/lib/libc/stdlib/
H A Dremque.c16 struct que_elem *prev, *next, *elem; local
21 next = elem->next;
24 prev->next = next;
25 if (next != NULL)
26 next->prev = prev;
H A Dinsque.c20 struct que_elem *prev, *next, *elem; local
26 elem->prev = elem->next = NULL;
30 next = prev->next;
31 if (next != NULL) {
33 if (next->prev != prev) {
35 " next(%p)->prev(%p) != prev(%p)\n",
36 next, next->prev, prev);
39 next
[all...]
/freebsd-current/sbin/ipf/libipf/
H A Dalist_free.c13 alist_t *a, *next; local
15 for (a = hosts; a != NULL; a = next) {
16 next = a->al_next;
/freebsd-current/contrib/bmake/unit-tests/
H A Dsuff-main.exp1 : Making next-main
/freebsd-current/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_c9x_recursive_init.c3 void *next; member in union:node
14 .n = { .next = 0, },
/freebsd-current/usr.bin/find/
H A Doperator.c58 (*planp) = (*planp)->next;
59 node->next = NULL;
72 PLAN *next; /* temp node holding subexpression results */ local
89 if ((next = yankexpr(planp)) == NULL)
98 if (next->execute == f_closeparen) {
106 tail = subplan = next;
108 tail->next = next;
109 tail = next;
111 tail->next
161 PLAN *next; /* next node being processed */ local
224 PLAN *next; /* next node being processed */ local
[all...]
/freebsd-current/lib/libc/stdio/
H A Dglue.h40 struct glue *next; member in struct:glue
/freebsd-current/crypto/openssl/ssl/
H A Dpqueue.c29 item->next = NULL;
55 pitem *curr, *next; local
62 for (curr = NULL, next = pq->items;
63 next != NULL; curr = next, next = next->next) {
67 int cmp = memcmp(next->priority, item->priority, 8);
68 if (cmp > 0) { /* next > ite
106 pitem *next; local
[all...]
/freebsd-current/sys/netpfil/ipfw/test/
H A Dmylist.h10 struct list_head *prev, *next; member in struct:list_head
13 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0)
14 #define list_empty(l) ( (l)->next == l )
17 struct list_head *next)
19 next->prev = o;
20 o->next = next;
22 prev->next = o;
32 (ty *)((char *)((pL)->next) - offsetof(ty, member))
35 __list_del(struct list_head *prev, struct list_head *next) argument
16 __list_add(struct list_head *o, struct list_head *prev, struct list_head *next) argument
[all...]
/freebsd-current/sys/contrib/ck/include/
H A Dck_hp_fifo.h49 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-current/sys/dev/hpt27xx/
H A Dlist.h41 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-current/sys/dev/hptnr/
H A Dlist.h40 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-current/sys/dev/hptrr/
H A Dlist.h43 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-current/contrib/xz/src/liblzma/simple/
H A Dsimple_coder.h19 extern lzma_ret lzma_simple_x86_encoder_init(lzma_next_coder *next,
23 extern lzma_ret lzma_simple_x86_decoder_init(lzma_next_coder *next,
28 extern lzma_ret lzma_simple_powerpc_encoder_init(lzma_next_coder *next,
32 extern lzma_ret lzma_simple_powerpc_decoder_init(lzma_next_coder *next,
37 extern lzma_ret lzma_simple_ia64_encoder_init(lzma_next_coder *next,
41 extern lzma_ret lzma_simple_ia64_decoder_init(lzma_next_coder *next,
46 extern lzma_ret lzma_simple_arm_encoder_init(lzma_next_coder *next,
50 extern lzma_ret lzma_simple_arm_decoder_init(lzma_next_coder *next,
55 extern lzma_ret lzma_simple_armthumb_encoder_init(lzma_next_coder *next,
59 extern lzma_ret lzma_simple_armthumb_decoder_init(lzma_next_coder *next,
[all...]
/freebsd-current/sys/dev/drm2/
H A Ddrm_linux_list.h15 * The above copyright notice and this permission notice (including the next
37 struct list_head *next, *prev; member in struct:list_head
44 (head)->next = head;
55 return (head)->next == head;
60 (head)->next->prev = new;
61 (new)->next = (head)->next;
63 (head)->next = new;
69 (entry)->next = head;
70 (head)->prev->next
154 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
186 struct hlist_node *next, **pprev; member in struct:hlist_node
243 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
253 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/freebsd-current/contrib/expat/xmlwf/
H A Dxmlmime.c121 const char *next, *p; local
124 next = buf;
125 p = getTok(&next);
126 if (matchkey(p, next, "text"))
128 else if (! matchkey(p, next, "application"))
130 p = getTok(&next);
133 p = getTok(&next);
136 if (! matchkey(p, next, "xml") && charset[0] == '\0')
140 p = getTok(&next);
143 p = getTok(&next);
[all...]
H A Dct.c116 const char *next, *p; local
119 next = buf;
120 p = getTok(&next);
121 if (matchkey(p, next, "text"))
123 else if (! matchkey(p, next, "application"))
125 p = getTok(&next);
128 p = getTok(&next);
129 if (matchkey(p, next, "xml"))
131 p = getTok(&next);
134 p = getTok(&next);
[all...]
/freebsd-current/libexec/mknetid/
H A Dhash.h38 struct grouplist *next; member in struct:grouplist
45 struct member_entry *next; member in struct:member_entry
/freebsd-current/contrib/xz/src/liblzma/delta/
H A Ddelta_private.h20 lzma_next_coder next; member in struct:__anon83
34 lzma_next_coder *next, const lzma_allocator *allocator,
/freebsd-current/contrib/xz/src/liblzma/common/
H A Dfilter_encoder.h20 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dfilter_decoder.h20 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dindex_encoder.h19 extern lzma_ret lzma_index_encoder_init(lzma_next_coder *next,
H A Dblock_decoder.h19 extern lzma_ret lzma_block_decoder_init(lzma_next_coder *next,
/freebsd-current/sys/contrib/ck/include/spinlock/
H A Dmcs.h40 struct ck_spinlock_mcs *next; member in struct:ck_spinlock_mcs
63 node->next = NULL;
92 node->next = NULL;
106 ck_pr_store_ptr(&previous->next, node);
119 struct ck_spinlock_mcs *next; local
123 next = ck_pr_load_ptr(&node->next);
124 if (next == NULL) {
142 next = ck_pr_load_ptr(&node->next);
[all...]
/freebsd-current/libexec/revnetgroup/
H A Dhash.h38 struct grouplist *next; member in struct:grouplist
46 struct member_entry *next; member in struct:member_entry
53 struct group_entry *next; member in struct:group_entry

Completed in 181 milliseconds

1234567891011>>