Lines Matching refs:Table
60 os << "Intern table: " << StrongSize() << " strong; " << WeakSize() << " weak\n";
89 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots.
220 // Check the strong table for a match.
242 // There is no match in the strong table, check the weak table.
246 // A match was found in the weak table. Promote to the strong table.
252 // No match in the strong table or the weak table. Insert into the strong / weak table.
346 size_t InternTable::Table::WriteToMemory(uint8_t* ptr) {
354 for (InternalTable& table : tables_) {
355 for (GcRoot<mirror::String>& string : table.set_) {
365 void InternTable::Table::Remove(ObjPtr<mirror::String> s) {
366 for (InternalTable& table : tables_) {
367 auto it = table.set_.find(GcRoot<mirror::String>(s));
368 if (it != table.set_.end()) {
369 table.set_.erase(it);
376 ObjPtr<mirror::String> InternTable::Table::Find(ObjPtr<mirror::String> s) {
378 for (InternalTable& table : tables_) {
379 auto it = table.set_.find(GcRoot<mirror::String>(s));
380 if (it != table.set_.end()) {
387 ObjPtr<mirror::String> InternTable::Table::Find(const Utf8String& string) {
389 for (InternalTable& table : tables_) {
390 auto it = table.set_.find(string);
391 if (it != table.set_.end()) {
398 void InternTable::Table::AddNewTable() {
402 void InternTable::Table::Insert(ObjPtr<mirror::String> s) {
403 // Always insert the last table, the image tables are before and we avoid inserting into these
409 void InternTable::Table::VisitRoots(RootVisitor* visitor) {
412 for (InternalTable& table : tables_) {
413 for (auto& intern : table.set_) {
419 void InternTable::Table::SweepWeaks(IsMarkedVisitor* visitor) {
420 for (InternalTable& table : tables_) {
421 SweepWeaks(&table.set_, visitor);
425 void InternTable::Table::SweepWeaks(UnorderedSet* set, IsMarkedVisitor* visitor) {
439 size_t InternTable::Table::Size() const {
443 [](size_t sum, const InternalTable& table) {
444 return sum + table.Size();
461 InternTable::Table::Table() {
