Searched defs:array (Results 1 - 25 of 32) sorted by relevance

12

/system/bt/osi/test/
H A Darray_test.cc5 #include "osi/include/array.h"
10 array_t* array = array_new(4); local
11 ASSERT_TRUE(array != NULL);
12 array_free(array);
18 array_t* array = array_new(4); local
19 EXPECT_DEATH(array_ptr(array), "");
20 array_free(array);
24 array_t* array = array_new(4); local
25 EXPECT_DEATH(array_at(array, 1), "");
26 array_free(array);
30 array_t* array = array_new(sizeof(int)); local
42 array_t* array = array_new(sizeof(int)); local
59 array_t* array = array_new(128); local
[all...]
/system/chre/util/tests/
H A Dheap_test.cc5 #include <array>
28 std::array<int, MaxSize> array; local
29 std::array<int, MaxSize> array_sorted;
32 array[i] = std::rand();
33 array_sorted[i] = array[i];
36 // make sure the popped data is in the right order of various array sizes.
39 v.push_back(array[i]);
68 std::array<int, MaxSize> array; local
[all...]
H A Ddynamic_vector_test.cc475 // Make sure that a vector wrapping an array doesn't call the destructor when
480 Dummy array[4]; local
482 array[i].setValue(i);
487 vector.wrap(array, ARRAY_SIZE(array));
500 Dummy array[4]; local
501 constexpr size_t kSize = ARRAY_SIZE(array);
502 static_assert(ARRAY_SIZE(array) <= ARRAY_SIZE(gDestructorCount),
503 "gDestructorCount array must fit test array");
832 Dummy array[kSize]; local
[all...]
/system/bt/osi/src/
H A Darray.cc21 #include "osi/include/array.h"
38 static bool grow(array_t* array);
45 array_t* array = static_cast<array_t*>( local
48 array->element_size = element_size;
49 array->capacity = INTERNAL_ELEMENTS;
50 array->data = array->internal_storage;
51 return array;
54 void array_free(array_t* array) { argument
55 if (!array) retur
62 array_ptr(const array_t* array) argument
64 array_at(const array_t* array, size_t index) argument
70 array_length(const array_t* array) argument
75 array_append_value(array_t* array, uint32_t value) argument
79 array_append_ptr(array_t* array, void* data) argument
96 grow(array_t* array) argument
[all...]
/system/bt/stack/pan/
H A Dpan_utils.cc113 uint8_t array[10], *p; local
116 p = array;
119 array);
122 p = array;
125 array);
/system/chre/apps/chqts/src/shared/
H A Dnano_string_test.cc155 char array[kAsciiLen + 1]; local
156 array[kAsciiLen] = kUnsetValue;
157 uint32ToHexAscii(array, sizeof(array), value);
158 EXPECT_EQ(kUnsetValue, array[kAsciiLen]);
159 array[kAsciiLen] = '\0';
160 EXPECT_STREQ(str, array);
/system/update_engine/scripts/update_payload/
H A Dapplier.py17 import array namespace
84 A character array containing the concatenated read data.
86 data = array.array('c')
H A Dchecker.py17 import array namespace
998 """Returns a freshly initialized array of block counters.
1000 Note that the generated array is not portable as is due to byte-ordering
1007 An array of unsigned short elements initialized to zero, one for each of
1010 return array.array('H',
H A Dchecker_unittest.py11 import array namespace
847 old_block_counters = array.array(
849 new_block_counters = array.array(
/system/chre/util/include/chre/util/
H A Ddynamic_vector_impl.h205 // Insertions are not allowed to create a sparse array.
209 // do the shift when transferring the values from the old array to the new.
232 bool DynamicVector<ElementType>::copy_array(const ElementType *array, argument
239 std::copy(array, array + elementCount, mData);
288 void DynamicVector<ElementType>::wrap(ElementType *array, size_type elementCount) {
289 // If array is nullptr, elementCount must also be 0
290 CHRE_ASSERT(array != nullptr || elementCount == 0);
293 mData = array;
/system/extras/perfprofd/quipper/
H A Dperf_utils.cc43 string HexToString(const u8* array, size_t length) { argument
49 snprintf(buffer, sizeof(buffer), "%02x", array[i]);
55 bool StringToHex(const string& str, u8* array, size_t length) { argument
59 // Stop when there are no more characters, or the array has been filled.
64 array[i] = strtol(one_byte.c_str(), &err, kHexRadix);
120 offset = offsetof(event_t, sample.array);
/system/extras/simpleperf/
H A Dperf_clock.cpp58 TryMmap array[TRY_MMAP_COUNT]; local
63 array[i].start_system_time_in_ns = GetSystemClock();
64 array[i].mmap_start_addr =
66 if (array[i].mmap_start_addr == MAP_FAILED) {
72 array[i].end_system_time_in_ns = GetSystemClock();
78 array[i].end_system_time_in_ns - array[i].start_system_time_in_ns;
83 munmap(array[i].mmap_start_addr, 4096);
86 reinterpret_cast<uint64_t>(array[best_index].mmap_start_addr);
89 thread_arg->system_time_in_ns = array[best_inde
[all...]
/system/tools/aidl/tests/
H A Daidl_test_client_file_descriptors.cpp142 vector<unique_fd> array; local
143 array.resize(2);
145 if (!DoPipe(&array[0], &array[1])) {
152 status = s->ReverseFileDescriptorArray(array, &repeated, &reversed);
155 cerr << "Could not reverse file descriptor array." << endl;
160 DoWrite(FdByName(array[1]), "First") &&
/system/core/include/utils/
H A DSortedVector.h73 * C-style array access
77 inline const TYPE* array() const;
79 //! read-write C-style access. BE VERY CAREFUL when modifying the array
102 * modifying the array
133 inline const_iterator begin() const { return array(); }
134 inline const_iterator end() const { return array() + size(); }
138 ssize_t index = removeItemsAt(pos-array());
189 const TYPE* SortedVector<TYPE>::array() const { function in class:android::SortedVector
204 return *(array() + index);
214 return *(array()
[all...]
H A DVector.h102 * C-style array access
106 inline const TYPE* array() const;
122 * modifying the array
141 //! insert an array at a given index
142 ssize_t insertArrayAt(const TYPE* array, size_t index, size_t length);
144 //! append an array at the end of this vector
145 ssize_t appendArray(const TYPE* array, size_t length);
180 * sort (stable) the array
202 inline const_iterator begin() const { return array(); }
203 inline const_iterator end() const { return array()
276 const TYPE* Vector<TYPE>::array() const { function in class:android::Vector
325 insertArrayAt(const TYPE* array, size_t index, size_t length) argument
330 appendArray(const TYPE* array, size_t length) argument
[all...]
/system/core/libutils/
H A DVectorImpl.cpp126 ssize_t VectorImpl::insertArrayAt(const void* array, size_t index, size_t length) argument
132 _do_copy(where, array, length);
137 ssize_t VectorImpl::appendArray(const void* array, size_t length) argument
139 return insertArrayAt(array, size(), length);
179 void* array = const_cast<void*>(arrayImpl()); local
183 void* item = reinterpret_cast<char*>(array) + mItemSize*(i);
184 void* curr = reinterpret_cast<char*>(array) + mItemSize*(i-1);
188 // we're going to have to modify the array...
189 array = editArrayImpl();
190 if (!array) retur
[all...]
/system/core/libutils/include/utils/
H A DSortedVector.h73 * C-style array access
77 inline const TYPE* array() const;
79 //! read-write C-style access. BE VERY CAREFUL when modifying the array
102 * modifying the array
133 inline const_iterator begin() const { return array(); }
134 inline const_iterator end() const { return array() + size(); }
138 ssize_t index = removeItemsAt(pos-array());
189 const TYPE* SortedVector<TYPE>::array() const { function in class:android::SortedVector
204 return *(array() + index);
214 return *(array()
[all...]
H A DVector.h102 * C-style array access
106 inline const TYPE* array() const;
122 * modifying the array
141 //! insert an array at a given index
142 ssize_t insertArrayAt(const TYPE* array, size_t index, size_t length);
144 //! append an array at the end of this vector
145 ssize_t appendArray(const TYPE* array, size_t length);
180 * sort (stable) the array
202 inline const_iterator begin() const { return array(); }
203 inline const_iterator end() const { return array()
276 const TYPE* Vector<TYPE>::array() const { function in class:android::Vector
325 insertArrayAt(const TYPE* array, size_t index, size_t length) argument
330 appendArray(const TYPE* array, size_t length) argument
[all...]
/system/extras/latencytop/
H A Dlatencytop.c370 struct latency_entry *e, **array; local
382 array = calloc(count, sizeof(struct latency_entry *));
383 if (!array) {
384 fprintf(stderr, "Error allocating array: %s\n", strerror(errno));
388 array[i] = e;
392 qsort(array, count, sizeof(struct latency_entry *), &lat_cmp);
396 e = array[i];
405 free(array);
/system/keymaster/include/keymaster/
H A Dandroid_keymaster_utils.h46 * to allow size-based array operations without explicitly specifying the size. If passed a pointer
47 * rather than an array, they'll fail to compile.
51 * Return the size in bytes of the array \p a.
58 * Return the number of elements in array \p a.
65 * Duplicate the array \p a. The memory for the new array is allocated and the caller takes
77 * Duplicate the array \p a. The memory for the new array is allocated and the caller takes
79 * array_length() on the original array to discover the size.
92 * Copy the contents of array \
169 ArrayWrapper(T* array, size_t size) argument
[all...]
/system/tpm/attestation/server/
H A Dpkcs11_key_store_test.cc280 CK_ATTRIBUTE_PTR array = parsed.attributes(); local
282 if (array[i].type == type) {
283 if (!array[i].pValue)
285 return std::string(reinterpret_cast<char*>(array[i].pValue),
286 array[i].ulValueLen);
/system/core/libnetutils/
H A Ddhcpclient.c237 static void hex2str(char *buf, size_t buf_size, const unsigned char *array, int len) argument
243 cp += snprintf(cp, buf_end - cp, " %02x ", array[i]);
/system/libhidl/
H A Dtest_main.cpp179 int32_t array[] = {5, 6, 7};
180 vector<int32_t> v(array, array + 3);
183 EXPECT_ARRAYEQ(hv1, array, 3);
193 EXPECT_ARRAYEQ(v3, array, v3.size());
197 int32_t array[] = {5, 6, 7}; local
198 android::hardware::hidl_vec<int32_t> hv1 = std::vector<int32_t>(array, array + 3);
235 int32_t array[] = {5, 6, 7};
236 hidl_vec<int32_t> hv1 = std::vector<int32_t>(array, arra
[all...]
/system/tools/hidl/test/java_test/src/com/android/commands/hidl_test_java/
H A DHidlTestJava.java868 public String[] haveSomeStrings(String[] array) { argument
870 + "\"" + array[0] + "\", "
871 + "\"" + array[1] + "\", "
872 + "\"" + array[2] + "\"]");
/system/bt/stack/include/
H A Dsdp_api.h98 uint8_t array[4]; /* Variable length field */ member in union:__anon1176::__anon1177

Completed in 846 milliseconds

12