Lines Matching refs:Table
59 os << "Intern table: " << StrongSize() << " strong; " << WeakSize() << " weak\n";
88 // Note: we deliberately don't visit the weak_interns_ table and the immutable image roots.
231 // Check the strong table for a match.
253 // There is no match in the strong table, check the weak table.
257 // A match was found in the weak table. Promote to the strong table.
263 // No match in the strong table or the weak table. Insert into the strong / weak table.
366 size_t InternTable::Table::AddTableFromMemory(const uint8_t* ptr) {
385 size_t InternTable::Table::WriteToMemory(uint8_t* ptr) {
393 for (UnorderedSet& table : tables_) {
394 for (GcRoot<mirror::String>& string : table) {
404 void InternTable::Table::Remove(ObjPtr<mirror::String> s) {
405 for (UnorderedSet& table : tables_) {
406 auto it = table.Find(GcRoot<mirror::String>(s));
407 if (it != table.end()) {
408 table.Erase(it);
415 ObjPtr<mirror::String> InternTable::Table::Find(ObjPtr<mirror::String> s) {
417 for (UnorderedSet& table : tables_) {
418 auto it = table.Find(GcRoot<mirror::String>(s));
419 if (it != table.end()) {
426 ObjPtr<mirror::String> InternTable::Table::Find(const Utf8String& string) {
428 for (UnorderedSet& table : tables_) {
429 auto it = table.Find(string);
430 if (it != table.end()) {
437 void InternTable::Table::AddNewTable() {
441 void InternTable::Table::Insert(ObjPtr<mirror::String> s) {
442 // Always insert the last table, the image tables are before and we avoid inserting into these
448 void InternTable::Table::VisitRoots(RootVisitor* visitor) {
451 for (UnorderedSet& table : tables_) {
452 for (auto& intern : table) {
458 void InternTable::Table::SweepWeaks(IsMarkedVisitor* visitor) {
459 for (UnorderedSet& table : tables_) {
460 SweepWeaks(&table, visitor);
464 void InternTable::Table::SweepWeaks(UnorderedSet* set, IsMarkedVisitor* visitor) {
478 size_t InternTable::Table::Size() const {
500 InternTable::Table::Table() {
502 // Initial table.
