| /device/google/marlin/camera/QCamera2/stack/common/ |
| cam_list.h | 44 struct cam_list *next, *prev; member in struct:cam_list
49 ptr->next = ptr;
59 item->next = head;
61 prev->next = item;
67 item->next = node;
69 item->prev->next = item;
76 struct cam_list *next = ptr->next; local
78 next->prev = ptr->prev;
79 prev->next = ptr->next
[all...] |
| /external/libunwind/src/mi/ |
| dyn-register.c | 37 di->next = _U_dyn_info_list.first;
39 if (di->next)
40 di->next->prev = di;
|
| /external/syslinux/com32/lib/syslinux/ |
| dump_mmap.c | 43 while (memmap->next) {
45 memmap->next->start - memmap->start, memmap->type);
46 memmap = memmap->next;
|
| /hardware/interfaces/nfc/1.0/ |
| INfc.hal | 37 @callflow(next={"write", "coreInitialized", "prediscover", "powerCycle", "controlGranted"})
48 @callflow(next={"write", "prediscover", "coreInitialized", "close", "powerCycle",
62 @callflow(next={"write", "prediscover", "close"})
76 @callflow(next={"write", "close", "coreInitialized", "powerCycle", "controlGranted"})
95 @callflow(next={"write", "close", "prediscover", "coreInitialized", "powerCycle"})
104 @callflow(next={"write", "coreInitialized", "prediscover", "controlGranted", "close"})
|
| /hardware/qcom/camera/msm8998/QCamera2/stack/common/ |
| cam_list.h | 45 struct cam_list *next, *prev; member in struct:cam_list
50 ptr->next = ptr;
60 item->next = head;
62 prev->next = item;
68 item->next = node;
70 item->prev->next = item;
77 struct cam_list *next = ptr->next; local
79 next->prev = ptr->prev;
80 prev->next = ptr->next
[all...] |
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-sh/sh64/ |
| shcmp-1.s | 5 mova next,r0
7 next: label
15 .long next
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 0));
48 assert(r.first == next(m.begin(), 0));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 6));
57 assert(r.first == next(m.begin(), 6));
58 assert(r.second == next(m.begin(), 6))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multiset/ |
| equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0));
46 assert(r.second == next(m.begin(), 0));
48 assert(r.first == next(m.begin(), 0));
49 assert(r.second == next(m.begin(), 3));
51 assert(r.first == next(m.begin(), 3));
52 assert(r.second == next(m.begin(), 3));
54 assert(r.first == next(m.begin(), 3));
55 assert(r.second == next(m.begin(), 6));
57 assert(r.first == next(m.begin(), 6));
58 assert(r.second == next(m.begin(), 6))
[all...] |
| /external/blktrace/btt/ |
| list.h | 35 struct list_head *next, *prev; member in struct:list_head
45 list->next = list;
53 * the prev/next entries already!
57 struct list_head *next)
59 next->prev = new;
60 new->next = next;
62 prev->next = new;
75 __list_add(new, head, head->next);
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /external/fio/ |
| flist.h | 22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev; member in struct:flist_head
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
48 struct flist_head *next)
50 next->prev = new_entry;
51 new_entry->next = next;
53 prev->next = new_entry;
67 __flist_add(new_entry, head, head->next);
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 1);
47 assert(*next(c.begin(), 2) == 2);
51 assert(*next(c.begin(), 0) == 0);
52 assert(*next(c.begin(), 1) == 1);
53 assert(*next(c.begin(), 2) == 2);
54 assert(*next(c.begin(), 3) == 0);
55 assert(*next(c.begin(), 4) == 0);
56 assert(*next(c.begin(), 5) == 0);
60 assert(*next(c.begin(), 0) == 0)
[all...] |
| insert_after_init.pass.cpp | 33 assert(i == next(c.before_begin(), 3));
35 assert(*next(c.begin(), 0) == 0);
36 assert(*next(c.begin(), 1) == 1);
37 assert(*next(c.begin(), 2) == 2);
40 assert(i == next(c.begin(), 2));
42 assert(*next(c.begin(), 0) == 0);
43 assert(*next(c.begin(), 1) == 3);
44 assert(*next(c.begin(), 2) == 4);
45 assert(*next(c.begin(), 3) == 1);
46 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_range.pass.cpp | 36 assert(i == next(c.before_begin(), 3));
38 assert(*next(c.begin(), 0) == 0);
39 assert(*next(c.begin(), 1) == 1);
40 assert(*next(c.begin(), 2) == 2);
43 assert(i == next(c.begin(), 2));
45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 3);
47 assert(*next(c.begin(), 2) == 4);
48 assert(*next(c.begin(), 3) == 1);
49 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_size_value.pass.cpp | 31 assert(i == next(c.before_begin(), 3));
33 assert(*next(c.begin(), 0) == 3);
34 assert(*next(c.begin(), 1) == 3);
35 assert(*next(c.begin(), 2) == 3);
38 assert(i == next(c.begin(), 2));
40 assert(*next(c.begin(), 0) == 3);
41 assert(*next(c.begin(), 1) == 2);
42 assert(*next(c.begin(), 2) == 2);
43 assert(*next(c.begin(), 3) == 3);
44 assert(*next(c.begin(), 4) == 3)
[all...] |
| /frameworks/native/libs/vr/libpdx/private/pdx/rpc/ |
| macros.h | 45 // Returns next_func if the next element is not (), or _PDX_CLEAR
55 #define _PDX_APPLY_1(macro, head, next, ...) \
56 macro(head) _PDX_NEXT_FUNC(next, _PDX_APPLY_2)(macro, next, __VA_ARGS__)
59 #define _PDX_APPLY_2(macro, head, next, ...) \
60 macro(head) _PDX_NEXT_FUNC(next, _PDX_APPLY_1)(macro, next, __VA_ARGS__)
74 #define _PDX_APPLY_LIST_1(macro, head, next, ...) \
76 _PDX_NEXT_FUNC(next, _PDX_APPLY_LIST_2)(macro, next, __VA_ARGS__
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| resize_size.pass.cpp | 45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 1);
47 assert(*next(c.begin(), 2) == 2);
51 assert(*next(c.begin(), 0) == 0);
52 assert(*next(c.begin(), 1) == 1);
53 assert(*next(c.begin(), 2) == 2);
54 assert(*next(c.begin(), 3) == 0);
55 assert(*next(c.begin(), 4) == 0);
56 assert(*next(c.begin(), 5) == 0);
60 assert(*next(c.begin(), 0) == 0)
[all...] |
| insert_after_init.pass.cpp | 33 assert(i == next(c.before_begin(), 3));
35 assert(*next(c.begin(), 0) == 0);
36 assert(*next(c.begin(), 1) == 1);
37 assert(*next(c.begin(), 2) == 2);
40 assert(i == next(c.begin(), 2));
42 assert(*next(c.begin(), 0) == 0);
43 assert(*next(c.begin(), 1) == 3);
44 assert(*next(c.begin(), 2) == 4);
45 assert(*next(c.begin(), 3) == 1);
46 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_range.pass.cpp | 36 assert(i == next(c.before_begin(), 3));
38 assert(*next(c.begin(), 0) == 0);
39 assert(*next(c.begin(), 1) == 1);
40 assert(*next(c.begin(), 2) == 2);
43 assert(i == next(c.begin(), 2));
45 assert(*next(c.begin(), 0) == 0);
46 assert(*next(c.begin(), 1) == 3);
47 assert(*next(c.begin(), 2) == 4);
48 assert(*next(c.begin(), 3) == 1);
49 assert(*next(c.begin(), 4) == 2)
[all...] |
| insert_after_size_value.pass.cpp | 31 assert(i == next(c.before_begin(), 3));
33 assert(*next(c.begin(), 0) == 3);
34 assert(*next(c.begin(), 1) == 3);
35 assert(*next(c.begin(), 2) == 3);
38 assert(i == next(c.begin(), 2));
40 assert(*next(c.begin(), 0) == 3);
41 assert(*next(c.begin(), 1) == 2);
42 assert(*next(c.begin(), 2) == 2);
43 assert(*next(c.begin(), 3) == 3);
44 assert(*next(c.begin(), 4) == 3)
[all...] |
| /external/ltp/utils/ffsb-6.0-rc2/ |
| list.h | 10 struct list_head *next, *prev; member in struct:list_head
15 struct list_head *next);
16 void __list_del(struct list_head *prev, struct list_head *next);
27 for (pos = (head)->next; pos->next, pos != (head); pos = pos->next)
39 for (pos = list_entry((head)->next, typeof(*pos), member); \
40 pos->member.next, &pos->member != (head); \
41 pos = list_entry(pos->member.next, typeof(*pos), member))
44 for (pos = list_entry((head)->next, typeof(*pos), member),
[all...] |
| /external/junit/src/main/java/org/junit/internal/runners/statements/ |
| RunBefores.java | 9 private final Statement next; field in class:RunBefores
15 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) {
16 this.next = next;
26 next.evaluate();
|
| /external/libnl/include/netlink/ |
| list.h | 17 struct nl_list_head * next; member in struct:nl_list_head
23 list->next = list;
29 struct nl_list_head *next)
31 prev->next = obj;
33 next->prev = obj;
34 obj->next = next;
46 __nl_list_add(obj, head, head->next);
51 obj->next->prev = obj->prev;
52 obj->prev->next = obj->next
[all...] |
| /external/slf4j/slf4j-ext/src/main/java/org/slf4j/ |
| NDC.java | 46 int next = size(); local
47 MDC.put(PREFIX + next, val);
51 int next = size(); local
52 if (next == 0) {
55 int last = next - 1;
|
| /hardware/interfaces/biometrics/fingerprint/2.1/ |
| IBiometricsFingerprint.hal | 30 @callflow(next={"setActiveGroup"})
47 @callflow(next={"enroll", "postEnroll"})
68 @callflow(next={"cancel", "enroll", "postEnroll", "remove"})
79 @callflow(next={"authenticate", "setActiveGroup", "enumerate", "remove"})
91 @callflow(next={"authenticate"})
101 @callflow(next={"authenticate", "enroll", "enumerate", "remove",
116 @callflow(next={"remove", "enroll", "authenticate", "setActiveGroup"})
135 @callflow(next={"enumerate", "authenticate", "cancel", "getAuthenticatorId",
149 @callflow(next={"authenticate", "preEnroll", "enumerate", "remove"})
161 @callflow(next={"cancel", "preEnroll", "remove"}
[all...] |
| /external/clang/test/CodeGenCXX/ |
| function-template-specialization.cpp | 7 T* next(T* ptr, const U& diff);
10 T* next(T* ptr, const U& diff) { function
16 iptr = next(iptr, diff);
19 fptr = next(fptr, diff);
23 T* next(T* ptr, const U& diff);
26 iptr = next(iptr, diff);
29 dptr = next(dptr, diff);
|
