Searched refs:next (Results 26 - 50 of 2578) sorted by relevance

1234567891011>>

/freebsd-13-stable/libexec/revnetgroup/
H A Dhash.h40 struct grouplist *next; member in struct:grouplist
48 struct member_entry *next; member in struct:member_entry
55 struct group_entry *next; member in struct:group_entry
/freebsd-13-stable/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-13-stable/usr.bin/m4/
H A Dtokenizer.l87 char *next;
92 base = strtol(yytext+2, &next, 0);
93 if (base > 36 || next == NULL) {
96 next++;
97 while (*next != 0) {
98 if (*next >= '0' && *next <= '9')
99 d = *next - '0';
100 else if (*next >= 'a' && *next <
[all...]
/freebsd-13-stable/contrib/libucl/uthash/
H A Dutlist.h38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
82 * to dereference its prev/next pointers, and save/restore the real head.*/
85 #define _NEXT(elt,list,next) ((char*)((list)->next))
86 #define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); }
93 #define _NEXT(elt,list,next) ((elt)->next)
[all...]
/freebsd-13-stable/contrib/unbound/services/
H A Doutbound_list.c59 np = p->next;
72 e->next = list->first;
83 if(e->next)
84 e->next->prev = e->prev;
86 e->prev->next = e->next;
87 else list->first = e->next;
/freebsd-13-stable/contrib/elftoolchain/libelf/
H A Delf_next.c38 off_t next; local
53 next = e->e_rawfile - parent->e_rawfile + (off_t) e->e_rawsize;
54 next = (next + 1) & ~1; /* round up to an even boundary */
58 * next call to 'elf_begin()'.
60 parent->e_u.e_ar.e_next = (next >= (off_t) parent->e_rawsize) ?
61 (off_t) 0 : next;
68 * 'e_next' field so that the next call to elf_begin(3) will terminate
72 if (next > (off_t) parent->e_rawsize) {
/freebsd-13-stable/sys/compat/linuxkpi/common/include/linux/
H A Drculist.h39 #define list_next_rcu(head) (*((struct list_head **)(&(head)->next)))
43 for (pos = list_entry_rcu((head)->next, typeof(*(pos)), member); \
45 pos = list_entry_rcu((pos)->member.next, typeof(*(pos)), member))
49 struct list_head *next)
51 new->next = next;
54 next->prev = new;
60 linux_list_add_rcu(new, head, head->next);
70 __list_del_rcu(struct list_head *prev, struct list_head *next) argument
72 next
48 linux_list_add_rcu(struct list_head *new, struct list_head *prev, struct list_head *next) argument
73 rcu_assign_pointer(list_next_rcu(prev), next); local
112 struct hlist_node *next = n->next; local
[all...]
H A Dlist.h87 struct list_head *next; member in struct:list_head
96 list->next = list->prev = list;
103 return (head->next == head);
109 struct list_head *next = head->next; local
111 return ((next == head) && (next == head->prev));
115 __list_del(struct list_head *prev, struct list_head *next) argument
117 next->prev = prev;
118 WRITE_ONCE(prev->next, nex
152 linux_list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
282 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
336 struct hlist_node *next, **pprev; member in struct:hlist_node
392 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/freebsd-13-stable/contrib/wpa/src/utils/
H A Dlist.h16 struct dl_list *next; member in struct:dl_list
24 list->next = list;
30 item->next = list->next;
32 list->next->prev = item;
33 list->next = item;
43 item->next->prev = item->prev;
44 item->prev->next = item->next;
45 item->next
[all...]
/freebsd-13-stable/contrib/ntp/libntp/
H A Dauthreadkeys.c71 * log the first 5 errors, silently ignore the next 10 errors, and give
89 KeyDataT *next; /* queue/stack link */ member in struct:keydata
121 node->keyacclist = kap->next;
150 KeyDataT *next = NULL; local
260 next = NULL;
263 next = emalloc(sizeof(KeyDataT) + len);
264 next->keyacclist = NULL;
265 next->keyid = keyno;
266 next->keytype = keytype;
267 next
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dkey-gen.c40 svn_fs_base__next_key(const char *this, apr_size_t *len, char *next)
69 next[i] = '0';
75 next[i] = 'a';
77 next[i] = c + 1;
81 next[i] = c;
99 next[*len] = '\0';
104 memmove(next+1, next, olen);
105 next[0] = '1';
39 svn_fs_base__next_key(const char *this, apr_size_t *len, char *next) argument
/freebsd-13-stable/contrib/xz/src/liblzma/common/
H A Dalone_decoder.h20 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dfilter_encoder.h24 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dstream_decoder.h19 lzma_next_coder *next, const lzma_allocator *allocator,
H A Dauto_decoder.c19 lzma_next_coder next; member in struct:__anon6606
55 &coder->next, allocator,
58 return_if_error(lzma_alone_decoder_init(&coder->next,
75 const lzma_ret ret = coder->next.code(
76 coder->next.coder, allocator,
108 lzma_next_end(&coder->next, allocator);
120 return coder->next.get_check == NULL ? LZMA_CHECK_NONE
121 : coder->next.get_check(coder->next.coder);
133 if (coder->next
156 auto_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, uint64_t memlimit, uint32_t flags) argument
[all...]
/freebsd-13-stable/crypto/heimdal/lib/com_err/
H A Dcompile_et.h61 struct error_code *next, **tail; member in struct:error_code
70 (L)->tail = &(V)->next; \
71 (L)->next = NULL; \
74 (L)->tail = &(V)->next; \
/freebsd-13-stable/contrib/com_err/
H A Dcompile_et.h58 struct error_code *next, **tail; member in struct:error_code
67 (L)->tail = &(V)->next; \
68 (L)->next = NULL; \
71 (L)->tail = &(V)->next; \
/freebsd-13-stable/contrib/mandoc/
H A Dmandoc_xr.h19 struct mandoc_xr *next; member in struct:mandoc_xr
/freebsd-13-stable/lib/libpmc/pmu-events/
H A Dlist.h48 struct list_head *next; member in struct:list_head
77 list->next = list->prev = list;
84 return (head->next == head);
90 struct list_head *next = head->next; local
92 return ((next == head) && (next == head->prev));
96 __list_del(struct list_head *prev, struct list_head *next) argument
98 next->prev = prev;
99 WRITE_ONCE(prev->next, nex
133 linux_list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
245 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
300 struct hlist_node *next, **pprev; member in struct:hlist_node
357 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument
367 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_diff/
H A Dlcs.c104 previous_lcs = lcs->next;
105 lcs->next = *freelist;
113 start_position[1] = fp_k[-1].position[1]->next;
119 start_position[0] = fp_k[1].position[0]->next;
142 position[0] = position[0]->next;
143 position[1] = position[1]->next;
151 *freelist = lcs->next;
161 lcs->next = previous_lcs;
171 start_position[0] = position[0] = position[0]->next;
174 start_position[1] = position[1] = position[1]->next;
190 svn_diff__lcs_t *next; local
[all...]
/freebsd-13-stable/sys/contrib/ck/include/
H A Dck_fifo.h41 struct ck_fifo_spsc_entry *next; member in struct:ck_fifo_spsc_entry
109 stub->next = NULL;
130 entry->next = NULL;
132 /* If stub->next is visible, guarantee that entry is consistent. */
134 ck_pr_store_ptr(&fifo->tail->next, entry);
149 entry = ck_pr_load_ptr(&fifo->head->next);
176 fifo->garbage = garbage->next;
184 return ck_pr_load_ptr(&head->next) == NULL;
187 #define CK_FIFO_SPSC_ISEMPTY(f) ((f)->head->next == NULL)
188 #define CK_FIFO_SPSC_FIRST(f) ((f)->head->next)
213 struct ck_fifo_mpmc_pointer next; member in struct:ck_fifo_mpmc_entry
249 struct ck_fifo_mpmc_pointer tail, next, update; local
306 struct ck_fifo_mpmc_pointer tail, next, update; local
359 struct ck_fifo_mpmc_pointer head, tail, next, update; local
414 struct ck_fifo_mpmc_pointer head, tail, next, update; local
[all...]
/freebsd-13-stable/contrib/ofed/librdmacm/
H A Dindexer.h49 int next; member in union:idx_entry
105 struct _dlist_entry *next; member in struct:_dlist_entry
111 head->next = head;
117 return head->next == head;
122 item->next = head->next;
124 head->next->prev = item;
125 head->next = item;
138 item->prev->next = item->next;
[all...]
/freebsd-13-stable/contrib/apr-util/misc/
H A Dapr_rmm.c38 * the caller-usable region represented by the block. The next and
41 * address of the next and previous blocks in the list. ("address 0",
55 apr_rmm_off_t next; member in struct:rmm_block_t
76 static apr_rmm_off_t find_block_by_offset(apr_rmm_t *rmm, apr_rmm_off_t next, argument
81 while (next) {
82 struct rmm_block_t *blk = (rmm_block_t*)((char*)rmm->base + next);
84 if (find == next)
85 return next;
88 if (find < next)
91 prev = next;
99 apr_rmm_off_t next = rmm->base->firstfree; local
161 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
197 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
420 struct rmm_block_t *next = (rmm_block_t*)((char*)rmm->base + blk->next); local
[all...]
/freebsd-13-stable/sys/contrib/openzfs/lib/libspl/
H A Dlist.c38 #define list_empty(a) ((a)->list_head.next == &(a)->list_head)
43 lnew->next = (node)->next; \
44 (node)->next->prev = lnew; \
45 (node)->next = lnew; \
50 lnew->next = (node); \
52 (node)->prev->next = lnew; \
57 (node)->prev->next = (node)->next; \
58 (node)->next
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Support/
H A DVersionTuple.cpp46 char next = input[0]; local
48 if (next < '0' || next > '9')
50 value = (unsigned)(next - '0');
53 next = input[0];
54 if (next < '0' || next > '9')
57 value = value * 10 + (unsigned)(next - '0');

Completed in 322 milliseconds

1234567891011>>