Lines Matching refs:Table
46 // The design of the table uses the inline cache stubs used for
193 // Clear the lookup table (@ mark compact collection).
203 // Generate code for probing the stub cache table.
215 enum Table {
221 SCTableReference key_reference(StubCache::Table table) {
223 reinterpret_cast<Address>(&first_entry(table)->key));
227 SCTableReference map_reference(StubCache::Table table) {
229 reinterpret_cast<Address>(&first_entry(table)->map));
233 SCTableReference value_reference(StubCache::Table table) {
235 reinterpret_cast<Address>(&first_entry(table)->value));
239 StubCache::Entry* first_entry(StubCache::Table table) {
240 switch (table) {
276 // Hash algorithm for the primary table. This algorithm is replicated in
277 // assembler for every architecture. Returns an index into the table that
302 // Hash algorithm for the secondary table. This algorithm is replicated in
303 // assembler for every architecture. Returns an index into the table that
322 static Entry* entry(Entry* table, int offset) {
323 const int multiplier = sizeof(*table) >> Name::kHashShift;
325 reinterpret_cast<Address>(table) + offset * multiplier);
