/art/compiler/utils/ |
H A D | growable_array.h | 78 // Insert an element to the end of a list, resizing if necessary. 104 // Overwrite existing element at position index. List must be large enough. 116 * Remove an existing element from list. If there are more than one copy 117 * of the element, only the first one encountered will be deleted. 120 void Delete(T element) { argument 123 if (!found && elem_list_[i] == element) { 130 // We should either have found the element, or it was the last (unscanned) element. 131 DCHECK(found || (element == elem_list_[num_used_ - 1]));
|
/art/runtime/ |
H A D | mapping_table.h | 68 DexToPcIterator(const MappingTable* table, uint32_t element) : argument 69 table_(table), element_(element), end_(table_->DexToPcSize()), encoded_table_ptr_(nullptr), 71 if (element == 0) { // An iterator wanted from the start. 79 DCHECK_EQ(table_->DexToPcSize(), element); 145 PcToDexIterator(const MappingTable* table, uint32_t element) : argument 146 table_(table), element_(element), end_(table_->PcToDexSize()), encoded_table_ptr_(nullptr), 148 if (element == 0) { // An iterator wanted from the start. 156 DCHECK_EQ(table_->PcToDexSize(), element);
|
H A D | common_runtime_test.cc | 397 // icu4c has a fixed 10-element array "gCommonICUDataArray". 509 mirror::Object* element = dex_elements->GetWithoutChecks(i); local 510 if (element == nullptr) { 514 mirror::Object* dex_file = dex_file_field->GetObject(element);
|
H A D | class_linker.cc | 835 // against the following top element. If the descriptor is the same, it is now checked whether 1677 mirror::Object* element = dex_elements->GetWithoutChecks(i); local 1678 if (element == nullptr) { 1682 mirror::Object* dex_file = dex_file_field->GetObject(element); 2580 // us. It's used to ensure that we're looking for the element type in 2582 // array class; that always comes from the base element class. 2610 // element type -- an array of Strings goes with the loader for 2821 // Update the element in the hash set. 5743 const std::pair<const char*, mirror::ClassLoader*>& element) const { 5744 return ComputeModifiedUtf8Hash(element [all...] |
H A D | debugger.cc | 1266 mirror::Object* element = oa->Get(offset + i); local 1267 JDWP::JdwpTag specific_tag = (element != nullptr) ? TagFromObject(soa, element) 1270 expandBufAddObjectId(pReply, gRegistry->Add(element)); 4939 // Returns the index of the head element. 4942 // we want to use the current element. Take "head+1" and subtract count
|
/art/runtime/mirror/ |
H A D | array-inl.h | 386 inline void PointerArray::SetElementPtrSize(uint32_t idx, T element, size_t ptr_size) { argument 389 SetWithoutChecks<kTransactionActive>(idx, (uint64_t)(element)); 392 DCHECK_LE((uintptr_t)element, 0xFFFFFFFFu); 394 ->SetWithoutChecks<kTransactionActive>(idx, static_cast<uint32_t>((uintptr_t)element));
|
/art/test/122-npe/src/ |
H A D | Main.java | 565 static void checkElement(StackTraceElement element, argument 568 assertEquals(declaringClass, element.getClassName()); 569 assertEquals(methodName, element.getMethodName()); 570 assertEquals(fileName, element.getFileName()); 571 assertEquals(lineNumber, element.getLineNumber());
|
/art/test/439-npe/src/ |
H A D | Main.java | 221 static void checkElement(StackTraceElement element, argument 224 assertEquals(declaringClass, element.getClassName()); 225 assertEquals(methodName, element.getMethodName()); 226 assertEquals(fileName, element.getFileName()); 227 assertEquals(lineNumber, element.getLineNumber());
|
/art/runtime/base/ |
H A D | hash_set.h | 246 // If an element inbetween doesn't rehash to the range from the current empty slot to the 250 // element to its actual location/index. 260 // If the next element is empty, we are done. Make sure to clear the current empty index. 265 // Otherwise try to see if the next element can fill the current empty index. 297 // Find an element, returns end() if not found. 302 Iterator Find(const K& element) { argument 303 return FindWithHash(element, hashfn_(element)); 307 ConstIterator Find(const K& element) const { 308 return FindWithHash(element, hashfn 312 FindWithHash(const K& element, size_t hash) argument 317 FindWithHash(const K& element, size_t hash) const argument 322 Insert(const T& element) argument 326 InsertWithHash(const T& element, size_t hash) argument 350 const T& element = ElementForIndex(i); local 372 T& element = data_[i]; local 416 FindIndex(const K& element, size_t hash) const argument 485 T& element = old_data[i]; local [all...] |
/art/test/107-int-math2/src/ |
H A D | Main.java | 830 static void throwArrayStoreException(Object[] array, Object element) { argument 831 array[0] = element;
|
/art/compiler/ |
H A D | oat_writer.cc | 837 auto* element = writer_->image_writer_->GetDexCacheArrayElementImageAddress( local 840 return reinterpret_cast<const uint8_t*>(element) - oat_data;
|