Searched refs:next (Results 126 - 150 of 2578) sorted by relevance

1234567891011>>

/freebsd-13-stable/contrib/apr/file_io/unix/
H A Dfilepath.c191 const char *next = addpath; local
192 while (*next && (*next != '/')) {
193 ++next;
195 seglen = next - addpath;
231 memcpy(path + pathlen, "../", *next ? 3 : 2);
232 pathlen += *next ? 3 : 2;
255 if (*next) {
262 /* Skip over trailing slash to the next segment
264 if (*next) {
[all...]
/freebsd-13-stable/sys/contrib/openzfs/include/os/linux/spl/sys/
H A Dlist.h39 * the name of the list_next/list_prev pointers to next/prev respectively.
43 * the next/prev pointers are set to LIST_POISON1 and LIST_POISON2
68 node->next = LIST_POISON1;
125 list_node_t *head = list->list_head.next;
150 return (list_object(list, list->list_head.next));
167 if (node->next != &list->list_head)
168 return (list_object(list, node->next));
187 EQUIV(node->next == LIST_POISON1, node->prev == LIST_POISON2);
188 return (node->next != LIST_POISON1);
202 new_node->next
[all...]
/freebsd-13-stable/contrib/ofed/libmlx4/
H A Ddbrec.c42 struct mlx4_db_page *prev, *next; member in struct:mlx4_db_page
79 page->next = context->db_list[type];
81 if (page->next)
82 page->next->prev = page;
95 for (page = context->db_list[type]; page; page = page->next)
127 for (page = context->db_list[type]; page; page = page->next)
139 page->prev->next = page->next;
141 context->db_list[type] = page->next;
142 if (page->next)
[all...]
/freebsd-13-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_taskdeps.h40 kmp_depnode_list *next; local
42 for (; list; list = next) {
43 next = list->next;
58 kmp_dephash_entry_t *next; local
59 for (kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next) {
60 next = entry->next_in_bucket;
111 kmp_depnode_list_t *next; local
112 for (kmp_depnode_list_t *p = node->dn.successors; p; p = next) {
128 next
[all...]
/freebsd-13-stable/sys/contrib/ck/include/
H A Dck_brlock.h50 struct ck_brlock_reader *next; member in struct:ck_brlock_reader
89 for (cursor = br->readers; cursor != NULL; cursor = cursor->next) {
126 for (cursor = br->readers; cursor != NULL; cursor = cursor->next) {
151 reader->next = ck_pr_load_ptr(&br->readers);
152 if (reader->next != NULL)
153 reader->next->previous = reader;
166 if (reader->next != NULL)
167 reader->next->previous = reader->previous;
170 reader->previous->next = reader->next;
[all...]
/freebsd-13-stable/usr.sbin/ppp/
H A Dtimer.c107 for (t = TimerList; t; t = t->next) {
124 tp->next = t;
126 pt->next = tp;
144 * A RUNNING timer must be removed from TimerList (->next list).
145 * A STOPPED timer isn't in any list, but may have a bogus [e]next field.
153 for (t = TimerList; t != tp && t != NULL; t = t->next)
158 pt->next = t->next;
160 TimerList = t->next;
164 if (t->next) {
194 struct pppTimer *tp, *exp, *next; local
[all...]
H A Dtimer.h43 struct pppTimer *next; /* Link to next timer */ member in struct:pppTimer
44 struct pppTimer *enext; /* Link to next expired timer */
/freebsd-13-stable/contrib/ofed/opensm/opensm/
H A Dst.c54 st_table_entry *next; member in struct:st_table_entry
242 register st_table_entry *ptr, *next; local
248 next = ptr->next;
250 ptr = next;
272 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\
273 ptr = ptr->next;\
275 ptr = ptr->next;\
313 entry->next = table->bins[bin_pos];\
353 register st_table_entry *ptr, *next, **new_bin local
[all...]
/freebsd-13-stable/sbin/rcorder/
H A Drcorder.c110 provnode *next, *last; member in struct:provnode
116 f_provnode *next; member in struct:f_provnode
121 f_reqnode *next; member in struct:f_reqnode
126 strnodelist *next; member in struct:strnodelist
133 filenode *next, *last; member in struct:filenode
248 ent->next = *listp;
279 temp->next = fn_head->next;
280 if (temp->next != NULL)
281 temp->next
[all...]
/freebsd-13-stable/sbin/dhclient/
H A Ddispatch.c173 for (l = protocols; l; l = l->next)
191 timeouts = timeouts->next;
193 t->next = free_timeouts;
213 for (i = 0, l = protocols; l; l = l->next) {
244 for (l = protocols; l; l = l->next) {
378 for (q = timeouts; q; q = q->next) {
381 t->next = q->next;
383 timeouts = q->next;
394 free_timeouts = q->next;
[all...]
/freebsd-13-stable/contrib/ncurses/ncurses/base/
H A Dnew_pair.c89 while (list[pair].next != base) {
91 pair = list[pair].next;
116 n, n == pair ? '@' : ':', list[n].next, list[n].prev);
167 int next = list[pair].next; local
170 if (list[prev].next == pair &&
171 list[next].prev == pair) {
172 list[prev].next = next;
173 list[next]
197 _nc_reset_color_pair(SCREEN *sp, int pair, colorpair_t * next) argument
[all...]
/freebsd-13-stable/contrib/wpa/wpa_supplicant/
H A Dblacklist.h13 struct wpa_blacklist *next; member in struct:wpa_blacklist
/freebsd-13-stable/contrib/xz/src/liblzma/common/
H A Dfilter_common.h39 lzma_next_coder *next, const lzma_allocator *allocator,
/freebsd-13-stable/contrib/xz/src/liblzma/lzma/
H A Dlzma2_decoder.h19 extern lzma_ret lzma_lzma2_decoder_init(lzma_next_coder *next,
H A Dlzma2_encoder.h34 lzma_next_coder *next, const lzma_allocator *allocator,
/freebsd-13-stable/lib/lib80211/
H A Dlib80211_regdomain.h45 LIST_ENTRY(freqband) next; member in struct:freqband
62 LIST_ENTRY(netband) next; member in struct:netband
81 LIST_ENTRY(regdomain) next; member in struct:regdomain
91 LIST_ENTRY(country) next; member in struct:country
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/stats/
H A Dstats.h31 StatModule *next; member in struct:__sanitizer::StatModule
/freebsd-13-stable/contrib/mandoc/
H A Dtbl.h53 struct tbl_cell *next; /* Layout cell to the right. */ member in struct:tbl_cell
75 struct tbl_row *next; /* Layout row below. */ member in struct:tbl_row
95 struct tbl_dat *next; /* Data cell to the right. */ member in struct:tbl_dat
116 struct tbl_span *next; /* Data row below. */ member in struct:tbl_span
/freebsd-13-stable/sys/compat/linuxkpi/common/include/linux/
H A Dnotifier.h52 struct notifier_block *next; member in struct:notifier_block
/freebsd-13-stable/stand/userboot/userboot/
H A Dbootinfo.c42 char *curpos, *next, *string; local
50 string = next = strdup(getenv("console"));
52 while (next != NULL) {
53 curpos = strsep(&next, " ,");
/freebsd-13-stable/crypto/heimdal/lib/sl/
H A Dslc.h47 struct assignment *next; member in struct:assignment
/freebsd-13-stable/usr.bin/mkimg/
H A Dformat.h33 struct mkimg_format *next; member in struct:mkimg_format
H A Debr.c73 struct part *part, *next; local
96 next = TAILQ_NEXT(part, link);
97 if (next != NULL) {
98 size = round_track(next->size);
101 next->block - nsecs);
104 next->block + size - 1);
105 le32enc(&dp->dp_start, next->block - nsecs);
/freebsd-13-stable/contrib/xz/src/liblzma/simple/
H A Dx86.c127 x86_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
130 const lzma_ret ret = lzma_simple_coder_init(next, allocator, filters,
134 lzma_simple_coder *coder = next->coder;
145 lzma_simple_x86_encoder_init(lzma_next_coder *next, argument
149 return x86_coder_init(next, allocator, filters, true);
154 lzma_simple_x86_decoder_init(lzma_next_coder *next, argument
158 return x86_coder_init(next, allocator, filters, false);
/freebsd-13-stable/contrib/googletest/googletest/samples/
H A Dsample3-inl.h45 // type E and a pointer to the next node.
54 // Gets the next node in the queue.
55 QueueNode* next() { return next_; } function in class:QueueNode
56 const QueueNode* next() const { return next_; } function in class:QueueNode
59 // Creates a node with a given element value. The next pointer is
85 QueueNode<E>* next = node->next(); local
88 node = next;
90 next = node->next();
[all...]

Completed in 279 milliseconds

1234567891011>>