464   valueNumbering.insert(std::make_pair(V, num));  in add()
478     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
486     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
493     valueNumbering[C] = e;  in lookupOrAddCall()
501       valueNumbering[C] = ValNum.first;  in lookupOrAddCall()
508       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
518         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
526           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
532       valueNumbering[C] = v;  in lookupOrAddCall()
567       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
572       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
579         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
585     valueNumbering[C] = v;  in lookupOrAddCall()
589   valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
595   return valueNumbering.contains(V);  in exists()
601   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
602   if (VI != valueNumbering.end())  in lookupOrAdd()
607     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
664       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
668       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
673   valueNumbering[V] = e;  in lookupOrAdd()
680   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
682     assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
685   return (VI != valueNumbering.end()) ? VI->second : 0;  in lookup()
701   valueNumbering.clear();  in clear()
713   uint32_t Num = valueNumbering.lookup(V);  in erase()
714   valueNumbering.erase(V);  in erase()
723   assert(!valueNumbering.contains(V) &&  in verifyRemoved()