Lines Matching refs:Table
45 // Clear the lookup table (@ mark compact collection).
48 enum Table { kPrimary, kSecondary };
50 SCTableReference key_reference(StubCache::Table table) {
52 reinterpret_cast<Address>(&first_entry(table)->key));
55 SCTableReference map_reference(StubCache::Table table) {
57 reinterpret_cast<Address>(&first_entry(table)->map));
60 SCTableReference value_reference(StubCache::Table table) {
62 reinterpret_cast<Address>(&first_entry(table)->value));
65 StubCache::Entry* first_entry(StubCache::Table table) {
66 switch (table) {
109 // Hash algorithm for the primary table. This algorithm is replicated in
110 // assembler for every architecture. Returns an index into the table that
114 // Hash algorithm for the secondary table. This algorithm is replicated in
115 // assembler for every architecture. Returns an index into the table that
124 static Entry* entry(Entry* table, int offset) {
125 const int multiplier = sizeof(*table) >> Name::kHashShift;
126 return reinterpret_cast<Entry*>(reinterpret_cast<Address>(table) +
