| /openbsd-src/sys/dev/pci/drm/include/linux/ |
| H A D | list.h | 46 (head)->prev = head; in INIT_LIST_HEAD()
61 return !list_empty(head) && ((head)->next == (head)->prev); in list_is_singular()
68 return list->prev == head; in list_is_first()
79 __list_add(struct list_head *new, struct list_head *prev, in __list_add() argument
82 next->prev = new; in __list_add()
84 new->prev = prev; in __list_add()
85 prev->next = new; in __list_add()
90 (head)->next->prev = new; in list_add()
92 (new)->prev = head; in list_add()
98 (entry)->prev = (head)->prev; in list_add_tail()
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/dist/IO/lib/IO/ |
| H A D | Handle.pm | 484 my $prev = $|;
486 $prev;
492 my $prev = $,;
494 $prev;
500 my $prev = $\;
502 $prev;
508 my $prev = $/;
510 $prev;
516 my $prev = $.;
518 $prev;
[all...] |
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-iterator.c | 94 head->prev = NULL; in tsi_link_before()
107 head->prev = cur->prev; in tsi_link_before()
108 if (head->prev) in tsi_link_before()
109 head->prev->next = head; in tsi_link_before()
113 cur->prev = tail; in tsi_link_before()
117 head->prev = STATEMENT_LIST_TAIL (i->container); in tsi_link_before()
118 if (head->prev) in tsi_link_before()
119 head->prev->next = head; in tsi_link_before()
170 head->prev = NULL; in tsi_link_after()
185 tail->next->prev = tail; in tsi_link_after()
[all …]
|
| H A D | et-forest.c | 46 struct et_occ *prev; /* Left son in the splay-tree. */ member
94 occ->prev = t; in set_prev()
118 struct et_occ *mson = occ->prev; in et_recomp_min()
147 gcc_assert (occ->prev != occ); in et_check_occ_sanity()
149 gcc_assert (!occ->next || occ->next != occ->prev); in et_check_occ_sanity()
157 if (occ->prev) in et_check_occ_sanity()
159 gcc_assert (occ->prev != occ->parent); in et_check_occ_sanity()
160 gcc_assert (occ->prev->parent == occ); in et_check_occ_sanity()
164 || occ->parent->prev == occ in et_check_occ_sanity()
174 if (occ->prev) in et_check_sanity()
[all …]
|
| /openbsd-src/usr.bin/dig/lib/dns/rdata/generic/ |
| H A D | talink_58.c | 23 dns_name_t prev; in totext_talink() local
31 dns_name_init(&prev, NULL); in totext_talink()
37 dns_name_fromregion(&prev, &dregion); in totext_talink()
38 isc_region_consume(&dregion, name_length(&prev)); in totext_talink()
43 sub = name_prefix(&prev, tctx->origin, &prefix); in totext_talink()
54 dns_name_t prev; in fromwire_talink() local
64 dns_name_init(&prev, NULL); in fromwire_talink()
67 RETERR(dns_name_fromwire(&prev, source, dctx, options, target)); in fromwire_talink()
74 dns_name_t prev; in towire_talink() local
84 dns_name_init(&prev, moffsets); in towire_talink()
[all …]
|
| /openbsd-src/usr.bin/dig/lib/isc/include/isc/ |
| H A D | list.h | 27 #define ISC_LINK(type) struct { type *prev, *next; }
30 (elt)->link.prev = (type *)(-1); \
35 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1))
44 (list).head->link.prev = (elt); \
47 (elt)->link.prev = NULL; \
66 (elt)->link.prev = (list).tail; \
82 (elt)->link.next->link.prev = (elt)->link.prev; \
85 (list).tail = (elt)->link.prev; \
87 if ((elt)->link.prev != NULL) \
88 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
|
| /openbsd-src/sys/dev/usb/dwc2/ |
| H A D | list.h | 49 struct list_head *next, *prev; member
60 (head)->prev = head; in INIT_LIST_HEAD()
70 (head)->next->prev = new; in list_add()
72 (new)->prev = head; in list_add()
78 (entry)->prev = (head)->prev; in list_add_tail()
80 (head)->prev->next = entry; in list_add_tail()
81 (head)->prev = entry; in list_add_tail()
86 (entry)->next->prev = (entry)->prev; in list_del()
87 (entry)->prev->next = (entry)->next; in list_del()
105 (entry)->next->prev = (entry)->prev; in list_del_init()
[all …]
|
| /openbsd-src/sys/dev/pci/drm/ |
| H A D | linux_list_sort.c | 155 struct list_head *prev = list; in list_sort_merge_into() local
164 (*first)->prev = prev; in list_sort_merge_into()
165 prev = prev->next = *first; in list_sort_merge_into()
175 prev->next = tail; in list_sort_merge_into()
176 tail->prev = prev; in list_sort_merge_into()
177 prev = prev->next; in list_sort_merge_into()
184 prev->next = list; in list_sort_merge_into()
185 list->prev = prev; in list_sort_merge_into()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | bb-reorder.c | 106 basic_block prev = NULL; in make_reorder_chain() local
129 prev = make_reorder_chain_1 (next, prev); in make_reorder_chain()
132 RBI (prev)->next = NULL; in make_reorder_chain()
186 make_reorder_chain_1 (bb, prev) in make_reorder_chain_1() argument
188 basic_block prev;
195 if (prev)
198 RBI (prev)->next = bb;
200 if (rtl_dump_file && prev->next_bb != bb)
202 bb->index, prev->index);
210 prev = bb;
[all …]
|
| /openbsd-src/gnu/usr.bin/binutils/gprof/ |
| H A D | cg_print.c | 166 Sym *todo, *doing, *prev; local
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next)
179 if (cmp_member (doing, prev->cg.cyc.next) == GREATERTHAN)
183 doing->cg.cyc.next = prev->cg.cyc.next;
184 prev->cg.cyc.next = doing;
317 Arc *arc, *detached, sorted, *prev; local
332 for (prev = &sorted; prev->next_parent; prev = prev->next_parent)
334 if (cmp_arc (arc, prev->next_parent) != GREATERTHAN)
338 arc->next_parent = prev->next_parent;
339 prev->next_parent = arc;
[all …]
|
| /openbsd-src/gnu/usr.bin/binutils-2.17/gprof/ |
| H A D | cg_print.c | 162 Sym *todo, *doing, *prev; in sort_members() local
173 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
175 if (cmp_member (doing, prev->cg.cyc.next) == GREATERTHAN) in sort_members()
179 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
180 prev->cg.cyc.next = doing; in sort_members()
309 Arc *arc, *detached, sorted, *prev; in sort_parents() local
324 for (prev = &sorted; prev->next_parent; prev = prev->next_parent) in sort_parents()
326 if (cmp_arc (arc, prev->next_parent) != GREATERTHAN) in sort_parents()
330 arc->next_parent = prev->next_parent; in sort_parents()
331 prev->next_parent = arc; in sort_parents()
[all …]
|
| /openbsd-src/games/atc/ |
| H A D | list.c | 65 p->next = p->prev = NULL; in append()
77 p->prev = r; in append()
80 q->prev = p; in append()
83 p->prev = NULL; in append()
84 q->prev = p; in append()
90 p->prev = l->tail; in append()
106 l->head->prev = NULL; in delete()
108 l->tail = p->prev; in delete()
111 p->prev->next = p->next; in delete()
112 p->next->prev = p->prev; in delete()
|
| /openbsd-src/gnu/llvm/lld/MachO/ |
| H A D | MarkLive.cpp | 29 const WhyLiveEntry *prev; member
31 WhyLiveEntry(InputSection *isec, const WhyLiveEntry *prev) in WhyLiveEntry()
32 : isec(isec), prev(prev) {} in WhyLiveEntry()
61 void enqueue(InputSection *isec, uint64_t off, const WorklistEntry *prev);
62 void addSym(Symbol *s, const WorklistEntry *prev);
64 WorklistEntry *makeEntry(InputSection *, const WorklistEntry *prev) const;
77 const typename MarkLiveImpl<RecordWhyLive>::WorklistEntry *prev) { in enqueue() argument
83 worklist.push_back(makeEntry(s, prev)); in enqueue()
87 static void printWhyLive(const Symbol *s, const WhyLiveEntry *prev) { in printWhyLive() argument
90 for (const WhyLiveEntry *entry = prev; entry; in printWhyLive()
[all …]
|
| /openbsd-src/sbin/unwind/libunbound/iterator/ |
| H A D | iter_scrub.c | 64 struct rrset_parse* prev, struct rrset_parse** rrset) in remove_rrset() argument
73 if(prev) in remove_rrset()
74 prev->rrset_all_next = (*rrset)->rrset_all_next; in remove_rrset()
77 msg->rrset_last = prev; in remove_rrset()
254 struct rrset_parse* rrset, struct rrset_parse* prev, in synth_cname_rrset() argument
294 if(prev) in synth_cname_rrset()
295 prev->rrset_all_next = cn; in synth_cname_rrset()
383 struct rr_parse* rr = rrset->rr_first, *prev = NULL; in scrub_normalize()
387 prev = rr; in scrub_normalize()
400 rrset->rr_last = prev; in scrub_normalize()
389 struct rrset_parse* rrset, *prev, *nsset=NULL; scrub_normalize() local
724 scrub_sanitize_rr_length(sldns_buffer * pkt,struct msg_parse * msg,struct rrset_parse * prev,struct rrset_parse ** rrset,int * added_ede,struct module_qstate * qstate) scrub_sanitize_rr_length() argument
793 struct rrset_parse* rrset, *prev; scrub_sanitize() local
[all...] |
| /openbsd-src/usr.sbin/unbound/iterator/ |
| H A D | iter_scrub.c | 64 struct rrset_parse* prev, struct rrset_parse** rrset) in remove_rrset() argument
73 if(prev) in remove_rrset()
74 prev->rrset_all_next = (*rrset)->rrset_all_next; in remove_rrset()
77 msg->rrset_last = prev; in remove_rrset()
254 struct rrset_parse* rrset, struct rrset_parse* prev, in synth_cname_rrset() argument
294 if(prev) in synth_cname_rrset()
295 prev->rrset_all_next = cn; in synth_cname_rrset()
383 struct rr_parse* rr = rrset->rr_first, *prev = NULL; in scrub_normalize()
387 prev = rr; in scrub_normalize()
400 rrset->rr_last = prev; in scrub_normalize()
389 struct rrset_parse* rrset, *prev, *nsset=NULL; scrub_normalize() local
724 scrub_sanitize_rr_length(sldns_buffer * pkt,struct msg_parse * msg,struct rrset_parse * prev,struct rrset_parse ** rrset,int * added_ede,struct module_qstate * qstate) scrub_sanitize_rr_length() argument
793 struct rrset_parse* rrset, *prev; scrub_sanitize() local
[all...] |
| /openbsd-src/gnu/usr.bin/texinfo/info/ |
| H A D | window.c | 202 if (win->prev) in window_new_screen_size()
203 win->first_row = (win->prev->first_row + win->prev->height) + 1; in window_new_screen_size()
242 if (win->prev) in window_new_screen_size()
244 (win->prev->first_row + win->prev->height) + 1; in window_new_screen_size()
320 window->prev = active_window->prev; in window_make_window()
321 active_window->prev = window; in window_make_window()
323 if (window->prev) in window_make_window()
324 window->prev->next = window; in window_make_window()
330 window->prev = active_window; in window_make_window()
334 window->next->prev = window; in window_make_window()
[all …]
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_atomic_msvc.h | 176 u8 prev = (u8)_InterlockedCompareExchange8( in atomic_compare_exchange_strong() local
179 u8 prev; in atomic_compare_exchange_strong() local
185 mov prev, al in atomic_compare_exchange_strong()
188 if (prev == cmpv) in atomic_compare_exchange_strong()
190 *cmp = prev; in atomic_compare_exchange_strong()
199 uptr prev = (uptr)_InterlockedCompareExchangePointer( in atomic_compare_exchange_strong() local
201 if (prev == cmpv) in atomic_compare_exchange_strong()
203 *cmp = prev; in atomic_compare_exchange_strong()
212 u16 prev = (u16)_InterlockedCompareExchange16( in atomic_compare_exchange_strong() local
214 if (prev == cmpv) in atomic_compare_exchange_strong()
[all …]
|
| /openbsd-src/usr.bin/less/ |
| H A D | ifile.c | 63 link_ifile(struct ifile *p, struct ifile *prev) in link_ifile() argument
68 if (prev == NULL) in link_ifile()
69 prev = &anchor; in link_ifile()
70 p->h_next = prev->h_next; in link_ifile()
71 p->h_prev = prev; in link_ifile()
72 prev->h_next->h_prev = p; in link_ifile()
73 prev->h_next = p; in link_ifile()
78 p->h_index = prev->h_index + 1; in link_ifile()
102 new_ifile(char *filename, struct ifile *prev) in new_ifile() argument
115 link_ifile(p, prev); in new_ifile()
[all …]
|
| /openbsd-src/usr.bin/rdist/ |
| H A D | gram.y | 413 struct cmd *c, *prev, *nc; in insert() local
427 for (prev = NULL, c = cmds; c!=NULL; prev = c, c = c->c_next) { in insert()
430 prev = c; in insert()
448 if (prev == NULL) in insert()
451 prev->c_next = nc; in insert()
528 struct namelist *nl, *prev; in addnl() local
532 for (prev = NULL, nl = NULL; n1; n1 = n1->n_next, prev = nl) { in addnl()
534 nl->n_next = prev; in addnl()
539 nl->n_next = prev; in addnl()
540 prev = nl; in addnl()
[all …]
|
| /openbsd-src/bin/ksh/ |
| H A D | alloc.c | 15 struct link *prev; member
54 l->prev = NULL; in alloc()
56 ap->freelist->prev = l; in alloc()
95 lprev = l->prev; in aresize()
106 lnext->prev = l2; in aresize()
120 if (l->prev) in afree()
121 l->prev->next = l->next; in afree()
125 l->next->prev = l->prev; in afree()
|
| /openbsd-src/games/boggle/mkindex/ |
| H A D | mkindex.c | 48 int clen, rlen, prev; in main() local
55 prev = '\0'; in main()
58 if (*buf != prev) { in main()
59 if (prev != '\0') in main()
60 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
61 prev = *buf; in main()
66 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
|
| /openbsd-src/usr.sbin/unbound/util/storage/ |
| H A D | dnstree.c | 122 struct addr_tree_node* prev = NULL, *p; in addr_tree_init_parents_node() local
127 if(!prev || prev->addrlen != node->addrlen) { in addr_tree_init_parents_node()
128 prev = node; in addr_tree_init_parents_node()
131 m = addr_in_common(&prev->addr, prev->net, &node->addr, in addr_tree_init_parents_node()
135 for(p = prev; p; p = p->parent) in addr_tree_init_parents_node()
143 prev = node; in addr_tree_init_parents_node()
155 struct name_tree_node* node, *prev = NULL, *p; in name_tree_init_parents() local
159 if(!prev || prev->dclass != node->dclass) { in name_tree_init_parents()
160 prev = node; in name_tree_init_parents()
163 (void)dname_lab_cmp(prev->name, prev->labs, node->name, in name_tree_init_parents()
[all …]
|
| /openbsd-src/sbin/unwind/libunbound/util/storage/ |
| H A D | dnstree.c | 122 struct addr_tree_node* prev = NULL, *p; in addr_tree_init_parents_node() local
127 if(!prev || prev->addrlen != node->addrlen) { in addr_tree_init_parents_node()
128 prev = node; in addr_tree_init_parents_node()
131 m = addr_in_common(&prev->addr, prev->net, &node->addr, in addr_tree_init_parents_node()
135 for(p = prev; p; p = p->parent) in addr_tree_init_parents_node()
143 prev = node; in addr_tree_init_parents_node()
155 struct name_tree_node* node, *prev = NULL, *p; in name_tree_init_parents() local
159 if(!prev || prev->dclass != node->dclass) { in name_tree_init_parents()
160 prev = node; in name_tree_init_parents()
163 (void)dname_lab_cmp(prev->name, prev->labs, node->name, in name_tree_init_parents()
[all …]
|
| /openbsd-src/gnu/llvm/libcxxabi/src/ |
| H A D | fallback_malloc.cpp | 132 heap_node *p, *prev; in fallback_malloc() local
140 for (p = freelist, prev = 0; p && p != list_end; in fallback_malloc()
141 prev = p, p = node_from_offset(p->next_node)) { in fallback_malloc()
173 if (prev == 0) in fallback_malloc()
176 prev->next_node = p->next_node; in fallback_malloc()
191 struct heap_node *p, *prev; in fallback_free() local
199 for (p = freelist, prev = 0; p && p != list_end; in fallback_free()
200 prev = p, p = node_from_offset(p->next_node)) { in fallback_free()
218 if (prev == 0) { in fallback_free()
222 prev->next_node = offset_from_node(cp); in fallback_free()
[all …]
|
| /openbsd-src/lib/libexpat/tests/ |
| H A D | memcheck.c | 45 struct allocation_entry *prev; member
75 entry->prev = NULL; in tracking_malloc()
78 entry->prev = alloc_tail; in tracking_malloc()
111 if (entry->prev != NULL) in tracking_free()
112 entry->prev->next = entry->next; in tracking_free()
116 entry->next->prev = entry->prev; in tracking_free()
159 entry->prev = NULL; in tracking_realloc()
162 entry->prev = alloc_tail; in tracking_realloc()
|