Lines Matching refs:Table
45 // The design of the table uses the inline cache stubs used for
246 // Clear the lookup table (@ mark compact collection).
255 // Generate code for probing the stub cache table.
267 enum Table {
273 SCTableReference key_reference(StubCache::Table table) {
275 reinterpret_cast<Address>(&first_entry(table)->key));
279 SCTableReference map_reference(StubCache::Table table) {
281 reinterpret_cast<Address>(&first_entry(table)->map));
285 SCTableReference value_reference(StubCache::Table table) {
287 reinterpret_cast<Address>(&first_entry(table)->value));
291 StubCache::Entry* first_entry(StubCache::Table table) {
292 switch (table) {
318 // Hash algorithm for the primary table. This algorithm is replicated in
319 // assembler for every architecture. Returns an index into the table that
344 // Hash algorithm for the secondary table. This algorithm is replicated in
345 // assembler for every architecture. Returns an index into the table that
364 static Entry* entry(Entry* table, int offset) {
365 const int multiplier = sizeof(*table) >> String::kHashShift;
367 reinterpret_cast<Address>(table) + offset * multiplier);
