Searched refs:prev (Results 1 - 25 of 908) sorted by relevance

1234567891011>>

/freebsd-11-stable/share/doc/usd/13.viref/
H A Dmerge.awk5 $1 == prev {
13 prev = $1;
/freebsd-11-stable/lib/libc/stdlib/
H A Dremque.c19 struct que_elem *prev, *next, *elem; local
23 prev = elem->prev;
26 if (prev != NULL)
27 prev->next = next;
29 next->prev = prev;
H A Dinsque.c23 struct que_elem *prev, *next, *elem; local
26 prev = (struct que_elem *)pred;
28 if (prev == NULL) {
29 elem->prev = elem->next = NULL;
33 next = prev->next;
36 if (next->prev != prev) {
38 " next(%p)->prev(%p) != prev(%p)\n",
39 next, next->prev, pre
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/sparc64/include/isc/
H A Datomic.h70 isc_int32_t prev, swapped; local
72 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) {
73 swapped = prev + val;
77 : "r"(p), "n"(ASI_P), "r"(prev));
78 if (swapped == prev)
82 return (prev);
90 isc_int32_t prev, swapped; local
92 for (prev = *(volatile isc_int32_t *)p; ; prev
[all...]
/freebsd-11-stable/contrib/apr/atomic/unix/
H A Dppc.c48 apr_uint32_t prev, temp; local
52 " add %1,%0,%4\n" /* add val and prev */
56 : "=&r" (prev), "=&r" (temp), "=m" (*mem)
60 return prev;
80 apr_uint32_t prev; local
89 : "=&b" (prev), "=m" (*mem)
93 return prev;
98 apr_uint32_t prev; local
106 : "=&b" (prev), "=m" (*mem)
110 return prev;
116 apr_uint32_t prev; local
135 apr_uint32_t prev; local
151 void *prev; local
184 void *prev; local
[all...]
H A Dia32.c64 unsigned char prev; local
67 : "=m" (*mem), "=qm" (prev)
71 return prev;
77 apr_uint32_t prev; local
80 : "=a" (prev)
83 return prev;
88 apr_uint32_t prev = val; local
91 : "=r" (prev), "+m" (*mem)
92 : "0" (prev));
93 return prev;
98 void *prev; local
116 void *prev; local
[all...]
H A Ds390.c42 apr_uint32_t prev = *mem, temp; local
49 : "+d" (prev), "+d" (temp), "=Q" (*mem)
53 return prev;
68 apr_uint32_t prev = *mem, temp; local
75 : "+d" (prev), "+d" (temp), "=Q" (*mem)
105 apr_uint32_t prev = *mem; local
110 : "+d" (prev), "=Q" (*mem)
114 return prev;
119 void *prev = (void *) cmp; local
122 : "+d" (prev), "
138 void *prev = (void *) *mem; local
[all...]
/freebsd-11-stable/usr.bin/mkuzip/
H A Dmkuz_blk_chain.h34 struct mkuz_bchain_link *prev; member in struct:mkuz_bchain_link
/freebsd-11-stable/sys/netpfil/ipfw/test/
H A Dmylist.h11 struct list_head *prev, *next; member in struct:list_head
14 #define INIT_LIST_HEAD(l) do { (l)->prev = (l)->next = (l); } while (0)
17 __list_add(struct list_head *o, struct list_head *prev, argument
20 next->prev = o;
22 o->prev = prev;
23 prev->next = o;
29 __list_add(o, head->prev, head);
36 __list_del(struct list_head *prev, struct list_head *next) argument
38 next->prev
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/ia64/include/isc/
H A Datomic.h39 isc_int32_t prev, swapped; local
41 for (prev = *(volatile isc_int32_t *)p; ; prev = swapped) {
42 swapped = prev + val;
47 : "r" (prev), "r" (swapped), "m" (*p)
49 if (swapped == prev)
53 return (prev);
/freebsd-11-stable/sys/dev/hpt27xx/
H A Dlist.h41 struct list_head *next, *prev; member in struct:list_head
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_head * next) argument
48 next->prev = _new;
50 _new->prev = prev;
51 prev->next = _new;
61 __list_add(_new, head->prev, head);
64 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument
66 next->prev
[all...]
/freebsd-11-stable/sys/dev/hptnr/
H A Dlist.h40 struct list_head *next, *prev; member in struct:list_head
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_head * next) argument
47 next->prev = _new;
49 _new->prev = prev;
50 prev->next = _new;
60 __list_add(_new, head->prev, head);
63 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument
65 next->prev
[all...]
/freebsd-11-stable/sys/dev/hptrr/
H A Dlist.h43 struct list_head *next, *prev; member in struct:list_head
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_head * next) argument
50 next->prev = _new;
52 _new->prev = prev;
53 prev->next = _new;
63 __list_add(_new, head->prev, head);
66 static HPT_INLINE void __list_del(struct list_head * prev, struct list_head * next) argument
68 next->prev
[all...]
/freebsd-11-stable/sys/dev/vxge/include/
H A Dvxge-list.h40 * @prev: Previous list item.
46 struct vxge_list_t *prev; member in struct:vxge_list_t
62 header->prev = header;
92 vxge_assert(header->prev != NULL);
111 vxge_assert(item->prev != NULL);
113 item->next->prev = item->prev;
114 item->prev->next = item->next;
116 item->next = item->prev = NULL;
137 new_item->prev
[all...]
/freebsd-11-stable/contrib/unbound/services/
H A Doutbound_list.c71 list->first->prev = e;
73 e->prev = NULL;
84 e->next->prev = e->prev;
85 if(e->prev)
86 e->prev->next = e->next;
/freebsd-11-stable/sys/dev/drm/
H A Ddrm_linux_list.h39 struct list_head *next, *prev; member in struct:list_head
48 (head)->prev = head;
58 (head)->next->prev = new;
60 (new)->prev = head;
66 (entry)->prev = (head)->prev;
68 (head)->prev->next = entry;
69 (head)->prev = entry;
74 (entry)->next->prev = (entry)->prev;
[all...]
/freebsd-11-stable/sys/i386/include/xen/
H A Dsynch_bitops.h75 unsigned long prev; local
79 : "=a"(prev)
83 return prev;
86 : "=a"(prev)
90 return prev;
94 : "=a"(prev)
98 return prev;
101 : "=a"(prev)
105 return prev;
109 : "=a"(prev)
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/x86_32/include/isc/
H A Datomic.h32 isc_int32_t prev = val; local
39 :"=q"(prev)
40 :"m"(*p), "0"(prev)
43 return (prev);
49 isc_int64_t prev = val; local
56 :"=q"(prev)
57 :"m"(*p), "0"(prev)
60 return (prev);
/freebsd-11-stable/sys/dev/nxge/include/
H A Dxge-list.h38 * @prev: Previous list item.
44 struct xge_list_t* prev; member in struct:xge_list_t
58 header->prev = header;
88 xge_assert(header->prev != NULL);
107 xge_assert(item->prev != NULL);
109 item->next->prev = item->prev;
110 item->prev->next = item->next;
112 item->next = item->prev = NULL;
133 new_item->prev
[all...]
/freebsd-11-stable/lib/libc/include/isc/
H A Dlist.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 !
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dtree-iterator.c94 head->prev = NULL;
107 head->prev = cur->prev;
108 if (head->prev)
109 head->prev->next = head;
113 cur->prev = tail;
117 head->prev = STATEMENT_LIST_TAIL (i->container);
118 if (head->prev)
119 head->prev->next = head;
170 head->prev
221 struct tree_statement_list_node *cur, *next, *prev; local
275 struct tree_statement_list_node *cur, *prev; local
[all...]
/freebsd-11-stable/sys/amd64/include/xen/
H A Dsynch_bitops.h75 unsigned long prev; local
79 : "=a"(prev)
83 return prev;
86 : "=a"(prev)
90 return prev;
93 : "=a"(prev)
97 return prev;
100 : "=a"(prev)
104 return prev;
/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dtabtest.c73 int i, prev = -1, bad = 0; local
80 if ((*tmp)->ext_nid < prev)
82 prev = (*tmp)->ext_nid;
/freebsd-11-stable/contrib/wpa/src/utils/
H A Dlist.h17 struct dl_list *prev; member in struct:dl_list
25 list->prev = list;
31 item->prev = list;
32 list->next->prev = item;
38 dl_list_add(list->prev, item);
43 item->next->prev = item->prev;
44 item->prev->next = item->next;
46 item->prev = NULL;
76 dl_list_entry((list)->prev, typ
[all...]
/freebsd-11-stable/sys/compat/linuxkpi/common/include/linux/
H A Drculist.h40 #define list_prev_rcu(head) (*((struct list_head **)(&(head)->prev)))
48 linux_list_add_rcu(struct list_head *new, struct list_head *prev, argument
52 new->prev = prev;
53 rcu_assign_pointer(list_next_rcu(prev), new);
54 next->prev = new;
66 linux_list_add_rcu(new, head->prev, head);
70 __list_del_rcu(struct list_head *prev, struct list_head *next) argument
72 next->prev = prev;
93 hlist_add_behind_rcu(struct hlist_node *n, struct hlist_node *prev) argument
[all...]

Completed in 204 milliseconds

1234567891011>>