Home
last modified time | relevance | path

Searched refs:next (Results 1 - 25 of 12712) sorted by relevance

12345678910>>...509

/third_party/vk-gl-cts/external/amber/src/src/
H A Dtokenizer_test.cc28 auto next = t.NextToken(); in TEST_F() local
29 ASSERT_TRUE(next != nullptr); in TEST_F()
30 EXPECT_TRUE(next->IsEOS()); in TEST_F()
35 auto next = t.NextToken(); in TEST_F() local
36 ASSERT_TRUE(next != nullptr); in TEST_F()
37 EXPECT_TRUE(next->IsIdentifier()); in TEST_F()
38 EXPECT_EQ("TestIdentifier", next->AsString()); in TEST_F()
40 next = t.NextToken(); in TEST_F()
41 ASSERT_TRUE(next != nullptr); in TEST_F()
42 EXPECT_TRUE(next in TEST_F()
47 auto next = t.NextToken(); TEST_F() local
59 auto next = t.NextToken(); TEST_F() local
71 auto next = t.NextToken(); TEST_F() local
85 auto next = t.NextToken(); TestNaN() local
110 auto next = t.NextToken(); TEST_F() local
122 auto next = t.NextToken(); TEST_F() local
134 auto next = t.NextToken(); TEST_F() local
146 auto next = t.NextToken(); TEST_F() local
163 auto next = t.NextToken(); TEST_F() local
216 auto next = t.NextToken(); TEST_F() local
266 auto next = t.NextToken(); TEST_F() local
278 auto next = t.NextToken(); TEST_F() local
290 auto next = t.NextToken(); TEST_F() local
303 auto next = t.NextToken(); TEST_F() local
315 auto next = t.NextToken(); TEST_F() local
327 auto next = t.NextToken(); TEST_F() local
353 auto next = t.NextToken(); TEST_F() local
391 auto next = t.NextToken(); TEST_F() local
402 auto next = t.NextToken(); TEST_F() local
413 auto next = t.NextToken(); TEST_F() local
421 auto next = t.NextToken(); TEST_F() local
429 auto next = t.NextToken(); TEST_F() local
437 auto next = t.NextToken(); TEST_F() local
448 auto next = t.NextToken(); TEST_F() local
460 auto next = t.NextToken(); TEST_F() local
472 auto next = t.NextToken(); TEST_F() local
483 auto next = t.NextToken(); TEST_F() local
494 auto next = t.NextToken(); TEST_F() local
505 auto next = t.NextToken(); TEST_F() local
517 auto next = t.NextToken(); TEST_F() local
536 auto next = t.NextToken(); TEST_F() local
553 auto next = t.NextToken(); TEST_F() local
570 auto next = t.NextToken(); TEST_F() local
593 auto next = t.NextToken(); TEST_F() local
612 auto next = t.NextToken(); TEST_F() local
629 auto next = t.NextToken(); TEST_F() local
[all...]
/third_party/libcoap/include/coap3/
H A Dcoap_utlist_internal.h38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * 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.*/
87 #define UTLIST_NEXT(elt,list,next) ((char*)((list)->next))
88 #define UTLIST_NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); }
96 #define UTLIST_NEXT(elt,list,next) ((elt)->next)
[all...]
/third_party/selinux/libsepol/cil/test/unit/
H A Dtest_cil_resolve_ast.c145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_roleallow()
165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_srcdecl_neg()
184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_tgtdecl_neg()
204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_classmapping_anon()
228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro()
232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next in test_cil_resolve_classmapping_anon_inmacro()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dlist.h18 * sometimes we already know the next/prev entries and we can
37 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
55 struct list_head *next);
67 struct list_head *next) in __list_add_valid()
73 * With the hardening version, elide checking if next and prev in __list_add_valid()
83 if (likely(next->prev == prev && prev->next == next && new != prev && new != next)) in __list_add_valid()
88 ret &= __list_add_valid_or_report(new, prev, next); in __list_add_valid()
65 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
112 struct list_head *next = entry->next; __list_del_entry_valid() local
128 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
146 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
193 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
409 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
523 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
977 struct hlist_node *next = n->next; __hlist_del() local
1036 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h53 struct list_head *next; member
64 list->next = list->prev = list; in INIT_LIST_HEAD()
71 return (head->next == head); in list_empty()
77 struct list_head *next = head->next; in list_empty_careful() local
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, nex in __list_del()
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
306 struct hlist_node *next, **pprev; global() member
362 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Doptions.c279 static char **handle_onoff_switch(char *arg, char **next, const struct flag flags[]) in handle_onoff_switch() argument
296 return next; in handle_onoff_switch()
349 static char **handle_switch_a(char *arg, char **next) in handle_switch_a() argument
354 return next; in handle_switch_a()
357 static char **handle_switch_D(char *arg, char **next) in handle_switch_D() argument
363 arg = *++next; in handle_switch_D()
381 return next; in handle_switch_D()
384 static char **handle_switch_d(char *arg, char **next) in handle_switch_d() argument
412 return next; in handle_switch_d()
415 static char **handle_switch_E(char *arg, char **next) in handle_switch_E() argument
539 handle_switch_f(char *arg, char **next) handle_switch_f() argument
547 handle_switch_G(char *arg, char **next) handle_switch_G() argument
555 handle_base_dir(char *arg, char **next) handle_base_dir() argument
563 handle_switch_g(char *arg, char **next) handle_switch_g() argument
571 handle_switch_I(char *arg, char **next) handle_switch_I() argument
598 handle_switch_i(char *arg, char **next) handle_switch_i() argument
618 handle_switch_M(char *arg, char **next) handle_switch_M() argument
660 handle_multiarch_dir(char *arg, char **next) handle_multiarch_dir() argument
686 handle_switch_m(char *arg, char **next) handle_switch_m() argument
697 handle_nostdinc(char *arg, char **next) handle_nostdinc() argument
703 handle_switch_n(char *arg, char **next) handle_switch_n() argument
711 handle_switch_O(char *arg, char **next) handle_switch_O() argument
721 handle_switch_o(char *arg, char **next) handle_switch_o() argument
738 handle_switch_p(char *arg, char **next) handle_switch_p() argument
744 handle_switch_s(const char *arg, char **next) handle_switch_s() argument
790 handle_switch_U(char *arg, char **next) handle_switch_U() argument
813 handle_switch_v(char *arg, char **next) handle_switch_v() argument
889 handle_switch_W(char *arg, char **next) handle_switch_W() argument
925 handle_switch_x(char *arg, char **next) handle_switch_x() argument
933 handle_arch(char *arg, char **next) handle_arch() argument
947 handle_param(char *arg, char **next) handle_param() argument
964 handle_os(char *arg, char **next) handle_os() argument
974 handle_version(char *arg, char **next) handle_version() argument
986 handle_long_options(char *arg, char **next) handle_long_options() argument
1006 handle_switch(char *arg, char **next) handle_switch() argument
[all...]
/third_party/jerryscript/tests/jerry/es2015/
H A Dmap-iterators.js51 m[method].next.call(5);
60 m[method].next.call({});
74 var next = element.next();
75 assert(next.done === false);
76 assert(next.value[0] === '' + i);
77 assert(next.value[1] === i);
80 var next = keyIterator.next();
81 assert(next
95 var next = keyIterator.next(); global() variable
[all...]
H A Dset-iterators.js43 s[method].next.call(5);
52 s[method].next.call({});
68 var next = element.next();
69 assert(next.done === false);
70 assert(next.value === i);
73 var next = entryIterator.next();
74 assert(next.done === false);
75 assert(next
85 var next = entryIterator.next(); global() variable
[all...]
/kernel/linux/linux-5.10/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
616 struct hlist_node *next = n->next; __hlist_del() local
650 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/kernel/linux/linux-6.6/tools/include/linux/
H A Dlist.h15 * sometimes we already know the next/prev entries and we can
27 list->next = list; in INIT_LIST_HEAD()
35 * the prev/next entries already!
40 struct list_head *next) in __list_add()
42 next->prev = new; in __list_add()
43 new->next = next; in __list_add()
45 prev->next = new; in __list_add()
50 struct list_head *next);
63 __list_add(new, head, head->next); in list_add()
38 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
87 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
207 struct list_head *next = head->next; list_empty_careful() local
274 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
627 struct hlist_node *next = n->next; __hlist_del() local
661 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/third_party/typescript/tests/baselines/reference/
H A DgenericClassWithStaticFactory.js5 public next: List<T>;
17 this.prev.next = entry;
18 entry.next = this;
28 entry = this.next;
30 entry = entry.next;
37 return (this.next == this);
43 return this.next.data;
52 entry.next = this.next;
54 this.next
[all...]
/third_party/libdrm/
H A Dlibdrm_lists.h23 * next paragraph) shall be included in all copies or substantial portions
37 struct _drmMMListHead *next; member
43 (__item)->next = (__item); \
49 (__item)->next = (__list)->next; \
50 (__list)->next->prev = (__item); \
51 (__list)->next = (__item); \
56 (__item)->next = (__list); \
58 (__list)->prev->next = (__item); \
64 (__item)->prev->next
[all...]
/third_party/rust/crates/clap/clap_lex/tests/
H A Dparsed.rs8 let next = raw.next(&mut cursor).unwrap(); in to_long_stdio()
10 assert!(!next.is_long()); in to_long_stdio()
12 assert_eq!(next.to_long(), None); in to_long_stdio()
20 let next = raw.next(&mut cursor).unwrap(); in to_long_no_escape()
22 assert!(!next.is_long()); in to_long_no_escape()
24 assert_eq!(next.to_long(), None); in to_long_no_escape()
32 let next = raw.next( in to_long_no_value()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Dlist.h16 * sometimes we already know the next/prev entries and we can
35 WRITE_ONCE(list->next, list); in INIT_LIST_HEAD()
42 struct list_head *next);
47 struct list_head *next) in __list_add_valid()
61 * the prev/next entries already!
65 struct list_head *next) in __list_add()
67 if (!__list_add_valid(new, prev, next)) in __list_add()
70 next->prev = new; in __list_add()
71 new->next = next; in __list_add()
45 __list_add_valid(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid() argument
63 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add() argument
110 __list_del(struct list_head * prev, struct list_head * next) __list_del() argument
318 struct list_head *next = smp_load_acquire(&head->next); list_empty_careful() local
433 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) __list_splice() argument
835 struct hlist_node *next = n->next; __hlist_del() local
894 hlist_add_before(struct hlist_node *n, struct hlist_node *next) hlist_add_before() argument
[all...]
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dnine_shader.h11 * The above copyright notice and this permission notice (including the next
40 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */
126 struct nine_shader_variant *next; member
139 while (list->key != key && list->next) in nine_shader_variant_get()
140 list = list->next; in nine_shader_variant_get()
155 while (list->next) { in nine_shader_variant_add()
157 list = list->next; in nine_shader_variant_add()
159 list->next = MALLOC_STRUCT(nine_shader_variant); in nine_shader_variant_add()
160 if (!list->next) in nine_shader_variant_add()
162 list->next in nine_shader_variant_add()
182 struct nine_shader_variant_so *next; global() member
243 struct nine_shader_constant_combination *next; global() member
[all...]
/third_party/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_validate.c15 * next paragraph) shall be included in all copies or substantial portions
146 struct draw_stage *next = draw->pipeline.rasterize; in validate_pipeline() local
152 /* Set the validate's next stage to the rasterize stage, so that it in validate_pipeline()
155 stage->next = next; in validate_pipeline()
182 draw->pipeline.aaline->next = next; in validate_pipeline()
183 next = draw->pipeline.aaline; in validate_pipeline()
188 draw->pipeline.aapoint->next = next; in validate_pipeline()
[all...]
/third_party/mesa3d/src/compiler/glsl/
H A Dlist.h11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
54 struct exec_node *next; member
60 exec_node() : next(NULL), prev(NULL) in exec_node()
120 n->next = NULL; in exec_node_init()
127 return n->next; in exec_node_get_next_const()
133 return n->next; in exec_node_get_next()
151 n->next->prev = n->prev; in exec_node_remove()
152 n->prev->next in exec_node_remove()
[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
71 list->next = list; in INIT_LIST_HEAD()
79 * the prev/next entries already!
83 struct list_head *next) in __list_add()
85 next->prev = new; in __list_add()
86 new->next = next; in __list_add()
88 prev->next = new; in __list_add()
101 __list_add(new, head, head->next); in list_add()
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
199 struct list_head *next = head->next; list_empty_careful() local
[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!
62 struct list_head *next) in __list_add()
64 next->prev = new; in __list_add()
65 new->next = next; in __list_add()
67 prev->next = new; in __list_add()
80 __list_add(new, head, head->next); in list_add()
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...]
/kernel/linux/linux-6.6/lib/
H A Dlist_debug.c23 struct list_head *next) in __list_add_valid_or_report()
27 CHECK_DATA_CORRUPTION(next == NULL, in __list_add_valid_or_report()
28 "list_add corruption. next is NULL.\n") || in __list_add_valid_or_report()
29 CHECK_DATA_CORRUPTION(next->prev != prev, in __list_add_valid_or_report()
30 "list_add corruption. next->prev should be prev (%px), but was %px. (next=%px).\n", in __list_add_valid_or_report()
31 prev, next->prev, next) || in __list_add_valid_or_report()
32 CHECK_DATA_CORRUPTION(prev->next != next, in __list_add_valid_or_report()
22 __list_add_valid_or_report(struct list_head *new, struct list_head *prev, struct list_head *next) __list_add_valid_or_report() argument
47 struct list_head *prev, *next; __list_del_entry_valid_or_report() local
[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!
53 struct list_head *next) in __list_add()
55 next->prev = new; in __list_add()
56 new->next = next; in __list_add()
58 prev->next = new; in __list_add()
71 __list_add(new, head, head->next); in list_add()
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...]
/kernel/linux/linux-6.6/io_uring/
H A Dslist.h7 for (pos = (head)->first; pos; pos = (pos)->next)
10 for (pos = (head)->first, prv = NULL; pos; prv = pos, pos = (pos)->next)
13 for (; pos; prv = pos, pos = (pos)->next)
25 struct io_wq_work_node *next = pos->next; in wq_list_add_after() local
27 pos->next = node; in wq_list_add_after()
28 node->next = next; in wq_list_add_after()
29 if (!next) in wq_list_add_after()
36 node->next in wq_list_add_tail()
[all...]
/third_party/libuv/src/
H A Dqueue.h25 for ((q) = (h)->next; (q) != (h); (q) = (q)->next)
28 q->next = q; in uv__queue_init()
33 return q == q->next || q != q->next->prev; in uv__queue_empty()
37 return q->next; in uv__queue_head()
41 return q->next; in uv__queue_next()
45 h->prev->next = n->next; in uv__queue_add()
46 n->next in uv__queue_add()
[all...]
/third_party/node/deps/openssl/openssl/ssl/
H A Dpqueue.c29 item->next = NULL; in pitem_new()
55 pitem *curr, *next; in pqueue_insert() local
62 for (curr = NULL, next = pq->items; in pqueue_insert()
63 next != NULL; curr = next, next = next->next) { in pqueue_insert()
67 int cmp = memcmp(next->priority, item->priority, 8); in pqueue_insert()
68 if (cmp > 0) { /* next > ite in pqueue_insert()
106 pitem *next; pqueue_find() local
[all...]
/third_party/openssl/ssl/
H A Dpqueue.c29 item->next = NULL; in pitem_new()
55 pitem *curr, *next; in pqueue_insert() local
62 for (curr = NULL, next = pq->items; in pqueue_insert()
63 next != NULL; curr = next, next = next->next) { in pqueue_insert()
67 int cmp = memcmp(next->priority, item->priority, 8); in pqueue_insert()
68 if (cmp > 0) { /* next > ite in pqueue_insert()
106 pitem *next; pqueue_find() local
[all...]

Completed in 22 milliseconds

12345678910>>...509