Searched refs:next (Results 126 - 150 of 2424) sorted by relevance

1234567891011>>

/freebsd-9.3-release/contrib/groff/src/devices/xditview/
H A Dpage.c23 for (m = dw->dvi.file_map; m; m=m->next)
32 DviFileMap *next; local
34 for (; m; m = next) {
35 next = m->next;
55 m->next = dw->dvi.file_map;
/freebsd-9.3-release/contrib/wpa/src/eap_server/
H A Deap_server_methods.c34 for (m = eap_methods; m; m = m->next) {
54 for (m = eap_methods; m; m = m->next) {
119 for (m = eap_methods; m; m = m->next) {
128 last->next = method;
148 eap_methods = eap_methods->next;
170 for (m = eap_methods; m; m = m->next) {
/freebsd-9.3-release/contrib/xz/src/liblzma/simple/
H A Dia64.c89 ia64_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
92 return lzma_simple_coder_init(next, allocator, filters,
98 lzma_simple_ia64_encoder_init(lzma_next_coder *next, argument
101 return ia64_coder_init(next, allocator, filters, true);
106 lzma_simple_ia64_decoder_init(lzma_next_coder *next, argument
109 return ia64_coder_init(next, allocator, filters, false);
H A Dx86.c126 x86_coder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
129 const lzma_ret ret = lzma_simple_coder_init(next, allocator, filters,
133 next->coder->simple->prev_mask = 0;
134 next->coder->simple->prev_pos = (uint32_t)(-5);
142 lzma_simple_x86_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
145 return x86_coder_init(next, allocator, filters, true);
150 lzma_simple_x86_decoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
153 return x86_coder_init(next, allocator, filters, false);
/freebsd-9.3-release/usr.bin/rpcgen/
H A Drpc_parse.h100 struct enumval_list *next; member in struct:enumval_list
120 struct decl_list *next; member in struct:decl_list
133 struct case_list *next; member in struct:case_list
158 struct proc_list *next; member in struct:proc_list
166 struct version_list *next; member in struct:version_list
197 struct bas_type *next; member in struct:bas_type
/freebsd-9.3-release/contrib/binutils/libiberty/
H A Dpartition.c54 part->elements[e].next = &(part->elements[e]);
108 for (p = e2->next; p != e2; p = p->next)
113 old_next = e1->next;
114 e1->next = e2->next;
115 e2->next = old_next;
168 c = elements[c].next - elements;
/freebsd-9.3-release/contrib/gcc/
H A Dgensupport.h70 struct pred_data *next; /* for iterating over the set of all preds */ member in struct:pred_data
89 #define FOR_ALL_PREDICATES(p) for (p = first_predicate; p; p = p->next)
/freebsd-9.3-release/contrib/gcclibs/libgomp/
H A Diter.c54 *pstart = ws->next;
57 return ws->next == ws->end;
74 n = (ws->end - ws->next + s) / ws->incr;
94 s = (long)s0 * ws->incr + ws->next;
95 e = (long)e0 * ws->incr + ws->next;
111 n = (ws->end - ws->next + s) / ws->incr;
127 s = (long)s0 * ws->incr + ws->next;
128 e = (long)e0 * ws->incr + ws->next;
153 start = ws->next;
171 ws->next
[all...]
/freebsd-9.3-release/contrib/gcclibs/libiberty/
H A Dpartition.c54 part->elements[e].next = &(part->elements[e]);
108 for (p = e2->next; p != e2; p = p->next)
113 old_next = e1->next;
114 e1->next = e2->next;
115 e2->next = old_next;
168 c = elements[c].next - elements;
/freebsd-9.3-release/contrib/texinfo/makeinfo/
H A Dfiles.h28 struct fstack *next; member in struct:fstack
56 struct delayed_write *next; member in struct:delayed_write
/freebsd-9.3-release/contrib/xz/src/liblzma/delta/
H A Ddelta_encoder.c59 if (coder->next.code == NULL) {
75 ret = coder->next.code(coder->next.coder, allocator,
95 &coder->next, allocator, reversed_filters + 1);
100 lzma_delta_encoder_init(lzma_next_coder *next, lzma_allocator *allocator, argument
103 next->code = &delta_encode;
104 next->update = &delta_encoder_update;
105 return lzma_delta_coder_init(next, allocator, filters);
/freebsd-9.3-release/crypto/openssh/
H A Dmonitor_mm.h32 RB_ENTRY(mm_share) next; member in struct:mm_share
46 RB_PROTOTYPE(mmtree, mm_share, next, mm_compare)
/freebsd-9.3-release/sbin/dhclient/
H A Ddispatch.c152 for (l = protocols; l; l = l->next)
170 timeouts = timeouts->next;
172 t->next = free_timeouts;
192 for (i = 0, l = protocols; l; l = l->next) {
223 for (l = protocols; l; l = l->next) {
357 for (q = timeouts; q; q = q->next) {
360 t->next = q->next;
362 timeouts = q->next;
373 free_timeouts = q->next;
456 struct protocol *p, *next, *prev; local
[all...]
/freebsd-9.3-release/share/examples/sunrpc/dir/
H A Ddir.x16 namelist next; /* next entry */
/freebsd-9.3-release/sys/dev/isci/scil/
H A Dsci_simple_list.h98 (element)->next = NULL; \
128 #define sci_simple_list_get_next(element) ((element)->next)
161 struct SCI_SIMPLE_LIST_ELEMENT *next; member in struct:SCI_SIMPLE_LIST_ELEMENT
183 element->next = anchor->list_head;
211 anchor->list_tail->next = element;
238 anchor->list_head = anchor->list_head->next;
302 source_anchor->list_tail->next = dest_anchor->list_head;
339 dest_anchor->list_tail->next = source_anchor->list_head;
/freebsd-9.3-release/usr.sbin/dumpcis/
H A Dreadcis.h30 struct tuple *next; member in struct:tuple
37 struct tuple_list *next; member in struct:tuple_list
/freebsd-9.3-release/contrib/texinfo/util/
H A Dinstall-info.c63 struct spec_section *next;
74 struct spec_entry *next;
89 struct node *next;
96 which is the end of the file or where the next line starts. */
112 struct menu_section *next;
786 for (spec = input_sections; spec; spec = spec->next)
794 for (spec = input_sections; spec; spec = spec->next)
800 for (entry = entries_to_add; entry; entry = entry->next)
808 for (entry = entries_to_add; entry; entry = entry->next)
834 spec1 = spec1->next)
62 struct spec_section *next; member in struct:spec_section
73 struct spec_entry *next; member in struct:spec_entry
88 struct node *next; member in struct:node
111 struct menu_section *next; member in struct:menu_section
884 struct spec_section *next local
936 struct spec_entry *next local
1021 struct node *next = (struct node *) xmalloc (sizeof (struct node)); local
1059 struct menu_section *next local
1222 struct spec_entry *next local
1274 struct spec_section *next local
[all...]
/freebsd-9.3-release/contrib/ofed/libmlx4/src/
H A Ddbrec.c45 struct mlx4_db_page *prev, *next; member in struct:mlx4_db_page
82 page->next = context->db_list[type];
84 if (page->next)
85 page->next->prev = page;
98 for (page = context->db_list[type]; page; page = page->next)
130 for (page = context->db_list[type]; page; page = page->next)
142 page->prev->next = page->next;
144 context->db_list[type] = page->next;
145 if (page->next)
[all...]
/freebsd-9.3-release/crypto/heimdal/lib/krb5/
H A Dplugin.c44 struct krb5_plugin *next; member in struct:krb5_plugin
51 struct plugin *next; member in struct:plugin
72 return p->next;
155 e->next = registered;
181 for (p = registered; p != NULL; p = p->next) {
194 e->next = *list;
226 e->next = *list;
256 struct krb5_plugin *next; local
258 next = list->next;
[all...]
/freebsd-9.3-release/contrib/dtc/
H A Dlivetree.c34 new->next = NULL;
43 assert(first->next == NULL);
45 first->next = list;
53 struct property *next; local
56 next = p->next;
57 p->next = head;
59 p = next;
104 prop->next = NULL;
108 p = &((*p)->next);
[all...]
/freebsd-9.3-release/usr.sbin/ppp/
H A Dtimer.c105 for (t = TimerList; t; t = t->next) {
122 tp->next = t;
124 pt->next = tp;
142 * A RUNNING timer must be removed from TimerList (->next list).
143 * A STOPPED timer isn't in any list, but may have a bogus [e]next field.
151 for (t = TimerList; t != tp && t != NULL; t = t->next)
156 pt->next = t->next;
158 TimerList = t->next;
162 if (t->next) {
192 struct pppTimer *tp, *exp, *next; local
[all...]
/freebsd-9.3-release/contrib/ofed/management/opensm/opensm/
H A Dst.c56 st_table_entry *next; member in struct:st_table_entry
242 register st_table_entry *ptr, *next; local
248 next = ptr->next;
250 ptr = next;
272 while (PTR_NOT_EQUAL(table, ptr->next, hash_val, key)) {\
273 ptr = ptr->next;\
275 ptr = ptr->next;\
313 entry->next = table->bins[bin_pos];\
353 register st_table_entry *ptr, *next, **new_bin local
[all...]
/freebsd-9.3-release/contrib/texinfo/info/
H A Dwindow.c122 for (numwins = 0, win = windows; win; win = win->next, numwins++);
134 if (!windows->next)
144 for (win = windows; win; win = win->next)
169 if ((!windows->next) && ((windows->height == 0) && (delta_height < 0)))
180 for (win = windows; win; win = win->next)
206 if (!win->next)
221 if ((delta_each < 0) && ((windows->height != 0) && windows->next))
239 for (win = windows; win; win = win->next)
253 win= win->next;
318 window->next
379 register WINDOW *win, *prev, *next; local
615 WINDOW *next, *prev, *window_to_fix; local
[all...]
/freebsd-9.3-release/contrib/binutils/binutils/
H A Darsup.h23 struct list *next; member in struct:list
/freebsd-9.3-release/contrib/binutils/include/
H A Dpartition.h51 /* The next element in this class. Elements in each class form a
53 struct partition_elem* next; member in struct:partition_elem

Completed in 520 milliseconds

1234567891011>>