Searched refs:Insert (Results 1 - 14 of 14) sorted by relevance

/art/runtime/base/
H A Dhash_set_test.cc71 hash_set.Insert(test_string);
87 // Insert a bunch of elements and make sure we can find them.
89 hash_set.Insert(strings[i]);
120 // Insert a bunch of elements and make sure we can find them.
122 hash_set.Insert(strings[i]);
150 hash_seta.Insert(strings[i]);
153 hash_seta.Insert("TEST");
154 hash_setb.Insert("TEST2");
157 hash_seta.Insert(strings[i]);
165 // Insert som
[all...]
H A Dhash_set.h386 // Insert an element, allows duplicates.
387 void Insert(const T& element) { function in class:art::HashSet
/art/runtime/
H A Dclass_table.cc105 void ClassTable::Insert(mirror::Class* klass) { function in class:art::ClassTable
107 classes_.back().Insert(GcRoot<mirror::Class>(klass));
111 classes_.back().Insert(GcRoot<mirror::Class>(klass));
172 combined.Insert(root);
H A Dintern_table.cc75 strong_interns_.Insert(new_ref);
133 strong_interns_.Insert(s);
142 weak_interns_.Insert(s);
158 // Insert/remove methods used to undo changes made during an aborted transaction.
256 mirror::String* InternTable::Insert(mirror::String* s, bool is_strong, bool holding_locks) { function in class:art::InternTable
313 // No match in the strong table or the weak table. Insert into the strong / weak table.
330 return Insert(s, true, true);
334 return Insert(s, true, false);
338 return Insert(s, false, false);
407 // Insert a
468 void InternTable::Table::Insert(mirror::String* s) { function in class:art::InternTable::Table
[all...]
H A Dtype_lookup_table.cc105 Insert(entry, hash);
125 void TypeLookupTable::Insert(const Entry& entry, uint32_t hash) { function in class:art::TypeLookupTable
H A Dtype_lookup_table.h151 // Insert an entry, probes until there is an empty slot.
152 void Insert(const Entry& entry, uint32_t hash);
H A Dclass_table.h123 void Insert(mirror::Class* klass)
H A Dintern_table.h188 void Insert(mirror::String* s) SHARED_REQUIRES(Locks::mutator_lock_)
221 // Insert if non null, otherwise return null. Must be called holding the mutator lock.
224 mirror::String* Insert(mirror::String* s, bool is_strong, bool holding_locks)
H A Ddex_file_verifier.cc1468 offset_to_type_map_.Insert(std::pair<uint32_t, uint16_t>(aligned_offset, type));
H A Dclass_linker.cc1373 table->Insert(klass);
1376 table->Insert(klass);
3707 class_table->Insert(klass);
4185 // Insert the class before loading the fields as the field roots
/art/compiler/optimizing/
H A Dinduction_var_range.cc109 static HInstruction* Insert(HBasicBlock* block, HInstruction* instruction) { function in namespace:art
699 *result = Insert(block, operation);
708 *result = Insert(block, new (graph->GetArena()) HSub(type, opa, opb));
716 *result = Insert(block, new (graph->GetArena()) HNeg(type, opb));
742 *result = Insert(block,
770 *result = Insert(block, oper);
H A Dstack_map_stream.cc82 location_catalog_entries_indices_.Insert(std::make_pair(location, index));
/art/runtime/lambda/
H A Dbox_table.cc151 map_.Insert({closure_table_copy, ValueType(closure_as_array_object)});
/art/compiler/utils/
H A Ddedupe_set-inl.h78 keys_.Insert(HashedKey<StoreKey> { hash, store_key });

Completed in 3263 milliseconds