Searched refs:element (Results 1 - 25 of 34) sorted by relevance

12

/art/test/590-checker-arr-set-null-regression/src/
H A DMain.java62 Element element = (Element) object;
63 elements[42] = element;
/art/tools/ahat/src/
H A DSitePrinter.java40 public long getSize(Site element, AhatHeap heap) {
41 return element.getSize(heap);
50 public DocString render(Site element) {
52 if (element.getParent() != null) {
55 return str.append(Summarizer.summarize(element));
H A DDominatedList.java57 public long getSize(AhatInstance element, AhatHeap heap) { argument
58 return element.getRetainedSize(heap);
68 public DocString render(AhatInstance element) {
69 return Summarizer.summarize(element);
H A DSiteHandler.java62 public long getSize(Site element, AhatHeap heap) {
63 return element.getSize(heap);
72 public DocString render(Site element) {
73 return Summarizer.summarize(element);
H A DHeapTable.java36 DocString render(T element); argument
44 long getSize(T element, AhatHeap heap); argument
163 for (T element : elements) {
164 if (config.getSize(element, heap) > 0 ||
165 config.getSize(element.getBaseline(), baseheap) > 0) {
H A DObjectHandler.java262 public long getSize(PathElement element, AhatHeap heap) {
263 if (element == root) {
266 if (element.isDominator) {
267 return element.instance.getRetainedSize(heap);
278 public DocString render(PathElement element) {
279 if (element == root) {
283 label.append(Summarizer.summarize(element.instance));
284 label.append(element.field);
H A DOverviewHandler.java80 public long getSize(TableElem element, AhatHeap heap) {
/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.cc315 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
316 if (element == nullptr) {
320 ObjPtr<mirror::Object> dex_file = dex_file_field->GetObject(element);
361 // Handle for dex-cache-element.
401 mirror::Object* element = dex_elements->GetWithoutChecks(i); local
402 if (element == nullptr) {
409 if (element_class == element->GetClass()) {
410 dex_file = dex_file_field->GetObject(element);
411 } else if (dexfile_class == element->GetClass()) {
412 dex_file = element;
[all...]
/art/tools/dexfuzz/src/dexfuzz/rawdex/
H A DEncodedAnnotation.java55 for (AnnotationElement element : elements) {
56 element.incrementIndex(kind, insertedIdx);
/art/test/ti-agent/
H A Djni_helper.h25 // Create an object array using a lambda that returns a local ref for each element.
46 jobject element = src(i); local
47 env->SetObjectArrayElement(ret.get(), static_cast<jint>(i), element);
48 env->DeleteLocalRef(element);
/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...]
H A Dhash_map.h43 bool operator()(const std::pair<Key, Value>& a, const Element& element) const {
44 return fn_(a.first, element);
H A Darray_slice.h36 // Create an array slice of the first 'length' elements of the array, with each element being
48 // each element being element_size bytes long. Both start_offset and end_offset are in
66 // each element being element_size bytes long and having the given alignment. Both start_offset
132 bool Contains(const T* element) const {
133 return &AtUnchecked(0) <= element && element < &AtUnchecked(size_);
/art/compiler/utils/
H A Datomic_method_ref_map-inl.h84 for (auto& element : it.second) {
85 element.StoreRelaxed(nullptr);
/art/test/156-register-dex-file-multi-loader/src/
H A DMain.java47 for (Object element : dexElements) {
48 Object dex = dexFileField.get(element);
/art/test/496-checker-inlining-class-loader/src/
H A DMain.java41 for (Object element : dexElements) {
42 Object dexFile = f.get(element);
/art/test/497-inlining-and-class-loader/src/
H A DMain.java63 for (Object element : dexElements) {
64 Object dex = dexFileField.get(element);
/art/test/542-unresolved-access-check/src/
H A DMain.java55 for (Object element : dexElements) {
56 Object dex = dexFileField.get(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/runtime/mirror/
H A Darray-inl.h411 inline void PointerArray::SetElementPtrSize(uint32_t idx, uint64_t element, PointerSize ptr_size) { argument
414 SetWithoutChecks<kTransactionActive>(idx, element);
416 DCHECK_LE(element, static_cast<uint64_t>(0xFFFFFFFFu));
418 ->SetWithoutChecks<kTransactionActive>(idx, static_cast<uint32_t>(element));
423 inline void PointerArray::SetElementPtrSize(uint32_t idx, T* element, PointerSize ptr_size) { argument
425 reinterpret_cast<uintptr_t>(element),
H A Darray.h157 * smaller than element size copies). Arguments are assumed to be within the bounds of the array
165 * smaller than element size copies). Arguments are assumed to be within the bounds of the array
209 void SetElementPtrSize(uint32_t idx, uint64_t element, PointerSize ptr_size)
212 void SetElementPtrSize(uint32_t idx, T* element, PointerSize ptr_size)
224 // than element size copies). Arguments are assumed to be within the bounds of the array and the
H A Ddex_cache-inl.h234 uint64_t element = reinterpret_cast<const uint64_t*>(ptr_array)[idx]; local
235 return reinterpret_cast<PtrType>(dchecked_integral_cast<uintptr_t>(element));
237 uint32_t element = reinterpret_cast<const uint32_t*>(ptr_array)[idx]; local
238 return reinterpret_cast<PtrType>(dchecked_integral_cast<uintptr_t>(element));
/art/runtime/gc/
H A Dallocation_record.cc115 const AllocRecordStackTraceElement& element = record.StackElement(i); local
116 DCHECK(element.GetMethod() != nullptr);
117 element.GetMethod()->VisitRoots(buffered_visitor, kRuntimePointerSize);
H A Dallocation_record.h105 void AddStackElement(const AllocRecordStackTraceElement& element) { argument
106 stack_.push_back(element);

Completed in 1636 milliseconds

12