Searched refs:next (Results 76 - 100 of 3058) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/dev/ocs_fc/
H A Docs_list.h79 ocs_list_t *next; /*<< pointer to head of list (or next if link) */ member in struct:ocs_list_s
108 list->next = list;
128 return list->next == list;
151 * @param b Pointer to next link
161 ocs_list_assert(a->next);
165 ocs_list_assert(b->next);
169 ocs_list_assert(!c->next);
175 c->next = a->next;
373 ocs_list_t *next; local
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dgenmddeps.c29 struct filedep *next; member in struct:filedep
41 last = &n->next;
59 for (d = deps; d ; d = d->next)
65 for (d = deps; d ; d = d->next)
H A Dgenemit.c47 struct clobber_pat *next; member in struct:clobber_pat
56 struct clobber_ent *next; member in struct:clobber_ent
355 for (p = clobber_list; p; p = p->next)
388 p->next = clobber_list;
393 link->next = p->insns;
539 rtx next = XVECEXP (expand, 1, i);
540 if ((GET_CODE (next) == SET && GET_CODE (SET_DEST (next)) == PC)
541 || (GET_CODE (next) == PARALLEL
542 && ((GET_CODE (XVECEXP (next,
535 rtx next = XVECEXP (expand, 1, i); local
649 rtx next = XVECEXP (split, 2, i); local
[all...]
H A Dbitmap.c55 elt->next = NULL;
74 bitmap_element *next = elt->next;
78 prev->next = next;
80 if (next)
81 next->prev = prev;
84 head->first = next;
87 make current the next entry in preference to the previous. */
90 head->current = next !
73 bitmap_element *next = elt->next; local
698 bitmap_element *next; local
811 bitmap_element *next; local
986 bitmap_element *next; local
1325 bitmap_element *next = a_elt->next; local
[all...]
/freebsd-11-stable/bin/date/
H A Dvary.h31 struct vary *next; member in struct:vary
/freebsd-11-stable/contrib/gdb/gdb/
H A Dtracepoint.h27 struct action_line *next; member in struct:action_line
35 struct tracepoint *next; member in struct:tracepoint
128 #define ALL_TRACEPOINTS(t) for (t = tracepoint_chain; t; t = t->next)
132 t ? (tmp = t->next, 1) : 0;\
H A Df-lang.c57 struct saved_fcn *next; member in struct:saved_fcn
65 struct saved_bf_symnum *next; member in struct:saved_bf_symnum
700 tmp->next = NULL;
712 tail_common_list->next = tmp;
735 tmp->next = NULL;
749 current_common->end_of_entries->next = tmp;
772 tmp = tmp->next;
795 tmp = tmp->next;
821 entry = entry->next;
857 tmp = tmp->next;
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dkey-gen.h58 #define NEXT_KEY_KEY "next-key"
61 /* Generate the next key after a given alphanumeric key.
79 void svn_fs_base__next_key(const char *this, apr_size_t *len, char *next);
/freebsd-11-stable/contrib/xz/src/liblzma/common/
H A Dblock_encoder.h44 extern lzma_ret lzma_block_encoder_init(lzma_next_coder *next,
/freebsd-11-stable/contrib/xz/src/liblzma/delta/
H A Ddelta_decoder.h18 extern lzma_ret lzma_delta_decoder_init(lzma_next_coder *next,
H A Ddelta_encoder.h18 extern lzma_ret lzma_delta_encoder_init(lzma_next_coder *next,
H A Ddelta_decoder.c37 assert(coder->next.code != NULL);
41 const lzma_ret ret = coder->next.code(coder->next.coder, allocator,
52 lzma_delta_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
55 next->code = &delta_decode;
56 return lzma_delta_coder_init(next, allocator, filters);
/freebsd-11-stable/usr.bin/random/
H A Drandomize_fd.h46 struct rand_node *next; member in struct:rand_node
/freebsd-11-stable/usr.sbin/pkg/
H A Ddns_utils.h42 struct dns_srvinfo *next; member in struct:dns_srvinfo
/freebsd-11-stable/contrib/ofed/libmlx5/
H A Ddbrec.c42 struct mlx5_db_page *prev, *next; member in struct:mlx5_db_page
75 page->next = context->db_list;
77 if (page->next)
78 page->next->prev = page;
91 for (page = context->db_list; page; page = page->next)
124 for (page = context->db_list; page; page = page->next)
136 page->prev->next = page->next;
138 context->db_list = page->next;
139 if (page->next)
[all...]
/freebsd-11-stable/contrib/binutils/ld/
H A Dldctor.h36 struct set_info *next; /* Next set. */ member in struct:set_info
44 struct set_element *next; /* Next element. */ member in struct:set_element
/freebsd-11-stable/contrib/ncurses/ncurses/tinfo/
H A Dentries.c53 * | ----+-->| ----+-->| NULL | next
94 for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) {
97 last->next = ep->next;
99 if (ep->next != 0) {
100 ep->next->last = last;
103 _nc_head = ep->next;
/freebsd-11-stable/contrib/xz/src/liblzma/simple/
H A Dsparc.c60 sparc_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
63 return lzma_simple_coder_init(next, allocator, filters,
69 lzma_simple_sparc_encoder_init(lzma_next_coder *next, argument
73 return sparc_coder_init(next, allocator, filters, true);
78 lzma_simple_sparc_decoder_init(lzma_next_coder *next, argument
82 return sparc_coder_init(next, allocator, filters, false);
H A Dpowerpc.c53 powerpc_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
56 return lzma_simple_coder_init(next, allocator, filters,
62 lzma_simple_powerpc_encoder_init(lzma_next_coder *next, argument
66 return powerpc_coder_init(next, allocator, filters, true);
71 lzma_simple_powerpc_decoder_init(lzma_next_coder *next, argument
75 return powerpc_coder_init(next, allocator, filters, false);
H A Darmthumb.c53 armthumb_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
56 return lzma_simple_coder_init(next, allocator, filters,
62 lzma_simple_armthumb_encoder_init(lzma_next_coder *next, argument
66 return armthumb_coder_init(next, allocator, filters, true);
71 lzma_simple_armthumb_decoder_init(lzma_next_coder *next, argument
75 return armthumb_coder_init(next, allocator, filters, false);
H A Darm.c48 arm_coder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
51 return lzma_simple_coder_init(next, allocator, filters,
57 lzma_simple_arm_encoder_init(lzma_next_coder *next, argument
61 return arm_coder_init(next, allocator, filters, true);
66 lzma_simple_arm_decoder_init(lzma_next_coder *next, argument
70 return arm_coder_init(next, allocator, filters, false);
/freebsd-11-stable/contrib/byacc/
H A Dmkpar.c94 temp->next = actions;
135 action *temp, *prev, *next; local
138 for (next = actions; next && next->symbol < symbol; next = next->next)
139 prev = next;
141 while (next
[all...]
/freebsd-11-stable/sys/dev/isci/scil/
H A Dsci_fast_list.h62 * circular in nature. This means that the next and prev pointers for
65 * a queue will have its next and prev pointer set to the address of
101 (element)->next = (element)->prev = NULL; \
137 * This method will get the next dListField in the SCI_FAST_LIST. This method
140 #define sci_fast_list_get_next(element) ((element)->next)
202 struct SCI_FAST_LIST_ELEMENT *next; member in struct:SCI_FAST_LIST_ELEMENT
230 element->next = anchor->list_head;
252 element->next = NULL;
256 anchor->list_tail->next = element;
283 anchor->list_head = anchor->list_head->next;
[all...]
/freebsd-11-stable/contrib/groff/src/libs/libxutil/
H A DDviChar.c17 struct map_list *next; member in struct:map_list
36 for (m = world; m; m=m->next)
49 for (m = world; m; m = m->next)
54 m->next = world;
66 DviCharNameHash *h, *next; local
71 for (h = buckets[i]; h; h=next) {
72 next = h->next;
106 h->next = buckets[i];
121 for (h = map->buckets[i]; h; h=h->next)
[all...]
/freebsd-11-stable/sys/contrib/ck/include/spinlock/
H A Danderson.h53 unsigned int next; member in struct:ck_spinlock_anderson
74 lock->next = 0;
78 * appropriate wrap-around value in the case of next slot counter
96 position = ck_pr_load_uint(&lock->next) & lock->mask;
106 unsigned int position, next; local
115 position = ck_pr_load_uint(&lock->next);
119 next = lock->wrap;
121 next = position + 1;
122 } while (ck_pr_cas_uint_value(&lock->next, position,
123 next,
[all...]

Completed in 240 milliseconds

1234567891011>>