Searched refs:next (Results 201 - 225 of 3058) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/gcc/
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...]
H A Dcselib.h49 struct elt_loc_list *next; local
61 struct elt_list *next; local
/freebsd-11-stable/contrib/gdb/gdb/
H A Dsolib-osf.c72 CORE_ADDR next; member in struct:__anon1601
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...]
H A Df-lang.h41 struct common_entry *next; /* The next component */ member in struct:common_entry
53 struct saved_f77_common *next; /* Next saved COMMON block */ member in struct:saved_f77_common
/freebsd-11-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-11-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-11-stable/crypto/heimdal/lib/com_err/
H A Derror.c53 for (p = list; p; p = p->next)
63 for (p = list; p; p = p->next) {
90 for (end = list, et = *list; et; end = &et->next, et = et->next)
101 et->next = NULL;
111 et = et->next;
/freebsd-11-stable/libexec/revnetgroup/
H A Dhash.c123 cur = cur->next;
157 new->next = table[i];
187 tmp->next = NULL;
192 tmp->next = cur->groups;
196 cur = cur->next;
204 new->next = table[i];
/freebsd-11-stable/usr.sbin/rtsold/
H A Drtsock.c94 char *lim, *next; local
105 for (next = msg; next < lim; next += len) {
106 rtm = (struct rt_msghdr *)(void *)next;
107 if (lim - next < lenlim)
/freebsd-11-stable/contrib/tcpdump/
H A Dprint-igrp.c109 u_int nint, nsys, next; local
119 next = EXTRACT_16BITS(&hdr->ig_nx);
128 next));
140 } else if (next > 0) {
143 --next;
151 if (nint == 0 && nsys == 0 && next == 0)
/freebsd-11-stable/usr.bin/bluetooth/btsockstat/
H A Dbtsockstat.c218 ng_btsocket_hci_raw_pcb_p this = NULL, next = NULL; local
229 for ( ; this != NULL; this = next) {
235 next = LIST_NEXT(&pcb, next);
273 ng_btsocket_l2cap_raw_pcb_p this = NULL, next = NULL; local
284 for ( ; this != NULL; this = next) {
290 next = LIST_NEXT(&pcb, next);
329 ng_btsocket_l2cap_pcb_p this = NULL, next = NULL; local
341 for ( ; this != NULL; this = next) {
384 ng_btsocket_l2cap_rtentry_p this = NULL, next = NULL; local
434 ng_btsocket_rfcomm_pcb_p this = NULL, next = NULL; local
499 ng_btsocket_rfcomm_session_p this = NULL, next = NULL; local
[all...]
/freebsd-11-stable/stand/common/
H A Dinterp_simple.c76 struct includeline *next; member in struct:includeline
131 script = script->next;
143 sp->next = NULL;
148 se->next = sp;
159 for (sp = script; sp != NULL; sp = sp->next) {
190 script = script->next;
/freebsd-11-stable/sys/dev/tws/
H A Dtws_services.c225 req->next = req->prev = NULL;
240 req->next = sc->q_head[q_type];
259 req->next = NULL;
260 sc->q_tail[q_type]->next = req;
277 if ( r->next == NULL && r->prev == NULL ) {
281 sc->q_head[q_type] = r->next;
282 r->next->prev = NULL;
283 r->next = NULL;
300 if ( r->next == NULL && r->prev == NULL ) {
305 r->prev->next
[all...]
/freebsd-11-stable/contrib/flex/
H A Dfilter.c56 f->next = NULL;
61 while (chain->next)
62 chain = chain->next;
63 chain->next = f;
114 f->next = NULL;
123 while (chain->next)
124 chain = chain->next;
125 chain->next = f;
145 filter_apply_chain (chain->next);
218 while (chain->next
[all...]
/freebsd-11-stable/libexec/bootpd/
H A Dhash.c117 nextbucket = bucketptr->next;
209 memberptr = memberptr->next;
245 temp->next = (hashtable->table)[hashcode];
281 (hashtable->table)[hashcode] = memberptr->next;
285 memberptr->next = NULL;
296 memberptr = memberptr->next;
301 previous->next = memberptr = memberptr->next;
305 tempptr->next = NULL;
310 memberptr = memberptr->next;
[all...]
/freebsd-11-stable/contrib/xz/src/liblzma/lz/
H A Dlz_decoder.c33 lzma_next_coder next; member in struct:__anon36
35 /// True if the next filter in the chain has returned LZMA_STREAM_END.
43 /// filter in the chain. The output of the next filter is first
142 if (coder->next.code == NULL)
155 const lzma_ret ret = coder->next.code(
156 coder->next.coder,
198 lzma_next_end(&coder->next, allocator);
212 lzma_lz_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, argument
219 lzma_coder *coder = next->coder;
225 next
[all...]
/freebsd-11-stable/contrib/xz/src/liblzma/simple/
H A Dsimple_coder.c28 if (coder->next.code == NULL) {
37 // Call the next coder in the chain to provide us some data.
38 const lzma_ret ret = coder->next.code(
39 coder->next.coder, allocator,
119 // restarted if the next filter in the chain returns e.g.
151 // the next coder in the chain (if any) was successful.
214 lzma_next_end(&coder->next, allocator);
228 // No update support, just call the next filter in the chain.
230 &coder->next, allocator, reversed_filters + 1);
235 lzma_simple_coder_init(lzma_next_coder *next, cons argument
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/
H A Dblame.c60 struct blame *next; /* the next chunk */ member in struct:blame
105 on the *next* revision, as the interesting change
137 chain->avail = blame->next;
143 blame->next = NULL;
152 blame->next = chain->avail;
166 blame = blame->next;
179 blame = blame->next;
192 struct blame *tail = last->next;
196 struct blame *walk = first->next;
199 struct blame *next = walk->next; local
[all...]
/freebsd-11-stable/bin/sh/
H A Dalias.c67 for (ap = *app; ap; ap = ap->next) {
82 ap->next = *app;
95 for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
108 *app = ap->next;
136 ap = ap->next;
151 for (ap = *hashalias(name); ap; ap = ap->next) {
189 for (ap = atab[i]; ap; ap = ap->next)
/freebsd-11-stable/crypto/heimdal/lib/asn1/
H A Dhash.c79 hptr = hptr->next)
116 h->next = *tabptr;
119 if (h->next)
120 h->next->prev = &h->next;
139 if ((*(h->prev) = h->next))
140 h->next->prev = h->prev;
158 for (g = *h; g; g = g->next)
/freebsd-11-stable/crypto/heimdal/lib/sl/
H A Dtest_sl.c78 goto next;
89 next:
/freebsd-11-stable/usr.bin/tip/tip/
H A Dremote.c215 static char *next; local
224 next = DV;
231 if (next == NOSTR)
233 if ((cp = strchr(next, ',')) == NULL) {
234 DV = next;
235 next = NOSTR;
238 DV = next;
239 next = cp;
/freebsd-11-stable/sys/rpc/
H A Drpcb_prot.c123 rpcblist_ptr next; local
126 next = NULL;
137 * the case of freeing we must remember the next object
141 next = (*rp)->rpcb_next;
147 next_copy = next;
152 * but next itself survives.
207 rpcb_entry_list_ptr next; local
210 next = NULL;
221 * the case of freeing we must remember the next object
225 next
[all...]
/freebsd-11-stable/usr.bin/mkimg/
H A Dformat.c49 return ((f == NULL) ? first : f->next);
56 f->next = first;
/freebsd-11-stable/contrib/openpam/lib/libpam/
H A Dpam_set_data.c67 for (dp = pamh->module_data; dp != NULL; dp = dp->next) {
84 dp->next = pamh->module_data;

Completed in 200 milliseconds

1234567891011>>