Searched refs:Find (Results 1 - 19 of 19) sorted by path

/art/compiler/
H A Dcompiled_method.h144 std::pair<bool, int32_t> Find(uint32_t from) const { function in class:art::FINAL
H A Doat_writer.cc363 std::unique_ptr<ZipEntry> entry(zip_archive->Find(entry_name.c_str(), &error_msg));
/art/compiler/optimizing/
H A Dstack_map_stream.cc73 auto it = location_catalog_entries_indices_.Find(location);
478 // Find the location we tried to encode.
/art/compiler/utils/
H A Ddedupe_set-inl.h72 auto it = keys_.Find(hashed_in_key);
/art/dex2oat/
H A Ddex2oat.cc1518 // Find the dex files we should not inline from.
2350 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(input_filename, error_msg));
/art/runtime/base/
H A Dhash_set.h362 // Find an element, returns end() if not found.
367 iterator Find(const K& key) { function in class:art::HashSet
372 const_iterator Find(const K& key) const { function in class:art::HashSet
549 // Find the hash table slot for an element, or return NumBuckets() if not found.
H A Dhash_set_test.cc72 auto it = hash_set.Find(test_string);
78 it = hash_set.Find(test_string);
90 auto it = hash_set.Find(strings[i]);
97 auto it = hash_set.Find(strings[i]);
104 auto it = hash_set.Find(strings[i]);
108 auto it = hash_set.Find(strings[i]);
182 hash_set.Erase(hash_set.Find(random_strings[i]));
194 EXPECT_NE(hash_set.end(), hash_set.Find(initial_string))
245 ASSERT_EQ(*hash_set.Find(s), *std_set.find(s));
248 auto it1 = hash_set.Find(
[all...]
/art/runtime/
H A Dclass_linker.cc1407 auto it = new_class_set->Find(GcRoot<mirror::Class>(klass));
1412 auto it2 = new_class_set->Find(GcRoot<mirror::Class>(super_class));
2372 // Find the class in the loaded classes table.
5978 // Find the default method implementation for 'interface_method' in 'klass'. Stores it into
6974 // Find out if there is already a miranda method we can use.
7164 // Find which conflict method we are to use for this method.
7174 // Find which miranda method we are to use for this method.
H A Dclass_table.cc37 auto it = class_set.Find(GcRoot<mirror::Class>(klass));
48 auto it = class_set.Find(GcRoot<mirror::Class>(klass));
122 auto it = class_set.Find(descriptor);
H A Ddex_file.cc101 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(zip_entry_name, error_msg));
156 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(DexFile::kClassesDex, &error_msg));
318 std::unique_ptr<ZipEntry> zip_entry(zip_archive.Find(entry_name, error_msg));
H A Ddex_file_verifier.cc1467 DCHECK(offset_to_type_map_.Find(aligned_offset) == offset_to_type_map_.end());
1642 auto it = offset_to_type_map_.Find(offset);
H A Dintern_table.cc108 return strong_interns_.Find(string);
112 return weak_interns_.Find(s);
116 return strong_interns_.Find(s);
404 CHECK(Find(string.Read()) == nullptr) << "Already found " << string.Read()->ToModifiedUtf8();
433 auto it = table.Find(GcRoot<mirror::String>(s));
442 mirror::String* InternTable::Table::Find(mirror::String* s) { function in class:art::InternTable::Table
445 auto it = table.Find(GcRoot<mirror::String>(s));
453 mirror::String* InternTable::Table::Find(const Utf8String& string) { function in class:art::InternTable::Table
456 auto it = table.Find(string);
H A Dintern_table.h184 mirror::String* Find(mirror::String* s) SHARED_REQUIRES(Locks::mutator_lock_)
186 mirror::String* Find(const Utf8String& string) SHARED_REQUIRES(Locks::mutator_lock_)
H A Dtype_lookup_table_test.cc42 TEST_P(TypeLookupTableTest, Find) {
H A Dzip_archive.cc122 ZipEntry* ZipArchive::Find(const char* name, std::string* error_msg) const { function in class:art::ZipArchive
H A Dzip_archive.h64 ZipEntry* Find(const char* name, std::string* error_msg) const;
H A Dzip_archive_test.cc38 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find("classes.dex", &error_msg));
/art/runtime/interpreter/
H A Dunstarted_runtime.cc375 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(entry_name, error_msg));
/art/runtime/lambda/
H A Dbox_table.cc197 auto map_iterator = map_.Find(closure);

Completed in 278 milliseconds