/system/chre/core/include/chre/core/ |
H A D | request_multiplexer_impl.h | 26 size_t *index, 28 CHRE_ASSERT(index); 33 *index = (mRequests.size() - 1); 42 size_t index, const RequestType& request, bool *maximalRequestChanged) { 44 CHRE_ASSERT(index < mRequests.size()); 46 if (index < mRequests.size()) { 47 mRequests[index] = request; 54 size_t index, bool *maximalRequestChanged) { 56 CHRE_ASSERT(index < mRequests.size()); 58 if (index < mRequest 25 addRequest(const RequestType& request, size_t *index, bool *maximalRequestChanged) argument 41 updateRequest( size_t index, const RequestType& request, bool *maximalRequestChanged) argument [all...] |
/system/chre/util/include/chre/util/ |
H A D | heap_impl.h | 31 void siftUp(ContainerType& container, size_t index, argument 33 CHRE_ASSERT(index < container.size()); 34 size_t current = index; 47 void siftDown(ContainerType& container, size_t index, argument 49 CHRE_ASSERT(index < container.size()); 50 size_t current = index; 54 while (index < container.size() - 1) { 95 void remove_heap(ContainerType& container, size_t index, argument 97 CHRE_ASSERT(index < container.size()); 98 container.swap(index, containe [all...] |
H A D | priority_queue_impl.h | 73 size_t index) { 74 return mData[index]; 79 size_t index) const { 80 return mData[index]; 102 void PriorityQueue<ElementType, CompareFunction>::remove(size_t index) { argument 103 CHRE_ASSERT(index < mData.size()); 104 if (index < mData.size()) { 105 remove_heap(mData, index, mCompare); 72 operator []( size_t index) argument
|
H A D | fixed_size_vector_impl.h | 106 size_t index) { 107 CHRE_ASSERT(index < mSize); 108 if (index >= mSize) { 109 index = mSize - 1; 112 return data()[index]; 117 size_t index) const { 118 CHRE_ASSERT(index < mSize); 119 if (index >= mSize) { 120 index = mSize - 1; 123 return data()[index]; 105 operator []( size_t index) argument 127 erase(size_t index) argument [all...] |
/system/chre/apps/chqts/src/general_test/ |
H A D | heap_alloc_stress_test.cc | 83 size_t index; local 85 for (index = 0; (index < kNumPtrs); index++) { 99 ptrs[index] = ptr; 101 if (index == 0) { 107 index--; 108 chreHeapFree(ptrs[index]); 109 ptrs[index] = chreHeapAlloc(last_alloc_size); 110 if (ptrs[index] [all...] |
H A D | basic_sensor_tests.cc | 32 static void checkTimestampDelta(uint32_t delta, uint32_t index) { argument 33 if (index == 0) { 38 sendFatalFailureToHost("timestampDelta was 0 for reading index ", 39 &index);
|
H A D | timer_stress_test.cc | 114 void TimerStressTest::handleStageEvent(uint32_t index) { argument 115 switch (index) { 117 sendFatalFailureToHost("Canceled timer fired:", &index); 123 markSuccess(index); 128 markSuccess(index); 132 sendFatalFailureToHost("Unexpected event stage:", &index);
|
/system/chre/core/tests/ |
H A D | request_multiplexer_test.cc | 56 size_t index; local 58 ASSERT_TRUE(multiplexer.addRequest(request, &index, &maximalRequestChanged)); 66 size_t index; local 68 ASSERT_TRUE(multiplexer.addRequest(request, &index, &maximalRequestChanged)); 75 size_t index; local 80 ASSERT_TRUE(multiplexer.addRequest(request, &index, 89 ASSERT_TRUE(multiplexer.addRequest(request, &index, 99 size_t index; local 101 ASSERT_TRUE(multiplexer.addRequest(request, &index, &maximalRequestChanged)); 103 EXPECT_EQ(multiplexer.getRequests()[index] 116 size_t index; local 158 size_t index; local 205 size_t index; local 264 size_t index; local 308 size_t index; local 352 size_t index; local 406 size_t index; local [all...] |
/system/chre/util/tests/ |
H A D | fixed_size_vector_test.cc | 183 size_t index = 0; local 186 EXPECT_EQ(vector[index++], *it); 202 size_t index = 0; local 205 EXPECT_EQ(vector[index++], *cit); 227 size_t index = 0; local 229 EXPECT_EQ(vector[index++], *it_b++); 244 size_t index = 0; local 246 EXPECT_EQ(vector[index++], *it_b++); 260 size_t index = 0; local 261 while (index < 277 size_t index = 0; local 298 size_t index = 0; local [all...] |
H A D | array_queue_test.cc | 211 size_t index = 0; local 213 EXPECT_EQ(q[index++], *it); 216 index = 0; 219 EXPECT_EQ(q[index++], *it++); 227 index = 0; 230 EXPECT_EQ(q[index++], *it++); 244 size_t index = 0; local 246 EXPECT_EQ(q[index++], *it_b++); 287 size_t index = 0; local 289 EXPECT_EQ(q[index 299 size_t index = 0; local [all...] |
H A D | priority_queue_test.cc | 10 DummyElement(int index, int value) { argument 12 mIndex = index;
|
/system/extras/memory_replay/ |
H A D | Pointers.cpp | 78 size_t index = GetHash(key_pointer); local 80 if (atomic_load(&pointers_[index].key_pointer) == key_pointer) { 81 return pointers_ + index; 83 if (++index == max_pointers_) { 84 index = 0; 91 size_t index = GetHash(key_pointer); local 94 if (atomic_compare_exchange_strong(&pointers_[index].key_pointer, &empty, 96 return pointers_ + index; 98 if (++index == max_pointers_) { 99 index [all...] |
/system/nfc/halimpl/bcm2079x/adaptation/ |
H A D | StartupConfig.cpp | 115 uint8_t index = 1, tlvType = 0, tlvLen = 0; local 119 if (index > maxLen) break; 120 tlvType = mBuffer[index]; 121 index++; 122 tlvLen = mBuffer[index]; 123 index++; 126 index++; // index of second byte in TLV's value 127 mBuffer[index] = mBuffer[index] | bitmas [all...] |
/system/nvram/core/include/nvram/core/ |
H A D | nvram_manager.h | 91 uint32_t index; member in struct:nvram::NvramManager::SpaceListEntry 97 // an index and pointer to the transient information held in the 125 // Finds the array index in |spaces_| that corresponds to |space_index|. 129 // Loads space data for |index|. Fills in |space_record| and returns true if 131 bool LoadSpaceRecord(uint32_t index, 138 // Write |space| data for |index|. 139 nvram_result_t WriteSpace(uint32_t index, const NvramSpace& space);
|
/system/nvram/core/ |
H A D | persistence.cpp | 117 storage::Status LoadSpace(uint32_t index, NvramSpace* space) { argument 119 storage::Status status = storage::LoadSpace(index, &blob); 126 storage::Status StoreSpace(uint32_t index, const NvramSpace& space) { argument 132 return storage::StoreSpace(index, blob); 135 storage::Status DeleteSpace(uint32_t index) { argument 136 return storage::DeleteSpace(index);
|
/system/tools/aidl/ |
H A D | generate_java.cpp | 51 Variable* VariableFactory::Get(int index) { argument 52 return vars_[index];
|
/system/bt/btif/co/ |
H A D | bta_gatts_co.cc | 143 UNUSED_ATTR uint8_t index, 142 bta_gatts_co_load_handle_range( UNUSED_ATTR uint8_t index, UNUSED_ATTR tBTA_GATTS_HNDL_RANGE* p_handle_range) argument
|
/system/bt/osi/src/ |
H A D | array.cc | 64 void* array_at(const array_t* array, size_t index) { argument 66 CHECK(index < array->length); 67 return array->data + (index * array->element_size);
|
/system/bt/osi/test/ |
H A D | leaky_bonded_queue_test.cc | 32 EXPECT_EQ(a->index, b->index); \ 37 Item(int i) { index = i; } 39 int index; member in class:testing::Item
|
/system/bt/vendor_libs/test_vendor_lib/src/ |
H A D | packet.cc | 73 bool Packet::IncrementPayloadCounter(size_t index) { argument 74 if (payload_.size() < index - 1) return false; 76 payload_[index]++; 80 bool Packet::IncrementPayloadCounter(size_t index, uint8_t max_val) { argument 81 if (payload_.size() < index - 1) return false; 83 if (payload_[index] + 1 > max_val) return false; 85 payload_[index]++;
|
/system/chre/apps/wifi_offload/ |
H A D | channel_histogram.cc | 56 * Returns the index of a given channel number in kAllChannels. 58 * @param channel_number Channel number we want to map to an index 86 size_t index = GetChannelIndex(channel_number); local 87 if (index == kNumChannels) { 91 if (scan_count_internal_high_res_[index] == 0) { 104 uint64_t scaled_value = scan_count_internal_high_res_[index]; 110 size_t index = GetChannelIndex(GetChannelNumber(frequency)); local 111 if (index == kNumChannels) { 115 scan_count_internal_high_res_[index]++; 127 size_t index local [all...] |
/system/core/libmemunreachable/ |
H A D | Tarjan.h | 34 size_t index; member in class:android::Node 89 it->index = UNDEFINED_INDEX; 94 if (it->index == UNDEFINED_INDEX) { 103 assert(vertex->index == UNDEFINED_INDEX); 104 vertex->index = index_; 110 if (vertex_next->index == UNDEFINED_INDEX) { 114 vertex->lowlink = std::min(vertex->lowlink, vertex_next->index); 117 if (vertex->lowlink == vertex->index) {
|
/system/core/libunwindstack/ |
H A D | DwarfEhFrame.cpp | 76 const DwarfFde* DwarfEhFrame<AddressType>::GetFdeFromIndex(size_t index) { argument 77 const FdeInfo* info = GetFdeInfoFromIndex(index); 86 size_t index) { 87 auto entry = fde_info_.find(index); 89 return &fde_info_[index]; 91 FdeInfo* info = &fde_info_[index]; 94 memory_.set_cur_offset(entries_offset_ + 2 * index * table_entry_size_); 100 fde_info_.erase(index); 85 GetFdeInfoFromIndex( size_t index) argument
|
H A D | ElfInterfaceArm.h | 38 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } argument
|
H A D | Maps.cpp | 45 size_t index = (first + last) / 2; local 46 MapInfo* cur = &maps_[index]; 50 last = index; 52 first = index + 1;
|