Lines Matching defs:Table
23 // The design of the table uses the inline cache stubs used for
117 // Clear the lookup table (@ mark compact collection).
127 // Generate code for probing the stub cache table.
139 enum Table {
145 SCTableReference key_reference(StubCache::Table table) {
147 reinterpret_cast<Address>(&first_entry(table)->key));
151 SCTableReference map_reference(StubCache::Table table) {
153 reinterpret_cast<Address>(&first_entry(table)->map));
157 SCTableReference value_reference(StubCache::Table table) {
159 reinterpret_cast<Address>(&first_entry(table)->value));
163 StubCache::Entry* first_entry(StubCache::Table table) {
164 switch (table) {
196 // Hash algorithm for the primary table. This algorithm is replicated in
197 // assembler for every architecture. Returns an index into the table that
222 // Hash algorithm for the secondary table. This algorithm is replicated in
223 // assembler for every architecture. Returns an index into the table that
242 static Entry* entry(Entry* table, int offset) {
243 const int multiplier = sizeof(*table) >> Name::kHashShift;
245 reinterpret_cast<Address>(table) + offset * multiplier);
