| /external/smack/src/org/xbill/DNS/ |
| NSEC3Record.java | 11 * Next SECure name 3 - this record contains the next hashed name in an
52 private byte [] next; field in class:NSEC3Record
74 * @param next The next hash (may not be null).
78 int flags, int iterations, byte [] salt, byte [] next,
95 if (next.length > 255) {
96 throw new IllegalArgumentException("Invalid next hash");
98 this.next = new byte[next.length]
[all...] |
| /external/valgrind/main/gdbserver_tests/ |
| mcbreak.stdinB.gdb | 30 next
36 next
40 next
44 next
51 print whoami("after next: inferior call pushed from mcbreak.stdinB.gdb")
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| upper_bound.pass.cpp | 45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 9));
75 assert(r == next(m.begin(), 3));
77 assert(r == next(m.begin(), 3));
79 assert(r == next(m.begin(), 6));
81 assert(r == next(m.begin(), 6));
83 assert(r == next(m.begin(), 9))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == Emplaceable(1, 2.5));
40 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == Emplaceable(1, 2.5));
44 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == Emplaceable(3, 4.5));
51 assert(*next(c.begin(), 2) == Emplaceable(1, 2.5));
52 assert(*next(c.begin(), 3) == Emplaceable(2, 3.5))
[all...] |
| insert_after_rv.pass.cpp | 35 assert(i == next(c.begin()));
37 assert(*next(c.begin()) == 1);
40 i = c.insert_after(next(c.cbegin()), 2);
41 assert(i == next(c.begin(), 2));
43 assert(*next(c.begin()) == 1);
44 assert(*next(c.begin(), 2) == 2);
48 assert(i == next(c.begin()));
50 assert(*next(c.begin(), 1) == 3);
51 assert(*next(c.begin(), 2) == 1);
52 assert(*next(c.begin(), 3) == 2)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| next_prior.hpp | 23 BOOST_MPL_AUX_COMMON_NAME_WKND(next)
29 struct next struct in namespace:boost::mpl
31 typedef typename T::next type;
32 BOOST_MPL_AUX_LAMBDA_SUPPORT(1,next,(T))
44 BOOST_MPL_AUX_NA_SPEC(1, next)
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| next_prior.hpp | 10 // 13 Dec 2003 Added next(x, n) and prior(x, n) (Daniel Walker)
25 // const std::list<T>::iterator next = boost::next(prev, 2);
30 inline T next(T x) { return ++x; } function in namespace:boost
33 inline T next(T x, Distance n) function in namespace:boost
|
| /dalvik/dx/tests/091-ssa-const-collector/ |
| expected.txt | 8 next 000b
13 next 0000
20 next 000a
31 next 0005
36 next 000b *
37 next 0018
45 next 0005
51 next 001a
56 next 0020 *
57 next 005
[all...] |
| /dalvik/dx/tests/086-ssa-edge-split/ |
| expected.txt | 9 next 0004
15 next 000b
22 next 0000
33 next 000a
44 next 0002
51 next 0030
52 next 002d *
59 next 0031
60 next 002e *
67 next 000
[all...] |
| /external/chromium_org/third_party/mesa/src/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/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) {
87 heap->next = block;
93 block->next = heap;
113 /* break left [p, newblock, p->next], then p = newblock */
123 newblock->next = p->next;
125 p->next->prev = newblock;
126 p->next = newblock;
137 /* break right, also [p, newblock, p->next] */
290 struct mem_block *next = p->next; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next = p
478 Instruction *insn, *next; local
[all...] |
| nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) {
30 next = item->next;
33 head.next = head.prev = &head;
43 pos = pos->next;
56 pos = pos->next;
67 ins->next = pos->next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| mm.c | 42 for(p = heap->next; p != heap; p = p->next) {
78 heap->next = block;
84 block->next = heap;
104 /* break left [p, newblock, p->next], then p = newblock */
114 newblock->next = p->next;
116 p->next->prev = newblock;
117 p->next = newblock;
128 /* break right, also [p, newblock, p->next] */
277 struct mem_block *next = p->next; local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| IntMap.java | 99 for (Entry e = table[i]; e != null; e = e.next){
110 for (Entry e = table[index]; e != null; e = e.next){
120 for (Entry e = table[index]; e != null; e = e.next){
131 for (Entry e = table[index]; e != null; e = e.next){
151 Entry next = e.next; local
153 e.next = newTable[index];
155 e = next;
172 Entry next = e.next; local
236 public Entry next() { method in class:IntMap.IntMapIterator
275 Entry next; field in class:IntMap.Entry
[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/mesa3d/src/gallium/auxiliary/util/ |
| u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) {
87 heap->next = block;
93 block->next = heap;
113 /* break left [p, newblock, p->next], then p = newblock */
123 newblock->next = p->next;
125 p->next->prev = newblock;
126 p->next = newblock;
137 /* break right, also [p, newblock, p->next] */
290 struct mem_block *next = p->next; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next = p
478 Instruction *insn, *next; local
[all...] |
| nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) {
30 next = item->next;
33 head.next = head.prev = &head;
43 pos = pos->next;
56 pos = pos->next;
67 ins->next = pos->next;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| mm.c | 42 for(p = heap->next; p != heap; p = p->next) {
78 heap->next = block;
84 block->next = heap;
104 /* break left [p, newblock, p->next], then p = newblock */
114 newblock->next = p->next;
116 p->next->prev = newblock;
117 p->next = newblock;
128 /* break right, also [p, newblock, p->next] */
277 struct mem_block *next = p->next; local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_genexps.py | 34 Test direct calls to next()
37 >>> g.next()
39 >>> g.next()
41 >>> g.next()
43 >>> g.next()
46 g.next()
51 >>> g.next()
54 g.next()
162 ... print "creator", r.next()
186 >>> g = (me.next() for i in xrange(10)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_genexps.py | 34 Test direct calls to next()
37 >>> g.next()
39 >>> g.next()
41 >>> g.next()
43 >>> g.next()
46 g.next()
51 >>> g.next()
54 g.next()
162 ... print "creator", r.next()
186 >>> g = (me.next() for i in xrange(10)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CounterNode.cpp | 103 CounterNode* next; local
104 while (!(next = current->m_nextSibling)) {
109 return next;
114 if (CounterNode* next = m_firstChild)
115 return next;
210 m_rootRenderer->invalidate(); // This makes m_rootRenderer point to the next renderer if any since it disconnects the m_rootRenderer from this.
250 CounterNode* next; local
253 next = refChild->m_nextSibling;
256 next = m_firstChild;
263 if (next) {
327 CounterNode* next = oldChild->m_nextSibling; local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| nrvo.cpp | 17 // CHECK-NEXT: ret void
20 // CHECK-EH-NEXT: ret void
28 // CHECK-NEXT: ret void
34 // CHECK-EH-NEXT: ret void
49 // CHECK-NEXT: call {{.*}} @_ZN1XC1Ev
59 // CHECK-EH-NEXT: invoke {{.*}} @_ZN1XC1Ev
72 // CHECK-EH-NEXT: cleanup
73 // CHECK-EH-NEXT: extractvalue { i8*, i32 } [[CAUGHTVAL]], 0
74 // CHECK-EH-NEXT: extractvalue { i8*, i32 } [[CAUGHTVAL]], 1
75 // CHECK-EH-NEXT: br labe
[all...] |
| /external/e2fsprogs/e2fsck/ |
| region.c | 25 struct region_el *next; member in struct:region_el
49 struct region_el *r, *next; local
51 for (r = region->allocated; r; r = next) {
52 next = r->next;
61 struct region_el *r, *new_region, *prev, *next; local
77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
87 if ((next = r->next)) {
88 if (end > next->start
[all...] |
