Home
last modified time | relevance | path

Searched refs:arr (Results 1 – 25 of 861) sorted by relevance

12345678910>>...35

/external/libxkbcommon/xkbcommon/src/
Ddarray.h38 #define darray_init(arr) do { \ argument
39 (arr).item = 0; (arr).size = 0; (arr).alloc = 0; \
42 #define darray_free(arr) do { \ argument
43 free((arr).item); \
44 darray_init(arr); \
47 #define darray_steal(arr, to, to_size) do { \ argument
48 *(to) = (arr).item; \
50 *(unsigned int *) (to_size) = (arr).size; \
51 darray_init(arr); \
85 #define darray_item(arr, i) ((arr).item[i]) argument
[all …]
/external/clang/test/SemaCXX/
Dtype-traits.cpp168 { int arr[T(__is_pod(int))]; } in is_pod() local
169 { int arr[T(__is_pod(Enum))]; } in is_pod() local
170 { int arr[T(__is_pod(POD))]; } in is_pod() local
171 { int arr[T(__is_pod(Int))]; } in is_pod() local
172 { int arr[T(__is_pod(IntAr))]; } in is_pod() local
173 { int arr[T(__is_pod(Statics))]; } in is_pod() local
174 { int arr[T(__is_pod(Empty))]; } in is_pod() local
175 { int arr[T(__is_pod(EmptyUnion))]; } in is_pod() local
176 { int arr[T(__is_pod(Union))]; } in is_pod() local
177 { int arr[T(__is_pod(HasFunc))]; } in is_pod() local
[all …]
Darray-bounds.cpp77 char arr[I]; // expected-note 3 {{declared here}} member
81 …s.arr[4] = 0; // expected-warning 2 {{array index 4 is past the end of the array (which contains 3… in f()
82 …s.arr[I] = 0; // expected-warning {{array index 5 is past the end of the array (which contains 3 e… in f()
90 #define ARR_IN_MACRO(flag, arr, idx) flag ? arr[idx] : 1 argument
93 int arr[SIZE]; // expected-note {{array 'arr' declared here}} in test_no_warn_macro_unreachable() local
94 return ARR_IN_MACRO(0, arr, SIZE) + // no-warning in test_no_warn_macro_unreachable()
95 …ARR_IN_MACRO(1, arr, SIZE); // expected-warning{{array index 10 is past the end of the array (whic… in test_no_warn_macro_unreachable()
108 int arr[3 + (extendArray ? 1 : 0)]; in pr9284() local
111 arr[3] = 42; // no-warning in pr9284()
116 int arr[3 + (extendArray ? 1 : 0)]; // expected-note {{array 'arr' declared here}} in pr9284b() local
[all …]
/external/deqp/framework/delibs/decpp/
DdePoolArray.cpp35 PoolArray<int> arr (&pool); in intArrayTest() local
45 arr.pushBack(i); in intArrayTest()
49 DE_TEST_ASSERT(arr.size() == 5000); in intArrayTest()
53 DE_TEST_ASSERT(arr[i] == i); in intArrayTest()
60 DE_TEST_ASSERT(arr.popBack() == (4999 - i)); in intArrayTest()
64 DE_TEST_ASSERT(arr.size() == 4000); in intArrayTest()
68 DE_TEST_ASSERT(arr[i] == i); in intArrayTest()
73 arr.resize(1000); in intArrayTest()
77 arr.pushBack(i); in intArrayTest()
81 DE_TEST_ASSERT(arr.size() == 5000); in intArrayTest()
[all …]
/external/tensorflow/tensorflow/compiler/xla/
Darray2d_test.cc53 Array2D<int> arr = {{1, 2, 3}, {4, 5, 6}}; in TEST() local
55 EXPECT_EQ(arr.n1(), 2); in TEST()
56 EXPECT_EQ(arr.n2(), 3); in TEST()
58 EXPECT_EQ(arr(0, 0), 1); in TEST()
59 EXPECT_EQ(arr(0, 1), 2); in TEST()
60 EXPECT_EQ(arr(0, 2), 3); in TEST()
61 EXPECT_EQ(arr(1, 0), 4); in TEST()
62 EXPECT_EQ(arr(1, 1), 5); in TEST()
63 EXPECT_EQ(arr(1, 2), 6); in TEST()
67 Array2D<Eigen::half> arr = {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}; in TEST() local
[all …]
Darray_test.cc50 Array<int> arr({{1, 2, 3}, {4, 5, 6}}); in TEST() local
52 EXPECT_EQ(arr.dim(0), 2); in TEST()
53 EXPECT_EQ(arr.dim(1), 3); in TEST()
55 EXPECT_EQ(arr(0, 0), 1); in TEST()
56 EXPECT_EQ(arr(0, 1), 2); in TEST()
57 EXPECT_EQ(arr(0, 2), 3); in TEST()
58 EXPECT_EQ(arr(1, 0), 4); in TEST()
59 EXPECT_EQ(arr(1, 1), 5); in TEST()
60 EXPECT_EQ(arr(1, 2), 6); in TEST()
83 Array<int> arr({2, 3}); in TEST() local
[all …]
Darray4d_test.cc30 int64 Array4DLinearIndex(const Array4D<T>& arr, absl::Span<const int64> idx) { in Array4DLinearIndex() argument
32 return (idx[3] + idx[2] * arr.n4() + idx[1] * arr.n3() * arr.n4() + in Array4DLinearIndex()
33 idx[0] * arr.n2() * arr.n3() * arr.n4()); in Array4DLinearIndex()
63 Array4D<int> arr(2, 3, 4, 5, filler); in TEST() local
65 EXPECT_EQ(arr.n1(), 2); in TEST()
66 EXPECT_EQ(arr.n2(), 3); in TEST()
67 EXPECT_EQ(arr.n3(), 4); in TEST()
68 EXPECT_EQ(arr.n4(), 5); in TEST()
70 arr.Each([&arr](absl::Span<const int64> idx, int* cell) { in TEST()
71 EXPECT_EQ(*cell, Array4DLinearIndex(arr, idx)); in TEST()
[all …]
Darray3d_test.cc51 Array3D<int> arr = {{{1, 2}, {3, 4}, {5, 6}, {7, 8}}, in TEST() local
55 EXPECT_EQ(arr.n1(), 3); in TEST()
56 EXPECT_EQ(arr.n2(), 4); in TEST()
57 EXPECT_EQ(arr.n3(), 2); in TEST()
58 EXPECT_EQ(arr.num_elements(), 24); in TEST()
60 EXPECT_EQ(arr(0, 0, 0), 1); in TEST()
61 EXPECT_EQ(arr(0, 0, 1), 2); in TEST()
62 EXPECT_EQ(arr(0, 1, 0), 3); in TEST()
63 EXPECT_EQ(arr(0, 3, 1), 8); in TEST()
64 EXPECT_EQ(arr(1, 0, 0), 9); in TEST()
[all …]
/external/deqp/framework/delibs/depool/
DdePoolArray.c46 dePoolArray* arr = DE_POOL_NEW(pool, dePoolArray); in dePoolArray_create() local
47 if (!arr) in dePoolArray_create()
51 memset(arr, 0, sizeof(dePoolArray)); in dePoolArray_create()
52 arr->pool = pool; in dePoolArray_create()
53 arr->elementSize = elementSize; in dePoolArray_create()
55 return arr; in dePoolArray_create()
65 deBool dePoolArray_reserve (dePoolArray* arr, int size) in dePoolArray_reserve() argument
67 if (size >= arr->capacity) in dePoolArray_reserve()
75 if (arr->pageTableCapacity < reqPageTableCapacity) in dePoolArray_reserve()
77 int newPageTableCapacity = deMax32(2*arr->pageTableCapacity, reqPageTableCapacity); in dePoolArray_reserve()
[all …]
DdePoolArray.h53 deBool dePoolArray_reserve (dePoolArray* arr, int capacity);
54 deBool dePoolArray_setSize (dePoolArray* arr, int size);
107 DE_INLINE int TYPENAME##_getNumElements (const TYPENAME* arr) DE_UNUSED_FUNCTION; \
108 DE_INLINE deBool TYPENAME##_reserve (DE_PTR_TYPE(TYPENAME) arr, int capacity) DE_UNUSED_FUNCTI…
109 DE_INLINE deBool TYPENAME##_setSize (DE_PTR_TYPE(TYPENAME) arr, int size) DE_UNUSED_FUNCTION;…
110 DE_INLINE void TYPENAME##_reset (DE_PTR_TYPE(TYPENAME) arr) DE_UNUSED_FUNCTION; \
111 DE_INLINE VALUETYPE TYPENAME##_get (const TYPENAME* arr, int ndx) DE_UNUSED_FUNCTION; \
112 DE_INLINE void TYPENAME##_set (DE_PTR_TYPE(TYPENAME) arr, int ndx, VALUETYPE elem) DE_UNUSED_FU…
113 DE_INLINE deBool TYPENAME##_pushBack (DE_PTR_TYPE(TYPENAME) arr, VALUETYPE elem) DE_UNUSED_FUN…
114 DE_INLINE VALUETYPE TYPENAME##_popBack (DE_PTR_TYPE(TYPENAME) arr) DE_UNUSED_FUNCTION; \
[all …]
/external/protobuf/ruby/tests/
Drepeated_field_test.rb133 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
134 arr[1]
136 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
137 arr[-2]
139 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
140 arr[20]
142 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
143 arr[1, 2]
145 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
146 arr[0..2]
[all …]
/external/boringssl/src/crypto/asn1/
Dcharmap.pl60 my ($i, @arr);
76 $arr[$i] = 0;
78 $arr[$i] |= $ESC_CTRL;
85 $arr[$i] |= $PSTRING_CHAR;
93 $arr[ord(" ")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC | $RFC2253_LAST_ESC;
94 $arr[ord("#")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC;
96 $arr[ord(",")] |= $NOESC_QUOTE | $RFC2253_ESC;
97 $arr[ord("+")] |= $NOESC_QUOTE | $RFC2253_ESC;
98 $arr[ord("\"")] |= $RFC2253_ESC;
99 $arr[ord("\\")] |= $RFC2253_ESC;
[all …]
/external/pdfium/core/fpdfapi/parser/
Dcpdf_array_unittest.cpp18 auto arr = pdfium::MakeUnique<CPDF_Array>(); in TEST() local
20 arr->AddNew<CPDF_Number>(elems[i]); in TEST()
22 arr->RemoveAt(3); in TEST()
24 ASSERT_EQ(FX_ArraySize(expected), arr->GetCount()); in TEST()
26 EXPECT_EQ(expected[i], arr->GetIntegerAt(i)); in TEST()
27 arr->RemoveAt(4); in TEST()
28 arr->RemoveAt(4); in TEST()
30 ASSERT_EQ(FX_ArraySize(expected2), arr->GetCount()); in TEST()
32 EXPECT_EQ(expected2[i], arr->GetIntegerAt(i)); in TEST()
37 auto arr = pdfium::MakeUnique<CPDF_Array>(); in TEST() local
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/
Daarch64-minmaxv.ll24 define i8 @smax_B(<16 x i8>* nocapture readonly %arr) {
25 %arr.load = load <16 x i8>, <16 x i8>* %arr
26 %r = call i8 @llvm.experimental.vector.reduce.smax.i8.v16i8(<16 x i8> %arr.load)
32 define i16 @smax_H(<8 x i16>* nocapture readonly %arr) {
33 %arr.load = load <8 x i16>, <8 x i16>* %arr
34 %r = call i16 @llvm.experimental.vector.reduce.smax.i16.v8i16(<8 x i16> %arr.load)
40 define i32 @smax_S(<4 x i32> * nocapture readonly %arr) {
41 %arr.load = load <4 x i32>, <4 x i32>* %arr
42 %r = call i32 @llvm.experimental.vector.reduce.smax.i32.v4i32(<4 x i32> %arr.load)
48 define i8 @umax_B(<16 x i8>* nocapture readonly %arr) {
[all …]
/external/skia/modules/canvaskit/
Dhelper.js64 function copy1dArray(arr, dest) { argument
65 if (!arr || !arr.length) {
68 var ptr = CanvasKit._malloc(arr.length * dest.BYTES_PER_ELEMENT);
78 dest.set(arr, ptr / dest.BYTES_PER_ELEMENT);
85 function copy2dArray(arr, dest) { argument
86 if (!arr || !arr.length) {
89 var ptr = CanvasKit._malloc(arr.length * arr[0].length * dest.BYTES_PER_ELEMENT);
92 for (var r = 0; r < arr.length; r++) {
93 for (var c = 0; c < arr[0].length; c++) {
94 dest[adjustedPtr + idx] = arr[r][c];
[all …]
/external/libxkbcommon/xkbcommon/test/
Datom.c70 struct atom_string *arr; in test_random_strings() local
81 arr = calloc(N, sizeof(*arr)); in test_random_strings()
82 assert(arr); in test_random_strings()
85 random_string(&arr[i].string, &arr[i].len); in test_random_strings()
87 atom = atom_lookup(table, arr[i].string, arr[i].len); in test_random_strings()
92 if (arr[i].len != strlen(string) || in test_random_strings()
93 strncmp(string, arr[i].string, arr[i].len) != 0) { in test_random_strings()
98 arr[i].len, (int) arr[i].len, arr[i].string); in test_random_strings()
103 free(arr[i].string); in test_random_strings()
108 arr[i].atom = atom_intern(table, arr[i].string, arr[i].len, false); in test_random_strings()
[all …]
/external/deqp/external/openglcts/modules/common/
DglcShaderStructTests.cpp1242 tcu::Vec2 arr[2]; in init()
1245 arr[0] = constCoords.swizzle(0, 1); in init()
1246 arr[1] = constCoords.swizzle(2, 3); in init()
1248 setUniform(gl, programID, "s[0].b[0].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1249 arr[0] = constCoords.swizzle(2, 3); in init()
1250 arr[1] = constCoords.swizzle(0, 1); in init()
1252 setUniform(gl, programID, "s[0].b[1].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1253 arr[0] = constCoords.swizzle(0, 2); in init()
1254 arr[1] = constCoords.swizzle(1, 3); in init()
1256 setUniform(gl, programID, "s[0].b[2].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
[all …]
/external/Microsoft-GSL/tests/
Dspan_tests.cpp170 int arr[4] = {1, 2, 3, 4}; variable
176 span<int> s = { &arr[0], i };
178 CHECK(s.data() == &arr[0]);
182 CHECK(arr[j] == s[j]);
183 CHECK(arr[j] == s.at(j));
184 CHECK(arr[j] == s(j));
188 span<int> s = { &arr[i], 4-narrow_cast<ptrdiff_t>(i) };
190 CHECK(s.data() == &arr[i]);
194 CHECK(arr[j+i] == s[j]);
195 CHECK(arr[j+i] == s.at(j));
[all …]
Dmulti_span_tests.cpp239 int arr[4] = {1, 2, 3, 4}; variable
242 multi_span<int> s{&arr[0], 2};
243 CHECK((s.length() == 2 && s.data() == &arr[0]));
248 multi_span<int, 2> s{&arr[0], 2};
249 CHECK((s.length() == 2 && s.data() == &arr[0]));
269 int arr[4] = {1, 2, 3, 4}; variable
272 multi_span<int> s{&arr[0], &arr[2]};
273 CHECK((s.length() == 2 && s.data() == &arr[0]));
278 multi_span<int, 2> s{&arr[0], &arr[2]};
279 CHECK((s.length() == 2 && s.data() == &arr[0]));
[all …]
/external/deqp/modules/gles3/functional/
Des3fShaderStructTests.cpp1555 tcu::Vec2 arr[2]; in init()
1558 arr[0] = constCoords.swizzle(0,1); in init()
1559 arr[1] = constCoords.swizzle(2,3); in init()
1561 setUniform(gl, programID, "s[0].b[0].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1562 arr[0] = constCoords.swizzle(2,3); in init()
1563 arr[1] = constCoords.swizzle(0,1); in init()
1565 setUniform(gl, programID, "s[0].b[1].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1566 arr[0] = constCoords.swizzle(0,2); in init()
1567 arr[1] = constCoords.swizzle(1,3); in init()
1569 setUniform(gl, programID, "s[0].b[2].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
[all …]
/external/libcxx/test/std/containers/sequences/array/array.cons/
Ddeduct.pass.cpp38 std::array arr{1,2,3}; // array(T, U...) in main() local
39 static_assert(std::is_same_v<decltype(arr), std::array<int, 3>>, ""); in main()
40 assert(arr[0] == 1); in main()
41 assert(arr[1] == 2); in main()
42 assert(arr[2] == 3); in main()
47 std::array arr{1L, 4L, 9L, l1}; // array(T, U...) in main() local
48 static_assert(std::is_same_v<decltype(arr)::value_type, long>, ""); in main()
49 static_assert(arr.size() == 4, ""); in main()
50 assert(arr[0] == 1); in main()
51 assert(arr[1] == 4); in main()
[all …]
/external/deqp/modules/gles2/functional/
Des2fShaderStructTests.cpp1551 tcu::Vec2 arr[2]; in init()
1554 arr[0] = constCoords.swizzle(0,1); in init()
1555 arr[1] = constCoords.swizzle(2,3); in init()
1557 setUniform(gl, programID, "s[0].b[0].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1558 arr[0] = constCoords.swizzle(2,3); in init()
1559 arr[1] = constCoords.swizzle(0,1); in init()
1561 setUniform(gl, programID, "s[0].b[1].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
1562 arr[0] = constCoords.swizzle(0,2); in init()
1563 arr[1] = constCoords.swizzle(1,3); in init()
1565 setUniform(gl, programID, "s[0].b[2].b", &arr[0], DE_LENGTH_OF_ARRAY(arr)); in init()
[all …]
/external/webrtc/webrtc/base/
Darray_view_unittest.cc28 char arr[] = "Arrr!"; in TEST() local
30 Call<const char>(arr); in TEST()
32 Call<char>(arr); in TEST()
38 ArrayView<char> y = arr; in TEST()
40 EXPECT_EQ(arr, y.data()); in TEST()
41 ArrayView<const char> z(arr + 1, 3); in TEST()
43 EXPECT_EQ(arr + 1, z.data()); in TEST()
44 ArrayView<const char> w(arr, 2); in TEST()
46 EXPECT_EQ(arr, w.data()); in TEST()
47 ArrayView<char> q(arr, 0); in TEST()
[all …]
/external/smali/util/src/main/java/org/jf/util/
DArraySortedSet.java41 @Nonnull private final Object[] arr; field in ArraySortedSet
43 private ArraySortedSet(@Nonnull Comparator<? super T> comparator, @Nonnull T[] arr) { in ArraySortedSet() argument
46 this.arr = arr; in ArraySortedSet()
49 …blic static <T> ArraySortedSet<T> of(@Nonnull Comparator<? super T> comparator, @Nonnull T[] arr) { in of() argument
50 return new ArraySortedSet<T>(comparator, arr); in of()
55 return arr.length; in size()
60 return arr.length > 0; in isEmpty()
66 return Arrays.binarySearch((T[])arr, (T)o, comparator) >= 0; in contains()
72 return Iterators.forArray((T[])arr); in iterator()
77 return arr.clone(); in toArray()
[all …]
/external/libcxx/test/std/containers/views/span.cons/
Dptr_ptr.pass.cpp27 int arr[] = {1,2,3}; in checkCV() local
34 … std::span< int> s1{ arr, arr + 3}; // a span< int> pointing at int. in checkCV()
43 …std::span< int,3> s1{ arr, arr + 3}; // a span< int> pointing at … in checkCV()
53 …std::span<const int> s1{ arr, arr + 3}; // a span<const int> pointing at … in checkCV()
54 …std::span< volatile int> s2{ arr, arr + 3}; // a span< volatile int> pointing at … in checkCV()
55 …std::span< volatile int> s3{ arr, arr + 3}; // a span< volatile int> pointing at … in checkCV()
56 …std::span<const volatile int> s4{ arr, arr + 3}; // a span<const volatile int> pointing at … in checkCV()
64 … std::span<const int,3> s1{ arr, arr + 3}; // a span<const int> pointing at int. in checkCV()
65 … std::span< volatile int,3> s2{ arr, arr + 3}; // a span< volatile int> pointing at int. in checkCV()
66 …std::span< volatile int,3> s3{ arr, arr + 3}; // a span< volatile int> pointing at cons… in checkCV()
[all …]

12345678910>>...35