| /external/libsepol/include/sepol/policydb/ |
| constraint.h | 61 struct constraint_expr *next; /* next expression */ member in struct:constraint_expr
67 struct constraint_node *next; /* next constraint */ member in struct:constraint_node
|
| /external/libxml2/ |
| hash.c | 60 struct _xmlHashEntry *next; member in struct:_xmlHashEntry
236 xmlHashEntryPtr iter, next; local
274 table->table[key].next = NULL;
278 iter = oldtable[i].next;
280 next = iter->next;
290 table->table[key].next = NULL;
293 iter->next = table->table[key].next;
294 table->table[key].next = iter
327 xmlHashEntryPtr next; local
868 xmlHashEntryPtr next; local
942 xmlHashEntryPtr next; local
982 xmlHashEntryPtr next; local
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/header/ |
| AllowEventsList.java | 82 AllowEvents allowEvents = (AllowEvents) li.next();
107 allowEvents.setEventType((String) it.next());
|
| AllowList.java | 83 Allow a = (Allow)it.next();
109 allow.setMethod((String) it.next());
|
| RouteList.java | 80 Route route = (Route) it.next();
81 Route route1 = (Route) it1.next();
|
| /external/qemu/ |
| qlist.h | 22 QTAILQ_ENTRY(QListEntry) next; member in struct:QListEntry
36 (var) = ((var)->next.tqe_next))
|
| /external/skia/include/effects/ |
| Sk1DPathEffect.h | 29 Return the distance to travel for the next call. If return <= 0, then that
32 virtual SkScalar next(SkPath* dst, SkScalar dist, SkPathMeasure&) const = 0;
68 virtual SkScalar next(SkPath*, SkScalar, SkPathMeasure&) const SK_OVERRIDE;
|
| /external/skia/src/core/ |
| SkDrawLooper.cpp | 20 if (this->next(&canvas, &p)) {
40 if (this->next(&canvas, &p)) {
|
| /external/skia/src/images/ |
| SkImageDecoder_FactoryRegistrar.cpp | 41 curr = curr->next();
60 curr = curr->next();
|
| /external/valgrind/main/memcheck/tests/ |
| badjump2.stderr.exp | 1 Jump to the invalid address stated on the next line
|
| /frameworks/av/media/libeffects/factory/ |
| EffectsFactory.h | 32 struct list_elem_s *next; member in struct:list_elem_s
41 struct list_sub_elem_s *next; member in struct:list_sub_elem_s
|
| /frameworks/base/libs/hwui/font/ |
| FontUtil.h | 61 #define AUTO_KERN(prev, next) (((next) - (prev) + 32) >> 6 << 16)
|
| /hardware/qcom/camera/QCamera2/util/ |
| QCameraQueue.cpp | 162 struct cam_list *p_next = m_head.list.next;
164 m_head.list.next = &node->list;
166 node->list.next = p_next;
195 pos = head->next;
231 pos = head->next;
235 pos = pos->next;
274 pos = head->next;
278 pos = pos->next;
|
| /libcore/libdvm/src/main/java/java/lang/reflect/ |
| Proxy.java | 96 Class<?> next = interfaces[i]; local
97 if (next == null) {
100 String name = next.getName();
101 if (!next.isInterface()) {
104 if (loader != next.getClassLoader()) {
106 if (next != Class.forName(name, false, loader)) {
115 if (next == interfaces[j]) {
119 if (!Modifier.isPublic(next.getModifiers())) {
|
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 25 * ordering priority of the next character or sequence of characters in the
51 * {@code next()} and {@code previous()} when the end or the
70 * call to either the {@link #next()} or {@link #previous()}
81 * next collation element. This value could be any of:
84 * the value of the next collation element. This means that if
99 * will be returned by the next invocation of the {@link #next()}
107 * Obtains the next collation element in the source string.
109 * @return the next collation element or {@code NULLORDER} if the end
112 public int next() { method in class:CollationElementIterator
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| SynchronousQueue.java | 106 * except that nodes that appear to be the next ones to become
202 volatile SNode next; // next node in stack field in class:SynchronousQueue.TransferStack.SNode
216 return cmp == next &&
264 (k.getDeclaredField("next"));
286 static SNode snode(SNode s, Object e, SNode next, int mode) {
289 s.next = next;
327 casHead(h, h.next); // pop cancelled node
336 if ((h = head) != null && h.next == s
507 volatile QNode next; \/\/ next node in queue field in class:SynchronousQueue.TransferQueue.QNode
1047 public E next() { throw new NoSuchElementException(); } method in class:SynchronousQueue.EmptyIterator
[all...] |
| /libcore/luni/src/test/java/libcore/java/text/ |
| OldCollationElementIteratorTest.java | 34 int order = iterator.next();
38 order = iterator.next();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill_n.pass.cpp | 28 assert(std::fill_n(Iter(ca), n, char(1)) == std::next(Iter(ca), n));
41 assert(std::fill_n(Iter(ia), n, 1) == std::next(Iter(ia), n));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| find.pass.cpp | 47 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 6));
75 assert(r == next(m.begin(), 3));
79 assert(r == next(m.begin(), 6));
107 assert(r == next(m.begin(), 3));
111 assert(r == next(m.begin(), 6));
135 assert(r == next(m.begin(), 3));
139 assert(r == next(m.begin(), 6));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.cons/ |
| iter_iter_alloc.pass.cpp | 50 assert(*next(m.begin()) == 2);
51 assert(*next(m.begin(), 2) == 3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| push_front_const.pass.cpp | 30 assert(*next(c.begin()) == 1);
43 assert(*next(c.begin()) == 1);
|
| push_front_rv.pass.cpp | 32 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin()) == 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter_db1.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
