| /external/clang/test/Index/ |
| get-cursor-macro-args.m | 21 // CHECK-NEXT: ObjCMessageExpr=meth:2:8
22 // CHECK-NEXT: ObjCMessageExpr=meth:2:8
23 // CHECK-NEXT: ObjCMessageExpr=meth:2:8
24 // CHECK-NEXT: ObjCMessageExpr=meth:2:8
25 // CHECK-NEXT: ObjCClassRef=MyClass:1:12
|
| /external/doclava/test/doclava/ |
| ApiCheckTest.java | 52 assertEquals(Errors.CHANGED_TYPE, report.errors().iterator().next().error());
62 ErrorMessage m1 = errors.next();
63 ErrorMessage m2 = errors.next();
75 ErrorMessage m1 = errors.next();
76 ErrorMessage m2 = errors.next();
87 assertEquals(Errors.ADDED_CLASS, report.errors().iterator().next().error());
95 assertEquals(Errors.REMOVED_CLASS, report.errors().iterator().next().error());
103 assertEquals(Errors.CHANGED_SUPERCLASS, report.errors().iterator().next().error());
125 assertEquals(Errors.ADDED_INTERFACE, report.errors().iterator().next().error());
133 assertEquals(Errors.REMOVED_INTERFACE, report.errors().iterator().next().error())
[all...] |
| /external/e2fsprogs/lib/ss/ |
| get_readline.c | 47 char *tmp, *cp, *next; local
63 for (cp = tmp; cp; cp = next) {
64 next = strchr(cp, ':');
65 if (next)
66 *next++ = 0;
|
| /external/llvm/test/CodeGen/ARM/ |
| tail-opts.ll | 22 ; CHECK-NEXT: bx r
27 ; CHECK-NEXT: bx r
31 ; CHECK-NEXT: bx r
38 br i1 %a, label %A, label %next
39 next:
|
| /external/llvm/test/CodeGen/PowerPC/ |
| 2011-12-06-SpillAndRestoreCR.ll | 49 %indvars.iv = phi i64 [ 0, %for.cond5.preheader ], [ %indvars.iv.next.15, %for.body7 ]
69 %indvars.iv.next.146 = or i64 %indvars.iv, 2
70 %arrayidx9.2 = getelementptr inbounds [256 x [256 x float]]* @aa, i64 0, i64 %indvars.iv42, i64 %indvars.iv.next.146
73 %7 = trunc i64 %indvars.iv.next.146 to i32
77 %indvars.iv.next.247 = or i64 %indvars.iv, 3
78 %arrayidx9.3 = getelementptr inbounds [256 x [256 x float]]* @aa, i64 0, i64 %indvars.iv42, i64 %indvars.iv.next.247
81 %9 = trunc i64 %indvars.iv.next.247 to i32
85 %indvars.iv.next.348 = or i64 %indvars.iv, 4
86 %arrayidx9.4 = getelementptr inbounds [256 x [256 x float]]* @aa, i64 0, i64 %indvars.iv42, i64 %indvars.iv.next.348
89 %11 = trunc i64 %indvars.iv.next.348 to i3
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| fputs-1.ll | 22 ; CHECK-NEXT: ret void
31 ; CHECK-NEXT: call i32 @fputc(i32 65, %FILE* %fp)
33 ; CHECK-NEXT: ret void
40 ; CHECK-NEXT: call i32 @fwrite(i8* getelementptr inbounds ([7 x i8]* @hello, i32 0, i32 0), i32 6, i32 1, %FILE* %fp)
42 ; CHECK-NEXT: ret void
|
| memset_chk-1.ll | 18 ; CHECK-NEXT: call void @llvm.memset.p0i8.i64
27 ; CHECK-NEXT: call void @llvm.memset.p0i8.i64
36 ; CHECK-NEXT: call void @llvm.memset.p0i8.i64
47 ; CHECK-NEXT: call i8* @__memset_chk
56 ; CHECK-NEXT: call i8* @__memset_chk
|
| strspn-1.ll | 21 ; CHECK-NEXT: ret i64 0
32 ; CHECK-NEXT: ret i64 0
44 ; CHECK-NEXT: ret i64 5
53 ; CHECK-NEXT: %ret = call i64 @strspn(i8* %str, i8* %pat)
55 ; CHECK-NEXT: ret i64 %ret
|
| /external/llvm/test/Transforms/SCCP/ |
| sccptest.ll | 37 ; CHECK-NEXT: br i1 true, label %BB5, label %BB6
41 ; CHECK-NEXT: ret i32 1
49 ; CHECK-NEXT: br label %BB7
55 ; CHECK-NEXT: %k4 = phi i32 [ %k3, %BB5 ], [ undef, %BB6 ]
56 ; CHECK-NEXT: br label %BB2
|
| /external/llvm/unittests/ADT/ |
| TinyPtrVectorTest.cpp | 75 EXPECT_EQ(Values[i], *llvm::next(V.begin(), i));
77 EXPECT_EQ(V.end(), llvm::next(V.begin(), Values.size()));
337 this->V.erase(llvm::next(this->V.begin(), 1));
338 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 1));
340 this->V.erase(llvm::next(this->V.begin(), 2));
341 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 2));
343 this->V.erase(llvm::next(this->V.begin(), 5));
344 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 5));
346 this->V.erase(llvm::next(this->V.begin(), 13));
347 this->TestPtrs.erase(llvm::next(this->TestPtrs.begin(), 13))
[all...] |
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 11 * The above copyright notice and this permission notice (including the next
35 struct memory_block * next; member in struct:memory_block
48 pool->blocks = block->next;
62 newblock->next = pool->blocks;
90 block->next = pool->blocks;
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| ContactParser.java | 61 final char next = lexer.lookAhead(1); local
62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
| /external/qemu/ |
| qlist.c | 70 QTAILQ_INSERT_TAIL(&qlist->head, entry, next);
84 QTAILQ_FOREACH(entry, &qlist->head, next)
98 QTAILQ_REMOVE(&qlist->head, entry, next);
150 QTAILQ_FOREACH_SAFE(entry, &qlist->head, next, next_entry) {
151 QTAILQ_REMOVE(&qlist->head, entry, next);
|
| /external/tcpdump/ |
| esp.h | 46 /*8bit*/ /* next header */
47 /*8bit*/ /* next header */
57 /*8bit*/ /* next header */
58 /*8bit*/ /* next header */
64 u_int8_t esp_nxt; /* Next header */
|
| /hardware/ti/omap4xxx/ |
| mapinfo.c | 43 mi->next = 0;
59 mi->next = milist;
74 mi = mi->next;
86 mi = mi->next;
103 mi = mi->next;
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldLinkedHashMapTest.java | 36 String id = (String) iterator.next();
39 iterator.next();
41 // iterator.next() Operation takes place after a get
52 id = (String) iterator.next();
54 iterator.next();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list_iter_iter.pass.cpp | 29 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin()));
41 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 2));
53 l1.splice(l1.begin(), l1, next(l1.begin()), next(l1.begin(), 3));
66 l1.splice(l1.begin(), l2, next(l2.begin()), l2.end());
86 l1.splice(next(l1.begin()), l2, next(l2.begin()), l2.end());
106 l1.splice(l1.end(), l2, next(l2.begin()), l2.end())
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| arg.hpp | 34 typedef arg<2> next; typedef in struct:arg
52 typedef arg<3> next; typedef in struct:arg
70 typedef arg<4> next; typedef in struct:arg
88 typedef arg<5> next; typedef in struct:arg
106 typedef arg<6> next; typedef in struct:arg
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| PathMatcher.java | 46 Node next = current.getChild(segments[i]); local
47 if (next == null) {
48 next = current.getChild("*");
49 if (next != null) {
55 current = next;
|
| /dalvik/vm/compiler/codegen/ |
| RallocUtil.cpp | 199 int next = *nextTemp; local
201 if (next >= numTemps)
202 next = 0;
203 if (!p[next].inUse && !p[next].live) {
204 dvmCompilerClobber(cUnit, p[next].reg);
205 p[next].inUse = true;
206 p[next].pair = false;
207 *nextTemp = next + 1;
208 return p[next].reg
237 int next = cUnit->regPool->nextFPTemp; local
[all...] |
| /external/chromium_org/base/containers/ |
| linked_list.h | 12 // list, as extending LinkNode (this gives it next/previous pointers).
18 // Next, to keep track of the list's head/tail, use a LinkedList instance:
37 // node = node->next()) {
71 // A. Doubly-linked lists are made up of nodes that contain "next" and
75 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
77 // needs to glue on the "next" and "previous" pointers using
86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
87 : previous_(previous), next_(next) {}
115 LinkNode<T>* next() const { function in class:base::LinkNode
137 // list (root_.next() will point back to the start of the list
[all...] |
| /external/chromium_org/cc/layers/ |
| layer_iterator.cc | 44 void LayerIteratorActions::BackToFront::Next(
47 // visit the next layer in the current RS layer list.
50 // then jump to the next RenderSurface. Save where we
51 // came from in the next RenderSurface so we can get back to it.
72 // and move to the next position there.
117 void LayerIteratorActions::FrontToBack::Next(
158 // Save where we were in the current target surface, move to the next one,
185 template CC_EXPORT void LayerIteratorActions::BackToFront::Next(
195 template CC_EXPORT void LayerIteratorActions::BackToFront::Next(
199 template CC_EXPORT void LayerIteratorActions::FrontToBack::Next(
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| tstnrapi.cpp | 27 if(norm.next()!=0xe4) {
28 dataerrln("error in Normalizer(CharacterIterator).next()");
33 if(copy.next()!=0xac00) {
34 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).next()");
46 if(clone->next()!=0x4e3d) {
47 dataerrln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next()");
51 errln("error in Normalizer(Normalizer(CharacterIterator)).clone()->next().hashCode()==copy.hashCode()");
103 if(copy.next()!=0x308 || copy.next()!=0x1100) {
135 if(norm.first()!=0x61 || norm.next()!=0x308 || norm.last()!=0x2f800)
[all...] |
| /external/chromium_org/third_party/zlib/ |
| gzread.c | 66 /* Get next byte from input, or -1 if end or error. */
67 #define NEXT() ((strm->avail_in == 0 && gz_avail(state) == -1) ? -1 : \
81 val = NEXT();
82 val += (unsigned)NEXT() << 8;
83 val += (unsigned long)NEXT() << 16;
84 ch = NEXT();
97 that the next available input data is the raw deflate stream. If direct
161 if (NEXT() != 8) { /* compression method */
165 flags = NEXT();
170 NEXT(); /* modification time *
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-gvn.cc | 68 int next; // Index in the array of the next list element. member in struct:v8::internal::HValueMap::HValueMapListElement
179 int next; local
180 for (int current = array_[i].next; current != kNil; current = next) {
181 next = lists_[current].next;
186 lists_[current].next = free_list_head_;
190 lists_[current].next = kept;
195 array_[i].next = kept
223 int next = array_[pos].next; local
263 int next = lists_[current].next; local
551 HInstruction* next = instr->next(); local
827 GvnBasicBlockState* next = local
[all...] |
