| /netbsd/src/sys/external/bsd/drm2/linux/ |
| D | linux_dma_fence_chain.c | 50 dma_fence_chain_init(struct dma_fence_chain *chain, struct dma_fence *prev, in dma_fence_chain_init() argument
53 struct dma_fence_chain *prev_chain = to_dma_fence_chain(prev); in dma_fence_chain_init()
57 chain->dfc_prev = prev; /* consume caller's reference */ in dma_fence_chain_init()
62 !__dma_fence_is_later(seqno, prev->seqno, prev->ops)) { in dma_fence_chain_init()
65 seqno = MAX(prev->seqno, seqno); in dma_fence_chain_init()
68 context = prev->context; in dma_fence_chain_init()
69 chain->prev_seqno = prev->seqno; in dma_fence_chain_init()
160 struct dma_fence *prev; in dma_fence_chain_release() local
168 while ((prev = chain->dfc_prev) != NULL) { in dma_fence_chain_release()
173 if (kref_read(&prev->refcount) > 1) in dma_fence_chain_release()
[all …]
|
| D | linux_list_sort.c | 158 struct list_head *prev = list; in list_sort_merge_into() local
167 (*first)->prev = prev; in list_sort_merge_into()
168 prev = prev->next = *first; in list_sort_merge_into()
178 prev->next = tail; in list_sort_merge_into()
179 tail->prev = prev; in list_sort_merge_into()
180 prev = prev->next; in list_sort_merge_into()
187 prev->next = list; in list_sort_merge_into()
188 list->prev = prev; in list_sort_merge_into()
|
| /netbsd/src/external/ibm-public/postfix/dist/src/global/ |
| D | tok822_tree.c | 134 t2->prev = t1; in tok822_append()
142 next->prev = t2; in tok822_append()
150 TOK822 *prev = t1->prev; in tok822_prepend() local
152 if (prev) in tok822_prepend()
153 prev->next = t2; in tok822_prepend()
154 t2->prev = prev; in tok822_prepend()
161 t1->prev = t2; in tok822_prepend()
169 TOK822 *prev = tp->prev; in tok822_cut_before() local
171 if (prev) { in tok822_cut_before()
172 prev->next = 0; in tok822_cut_before()
[all …]
|
| /netbsd/src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| D | zfs_rlock.c | 271 zfs_range_add_reader(avl_tree_t *tree, rl_t *new, rl_t *prev, avl_index_t where) in zfs_range_add_reader() argument
284 if (prev) { in zfs_range_add_reader()
285 if (prev->r_off + prev->r_len <= off) { in zfs_range_add_reader()
286 prev = NULL; in zfs_range_add_reader()
287 } else if (prev->r_off != off) { in zfs_range_add_reader()
292 prev = zfs_range_split(tree, prev, off); in zfs_range_add_reader()
293 prev = AVL_NEXT(tree, prev); /* move to rear range */ in zfs_range_add_reader()
296 ASSERT((prev == NULL) || (prev->r_off == off)); in zfs_range_add_reader()
298 if (prev) in zfs_range_add_reader()
299 next = prev; in zfs_range_add_reader()
[all …]
|
| /netbsd/src/sys/external/bsd/common/include/linux/ |
| D | list.h | 56 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
63 head->prev = head; in INIT_LIST_HEAD()
76 return head->prev; in list_last()
88 return node->prev; in list_prev()
103 if (head->next != head->prev) in list_is_singular()
111 return head == entry->prev; in list_is_first()
121 __list_add_between(struct list_head *prev, struct list_head *node, in __list_add_between() argument
124 prev->next = node; in __list_add_between()
125 node->prev = prev; in __list_add_between()
127 next->prev = node; in __list_add_between()
[all …]
|
| /netbsd/src/sys/ufs/chfs/ |
| D | chfs_vnode_cache.c | 81 struct chfs_vnode_cache** prev; in chfs_vnode_cache_add() local
89 prev = &chmp->chm_vnocache_hash[new->vno % VNODECACHE_SIZE]; in chfs_vnode_cache_add()
91 while ((*prev) && (*prev)->vno < new->vno) { in chfs_vnode_cache_add()
92 prev = &((*prev)->next); in chfs_vnode_cache_add()
94 new->next = *prev; in chfs_vnode_cache_add()
95 *prev = new; in chfs_vnode_cache_add()
103 struct chfs_vnode_cache** prev; in chfs_vnode_cache_remove() local
107 prev = &chmp->chm_vnocache_hash[old->vno % VNODECACHE_SIZE]; in chfs_vnode_cache_remove()
108 while ((*prev) && (*prev)->vno < old->vno) { in chfs_vnode_cache_remove()
109 prev = &(*prev)->next; in chfs_vnode_cache_remove()
[all …]
|
| /netbsd/src/usr.sbin/ldpd/ |
| D | conffile.c | 139 char *prev = nextline; in conf_parsefile() local
142 while (isspace((int)*prev) != 0 && prev < nextline) in conf_parsefile()
143 prev++; in conf_parsefile()
144 if (nextline - prev < 2) in conf_parsefile()
146 else if (nextline - prev > LINEMAXSIZE) in conf_parsefile()
148 memcpy(line, prev, nextline - prev); in conf_parsefile()
152 line[nextline - prev] = '\0'; in conf_parsefile()
327 char *prev = nextline; in Fneighbour() local
330 if (nextline == NULL || (size_t)(nextline - prev) > LINEMAXSIZE) in Fneighbour()
332 while (isspace((int)*prev) != 0 && prev < nextline) in Fneighbour()
[all …]
|
| /netbsd/src/sys/external/bsd/drm/dist/bsd-core/ |
| D | drm_linux_list.h | 36 struct list_head *next, *prev; member
45 (head)->prev = head; in INIT_LIST_HEAD()
55 (head)->next->prev = new; in list_add()
57 (new)->prev = head; in list_add()
63 (entry)->prev = (head)->prev; in list_add_tail()
65 (head)->prev->next = entry; in list_add_tail()
66 (head)->prev = entry; in list_add_tail()
71 (entry)->next->prev = (entry)->prev; in list_del()
72 (entry)->prev->next = (entry)->next; in list_del()
77 (entry)->next->prev = (entry)->prev; in list_del_init()
[all …]
|
| /netbsd/src/external/ibm-public/postfix/dist/src/oqmgr/ |
| D | qmgr.h | 49 head.next->peers.prev = head.prev; \
50 head.prev->peers.next = head.next; \
53 head.next->peers.prev = 0; \
54 head.prev = object; \
60 type prev = object->peers.prev; \
61 if (prev) prev->peers.next = next; \
63 if (next) next->peers.prev = prev; \
64 else head.prev = prev; \
65 object->peers.next = object->peers.prev = 0; \
70 object->peers.prev = 0; \
[all …]
|
| /netbsd/src/lib/libc/include/isc/ |
| D | list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL) \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
|
| /netbsd/src/external/bsd/libbind/dist/include/isc/ |
| D | list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL) \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
|
| /netbsd/src/external/bsd/bzip2/dist/ |
| D | format.pl | 43 my ($prev, $curr, $str);
44 $prev = ''; $curr = '';
47 print OUTFILE $prev;
48 $prev = $curr;
52 if ( $prev =~ /<programlisting>$|<screen>$/ ) {
53 chomp $prev;
54 $curr = join( '', $prev, "<![CDATA[", $curr );
55 $prev = '';
59 chomp $prev;
60 $curr = join( '', $prev, "]]>", $curr );
[all …]
|
| /netbsd/src/external/gpl3/binutils/dist/gprof/ |
| D | cg_print.c | 166 Sym *todo, *doing, *prev; in sort_members() local
177 for (prev = cyc; prev->cg.cyc.next; prev = prev->cg.cyc.next) in sort_members()
179 if (cmp_member (doing, prev->cg.cyc.next) == GREATERTHAN) in sort_members()
183 doing->cg.cyc.next = prev->cg.cyc.next; in sort_members()
184 prev->cg.cyc.next = doing; in sort_members()
313 Arc *arc, *detached, sorted, *prev; in sort_parents() local
328 for (prev = &sorted; prev->next_parent; prev = prev->next_parent) in sort_parents()
330 if (cmp_arc (arc, prev->next_parent) != GREATERTHAN) in sort_parents()
334 arc->next_parent = prev->next_parent; in sort_parents()
335 prev->next_parent = arc; in sort_parents()
[all …]
|
| /netbsd/src/external/ibm-public/postfix/dist/src/qmgr/ |
| D | qmgr.h | 53 head.next->peers.prev = head.prev; \
54 head.prev->peers.next = head.next; \
56 head.next->peers.prev = 0; \
57 head.prev = object; \
63 type _prev = object->peers.prev; \
66 if (_next) _next->peers.prev = _prev; \
67 else head.prev = _prev; \
68 object->peers.next = object->peers.prev = 0; \
72 object->peers.prev = pred; \
76 if (succ) succ->peers.prev = object; \
[all …]
|
| D | qmgr_job.c | 135 QMGR_JOB *prev, *next, *list_prev, *list_next, *unread, *current; in qmgr_job_link() local
172 for (next = 0, prev = transport->job_list.prev; prev; in qmgr_job_link()
173 next = prev, prev = prev->transport_peers.prev) { in qmgr_job_link()
174 if (prev->stack_parent == 0) { in qmgr_job_link()
175 delay = message->queued_time - prev->message->queued_time; in qmgr_job_link()
179 if (current == prev) in qmgr_job_link()
182 list_prev = prev; in qmgr_job_link()
186 for (next = 0, prev = transport->job_bytime.prev; prev; in qmgr_job_link()
187 next = prev, prev = prev->time_peers.prev) { in qmgr_job_link()
188 delay = message->queued_time - prev->message->queued_time; in qmgr_job_link()
[all …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | tree-iterator.cc | 137 head->prev = NULL; in tsi_link_before()
151 head->prev = cur->prev; in tsi_link_before()
152 if (head->prev) in tsi_link_before()
153 head->prev->next = head; in tsi_link_before()
157 cur->prev = tail; in tsi_link_before()
161 head->prev = STATEMENT_LIST_TAIL (i->container); in tsi_link_before()
162 if (head->prev) in tsi_link_before()
163 head->prev->next = head; in tsi_link_before()
214 head->prev = NULL; in tsi_link_after()
230 tail->next->prev = tail; in tsi_link_after()
[all …]
|
| D | et-forest.cc | 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 …]
|
| D | gimple-iterator.cc | 122 gcc_assert (!cur || cur->prev); in gsi_insert_seq_nodes_before()
130 first->prev = cur->prev; in gsi_insert_seq_nodes_before()
131 if (first->prev->next) in gsi_insert_seq_nodes_before()
132 first->prev->next = first; in gsi_insert_seq_nodes_before()
136 cur->prev = last; in gsi_insert_seq_nodes_before()
150 first->prev = itlast; in gsi_insert_seq_nodes_before()
243 gcc_assert (!cur || cur->prev); in gsi_insert_seq_nodes_after()
256 last->next->prev = last; in gsi_insert_seq_nodes_after()
260 first->prev = cur; in gsi_insert_seq_nodes_after()
371 gimple *prev, *next; in gsi_set_stmt() local
[all …]
|
| /netbsd/src/games/atc/ |
| D | list.c | 72 p->next = p->prev = NULL; in append()
84 p->prev = r; in append()
87 q->prev = p; in append()
90 p->prev = NULL; in append()
91 q->prev = p; in append()
97 p->prev = l->tail; in append()
113 l->head->prev = NULL; in delete()
115 l->tail = p->prev; in delete()
118 p->prev->next = p->next; in delete()
119 p->next->prev = p->prev; in delete()
|
| /netbsd/src/sys/altq/ |
| D | altq_classq.h | 128 struct mbuf *m, *m0, *prev; in _getq_tail() local
133 prev = m0; in _getq_tail()
136 prev->m_nextpkt = m->m_nextpkt; in _getq_tail()
137 if (prev == m) in _getq_tail()
140 qtail(q) = prev; in _getq_tail()
158 struct mbuf *prev = NULL; in _getq_random() local
162 prev = m; in _getq_random()
165 prev->m_nextpkt = m->m_nextpkt; in _getq_random()
167 qtail(q) = prev; in _getq_random()
177 struct mbuf *m0, *prev; in _removeq() local
[all …]
|
| /netbsd/src/external/bsd/libbind/dist/isc/ |
| D | ev_waits.c | 110 evWait *this, *prev; in evUnwait() local
118 for (prev = NULL, this = wl->first; in evUnwait()
120 prev = this, this = this->next) in evUnwait()
123 if (prev != NULL) in evUnwait()
124 prev->next = this->next; in evUnwait()
128 wl->last = prev; in evUnwait()
137 for (prev = NULL, this = ctx->waitDone.first; in evUnwait()
139 prev = this, this = this->next) in evUnwait()
142 if (prev != NULL) in evUnwait()
143 prev->next = this->next; in evUnwait()
[all …]
|
| /netbsd/src/external/bsd/wpa/dist/src/utils/ |
| 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 …]
|
| /netbsd/src/games/boggle/mkindex/ |
| D | mkindex.c | 57 int clen, rlen, prev, i; in main() local
61 prev = '\0'; in main()
64 if (*buf != prev) { in main()
71 if (prev != '\0') in main()
72 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
73 for (i = (prev ? prev + 1 : 'a'); i < *buf; i++) in main()
75 prev = *buf; in main()
80 printf("%c %6ld %6ld\n", prev, start, off - 1); in main()
81 for (i = prev + 1; i <= 'z'; i++) in main()
|
| /netbsd/src/external/bsd/wpa/dist/wpa_supplicant/ |
| D | bssid_ignore.c | 119 struct wpa_bssid_ignore *e, *prev = NULL; in wpa_bssid_ignore_del() local
127 if (prev == NULL) { in wpa_bssid_ignore_del()
130 prev->next = e->next; in wpa_bssid_ignore_del()
137 prev = e; in wpa_bssid_ignore_del()
171 struct wpa_bssid_ignore *e, *prev; in wpa_bssid_ignore_clear() local
176 prev = e; in wpa_bssid_ignore_clear()
179 " from ignore list (clear)", MAC2STR(prev->bssid)); in wpa_bssid_ignore_clear()
180 os_free(prev); in wpa_bssid_ignore_clear()
192 struct wpa_bssid_ignore *e, *prev = NULL; in wpa_bssid_ignore_update() local
205 if (prev) { in wpa_bssid_ignore_update()
[all …]
|
| /netbsd/src/usr.bin/make/ |
| D | lst.c | 40 LstNodeNew(ListNode *prev, ListNode *next, void *datum) in LstNodeNew() argument
44 ln->prev = prev; in LstNodeNew()
82 newNode = LstNodeNew(ln->prev, ln, datum); in Lst_InsertBefore()
84 if (ln->prev != NULL) in Lst_InsertBefore()
85 ln->prev->next = newNode; in Lst_InsertBefore()
86 ln->prev = newNode; in Lst_InsertBefore()
106 list->first->prev = ln; in Lst_Prepend()
139 ln->next->prev = ln->prev; in Lst_Remove()
140 if (ln->prev != NULL) in Lst_Remove()
141 ln->prev->next = ln->next; in Lst_Remove()
[all …]
|