Home
last modified time | relevance | path

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

12345678910>>...36

/NextBSD/sys/sys/mach/
HDqueue.h123 struct queue_entry *prev; /* previous element */ member
182 elt->prev = que; in enqueue_head()
183 elt->next->prev = elt; in enqueue_head()
193 elt->prev = que->prev; in enqueue_tail()
194 elt->prev->next = elt; in enqueue_tail()
195 que->prev = elt; in enqueue_tail()
206 elt->next->prev = que; in dequeue_head()
219 if (que->prev != que) { in dequeue_tail()
220 elt = que->prev; in dequeue_tail()
221 elt->prev->next = que; in dequeue_tail()
[all …]
/NextBSD/contrib/apr/atomic/unix/
HDppc.c44 apr_uint32_t prev, temp; in apr_atomic_add32() local
52 : "=&r" (prev), "=&r" (temp), "=m" (*mem) in apr_atomic_add32()
56 return prev; in apr_atomic_add32()
76 apr_uint32_t prev; in apr_atomic_inc32() local
85 : "=&b" (prev), "=m" (*mem) in apr_atomic_inc32()
89 return prev; in apr_atomic_inc32()
94 apr_uint32_t prev; in apr_atomic_dec32() local
102 : "=&b" (prev), "=m" (*mem) in apr_atomic_dec32()
106 return prev; in apr_atomic_dec32()
112 apr_uint32_t prev; in apr_atomic_cas32() local
[all …]
HDia32.c60 unsigned char prev; in apr_atomic_dec32() local
63 : "=m" (*mem), "=qm" (prev) in apr_atomic_dec32()
67 return prev; in apr_atomic_dec32()
73 apr_uint32_t prev; in apr_atomic_cas32() local
76 : "=a" (prev) in apr_atomic_cas32()
79 return prev; in apr_atomic_cas32()
84 apr_uint32_t prev = val; in apr_atomic_xchg32() local
87 : "=r" (prev), "+m" (*mem) in apr_atomic_xchg32()
88 : "0" (prev)); in apr_atomic_xchg32()
89 return prev; in apr_atomic_xchg32()
[all …]
HDs390.c38 apr_uint32_t prev = *mem, temp; in atomic_add() local
45 : "+d" (prev), "+d" (temp), "=Q" (*mem) in atomic_add()
49 return prev; in atomic_add()
64 apr_uint32_t prev = *mem, temp; in atomic_sub() local
71 : "+d" (prev), "+d" (temp), "=Q" (*mem) in atomic_sub()
101 apr_uint32_t prev = *mem; in apr_atomic_xchg32() local
106 : "+d" (prev), "=Q" (*mem) in apr_atomic_xchg32()
110 return prev; in apr_atomic_xchg32()
115 void *prev = (void *) cmp; in apr_atomic_casptr() local
118 : "+d" (prev), "=Q" (*mem) in apr_atomic_casptr()
[all …]
/NextBSD/sys/dev/drm2/
HDdrm_linux_list.h39 struct list_head *next, *prev; member
48 (head)->prev = head; in INIT_LIST_HEAD()
63 (head)->next->prev = new; in list_add()
65 (new)->prev = head; in list_add()
71 (entry)->prev = (head)->prev; in list_add_tail()
73 (head)->prev->next = entry; in list_add_tail()
74 (head)->prev = entry; in list_add_tail()
79 (entry)->next->prev = (entry)->prev; in list_del()
80 (entry)->prev->next = (entry)->next; in list_del()
87 new->next->prev = new; in list_replace()
[all …]
/NextBSD/contrib/libucl/uthash/
HDutlist.h88 #define _PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to);… argument
96 #define _PREVASGN(elt,list,to,prev) ((elt)->prev)=(to) argument
169 DL_SORT2(list, cmp, prev, next)
171 #define DL_SORT2(list, cmp, prev, next) \ argument
215 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
220 _CASTASGN(list->prev, _ls_tail); \
231 CDL_SORT2(list, cmp, prev, next)
233 #define CDL_SORT2(list, cmp, prev, next) \ argument
290 _SV(_ls_e,list); _PREVASGN(_ls_e,list,_ls_tail,prev); _RS(list); \
295 _CASTASGN(list->prev,_ls_tail); \
[all …]
/NextBSD/crypto/openssh/
HDmonitor_mm.c217 struct mm_share *mms, *prev, tmp; in mm_free() local
233 prev = mms; in mm_free()
234 if (RB_LEFT(prev, next)) { in mm_free()
235 prev = RB_LEFT(prev, next); in mm_free()
236 while (RB_RIGHT(prev, next)) in mm_free()
237 prev = RB_RIGHT(prev, next); in mm_free()
239 if (RB_PARENT(prev, next) && in mm_free()
240 (prev == RB_RIGHT(RB_PARENT(prev, next), next))) in mm_free()
241 prev = RB_PARENT(prev, next); in mm_free()
243 while (RB_PARENT(prev, next) && in mm_free()
[all …]
/NextBSD/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
HDzfs_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 …]
/NextBSD/tools/tools/drm/radeon/mkregtable/
HDmkregtable.c45 struct list_head *next, *prev; member
56 list->prev = list; in INIT_LIST_HEAD()
67 struct list_head *prev, struct list_head *next) in __list_add() argument
69 next->prev = new; in __list_add()
71 new->prev = prev; in __list_add()
72 prev->next = new; in __list_add()
76 struct list_head *prev, struct list_head *next);
102 __list_add(new, head->prev, head); in list_add_tail()
112 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
114 next->prev = prev; in __list_del()
[all …]
/NextBSD/contrib/gcc/
HDtree-iterator.c94 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 …]
HDet-forest.c46 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 …]
/NextBSD/lib/libc/stdlib/
HDinsque.c23 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()
/NextBSD/sys/netpfil/ipfw/test/
HDmylist.h10 struct list_head *prev, *next; member
13 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0)
16 __list_add(struct list_head *o, struct list_head *prev, in __list_add() argument
19 next->prev = o; in __list_add()
21 o->prev = prev; in __list_add()
22 prev->next = o; in __list_add()
28 __list_add(o, head->prev, head); in list_add_tail()
35 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
37 next->prev = prev; in __list_del()
38 prev->next = next; in __list_del()
[all …]
/NextBSD/sys/contrib/vchiq/interface/compat/
HDlist.h60 struct list_head *prev; member
64 #define LIST_HEAD_INIT(name) { .prev = &(name), .next = &(name) }
69 head->prev = head; in INIT_LIST_HEAD()
82 return head->prev; in list_last()
94 return node->prev; in list_prev()
109 if (head->next != head->prev) in list_is_singular()
115 __list_add_between(struct list_head *prev, struct list_head *node, in __list_add_between() argument
118 prev->next = node; in __list_add_between()
119 node->prev = prev; in __list_add_between()
121 next->prev = node; in __list_add_between()
[all …]
/NextBSD/sys/dev/hpt27xx/
HDlist.h41 struct list_head *next, *prev; member
44 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
46 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
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()
64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
66 next->prev = prev; in __list_del()
67 prev->next = next; in __list_del()
[all …]
/NextBSD/sys/dev/hptrr/
HDlist.h43 struct list_head *next, *prev; member
46 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
48 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
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()
66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
68 next->prev = prev; in __list_del()
69 prev->next = next; in __list_del()
[all …]
/NextBSD/sys/dev/hptnr/
HDlist.h40 struct list_head *next, *prev; member
43 #define INIT_LIST_HEAD(ptr) do { (ptr)->next = (ptr); (ptr)->prev = (ptr); } while (0)
45 static HPT_INLINE void __list_add(struct list_head * _new, struct list_head * prev, struct list_hea… in __list_add() argument
47 next->prev = _new; in __list_add()
49 _new->prev = prev; in __list_add()
50 prev->next = _new; in __list_add()
60 __list_add(_new, head->prev, head); in list_add_tail()
63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
65 next->prev = prev; in __list_del()
66 prev->next = next; in __list_del()
[all …]
/NextBSD/contrib/apr-util/misc/
HDapr_rmm.c54 apr_rmm_off_t prev; member
79 apr_rmm_off_t prev = 0; in find_block_by_offset() local
89 return includes ? prev : 0; in find_block_by_offset()
91 prev = next; in find_block_by_offset()
94 return includes ? prev : 0; in find_block_by_offset()
129 new->prev = best; in find_block_of_size()
136 blk->prev = best + size; in find_block_of_size()
148 if (blk->prev) { in move_block()
149 struct rmm_block_t *prev = (rmm_block_t*)((char*)rmm->base + blk->prev); in move_block() local
150 prev->next = blk->next; in move_block()
[all …]
/NextBSD/sys/dev/drm/
HDdrm_linux_list.h39 struct list_head *next, *prev; member
48 (head)->prev = head; in INIT_LIST_HEAD()
58 (head)->next->prev = new; in list_add()
60 (new)->prev = head; in list_add()
66 (entry)->prev = (head)->prev; in list_add_tail()
68 (head)->prev->next = entry; in list_add_tail()
69 (head)->prev = entry; in list_add_tail()
74 (entry)->next->prev = (entry)->prev; in list_del()
75 (entry)->prev->next = (entry)->next; in list_del()
80 (entry)->next->prev = (entry)->prev; in list_del_init()
[all …]
/NextBSD/sys/x86/iommu/
HDintel_gas.c211 struct dmar_map_entry *prev, *found; in dmar_gas_rb_insert() local
215 prev = RB_PREV(dmar_gas_entries_tree, &domain->rb_root, entry); in dmar_gas_rb_insert()
216 if (prev != NULL) in dmar_gas_rb_insert()
217 dmar_gas_fix_free(domain, prev); in dmar_gas_rb_insert()
224 struct dmar_map_entry *prev; in dmar_gas_rb_remove() local
226 prev = RB_PREV(dmar_gas_entries_tree, &domain->rb_root, entry); in dmar_gas_rb_remove()
228 if (prev != NULL) in dmar_gas_rb_remove()
229 dmar_gas_fix_free(domain, prev); in dmar_gas_rb_remove()
306 dmar_gas_match_one(struct dmar_gas_match_args *a, struct dmar_map_entry *prev, in dmar_gas_match_one() argument
315 if (a->entry->start < prev->end + DMAR_PAGE_SIZE || in dmar_gas_match_one()
[all …]
/NextBSD/contrib/ntp/lib/isc/sparc64/include/isc/
HDatomic.h70 isc_int32_t prev, swapped; in isc_atomic_xadd() local
72 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { in isc_atomic_xadd()
73 swapped = prev + val; in isc_atomic_xadd()
77 : "r"(p), "n"(ASI_P), "r"(prev)); in isc_atomic_xadd()
78 if (swapped == prev) in isc_atomic_xadd()
82 return (prev); in isc_atomic_xadd()
90 isc_int32_t prev, swapped; in isc_atomic_store() local
92 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) { in isc_atomic_store()
97 : "r"(p), "n"(ASI_P), "r"(prev) in isc_atomic_store()
99 if (swapped == prev) in isc_atomic_store()
/NextBSD/sys/dev/vxge/include/
HDvxge-list.h46 struct vxge_list_t *prev; member
62 header->prev = header; in vxge_list_init()
92 vxge_assert(header->prev != NULL); in vxge_list_first_get()
111 vxge_assert(item->prev != NULL); in vxge_list_remove()
113 item->next->prev = item->prev; in vxge_list_remove()
114 item->prev->next = item->next; in vxge_list_remove()
116 item->next = item->prev = NULL; in vxge_list_remove()
137 new_item->prev = prev_item; in vxge_list_insert()
138 prev_item->next->prev = new_item; in vxge_list_insert()
157 new_item->prev = next_item->prev; in vxge_list_insert_before()
[all …]
/NextBSD/lib/libc/include/isc/
HDlist.h33 #define LINK(type) struct { type *prev, *next; }
36 (elt)->link.prev = (type *)(-1); \
41 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
52 (list).head->link.prev = (elt); \
55 (elt)->link.prev = NULL; \
67 (elt)->link.prev = (list).tail; \
76 (elt)->link.next->link.prev = (elt)->link.prev; \
79 (list).tail = (elt)->link.prev; \
81 if ((elt)->link.prev != NULL) \
82 (elt)->link.prev->link.next = (elt)->link.next; \
[all …]
/NextBSD/contrib/gdb/gdb/
HDframe.c127 struct frame_info *prev; /* up, outer, older */ member
953 struct frame_info *frame = next_frame->prev; in legacy_saved_regs_prev_register()
1267 struct frame_info *prev; in legacy_get_prev_frame() local
1280 prev = FRAME_OBSTACK_ZALLOC (struct frame_info); in legacy_get_prev_frame()
1281 prev->level = this_frame->level + 1; in legacy_get_prev_frame()
1292 prev->next = this_frame; in legacy_get_prev_frame()
1304 prev->type = UNKNOWN_FRAME; in legacy_get_prev_frame()
1307 prev->this_id.p = 1; in legacy_get_prev_frame()
1330 deprecated_update_frame_pc_hack (prev, frame_pc_unwind (this_frame)); in legacy_get_prev_frame()
1331 if (get_frame_pc (prev) == 0) in legacy_get_prev_frame()
[all …]
/NextBSD/sys/compat/linuxkpi/common/include/linux/
HDlist.h77 struct list_head *prev; member
84 list->next = list->prev = list; in INIT_LIST_HEAD()
98 entry->next->prev = entry->prev; in list_del()
99 entry->prev->next = entry->next; in list_del()
106 new->next->prev = new; in list_replace()
107 new->prev = old->prev; in list_replace()
108 new->prev->next = new; in list_replace()
112 _list_add(struct list_head *new, struct list_head *prev, in _list_add() argument
116 next->prev = new; in _list_add()
118 new->prev = prev; in _list_add()
[all …]

12345678910>>...36