/prebuilts/go/darwin-x86/src/debug/dwarf/testdata/ |
H A D | ranges.c | 3 const char *arr[10000]; variable 12 for (i = 0; i < sizeof arr / sizeof arr[0]; i++) { 13 arr[i] = hot; 16 for (i = 0; i < sizeof arr / sizeof arr[0]; i++) { 17 arr[i] = cold;
|
/prebuilts/go/linux-x86/src/debug/dwarf/testdata/ |
H A D | ranges.c | 3 const char *arr[10000]; variable 12 for (i = 0; i < sizeof arr / sizeof arr[0]; i++) { 13 arr[i] = hot; 16 for (i = 0; i < sizeof arr / sizeof arr[0]; i++) { 17 arr[i] = cold;
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.assign/ |
H A D | tuple_array_template_depth.pass.cpp | 31 array_t arr; local 33 tup = arr;
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
H A D | tuple_array_template_depth.pass.cpp | 34 array_t arr; local 35 tuple_t tup(arr);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.assign/ |
H A D | tuple_array_template_depth.pass.cpp | 31 array_t arr; local 33 tup = arr;
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/utilities/tuple/tuple.tuple/tuple.cnstr/ |
H A D | tuple_array_template_depth.pass.cpp | 34 array_t arr; local 35 tuple_t tup(arr);
|
/prebuilts/misc/common/swig/include/2.0.11/python/ |
H A D | carrays.i | 15 NAME *arr = %new_instance(NAME); 16 arr->el = %new_array(nelements, TYPE); 17 return arr;
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/ |
H A D | uninitialized_copy.pass.cpp | 72 Nasty arr[N]; local 73 std::uninitialized_copy(arr, arr+N, p); 75 assert(arr[i].i_ == i);
|
H A D | uninitialized_copy_n.pass.cpp | 72 Nasty arr[N]; local 73 std::uninitialized_copy_n(arr, N, p); 75 assert(arr[i].i_ == i);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/utilities/memory/specialized.algorithms/uninitialized.copy/ |
H A D | uninitialized_copy.pass.cpp | 72 Nasty arr[N]; local 73 std::uninitialized_copy(arr, arr+N, p); 75 assert(arr[i].i_ == i);
|
H A D | uninitialized_copy_n.pass.cpp | 72 Nasty arr[N]; local 73 std::uninitialized_copy_n(arr, N, p); 75 assert(arr[i].i_ == i);
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | range.pass.cpp | 108 P arr[] = local 117 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14); 140 P arr[] = local 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
H A D | range.pass.cpp | 108 P arr[] = local 117 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14); 140 P arr[] = local 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | range.pass.cpp | 108 P arr[] = local 117 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14); 140 P arr[] = local 151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.cnstr/ |
H A D | range.pass.cpp | 103 T arr[] = local 113 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 12, a); 136 T arr[] = local 147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/xen/ |
H A D | privcmd.h | 62 xen_pfn_t *arr; /* array of mfns - top nibble set on err */ member in struct:privcmd_mmapbatch
|
/prebuilts/misc/common/swig/include/2.0.11/ocaml/ |
H A D | ocaml.swg | 222 SWIGSTATIC void caml_array_set( CAML_VALUE arr, int n, CAML_VALUE item ) { 223 CAMLparam2(arr,item); 224 SWIG_Store_field(SWIG_Field(arr,0),n,item); 228 SWIGSTATIC value caml_array_nth( CAML_VALUE arr, int n ) { 229 CAMLparam1(arr); 230 if( SWIG_Tag_val(arr) == C_array ) 231 CAMLreturn(SWIG_Field(SWIG_Field(arr,0),n)); 232 else if( SWIG_Tag_val(arr) == C_list ) 233 CAMLreturn(caml_list_nth(arr,0)); 238 SWIGSTATIC int caml_array_len( CAML_VALUE arr ) { [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | range.pass.cpp | 152 P arr[] = local 162 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, a); 209 P arr[] = local 220 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | range.pass.cpp | 152 P arr[] = local 162 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, a); 209 P arr[] = local 220 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
H A D | range.pass.cpp | 152 P arr[] = local 162 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, a); 209 P arr[] = local 220 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[ [all...] |