reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
370 valueNumbering.insert(std::make_pair(V, num)); 379 valueNumbering[C] = e; 385 valueNumbering[C] = ValNum.first; 392 valueNumbering[C] = nextValueNumber; 400 valueNumbering[C] = nextValueNumber; 408 valueNumbering[C] = nextValueNumber; 414 valueNumbering[C] = v; 450 valueNumbering[C] = nextValueNumber; 455 valueNumbering[C] = nextValueNumber; 462 valueNumbering[C] = nextValueNumber; 468 valueNumbering[C] = v; 471 valueNumbering[C] = nextValueNumber; 477 bool GVN::ValueTable::exists(Value *V) const { return valueNumbering.count(V) != 0; } 482 DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V); 483 if (VI != valueNumbering.end()) 487 valueNumbering[V] = nextValueNumber; 542 valueNumbering[V] = nextValueNumber; 546 valueNumbering[V] = nextValueNumber; 551 valueNumbering[V] = e; 558 DenseMap<Value*, uint32_t>::const_iterator VI = valueNumbering.find(V); 560 assert(VI != valueNumbering.end() && "Value not numbered?"); 563 return (VI != valueNumbering.end()) ? VI->second : 0; 579 valueNumbering.clear(); 591 uint32_t Num = valueNumbering.lookup(V); 592 valueNumbering.erase(V); 602 I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) { 602 I = valueNumbering.begin(), E = valueNumbering.end(); I != E; ++I) {