Lines Matching defs:Key
17 // To do so we keep a dictionary of all checks where the key if the pair
19 // The class BoundsCheckKey represents this key.
85 // (the key is BoundsCheckKey).
89 // with the same key (the dictionary holds the head of the list).
99 BoundsCheckKey* Key() const { return key_; }
196 BoundsCheckBbData(BoundsCheckKey* key,
204 : key_(key),
316 BoundsCheckBbData** BoundsCheckTable::LookupOrInsert(BoundsCheckKey* key,
319 &(ZoneHashMap::LookupOrInsert(key, key->Hash(),
324 void BoundsCheckTable::Insert(BoundsCheckKey* key,
327 ZoneHashMap::LookupOrInsert(key, key->Hash(), ZoneAllocationPolicy(zone))
332 void BoundsCheckTable::Delete(BoundsCheckKey* key) {
333 Remove(key, key->Hash());
394 BoundsCheckKey* key =
396 if (key == NULL) continue;
397 BoundsCheckBbData** data_p = table_.LookupOrInsert(key, zone());
400 bb_data_list = new(zone()) BoundsCheckBbData(key,
444 bb_data_list = new(zone()) BoundsCheckBbData(key,
456 table_.Insert(key, bb_data_list, zone());
468 table_.Insert(data->Key(), data->FatherInDominatorTree(), zone());
470 table_.Delete(data->Key());
