| /dragonfly/tools/tools/drm/radeon/mkregtable/ |
| H A D | mkregtable.c | 53 list->prev = list; in INIT_LIST_HEAD()
66 next->prev = new; in __list_add()
68 new->prev = prev; in __list_add()
69 prev->next = new; in __list_add()
111 next->prev = prev; in __list_del()
112 prev->next = next; in __list_del()
143 new->prev = old->prev; in list_replace()
282 first->prev = prev; in __list_splice()
381 for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
382 pos = pos->prev)
[all …]
|
| /dragonfly/sys/dev/drm/include/linux/ |
| H A D | list.h | 68 return head->prev; in list_last()
86 next->prev = prev; in __list_del()
100 entry->next->prev = entry->prev; in list_del()
109 new->prev = old->prev; in list_replace()
125 next->prev = new; in _list_add()
127 new->prev = prev; in _list_add()
128 prev->next = new; in _list_add()
243 last = list->prev; in _list_splice()
244 first->prev = prev; in _list_splice()
245 prev->next = first; in _list_splice()
[all …]
|
| /dragonfly/lib/libc/stdlib/ |
| H A D | insque.c | 23 struct que_elem *prev, *next, *elem; in insque() local
26 prev = (struct que_elem *)pred; in insque()
28 if (prev == NULL) { in insque()
29 elem->prev = elem->next = NULL; in insque()
33 next = prev->next; in insque()
36 if (next->prev != prev) { in insque()
39 next, next->prev, prev); in insque()
42 next->prev = elem; in insque()
44 prev->next = elem; in insque()
45 elem->prev = prev; in insque()
|
| H A D | remque.c | 19 struct que_elem *prev, *next, *elem; in remque() local
23 prev = elem->prev; in remque()
26 if (prev != NULL) in remque()
27 prev->next = next; in remque()
29 next->prev = prev; in remque()
|
| /dragonfly/sys/dev/raid/hpt27xx/ |
| H A D | list.h | 41 struct list_head *next, *prev; member
48 next->prev = _new; in __list_add()
50 _new->prev = prev; in __list_add()
51 prev->next = _new; in __list_add()
61 __list_add(_new, head->prev, head); in list_add_tail()
66 next->prev = prev; in __list_del()
67 prev->next = next; in __list_del()
72 __list_del(entry->prev, entry->next); in list_del()
91 struct list_head *last = list->prev; in __list_splice()
94 first->prev = head; in __list_splice()
[all …]
|
| /dragonfly/sys/dev/raid/hptrr/ |
| H A D | list.h | 43 struct list_head *next, *prev; member
50 next->prev = _new; in __list_add()
52 _new->prev = prev; in __list_add()
53 prev->next = _new; in __list_add()
63 __list_add(_new, head->prev, head); in list_add_tail()
68 next->prev = prev; in __list_del()
69 prev->next = next; in __list_del()
74 __list_del(entry->prev, entry->next); in list_del()
93 struct list_head *last = list->prev; in __list_splice()
96 first->prev = head; in __list_splice()
[all …]
|
| /dragonfly/lib/libc/include/isc/ |
| H A D | list.h | 33 (elt)->link.prev = (type *)(-1); \
48 (list).head->link.prev = (elt); \
51 (elt)->link.prev = NULL; \
63 (elt)->link.prev = (list).tail; \
72 (elt)->link.next->link.prev = (elt)->link.prev; \
75 (list).tail = (elt)->link.prev; \
77 if ((elt)->link.prev != NULL) \
94 if ((before)->link.prev == NULL) \
97 (elt)->link.prev = (before)->link.prev; \
98 (before)->link.prev = (elt); \
[all …]
|
| /dragonfly/contrib/gcc-4.7/gcc/ |
| H A D | tree-iterator.c | 130 head->prev = NULL; in tsi_link_before()
143 head->prev = cur->prev; in tsi_link_before()
144 if (head->prev) in tsi_link_before()
149 cur->prev = tail; in tsi_link_before()
154 if (head->prev) in tsi_link_before()
224 head->prev = cur; in tsi_link_after()
261 prev = cur->prev; in tsi_delink()
263 if (prev) in tsi_delink()
264 prev->next = next; in tsi_delink()
268 next->prev = prev; in tsi_delink()
[all …]
|
| H A D | et-forest.c | 93 occ->prev = t; in set_prev()
156 if (occ->prev) in et_check_occ_sanity()
173 if (occ->prev) in et_check_sanity()
210 if (occ->prev) in record_path_before_1()
271 if (occ->prev) in check_path_after_1()
422 ggf->prev = occ; in et_splay()
453 nw->prev = NULL; in et_new_occ()
590 for (r = rmost->next; r->prev; r = r->prev) in et_split()
599 l = p_occ->prev; in et_split()
647 l = o1->prev; in et_nca()
[all …]
|
| H A D | gimple-iterator.c | 122 first->prev = cur->prev; in gsi_insert_seq_nodes_before()
123 if (first->prev) in gsi_insert_seq_nodes_before()
128 cur->prev = last; in gsi_insert_seq_nodes_before()
347 next->prev = NULL; in gsi_split_seq_after()
366 prev = cur->prev; in gsi_split_seq_before()
378 cur->prev = NULL; in gsi_split_seq_before()
379 if (prev) in gsi_split_seq_before()
380 prev->next = NULL; in gsi_split_seq_before()
527 prev = cur->prev; in gsi_remove()
529 if (prev) in gsi_remove()
[all …]
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | tree-iterator.c | 151 head->prev = cur->prev; in tsi_link_before()
152 if (head->prev) in tsi_link_before()
157 cur->prev = tail; in tsi_link_before()
162 if (head->prev) in tsi_link_before()
233 head->prev = cur; in tsi_link_after()
270 prev = cur->prev; in tsi_delink()
272 if (prev) in tsi_delink()
273 prev->next = next; in tsi_delink()
277 next->prev = prev; in tsi_delink()
281 if (!next && !prev) in tsi_delink()
[all …]
|
| H A D | gimple-iterator.c | 130 first->prev = cur->prev; in gsi_insert_seq_nodes_before()
136 cur->prev = last; in gsi_insert_seq_nodes_before()
367 gimple *prev, *next; in gsi_set_stmt() local
370 stmt->prev = prev = orig_stmt->prev; in gsi_set_stmt()
374 if (prev->next) in gsi_set_stmt()
400 prev = cur->prev; in gsi_split_seq_before()
403 if (!prev->next) in gsi_split_seq_before()
413 if (prev->next) in gsi_split_seq_before()
582 prev = cur->prev; in gsi_remove()
587 next->prev = prev; in gsi_remove()
[all …]
|
| H A D | et-forest.c | 94 occ->prev = t; in set_prev()
157 if (occ->prev) in et_check_occ_sanity()
174 if (occ->prev) in et_check_sanity()
211 if (occ->prev) in record_path_before_1()
272 if (occ->prev) in check_path_after_1()
423 ggf->prev = occ; in et_splay()
450 nw->prev = NULL; in et_new_occ()
583 for (r = rmost->next; r->prev; r = r->prev) in et_split()
592 l = p_occ->prev; in et_split()
640 l = o1->prev; in et_nca()
[all …]
|
| /dragonfly/contrib/binutils-2.34/gprof/ |
| H A D | cg_print.c | 177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
328 for (prev = &sorted; prev->next_parent; prev = prev->next_parent) in sort_parents()
415 for (prev = &sorted; prev->next_child; prev = prev->next_child) in sort_children()
1063 while (prev->prev) in order_and_dump_functions_by_arcs()
1065 prev = prev->prev; in order_and_dump_functions_by_arcs()
1085 while (prev->prev) in order_and_dump_functions_by_arcs()
1087 prev = prev->prev; in order_and_dump_functions_by_arcs()
1107 while (sym1->prev) in order_and_dump_functions_by_arcs()
1115 while (sym2->prev) in order_and_dump_functions_by_arcs()
1152 if (child->prev) in order_and_dump_functions_by_arcs()
[all …]
|
| /dragonfly/contrib/binutils-2.27/gprof/ |
| H A D | cg_print.c | 177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
328 for (prev = &sorted; prev->next_parent; prev = prev->next_parent) in sort_parents()
415 for (prev = &sorted; prev->next_child; prev = prev->next_child) in sort_children()
1063 while (prev->prev) in order_and_dump_functions_by_arcs()
1065 prev = prev->prev; in order_and_dump_functions_by_arcs()
1085 while (prev->prev) in order_and_dump_functions_by_arcs()
1087 prev = prev->prev; in order_and_dump_functions_by_arcs()
1107 while (sym1->prev) in order_and_dump_functions_by_arcs()
1115 while (sym2->prev) in order_and_dump_functions_by_arcs()
1152 if (child->prev) in order_and_dump_functions_by_arcs()
[all …]
|
| /dragonfly/sys/net/altq/ |
| H A D | altq_classq.h | 99 struct mbuf *m, *m0, *prev; in _getq_tail() local
104 prev = m0; in _getq_tail()
108 if (prev == m) in _getq_tail()
111 qtail(q) = prev; in _getq_tail()
129 struct mbuf *prev = NULL; in _getq_random() local
133 prev = m; in _getq_random()
138 qtail(q) = prev; in _getq_random()
148 struct mbuf *m0, *prev; in _removeq() local
152 prev = m0; in _removeq()
156 if (prev == m) in _removeq()
[all …]
|
| /dragonfly/sys/dev/drm/ |
| H A D | linux_list_sort.c | 159 struct list_head *prev = list; in list_sort_merge_into() local
168 (*first)->prev = prev; in list_sort_merge_into()
169 prev = prev->next = *first; in list_sort_merge_into()
179 prev->next = tail; in list_sort_merge_into()
180 tail->prev = prev; in list_sort_merge_into()
181 prev = prev->next; in list_sort_merge_into()
188 prev->next = list; in list_sort_merge_into()
189 list->prev = prev; in list_sort_merge_into()
|
| /dragonfly/games/atc/ |
| H A D | list.c | 61 p->next = p->prev = NULL; in append()
73 p->prev = r; in append()
76 q->prev = p; in append()
79 p->prev = NULL; in append()
80 q->prev = p; in append()
86 p->prev = l->tail; in append()
102 l->head->prev = NULL; in delete()
104 l->tail = p->prev; in delete()
107 p->prev->next = p->next; in delete()
108 p->next->prev = p->prev; in delete()
|
| /dragonfly/contrib/wpa_supplicant/src/utils/ |
| H A D | list.h | 17 struct dl_list *prev; member
25 list->prev = list; in dl_list_init()
31 item->prev = list; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
38 dl_list_add(list->prev, item); in dl_list_add_tail()
43 item->next->prev = item->prev; in dl_list_del()
44 item->prev->next = item->next; in dl_list_del()
46 item->prev = NULL; in dl_list_del()
76 dl_list_entry((list)->prev, type, member))
90 for (item = dl_list_entry((list)->prev, type, member); \
[all …]
|
| /dragonfly/contrib/bmake/ |
| H A D | lst.c | 44 ln->prev = prev; in LstNodeNew()
100 newNode = LstNodeNew(ln->prev, ln, datum); in Lst_InsertBefore()
102 if (ln->prev != NULL) in Lst_InsertBefore()
103 ln->prev->next = newNode; in Lst_InsertBefore()
104 ln->prev = newNode; in Lst_InsertBefore()
124 list->first->prev = ln; in Lst_Prepend()
157 ln->next->prev = ln->prev; in Lst_Remove()
158 if (ln->prev != NULL) in Lst_Remove()
159 ln->prev->next = ln->next; in Lst_Remove()
165 list->last = ln->prev; in Lst_Remove()
[all …]
|
| /dragonfly/contrib/wpa_supplicant/src/ap/ |
| H A D | ap_list.c | 67 ap->prev = iface->ap_list->prev; in ap_ap_list_add()
68 iface->ap_list->prev = ap; in ap_ap_list_add()
70 ap->prev = ap; in ap_ap_list_add()
81 ap->prev->next = ap->next; in ap_ap_list_del()
84 ap->next->prev = ap->prev; in ap_ap_list_del()
86 iface->ap_list->prev = ap->prev; in ap_ap_list_del()
131 struct ap_info *ap, *prev; in hostapd_free_aps() local
136 prev = ap; in hostapd_free_aps()
138 ap_free_ap(iface, prev); in hostapd_free_aps()
162 ap_free_ap(iface, ap->prev); in ap_ap_add()
[all …]
|
| H A D | ieee802_11_auth.c | 69 prev = acl_cache; in hostapd_acl_cache_free()
368 prev = NULL; in hostapd_acl_expire_cache()
376 if (prev) in hostapd_acl_expire_cache()
387 prev = entry; in hostapd_acl_expire_cache()
398 prev = NULL; in hostapd_acl_expire_queries()
406 if (prev) in hostapd_acl_expire_queries()
417 prev = entry; in hostapd_acl_expire_queries()
524 prev = NULL; in hostapd_acl_recv_radius()
528 prev = query; in hostapd_acl_recv_radius()
681 prev = query; in hostapd_acl_deinit()
[all …]
|
| /dragonfly/sys/kern/ |
| H A D | kern_mutex.c | 172 link->prev = link->next->prev; in __mtx_lock_ex()
177 link->prev = link; in __mtx_lock_ex()
324 link->prev = link->next->prev; in __mtx_lock_sh()
329 link->prev = link; in __mtx_lock_sh()
767 link->next->prev = link->prev; in mtx_chain_link_ex()
852 link->next->prev = link->prev; in mtx_chain_link_sh()
856 link->prev = NULL; in mtx_chain_link_sh()
921 link->next->prev = link->prev; in mtx_delete_link()
931 link->next->prev = link->prev; in mtx_delete_link()
1095 link->next->prev = link->prev; in mtx_abort_link()
[all …]
|
| /dragonfly/games/boggle/mkindex/ |
| H A D | mkindex.c | 48 int clen, rlen, prev; in main() local
52 prev = '\0'; in main()
55 if (*buf != prev) { in main()
56 if (prev != '\0') in main()
57 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
58 prev = *buf; in main()
63 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
|
| /dragonfly/sys/dev/raid/tws/ |
| H A D | tws_services.c | 225 req->next = req->prev = NULL; in tws_insert2_empty_q()
241 req->prev = NULL; in tws_q_insert_head()
242 sc->q_head[q_type]->prev = req; in tws_q_insert_head()
282 r->next->prev = NULL; in tws_q_remove_head()
284 r->prev = NULL; in tws_q_remove_head()
304 sc->q_tail[q_type] = r->prev; in tws_q_remove_tail()
305 r->prev->next = NULL; in tws_q_remove_tail()
307 r->prev = NULL; in tws_q_remove_tail()
357 req->prev->next = r->next; in tws_q_remove_request()
358 req->next->prev = r->prev; in tws_q_remove_request()
[all …]
|