| /external/chromium_org/third_party/skia/src/core/ |
| SkTLS.cpp | 45 SkTLSRec* next = rec->fNext; local
47 rec = next;
109 SkTLSRec* next = curr->fNext; local
112 prev->fNext = next;
115 SkTLS::PlatformSetSpecific(next);
121 curr = next;
|
| /external/e2fsprogs/lib/et/ |
| com_right.c | 51 for (p = list; p; p = p->next) {
62 for (p = list; p; p = p->next) {
95 for (end = list, et = *list; et; end = &et->next, et = et->next)
106 et->next = NULL;
116 et = et->next;
|
| /external/javassist/src/main/javassist/compiler/ |
| Lex.java | 19 public Token next = null; field in class:Token
57 lookAheadTokens = lookAheadTokens.next;
63 * Looks at the next token.
73 tk.next = null;
77 for (; i-- > 0; tk = tk.next)
78 if (tk.next == null) {
80 tk.next = tk2 = new Token();
|
| /external/libcxx/test/containers/associative/map/map.cons/ |
| initializer_list_compare_alloc.pass.cpp | 43 assert(*next(m.begin()) == V(2, 1));
44 assert(*next(m.begin(), 2) == V(3, 1));
67 assert(*next(m.begin()) == V(2, 1));
68 assert(*next(m.begin(), 2) == V(3, 1));
93 assert(*next(m.begin()) == V(2, 1));
94 assert(*next(m.begin(), 2) == V(3, 1));
|
| copy_alloc.pass.cpp | 48 assert(*next(m.begin()) == V(2, 1));
49 assert(*next(m.begin(), 2) == V(3, 1));
56 assert(*next(mo.begin()) == V(2, 1));
57 assert(*next(mo.begin(), 2) == V(3, 1));
83 assert(*next(m.begin()) == V(2, 1));
84 assert(*next(m.begin(), 2) == V(3, 1));
91 assert(*next(mo.begin()) == V(2, 1));
92 assert(*next(mo.begin(), 2) == V(3, 1));
|
| /external/libcxx/test/containers/associative/multimap/multimap.ops/ |
| lower_bound.pass.cpp | 48 assert(r == next(m.begin(), 3));
50 assert(r == next(m.begin(), 3));
52 assert(r == next(m.begin(), 6));
54 assert(r == next(m.begin(), 6));
78 assert(r == next(m.begin(), 3));
80 assert(r == next(m.begin(), 3));
82 assert(r == next(m.begin(), 6));
84 assert(r == next(m.begin(), 6));
112 assert(r == next(m.begin(), 3));
114 assert(r == next(m.begin(), 3))
[all...] |
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_cache.c | 15 * next paragraph) shall be included in all copies or substantial portions
127 struct list_head *curr, *next; local
133 curr = mgr->delayed.next;
134 next = curr->next;
143 curr = next;
144 next = curr->next;
267 struct list_head *curr, *next; local
274 curr = mgr->delayed.next;
360 struct list_head *curr, *next; local
[all...] |
| /external/chromium_org/net/disk_cache/blockfile/ |
| rankings.cc | 272 node->Data()->next = my_head.value();
278 node->Data()->next = my_tail.value();
296 // y, prev is x and next is z):
301 // 4. r(0, 0), head(0), tail(0) next.Store()
305 // 2. a(x, r), r(a, b), b(a, y), head(x), tail(y) next.Store()
312 // 3. r(r, b), b(b, y), head(b), tail(y) next.Store()
319 // 4. a(x, a), r(0, 0), head(x), tail(a) next.Store()
322 node->Data()->next, node->Data()->prev, list);
327 Addr next_addr(node->Data()->next);
338 CacheRankingsBlock next(backend_->File(next_addr), next_addr)
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/ |
| nasm-pp.c | 64 SMacro *next; member in struct:SMacro
84 * The `next' field is used for storing MMacros in hash tables; the
92 MMacro *next; member in struct:MMacro
118 Context *next; member in struct:Context
145 Token *next; member in struct:Token
181 Line *next; member in struct:Line
192 Include *next; member in struct:Include
210 Cond *next; member in struct:Cond
458 Blocks *next; member in struct:Blocks
475 static Token *new_Token(Token * next, int type, const char *text
497 struct TMEndItem *next; member in struct:TMEndItem
507 struct TStrucField *next; member in struct:TStrucField
512 struct TStruc *next; member in struct:TStruc
1012 Token *t, *prev, *next; local
1522 Token *next = t->next; local
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| instruction.h | 30 : code(c), next(n), k(parm) {}
55 Instruction* next; member in union:sandbox::Instruction::__anon15179
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderLayerStackingNodeIterator.h | 59 RenderLayerStackingNode* next();
79 RenderLayerStackingNode* next();
|
| /external/chromium_org/third_party/polymer/components/core-menu/ |
| core-menu.css | 15 polyfill-next-selector { content: 'core-menu > core-item'; }
|
| /external/chromium_org/third_party/polymer/components-chromium/core-menu/ |
| core-menu.css | 15 polyfill-next-selector { content: 'core-menu > core-item'; }
|
| /external/chromium_org/third_party/skia/tests/ |
| SListTest.cpp | 13 SListEntry* next() { return getSListNext(); } function in class:SListEntry
41 SListEntry* next = list.head(); local
48 if (NULL == next) {
52 if (next!= value) {
56 next = next->next();
58 if (next) {
|
| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.h | 35 ** element pointed to plus the next _ht.count-1 elements in the list.
60 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem
86 #define sqliteHashNext(E) ((E)->next)
|
| /external/e2fsprogs/misc/ |
| fsck.h | 48 struct fs_info *next; member in struct:fs_info
66 struct fsck_instance *next; member in struct:fsck_instance
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| XMLTokener.java | 68 c = next();
84 * Get the next XML outer token, trimming whitespace. There are two kinds
96 c = next();
115 c = next();
121 * Return the next entity. These entities are translated to Characters:
130 char c = next();
146 * Returns the next XML meta token. This is used for skipping over <!...>
158 c = next();
179 c = next();
189 c = next();
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| UnmodifiableIteratorTest.java | 44 public String next() {
53 assertEquals("a", iterator.next());
|
| /external/junit/src/org/junit/internal/runners/statements/ |
| RunBefores.java | 18 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) {
19 fNext= next;
|
| /external/libcxx/test/containers/associative/set/set.cons/ |
| copy.pass.cpp | 47 assert(*next(m.begin()) == 2);
48 assert(*next(m.begin(), 2) == 3);
55 assert(*next(mo.begin()) == 2);
56 assert(*next(mo.begin(), 2) == 3);
82 assert(*next(m.begin()) == 2);
83 assert(*next(m.begin(), 2) == 3);
90 assert(*next(mo.begin()) == 2);
91 assert(*next(mo.begin(), 2) == 3);
|
| copy_assign.pass.cpp | 48 assert(*next(m.begin()) == 2);
49 assert(*next(m.begin(), 2) == 3);
56 assert(*next(mo.begin()) == 2);
57 assert(*next(mo.begin(), 2) == 3);
98 assert(*next(m.begin()) == 2);
99 assert(*next(m.begin(), 2) == 3);
106 assert(*next(mo.begin()) == 2);
107 assert(*next(mo.begin(), 2) == 3);
|
| iter_iter_comp.pass.cpp | 45 assert(*next(m.begin()) == 2);
46 assert(*next(m.begin(), 2) == 3);
|
| /external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_range.pass.cpp | 93 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2),
94 next(c2.cbefore_begin(), f), next(c2.cbefore_begin(), l));
109 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
110 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
117 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1),
118 next(c1.cbefore_begin(), f), next(c1.cbefore_begin(), l));
137 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2)
[all...] |
| /external/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db4.pass.cpp | 30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /external/bison/lib/ |
| lbitset.c | 63 struct lbitset_elt_struct *next; /* Next element. */ member in struct:lbitset_elt_struct
100 lbitset_free_list = elt->next;
159 elt->next = lbitset_free_list;
168 lbitset_elt *next = elt->next; local
172 prev->next = next;
174 if (next)
175 next->prev = prev
213 lbitset_elt *next; local
391 lbitset_elt *next; local
867 lbitset_elt *next; local
[all...] |
