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.
84 // (the key is BoundsCheckKey).
88 // with the same key (the dictionary holds the head of the list).
98 BoundsCheckKey* Key() const { return key_; }
195 BoundsCheckBbData(BoundsCheckKey* key,
203 : key_(key),
307 BoundsCheckBbData** BoundsCheckTable::LookupOrInsert(BoundsCheckKey* key,
310 &(Lookup(key, key->Hash(), true, ZoneAllocationPolicy(zone))->value));
314 void BoundsCheckTable::Insert(BoundsCheckKey* key,
317 Lookup(key, key->Hash(), true, ZoneAllocationPolicy(zone))->value = data;
321 void BoundsCheckTable::Delete(BoundsCheckKey* key) {
322 Remove(key, key->Hash());
383 BoundsCheckKey* key =
385 if (key == NULL) continue;
386 BoundsCheckBbData** data_p = table_.LookupOrInsert(key, zone());
389 bb_data_list = new(zone()) BoundsCheckBbData(key,
433 bb_data_list = new(zone()) BoundsCheckBbData(key,
445 table_.Insert(key, bb_data_list, zone());
457 table_.Insert(data->Key(), data->FatherInDominatorTree(), zone());
459 table_.Delete(data->Key());
