Searched refs:item (Results 1 - 12 of 12) 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.cc343 const DexFile::MapItem* item = map->list_; local
352 if (!CheckListSize(item, count, sizeof(DexFile::MapItem), "map size")) {
358 if (UNLIKELY(last_offset >= item->offset_ && i != 0)) {
359 ErrorStringPrintf("Out of order map item: %x then %x", last_offset, item->offset_);
362 if (UNLIKELY(item->offset_ >= header_->file_size_)) {
363 ErrorStringPrintf("Map item after end of file: %x, size %x",
364 item->offset_, header_->file_size_);
368 if (IsDataSectionType(item->type_)) {
369 uint32_t icount = item
1259 const DexFile::AnnotationsDirectoryItem* item = local
1556 const DexFile::MapItem* item = map->list_; local
1675 const DexFile::AnnotationsDirectoryItem* item = local
1704 const DexFile::StringId* item = reinterpret_cast<const DexFile::StringId*>(ptr_); local
1727 const DexFile::TypeId* item = reinterpret_cast<const DexFile::TypeId*>(ptr_); local
1752 const DexFile::ProtoId* item = reinterpret_cast<const DexFile::ProtoId*>(ptr_); local
1826 const DexFile::FieldId* item = reinterpret_cast<const DexFile::FieldId*>(ptr_); local
1873 const DexFile::MethodId* item = reinterpret_cast<const DexFile::MethodId*>(ptr_); local
1920 const DexFile::ClassDef* item = reinterpret_cast<const DexFile::ClassDef*>(ptr_); local
2090 const DexFile::AnnotationSetRefItem* item = list->list_; local
2167 const DexFile::AnnotationsDirectoryItem* item = local
2331 const DexFile::MapItem* item = map->list_; local
[all...]
H A Dclass_table.h57 void MakeEmpty(GcRoot<mirror::Class>& item) const {
58 item = GcRoot<mirror::Class>();
60 bool IsEmpty(const GcRoot<mirror::Class>& item) const {
61 return item.IsNull();
H A Dintern_table.h171 void MakeEmpty(GcRoot<mirror::String>& item) const {
172 item = GcRoot<mirror::String>();
174 bool IsEmpty(const GcRoot<mirror::String>& item) const {
175 return item.IsNull();
/art/runtime/base/
H A Dhash_set_test.cc32 void MakeEmpty(std::string& item) const {
33 item.clear();
35 bool IsEmpty(const std::string& item) const {
36 return item.empty();
282 void MakeEmpty(std::vector<int>& item) const {
283 item.clear();
285 bool IsEmpty(const std::vector<int>& item) const {
286 return item.empty();
300 std::size_t operator()(const std::vector<int>& item) const {
301 return HashIntSequence(item
[all...]
H A Dhash_set.h31 // Returns true if an item is empty.
35 void MakeEmpty(T& item) const {
36 item = T();
38 bool IsEmpty(const T& item) const {
39 return item == T();
46 void MakeEmpty(T*& item) const {
47 item = nullptr;
49 bool IsEmpty(T* const& item) const {
50 return item == nullptr;
56 // EmptyFn needs to implement two functions MakeEmpty(T& item) an
[all...]
/art/compiler/optimizing/
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
94 HGraphBuilder builder(graph, *item, &handles, return_type);
H A Doptimizing_compiler.cc305 const DexFile::CodeItem* item) const;
647 // Implementation of the space filter: do not compile a code item whose size in
/art/runtime/lambda/
H A Dbox_table.h105 void MakeEmpty(std::pair<UnorderedMapKeyType, ValueType>& item) const
108 bool IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const;
H A Dbox_table.cc285 void BoxTable::EmptyFn::MakeEmpty(std::pair<UnorderedMapKeyType, ValueType>& item) const {
286 item.first = nullptr;
289 item.second = ValueType(); // Also clear the GC root.
292 bool BoxTable::EmptyFn::IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const {
293 return item.first == nullptr;

Completed in 210 milliseconds