Home
last modified time | relevance | path

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

12345678910>>...60

/third_party/libuv/src/
H A Dqueue.h29 q->prev = q; in uv__queue_init()
33 return q == q->next || q != q->next->prev; in uv__queue_empty()
45 h->prev->next = n->next; in uv__queue_add()
46 n->next->prev = h->prev; in uv__queue_add()
47 h->prev = n->prev; in uv__queue_add()
48 h->prev->next = h; in uv__queue_add()
54 n->prev = h->prev; in uv__queue_split()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DgenericClassWithStaticFactory.js6 public prev: List<T>;
17 this.prev.next = entry;
19 entry.prev = this.prev;
20 this.prev = entry;
53 entry.prev = this;
55 entry.next.prev = entry; // entry.next.prev does not show intellisense, but entry.prev.prev doe
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dlist.h29 * contain no data. The head sentinel can be identified by its \c prev
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
55 struct exec_node *prev; member
60 exec_node() : next(NULL), prev(NULL) in exec_node()
121 n->prev = NULL; in exec_node_init()
139 return n->prev; in exec_node_get_prev_const()
145 return n->prev; in exec_node_get_prev()
151 n->next->prev = n->prev; in exec_node_remove()
152 n->prev in exec_node_remove()
[all...]
/third_party/libcoap/include/coap3/
H A Dcoap_utlist_internal.h39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
82 * to dereference its prev/next pointers, and save/restore the real head.*/
89 /* #define UTLIST_PREV(elt,list,prev) ((char*)((list)->prev)) */
90 #define UTLIST_PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*)(to); }
98 /* #define UTLIST_PREV(elt,list,prev) ((elt)->prev) */
99 #define UTLIST_PREVASGN(elt,list,to,prev) ((el
[all...]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h54 struct list_head *prev; member
64 list->next = list->prev = list; in INIT_LIST_HEAD()
79 return ((next == head) && (next == head->prev)); in list_empty_careful()
83 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
85 next->prev = prev; in __list_del()
86 WRITE_ONCE(prev->next, next); in __list_del()
93 __list_del(entry->prev, entry->next); in __list_del_entry()
100 __list_del(entry->prev, entry->next); in list_del()
107 new->next->prev in list_replace()
120 linux_list_add(struct list_head *new, struct list_head *prev, struct list_head *next) linux_list_add() argument
255 linux_list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) linux_list_splice() argument
372 hlist_add_behind(struct hlist_node *n, struct hlist_node *prev) hlist_add_behind() argument
[all...]
/third_party/libdrm/
H A Dlibdrm_lists.h36 struct _drmMMListHead *prev; member
42 (__item)->prev = (__item); \
48 (__item)->prev = (__list); \
50 (__list)->next->prev = (__item); \
57 (__item)->prev = (__list)->prev; \
58 (__list)->prev->next = (__item); \
59 (__list)->prev = (__item); \
64 (__item)->prev->next = (__item)->next; \
65 (__item)->next->prev
[all...]
H A Dutil_double_list.h43 struct list_head *prev; member
49 item->prev = item; in list_inithead()
55 item->prev = list; in list_add()
57 list->next->prev = item; in list_add()
64 item->prev = list->prev; in list_addtail()
65 list->prev->next = item; in list_addtail()
66 list->prev = item; in list_addtail()
71 to->prev = from->prev; in list_replace()
[all...]
/third_party/alsa-utils/alsactl/
H A Dlist.h36 * sometimes we already know the next/prev entries and we can
42 struct list_head *next, *prev; member
51 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
58 * the prev/next entries already!
61 struct list_head *prev, in __list_add()
64 next->prev = new; in __list_add()
66 new->prev = prev; in __list_add()
67 prev->next = new; in __list_add()
93 __list_add(new, head->prev, hea in list_add_tail()
60 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
103 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/third_party/exfatprogs/include/
H A Dlist.h28 * sometimes we already know the next/prev entries and we can
33 struct list_head *next, *prev; member
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
49 * the prev/next entries already!
52 struct list_head *prev, in __list_add()
55 next->prev = new; in __list_add()
57 new->prev = prev; in __list_add()
58 prev->next = new; in __list_add()
84 __list_add(new, head->prev, hea in list_add_tail()
51 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
94 __list_del(struct list_head *prev, struct list_head *next) __list_del() argument
[all...]
/third_party/ltp/testcases/realtime/include/
H A Dlist.h55 * sometimes we already know the next/prev entries and we can
61 struct list_head *next, *prev; member
72 list->prev = list; in INIT_LIST_HEAD()
79 * the prev/next entries already!
82 struct list_head *prev, in __list_add()
85 next->prev = new; in __list_add()
87 new->prev = prev; in __list_add()
88 prev->next = new; in __list_add()
114 __list_add(new, head->prev, hea in list_add_tail()
81 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
124 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
[all...]
/third_party/mesa3d/src/util/
H A Dlist.h49 struct list_head *prev; member
55 item->prev = item; in list_inithead()
67 item->prev = list; in list_add()
69 list->next->prev = item; in list_add()
82 item->prev = list->prev; in list_addtail()
83 list->prev->next = item; in list_addtail()
84 list->prev = item; in list_addtail()
94 to->prev = from->prev; in list_replace()
[all...]
/third_party/libinput/src/
H A Dutil-list.c37 list->prev = list; in list_init()
44 assert((list->next != NULL && list->prev != NULL) || in list_insert()
45 !"list->next|prev is NULL, possibly missing list_init()"); in list_insert()
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_insert()
47 !"elm->next|prev is not NULL, list node used twice?"); in list_insert()
49 elm->prev = list; in list_insert()
52 elm->next->prev = elm; in list_insert()
58 assert((list->next != NULL && list->prev != NULL) || in list_append()
59 !"list->next|prev is NULL, possibly missing list_init()"); in list_append()
60 assert(((elm->next == NULL && elm->prev in list_append()
[all...]
/third_party/alsa-lib/include/
H A Dlist.h22 struct list_head *prev; member
32 p->next = p->prev = p; in INIT_LIST_HEAD()
70 first->prev = p; in list_add()
72 p->prev = list; in list_add()
81 struct list_head *last = list->prev; in list_add_tail()
84 p->prev = last; in list_add_tail()
86 list->prev = p; in list_add_tail()
90 * @p: the new entry to be inserted between prev and next
91 * @prev: the left-side entry
95 struct list_head *prev, in list_insert()
94 list_insert(struct list_head *p, struct list_head *prev, struct list_head *next) list_insert() argument
[all...]
/third_party/ntfs-3g/ntfsprogs/
H A Dlist.h33 * sometimes we already know the next/prev entries and we can
38 struct ntfs_list_head *next, *prev; member
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
53 * @prev:
56 * This is only for internal list manipulation where we know the prev/next
60 struct ntfs_list_head * prev, struct ntfs_list_head * next) in __ntfs_list_add()
62 next->prev = new; in __ntfs_list_add()
64 new->prev = prev; in __ntfs_list_add()
65 prev in __ntfs_list_add()
59 __ntfs_list_add(struct ntfs_list_head * new, struct ntfs_list_head * prev, struct ntfs_list_head * next) __ntfs_list_add() argument
106 __ntfs_list_del(struct ntfs_list_head * prev, struct ntfs_list_head * next) __ntfs_list_del() argument
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dptrlist.c120 list = head->prev; in last_ptr_list()
124 list = list->prev; in last_ptr_list()
206 struct ptr_list *prev; in pack_ptr_list() local
212 prev = entry->prev; in pack_ptr_list()
213 prev->next = next; in pack_ptr_list()
214 next->prev = prev; in pack_ptr_list()
244 next->prev = newlist; in split_ptr_list_head()
245 newlist->prev in split_ptr_list_head()
467 struct ptr_list *prev = tail; copy_ptr_list() local
[all...]
/third_party/libbpf/include/linux/
H A Dlist.h18 list->prev = list; in INIT_LIST_HEAD()
22 struct list_head *prev, in __list_add()
25 next->prev = new; in __list_add()
27 new->prev = prev; in __list_add()
28 prev->next = new; in __list_add()
45 * Delete a list entry by making the prev/next entries
49 * the prev/next entries already!
51 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
53 next->prev in __list_del()
21 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
[all...]
/third_party/pulseaudio/src/pulsecore/
H A Dllist.h34 t *next, *prev
47 _item->prev = _item->next = NULL; \
56 _item->next->prev = _item; \
57 _item->prev = NULL; \
67 _item->next->prev = _item->prev; \
68 if (_item->prev) \
69 _item->prev->next = _item->next; \
74 _item->next = _item->prev = NULL; \
83 while ((*_head)->prev) \
[all...]
/third_party/libwebsockets/lib/core/
H A Dlws_dll2.c37 if (d->next || d->prev) { in lws_dll2_is_detached()
38 lwsl_err("%s: dll2 %p: detached but next %p, prev %p\n", in lws_dll2_is_detached()
39 __func__, d, d->next, d->prev); in lws_dll2_is_detached()
42 * have .owner, .next and .prev all set to NULL, so we in lws_dll2_is_detached()
46 * state of NULL .owner, but non-NULL in .next or .prev, in lws_dll2_is_detached()
80 /* if there is a next guy, set his prev ptr to our next ptr */ in lws_dll2_add_head()
82 d->next->prev = d; in lws_dll2_add_head()
84 d->prev = NULL; in lws_dll2_add_head()
121 /* we need to point back to after->prev */ in lws_dll2_add_before()
123 d->prev in lws_dll2_add_before()
[all...]
/third_party/selinux/libsepol/src/
H A Debitmap.c21 ebitmap_node_t *new, *prev; in ebitmap_or() local
27 prev = 0; in ebitmap_or()
50 if (prev) in ebitmap_or()
51 prev->next = new; in ebitmap_or()
54 prev = new; in ebitmap_or()
77 ebitmap_node_t *new, *prev = NULL; in ebitmap_and() local
95 if (prev) in ebitmap_and()
96 prev->next = new; in ebitmap_and()
99 prev = new; in ebitmap_and()
111 if (prev) in ebitmap_and()
120 ebitmap_node_t *new, *prev = NULL; ebitmap_xor() local
170 ebitmap_node_t *new, *prev = NULL; ebitmap_not() local
281 ebitmap_node_t *new, *prev; ebitmap_cpy() local
379 ebitmap_node_t *n, *prev, *new; ebitmap_set_bit() local
453 ebitmap_node_t *new, *prev = NULL; ebitmap_init_range() local
[all...]
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c77 heap->next->prev = r; in nouveau_heap_alloc()
78 r->prev = heap; in nouveau_heap_alloc()
106 new->prev = r->prev; in nouveau_heap_free()
107 if (r->prev) in nouveau_heap_free()
108 r->prev->next = new; in nouveau_heap_free()
116 if (r->prev && !r->prev->in_use) { in nouveau_heap_free()
117 r->prev->next = r->next; in nouveau_heap_free()
119 r->next->prev in nouveau_heap_free()
[all...]
/third_party/mesa3d/src/util/tests/
H A Drb_tree_test.cpp75 struct rb_test_node *prev = NULL; in validate_tree_order() local
88 assert(prev == NULL || prev < n); in validate_tree_order()
91 prev = n; in validate_tree_order()
96 prev = NULL; in validate_tree_order()
109 assert(prev == NULL || prev < n); in validate_tree_order()
112 prev = n; in validate_tree_order()
117 prev = NULL; in validate_tree_order()
130 assert(prev in validate_tree_order()
198 struct rb_node *prev = rb_node_prev(n); validate_search() local
[all...]
/third_party/node/deps/npm/node_modules/yallist/
H A Dyallist.js36 var prev = node.prev
39 next.prev = prev
42 if (prev) {
43 prev.next = next
50 this.tail = prev
55 node.prev = null
74 head.prev = node
95 node.prev
[all...]
/third_party/icu/icu4c/source/common/
H A Ducnvbocu.cpp48 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
52 * "prev" is reset for C0 controls but not for space.
55 /* initial value for "prev": middle of the ASCII range */
238 /* compute new prev */ in bocu1Prev()
261 * fromUnicodeStatus encoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
263 * toUnicodeStatus decoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
400 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
414 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
415 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
416 prev in _Bocu1FromUnicodeWithOffsets()
660 int32_t prev, c, diff; _Bocu1FromUnicode() local
964 int32_t prev, count, diff, c; _Bocu1ToUnicodeWithOffsets() local
1186 int32_t prev, count, diff, c; _Bocu1ToUnicode() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ducnvbocu.cpp48 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
52 * "prev" is reset for C0 controls but not for space.
55 /* initial value for "prev": middle of the ASCII range */
238 /* compute new prev */ in bocu1Prev()
261 * fromUnicodeStatus encoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
263 * toUnicodeStatus decoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
400 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
414 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
415 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
416 prev in _Bocu1FromUnicodeWithOffsets()
660 int32_t prev, c, diff; _Bocu1FromUnicode() local
964 int32_t prev, count, diff, c; _Bocu1ToUnicodeWithOffsets() local
1186 int32_t prev, count, diff, c; _Bocu1ToUnicode() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ducnvbocu.cpp48 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
52 * "prev" is reset for C0 controls but not for space.
55 /* initial value for "prev": middle of the ASCII range */
238 /* compute new prev */ in bocu1Prev()
261 * fromUnicodeStatus encoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
263 * toUnicodeStatus decoder's prev (0 will be interpreted as BOCU1_ASCII_PREV)
400 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
414 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
415 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
416 prev in _Bocu1FromUnicodeWithOffsets()
660 int32_t prev, c, diff; _Bocu1FromUnicode() local
964 int32_t prev, count, diff, c; _Bocu1ToUnicodeWithOffsets() local
1186 int32_t prev, count, diff, c; _Bocu1ToUnicode() local
[all...]

Completed in 14 milliseconds

12345678910>>...60