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

1234567891011>>

/freebsd-10-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-10-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);
H A Dtree-ssa-math-opts.c122 /* Pointer to the next "struct occurrence"s in the list of blocks
124 struct occurrence *next; member in struct:occurrence
185 *p_occ = occ->next;
186 occ->next = new_occ->children;
189 /* Try the next block (it may as well be dominated by BB). */
206 *p_occ = occ->next;
207 new_occ->next = occ;
208 occ->next = NULL;
218 /* Nothing special, go on with the next element. */
219 p_occ = &occ->next;
369 struct occurrence *child, *next; local
[all...]
/freebsd-10-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-10-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-10-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-10-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-10-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 register int next = 0; local
692 register int next = 0; local
797 register int next = 0; local
945 register int next = 0; local
1096 register int next = 0; local
1247 register int next = 0; local
1400 register int next = 0; local
1577 register int next = 0; local
1753 register int next = 0; local
1949 register int next = 0; local
[all...]
/freebsd-10-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-10-stable/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-10-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-10-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-10-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-10-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-10-stable/sys/boot/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-10-stable/contrib/wpa/src/eap_peer/
H A Deap_methods.c31 for (m = eap_methods; m; m = m->next) {
51 for (m = eap_methods; m; m = m->next) {
76 for (m = eap_methods; m; m = m->next) {
103 for (m = eap_methods; m; m = m->next) {
133 for (m = eap_methods; m; m = m->next)
140 for (m = eap_methods; m; m = m->next) {
168 for (m = eap_methods; m; m = m->next)
242 m = m->next;
249 prev->next = m->next;
[all...]
/freebsd-10-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-10-stable/contrib/gdb/gdb/
H A Dsolib-osf.c72 CORE_ADDR next; member in struct:__anon1421
139 ldr_module_t next; member in struct:read_map_ctxt
141 CORE_ADDR next; /* next element in module list */
372 ctxt->next = LDR_NULL_MODULE;
374 CORE_ADDR ldr_context_addr, prev, next;
385 ctxt->next = ldr_context.head;
437 store the next element in SO, advance CTXT to the next element, and return
450 /* Retrieve the next elemen
[all...]
/freebsd-10-stable/contrib/com_err/
H A Derror.c50 for (p = list; p; p = p->next)
60 for (p = list; p; p = p->next) {
87 for (end = list, et = *list; et; end = &et->next, et = et->next)
98 et->next = NULL;
108 et = et->next;
/freebsd-10-stable/contrib/diff/src/
H A Dutil.c36 struct msg *next; member in struct:msg
117 new->next = 0;
118 msg_chain_end = &new->next;
139 struct msg *next = m->next;
145 m = next;
489 struct change *next = script;
491 while (next)
496 this = next;
497 end = (*hunkfun) (next);
137 struct msg *next = m->next; local
483 struct change *next = script; local
657 struct change *next; local
[all...]
/freebsd-10-stable/contrib/tcpdump/
H A Dprint-igrp.c84 u_int nint, nsys, next; local
94 next = EXTRACT_16BITS(&hdr->ig_nx);
103 next);
115 } else if (next > 0) {
118 --next;
126 if (nint == 0 && nsys == 0 && next == 0)

Completed in 362 milliseconds

1234567891011>>