388   valueNumbering.insert(std::make_pair(V, num));  in add()
397     valueNumbering[C] = e;  in lookupOrAddCall()
403       valueNumbering[C] = ValNum.first;  in lookupOrAddCall()
410       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
421         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
429           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
435       valueNumbering[C] = v;  in lookupOrAddCall()
471       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
476       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
483         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
489     valueNumbering[C] = v;  in lookupOrAddCall()
492     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
498 bool GVN::ValueTable::exists(Value *V) const { return valueNumbering.count(V) != 0; }  in exists()
503   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
504   if (VI != valueNumbering.end())  in lookupOrAdd()
508     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
564       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
568       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
573   valueNumbering[V] = e;  in lookupOrAdd()
580   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
582     assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
585   return (VI != valueNumbering.end()) ? VI->second : 0;  in lookup()
601   valueNumbering.clear();  in clear()
613   uint32_t Num = valueNumbering.lookup(V);  in erase()
614   valueNumbering.erase(V);  in erase()
624          I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {  in verifyRemoved()