| /external/eigen/doc/examples/ |
| Tutorial_BlockOperations_vector.cpp | 11 cout << "v.tail<3>() = " << endl << v.tail<3>() << endl << endl;
|
| /external/llvm/test/CodeGen/AArch64/ |
| asm-large-immediate.ll | 6 tail call void asm sideeffect "/* result: ${0:c} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
8 tail call void asm sideeffect "/* result: ${0:n} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
|
| /external/llvm/test/CodeGen/ARM/ |
| inlineasm.ll | 4 %tmp56 = tail call i32 asm "uxtb16 $0,$1", "=r,r"( i32 %tmp54 ) ; <i32> [#uses=1]
9 tail call void asm sideeffect "/* number: ${0:c} */", "i"( i32 1 )
|
| inlineasm2.ll | 4 %tmp2 = tail call double asm "fsqrtd ${0:P}, ${1:P}", "=w,w"( double %x )
9 %tmp2 = tail call float asm "fsqrts $0, $1", "=w,w"( float %x )
|
| gpr-paired-spill-thumbinst.ll | 9 %val1 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
10 %val2 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
11 %val3 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
12 %val4 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
13 %val5 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
14 %val6 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
15 %val7 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
|
| /external/llvm/test/CodeGen/Generic/ |
| asm-large-immediate.ll | 6 tail call void asm sideeffect "/* result: ${0:c} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
8 tail call void asm sideeffect "/* result: ${0:n} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
|
| /external/llvm/test/CodeGen/Mips/ |
| asm-large-immediate.ll | 5 tail call void asm sideeffect "/* result: ${0:c} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
7 tail call void asm sideeffect "/* result: ${0:n} */", "i,~{dirflag},~{fpsr},~{flags}"( i64 68719476738 )
|
| /external/llvm/test/CodeGen/X86/ |
| tail-call-attrs.ll | 4 ; a barrier to tail calls.
9 %call = tail call zeroext i1 @give_bool()
14 ; so a tail call is impossible (well, according to current Clang practice
23 %call = tail call zeroext i32 @give_i32()
29 ; these both mean something they are incompatible so no tail call is possible.
37 %call = tail call zeroext i16 @give_unsigned_i16()
46 %val = tail call inreg i32 @give_i32_inreg()
54 %val = tail call i32 @give_i32()
|
| trap.ll | 7 tail call void @llvm.trap( )
15 tail call void @llvm.debugtrap( )
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| literals.py | 20 all, tail = m.group(0, 1)
22 esc = simple_escapes.get(tail)
25 if tail.startswith("x"):
26 hexes = tail[1:]
28 raise ValueError("invalid hex string escape ('\\%s')" % tail)
32 raise ValueError("invalid hex string escape ('\\%s')" % tail)
35 i = int(tail, 8)
37 raise ValueError("invalid octal string escape ('\\%s')" % tail)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| literals.py | 20 all, tail = m.group(0, 1)
22 esc = simple_escapes.get(tail)
25 if tail.startswith("x"):
26 hexes = tail[1:]
28 raise ValueError("invalid hex string escape ('\\%s')" % tail)
32 raise ValueError("invalid hex string escape ('\\%s')" % tail)
35 i = int(tail, 8)
37 raise ValueError("invalid octal string escape ('\\%s')" % tail)
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts2.test | 54 set tail [file tail $testfile]
55 if {[lsearch -exact $EXCLUDE $tail]>=0} continue
56 if {[llength $INCLUDE]>0 && [lsearch -exact $INCLUDE $tail]<0} continue
60 puts "$tail did not close all files: $sqlite_open_file_count"
61 fail_test $tail
|
| mallocAll.test | 52 set tail [file tail $testfile]
53 if {[lsearch -exact $EXCLUDE $tail]>=0} continue
54 if {[llength $INCLUDE]>0 && [lsearch -exact $INCLUDE $tail]<0} continue
58 puts "$tail did not close all files: $sqlite_open_file_count"
59 fail_test $tail
|
| /external/javassist/src/main/javassist/compiler/ast/ |
| CondExpr.java | 32 public ASTree thenExpr() { return tail().head(); }
34 public void setThen(ASTree t) { tail().setHead(t); }
36 public ASTree elseExpr() { return tail().tail().head(); }
38 public void setElse(ASTree t) { tail().tail().setHead(t); }
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/list/ |
| adt.hpp | 24 # define BOOST_PP_LIST_CONS(head, tail) (head, tail)
40 # define BOOST_PP_LIST_FIRST_I(head, tail) head
52 # define BOOST_PP_LIST_REST_I(head, tail) tail
59 # define BOOST_PP_LIST_IS_CONS_(head, tail) 1
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...] |
| /external/mesa3d/src/mesa/drivers/dri/intel/ |
| intel_resolve_map.c | 41 struct intel_resolve_map **tail = &head->next; local
44 while (*tail) {
45 if ((*tail)->level == level && (*tail)->layer == layer) {
46 (*tail)->need = need;
49 prev = *tail;
50 tail = &(*tail)->next;
53 *tail = malloc(sizeof(**tail));
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| bswap-fold.ll | 10 %tmp34 = tail call i32 @llvm.bswap.i32( i32 %tmp )
18 %tmp34 = tail call i64 @llvm.bswap.i64( i64 %tmp )
31 %tmp2 = tail call i32 @llvm.bswap.i32( i32 %a )
39 %tmp2 = tail call i32 @llvm.bswap.i32( i32 %a )
40 %tmp4 = tail call i32 @llvm.bswap.i32( i32 %tmp2 )
47 %tmp2 = tail call i32 @llvm.bswap.i32( i32 %a )
54 %B = tail call i32 @llvm.bswap.i32(i32 %A) nounwind
56 %D = tail call i16 @llvm.bswap.i16(i16 %C) nounwind
61 %B = tail call i64 @llvm.bswap.i64(i64 %A) nounwind
63 %D = tail call i16 @llvm.bswap.i16(i16 %C) nounwin
[all...] |
| /external/chromium_org/base/containers/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
35 // tail to head, as determined by |forward|), we get back |node_ids|,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
55 SCOPED_TRACE("Iterating forward (from head to tail)");
59 SCOPED_TRACE("Iterating backward (from tail to head)");
67 EXPECT_EQ(list.end(), list.tail());
79 EXPECT_EQ(&n1, list.tail());
89 EXPECT_EQ(&n2, list.tail());
99 EXPECT_EQ(&n3, list.tail());
122 EXPECT_EQ(&n5, list.tail());
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| hash.h | 116 /* tail */
118 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
123 case 3: k1 ^= tail[2] << 16;
124 case 2: k1 ^= tail[1] << 8;
125 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
188 /* tail */
190 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
197 case 15: k4 ^= tail[14] << 16;
198 case 14: k4 ^= tail[13] << 8;
199 case 13: k4 ^= tail[12] << 0
276 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...] |
| /external/llvm/test/Analysis/BasicAA/ |
| cs-cs.ll | 38 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
39 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
45 ; CHECK: Both ModRef: Ptr: i8* %P <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
46 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
47 ; CHECK: Both ModRef: Ptr: i8* %P <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
48 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
49 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
50 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false) <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false
[all...] |
| /external/chromium_org/media/formats/common/ |
| offset_byte_queue.cc | 25 DVLOG(4) << "Buffer pushed. head=" << head() << " tail=" << tail();
41 if (offset < head() || offset >= tail()) {
47 *size = tail() - offset;
52 if (max_offset > tail()) {
|
| /external/clang/test/CodeGen/ |
| atomic-ops-libcall.c | 10 // CHECK: {{%[^ ]*}} = tail call i32* @__atomic_fetch_add_4(i8* {{%[0-9]+}}, i32 12, i32 5)
16 // CHECK: {{%[^ ]*}} = tail call i32* @__atomic_fetch_sub_4(i8* {{%[0-9]+}}, i32 20, i32 5)
22 // CHECK: {{%[^ ]*}} = tail call i32 bitcast (i32* (i8*, i32, i32)* @__atomic_fetch_add_4 to i32 (i8*, i32, i32)*)(i8* {{%[0-9]+}}, i32 3, i32 5)
28 // CHECK: {{%[^ ]*}} = tail call i32 bitcast (i32* (i8*, i32, i32)* @__atomic_fetch_sub_4 to i32 (i8*, i32, i32)*)(i8* {{%[0-9]+}}, i32 5, i32 5)
34 // CHECK: {{%[^ ]*}} = tail call i32* @__atomic_fetch_sub_4(i8* {{%[0-9]+}}, i32 4, i32 0)
|
| /external/icu/icu4c/source/layout/ |
| LEInsertionList.cpp | 26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
28 tail = (InsertionRecord *) &head;
45 tail = (InsertionRecord *) &head;
74 tail->next = insertion;
75 tail = insertion;
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| IntQueue.java | 29 private IntQueue.Entry tail; field in class:IntQueue
33 if (tail != null)
34 tail.next = entry;
35 tail = entry;
52 tail = null;
|
