447   valueNumbering.insert(std::make_pair(V, num));  in add()
456     valueNumbering[C] = e;  in lookupOrAddCall()
462       valueNumbering[C] = ValNum.first;  in lookupOrAddCall()
469       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
479         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
487           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
493       valueNumbering[C] = v;  in lookupOrAddCall()
529       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
534       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
541         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
547     valueNumbering[C] = v;  in lookupOrAddCall()
550     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
557   return valueNumbering.count(V) != 0;  in exists()
563   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
564   if (VI != valueNumbering.end())  in lookupOrAdd()
568     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
626       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
630       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
635   valueNumbering[V] = e;  in lookupOrAdd()
642   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
644     assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
647   return (VI != valueNumbering.end()) ? VI->second : 0;  in lookup()
663   valueNumbering.clear();  in clear()
675   uint32_t Num = valueNumbering.lookup(V);  in erase()
676   valueNumbering.erase(V);  in erase()
686          I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {  in verifyRemoved()