Lines Matching refs:Table
57 os << "Intern table: " << StrongSize() << " strong; " << WeakSize() << " weak\n";
86 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots.
229 // Check the strong table for a match.
251 // There is no match in the strong table, check the weak table.
255 // A match was found in the weak table. Promote to the strong table.
261 // No match in the strong table or the weak table. Insert into the strong / weak table.
364 size_t InternTable::Table::AddTableFromMemory(const uint8_t* ptr) {
383 size_t InternTable::Table::WriteToMemory(uint8_t* ptr) {
391 for (UnorderedSet& table : tables_) {
392 for (GcRoot<mirror::String>& string : table) {
402 void InternTable::Table::Remove(ObjPtr<mirror::String> s) {
403 for (UnorderedSet& table : tables_) {
404 auto it = table.Find(GcRoot<mirror::String>(s));
405 if (it != table.end()) {
406 table.Erase(it);
413 ObjPtr<mirror::String> InternTable::Table::Find(ObjPtr<mirror::String> s) {
415 for (UnorderedSet& table : tables_) {
416 auto it = table.Find(GcRoot<mirror::String>(s));
417 if (it != table.end()) {
424 ObjPtr<mirror::String> InternTable::Table::Find(const Utf8String& string) {
426 for (UnorderedSet& table : tables_) {
427 auto it = table.Find(string);
428 if (it != table.end()) {
435 void InternTable::Table::AddNewTable() {
439 void InternTable::Table::Insert(ObjPtr<mirror::String> s) {
440 // Always insert the last table, the image tables are before and we avoid inserting into these
446 void InternTable::Table::VisitRoots(RootVisitor* visitor) {
449 for (UnorderedSet& table : tables_) {
450 for (auto& intern : table) {
456 void InternTable::Table::SweepWeaks(IsMarkedVisitor* visitor) {
457 for (UnorderedSet& table : tables_) {
458 SweepWeaks(&table, visitor);
462 void InternTable::Table::SweepWeaks(UnorderedSet* set, IsMarkedVisitor* visitor) {
476 size_t InternTable::Table::Size() const {
498 InternTable::Table::Table() {
500 // Initial table.
