Searched refs:item (Results 1 - 19 of 19) sorted by relevance

/art/tools/dexfuzz/src/dexfuzz/rawdex/
H A DOffsettable.java25 * The position of this Offsettable's item when it was read in.
38 private RawDexObject item; field in class:Offsettable
59 public Offsettable(RawDexObject item, boolean isNew) { argument
60 this.item = item;
71 return item;
H A DOffsetTracker.java30 * The idea in a nutshell is that for every Offsettable item we read, we remember
51 * the actual item, and later on the new offset for the item when
52 * the item is written out.
125 * @param item Used for recording the relevant Item into the new Offsettable.
127 public void getNewOffsettable(DexRandomAccessFile file, RawDexObject item) throws IOException { argument
128 Offsettable offsettable = new Offsettable(item, false);
362 // Based on the type of the item we just added, check the relevant Offset in the header
412 public Offsettable insertNewOffsettableAsFirstEverTypeList(RawDexObject item, argument
418 Offsettable offsettable = new Offsettable(item, tru
433 insertNewOffsettableAsFirstEverField(RawDexObject item, RawDexFile rawDexFile) argument
454 insertNewOffsettableAsFirstOfType(RawDexObject item, RawDexFile rawDexFile) argument
472 insertNewOffsettableAfter(RawDexObject item, RawDexObject itemBefore) argument
483 getOffsettableIndexForFirstItemType(RawDexObject item) argument
493 getOffsettableIndexForItem(RawDexObject item) argument
505 getOffsettableForItem(RawDexObject item) argument
[all...]
/art/runtime/
H A Ddex_file_verifier.cc295 const DexFile::MapItem* item = map->list_; local
304 if (!CheckListSize(item, count, sizeof(DexFile::MapItem), "map size")) {
310 if (UNLIKELY(last_offset >= item->offset_ && i != 0)) {
311 ErrorStringPrintf("Out of order map item: %x then %x", last_offset, item->offset_);
314 if (UNLIKELY(item->offset_ >= header_->file_size_)) {
315 ErrorStringPrintf("Map item after end of file: %x, size %x",
316 item->offset_, header_->file_size_);
320 if (IsDataSectionType(item->type_)) {
321 uint32_t icount = item
1056 const DexFile::AnnotationsDirectoryItem* item = local
1348 const DexFile::MapItem* item = map->list_; local
1466 const DexFile::AnnotationsDirectoryItem* item = local
1495 const DexFile::StringId* item = reinterpret_cast<const DexFile::StringId*>(ptr_); local
1518 const DexFile::TypeId* item = reinterpret_cast<const DexFile::TypeId*>(ptr_); local
1543 const DexFile::ProtoId* item = reinterpret_cast<const DexFile::ProtoId*>(ptr_); local
1616 const DexFile::FieldId* item = reinterpret_cast<const DexFile::FieldId*>(ptr_); local
1663 const DexFile::MethodId* item = reinterpret_cast<const DexFile::MethodId*>(ptr_); local
1710 const DexFile::ClassDef* item = reinterpret_cast<const DexFile::ClassDef*>(ptr_); local
1823 const DexFile::AnnotationSetRefItem* item = list->list_; local
1900 const DexFile::AnnotationsDirectoryItem* item = local
2064 const DexFile::MapItem* item = map->list_; local
[all...]
H A Dintern_table.h123 void MakeEmpty(GcRoot<mirror::String>& item) const {
124 item = GcRoot<mirror::String>();
126 bool IsEmpty(const GcRoot<mirror::String>& item) const {
127 return item.IsNull();
H A Dclass_linker.h723 void MakeEmpty(GcRoot<mirror::Class>& item) const {
724 item = GcRoot<mirror::Class>();
726 bool IsEmpty(const GcRoot<mirror::Class>& item) const {
727 return item.IsNull();
/art/compiler/optimizing/
H A Dsuspend_check_test.cc35 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
36 bool graph_built = builder.BuildGraph(*item);
H A Dstack_map_stream.h33 void MakeEmpty(std::pair<DexRegisterLocation, size_t>& item) const {
34 item.first = DexRegisterLocation::None();
36 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const {
37 return item.first == DexRegisterLocation::None();
H A Doptimizing_unit_test.h87 const DexFile::CodeItem* item = local
89 bool graph_built = builder.BuildGraph(*item);
H A Dpretty_printer_test.cc35 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
36 bool graph_built = builder.BuildGraph(*item);
H A Dlinearize_test.cc44 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
45 bool graph_built = builder.BuildGraph(*item);
H A Ddominator_test.cc32 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
33 bool graph_built = builder.BuildGraph(*item);
H A Dliveness_test.cc51 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
52 bool graph_built = builder.BuildGraph(*item);
H A Dssa_test.cc83 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
84 bool graph_built = builder.BuildGraph(*item);
H A Dfind_loops_test.cc33 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
34 builder.BuildGraph(*item);
H A Dlive_ranges_test.cc37 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
38 builder.BuildGraph(*item);
H A Dcodegen_test.cc250 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
251 bool graph_built = builder.BuildGraph(*item);
263 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
264 bool graph_built = builder.BuildGraph(*item);
H A Dregister_allocator_test.cc43 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
44 builder.BuildGraph(*item);
260 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); local
261 builder.BuildGraph(*item);
/art/runtime/base/
H A Dhash_set.h30 // Returns true if an item is empty.
34 void MakeEmpty(T& item) const {
35 item = T();
37 bool IsEmpty(const T& item) const {
38 return item == T();
45 void MakeEmpty(T*& item) const {
46 item = nullptr;
48 bool IsEmpty(const T*& item) const {
49 return item == nullptr;
55 // EmptyFn needs to implement two functions MakeEmpty(T& item) an
[all...]
H A Dhash_set_test.cc30 void MakeEmpty(std::string& item) const {
31 item.clear();
33 bool IsEmpty(const std::string& item) const {
34 return item.empty();

Completed in 790 milliseconds