Home
last modified time | relevance | path

Searched refs:tail (Results 1 – 25 of 1872) sorted by relevance

12345678910>>...75

/external/marisa-trie/v0_1_5/tests/
Dtail-test.cc13 marisa_alpha::Tail tail; in TestBinaryTail() local
15 ASSERT(tail.size() == 0); in TestBinaryTail()
16 ASSERT(tail.empty()); in TestBinaryTail()
17 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32)); in TestBinaryTail()
20 tail.build(keys, NULL, MARISA_ALPHA_BINARY_TAIL); in TestBinaryTail()
22 ASSERT(tail.size() == 0); in TestBinaryTail()
23 ASSERT(tail.empty()); in TestBinaryTail()
24 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32)); in TestBinaryTail()
28 tail.build(keys, &offsets, MARISA_ALPHA_BINARY_TAIL); in TestBinaryTail()
30 ASSERT(tail.size() == 1); in TestBinaryTail()
[all …]
/external/marisa-trie/tests/
Dtail-test.cc13 marisa::Tail tail; in TestBinaryTail() local
15 ASSERT(tail.size() == 0); in TestBinaryTail()
16 ASSERT(tail.empty()); in TestBinaryTail()
17 ASSERT(tail.total_size() == sizeof(marisa::UInt32)); in TestBinaryTail()
20 tail.build(keys, NULL, MARISA_BINARY_TAIL); in TestBinaryTail()
22 ASSERT(tail.size() == 0); in TestBinaryTail()
23 ASSERT(tail.empty()); in TestBinaryTail()
24 ASSERT(tail.total_size() == sizeof(marisa::UInt32)); in TestBinaryTail()
28 tail.build(keys, &offsets, MARISA_BINARY_TAIL); in TestBinaryTail()
30 ASSERT(tail.size() == 1); in TestBinaryTail()
[all …]
/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/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/fio/lib/
Dflist_sort.c18 struct flist_head head, *tail = &head; in merge() local
23 tail->next = a; in merge()
26 tail->next = b; in merge()
29 tail = tail->next; in merge()
31 tail->next = a?:b; in merge()
48 struct flist_head *tail = head; in merge_and_restore_back_links() local
53 tail->next = a; in merge_and_restore_back_links()
54 a->prev = tail; in merge_and_restore_back_links()
57 tail->next = b; in merge_and_restore_back_links()
58 b->prev = tail; in merge_and_restore_back_links()
[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/mesa3d/src/mesa/drivers/dri/i915/
Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; in intel_resolve_map_set() local
44 while (*tail) { in intel_resolve_map_set()
45 if ((*tail)->level == level && (*tail)->layer == layer) { in intel_resolve_map_set()
46 (*tail)->need = need; in intel_resolve_map_set()
49 prev = *tail; in intel_resolve_map_set()
50 tail = &(*tail)->next; in intel_resolve_map_set()
53 *tail = malloc(sizeof(**tail)); in intel_resolve_map_set()
54 (*tail)->prev = prev; in intel_resolve_map_set()
55 (*tail)->next = NULL; in intel_resolve_map_set()
56 (*tail)->level = level; in intel_resolve_map_set()
[all …]
/external/mesa3d/src/mesa/drivers/dri/intel/
Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; in intel_resolve_map_set() local
44 while (*tail) { in intel_resolve_map_set()
45 if ((*tail)->level == level && (*tail)->layer == layer) { in intel_resolve_map_set()
46 (*tail)->need = need; in intel_resolve_map_set()
49 prev = *tail; in intel_resolve_map_set()
50 tail = &(*tail)->next; in intel_resolve_map_set()
53 *tail = malloc(sizeof(**tail)); in intel_resolve_map_set()
54 (*tail)->prev = prev; in intel_resolve_map_set()
55 (*tail)->next = NULL; in intel_resolve_map_set()
56 (*tail)->level = level; in intel_resolve_map_set()
[all …]
/external/mesa3d/src/mesa/drivers/dri/i965/
Dintel_resolve_map.c41 struct intel_resolve_map **tail = &head->next; in intel_resolve_map_set() local
44 while (*tail) { in intel_resolve_map_set()
45 if ((*tail)->level == level && (*tail)->layer == layer) { in intel_resolve_map_set()
46 (*tail)->need = need; in intel_resolve_map_set()
49 prev = *tail; in intel_resolve_map_set()
50 tail = &(*tail)->next; in intel_resolve_map_set()
53 *tail = malloc(sizeof(**tail)); in intel_resolve_map_set()
54 (*tail)->prev = prev; in intel_resolve_map_set()
55 (*tail)->next = NULL; in intel_resolve_map_set()
56 (*tail)->level = level; in intel_resolve_map_set()
[all …]
/external/jemalloc/include/jemalloc/internal/
Dhash.h119 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); in hash_x86_32() local
124 case 3: k1 ^= tail[2] << 16; in hash_x86_32()
125 case 2: k1 ^= tail[1] << 8; in hash_x86_32()
126 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15); in hash_x86_32()
191 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); in hash_x86_128() local
198 case 15: k4 ^= tail[14] << 16; in hash_x86_128()
199 case 14: k4 ^= tail[13] << 8; in hash_x86_128()
200 case 13: k4 ^= tail[12] << 0; in hash_x86_128()
203 case 12: k3 ^= tail[11] << 24; in hash_x86_128()
204 case 11: k3 ^= tail[10] << 16; in hash_x86_128()
[all …]
/external/llvm/test/Analysis/BasicAA/
Dcs-cs.ll40 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
41 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*…
48 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
49 ; CHECK: Both ModRef: Ptr: i8* %P <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
50 ; CHECK: Both ModRef: Ptr: i8* %Q <-> tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8*…
51 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, …
52 ; CHECK: Both ModRef: tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, …
56 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
57 tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* %P, i8* %Q, i64 12, i32 1, i1 false)
[all …]
/external/llvm/test/Transforms/ObjCARC/
Dtail-call-invariant-enforcement.ll10 ; Never tail call objc_autorelease.
19 %tmp1 = tail call i8* @objc_autorelease(i8* %x)
24 ; Always tail call autoreleaseReturnValue.
27 ; CHECK: %tmp0 = tail call i8* @objc_autoreleaseReturnValue(i8* %x) [[NUW]]
28 ; CHECK: %tmp1 = tail call i8* @objc_autoreleaseReturnValue(i8* %x) [[NUW]]
33 %tmp1 = tail call i8* @objc_autoreleaseReturnValue(i8* %x)
37 ; Always tail call objc_retain.
40 ; CHECK: %tmp0 = tail call i8* @objc_retain(i8* %x) [[NUW]]
41 ; CHECK: %tmp1 = tail call i8* @objc_retain(i8* %x) [[NUW]]
46 %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/markdown/markdown/
Dtreeprocessors.py118 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:
233 child.tail = self.__handleInline(child.tail,
286 if newChild.tail:
[all …]
/external/llvm/test/MC/X86/
Dstackmap-nops.ll28 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 0, i32 0)
29 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 1, i32 1)
30 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 2, i32 2)
31 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 3, i32 3)
32 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 4, i32 4)
33 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 5, i32 5)
34 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 6, i32 6)
35 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 7, i32 7)
36 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 8, i32 8)
37 tail call void (i64, i32, ...) @llvm.experimental.stackmap(i64 9, i32 9)
[all …]
/external/llvm/test/CodeGen/Thumb2/
Dthumb2-tbb.ll14 tail call void(...) @foo1()
17 tail call void(...) @foo2()
20 tail call void(...) @foo6()
23 tail call void(...) @foo3()
26 tail call void(...) @foo4()
29 tail call void(...) @foo5()
32 tail call void(...) @foo1()
35 tail call void(...) @foo2()
38 tail call void(...) @foo6()
41 tail call void(...) @foo3()
[all …]
/external/llvm/test/CodeGen/X86/
D2008-04-08-CoalescerCrash.ll5 …tail call void asm sideeffect "# top of block", "~{dirflag},~{fpsr},~{flags},~{di},~{si},~{dx},~{c…
6 tail call void asm sideeffect ".file \224443946.c\22", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
7 tail call void asm sideeffect ".line 8", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
8 …%tmp1 = tail call x86_mmx asm sideeffect "movd $1, $0", "=={mm4},{bp},~{dirflag},~{fpsr},~{flags},…
9 tail call void asm sideeffect ".file \224443946.c\22", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
10 tail call void asm sideeffect ".line 9", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
11 …%tmp3 = tail call i32 asm sideeffect "movd $1, $0", "=={bp},{mm3},~{dirflag},~{fpsr},~{flags},~{me…
12 tail call void asm sideeffect ".file \224443946.c\22", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
13 tail call void asm sideeffect ".line 10", "~{dirflag},~{fpsr},~{flags}"( ) nounwind
14 …tail call void asm sideeffect "movntq $0, 0($1,$2)", "{mm0},{di},{bp},~{dirflag},~{fpsr},~{flags},…
[all …]
Dstackmap-nops.ll196 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 …]
/external/llvm/test/CodeGen/NVPTX/
Denvreg.ll41 %val0 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg0()
43 %val1 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg1()
45 %val2 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg2()
47 %val3 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg3()
49 %val4 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg4()
51 %val5 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg5()
53 %val6 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg6()
55 %val7 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg7()
57 %val8 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg8()
59 %val9 = tail call i32 @llvm.nvvm.read.ptx.sreg.envreg9()
[all …]
/external/selinux/libsepol/cil/src/
Dcil_list.c51 new_list->tail = NULL; in cil_list_init()
110 if (list->tail == NULL) { in cil_list_append()
112 list->tail = item; in cil_list_append()
116 list->tail->next = item; in cil_list_append()
117 list->tail = item; in cil_list_append()
132 if (list->tail == NULL) { in cil_list_prepend()
134 list->tail = item; in cil_list_prepend()
156 if (curr == list->tail) { in cil_list_insert()
158 return list->tail; in cil_list_insert()
187 if (list->tail == NULL) { in cil_list_append_item()
[all …]
/external/llvm/test/CodeGen/PowerPC/
Dhtm.ll7 %0 = tail call i32 @llvm.ppc.tbegin(i32 0)
22 %0 = tail call i32 @llvm.ppc.tend(i32 0)
34 %0 = tail call i32 @llvm.ppc.tabort(i32 0)
35 %1 = tail call i32 @llvm.ppc.tabortdc(i32 0, i32 1, i32 2)
36 %2 = tail call i32 @llvm.ppc.tabortdci(i32 0, i32 1, i32 2)
37 %3 = tail call i32 @llvm.ppc.tabortwc(i32 0, i32 1, i32 2)
38 %4 = tail call i32 @llvm.ppc.tabortwci(i32 0, i32 1, i32 2)
57 %0 = tail call i32 @llvm.ppc.tendall()
58 %1 = tail call i32 @llvm.ppc.tresume()
59 %2 = tail call i32 @llvm.ppc.tsuspend()
[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/v8/test/mjsunit/regress/
Dregress-1708.js39 var tail = head;
44 tail[1] = new Array(1000);
45 tail = tail[1];
64 tail[1] = new Array(1000);
65 tail = tail[1];
/external/okhttp/okio/okio/src/main/java/okio/
DBuffer.java241 Segment tail = writableSegment(1);
242 int maxToCopy = (int) Math.min(byteCount, Segment.SIZE - tail.limit);
243 int bytesRead = in.read(tail.data, tail.limit, maxToCopy);
248 tail.limit += bytesRead;
264 Segment tail = head.prev;
265 if (tail.limit < Segment.SIZE && tail.owner) {
266 result -= tail.limit - tail.pos;
812 Segment tail = writableSegment(1);
813 byte[] data = tail.data;
814 int segmentOffset = tail.limit - i;
[all …]
/external/llvm/test/CodeGen/Mips/msa/
Delm_cxcmsa.ll9 %0 = tail call i32 @llvm.mips.cfcmsa(i32 0)
19 %0 = tail call i32 @llvm.mips.cfcmsa(i32 1)
29 %0 = tail call i32 @llvm.mips.cfcmsa(i32 2)
39 %0 = tail call i32 @llvm.mips.cfcmsa(i32 3)
49 %0 = tail call i32 @llvm.mips.cfcmsa(i32 4)
59 %0 = tail call i32 @llvm.mips.cfcmsa(i32 5)
69 %0 = tail call i32 @llvm.mips.cfcmsa(i32 6)
79 %0 = tail call i32 @llvm.mips.cfcmsa(i32 7)
89 tail call void @llvm.mips.ctcmsa(i32 0, i32 1)
99 tail call void @llvm.mips.ctcmsa(i32 1, i32 1)
[all …]

12345678910>>...75