/external/v8/test/mjsunit/compiler/ |
H A D | phi-representations.js | 30 function ar() { function 39 assertEquals(0, ar()); 40 assertEquals(0, ar()); 41 %OptimizeFunctionOnNextCall(ar); 42 assertEquals(0, ar());
|
/external/clang/test/CodeGen/ |
H A D | const-label-addr.c | 10 // CHECK: @b.ar = internal global {{.*}} sub (i{{..}} ptrtoint (i8* blockaddress(@b, %l2) to i{{..}}), i{{..}} ptrtoint (i8* blockaddress(@b, %l1) to i{{..}})) 12 static int ar = &&l2 - &&l1; local
|
/external/clang/test/Parser/ |
H A D | cxx0x-rvalue-reference.cpp | 7 int & &&ar = a; // expected-error{{'ar' declared as a reference to a reference}} local
|
/external/clang/test/Sema/ |
H A D | arg-scope-c99.c | 3 void bb(int sz, int ar[sz][sz]) { } argument
|
/external/libcxx/test/std/containers/associative/map/map.access/ |
H A D | at.pass.cpp | 26 V ar[] = local 36 std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0])); 59 V ar[] = local 69 const std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[ 91 V ar[] = local 124 V ar[] = local [all...] |
H A D | index_key.pass.cpp | 26 V ar[] = local 36 std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0])); 52 V ar[] = local 62 std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[ 80 V ar[] = local [all...] |
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | iter_iter.pass.cpp | 26 V ar[] = local 38 std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0])); 48 V ar[] = local 60 std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> m(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | iter_iter_comp.pass.cpp | 27 V ar[] = local 40 std::map<int, double, C> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5)); 51 V ar[] = local 64 std::map<int, double, C, min_allocator<std::pair<const int, double>>> m(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | copy_alloc.pass.cpp | 27 V ar[] = local 41 std::map<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(7)); 62 V ar[] = local 76 std::map<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | clear.pass.cpp | 26 P ar[] = local 37 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); 46 P ar[] = local 57 M m(ar, ar + sizeof(ar)/sizeof(ar[ [all...] |
H A D | insert_iter_iter.pass.cpp | 28 P ar[] = local 41 m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0]))); 54 P ar[] = local 67 m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
H A D | iter_iter_comp.pass.cpp | 28 V ar[] = local 41 std::multimap<int, double, C> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5)); 58 V ar[] = local 71 std::multimap<int, double, C, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | copy_alloc.pass.cpp | 27 V ar[] = local 41 std::multimap<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(7)); 53 V ar[] = local 67 std::multimap<int, double, C, A> mo(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | iter_iter.pass.cpp | 26 V ar[] = local 38 std::multimap<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0])); 54 V ar[] = local 66 std::multimap<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[ 82 V ar[] = local [all...] |
H A D | iter_iter_comp_alloc.pass.cpp | 29 V ar[] = local 43 std::multimap<int, double, C, A> m(ar, ar+sizeof(ar)/sizeof(ar[0]), C(5), A(7)); 61 V ar[] = local 75 std::multimap<int, double, C, A> m(ar, ar+sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
H A D | clear.pass.cpp | 26 P ar[] = local 37 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); 46 P ar[] = local 57 M m(ar, ar + sizeof(ar)/sizeof(ar[ [all...] |
H A D | insert_iter_iter.pass.cpp | 28 P ar[] = local 41 m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0]))); 66 P ar[] = local 79 m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | clear.pass.cpp | 26 V ar[] = local 37 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); 46 V ar[] = local 57 M m(ar, ar + sizeof(ar)/sizeof(ar[ [all...] |
H A D | insert_iter_iter.pass.cpp | 28 V ar[] = local 41 m.insert(input_iterator<const V*>(ar), 42 input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0]))); 58 V ar[] = local 71 m.insert(input_iterator<const V*>(ar), 72 input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | iter_iter.pass.cpp | 27 V ar[] = local 39 std::multiset<V> m(input_iterator<const int*>(ar), 40 input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[0]))); 56 V ar[] = local 68 std::multiset<V, std::less<V>, min_allocator<V>> m(input_iterator<const int*>(ar), 69 input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | iter_iter_comp.pass.cpp | 26 V ar[] = local 39 std::multiset<V, C> m(input_iterator<const V*>(ar), 40 input_iterator<const V*>(ar+sizeof(ar)/sizeof(ar[0])), C(5));
|
/external/libcxx/test/std/containers/associative/set/ |
H A D | clear.pass.cpp | 26 V ar[] = local 37 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); 46 V ar[] = local 57 M m(ar, ar + sizeof(ar)/sizeof(ar[ [all...] |
/external/libcxx/test/std/containers/associative/set/set.cons/ |
H A D | iter_iter.pass.cpp | 27 V ar[] = local 39 std::set<V> m(input_iterator<const int*>(ar), 40 input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[0]))); 50 V ar[] = local 62 std::set<V, std::less<int>, min_allocator<int>> m(input_iterator<const int*>(ar), 63 input_iterator<const int*>(ar+sizeof(ar)/sizeof(ar[ [all...] |
H A D | iter_iter_comp.pass.cpp | 26 V ar[] = local 39 std::set<V, C> m(input_iterator<const V*>(ar), 40 input_iterator<const V*>(ar+sizeof(ar)/sizeof(ar[0])), C(5));
|
/external/clang/test/SemaCXX/ |
H A D | alignof-sizeof-reference.cpp | 4 char ar[sizeof(s0&)]; // expected-error {{invalid application of 'sizeof' to an incomplete type}} variable 6 char &r = ar[0];
|