342     : valueNumbering(Arg.valueNumbering),  in ValueTable()
346     : valueNumbering(std::move(Arg.valueNumbering)),  in ValueTable()
354   valueNumbering.insert(std::make_pair(V, num));  in add()
362     valueNumbering[C] = e;  in lookupOrAddCall()
369       valueNumbering[C] = e;  in lookupOrAddCall()
374       valueNumbering[C] = e;  in lookupOrAddCall()
381       valueNumbering[C] =  nextValueNumber;  in lookupOrAddCall()
389         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
397           valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
403       valueNumbering[C] = v;  in lookupOrAddCall()
439       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
444       valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
451         valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
457     valueNumbering[C] = v;  in lookupOrAddCall()
461     valueNumbering[C] = nextValueNumber;  in lookupOrAddCall()
467 bool GVN::ValueTable::exists(Value *V) const { return valueNumbering.count(V) != 0; }  in exists()
472   DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V);  in lookupOrAdd()
473   if (VI != valueNumbering.end())  in lookupOrAdd()
477     valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
530       valueNumbering[V] = nextValueNumber;  in lookupOrAdd()
536   valueNumbering[V] = e;  in lookupOrAdd()
543   DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V);  in lookup()
544   assert(VI != valueNumbering.end() && "Value not numbered?");  in lookup()
563   valueNumbering.clear();  in clear()
570   valueNumbering.erase(V);  in erase()
577          I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {  in verifyRemoved()