Searched refs:next (Results 176 - 200 of 3058) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/stats/
H A Dstats.h31 StatModule *next; member in struct:__sanitizer::StatModule
/freebsd-11-stable/usr.bin/mkimg/
H A Debr.c81 struct part *part, *next; local
104 next = TAILQ_NEXT(part, link);
105 if (next != NULL) {
106 size = round_track(next->size);
109 next->block - nsecs);
112 next->block + size - 1);
113 le32enc(&dp->dp_start, next->block - nsecs);
/freebsd-11-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-11-stable/contrib/gcc/
H A Dipa.c45 for (node = cgraph_nodes; node; node = node->next)
47 for (node = cgraph_nodes; node; node = node->next)
86 for (node = cgraph_nodes; node; node = node->next)
100 struct cgraph_node *node, *next; local
110 for (node = cgraph_nodes; node; node = node->next)
113 for (node = cgraph_nodes; node; node = node->next)
154 for (node = cgraph_nodes; node; node = next)
156 next = node->next;
205 for (node = cgraph_nodes; node; node = node->next)
[all...]
H A Dgengtype-yacc.y131 for (p = $3; p->next != NULL; p = p->next)
138 p->next = $1;
147 for (p = $6; p->next != NULL; p = p->next)
153 p->next = $1;
164 p->next = $1;
168 p->opt->next = NULL;
175 p->next = $1;
179 p->opt->next
[all...]
H A Det-forest.c47 struct et_occ *next; /* Right son in the splay-tree. */ member in struct:et_occ
99 /* Sets next field of OCC to P. */
108 occ->next = t;
121 || (occ->next
122 && mson->min > occ->next->min))
123 mson = occ->next;
148 gcc_assert (occ->next != occ);
149 gcc_assert (!occ->next || occ->next != occ->prev);
151 if (occ->next)
[all...]
H A Dlists.c116 alloc_INSN_LIST (rtx val, rtx next) argument
125 XEXP (r, 1) = next;
131 r = gen_rtx_INSN_LIST (VOIDmode, val, next);
140 alloc_EXPR_LIST (int kind, rtx val, rtx next) argument
149 XEXP (r, 1) = next;
153 r = gen_rtx_EXPR_LIST (kind, val, next);
162 alloc_DEPS_LIST (rtx val, rtx next, int ds) argument
171 XEXP (r, 1) = next;
178 r = gen_rtx_DEPS_LIST (VOIDmode, val, next, ds);
/freebsd-11-stable/contrib/xz/src/liblzma/common/
H A Dcommon.h98 lzma_next_coder *next, const lzma_allocator *allocator,
134 /// Hold data and function pointers of the next filter in the chain.
198 lzma_next_coder next; member in struct:lzma_internal_s
202 /// is used on every call to lzma_code until next.code has returned
219 /// Indicates which lzma_action values are allowed by next.code.
223 /// made (no input consumed and no output produced by next.code).
246 /// Initializes the next filter in the chain, if any. This takes care of
250 extern lzma_ret lzma_next_filter_init(lzma_next_coder *next,
254 /// Update the next filter in the chain, if any. This checks that
257 lzma_next_coder *next, cons
[all...]
/freebsd-11-stable/libexec/mknetid/
H A Dhash.c121 cur = cur->next;
144 tmp->next = NULL;
150 tmp->next = cur->groups;
154 cur = cur->next;
164 new->next = table[i];
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_entry_sparse.c45 sp = entry->sparse_head->next;
86 sp->next = NULL;
93 entry->sparse_tail->next = sp;
108 for (sp = entry->sparse_head; sp != NULL; sp = sp->next)
144 entry->sparse_p = entry->sparse_p->next;
/freebsd-11-stable/contrib/groff/src/devices/grohtml/
H A Dhtml-table.cpp65 p = p->next;
115 last = last->next;
156 last->next = new tab_position;
157 last = last->next;
161 last->next = NULL;
184 for (p = tab; p != NULL; p = p->next) {
201 for (p = tab; (p != NULL) && (n>0); p = p->next) {
214 for (p = tab; (p != NULL) && (n>0); p = p->next) {
231 for (p = tab; p != NULL; p = p->next) {
255 columns = columns->next;
[all...]
/freebsd-11-stable/sys/mips/cavium/cryptocteon/
H A Dcavium_crypto.c100 #define CVM_LOAD_SHA_UNIT(dat, next) { \
101 if (next == 0) { \
102 next = 1; \
104 } else if (next == 1) { \
105 next = 2; \
107 } else if (next == 2) { \
108 next = 3; \
110 } else if (next == 3) { \
111 next = 4; \
113 } else if (next
590 int next = 0; local
692 int next = 0; local
797 int next = 0; local
945 int next = 0; local
1096 int next = 0; local
1247 int next = 0; local
1400 int next = 0; local
1577 int next = 0; local
1753 int next = 0; local
1949 int next = 0; local
[all...]
/freebsd-11-stable/contrib/binutils/ld/
H A Dmri.c38 struct section_name_struct *next; member in struct:section_name_struct
66 *ptr = (*ptr)->next;
68 ptr = &((*ptr)->next);
87 (*ptr)->next = NULL;
137 alist = alist->next)
141 for (olist = order; done == 0 && olist != NULL; olist = olist->next)
169 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next)
170 for (ptr2 = order; ptr2; ptr2 = ptr2->next)
179 for (ptr = order; ptr; ptr = ptr->next)
197 for (aptr = alignment; aptr; aptr = aptr->next)
[all...]
/freebsd-11-stable/sys/contrib/zlib/test/
H A Dinfcover.c51 allocation routines on the next zlib initialization
59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item
99 item->next = zone->first;
114 struct mem_item *item, *next; local
123 /* point next to the item that matches ptr, or NULL if not found -- remove
125 next = zone->first;
126 if (next) {
127 if (next->ptr == ptr)
128 zone->first = next
203 struct mem_item *item, *next; local
248 unsigned next, val; local
449 static unsigned int next = 0; local
622 code *next, table[ENOUGH_DISTS]; local
[all...]
/freebsd-11-stable/contrib/groff/src/roff/troff/
H A Dnumber.cpp205 tok.next();
209 tok.next();
221 tok.next();
260 tok.next();
263 tok.next();
265 tok.next();
269 tok.next();
274 tok.next();
276 tok.next();
280 tok.next();
[all...]
/freebsd-11-stable/crypto/heimdal/lib/krb5/
H A Dtransited.c46 struct tr_realm *next; member in struct:tr_realm
55 r = r->next;
89 tmp->next = r->next;
90 r->next = tmp;
93 r->next = tmp->next;
110 tmp->next = r->next;
111 r->next
[all...]
H A Dacl.c43 struct acl_field *next, **last; member in struct:acl_field
55 acl = acl->next;
62 struct acl_field *next; local
66 next = acl->next;
68 acl = next;
107 tmp->next = NULL;
112 acl->last = &tmp->next;
148 acl = acl->next;
/freebsd-11-stable/contrib/libreadline/
H A Dundo.c85 temp->next = (UNDO_LIST *)NULL;
100 temp->next = rl_undo_list;
114 rl_undo_list = rl_undo_list->next;
151 roving->next = c;
152 roving = roving->next;
154 list = list->next;
157 roving->next = 0;
161 /* Undo the next thing in the list. Return 0 if there
221 rl_undo_list = rl_undo_list->next;
238 for (rl = rl_undo_list; rl; rl = rl->next)
[all...]
/freebsd-11-stable/lib/libc/net/
H A Dgetifmaddrs.c63 char *next; local
91 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {
92 rtm = (struct rt_msghdr *)(void *)next;
127 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {
128 rtm = (struct rt_msghdr *)(void *)next;
/freebsd-11-stable/stand/i386/libi386/
H A Dbiossmap.c62 struct smap_buf *cur, *next; local
82 next = malloc(sizeof(*next));
83 if (next == NULL)
85 next->smap = buf.smap;
87 next->xattr = buf.xattr;
90 STAILQ_INSERT_TAIL(&head, next, bufs);
114 next = STAILQ_NEXT(cur, bufs);
116 cur = next;
/freebsd-11-stable/contrib/unbound/util/
H A Dmodule.c144 callback->next = NULL;
151 prevp = &((*prevp)->next);
166 env->inplace_cb_lists[type] = temp->next;
171 prev->next = temp->next;
173 temp = prev->next;
178 temp = temp->next;
197 for(; list; list=list->next)
211 for(; list; list=list->next)
/freebsd-11-stable/sys/dev/drm/
H A Dsis_ds.c14 * The above copyright notice and this permission notice (including the next
191 p = p->next;
212 newblock->next = p->next;
214 p->next = newblock;
225 newblock->next = p->next;
227 p->next = newblock;
258 p = p->next;
269 if (p->free && p->next
[all...]
/freebsd-11-stable/contrib/ofed/libmlx5/
H A Dsrq.c51 struct mlx5_wqe_srq_next_seg *next; local
57 next = get_wqe(srq, idx);
58 scat = (struct mlx5_wqe_data_seg *) (next + 1);
75 struct mlx5_wqe_srq_next_seg *next; local
79 next = get_wqe(srq, srq->tail);
80 next->next_wqe_index = htobe16(ind);
91 struct mlx5_wqe_srq_next_seg *next; local
99 for (nreq = 0; wr; ++nreq, wr = wr->next) {
115 next = get_wqe(srq, srq->head);
116 srq->head = be16toh(next
151 struct mlx5_wqe_srq_next_seg *next; local
[all...]
/freebsd-11-stable/contrib/wpa/src/eap_peer/
H A Deap_methods.c33 for (m = eap_methods; m; m = m->next) {
53 for (m = eap_methods; m; m = m->next) {
78 for (m = eap_methods; m; m = m->next) {
105 for (m = eap_methods; m; m = m->next) {
135 for (m = eap_methods; m; m = m->next)
142 for (m = eap_methods; m; m = m->next) {
170 for (m = eap_methods; m; m = m->next)
244 m = m->next;
251 prev->next = m->next;
[all...]
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dlfunc.c61 pp = &p->next;
67 uv->u.l.next = g->uvhead.u.l.next;
68 uv->u.l.next->u.l.prev = uv;
69 g->uvhead.u.l.next = uv;
70 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
76 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
77 uv->u.l.next
[all...]

Completed in 373 milliseconds

1234567891011>>