| /art/runtime/base/ |
| D | hash_set_test.cc | 72 auto it = hash_set.Find(test_string); in TEST_F()
78 it = hash_set.Find(test_string); in TEST_F()
90 auto it = hash_set.Find(strings[i]); in TEST_F()
97 auto it = hash_set.Find(strings[i]); in TEST_F()
104 auto it = hash_set.Find(strings[i]); in TEST_F()
108 auto it = hash_set.Find(strings[i]); in TEST_F()
182 hash_set.Erase(hash_set.Find(random_strings[i])); in TEST_F()
194 EXPECT_NE(hash_set.end(), hash_set.Find(initial_string)) in TEST_F()
245 ASSERT_EQ(*hash_set.Find(s), *std_set.find(s)); in TEST_F()
248 auto it1 = hash_set.Find(s); in TEST_F()
[all …]
|
| D | hash_set.h | 367 iterator Find(const K& key) { in Find() function
372 const_iterator Find(const K& key) const { in Find() function
|
| /art/runtime/ |
| D | intern_table.cc | 107 return strong_interns_.Find(string); in LookupStrong()
111 return weak_interns_.Find(s); in LookupWeakLocked()
115 return strong_interns_.Find(s); in LookupStrongLocked()
375 CHECK(Find(string.Read()) == nullptr) << "Already found " << string.Read()->ToModifiedUtf8(); in AddTableFromMemory()
404 auto it = table.Find(GcRoot<mirror::String>(s)); in Remove()
413 ObjPtr<mirror::String> InternTable::Table::Find(ObjPtr<mirror::String> s) { in Find() function in art::InternTable::Table
416 auto it = table.Find(GcRoot<mirror::String>(s)); in Find()
424 ObjPtr<mirror::String> InternTable::Table::Find(const Utf8String& string) { in Find() function in art::InternTable::Table
427 auto it = table.Find(string); in Find()
|
| D | class_table.cc | 39 auto it = class_set.Find(slot); in Contains()
51 auto it = class_set.Find(slot); in LookupByDescriptor()
147 auto it = class_set.Find(slot); in TryInsert()
189 auto it = class_set.Find(pair); in Remove()
|
| D | type_lookup_table_test.cc | 42 TEST_P(TypeLookupTableTest, Find) { in TEST_P() argument
|
| D | zip_archive.h | 80 ZipEntry* Find(const char* name, std::string* error_msg) const;
|
| D | zip_archive_test.cc | 38 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find("classes.dex", &error_msg)); in TEST_F()
|
| D | intern_table.h | 189 ObjPtr<mirror::String> Find(ObjPtr<mirror::String> s) REQUIRES_SHARED(Locks::mutator_lock_)
191 ObjPtr<mirror::String> Find(const Utf8String& string) REQUIRES_SHARED(Locks::mutator_lock_)
|
| D | zip_archive.cc | 233 ZipEntry* ZipArchive::Find(const char* name, std::string* error_msg) const { in Find() function in art::ZipArchive
|
| D | dex_file.cc | 105 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(zip_entry_name.c_str(), error_msg)); in GetMultiDexChecksums()
115 zip_entry.reset(zip_archive->Find(zip_entry_name.c_str(), error_msg)); in GetMultiDexChecksums()
340 std::unique_ptr<ZipEntry> zip_entry(zip_archive.Find(entry_name, error_msg)); in OpenOneDexFileFromZip()
|
| D | dex_file_verifier.cc | 1756 DCHECK(offset_to_type_map_.Find(aligned_offset) == offset_to_type_map_.end()); in CheckIntraSectionIterate()
1942 auto it = offset_to_type_map_.Find(offset); in CheckOffsetToTypeMap()
|
| D | class_linker.cc | 1394 auto it = new_class_set->Find(ClassTable::TableSlot(klass)); in UpdateAppImageClassLoadersAndDexCaches()
1399 auto it2 = new_class_set->Find(ClassTable::TableSlot(super_class)); in UpdateAppImageClassLoadersAndDexCaches()
|
| /art/runtime/openjdkjvmti/ |
| D | jvmti_weak_table.h | 119 art::mirror::Object* Find(T tag)
|
| D | jvmti_weak_table-inl.h | 388 art::mirror::Object* JvmtiWeakTable<T>::Find(T tag) {
|
| D | ti_heap.cc | 1472 art::ObjPtr<art::mirror::Object> obj = tag_table->Find(tag); in GetObjectHeapId()
|
| /art/compiler/optimizing/ |
| D | register_allocator_graph_color.cc | 1283 auto it = interval_node_map_.Find(next_sibling); in FindCoalesceOpportunities()
1298 auto it = interval_node_map_.Find(parent); in FindCoalesceOpportunities()
1321 auto it = interval_node_map_.Find(existing); in FindCoalesceOpportunities()
1344 auto it = interval_node_map_.Find(input_interval); in FindCoalesceOpportunities()
1360 auto it = interval_node_map_.Find(input_interval); in FindCoalesceOpportunities()
1387 auto it = interval_node_map_.Find(input_interval); in FindCoalesceOpportunities()
|
| D | scheduler.h | 264 auto it = nodes_map_.Find(instr); in GetNode()
|
| D | stack_map_stream.cc | 76 auto it = location_catalog_entries_indices_.Find(location); in AddDexRegisterEntry()
|
| /art/compiler/utils/ |
| D | dedupe_set-inl.h | 73 auto it = keys_.Find(hashed_in_key);
|
| /art/runtime/interpreter/mterp/ |
| D | README.txt | 3 NOTE: Find rebuilding instructions at the bottom of this file.
|
| /art/runtime/interpreter/ |
| D | unstarted_runtime.cc | 489 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(entry_name, error_msg)); in FindAndExtractEntry()
|
| /art/dex2oat/ |
| D | dex2oat.cc | 2609 std::unique_ptr<ZipEntry> zip_entry(zip_archive->Find(input_filename, error_msg)); in ReadCommentedInputFromZip()
|
| /art/compiler/ |
| D | oat_writer.cc | 391 std::unique_ptr<ZipEntry> entry(zip_archive->Find(entry_name.c_str(), &error_msg)); in AddZippedDexFilesSource()
|