/external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/ |
TestUtils.java | 51 String tail = Integer.toHexString(0x000000ff & data[i]); local 52 if (tail.length() == 1) { 53 tail = "0" + tail; 55 System.out.print(prefix + "0x" + tail + delimiter);
|
/external/clang/test/CXX/temp/temp.fct.spec/temp.arg.explicit/ |
p9-0x.cpp | 7 template<unsigned N, typename Head, typename ...Tail> 8 struct get_nth_type<N, Head, Tail...> : get_nth_type<N-1, Tail...> { }; 10 template<typename Head, typename ...Tail> 11 struct get_nth_type<0, Head, Tail...> {
|
/external/llvm/test/CodeGen/AArch64/ |
arm64-big-endian-eh.ll | 26 %2 = tail call i8* @__cxa_begin_catch(i8* %1) #2 31 tail call void @__cxa_end_catch() 50 tail call void @__clang_call_terminate(i8* %5) #3 64 %2 = tail call i8* @__cxa_begin_catch(i8* %0) #2 65 tail call void @_ZSt9terminatev() #3
|
arm64-fcopysign.ll | 10 %0 = tail call float @copysignf(float %x, float %y) nounwind readnone 20 %0 = tail call double @copysign(double %x, double %y) nounwind readnone 32 %tmp = tail call double @copysign( double %a, double %tmp2 ) nounwind readnone 42 %0 = tail call double (...) @bar() nounwind 44 %2 = tail call float @copysignf(float 5.000000e-01, float %1) nounwind readnone
|
arm64-vpopcnt.ll | 9 %cnt = tail call <8 x i8> @llvm.ctpop.v8i8(<8 x i8> %x) 18 %cnt = tail call <4 x i16> @llvm.ctpop.v4i16(<4 x i16> %x) 27 %cnt = tail call <2 x i32> @llvm.ctpop.v2i32(<2 x i32> %x) 37 %cnt = tail call <16 x i8> @llvm.ctpop.v16i8(<16 x i8> %x) 46 %cnt = tail call <8 x i16> @llvm.ctpop.v8i16(<8 x i16> %x) 55 %cnt = tail call <4 x i32> @llvm.ctpop.v4i32(<4 x i32> %x) 64 %cnt = tail call <2 x i64> @llvm.ctpop.v2i64(<2 x i64> %x)
|
/external/llvm/test/CodeGen/ARM/ |
big-endian-eh-unwind.ll | 26 %2 = tail call i8* @__cxa_begin_catch(i8* %1) #2 31 tail call void @__cxa_end_catch() 50 tail call void @__clang_call_terminate(i8* %5) #3 64 %2 = tail call i8* @__cxa_begin_catch(i8* %0) #2 65 tail call void @_ZSt9terminatev() #3
|
fcopysign.ll | 14 %0 = tail call float @copysignf(float %x, float %y) nounwind readnone 28 %0 = tail call double @copysign(double %x, double %y) nounwind readnone 39 %1 = tail call double @copysign(double %0, double %z) nounwind readnone 51 %0 = tail call double (...) @bar() nounwind 53 %2 = tail call float @copysignf(float 5.000000e-01, float %1) nounwind readnone
|
2011-08-25-ldmia_ret.ll | 19 %call = tail call zeroext i1 @getbool() nounwind 23 %cmp = tail call zeroext i1 @getbool() nounwind 27 %cmp13 = tail call zeroext i1 @getbool() nounwind 31 tail call void @foo(i32 %in1) nounwind 47 %call20 = tail call i32 @bar(i32 %in2) nounwind 72 tail call void @foo(i32 %in2) nounwind 73 %call28 = tail call i32 @getint() nounwind 78 tail call void @foo(i32 %in2) nounwind 82 %cmp42 = tail call zeroext i1 @getbool() nounwind 86 %call50 = tail call i32 @getint() nounwin [all...] |
gpr-paired-spill.ll | 6 %val1 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 7 %val2 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 8 %val3 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 9 %val4 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 10 %val5 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 11 %val6 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr) 12 %val7 = tail call i64 asm sideeffect "ldrexd $0, ${0:H}, [r0]", "=&r,r"(i64* %addr)
|
/external/llvm/test/CodeGen/Mips/ |
brind.ll | 12 %puts = tail call i32 @puts(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @str, i32 0, i32 0)) 17 %puts5 = tail call i32 @puts(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @str5, i32 0, i32 0)) 22 %puts6 = tail call i32 @puts(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @str6, i32 0, i32 0)) 27 %puts7 = tail call i32 @puts(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @str7, i32 0, i32 0)) 34 %puts8 = tail call i32 @puts(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @str8, i32 0, i32 0))
|
/external/llvm/test/CodeGen/X86/ |
peep-test-4.ll | 17 tail call void @foo(i32 %sub) 35 tail call void @foo(i32 %ashr) 53 tail call void @foo(i32 %ashr) 71 tail call void @foo(i32 %ashr) 89 tail call void @foo(i32 %shl) 107 tail call void @foo(i32 %shl) 149 tail call void @foo(i32 %andn) 163 %bextr = tail call i32 @llvm.x86.bmi.bextr.32(i32 %x, i32 %y) 168 tail call void @foo(i32 %bextr) 182 %popcnt = tail call i32 @llvm.ctpop.i32(i32 %x [all...] |
sibcall-5.ll | 15 %0 = tail call double @sin(double %a) nounwind readonly 26 %0 = tail call float @sinf(float %a) nounwind readonly 51 %3 = tail call { double, double } bitcast (i8* (i8*, i8*, ...)* @objc_msgSend to { double, double } (i8*, i8*)*)(i8* %2, i8* %1) optsize 54 %6 = tail call double @floor(double %4) optsize 55 %7 = tail call double @floor(double %5) optsize
|
/external/llvm/test/MC/ARM/ |
elf-reloc-02.ll | 32 %0 = tail call i32 (...) @write(i32 1, i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str, i32 0, i32 0), i32 6) nounwind 33 %1 = tail call i32 (...) @write(i32 1, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str1, i32 0, i32 0), i32 7) nounwind 34 %2 = tail call i32 (...) @write(i32 1, i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str2, i32 0, i32 0), i32 12) nounwind 35 %3 = tail call i32 (...) @write(i32 1, i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str3, i32 0, i32 0), i32 6) nounwind 36 tail call void @exit(i32 55) noreturn nounwind
|
/external/llvm/test/Transforms/DeadStoreElimination/ |
free.ll | 16 tail call void @free(i8* %1) 28 tail call void @free(i8* %1) 50 %alloc1 = tail call noalias i8* @malloc(i64 4) nounwind 58 tail call void @free(i8* %alloc1) nounwind 67 tail call void @free(i8* undef) nounwind
|
pr11390.ll | 9 %call = tail call i64 @strlen(i8* %name) nounwind readonly 10 %call1 = tail call i64 @strlen(i8* %domain) nounwind readonly 14 %call4 = tail call noalias i8* @malloc(i64 %add3) nounwind 20 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %call4, i8* %name, i64 %call, i32 1, i1 false) 25 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %add.ptr5, i8* %domain, i64 %call1, i32 1, i1 false)
|
/external/llvm/test/Transforms/InstCombine/ |
assume.ll | 20 tail call void @llvm.assume(i1 %maskcond) 37 tail call void @llvm.assume(i1 %maskcond) 54 tail call void @llvm.assume(i1 %cmp) 63 tail call void @llvm.assume(i1 %and) 79 tail call void @llvm.assume(i1 %w) 101 tail call void @llvm.assume(i1 %cmp) 115 tail call void @llvm.assume(i1 %cmp) 131 tail call void @llvm.assume(i1 %x) 135 tail call void @llvm.assume(i1 %cmp) 137 tail call void @llvm.assume(i1 %y [all...] |
invoke.ll | 19 %0 = tail call i64 @llvm.objectsize.i64(i8* %call, i1 false) 26 tail call void @__cxa_call_unexpected(i8* %2) noreturn nounwind 39 %0 = tail call i64 @llvm.objectsize.i64(i8* %call, i1 false) 46 tail call void @__cxa_call_unexpected(i8* %2) noreturn nounwind 63 tail call void @__cxa_call_unexpected(i8* %2) noreturn nounwind
|
assume2.ll | 17 tail call void @llvm.assume(i1 %cmp) 33 tail call void @llvm.assume(i1 %cmp) 48 tail call void @llvm.assume(i1 %cmp) 64 tail call void @llvm.assume(i1 %cmp) 79 tail call void @llvm.assume(i1 %cmp) 94 tail call void @llvm.assume(i1 %cmp) 109 tail call void @llvm.assume(i1 %cmp) 124 tail call void @llvm.assume(i1 %cmp) 138 tail call void @llvm.assume(i1 %cmp) 152 tail call void @llvm.assume(i1 %cmp [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
u_fifo.h | 34 size_t tail; member in struct:util_fifo 46 fifo->tail = 0; 78 if (++fifo->tail >= fifo->size) 79 fifo->tail = 0; 81 *ptr = array[fifo->tail];
|
/libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
TestUtils.java | 52 String tail = Integer.toHexString(0x000000ff & data[i]); local 53 if (tail.length() == 1) { 54 tail = "0" + tail; 56 System.out.print(prefix + "0x" + tail + delimiter);
|
/bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
list.h | 24 #define LIST(type) struct { type *head, *tail; } 26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0) 40 #define TAIL(list) ((list).tail) 49 (list).tail = (elt); \ 58 if ((list).tail != NULL) \ 59 (list).tail->link.next = (elt); \ 62 (elt)->link.prev = (list).tail; \ 64 (list).tail = (elt); \ 73 INSIST((list).tail == (elt)); [all...] |
/external/llvm/test/CodeGen/BPF/ |
intrinsics.ll | 5 %1 = tail call i64 @llvm.bpf.load.byte(i8* %ctx, i64 123) #2 9 %5 = tail call i64 @llvm.bpf.load.byte(i8* %ctx2, i64 %foo) #2 24 %1 = tail call i64 @llvm.bpf.load.half(i8* %ctx, i64 123) #2 26 %3 = tail call i64 @llvm.bpf.load.half(i8* %ctx2, i64 %2) #2 39 %1 = tail call i64 @llvm.bpf.load.word(i8* %ctx, i64 123) #2 41 %3 = tail call i64 @llvm.bpf.load.word(i8* %ctx2, i64 %2) #2 54 %call = tail call i64 @llvm.bpf.pseudo(i64 2, i64 3) 55 tail call void @bar(i64 %call, i32 4) #2 67 %0 = tail call i64 @llvm.bswap.i64(i64 %a) 69 %1 = tail call i32 @llvm.bswap.i32(i32 %conv [all...] |
/external/opencv/cvaux/src/ |
extendededges.cpp | 137 CvSeq* tail = 0; local 184 if( tail ) 186 tail->v_next = newseq; 187 newseq->v_prev = tail; 188 tail = newseq; 192 output = tail = newseq; 204 if( tail ) 206 tail->v_next = newseq; 207 newseq->v_prev = tail; 208 tail = newseq [all...] |
/libcore/luni/src/main/java/java/util/ |
ArrayDeque.java | 62 * thus avoiding head and tail wrapping around to equal each 71 * arbitrary number equal to tail if the deque is empty. 76 * The index at which the next element would be added to the tail 79 private transient int tail; field in class:ArrayDeque 115 * when head and tail have wrapped around to become equal. 118 // assert head == tail; 130 tail = n; 141 if (head < tail) { 143 } else if (head > tail) { 146 System.arraycopy(elements, 0, a, headPortionLen, tail); [all...] |
/external/compiler-rt/lib/builtins/ppc/ |
fixtfdi.c | 32 /* If the tail is non-zero, we need to patch in the tail bits. */ 39 /* At this point we have the mantissa of |tail| */ 40 /* We need to negate it if head and tail have different signs. */ 45 /* Now we have the mantissa of tail as a signed 2s-complement integer */ 49 /* Shift the tail mantissa into the right position, accounting for the 78 /* If the tail is positive, the correct result is something other than INT64_MIN.
|