Searched refs:next (Results 251 - 275 of 3058) sorted by relevance

<<11121314151617181920>>

/freebsd-11-stable/sys/dev/isci/scil/
H A Dsci_base_observer.h94 * This filed points to the next observer if there is one
96 struct SCI_BASE_OBSERVER *next; member in struct:SCI_BASE_OBSERVER
/freebsd-11-stable/usr.bin/tr/
H A Dextern.h50 wint_t next(STR *);
/freebsd-11-stable/usr.sbin/pmcstudy/
H A Deval_expr.h47 struct expression *next; /* Next in expression. */ member in struct:expression
/freebsd-11-stable/usr.sbin/rpc.statd/
H A Dstatd.h66 struct MonList_s *next; /* Next in list or NULL */ member in struct:MonList_s
/freebsd-11-stable/contrib/byacc/test/
H A Derr_inherit4.y12 struct namelist { symbol *s; struct namelist *next; };
36 p = p->next;
68 $$->next = $1;
72 $$->next = NULL;
H A Dinherit1.y11 struct namelist { symbol *s; struct namelist *next; };
59 $$->next = $1;
63 $$->next = NULL;
/freebsd-11-stable/sys/x86/iommu/
H A Dintel_gas.c163 struct dmar_map_entry *next; local
165 next = RB_NEXT(dmar_gas_entries_tree, &domain->rb_root, entry);
166 entry->free_after = (next != NULL ? next->start : domain->end) -
175 struct dmar_map_entry *entry, *next, *l, *r; local
182 next = RB_NEXT(dmar_gas_entries_tree, &domain->rb_root, entry);
183 if (next == NULL) {
186 MPASS(entry->free_after = next->start - entry->end);
187 MPASS(entry->end <= next->start);
328 * next boundar
363 struct dmar_map_entry *next; local
401 ("entry %p next %p inserted next %p", a->entry, next, local
436 struct dmar_map_entry *next, *prev, find_entry; local
514 struct dmar_map_entry *next, *prev; local
610 struct dmar_map_entry *next, *prev; local
[all...]
/freebsd-11-stable/contrib/ntp/include/
H A Dntp_keyacc.h9 KeyAccT * next; member in struct:keyaccess
/freebsd-11-stable/usr.sbin/bluetooth/hcsecd/
H A Dhcsecd.h48 LIST_ENTRY(link_key) next; /* link to the next */ member in struct:link_key
/freebsd-11-stable/contrib/openpam/lib/libpam/
H A Dpam_get_data.c63 for (dp = pamh->module_data; dp != NULL; dp = dp->next) {
/freebsd-11-stable/usr.sbin/makefs/
H A Dwalk.c99 while (cur->next != NULL)
100 cur = cur->next;
138 cur = join->next;
146 cur = cur->next;
168 cur->next = first;
175 prev->next = cur;
212 for (cur = first->next; cur != NULL; cur = cur->next)
258 fsnode *cur, *next; local
273 for (cur = node->first; cur->next; cu
366 fsnode *next; local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dskel.c165 for (elt = skel->children; elt; elt = elt->next)
184 for (elt = skel->children; elt; elt = elt->next)
189 if (elt->next == NULL)
192 elt = elt->next;
299 /* Parse the next element in the list. */
305 element->next = NULL;
307 tail = &element->next;
369 const char *next;
374 size = getsize(data, end - data, &next, end - data);
375 data = next;
365 const char *next; local
[all...]
/freebsd-11-stable/contrib/binutils/bfd/
H A Dlibieee.h29 struct ct *next; member in struct:ct
35 struct ieee_symbol *next; member in struct:ieee_symbol
43 struct ieee_reloc *next; member in struct:ieee_reloc
/freebsd-11-stable/contrib/binutils/binutils/
H A Dwindmc.h43 struct mc_keyword *next; member in struct:mc_keyword
55 struct mc_node_lang *next; member in struct:mc_node_lang
63 struct mc_node *next; member in struct:mc_node
/freebsd-11-stable/contrib/bmake/
H A Dhash.c182 nexth = h->next;
230 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next)
278 for (e = t->bucketPtr[h & t->mask]; e != NULL; e = e->next) {
295 e->next = *hp;
332 (p = *hp) != NULL; hp = &p->next) {
334 *hp = p->next;
386 * The return value is a pointer to the next HashEntry
392 * next entry.
406 * to start at the next one in the chain.
410 e = e->next;
444 Hash_Entry *e, *next = NULL, **hp, **xp; local
[all...]
/freebsd-11-stable/contrib/groff/src/include/
H A Dsearch.h67 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-11-stable/sbin/rcorder/
H A Dhash.c160 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-11-stable/crypto/heimdal/lib/roken/
H A Dparse_units.c74 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-11-stable/contrib/xz/src/liblzma/common/
H A Dblock_decoder.c26 lzma_next_coder next; member in struct:__anon4429
89 const lzma_ret ret = coder->next.code(coder->next.coder,
185 lzma_next_end(&coder->next, allocator);
192 lzma_block_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
195 lzma_next_coder_init(&lzma_block_decoder_init, next, allocator);
204 // Allocate *next->coder if needed.
205 lzma_block_coder *coder = next->coder;
211 next->coder = coder;
212 next
[all...]
/freebsd-11-stable/crypto/openssl/crypto/engine/
H A Deng_list.c75 * structural reference. Hence, engine_list_head, and each non-null "next"
115 iterator = iterator->next;
135 if ((engine_list_tail == NULL) || (engine_list_tail->next != NULL)) {
139 engine_list_tail->next = e;
149 e->next = NULL;
164 iterator = iterator->next;
171 if (e->next)
172 e->next->prev = e->prev;
174 e->prev->next = e->next;
[all...]
/freebsd-11-stable/contrib/mdocml/
H A Dtbl_data.c47 /* Advance to the next layout cell, skipping spanners. */
49 cp = dp->last == NULL ? dp->layout->first : dp->last->layout->next;
51 cp = cp->next;
64 dp->layout->last->next = cp;
80 for (cp = cp->next; cp != NULL; cp = cp->next)
89 dp->last->next = dat;
186 dp->prev->next = dp;
200 sp->pos == TBL_SPAN_DATA && sp->layout->next != NULL ?
201 sp->layout->next
[all...]
/freebsd-11-stable/usr.sbin/bluetooth/btpand/
H A Dchannel.c73 LIST_INSERT_HEAD(&channel_list, chan, next);
135 STAILQ_REMOVE_HEAD(&chan->pktlist, next);
158 LIST_REMOVE(chan, next);
192 STAILQ_REMOVE_HEAD(&chan->pktlist, next);
247 LIST_FOREACH(chan, &channel_list, next) {
263 LIST_FOREACH(chan, &channel_list, next) {
287 STAILQ_INSERT_TAIL(&chan->pktlist, ph, next);
317 channel_t *chan, *next; local
323 next = LIST_FIRST(&channel_list);
324 while ((chan = next) !
[all...]
/freebsd-11-stable/contrib/wpa/wpa_supplicant/
H A Dctrl_iface_named_pipe.c63 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-11-stable/contrib/groff/src/roff/troff/
H A Denv.cpp46 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-11-stable/sys/dev/twa/
H A Dtw_cl_share.h214 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...]

Completed in 248 milliseconds

<<11121314151617181920>>