| /external/llvm/test/Transforms/SimplifyCFG/ |
| switch-on-const-select.ll | 19 tail call void @bees.a() nounwind
25 tail call void @bees.b() nounwind
29 tail call void @llvm.trap() nounwind
38 ; CHECK-NEXT: tail call void @bees.a() [[NUW:#[0-9]+]]
49 tail call void @bees.a() nounwind
52 tail call void @bees.b() nounwind
55 tail call void @llvm.trap() nounwind
64 ; CHECK-NEXT: tail call void @bees.b() [[NUW]]
74 tail call void @bees.a() nounwind
77 tail call void @bees.b() nounwin
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_list.c | 51 new_list->tail = NULL;
110 if (list->tail == NULL) {
112 list->tail = item;
116 list->tail->next = item;
117 list->tail = item;
132 if (list->tail == NULL) {
134 list->tail = item;
156 if (curr == list->tail) {
158 return list->tail;
187 if (list->tail == NULL)
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/decoder/ |
| UnboundedFifoByteBuffer.java | 59 protected int tail; field in class:UnboundedFifoByteBuffer
86 tail = 0;
97 if (tail < head) {
98 size = buffer.length - head + tail;
100 size = tail - head;
127 for (int i = head; i != tail;) {
140 tail = j;
143 buffer[tail] = b;
144 tail++;
145 if (tail >= buffer.length)
[all...] |
| /packages/services/Telephony/src/org/apache/james/mime4j/decoder/ |
| UnboundedFifoByteBuffer.java | 59 protected int tail; field in class:UnboundedFifoByteBuffer
86 tail = 0;
97 if (tail < head) {
98 size = buffer.length - head + tail;
100 size = tail - head;
127 for (int i = head; i != tail;) {
140 tail = j;
143 buffer[tail] = b;
144 tail++;
145 if (tail >= buffer.length)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/psdk_inc/ |
| _xmitfile.h | 13 LPVOID Tail;
|
| /external/llvm/test/CodeGen/Thumb2/ |
| 2013-02-19-tail-call-register-hint.ll | 3 ; Check to make sure the tail-call return at the end doesn't use a
17 tail call void @abc(%"myclass"* %2) nounwind
18 tail call void @def(%"myclass"* %2) nounwind
22 tail call void @ghi(i8* %5) nounwind
32 %13 = tail call %"myclass"* @jkl(%"myclass"* %2) nounwind
33 tail call void @mno(i8* %Data) nounwind
37 tail call void %7(i8* %10) nounwind
|
| /external/llvm/test/Transforms/JumpThreading/ |
| assume.ll | 9 tail call void @llvm.assume(i1 %cmp)
24 tail call void (...) @bar() #1
28 tail call void (...) @car() #1
39 tail call void @llvm.assume(i1 %cmp)
45 ; CHECK: tail call void @llvm.assume
46 ; CHECK: tail call void (...) @bar()
51 tail call void (...) @bar() #1
|
| /external/llvm/test/CodeGen/AArch64/ |
| sibling-call.ll | 10 tail call void @callee_stack0()
19 tail call void @callee_stack0()
28 ; can't be a tail call.
29 tail call void @callee_stack8([8 x i32] undef, i64 42)
39 tail call void @callee_stack8([8 x i32] undef, i64 42)
48 ; Shouldn't be a tail call: we can't use SP+8 because our caller might
51 tail call void @callee_stack16([8 x i32] undef, i64 undef, i64 undef)
61 tail call void @callee_stack8([8 x i32] undef, i64 42)
73 tail call void @callee_stack16([8 x i32] undef, i64 %b, i64 %a)
92 tail call void %fptr(i32 42
[all...] |
| arm64-memset-to-bzero.ll | 12 tail call void @llvm.memset.p0i8.i64(i8* %ptr, i8 0, i64 256, i32 1, i1 false)
24 tail call void @llvm.memset.p0i8.i64(i8* %ptr, i8 0, i64 257, i32 1, i1 false)
35 tail call void @llvm.memset.p0i8.i64(i8* %ptr, i8 0, i64 %conv, i32 1, i1 false)
44 %tmp = tail call i64 @llvm.objectsize.i64(i8* %ptr, i1 false)
45 %call = tail call i8* @__memset_chk(i8* %ptr, i32 0, i64 256, i64 %tmp)
59 %tmp = tail call i64 @llvm.objectsize.i64(i8* %ptr, i1 false)
60 %call = tail call i8* @__memset_chk(i8* %ptr, i32 0, i64 257, i64 %tmp)
71 %tmp = tail call i64 @llvm.objectsize.i64(i8* %ptr, i1 false)
72 %call = tail call i8* @__memset_chk(i8* %ptr, i32 0, i64 %conv, i64 %tmp)
84 %tmp = tail call i64 @llvm.objectsize.i64(i8* %ptr, i1 false
[all...] |
| arm64-call-tailcalls.ll | 13 %tmp.upgrd.2 = tail call i32 %tmp()
20 tail call void @t2()
27 %tmp = tail call double @sin(double %a) nounwind readonly
34 %tmp = tail call float @sinf(float %a) nounwind readonly
46 tail call void @bar() nounwind
50 tail call void @foo() nounwind
64 %call = tail call i32 @a(i32 %x) nounwind
73 %call4 = tail call i32 @b(i32 %x) nounwind
77 %call6 = tail call i32 @c(i32 %x) nounwind
|
| tail-call.ll | 12 tail call fastcc void @callee_stack0()
21 tail call fastcc void @callee_stack0()
34 tail call fastcc void @callee_stack8([8 x i32] undef, i64 42)
46 tail call fastcc void @callee_stack8([8 x i32] undef, i64 42)
60 tail call fastcc void @callee_stack16([8 x i32] undef, i64 42, i64 2)
74 tail call fastcc void @callee_stack8([8 x i32] undef, i64 42)
88 tail call fastcc void @callee_stack16([8 x i32] undef, i64 %b, i64 %a)
98 ; Weakly-referenced extern functions cannot be tail-called, as AAELF does
103 tail call void @callee_weak()
|
| /external/okhttp/okio/okio/src/main/java/okio/ |
| InflaterSource.java | 66 Segment tail = sink.writableSegment(1); local
67 int bytesInflated = inflater.inflate(tail.data, tail.limit, Segment.SIZE - tail.limit);
69 tail.limit += bytesInflated;
75 if (tail.pos == tail.limit) {
76 // We allocated a tail segment, but didn't end up needing it. Recycle!
77 sink.head = tail.pop();
78 SegmentPool.recycle(tail);
[all...] |
| /external/compiler-rt/lib/builtins/ppc/ |
| fixunstfdi.c | 26 /* If the tail is non-zero, we need to patch in the tail bits. */
33 /* At this point we have the mantissa of |tail| */
38 /* Now we have the mantissa of tail as a signed 2s-complement integer */
42 /* Shift the tail mantissa into the right position, accounting for the
|
| /external/llvm/test/CodeGen/ARM/ |
| noreturn.ll | 9 tail call void @overflow() #0
30 tail call void @overflow() #0
42 tail call void @overflow_with_unwind() #1
51 tail call void @overflow() #0
59 tail call void @overflow_with_unwind() #1
|
| returned-trunc-tail-calls.ll | 10 tail call i16 @ret16(i16 returned %in)
18 tail call i16 @ret16(i16 returned %in)
35 tail call {i32, i8} @take_i32_i8({i32, i8} returned %callval)
46 %val = tail call {i32, {i32, i32}} @give_i32_i32_i32()
63 tail call i32 @ret32(i32 returned undef)
70 %agg = tail call {i32, {i32, i32}} @give_i32_i32_i32()
83 %val = tail call {i32, {i32, i32}} @give_i32_i32_i32()
93 %val = tail call i64 @give_i64()
101 %agg = tail call {i64, i32} @give_i64_i32()
|
| /external/llvm/test/CodeGen/X86/ |
| prefetch.ll | 19 tail call void @llvm.prefetch( i8* %ptr, i32 0, i32 1, i32 1 )
20 tail call void @llvm.prefetch( i8* %ptr, i32 0, i32 2, i32 1 )
21 tail call void @llvm.prefetch( i8* %ptr, i32 0, i32 3, i32 1 )
22 tail call void @llvm.prefetch( i8* %ptr, i32 0, i32 0, i32 1 )
23 tail call void @llvm.prefetch( i8* %ptr, i32 1, i32 3, i32 1 )
|
| sibcall-2.ll | 4 ; Tail call should not use ebp / rbp after it's popped. Use esp / rsp.
14 tail call void %0() nounwind
26 tail call void %0() nounwind
38 tail call void %0() nounwind
50 tail call void %0() nounwind
|
| 2009-08-23-SubRegReuseUndo.ll | 15 %1 = tail call i32 @func_24(i16 zeroext %0, i8 signext ptrtoint (i8 (i32, i8)* @foo to i8)) nounwind; <i32> [#uses=1]
18 %4 = tail call i32 @safe(i32 1) nounwind ; <i32> [#uses=0]
19 %5 = tail call i32 @func_24(i16 zeroext 0, i8 signext undef) nounwind; <i32> [#uses=1]
25 %11 = tail call i32 @func_24(i16 zeroext ptrtoint (i8 (i32, i8)* @bar to i16), i8 signext %10) nounwind; <i32> [#uses=1]
26 %12 = tail call i32 @func_24(i16 zeroext 0, i8 signext 1) nounwind; <i32> [#uses=0]
38 %14 = tail call i32 @safe(i32 -2) nounwind ; <i32> [#uses=0]
40 %16 = tail call signext i8 @func_53(i8 signext undef, i8 signext 1, i8 signext %15, i8 signext %8) nounwind; <i8> [#uses=0]
50 %20 = tail call i32 @func_24(i16 zeroext %19, i8 signext 1) nounwind; <i32> [#uses=0]
56 %23 = tail call i32 (...) @safefuncts(i32 %21, i32 1) nounwind; <i32> [#uses=0]
|
| pr1489.ll | 11 %tmp1 = tail call i32 @lrintf( float 0x400FFDF3C0000000 ) ; <i32> [#uses=1]
21 %tmp1 = tail call i32 @lrint( double 3.999000e+00 ) ; <i32> [#uses=1]
31 %tmp1 = tail call i32 @lrintf( float 0x400FFDF3C0000000 ) ; <i32> [#uses=1]
39 %tmp1 = tail call i32 @lrintf( float 0x400FFDF3C0000000 ) ; <i32> [#uses=1]
47 %tmp = tail call i32 @baz( ) ; <i32> [#uses=1]
48 %tmp1 = tail call i32 @bar( ) ; <i32> [#uses=1]
49 %tmp2 = tail call i32 @foo( ) ; <i32> [#uses=1]
50 %tmp3 = tail call i32 @quux( ) ; <i32> [#uses=1]
51 %tmp5 = tail call i32 (i8*, ...) @printf( i8* getelementptr ([13 x i8], [13 x i8]* @.str, i32 0, i32 0), i32 %tmp3, i32 %tmp2, i32 %tmp1, i32 %tmp ) ; <i32> [#uses=0]
|
| /external/llvm/test/Transforms/Inline/ |
| byval-tail-call.ll | 4 ; Calls that capture byval parameters cannot be marked as tail calls. Other
5 ; tails that don't capture byval parameters can still be tail calls.
27 tail call void @ext(i32* null)
37 ; CHECK: tail call void @ext(i32* null)
39 tail call void @qux(i32* byval %x)
|
| /frameworks/rs/driver/runtime/arch/ |
| x86_sse3.ll | 10 %2 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %1, <4 x float> %1) nounwind readnone
11 %3 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %2, <4 x float> %2) nounwind readnone
20 %4 = tail call <2 x i64> @llvm.x86.sse2.psll.dq(<2 x i64> %3, i32 32)
22 %6 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %5, <4 x float> %5) nounwind readnone
23 %7 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %6, <4 x float> %6) nounwind readnone
31 %3 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %2, <4 x float> %2) nounwind readnone
43 %2 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %1, <4 x float> %1) nounwind readnone
44 %3 = tail call <4 x float> @llvm.x86.sse3.hadd.ps(<4 x float> %2, <4 x float> %2) nounwind readnone
46 %5 = tail call float @llvm.sqrt.f32(float %4) nounwind readnone
54 %4 = tail call <2 x i64> @llvm.x86.sse2.psll.dq(<2 x i64> %3, i32 32
[all...] |
| /system/bt/osi/src/ |
| list.c | 14 list_node_t *tail; member in struct:list_t
79 return list->tail->data;
94 if (list->tail == prev_node)
95 list->tail = node;
110 if (list->tail == NULL)
111 list->tail = list->head;
125 if (list->tail == NULL) {
127 list->tail = node;
129 list->tail->next = node;
130 list->tail = node
[all...] |
| /external/markdown/markdown/ |
| treeprocessors.py | 102 Process placeholders in Element.text or Element.tail
109 * isText: bool variable, True - it's text, False - it's tail
118 text = subnode.tail
119 subnode.tail = None
147 if result[-1].tail:
148 result[-1].tail += text
150 result[-1].tail = text
173 if child.tail:
174 if child.tail.strip():
232 if child.tail
[all...] |
| /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/ |
| Map.h | 47 node* tail; member in class:Map
52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 bool empty() const { return ( !head || !tail ); }
144 tail = new node(data, data2,tail, NULL);
145 if( tail->prev )
146 tail->prev->next = tail;
150 head = tail;
167 if((head == tail) && (head->data == d)
[all...] |
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/ |
| Map.h | 46 node* tail; member in class:Map
51 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 return ( !head || !tail );
149 tail = new node(data, data2,tail, NULL);
151 if ( tail->prev )
152 tail->prev->next = tail;
155 head = tail;
172 if ((head == tail) && (head->data == d))
[all...] |
