Home
last modified time | relevance | path

Searched full:tail (Results 1 – 25 of 6866) sorted by relevance

12345678910>>...275

/external/llvm/test/Transforms/BDCE/
Dbasic.ll9 %call = tail call signext i32 @foo(i32 signext 5) #0
12 %call1 = tail call signext i32 @foo(i32 signext 3) #0
15 %call4 = tail call signext i32 @foo(i32 signext 2) #0
18 %call7 = tail call signext i32 @foo(i32 signext 1) #0
21 %call10 = tail call signext i32 @foo(i32 signext 0) #0
24 %call13 = tail call signext i32 @foo(i32 signext 4) #0
31 ; CHECK-NOT: tail call signext i32 @foo(i32 signext 5)
32 ; CHECK-NOT: tail call signext i32 @foo(i32 signext 3)
33 ; CHECK: tail call signext i32 @foo(i32 signext 2)
34 ; CHECK: tail call signext i32 @foo(i32 signext 1)
[all …]
/external/llvm/test/CodeGen/AArch64/
Dfastcc.ll1 …triple=aarch64-none-linux-gnu -disable-fp-elim -tailcallopt | FileCheck %s -check-prefix CHECK-TAIL
3 …linux-gnu -disable-fp-elim -tailcallopt -aarch64-redzone | FileCheck %s -check-prefix CHECK-TAIL-RZ
14 ; CHECK-TAIL-LABEL: func_stack0:
15 ; CHECK-TAIL: sub sp, sp, #48
16 ; CHECK-TAIL-NEXT: stp x29, x30, [sp, #32]
17 ; CHECK-TAIL-NEXT: add x29, sp, #32
18 ; CHECK-TAIL: str w{{[0-9]+}}, [sp]
25 ; CHECK-TAIL: bl func_stack8
26 ; CHECK-TAIL: sub sp, sp, #16
34 ; CHECK-TAIL: bl func_stack32
[all …]
/external/mesa3d/src/amd/common/
Dac_linux_drm.h24 #define TAIL \ macro
38 #define TAIL
64 ac_drm_device **device_handle) TAIL;
66 PROC int ac_drm_device_get_fd(ac_drm_device *dev) TAIL;
68 struct amdgpu_bo_metadata *info) TAIL;
69 …int ac_drm_bo_query_info(ac_drm_device *dev, uint32_t bo_handle, struct amdgpu_bo_info *info) TAIL;
71 bool *busy) TAIL;
73 uint64_t addr, uint64_t flags, uint32_t ops) TAIL;
75 uint64_t addr, uint64_t flags, uint32_t ops) TAIL;
80 uint32_t num_syncobj_handles) TAIL;
[all …]
/external/llvm/test/Transforms/LoopUnroll/
Dignore-annotation-intrinsic-cost.ll27 %annot.0 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
28 %annot.1 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
29 %annot.2 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
30 %annot.3 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
31 %annot.4 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
32 %annot.5 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
33 %annot.6 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
34 %annot.7 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
35 %annot.8 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
36 %annot.9 = tail call i32 @llvm.annotation.i32(i32 %i.01, i8* null, i8* null, i32 0)
[all …]
/external/toybox/tests/
Dtail.test9 testing "tail" "tail && echo yes" "oneyes\n" "" "one"
10 testing "file" "tail file1" \
12 testing "-n in bounds" "tail -n 3 file1" "nine\nten\neleven\n" "" ""
13 testing "-n out of bounds" "tail -n 999 file1" "$BIGTEST" "" ""
14 testing "-n+ in bounds" "tail -n +3 file1" \
16 testing "-n+ outof bounds" "tail -n +999 file1" "" "" ""
17 testing "-c in bounds" "tail -c 27 file1" \
19 testing "-c out of bounds" "tail -c 999 file1" "$BIGTEST" "" ""
20 testing "-c+ in bounds" "tail -c +27 file1" \
22 testing "-c+ out of bonds" "tail -c +999 file1" "" "" ""
[all …]
/external/pytorch/aten/src/ATen/functorch/
DBatchingMetaprogramming.h27 // tail operation
29 struct tail final {
31 "In typelist::tail<T>, the T argument must be typelist<...>.");
33 template<class Head, class... Tail>
34 struct tail<typelist<Head, Tail...>> final {
35 using type = typelist<Tail...>;
37 template<class TypeList> using tail_t = typename tail<TypeList>::type;
39 template <class First, class Second, class Next, class Tail>
43 template <class Next, class Tail>
44 …ct IfFirstIsTensorAndSecondisBatchDimThenTailElseNext<Tensor, std::optional<int64_t>, Next, Tail> {
[all …]
/external/libwebsockets/include/libwebsockets/
Dlws-ring.h43 * automatically called for elements with no tail behind them, ie, elements
65 * consumption into one or two memcpy()s depending on if the head or tail
69 * an API to inform it when the "oldest" tail has moved on. You can give
70 * NULL where-ever an api asks for a tail pointer, and it will use an internal
71 * single tail pointer for convenience.
73 * The "oldest tail", which is the only tail if you give it NULL instead of
74 * some other tail, is used to track which elements in the ringbuffer are
89 * oldest tail moving beyond it
95 * retired from the ringbuffer after the oldest tail has gone past it, and for
128 * \param tail: a pointer to the tail struct to use, or NULL for single tail
[all …]
/external/llvm/test/Analysis/BasicAA/
Dcs-cs.ll41 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
42 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
48 ; CHECK: Both ModRef: Ptr: i8* %P <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
49 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
50 ; CHECK: Both ModRef: Ptr: i8* %P <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
51 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
52 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, …
53 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, …
57 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
58 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
[all …]
/external/grpc-grpc-java/netty/src/test/java/io/grpc/netty/
DNettyAdaptiveCumulatorTest.java202 private ByteBuf tail; field in NettyAdaptiveCumulatorTest.ShouldComposeTests
209 tail = ByteBufUtil.writeAscii(alloc, tailData); in setUp()
211 // Note that addFlattenedComponents() will not add a new component when tail is not readable. in setUp()
212 composite.addFlattenedComponents(true, tail); in setUp()
230 assume().that(tail.readableBytes() + in.readableBytes()).isAtLeast(composeMinSize); in shouldCompose_composeMinSizeReached()
237 assume().that(tail.readableBytes() + in.readableBytes()).isLessThan(composeMinSize); in shouldCompose_composeMinSizeNotReached()
248 private static final String TAIL_DATA_READABLE = "tail";
254 private static final String EXPECTED_TAIL_DATA = "tail+incoming";
259 * <p>Test cases when the cumulation contains components, other than tail, and could be
269 // so it's not added to the composite byte buf. The tail is added as the first component. in params()
[all …]
/external/llvm/test/CodeGen/Hexagon/
Deliminate-pred-spill.ll51 %20 = tail call <1024 x i1> @llvm.hexagon.V6.vgtb.128B(<32 x i32> %2, <32 x i32> %11)
52 …%21 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %20, <32 x i32> %11, <32 x i32> …
53 …%22 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %20, <32 x i32> %2, <32 x i32> %…
54 …%23 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %20, <32 x i32> undef, <32 x i32…
55 …%24 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %20, <32 x i32> %12, <32 x i32> …
56 %25 = tail call <1024 x i1> @llvm.hexagon.V6.vgtb.128B(<32 x i32> %7, <32 x i32> %15)
57 …%26 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %25, <32 x i32> %15, <32 x i32> …
58 …%27 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %25, <32 x i32> %7, <32 x i32> %…
59 …%28 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %25, <32 x i32> %16, <32 x i32> …
60 …%29 = tail call <32 x i32> @llvm.hexagon.V6.vmux.128B(<1024 x i1> %25, <32 x i32> %8, <32 x i32> %…
[all …]
/external/llvm/test/CodeGen/Generic/
DPBQP.ll5 %call = tail call i32 (...) @baz()
6 %call1 = tail call i32 (...) @baz()
7 %call2 = tail call i32 (...) @baz()
8 %call3 = tail call i32 (...) @baz()
9 %call4 = tail call i32 (...) @baz()
10 %call5 = tail call i32 (...) @baz()
11 %call6 = tail call i32 (...) @baz()
12 %call7 = tail call i32 (...) @baz()
13 %call8 = tail call i32 (...) @baz()
14 %call9 = tail call i32 (...) @baz()
[all …]
/external/llvm/test/CodeGen/ARM/
Dthumb-big-stack.ll145 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
147 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
149 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
151 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
153 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
155 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
157 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
159 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
161 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
163 …tail call void asm sideeffect "", "~{q0}{q1}{q2}{q3}{q4}{q5}{q6}{q7}{q8}{q9}{q10}{q11}{q12}{q13}{q…
[all …]
/external/marisa-trie/tests/
Dtrie-test.cc9 #include <marisa/grimoire/trie/tail.h>
233 marisa::grimoire::trie::Tail tail; in TestTextTail() local
236 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
238 ASSERT(tail.mode() == MARISA_TEXT_TAIL); in TestTextTail()
239 ASSERT(tail.size() == 0); in TestTextTail()
240 ASSERT(tail.empty()); in TestTextTail()
241 ASSERT(tail.total_size() == tail.size()); in TestTextTail()
242 ASSERT(tail.io_size() == (sizeof(marisa::UInt64) * 6)); in TestTextTail()
250 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
252 ASSERT(tail.mode() == MARISA_TEXT_TAIL); in TestTextTail()
[all …]
/external/libwebsockets/lib/misc/
Dlws-ring.c100 lws_ring_get_count_waiting_elements(struct lws_ring *ring, uint32_t *tail) in lws_ring_get_count_waiting_elements() argument
103 if (!tail) in lws_ring_get_count_waiting_elements()
104 tail = &ring->oldest_tail; in lws_ring_get_count_waiting_elements()
114 if (ring->head == *tail) in lws_ring_get_count_waiting_elements()
117 if (ring->head > *tail) in lws_ring_get_count_waiting_elements()
118 f = (int)(ring->head - *tail); in lws_ring_get_count_waiting_elements()
120 f = (int)((ring->buflen - *tail) + ring->head); in lws_ring_get_count_waiting_elements()
199 lws_ring_consume(struct lws_ring *ring, uint32_t *tail, void *dest, in lws_ring_consume() argument
203 void *orig_tail = tail; in lws_ring_consume()
207 if (!tail) { in lws_ring_consume()
[all …]
/external/rust/android-crates-io/crates/crossbeam-queue/src/
Darray_queue.rs19 /// If the stamp equals the tail, this node will be next written to. If it equals head + 1,
59 /// The tail of the queue.
64 /// Elements are pushed into the tail of the queue.
65 tail: CachePadded<AtomicUsize>, field
101 // Tail is initialized to `{ lap: 0, index: 0 }`. in new()
103 let tail = 0; in new() localVariable
125 tail: CachePadded::new(AtomicUsize::new(tail)), in new()
134 let mut tail = self.tail.load(Ordering::Relaxed); in push_or_else() localVariable
137 // Deconstruct the tail. in push_or_else()
138 let index = tail & (self.one_lap - 1); in push_or_else()
[all …]
Dseg_queue.rs157 /// The tail of the queue.
158 tail: CachePadded<Position<T>>, field
186 tail: CachePadded::new(Position { in new()
194 /// Pushes back an element to the tail.
208 let mut tail = self.tail.index.load(Ordering::Acquire); in push() localVariable
209 let mut block = self.tail.block.load(Ordering::Acquire); in push()
214 let offset = (tail >> SHIFT) % LAP; in push()
219 tail = self.tail.index.load(Ordering::Acquire); in push()
220 block = self.tail.block.load(Ordering::Acquire); in push()
235 .tail in push()
[all …]
/external/llvm/test/Transforms/ObjCARC/
Dtail-call-invariant-enforcement.ll11 ; Never tail call objc_autorelease.
20 %tmp1 = tail call i8* @objc_autorelease(i8* %x)
25 ; Always tail call autoreleaseReturnValue.
28 ; CHECK: %tmp0 = tail call i8* @objc_autoreleaseReturnValue(i8* %x) [[NUW]]
29 ; CHECK: %tmp1 = tail call i8* @objc_autoreleaseReturnValue(i8* %x) [[NUW]]
34 %tmp1 = tail call i8* @objc_autoreleaseReturnValue(i8* %x)
38 ; Always tail call objc_retain.
41 ; CHECK: %tmp0 = tail call i8* @objc_retain(i8* %x) [[NUW]]
42 ; CHECK: %tmp1 = tail call i8* @objc_retain(i8* %x) [[NUW]]
47 %tmp1 = tail call i8* @objc_retain(i8* %x)
[all …]
Dcontract-storestrong.ll13 ; CHECK-NEXT: tail call void @objc_storeStrong(i8** @x, i8* %p) [[NUW:#[0-9]+]]
18 %0 = tail call i8* @objc_retain(i8* %p) nounwind
21 tail call void @objc_release(i8* %tmp) nounwind
29 ; CHECK-NEXT: %0 = tail call i8* @objc_retain(i8* %p) [[NUW]]
32 ; CHECK-NEXT: tail call void @objc_release(i8* %tmp) [[NUW]]
37 %0 = tail call i8* @objc_retain(i8* %p) nounwind
40 tail call void @objc_release(i8* %tmp) nounwind
48 ; CHECK-NEXT: %0 = tail call i8* @objc_retain(i8* %p) [[NUW]]
51 ; CHECK-NEXT: tail call void @objc_release(i8* %tmp) [[NUW]]
56 %0 = tail call i8* @objc_retain(i8* %p) nounwind
[all …]
/external/llvm/test/CodeGen/X86/
Dswitch.ll14 bb0: tail call void @g(i32 0) br label %return
15 bb1: tail call void @g(i32 1) br label %return
16 bb2: tail call void @g(i32 1) br label %return
42 bb0: tail call void @g(i32 0) br label %return
43 bb1: tail call void @g(i32 1) br label %return
44 bb2: tail call void @g(i32 1) br label %return
61 bb0: tail call void @g(i32 0) br label %return
62 bb1: tail call void @g(i32 1) br label %return
63 bb2: tail call void @g(i32 1) br label %return
87 bb0: tail call void @g(i32 0) br label %return
[all …]
Dtailcall-msvc-conventions.ll4 ; The MSVC family of x86 calling conventions makes tail calls really tricky.
10 ; Don't allow tail calling these cdecl functions, because we need to clear the
14 tail call void @cdecl_void()
22 tail call void @cdecl_void()
30 tail call void @cdecl_void()
38 tail call void @cdecl_void()
46 ; Tail call to/from callee pop functions can work under the right circumstances:
56 tail call x86_thiscallcc void @no_args_method(i8* %this)
64 tail call x86_thiscallcc void @two_args_method(i8* %this, i32 %a, i32 %b)
73 tail call x86_thiscallcc void @two_args_method(i8* %this, i32 %a, i32 %b)
[all …]
/external/pytorch/test/distributed/elastic/multiprocessing/
Dtail_log_test.py43 Run nprocs such writers and tail the log files into an IOString
56 tail = TailLog(
59 # sleep here is intentional to ensure that the log tail
71 self.assertFalse(tail.stopped())
72 tail.stop()
86 self.assertTrue(tail.stopped())
91 Run nprocs such writers and tail the log files into an IOString
105 tail = TailLog(
112 # sleep here is intentional to ensure that the log tail
122 self.assertFalse(tail.stopped())
[all …]
/external/sdv/vsomeip/third_party/boost/mpl/include/boost/mpl/set/aux_/
Diterator.hpp30 template< typename Set, typename Tail > struct s_iter;
32 template< typename Set, typename Tail > struct s_iter_get
34 has_key< Set,typename Tail::item_type_ >
35 , identity< s_iter<Set,Tail> >
36 , next< s_iter<Set,Tail> >
41 template< typename Set, typename Tail > struct s_iter_impl
43 typedef Tail tail_;
45 typedef typename Tail::item_type_ type;
48 typedef typename s_iter_get< Set,typename Tail::base >::type next;
54 template< typename Set, typename Tail >
[all …]
/external/llvm/test/Transforms/InstCombine/
Dselect-cmp-cttz-ctlz.ll9 ; CHECK: [[VAR:%[a-zA-Z0-9]+]] = tail call i16 @llvm.ctlz.i16(i16 %x, i1 false)
12 %0 = tail call i16 @llvm.ctlz.i16(i16 %x, i1 true)
20 ; CHECK: [[VAR:%[a-zA-Z0-9]+]] = tail call i32 @llvm.ctlz.i32(i32 %x, i1 false)
23 %0 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 true)
31 ; CHECK: [[VAR:%[a-zA-Z0-9]+]] = tail call i64 @llvm.ctlz.i64(i64 %x, i1 false)
34 %0 = tail call i64 @llvm.ctlz.i64(i64 %x, i1 true)
42 ; CHECK: [[VAR:%[a-zA-Z0-9]+]] = tail call i16 @llvm.ctlz.i16(i16 %x, i1 false)
45 %0 = tail call i16 @llvm.ctlz.i16(i16 %x, i1 true)
53 ; CHECK: [[VAR:%[a-zA-Z0-9]+]] = tail call i32 @llvm.ctlz.i32(i32 %x, i1 false)
56 %0 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 true)
[all …]
/external/jemalloc_new/include/jemalloc/internal/
Dhash.h100 /* tail */ in hash_x86_32()
102 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); in hash_x86_32() local
107 case 3: k1 ^= tail[2] << 16; in hash_x86_32()
108 case 2: k1 ^= tail[1] << 8; in hash_x86_32()
109 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15); in hash_x86_32()
171 /* tail */ in hash_x86_128()
173 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); in hash_x86_128() local
180 case 15: k4 ^= tail[14] << 16; in hash_x86_128()
181 case 14: k4 ^= tail[13] << 8; in hash_x86_128()
182 case 13: k4 ^= tail[12] << 0; in hash_x86_128()
[all …]
/external/rust/android-crates-io/crates/crossbeam-channel/src/flavors/
Dlist.rs41 // * If set in tail, indicates that the channel is disconnected.
176 /// The tail of the channel.
177 tail: CachePadded<Position<T>>, field
194 tail: CachePadded::new(Position { in new()
216 let mut tail = self.tail.index.load(Ordering::Acquire); in start_send() localVariable
217 let mut block = self.tail.block.load(Ordering::Acquire); in start_send()
222 if tail & MARK_BIT != 0 { in start_send()
228 let offset = (tail >> SHIFT) % LAP; in start_send()
233 tail = self.tail.index.load(Ordering::Acquire); in start_send()
234 block = self.tail.block.load(Ordering::Acquire); in start_send()
[all …]

12345678910>>...275