/external/chromium_org/third_party/boringssl/src/ssl/pqueue/ |
H A D | pqueue.c | 77 item->next = NULL; 113 for (curr = pq->items; curr; curr = curr->next) { 128 item = item->next; 143 *item = (*item)->next; 149 pitem *curr, *next; local 156 for (curr = NULL, next = pq->items; next != NULL; 157 curr = next, next = next [all...] |
/external/libcxx/test/containers/associative/map/map.ops/ |
H A D | upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1)); 45 assert(r == next(m.begin(), 2)); 47 assert(r == next(m.begin(), 3)); 49 assert(r == next(m.begin(), 4)); 51 assert(r == next(m.begin(), 5)); 53 assert(r == next(m.begin(), 6)); 55 assert(r == next(m.begin(), 7)); 57 assert(r == next(m.begin(), 8)); 59 assert(r == next(m.begin(), 0)); 61 assert(r == next( [all...] |
H A D | lower_bound.pass.cpp | 45 assert(r == next(m.begin())); 47 assert(r == next(m.begin(), 2)); 49 assert(r == next(m.begin(), 3)); 51 assert(r == next(m.begin(), 4)); 53 assert(r == next(m.begin(), 5)); 55 assert(r == next(m.begin(), 6)); 57 assert(r == next(m.begin(), 7)); 59 assert(r == next(m.begin(), 0)); 61 assert(r == next(m.begin(), 1)); 63 assert(r == next( [all...] |
H A D | find.pass.cpp | 45 assert(r == next(m.begin())); 47 assert(r == next(m.begin(), 2)); 49 assert(r == next(m.begin(), 3)); 51 assert(r == next(m.begin(), 4)); 53 assert(r == next(m.begin(), 5)); 55 assert(r == next(m.begin(), 6)); 57 assert(r == next(m.begin(), 7)); 59 assert(r == next(m.begin(), 8)); 78 assert(r == next(m.begin())); 80 assert(r == next( [all...] |
/external/libcxx/test/containers/associative/set/ |
H A D | upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1)); 45 assert(r == next(m.begin(), 2)); 47 assert(r == next(m.begin(), 3)); 49 assert(r == next(m.begin(), 4)); 51 assert(r == next(m.begin(), 5)); 53 assert(r == next(m.begin(), 6)); 55 assert(r == next(m.begin(), 7)); 57 assert(r == next(m.begin(), 8)); 59 assert(r == next(m.begin(), 0)); 61 assert(r == next( [all...] |
H A D | lower_bound.pass.cpp | 45 assert(r == next(m.begin())); 47 assert(r == next(m.begin(), 2)); 49 assert(r == next(m.begin(), 3)); 51 assert(r == next(m.begin(), 4)); 53 assert(r == next(m.begin(), 5)); 55 assert(r == next(m.begin(), 6)); 57 assert(r == next(m.begin(), 7)); 59 assert(r == next(m.begin(), 0)); 61 assert(r == next(m.begin(), 1)); 63 assert(r == next( [all...] |
H A D | find.pass.cpp | 45 assert(r == next(m.begin())); 47 assert(r == next(m.begin(), 2)); 49 assert(r == next(m.begin(), 3)); 51 assert(r == next(m.begin(), 4)); 53 assert(r == next(m.begin(), 5)); 55 assert(r == next(m.begin(), 6)); 57 assert(r == next(m.begin(), 7)); 59 assert(r == next(m.begin(), 8)); 78 assert(r == next(m.begin())); 80 assert(r == next( [all...] |
/external/linux-tools-perf/perf-3.12.0/include/linux/ |
H A D | list.h | 14 * sometimes we already know the next/prev entries and we can 26 list->next = list; 34 * the prev/next entries already! 39 struct list_head *next) 41 next->prev = new; 42 new->next = next; 44 prev->next = new; 49 struct list_head *next); 62 __list_add(new, head, head->next); 37 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 86 __list_del(struct list_head * prev, struct list_head * next) argument 206 struct list_head *next = head->next; local 273 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 588 struct hlist_node *next = n->next; local 621 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 630 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/chromium_org/third_party/skia/src/views/ |
H A D | SkTagList.cpp | 38 SkTagList* next = rec->fNext; 43 prev->fNext = next; 45 *head = next; 50 rec = next; 58 SkTagList* next = rec->fNext; 60 rec = next;
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | d8-performance-now.js | 44 var next = performance.now(); 45 assertTrue(next >= end); 46 end = next;
|
/external/libcxx/test/containers/associative/multimap/multimap.cons/ |
H A D | iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5)); 43 assert(*next(m.begin(), 2) == V(1, 2)); 44 assert(*next(m.begin(), 3) == V(2, 1)); 45 assert(*next(m.begin(), 4) == V(2, 1.5)); 46 assert(*next(m.begin(), 5) == V(2, 2)); 47 assert(*next(m.begin(), 6) == V(3, 1)); 48 assert(*next(m.begin(), 7) == V(3, 1.5)); 49 assert(*next(m.begin(), 8) == V(3, 2)); 70 assert(*next(m.begin()) == V(1, 1.5)); 71 assert(*next( [all...] |
H A D | iter_iter_comp.pass.cpp | 46 assert(*next(m.begin()) == V(1, 1.5)); 47 assert(*next(m.begin(), 2) == V(1, 2)); 48 assert(*next(m.begin(), 3) == V(2, 1)); 49 assert(*next(m.begin(), 4) == V(2, 1.5)); 50 assert(*next(m.begin(), 5) == V(2, 2)); 51 assert(*next(m.begin(), 6) == V(3, 1)); 52 assert(*next(m.begin(), 7) == V(3, 1.5)); 53 assert(*next(m.begin(), 8) == V(3, 2)); 76 assert(*next(m.begin()) == V(1, 1.5)); 77 assert(*next( [all...] |
H A D | iter_iter_comp_alloc.pass.cpp | 49 assert(*next(m.begin()) == V(1, 1.5)); 50 assert(*next(m.begin(), 2) == V(1, 2)); 51 assert(*next(m.begin(), 3) == V(2, 1)); 52 assert(*next(m.begin(), 4) == V(2, 1.5)); 53 assert(*next(m.begin(), 5) == V(2, 2)); 54 assert(*next(m.begin(), 6) == V(3, 1)); 55 assert(*next(m.begin(), 7) == V(3, 1.5)); 56 assert(*next(m.begin(), 8) == V(3, 2)); 81 assert(*next(m.begin()) == V(1, 1.5)); 82 assert(*next( [all...] |
/external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
H A D | NameBasedCandidateFilter.java | 15 private final MockCandidateFilter next;
field in class:NameBasedCandidateFilter 18 public NameBasedCandidateFilter(MockCandidateFilter next) {
argument 19 this.next = next;
30 return next.filterCandidate(mockNameMatches, field, fieldInstance);
32 return next.filterCandidate(mocks, field, fieldInstance);
|
/external/skia/src/views/ |
H A D | SkTagList.cpp | 38 SkTagList* next = rec->fNext; 43 prev->fNext = next; 45 *head = next; 50 rec = next; 58 SkTagList* next = rec->fNext; 60 rec = next;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | span.cc | 73 list->next = list; 78 span->prev->next = span->next; 79 span->next->prev = span->prev; 81 span->next = NULL; 86 for (Span* s = list->next; s != list; s = s->next) { 93 ASSERT(span->next == NULL); 95 span->next = list->next; [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | span.cc | 73 list->next = list; 78 span->prev->next = span->next; 79 span->next->prev = span->prev; 81 span->next = NULL; 86 for (Span* s = list->next; s != list; s = s->next) { 93 ASSERT(span->next == NULL); 95 span->next = list->next; [all...] |
/external/libcxx/test/containers/associative/multiset/ |
H A D | find.pass.cpp | 45 assert(r == next(m.begin())); 47 assert(r == next(m.begin(), 2)); 49 assert(r == next(m.begin(), 3)); 51 assert(r == next(m.begin(), 4)); 53 assert(r == next(m.begin(), 5)); 55 assert(r == next(m.begin(), 6)); 57 assert(r == next(m.begin(), 7)); 59 assert(r == next(m.begin(), 8)); 78 assert(r == next(m.begin())); 80 assert(r == next( [all...] |
/external/chromium_org/third_party/skia/samplecode/ |
H A D | TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16) 16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
/external/dhcpcd/ |
H A D | control.h | 36 struct fd_list *next; member in struct:fd_list
|
/external/lldb/test/python_api/value/linked_list/ |
H A D | main.cpp | 14 Task *next; member in class:Task 17 next(n) 32 task1->next = task2; 33 task2->next = task4; 34 task4->next = task5; 41 t = t->next; 51 task_evil->next = task_2; 52 task_2->next = task_3; 53 task_3->next = task_evil; // In order to cause inifinite loop. :-)
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Edge.java | 71 * The next edge in the list of successors of the originating basic block.
74 Edge next;
field in class:Edge
|
/external/skia/samplecode/ |
H A D | TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|
/external/skia/src/core/ |
H A D | SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16) 16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|