Lines Matching defs:Table
45 // Clear the lookup table (@ mark compact collection).
51 // Generate code for probing the stub cache table.
60 enum Table { kPrimary, kSecondary };
62 SCTableReference key_reference(StubCache::Table table) {
64 reinterpret_cast<Address>(&first_entry(table)->key));
67 SCTableReference map_reference(StubCache::Table table) {
69 reinterpret_cast<Address>(&first_entry(table)->map));
72 SCTableReference value_reference(StubCache::Table table) {
74 reinterpret_cast<Address>(&first_entry(table)->value));
77 StubCache::Entry* first_entry(StubCache::Table table) {
78 switch (table) {
105 // Hash algorithm for the primary table. This algorithm is replicated in
106 // assembler for every architecture. Returns an index into the table that
127 // Hash algorithm for the secondary table. This algorithm is replicated in
128 // assembler for every architecture. Returns an index into the table that
147 static Entry* entry(Entry* table, int offset) {
148 const int multiplier = sizeof(*table) >> Name::kHashShift;
149 return reinterpret_cast<Entry*>(reinterpret_cast<Address>(table) +
