Home
last modified time | relevance | path

Searched refs:an (Results 1 – 25 of 6789) sorted by relevance

12345678910>>...272

/external/llvm/test/Analysis/CostModel/X86/
Dvshift-lshr-cost.ll16 ; SSE2: Found an estimated cost of 4 for instruction: %shift
17 ; SSE41: Found an estimated cost of 4 for instruction: %shift
18 ; AVX: Found an estimated cost of 4 for instruction: %shift
19 ; AVX2: Found an estimated cost of 1 for instruction: %shift
20 ; XOPAVX: Found an estimated cost of 2 for instruction: %shift
21 ; XOPAVX2: Found an estimated cost of 1 for instruction: %shift
28 ; SSE2: Found an estimated cost of 8 for instruction: %shift
29 ; SSE41: Found an estimated cost of 8 for instruction: %shift
30 ; AVX: Found an estimated cost of 8 for instruction: %shift
31 ; AVX2: Found an estimated cost of 1 for instruction: %shift
[all …]
Dvshift-ashr-cost.ll16 ; SSE2: Found an estimated cost of 12 for instruction: %shift
17 ; SSE41: Found an estimated cost of 12 for instruction: %shift
18 ; AVX: Found an estimated cost of 12 for instruction: %shift
19 ; AVX2: Found an estimated cost of 4 for instruction: %shift
20 ; XOP: Found an estimated cost of 2 for instruction: %shift
27 ; SSE2: Found an estimated cost of 24 for instruction: %shift
28 ; SSE41: Found an estimated cost of 24 for instruction: %shift
29 ; AVX: Found an estimated cost of 24 for instruction: %shift
30 ; AVX2: Found an estimated cost of 4 for instruction: %shift
31 ; XOP: Found an estimated cost of 4 for instruction: %shift
[all …]
Dvshift-shl-cost.ll17 ; SSE2: Found an estimated cost of 4 for instruction: %shift
18 ; SSE41: Found an estimated cost of 4 for instruction: %shift
19 ; AVX: Found an estimated cost of 4 for instruction: %shift
20 ; AVX2: Found an estimated cost of 1 for instruction: %shift
21 ; XOPAVX: Found an estimated cost of 1 for instruction: %shift
22 ; XOPAVX2: Found an estimated cost of 1 for instruction: %shift
29 ; SSE2: Found an estimated cost of 8 for instruction: %shift
30 ; SSE41: Found an estimated cost of 8 for instruction: %shift
31 ; AVX: Found an estimated cost of 8 for instruction: %shift
32 ; AVX2: Found an estimated cost of 1 for instruction: %shift
[all …]
Dbitreverse.ll17 ; SSE2: Found an estimated cost of 1 for instruction: %bitreverse
18 ; SSE42: Found an estimated cost of 1 for instruction: %bitreverse
19 ; AVX: Found an estimated cost of 1 for instruction: %bitreverse
20 ; AVX2: Found an estimated cost of 1 for instruction: %bitreverse
21 ; XOP: Found an estimated cost of 3 for instruction: %bitreverse
28 ; SSE2: Found an estimated cost of 1 for instruction: %bitreverse
29 ; SSE42: Found an estimated cost of 1 for instruction: %bitreverse
30 ; AVX: Found an estimated cost of 1 for instruction: %bitreverse
31 ; AVX2: Found an estimated cost of 1 for instruction: %bitreverse
32 ; XOP: Found an estimated cost of 3 for instruction: %bitreverse
[all …]
Dctbits-cost.ll22 ; SSE: Found an estimated cost of 2 for instruction: %ctpop
23 ; AVX: Found an estimated cost of 2 for instruction: %ctpop
24 ; XOP: Found an estimated cost of 2 for instruction: %ctpop
31 ; SSE: Found an estimated cost of 4 for instruction: %ctpop
32 ; AVX: Found an estimated cost of 2 for instruction: %ctpop
33 ; XOP: Found an estimated cost of 2 for instruction: %ctpop
40 ; SSE: Found an estimated cost of 2 for instruction: %ctpop
41 ; AVX: Found an estimated cost of 2 for instruction: %ctpop
42 ; XOP: Found an estimated cost of 2 for instruction: %ctpop
49 ; SSE: Found an estimated cost of 4 for instruction: %ctpop
[all …]
Dbswap.ll20 ; SSE2: Found an estimated cost of 7 for instruction: %bswap
21 ; SSE42: Found an estimated cost of 1 for instruction: %bswap
22 ; AVX: Found an estimated cost of 1 for instruction: %bswap
23 ; XOP: Found an estimated cost of 1 for instruction: %bswap
30 ; SSE2: Found an estimated cost of 14 for instruction: %bswap
31 ; SSE42: Found an estimated cost of 2 for instruction: %bswap
32 ; AVX1: Found an estimated cost of 4 for instruction: %bswap
33 ; AVX2: Found an estimated cost of 1 for instruction: %bswap
34 ; XOPAVX1: Found an estimated cost of 4 for instruction: %bswap
35 ; XOPAVX2: Found an estimated cost of 1 for instruction: %bswap
[all …]
Dvdiv-cost.ll9 ; SSE2: Found an estimated cost of 15 for instruction: %div
10 ; AVX2: Found an estimated cost of 15 for instruction: %div
18 ; SSE2: Found an estimated cost of 30 for instruction: %div
19 ; AVX2: Found an estimated cost of 15 for instruction: %div
27 ; SSE2: Found an estimated cost of 6 for instruction: %div
28 ; AVX2: Found an estimated cost of 6 for instruction: %div
36 ; SSE2: Found an estimated cost of 12 for instruction: %div
37 ; AVX2: Found an estimated cost of 6 for instruction: %div
45 ; SSE2: Found an estimated cost of 6 for instruction: %div
46 ; AVX2: Found an estimated cost of 6 for instruction: %div
[all …]
Dmasked-intrinsic-cost.ll7 ; AVX2: Found an estimated cost of 4 {{.*}}.masked
15 ; AVX2: Found an estimated cost of 4 {{.*}}.masked
23 ; AVX2: Found an estimated cost of 4 {{.*}}.masked
31 ; AVX2: Found an estimated cost of 4 {{.*}}.masked
39 ; AVX2: Found an estimated cost of 5 {{.*}}.masked
47 ; AVX2: Found an estimated cost of 6 {{.*}}.masked
55 ; AVX2: Found an estimated cost of 5 {{.*}}.masked
63 ; AVX2: Found an estimated cost of 6 {{.*}}.masked
73 ; AVX2: Found an estimated cost of 7 {{.*}}.gather
76 ; KNL: Found an estimated cost of 7 {{.*}}.gather
[all …]
/external/e2fsprogs/tests/f_holedir4/
Dexpect.19 Directory inode 12 has an unallocated block #2. Allocate? yes
11 Directory inode 12 has an unallocated block #3. Allocate? yes
13 Directory inode 12 has an unallocated block #4. Allocate? yes
15 Directory inode 12 has an unallocated block #5. Allocate? yes
17 Directory inode 12 has an unallocated block #6. Allocate? yes
19 Directory inode 12 has an unallocated block #7. Allocate? yes
21 Directory inode 12 has an unallocated block #8. Allocate? yes
23 Directory inode 12 has an unallocated block #9. Allocate? yes
25 Directory inode 12 has an unallocated block #10. Allocate? yes
27 Directory inode 12 has an unallocated block #11. Allocate? yes
[all …]
/external/llvm/test/Analysis/CostModel/ARM/
Dcast.ll8 ; CHECK: Found an estimated cost of 1 for instruction: %r0 = sext i1 undef to i8
10 ; CHECK: Found an estimated cost of 1 for instruction: %r1 = zext i1 undef to i8
12 ; CHECK: Found an estimated cost of 1 for instruction: %r2 = sext i1 undef to i16
14 ; CHECK: Found an estimated cost of 1 for instruction: %r3 = zext i1 undef to i16
16 ; CHECK: Found an estimated cost of 1 for instruction: %r4 = sext i1 undef to i32
18 ; CHECK: Found an estimated cost of 1 for instruction: %r5 = zext i1 undef to i32
20 ; CHECK: Found an estimated cost of 1 for instruction: %r6 = sext i1 undef to i64
22 ; CHECK: Found an estimated cost of 1 for instruction: %r7 = zext i1 undef to i64
24 ; CHECK: Found an estimated cost of 0 for instruction: %r8 = trunc i8 undef to i1
26 ; CHECK: Found an estimated cost of 1 for instruction: %r9 = sext i8 undef to i16
[all …]
/external/libcxx/test/std/containers/sequences/vector/vector.cons/
Dconstruct_iter_iter.pass.cpp39 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
40 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an)); in main()
41 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); in main()
42 …<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); in main()
43 …<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); in main()
44 test<std::vector<int> >(a, an); in main()
46 …int, limited_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an)); in main()
48 …ited_allocator<int, 18 + 1> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); in main()
49 …or<int, 18 + 1> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); in main()
50 …or<int, 18 + 1> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); in main()
[all …]
Dconstruct_iter_iter_alloc.pass.cpp55 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
57 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
58 … test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
59 …ector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); in main()
60 …ector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc); in main()
61 test<std::vector<int> >(a, an, alloc); in main()
66 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
68 …r<int, min_allocator<int>> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
69 …t, min_allocator<int>> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
70 …ator<int>> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); in main()
[all …]
/external/libcxx/test/std/containers/sequences/vector.bool/
Dconstruct_iter_iter.pass.cpp37 bool* an = a + sizeof(a)/sizeof(a[0]); in main() local
38 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); in main()
39 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); in main()
40 …d::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); in main()
41 …d::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); in main()
42 test<std::vector<bool> >(a, an); in main()
44 …ctor<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); in main()
45 …<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); in main()
46 …llocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); in main()
47 …llocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); in main()
[all …]
Dconstruct_iter_iter_alloc.pass.cpp38 bool* an = a + sizeof(a)/sizeof(a[0]); in main() local
41 … test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); in main()
42 …test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), allo… in main()
43 …or<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); in main()
44 …or<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); in main()
45 test<std::vector<bool> >(a, an, alloc); in main()
50 …ol, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); in main()
51 …min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); in main()
52 …r<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); in main()
53 …r<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); in main()
[all …]
/external/syslinux/core/lwip/src/core/snmp/
Dmib_structs.c463 struct mib_array_node *an; in snmp_search_tree() local
469 an = (struct mib_array_node *)node; in snmp_search_tree()
471 while ((i < an->maxlength) && (an->objid[i] != *ident)) in snmp_search_tree()
475 if (i < an->maxlength) in snmp_search_tree()
478 …LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ide… in snmp_search_tree()
479 if (an->nptr[i] == NULL) in snmp_search_tree()
485 return (struct mib_node*)an; in snmp_search_tree()
492 node = an->nptr[i]; in snmp_search_tree()
659 struct mib_array_node *an; in empty_table() local
660 an = (struct mib_array_node *)node; in empty_table()
[all …]
/external/icu/icu4c/source/data/locales/
Dgd.txt1536 "-1"{"an-dè"}
1538 "0"{"an-diugh"}
1540 "2"{"an-earar"}
1541 "3"{"an-eararais"}
1545 few{"an ceann {0} làithean"}
1546 one{"an ceann {0} latha"}
1547 other{"an ceann {0} latha"}
1548 two{"an ceann {0} latha"}
1561 "-1"{"an-dè"}
1563 "0"{"an-diugh"}
[all …]
Dga.txt1039 animals_nature{"Ainmhithe agus an Nádúr"}
1084 middle_eastern_scripts{"Scripteanna an Mheánoirthir"}
1215 "-1"{"an Aoine seo caite"}
1216 "0"{"an Aoine seo"}
1217 "1"{"an Aoine seo chugainn"}
1238 "-1"{"an Aoine seo caite"}
1239 "0"{"an Aoine seo"}
1240 "1"{"an Aoine seo chug."}
1261 "-1"{"an Aoine seo caite"}
1262 "0"{"an Aoine seo"}
[all …]
/external/libcxx/test/std/containers/sequences/deque/deque.cons/
Dmove_alloc.pass.cpp26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
56 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
59 for (int* p = ab; p < an; ++p) in main()
62 for (int* p = ab; p < an; ++p) in main()
72 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
[all …]
Dmove_assign.pass.cpp26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
42 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
45 for (int* p = ab; p < an; ++p) in main()
48 for (int* p = ab; p < an; ++p) in main()
58 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
61 for (int* p = ab; p < an; ++p) in main()
64 for (int* p = ab; p < an; ++p) in main()
75 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
[all …]
Diter_iter_alloc.pass.cpp41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
42 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
43 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
44 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
45 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
47 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
48 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
49 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
50 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
Dmove.pass.cpp26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
60 for (int* p = ab; p < an; ++p) in main()
63 for (int* p = ab; p < an; ++p) in main()
/external/e2fsprogs/debugfs/
Ddebug_cmds.ct52 request do_blocks, "Dump blocks used by an inode ",
55 request do_filefrag, "Report fragmentation information for an inode",
73 request do_kill_file, "Deallocate an inode and its blocks",
79 request do_clri, "Clear an inode's contents",
82 request do_freei, "Clear an inode's in-use flag",
85 request do_seti, "Set an inode's in-use flag",
88 request do_testi, "Test an inode's in-use flag",
100 request do_modify_inode, "Modify an inode by structure",
127 request do_dump, "Dump an inode out to a file",
130 request do_cat, "Dump an inode out to stdout",
[all …]
/external/llvm/test/CodeGen/SystemZ/
Dvec-move-11.ll1 ; Test insertions of register values into a nonzero index of an undef.
5 ; Test v16i8 insertion into an undef, with an arbitrary index.
14 ; Test v16i8 insertion into an undef, with the first good index for VLVGP.
23 ; Test v16i8 insertion into an undef, with the second good index for VLVGP.
32 ; Test v8i16 insertion into an undef, with an arbitrary index.
41 ; Test v8i16 insertion into an undef, with the first good index for VLVGP.
50 ; Test v8i16 insertion into an undef, with the second good index for VLVGP.
59 ; Test v4i32 insertion into an undef, with an arbitrary index.
68 ; Test v4i32 insertion into an undef, with the first good index for VLVGP.
77 ; Test v4i32 insertion into an undef, with the second good index for VLVGP.
[all …]
/external/e2fsprogs/tests/progs/
Dtest_rel_cmds.ct32 request do_brel_move, "Move an entry in the block relocation table",
35 request do_brel_delete, "Delete an entry in the block relocation table",
45 request do_irel_free, "Free an inode relocation table",
48 request do_irel_put, "Add or modify an inode relocation entry",
51 request do_irel_get, "Get an inode relocation entry",
55 "Get an inode relocation entry by its original number",
67 request do_irel_add_ref, "Add a reference to an inode entry",
70 request do_irel_start_iter_ref, "Start iterating over references to an inode",
73 request do_irel_next_ref, "Get the next reference for an inode entry",
76 request do_irel_move, "Move an entry in the inode relocation table",
[all …]
/external/clang/test/FixIt/
Dformat-darwin.m37 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
38 …g{{values of type 'NSUInteger' should not be used as format arguments; add an explicit cast to 'un…
39 …rning{{values of type 'SInt32' should not be used as format arguments; add an explicit cast to 'in…
40 …rning{{values of type 'UInt32' should not be used as format arguments; add an explicit cast to 'un…
54 …th underlying type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
79 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
80 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
81 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
82 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
83 …ng{{values of type 'NSInteger' should not be used as format arguments; add an explicit cast to 'lo…
[all …]

12345678910>>...272