HomeSort by relevance Sort by last modified time
    Searched full:tail (Results 276 - 300 of 3492) sorted by null

<<11121314151617181920>>

  /external/llvm/test/CodeGen/PowerPC/
rounding-ops.ll 7 %call = tail call float @floorf(float %x) nounwind readnone
19 %call = tail call double @floor(double %x) nounwind readnone
31 %call = tail call float @roundf(float %x) nounwind readnone
43 %call = tail call double @round(double %x) nounwind readnone
55 %call = tail call float @ceilf(float %x) nounwind readnone
67 %call = tail call double @ceil(double %x) nounwind readnone
79 %call = tail call float @truncf(float %x) nounwind readnone
91 %call = tail call double @trunc(double %x) nounwind readnone
  /external/llvm/test/CodeGen/X86/
btq.ll 14 tail call void @bar() nounwind
30 tail call void @bar() nounwind
byval6.ll 9 tail call void (i32, ...) @bar( i32 3, %struct.W* byval @.cpx ) nounwind
10 tail call void (i32, ...) @baz( i32 3, %struct.W* byval @B ) nounwind
or-branch.ll 5 %tmp = tail call i32 (...) @bar( ) ; <i32> [#uses=0]
12 %tmp5 = tail call i32 (...) @bar( ) ; <i32> [#uses=0]
pr3457.ll 7 %0 = tail call double (...) @test() nounwind ; <double> [#uses=2]
8 %1 = tail call double (...) @test() nounwind ; <double> [#uses=2]
returned-trunc-tail-calls.ll 11 tail call i32 @ret32(i32 returned %in)
20 tail call i64 @ret64(i64 returned %val)
29 tail call i32 @ret32(i32 returned %small)
46 tail call {i32, i8} @take_i32_i8({i32, i8} returned %callval)
57 %val = tail call {i32, {i32, i32}} @give_i32_i32_i32()
73 tail call i64 @ret64(i64 returned undef)
80 %agg = tail call {i32, {i32, i32}} @give_i32_i32_i32()
93 %val = tail call {i32, {i32, i32}} @give_i32_i32_i32()
stackmap-nops.ll 196 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 0, i32 0)
197 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 1, i32 1)
198 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 2, i32 2)
199 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 3, i32 3)
200 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 4, i32 4)
201 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 5, i32 5)
202 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 6, i32 6)
203 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 7, i32 7)
204 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 8, i32 8)
205 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 9, i32 9
    [all...]
tail-threshold.ll 1 ; RUN: llc -mtriple=x86_64-pc-linux-gnu -tail-merge-threshold 2 < %s | FileCheck %s
4 ; tail-merge-threshold predecessors.
tailcall-calleesave.ll 15 %d = tail call i32* @bar(i32* %a) nounwind
17 tail call fastcc void @foo(i32 1, i32 2, i32 3, i32 4, i32 5, i32 6) nounwind
tailcall-cgp-dup.ll 3 ; Teach CGP to dup returns to enable tail call optimization.
20 %call = tail call i32 @f1() nounwind
25 %call2 = tail call i32 @f2() nounwind
30 %call4 = tail call i32 @f3() nounwind
35 %call6 = tail call i32 @f4() nounwind
40 %call8 = tail call i32 @f5() nounwind
45 %call10 = tail call i32 @f6() nounwind
80 %call4.i = tail call i8* @bar(i8* undef) optsize
tailcall-fastisel.ll 7 %tmp20 = tail call fastcc i8* @"visit_array_aux<`Reference>"(%0 %arg, i32 undef) ; <i8*> [#uses=1]
14 %0 = tail call i32 (...) @bar() nounwind ; <i32> [#uses=1]
x32-function_pointer-2.ll 15 tail call void %foo(i8* %h) nounwind
18 tail call void %foo(i8* %h) nounwind
  /external/llvm/test/Object/Inputs/
trivial.ll 5 %call = tail call i32 @puts(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str, i32 0, i32 0)) nounwind
6 tail call void bitcast (void (...)* @SomeOtherFunction to void ()*)() nounwind
  /external/llvm/test/Transforms/ArgumentPromotion/
tail.ll 13 ; CHECK-NOT: tail
15 tail call i8* @foo(%pair* %Data)
  /external/llvm/test/Transforms/ConstantHoisting/X86/
stackmap.ll 10 ; CHECK: tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 1, i32 24, i128 %const)
13 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 1, i32 24, i128 134646182756734033220)
  /external/llvm/test/Transforms/GlobalOpt/
deadfunction.ll 18 tail call void @aa() nounwind
22 tail call void @bb() nounwind
  /external/llvm/test/Transforms/IPConstantProp/
user-with-multiple-uses.ll 9 ; CHECK-NEXT: %call2 = tail call i32 @wwrite(i64 0) [[NUW:#[0-9]+]]
14 %call2 = tail call i32 @wwrite(i64 0) nounwind
  /external/llvm/test/Transforms/InstCombine/
call-cast-target.ll 36 ; CHECK-NEXT: %[[call:.*]] = tail call i32 @fn1(i32 %[[cast]])
39 %call = tail call i32 bitcast (i32 (i32)* @fn1 to i32 (i32*)*)(i32* %a)
47 ; CHECK: %[[call:.*]] = tail call i32 bitcast (i32 (i16)* @fn2 to i32 (i32*)*)(i32* %a)
50 %call = tail call i32 bitcast (i32 (i16)* @fn2 to i32 (i32*)*)(i32* %a)
58 ; CHECK: %[[call:.*]] = tail call i32 bitcast (i32 (i64)* @fn3 to i32 (i32*)*)(i32* %a)
61 %call = tail call i32 bitcast (i32 (i64)* @fn3 to i32 (i32*)*)(i32* %a)
69 ; CHECK: %[[call:.*]] = tail call i32 bitcast (i32 (i32)* @fn4 to i32 (i32*)*)(i32* %a)
72 %call = tail call i32 bitcast (i32 (i32)* @fn4 to i32 (i32*)*)(i32* %a)
fold-sqrt-sqrtf.ll 9 ; CHECK: %call = tail call double @sqrt(double %conv)
12 %call = tail call double @sqrt(double %conv)
  /external/marisa-trie/tests/
Makefile.am 8 tail-test \
25 tail_test_SOURCES = tail-test.cc
  /external/marisa-trie/v0_1_5/tests/
Makefile.am 8 tail-test \
25 tail_test_SOURCES = tail-test.cc
  /external/selinux/checkpolicy/
queue.c 21 q->head = q->tail = NULL;
41 q->head = q->tail = newnode;
43 q->tail->next = newnode;
44 q->tail = newnode;
65 q->head = q->tail = newnode;
88 q->tail = NULL;
160 q->tail = last;
164 q->tail = NULL;
  /frameworks/rs/driver/runtime/ll64/
math.ll 12 %1 = tail call float @llvm.sqrt.f32(float %v)
17 %1 = tail call float @llvm.pow.f32(float %v1, float %v2)
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_dict.py 51 tail=any*
58 tail = results["tail"]
67 tail = [n.clone() for n in tail]
68 special = not tail and self.in_special_context(node, isiter)
78 if tail:
79 new = pytree.Node(syms.power, [new] + tail)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_dict.py 51 tail=any*
58 tail = results["tail"]
67 tail = [n.clone() for n in tail]
68 special = not tail and self.in_special_context(node, isiter)
78 if tail:
79 new = pytree.Node(syms.power, [new] + tail)

Completed in 331 milliseconds

<<11121314151617181920>>