393   valueNumbering.insert(std::make_pair(V, num));  in add()
402     valueNumbering[C] = e;  in lookupOrAddCall()
408       valueNumbering[C] = ValNum.first;  in lookupOrAddCall()
415       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
426         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
434           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
440       valueNumbering[C] = v;  in lookupOrAddCall()
476       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
481       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
488         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
494     valueNumbering[C] = v;  in lookupOrAddCall()
497     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
503 bool GVN::ValueTable::exists(Value *V) const { return valueNumbering.count(V) != 0; }  in exists()
508   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
509   if (VI != valueNumbering.end())  in lookupOrAdd()
513     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
569       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
573       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
578   valueNumbering[V] = e;  in lookupOrAdd()
585   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
587     assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
590   return (VI != valueNumbering.end()) ? VI->second : 0;  in lookup()
606   valueNumbering.clear();  in clear()
618   uint32_t Num = valueNumbering.lookup(V);  in erase()
619   valueNumbering.erase(V);  in erase()
629          I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {  in verifyRemoved()