Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 2031) sorted by relevance

12345678910>>...82

/netbsd-src/external/gpl2/libmalloc/dist/
H A Dfree.c45 struct list *prev, *next; local
64 i = _heapinfo[i].free.prev;
70 i = _heapinfo[i].free.prev;
85 _heapinfo[block].free.prev = i;
87 _heapinfo[_heapinfo[block].free.next].free.prev = block;
100 _heapinfo[_heapinfo[block].free.next].free.prev = block;
112 _heapinfo[_heapinfo[block].free.prev].free.next
114 _heapinfo[_heapinfo[block].free.next].free.prev
115 = _heapinfo[block].free.prev;
116 block = _heapinfo[block].free.prev;
[all …]
H A Dralloc.c143 struct heap *prev; member
176 struct bp *prev; member
202 for (heap = last_heap; heap; heap = heap->prev)
238 for (heap = last_heap; heap; heap = heap->prev)
281 new_heap->prev = last_heap;
321 for (h = last_heap; h && break_value < h->end; h = h->prev) in relinquish()
342 last_heap = last_heap->prev; in relinquish()
419 new_bloc->prev = last_bloc;
426 new_bloc->prev = NIL_BLOC;
500 bloc_ptr prev, next; local
[all …]
H A Dgmalloc.c166 __malloc_size_t prev; /* Index of previous free cluster. */ member
190 struct list *prev; member
451 _heapinfo[0].free.next = _heapinfo[0].free.prev = 0; in initialize()
565 next->prev->next = next->next;
567 next->next->prev = next->prev;
593 next->prev = &_fraghead[log];
594 next->prev->next = next;
596 next->next->prev = next;
626 block = _heapinfo[0].free.prev;
635 block = _heapinfo[0].free.prev;
[all …]
/netbsd-src/sys/external/bsd/drm2/linux/
H A Dlinux_dma_fence_chain.c50 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 …]
/netbsd-src/external/ibm-public/postfix/dist/src/global/
H A Dtok822_tree.c134 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/
H A Dzfs_rlock.c271 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/
H A Dlist.h56 #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/external/gpl3/binutils.old/dist/gprofng/src/
H A DHeapMap.cc92 HeapObj *prev = NULL; in allocate() local
101 if (prev == NULL) in allocate()
104 prev->next = incoming; in allocate()
115 prev = next; in allocate()
125 HeapObj *prev = NULL; in deallocate() local
134 if (prev == NULL) in deallocate()
137 prev->next = cur->next; in deallocate()
141 prev = cur; in deallocate()
226 HeapObj *prev = mmaps; in process() local
227 HeapObj *cur = prev->next; in process()
[all …]
/netbsd-src/external/gpl3/binutils/dist/gprofng/src/
H A DHeapMap.cc92 HeapObj *prev = NULL; in allocate() local
101 if (prev == NULL) in allocate()
104 prev->next = incoming; in allocate()
115 prev = next; in allocate()
125 HeapObj *prev = NULL; in deallocate() local
134 if (prev == NULL) in deallocate()
137 prev->next = cur->next; in deallocate()
141 prev = cur; in deallocate()
226 HeapObj *prev = mmaps; in process() local
227 HeapObj *cur = prev->next; in process()
[all …]
/netbsd-src/sys/ufs/chfs/
H A Dchfs_vnode_cache.c81 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/
H A Dconffile.c139 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/external/gpl3/gcc/dist/gcc/d/dmd/
H A Dstmtstate.d27 StmtState* prev; in StmtState() local
38 this(StmtState* prev, Statement statement) in StmtState()
40 this.prev = prev; in StmtState()
42 if (prev) in StmtState()
43 this.tryBlock = prev.tryBlock; in StmtState()
53 for (bc = &this; bc; bc = bc.prev) in StmtState()
64 if (bc.statement == related && bc.prev.ident == ident) in StmtState()
70 for (bc = &this; bc; bc = bc.prev) in StmtState()
85 for (bc = &this; bc; bc = bc.prev) in StmtState()
95 if (bc.prev && bc.prev.ident == ident) in StmtState()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/
H A Dlist.h113 struct list_head *next, *prev; member
132 list->next = list->prev = list; in INIT_LIST_HEAD()
137 struct list_head *prev, struct list_head *next) in __list_add() argument
139 next->prev = entry; in __list_add()
141 entry->prev = prev; in __list_add()
142 prev->next = entry; in __list_add()
184 __list_add(entry, head->prev, head); in list_add_tail()
188 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
190 next->prev = prev; in __list_del()
191 prev->next = next; in __list_del()
[all …]
/netbsd-src/sys/external/bsd/drm/dist/bsd-core/
H A Ddrm_linux_list.h36 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/
H A Dqmgr.h49 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/external/bsd/libbind/dist/include/isc/
H A Dlist.h28 #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/lib/libc/include/isc/
H A Dlist.h28 #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/
H A Dformat.pl43 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.old/dist/gprof/
H A Dcg_print.c166 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/gpl3/binutils/dist/gprof/
H A Dcg_print.c166 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/
H A Dqmgr.h53 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 …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-iterator.cc137 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 …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-iterator.c137 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 …]
/netbsd-src/external/mpl/dhcp/bind/dist/lib/isc/include/isc/
H A Dlist.h28 .prev = ISC_LINK_TOMBSTONE(type), \
51 type *prev, *next; \
55 (elt)->link.prev = ISC_LINK_TOMBSTONE(type); \
60 ((type *)((elt)->link.prev) != ISC_LINK_TOMBSTONE(type))
70 (list).head->link.prev = (elt); \
74 (elt)->link.prev = NULL; \
95 (elt)->link.prev = (list).tail; \
112 (elt)->link.next->link.prev = (elt)->link.prev; \
115 (list).tail = (elt)->link.prev; \
117 if ((elt)->link.prev != NULL) { \
[all …]
/netbsd-src/external/mpl/bind/dist/lib/isc/include/isc/
H A Dlist.h29 .prev = ISC_LINK_TOMBSTONE(type), \
52 type *prev, *next; \
56 (elt)->link.prev = ISC_LINK_TOMBSTONE(type); \
61 ((type *)((elt)->link.prev) != ISC_LINK_TOMBSTONE(type))
71 (list).head->link.prev = (elt); \
75 (elt)->link.prev = NULL; \
96 (elt)->link.prev = (list).tail; \
113 (elt)->link.next->link.prev = (elt)->link.prev; \
116 (list).tail = (elt)->link.prev; \
[all...]

12345678910>>...82