Home
last modified time | relevance | path

Searched refs:next (Results 76 – 100 of 2614) sorted by relevance

12345678910>>...105

/dragonfly/lib/libc/stdlib/
H A Dremque.c19 struct que_elem *prev, *next, *elem; in remque() local
24 next = elem->next; in remque()
27 prev->next = next; in remque()
28 if (next != NULL) in remque()
29 next->prev = prev; in remque()
H A Drand.c84 static u_long next = 1; variable
89 return (do_rand(&next)); in rand()
95 next = seed; in srand()
114 if (_read(fd, (void *) &next, sizeof(next)) == sizeof(next)) in sranddev()
120 size_t len = sizeof(next); in sranddev()
122 if (sysctlbyname("kern.random", &next, &len, NULL, 0) == 0) in sranddev()
/dragonfly/libexec/talkd/
H A Dtable.c63 TABLE_ENTRY *next; member
85 for (ptr = table; ptr != NULL; ptr = ptr->next) { in find_match()
122 for (ptr = table; ptr != NULL; ptr = ptr->next) { in find_request()
163 ptr->next = table; in insert_table()
164 if (ptr->next != NULL) in insert_table()
165 ptr->next->last = ptr; in insert_table()
196 for (ptr = table; ptr != NULL; ptr = ptr->next) { in delete_invite()
219 table = ptr->next; in delete()
221 ptr->last->next = ptr->next; in delete()
222 if (ptr->next != NULL) in delete()
[all …]
/dragonfly/contrib/binutils-2.27/ld/
H A Dmri.c37 struct section_name_struct *next; member
67 *ptr = (*ptr)->next; in lookup()
69 ptr = &((*ptr)->next); in lookup()
89 (*ptr)->next = NULL; in mri_add_to_list()
139 alist = alist->next) in mri_draw_tree()
172 for (ptr2 = order; ptr2; ptr2 = ptr2->next) in mri_draw_tree()
181 for (ptr = order; ptr; ptr = ptr->next) in mri_draw_tree()
215 tmp->next = NULL; in mri_draw_tree()
223 for (aptr = alias; aptr; aptr = aptr->next) in mri_draw_tree()
227 tmp->next = NULL; in mri_draw_tree()
[all …]
/dragonfly/usr.sbin/makefs/
H A Dwalk.c101 cur = cur->next; in walk_dir()
139 cur = join->next; in walk_dir()
147 cur = cur->next; in walk_dir()
213 for (cur = first->next; cur != NULL; cur = cur->next) in walk_dir()
259 fsnode *cur, *next; in free_fsnodes() local
276 for (cur = node->first; cur->next; cur = cur->next) { in free_fsnodes()
278 cur->next = node->next; in free_fsnodes()
286 next = cur->next; in free_fsnodes()
370 fsnode *next; in apply_specdir() local
373 next = curfsnode->next; in apply_specdir()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dipa.c269 next != node; in cgraph_remove_unreachable_nodes()
270 next = next->same_comdat_group) in cgraph_remove_unreachable_nodes()
271 if (!next->reachable) in cgraph_remove_unreachable_nodes()
273 next->reachable = true; in cgraph_remove_unreachable_nodes()
307 next != vnode; in cgraph_remove_unreachable_nodes()
308 next = next->same_comdat_group) in cgraph_remove_unreachable_nodes()
309 if (!next->needed) in cgraph_remove_unreachable_nodes()
329 next = node->next; in cgraph_remove_unreachable_nodes()
429 vnext = vnode->next; in cgraph_remove_unreachable_nodes()
575 next != node; next = next->same_comdat_group) in cgraph_comdat_can_be_unshared_p()
[all …]
/dragonfly/contrib/cvs-1.12/diff/
H A Dutil.c35 struct msg *next; member
139 new->next = 0;
563 while (next)
568 this = next;
573 next = end->link;
583 end->link = next;
755 struct change *next; local
762 next = hunk;
765 l0 = next->line0 + next->deleted - 1;
766 l1 = next->line1 + next->inserted - 1;
[all …]
/dragonfly/contrib/gdb-7/gdb/common/
H A Dqueue.h104 QUEUE_ELEM (TYPE) *next; \
136 p->next = NULL; \
144 q->tail->next = p; \
165 q->head = q->head->next; \
198 q->head = iter->p->next; \
203 iter->prev->next = iter->p->next; \
215 QUEUE_ELEM (TYPE) *next = NULL; \
222 next = iter.p->next; \
261 QUEUE_ELEM (TYPE) *p, *next; \
265 for (p = q->head; p != NULL; p = next) \
[all …]
/dragonfly/contrib/wpa_supplicant/src/eap_peer/
H A Deap_methods.c33 for (m = eap_methods; m; m = m->next) { in eap_peer_get_eap_method()
53 for (m = eap_methods; m; m = m->next) { in eap_peer_get_type()
78 for (m = eap_methods; m; m = m->next) { in eap_get_name()
105 for (m = eap_methods; m; m = m->next) { in eap_get_names()
135 for (m = eap_methods; m; m = m->next) in eap_get_names_as_string_array()
170 for (m = eap_methods; m; m = m->next) in eap_peer_get_methods()
244 m = m->next; in eap_peer_method_unload()
251 prev->next = m->next; in eap_peer_method_unload()
253 eap_methods = m->next; in eap_peer_method_unload()
337 last->next = method; in eap_peer_method_register()
[all …]
/dragonfly/contrib/mdocml/
H A Dtbl_term.c262 dp = dp->next; in term_tbl()
285 cpn = cpn->next; in term_tbl()
297 dp = dp->next; in term_tbl()
311 if (sp->next != NULL && sp->next->pos == TBL_SPAN_DATA && in term_tbl()
414 cp = cp->next; in term_tbl()
420 dp = dp->next; in term_tbl()
464 cp = cp->next; in term_tbl()
561 (sp->next == NULL || sp->next->pos == TBL_SPAN_DATA || in term_tbl()
562 sp->next->next != NULL)) in term_tbl()
643 cpp = cpp->next; in tbl_hrule()
[all …]
H A Dmdoc_validate.c942 if (ic > 1 || n->next->next != NULL) { in build_list()
1143 nch->next->pos, "Tg ... %s", nch->next->string); in post_tg()
1360 n->child->next->line, n->child->next->pos, in post_fo()
1755 nit->head->next->next == NULL) { in post_it()
2105 n->child->next->next == NULL) in post_root()
2107 n = n->child->next->next; in post_root()
2173 if ((next = nch->next) != NULL) in post_rs()
2177 prev->next = nch->next; in post_rs()
2212 nch->next = prev->next; in post_rs()
2319 n->next != NULL && n->next->tok == MDOC_Nm) { in post_sh_name()
[all …]
/dragonfly/usr.sbin/installer/libinstaller/
H A Ddiskutil.c172 d->next = NULL; in disk_new()
284 d = d->next; in disk_find()
293 return(d->next); in disk_next()
339 next = d->next; in disks_free()
344 d = next; in disks_free()
396 s->next = NULL; in slice_new()
420 s = s->next; in slice_find()
503 next = head->next; in slices_free()
507 head = next; in slices_free()
958 next = sp->next; in subpartitions_free()
[all …]
/dragonfly/contrib/zlib-1.2/
H A Dinfback.c93 static code *next; local
101 next = fixed;
102 lenfix = next;
109 distfix = next;
132 next = strm->next_in; \
143 strm->next_in = next; \
161 have = in(in_desc, &next); \
163 next = Z_NULL; \
282 next = strm->next_in;
349 next += copy;
[all …]
/dragonfly/contrib/wpa_supplicant/wpa_supplicant/
H A Dctrl_iface_named_pipe.c121 next = dst->next; in ctrl_flush_broken_pipes()
127 dst = next; in ctrl_flush_broken_pipes()
210 if (dst->next) in ctrl_open_pipe()
243 dst->prev->next = dst->next; in ctrl_close_pipe()
246 if (dst->next) in ctrl_close_pipe()
502 next = dst->next; in wpa_supplicant_ctrl_iface_send()
518 dst = next; in wpa_supplicant_ctrl_iface_send()
563 next = dst->next; in global_flush_broken_pipes()
569 dst = next; in global_flush_broken_pipes()
641 if (dst->next) in global_open_pipe()
[all …]
/dragonfly/usr.sbin/ppp/
H A Dtimer.c105 for (t = TimerList; t; t = t->next) { in timer_Start()
122 tp->next = t; in timer_Start()
124 pt->next = tp; in timer_Start()
155 pt->next = t->next; in StopTimerNoBlock()
157 TimerList = t->next; in StopTimerNoBlock()
161 if (t->next) { in StopTimerNoBlock()
168 t->next->rest += t->rest; in StopTimerNoBlock()
187 tp->next = tp->enext = NULL; in StopTimerNoBlock()
194 struct pppTimer *tp, *exp, *next; in TimerService() local
213 next = tp->next; in TimerService()
[all …]
/dragonfly/contrib/wpa_supplicant/src/radius/
H A Dradius_client.c519 entry = entry->next; in radius_client_timer()
537 prev->next = entry->next; in radius_client_timer()
560 entry = entry->next; in radius_client_timer()
596 next = old + 1; in radius_client_auth_failover()
626 next = old + 1; in radius_client_acct_failover()
713 prev->next = NULL; in radius_client_list_add()
893 req = req->next; in radius_client_receive()
917 prev_req->next = req->next; in radius_client_receive()
985 prev->next = entry->next; in radius_client_get_id()
1021 prev->next = entry->next; in radius_client_flush()
[all …]
/dragonfly/libexec/bootpd/
H A Dhash.c108 nextbucket = bucketptr->next; in hashi_FreeMembers()
191 memberptr = memberptr->next; in hash_Exists()
223 temp->next = (hashtable->table)[hashcode]; in hash_Insert()
254 (hashtable->table)[hashcode] = memberptr->next; in hash_Delete()
258 memberptr->next = NULL; in hash_Delete()
269 memberptr = memberptr->next; in hash_Delete()
274 previous->next = memberptr = memberptr->next; in hash_Delete()
278 tempptr->next = NULL; in hash_Delete()
283 memberptr = memberptr->next; in hash_Delete()
309 memberptr = memberptr->next; in hash_Lookup()
[all …]
/dragonfly/usr.sbin/ac/
H A Dac.c51 SLIST_ENTRY(utmpx_entry) next;
64 SLIST_ENTRY(user_entry) next;
73 SLIST_ENTRY(tty_entry) next;
136 SLIST_FOREACH(tp, &Ttys, next) { in do_tty()
159 SLIST_FOREACH(up, &CurUtmpx, next) in on_console()
178 SLIST_FOREACH(up, &Users, next) { in update_user()
273 SLIST_FOREACH(lp, &Users, next) in show_users()
302 SLIST_FOREACH(up, &Users, next) { in show_today()
332 lp = SLIST_NEXT(lp, next); in log_out()
336 SLIST_REMOVE_AFTER(lp2, next); in log_out()
[all …]
/dragonfly/contrib/gcc-4.7/libobjc/
H A Dclass.c260 class_node_ptr next; in class_table_next() local
272 next = enumerator->node->next; in class_table_next()
274 if (next != NULL) in class_table_next()
286 if (next != NULL) in class_table_next()
317 node = node->next;
528 node = node->next; in objc_getClassList()
683 list = next; in objc_disposeClassPair()
693 struct objc_protocol_list *next = list->next; in objc_disposeClassPair() local
696 list = next; in objc_disposeClassPair()
718 list = next; in objc_disposeClassPair()
[all …]
/dragonfly/contrib/binutils-2.34/libiberty/
H A Drust-demangle.c62 size_t next; member
79 if (rdm->next < rdm->sym_len) in peek()
80 return rdm->sym[rdm->next]; in peek()
91 rdm->next++; in next()
112 c = next (rdm); in parse_ident()
124 start = rdm->next; in parse_ident()
125 rdm->next += len; in parse_ident()
127 if ((start > rdm->next) || (rdm->next > rdm->sym_len)) in parse_ident()
346 rdm.next = 0; in rust_demangle_callback()
403 rdm.next = 0; in rust_demangle_callback()
[all …]
/dragonfly/contrib/cvs-1.12/src/
H A Dbuffer.c258 n = b->next; in buf_free_datas()
522 new->next = NULL; in buf_copy_data()
526 cur = cur->next; in buf_copy_data()
561 n = n->next; in buf_append_buffer()
706 buf = buf->next; in buf_chain_length()
862 next = data->next; in buf_read_short_line()
864 data = next; in buf_read_short_line()
960 next = buf->data->next; in buf_read_data()
962 buf->data = next; in buf_read_data()
1171 for (data = start->next; data != NULL; data = data->next) in buf_copy_counted()
[all …]
/dragonfly/contrib/gdb-7/gdb/
H A Dprologue-value.c286 struct area_entry *prev, *next; member
347 struct area_entry *next = e->next; in clear_entries() local
350 e = next; in clear_entries()
423 e = e->next; in find_entry()
470 struct area_entry *next = (e->next == e) ? 0 : e->next; in pv_area_store() local
472 e->prev->next = e->next; in pv_area_store()
476 e = next; in pv_area_store()
504 e->next = area->entry; in pv_area_store()
505 e->prev->next = e->next->prev = e; in pv_area_store()
560 e = e->next; in pv_area_find_reg()
[all …]
/dragonfly/contrib/wpa_supplicant/src/ap/
H A Dieee802_11_auth.c320 query = query->next; in hostapd_allowed_address()
377 prev->next = entry->next; in hostapd_acl_expire_cache()
382 entry = entry->next; in hostapd_acl_expire_cache()
388 entry = entry->next; in hostapd_acl_expire_cache()
407 prev->next = entry->next; in hostapd_acl_expire_queries()
412 entry = entry->next; in hostapd_acl_expire_queries()
418 entry = entry->next; in hostapd_acl_expire_queries()
529 query = query->next; in hostapd_acl_recv_radius()
639 prev->next = query->next; in hostapd_acl_recv_radius()
682 query = query->next; in hostapd_acl_deinit()
[all …]
/dragonfly/sys/kern/
H A Dsysv_msg.c180 short next; in msg_freehdr() local
183 next = msgmaps[msghdr->msg_spot].next; in msg_freehdr()
467 short next; in sys_msgsnd() local
663 if (next <= -1) in sys_msgsnd()
670 free_msgmaps = msgmaps[next].next; in sys_msgsnd()
672 msgmaps[next].next = msghdr->msg_spot; in sys_msgsnd()
719 if (next <= -1) in sys_msgsnd()
735 next = msgmaps[next].next; in sys_msgsnd()
737 if (next != -1) in sys_msgsnd()
801 short next; in sys_msgrcv() local
[all …]
/dragonfly/contrib/xz/src/liblzma/common/
H A Dblock_decoder.c26 lzma_next_coder next; member
89 const lzma_ret ret = coder->next.code(coder->next.coder, in block_decode()
185 lzma_next_end(&coder->next, allocator); in block_decoder_end()
192 lzma_block_decoder_init(lzma_next_coder *next, const lzma_allocator *allocator, in lzma_block_decoder_init() argument
195 lzma_next_coder_init(&lzma_block_decoder_init, next, allocator); in lzma_block_decoder_init()
205 lzma_block_coder *coder = next->coder; in lzma_block_decoder_init()
211 next->coder = coder; in lzma_block_decoder_init()
212 next->code = &block_decode; in lzma_block_decoder_init()
213 next->end = &block_decoder_end; in lzma_block_decoder_init()
214 coder->next = LZMA_NEXT_CODER_INIT; in lzma_block_decoder_init()
[all …]

12345678910>>...105