| /external/v8/test/webkit/ |
| D | dfg-getter-throw-expected.txt | 24 Tests that DFG getter caching does not break the world if the getter throws an exception.
129 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
130 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
131 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
132 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
133 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
134 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
135 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
136 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
137 PASS bar(o) is "Threw exception: Oh hi, I'm an exception!"
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
| D | construct_iter_iter.pass.cpp | 37 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
38 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an)); in main()
39 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); in main()
40 …<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); in main()
41 …<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); in main()
42 test<std::vector<int> >(a, an); in main()
44 …r<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an)); in main()
45 …t, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); in main()
46 …ocator<int, 18> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); in main()
47 …ocator<int, 18> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); in main()
[all …]
|
| D | construct_iter_iter_alloc.pass.cpp | 50 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
52 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
53 … test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
54 …ector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); in main()
55 …ector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc); in main()
56 test<std::vector<int> >(a, an, alloc); in main()
61 int* an = a + sizeof(a)/sizeof(a[0]); in main() local
63 …r<int, min_allocator<int>> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
64 …t, min_allocator<int>> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
65 …ator<int>> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | construct_iter_iter.pass.cpp | 35 bool* an = a + sizeof(a)/sizeof(a[0]); in main() local
36 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); in main()
37 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); in main()
38 …d::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); in main()
39 …d::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); in main()
40 test<std::vector<bool> >(a, an); in main()
42 …ctor<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); in main()
43 …<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); in main()
44 …llocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); in main()
45 …llocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); in main()
[all …]
|
| D | construct_iter_iter_alloc.pass.cpp | 36 bool* an = a + sizeof(a)/sizeof(a[0]); in main() local
39 … test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); in main()
40 …test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), allo… in main()
41 …or<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); in main()
42 …or<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); in main()
43 test<std::vector<bool> >(a, an, alloc); in main()
48 …ol, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); in main()
49 …min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); in main()
50 …r<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); in main()
51 …r<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); in main()
[all …]
|
| /external/llvm/test/Analysis/CostModel/X86/ |
| D | vshift-cost.ll | 17 ; CHECK: Found an estimated cost of 1 for instruction: %shl
25 ; CHECK: Found an estimated cost of 1 for instruction: %shl
38 ; SSE2: Found an estimated cost of 6 for instruction: %shl
39 ; SSE41: Found an estimated cost of 1 for instruction: %shl
40 ; AVX: Found an estimated cost of 1 for instruction: %shl
41 ; AVX2: Found an estimated cost of 1 for instruction: %shl
49 ; SSE2: Found an estimated cost of 6 for instruction: %shl
50 ; SSE41: Found an estimated cost of 1 for instruction: %shl
51 ; AVX: Found an estimated cost of 1 for instruction: %shl
52 ; AVX2: Found an estimated cost of 1 for instruction: %shl
[all …]
|
| D | vdiv-cost.ll | 9 ; 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 …]
|
| /external/icu/icu4c/source/data/locales/ |
| D | gd.txt | 742 "-1"{"an-dè"}
744 "0"{"an-diugh"}
746 "2"{"an-earar"}
747 "3"{"an-eararais"}
751 few{"an ceann {0} làithean"}
752 one{"an ceann {0} latha"}
753 other{"an ceann {0} latha"}
754 two{"an ceann {0} latha"}
785 few{"an {0} là."}
786 one{"an {0} là"}
[all …]
|
| D | ga.txt | 810 "-1"{"an Aoine seo caite"}
811 "0"{"an Aoine seo chugainn"}
812 "1"{"an Aoine seo chugainn"}
817 "-1"{"an Aoine seo caite"}
818 "0"{"an Aoine seo chugainn"}
819 "1"{"an Aoine seo chugainn"}
824 "-1"{"an Aoine seo caite"}
825 "0"{"an Aoine seo chugainn"}
826 "1"{"an Aoine seo chugainn"}
833 few{"i gceann {0} huaire an chloig"}
[all …]
|
| /external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| D | move_alloc.pass.cpp | 26 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 …]
|
| D | iter_iter_alloc.pass.cpp | 40 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
42 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
43 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
44 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
48 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
49 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
|
| D | move_assign.pass.cpp | 26 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 …]
|
| D | move.pass.cpp | 26 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()
|
| D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main()
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main()
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
|
| D | iter_iter.pass.cpp | 53 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main() local
54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
58 test<stack_allocator<int, 4096> >(ab, an); in main()
60 test<min_allocator<int> >(ab, an); in main()
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| D | wpas_kay.c | 67 u8 an, u32 *lowest_pn) in wpas_get_receive_lowest_pn() argument
69 return wpa_drv_get_receive_lowest_pn(wpa_s, channel, an, lowest_pn); in wpas_get_receive_lowest_pn()
74 u8 an, u32 *next_pn) in wpas_get_transmit_next_pn() argument
76 return wpa_drv_get_transmit_next_pn(wpa_s, channel, an, next_pn); in wpas_get_transmit_next_pn()
81 u8 an, u32 next_pn) in wpas_set_transmit_next_pn() argument
83 return wpa_drv_set_transmit_next_pn(wpa_s, channel, an, next_pn); in wpas_set_transmit_next_pn()
123 static int wpas_create_receive_sa(void *wpa_s, u32 channel, u8 an, in wpas_create_receive_sa() argument
126 return wpa_drv_create_receive_sa(wpa_s, channel, an, lowest_pn, sak); in wpas_create_receive_sa()
130 static int wpas_enable_receive_sa(void *wpa_s, u32 channel, u8 an) in wpas_enable_receive_sa() argument
132 return wpa_drv_enable_receive_sa(wpa_s, channel, an); in wpas_enable_receive_sa()
[all …]
|
| /external/e2fsprogs/tests/progs/ |
| D | test_rel_cmds.ct | 32 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 …]
|
| D | test_icount_cmds.ct | 10 request do_create_icount, "Create an icount structure",
13 request do_free_icount, "Free an icount structure",
16 request do_fetch, "Fetch an icount entry",
19 request do_increment, "Increment an icount entry",
22 request do_decrement, "Decrement an icount entry",
25 request do_store, "Store an icount entry",
|
| /external/clang/test/FixIt/ |
| D | format-darwin.m | 37 …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 …]
|
| /external/clang/docs/ |
| D | ObjectiveCLiterals.rst | 34 the ``'@'`` character will evaluate to a pointer to an ``NSNumber``
78 #define INT_MAX 2147483647 /* max value for an int */
79 #define INT_MIN (-2147483647-1) /* min value for an int */
145 Objective-C keywords). Instead, an enum value must be placed inside a
146 boxed expression. The following example demonstrates configuring an
166 to an integer type, and boxes the value accordingly. If the enum has a
192 A C string literal prefixed by the ``'@'`` token denotes an ``NSString``
194 denotes an ``NSNumber`` literal. When the type of the parenthesized
196 boxed expression is a pointer to an ``NSString`` object containing
218 raise an exception at runtime. When possible, the compiler will reject
[all …]
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| D | MethodNode.java | 205 AnnotationNode an = new AnnotationNode(desc);
214 visibleParameterAnnotations[parameter].add(an);
223 invisibleParameterAnnotations[parameter].add(an);
225 return an;
433 AnnotationNode an = (AnnotationNode) visibleAnnotations.get(i);
434 an.accept(mv.visitAnnotation(an.desc, true));
438 AnnotationNode an = (AnnotationNode) invisibleAnnotations.get(i);
439 an.accept(mv.visitAnnotation(an.desc, false));
450 AnnotationNode an = (AnnotationNode) l.get(j);
451 an.accept(mv.visitParameterAnnotation(i, an.desc, true));
[all …]
|
| /external/clang/test/Modules/ |
| D | auto-module-import.m | 6 // entities. For error recovery, those cases implicitly trigger an import.
8 #include <DependsOnModule/DependsOnModule.h> // expected-warning{{treating #include as an import of…
22 #import <AlsoDependsOnModule/AlsoDependsOnModule.h> // expected-warning{{treating #import as an imp…
36 #include <NoUmbrella/A.h> // expected-warning{{treating #include as an import of module 'NoUmbrella…
40 #include <NoUmbrella/SubDir/C.h> // expected-warning{{treating #include as an import of module 'NoU…
45 …ework.framework/Headers/Other.h> // expected-warning{{treating #include as an import of module 'De…
56 …ramework/Headers/SubFramework.h> // expected-warning{{treating #include as an import of module 'Mo…
63 #include <DependsOnModule/DependsOnModulePrivate.h> // expected-warning{{treating #include as an im…
71 #include <NoUmbrella/A_Private.h> // expected-warning{{treating #include as an import of module 'No…
77 // Test inclusion of headers that are under an umbrella directory but
[all …]
|
| /external/clang/test/SemaObjC/ |
| D | arc-type-conversion.m | 10 …(void)(int*)arg; // expected-error {{cast of an Objective-C pointer to 'int *' is disallowed with …
12 …(void)(__autoreleasing id*)arg; // expected-error {{cast of an Objective-C pointer to '__autorelea…
13 …(void)(id*)arg; // expected-error {{cast of an Objective-C pointer to '__strong id *' is disallowe…
17 …(void)(void**)arg; // expected-error {{cast of an Objective-C pointer to 'void **' is disallowed w…
21 … // expected-note {{use CFBridgingRetain call to make an ARC object available as a +1 'void *'}} \
27 … // expected-note {{use CFBridgingRetain call to make an ARC object available as a +1 'void *'}}
86 (void)(id)&lv; // expected-error {{cast of an indirect pointer to an Objective-C pointer to 'id'}}
87 (void)(id*)lv; // expected-error {{cast of an Objective-C pointer to '__strong id *'}}
88 …(void)(NSString*)&lv; // expected-error {{cast of an indirect pointer to an Objective-C pointer to…
89 …(void)(NSString**)lv; // expected-error {{cast of an Objective-C pointer to 'NSString *__strong *'…
[all …]
|
| D | deprecate_function_containers.m | 5 void p_foo() {} // expected-warning {{function definition inside an Objective-C container is deprec…
9 void foo() {} // expected-warning {{function definition inside an Objective-C container is deprecat…
10 inline void v_foo() {} // expected-warning {{function definition inside an Objective-C container is…
11 static int s_foo() {return 0; } // expected-warning {{function definition inside an Objective-C con…
12 static inline int si_val() { return 1; } // expected-warning {{function definition inside an Object…
16 void cat_foo() {} // expected-warning {{function definition inside an Objective-C container is depr…
32 …1(void (^callback)(id)) { // expected-warning {{function definition inside an Objective-C containe…
|
| /external/wpa_supplicant_8/src/drivers/ |
| D | driver_macsec_qca.c | 520 static int macsec_qca_get_receive_lowest_pn(void *priv, u32 channel, u8 an, in macsec_qca_get_receive_lowest_pn() argument
529 ret += nss_macsec_secy_rx_sa_next_pn_get(drv->secy_id, channel, an, in macsec_qca_get_receive_lowest_pn()
547 static int macsec_qca_get_transmit_next_pn(void *priv, u32 channel, u8 an, in macsec_qca_get_transmit_next_pn() argument
553 ret += nss_macsec_secy_tx_sa_next_pn_get(drv->secy_id, channel, an, in macsec_qca_get_transmit_next_pn()
562 int macsec_qca_set_transmit_next_pn(void *priv, u32 channel, u8 an, u32 next_pn) in macsec_qca_set_transmit_next_pn() argument
567 ret += nss_macsec_secy_tx_sa_next_pn_set(drv->secy_id, channel, an, in macsec_qca_set_transmit_next_pn()
669 static int macsec_qca_create_receive_sa(void *priv, u32 channel, u8 an, in macsec_qca_create_receive_sa() argument
678 __func__, channel, an, lowest_pn); in macsec_qca_create_receive_sa()
684 ret += nss_macsec_secy_rx_sa_create(drv->secy_id, channel, an); in macsec_qca_create_receive_sa()
685 ret += nss_macsec_secy_rx_sak_set(drv->secy_id, channel, an, &rx_sak); in macsec_qca_create_receive_sa()
[all …]
|