Searched defs:element (Results 1 - 15 of 15) sorted by relevance

/art/tools/ahat/src/
H A DDominatedList.java61 public long getSize(Instance element, Heap heap) { argument
63 return element.getRetainedSize(index);
73 public DocString render(Instance element) {
74 return Value.render(mSnapshot, element);
H A DHeapTable.java34 DocString render(T element); argument
42 long getSize(T element, Heap heap); argument
137 for (T element : elements) {
138 if (config.getSize(element, heap) > 0) {
/art/runtime/
H A Dmapping_table.h68 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 Doat_file_manager.cc276 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
277 if (element == nullptr) {
281 mirror::Object* dex_file = dex_file_field->GetObject(element);
320 // Handle for dex-cache-element.
358 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
359 if (element == nullptr) {
366 if (element->GetClass() == element_class) {
367 dex_file = dex_file_field->GetObject(element);
368 } else if (element->GetClass() == dexfile_class) {
369 dex_file = element;
[all...]
H A Dcommon_runtime_test.cc411 // icu4c has a fixed 10-element array "gCommonICUDataArray".
533 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
534 if (element == nullptr) {
538 mirror::Object* dex_file = dex_file_field->GetObject(element);
H A Ddebugger.cc1198 mirror::Object* element = oa->Get(offset + i); local
1199 JDWP::JdwpTag specific_tag = (element != nullptr) ? TagFromObject(soa, element)
1202 expandBufAddObjectId(pReply, gRegistry->Add(element));
H A Dclass_linker.cc241 // Note that the priority queue returns the largest element, so operator()
1075 mirror::Object* element)
1083 DCHECK(element != nullptr);
1084 CHECK_EQ(dex_file_field->GetDeclaringClass(), element->GetClass()) << PrettyTypeOf(element);
1085 mirror::Object* dex_file = dex_file_field->GetObject(element);
1127 mirror::Object* const element = dex_elements->GetWithoutChecks(i); member in class:art::mirror
1128 if (element == nullptr) {
1129 *error_msg = StringPrintf("Null dex element at index %d", i);
1132 mirror::String* const name = GetDexPathListElementName(soa, element);
1689 mirror::Object* element = elements->GetWithoutChecks(i); local
2295 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
[all...]
/art/runtime/mirror/
H A Ddex_cache-inl.h100 uint64_t element = reinterpret_cast<const uint64_t*>(ptr_array)[idx]; local
101 return reinterpret_cast<PtrType>(dchecked_integral_cast<uintptr_t>(element));
104 uint32_t element = reinterpret_cast<const uint32_t*>(ptr_array)[idx]; local
105 return reinterpret_cast<PtrType>(dchecked_integral_cast<uintptr_t>(element));
H A Darray-inl.h387 inline void PointerArray::SetElementPtrSize(uint32_t idx, uint64_t element, size_t ptr_size) { argument
390 SetWithoutChecks<kTransactionActive>(idx, element);
393 DCHECK_LE(element, static_cast<uint64_t>(0xFFFFFFFFu));
395 ->SetWithoutChecks<kTransactionActive>(idx, static_cast<uint32_t>(element));
400 inline void PointerArray::SetElementPtrSize(uint32_t idx, T* element, size_t ptr_size) { argument
402 reinterpret_cast<uintptr_t>(element),
/art/runtime/gc/
H A Dallocation_record.cc113 const AllocRecordStackTraceElement& element = record.StackElement(i); local
114 DCHECK(element.GetMethod() != nullptr);
115 element.GetMethod()->VisitRoots(buffered_visitor, sizeof(void*));
H A Dallocation_record.h104 void AddStackElement(const AllocRecordStackTraceElement& element) { argument
105 stack_.push_back(element);
/art/test/122-npe/src/
H A DMain.java565 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 DMain.java221 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 Dhash_set.h311 // If an element in between doesn't rehash to the range from the current empty slot to the
315 // element to its actual location/index.
325 // If the next element is empty, we are done. Make sure to clear the current empty index.
330 // Otherwise try to see if the next element can fill the current empty index.
362 // Find an element, returns end() if not found.
386 // Insert an element, allows duplicates.
387 void Insert(const T& element) { argument
388 InsertWithHash(element, hashfn_(element));
391 void InsertWithHash(const T& element, size_ argument
448 const T& element = ElementForIndex(i); local
470 T& element = data_[i]; variable
552 FindIndex(const K& element, size_t hash) const argument
619 T& element = old_data[i]; local
[all...]
/art/test/107-int-math2/src/
H A DMain.java832 static void throwArrayStoreException(Object[] array, Object element) { argument
833 array[0] = element;

Completed in 4141 milliseconds