| /third_party/typescript/tests/baselines/reference/ |
| D | genericClassWithStaticFactory.js | 6 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 does
63 entry.prev = this;
65 … entry.next.prev = entry; // entry.next.prev does not show intellisense, but entry.prev.prev does
79 this.prev.next = entry;
81 entry.prev = this.prev;
[all …]
|
| D | genericClassWithStaticFactory.types | 11 public prev: List<T>;
12 >prev : List<T>
45 this.prev.next = entry;
46 >this.prev.next = entry : List<T>
47 >this.prev.next : List<T>
48 >this.prev : List<T>
50 >prev : List<T>
61 entry.prev = this.prev;
62 >entry.prev = this.prev : List<T>
63 >entry.prev : List<T>
[all …]
|
| D | genericClassWithStaticFactory.symbols | 14 public prev: List<T>;
15 >prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
54 this.prev.next = entry;
55 >this.prev.next : Symbol(List.next, Decl(genericClassWithStaticFactory.ts, 2, 26))
56 >this.prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
58 >prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
68 entry.prev = this.prev;
69 >entry.prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
71 >prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
72 >this.prev : Symbol(List.prev, Decl(genericClassWithStaticFactory.ts, 3, 29))
[all …]
|
| /third_party/mesa3d/src/compiler/glsl/ |
| D | list.h | 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->next = n->next; in exec_node_remove()
154 n->prev = NULL; in exec_node_remove()
161 n->prev = n; in exec_node_self_link()
168 after->prev = n; in exec_node_insert_after()
[all …]
|
| /third_party/libcoap/include/coap3/ |
| D | coap_utlist_internal.h | 90 #define UTLIST_PREVASGN(elt,list,to,prev) { char **_alias = (char**)&((list)->prev); *_alias=(char*… argument
99 #define UTLIST_PREVASGN(elt,list,to,prev) ((elt)->prev)=(to) argument
173 DL_SORT2(list, cmp, prev, next)
175 #define DL_SORT2(list, cmp, prev, next) \ argument
220 UTLIST_SV(_ls_e,list); UTLIST_PREVASGN(_ls_e,list,_ls_tail,prev); UTLIST_RS(list); \
225 UTLIST_CASTASGN((list)->prev, _ls_tail); \
236 CDL_SORT2(list, cmp, prev, next)
238 #define CDL_SORT2(list, cmp, prev, next) \ argument
295 UTLIST_SV(_ls_e,list); UTLIST_PREVASGN(_ls_e,list,_ls_tail,prev); UTLIST_RS(list); \
300 UTLIST_CASTASGN((list)->prev,_ls_tail); \
[all …]
|
| /third_party/gstreamer/gstplugins_good/tests/check/elements/ |
| D | rtptimerqueue.c | 59 fail_unless (timer10->list.prev == (GList *) timer0); in GST_START_TEST()
61 fail_unless (timer0->list.prev == NULL); in GST_START_TEST()
71 RtpTimer *timer, *next, *prev; in GST_START_TEST() local
82 prev = (RtpTimer *) timer->list.prev; in GST_START_TEST()
83 fail_unless (prev == NULL); in GST_START_TEST()
91 prev = (RtpTimer *) timer->list.prev; in GST_START_TEST()
92 fail_if (prev == NULL); in GST_START_TEST()
93 fail_unless_equals_int (2, prev->seqnum); in GST_START_TEST()
100 prev = (RtpTimer *) timer->list.prev; in GST_START_TEST()
101 fail_if (prev == NULL); in GST_START_TEST()
[all …]
|
| /third_party/mesa3d/src/util/ |
| D | list.h | 49 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()
96 from->next->prev = to; in list_replace()
97 from->prev->next = to; in list_replace()
[all …]
|
| /third_party/typescript/tests/cases/compiler/ |
| D | genericClassWithStaticFactory.ts | 5 public prev: List<T>; property in List
16 this.prev.next = entry;
18 entry.prev = this.prev;
19 this.prev = entry;
52 entry.prev = this;
54 … entry.next.prev = entry; // entry.next.prev does not show intellisense, but entry.prev.prev does
62 entry.prev = this;
64 … entry.next.prev = entry; // entry.next.prev does not show intellisense, but entry.prev.prev does
78 this.prev.next = entry;
80 entry.prev = this.prev;
[all …]
|
| /third_party/libdrm/ |
| D | libdrm_lists.h | 36 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 = (__item)->prev; \
70 (__item)->prev->next = (__item)->next; \
[all …]
|
| D | util_double_list.h | 43 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()
73 from->next->prev = to; in list_replace()
74 from->prev->next = to; in list_replace()
[all …]
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | list.h | 56 struct list_head *prev; member
66 list->next = list->prev = list; in INIT_LIST_HEAD()
81 return ((next == head) && (next == head->prev)); in list_empty_careful()
85 __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
87 next->prev = prev; in __list_del()
88 WRITE_ONCE(prev->next, next); in __list_del()
95 __list_del(entry->prev, entry->next); in __list_del_entry()
102 __list_del(entry->prev, entry->next); in list_del()
109 new->next->prev = new; in list_replace()
110 new->prev = old->prev; in list_replace()
[all …]
|
| /third_party/libinput/src/ |
| D | util-list.c | 37 list->prev = list; in list_init()
44 assert((list->next != NULL && list->prev != NULL) || in list_insert()
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || 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()
60 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_append()
64 elm->prev = list->prev; in list_append()
65 list->prev = elm; in list_append()
66 elm->prev->next = elm; in list_append()
[all …]
|
| /third_party/alsa-utils/alsactl/ |
| D | list.h | 42 struct list_head *next, *prev; member
51 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
61 struct list_head *prev, in __list_add() argument
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, head); in list_add_tail()
103 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
105 next->prev = prev; in __list_del()
106 prev->next = next; in __list_del()
[all …]
|
| /third_party/ltp/testcases/realtime/include/ |
| D | list.h | 61 struct list_head *next, *prev; member
72 list->prev = list; in INIT_LIST_HEAD()
82 struct list_head *prev, in __list_add() argument
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, head); in list_add_tail()
124 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
126 next->prev = prev; in __list_del()
127 prev->next = next; in __list_del()
[all …]
|
| /third_party/exfatprogs/include/ |
| D | list.h | 33 struct list_head *next, *prev; member
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
52 struct list_head *prev, in __list_add() argument
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, head); in list_add_tail()
94 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
96 next->prev = prev; in __list_del()
97 prev->next = next; in __list_del()
[all …]
|
| /third_party/ntfs-3g/ntfsprogs/ |
| D | list.h | 38 struct ntfs_list_head *next, *prev; member
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
60 struct ntfs_list_head * prev, struct ntfs_list_head * next) in __ntfs_list_add() argument
62 next->prev = new; in __ntfs_list_add()
64 new->prev = prev; in __ntfs_list_add()
65 prev->next = new; in __ntfs_list_add()
93 __ntfs_list_add(new, head->prev, head); in ntfs_list_add_tail()
106 static __inline__ void __ntfs_list_del(struct ntfs_list_head * prev, in __ntfs_list_del() argument
109 next->prev = prev; in __ntfs_list_del()
110 prev->next = next; in __ntfs_list_del()
[all …]
|
| /third_party/alsa-lib/include/ |
| D | list.h | 22 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()
95 struct list_head *prev, in list_insert() argument
98 next->prev = p; in list_insert()
100 p->prev = prev; in list_insert()
[all …]
|
| /third_party/node/deps/npm/node_modules/yallist/ |
| D | yallist.js | 36 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 = tail
127 this.tail = this.tail.prev
145 this.head.prev = null
[all …]
|
| /third_party/pulseaudio/src/pulsecore/ |
| D | llist.h | 34 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) \
84 *_head = (*_head)->prev; \
[all …]
|
| /third_party/python/Modules/_sqlite/ |
| D | cache.c | 41 node->prev = NULL; in pysqlite_new_node()
173 if (node->prev && node->count > node->prev->count) { in pysqlite_cache_get()
174 ptr = node->prev; in pysqlite_cache_get()
176 while (ptr->prev && node->count > ptr->prev->count) { in pysqlite_cache_get()
177 ptr = ptr->prev; in pysqlite_cache_get()
181 node->next->prev = node->prev; in pysqlite_cache_get()
183 self->last = node->prev; in pysqlite_cache_get()
185 if (node->prev) { in pysqlite_cache_get()
186 node->prev->next = node->next; in pysqlite_cache_get()
188 if (ptr->prev) { in pysqlite_cache_get()
[all …]
|
| /third_party/ltp/tools/sparse/sparse-src/ |
| D | ptrlist.c | 120 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 = head; in split_ptr_list_head()
267 if (!list || (nr = (last = list->prev)->nr) >= LIST_NODE_NR) { in __add_ptr_list()
271 newlist->prev = newlist; in __add_ptr_list()
[all …]
|
| /third_party/mesa3d/src/util/tests/ |
| D | rb_tree_test.cpp | 75 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 == NULL || prev > n); in validate_tree_order()
133 prev = n; in validate_tree_order()
138 prev = NULL; in validate_tree_order()
[all …]
|
| /third_party/libwebsockets/lib/core/ |
| D | lws_dll2.c | 37 if (d->next || d->prev) { in lws_dll2_is_detached()
39 __func__, d, d->next, d->prev); in lws_dll2_is_detached()
82 d->next->prev = d; in lws_dll2_add_head()
84 d->prev = NULL; in lws_dll2_add_head()
123 d->prev = after->prev; in lws_dll2_add_before()
127 if (after->prev) in lws_dll2_add_before()
128 after->prev->next = d; in lws_dll2_add_before()
134 after->prev = d; in lws_dll2_add_before()
148 d->prev = owner->tail; in lws_dll2_add_tail()
150 if (d->prev) in lws_dll2_add_tail()
[all …]
|
| /third_party/selinux/libsepol/src/ |
| D | ebitmap.c | 21 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()
[all …]
|
| /third_party/node/deps/cares/src/lib/ |
| D | ares_llist.c | 28 head->prev = head; in ares__init_list_head()
35 node->prev = NULL; in ares__init_list_node()
42 return ((head->next == head) && (head->prev == head)); in ares__is_list_empty()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
57 node->prev->next = node->next; in ares__remove_from_list()
58 node->next->prev = node->prev; in ares__remove_from_list()
59 node->prev = NULL; in ares__remove_from_list()
|