Lines Matching refs:table
46 // Clear the lookup table (@ mark compact collection).
51 // Generate code for probing the stub cache table.
59 enum Table { kPrimary, kSecondary };
61 SCTableReference key_reference(StubCache::Table table) {
63 reinterpret_cast<Address>(&first_entry(table)->key));
66 SCTableReference map_reference(StubCache::Table table) {
68 reinterpret_cast<Address>(&first_entry(table)->map));
71 SCTableReference value_reference(StubCache::Table table) {
73 reinterpret_cast<Address>(&first_entry(table)->value));
76 StubCache::Entry* first_entry(StubCache::Table table) {
77 switch (table) {
123 // Hash algorithm for the primary table. This algorithm is replicated in
124 // assembler for every architecture. Returns an index into the table that
141 // Hash algorithm for the secondary table. This algorithm is replicated in
142 // assembler for every architecture. Returns an index into the table that
157 static Entry* entry(Entry* table, int offset) {
158 const int multiplier = sizeof(*table) >> Name::kHashShift;
159 return reinterpret_cast<Entry*>(reinterpret_cast<Address>(table) +
