390   valueNumbering.insert(std::make_pair(V, num));  in add()
399     valueNumbering[C] = e;  in lookupOrAddCall()
405       valueNumbering[C] = ValNum.first;  in lookupOrAddCall()
412       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
420         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
428           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
434       valueNumbering[C] = v;  in lookupOrAddCall()
470       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
475       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
482         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
488     valueNumbering[C] = v;  in lookupOrAddCall()
491     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
497 bool GVN::ValueTable::exists(Value *V) const { return valueNumbering.count(V) != 0; }  in exists()
502   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
503   if (VI != valueNumbering.end())  in lookupOrAdd()
507     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
560       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
564       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
569   valueNumbering[V] = e;  in lookupOrAdd()
576   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
578     assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
581   return (VI != valueNumbering.end()) ? VI->second : 0;  in lookup()
597   valueNumbering.clear();  in clear()
609   uint32_t Num = valueNumbering.lookup(V);  in erase()
610   valueNumbering.erase(V);  in erase()
620          I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {  in verifyRemoved()