Lines Matching refs:table
46 // Clear the lookup table (@ mark compact collection).
52 enum Table { kPrimary, kSecondary };
54 SCTableReference key_reference(StubCache::Table table) {
56 reinterpret_cast<Address>(&first_entry(table)->key));
59 SCTableReference map_reference(StubCache::Table table) {
61 reinterpret_cast<Address>(&first_entry(table)->map));
64 SCTableReference value_reference(StubCache::Table table) {
66 reinterpret_cast<Address>(&first_entry(table)->value));
69 StubCache::Entry* first_entry(StubCache::Table table) {
70 switch (table) {
116 // Hash algorithm for the primary table. This algorithm is replicated in
117 // assembler for every architecture. Returns an index into the table that
134 // Hash algorithm for the secondary table. This algorithm is replicated in
135 // assembler for every architecture. Returns an index into the table that
150 static Entry* entry(Entry* table, int offset) {
151 const int multiplier = sizeof(*table) >> Name::kHashShift;
152 return reinterpret_cast<Entry*>(reinterpret_cast<Address>(table) +
