Searched refs:NewNum (Results 1 - 3 of 3) sorted by relevance
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | GVN.cpp | 1644 uint32_t NewNum = phiTranslateImpl(Pred, PhiBlock, Num, Gvn); 1645 PhiTranslateTable.insert({{Num, Pred}, NewNum}); 1646 return NewNum; 1649 // Return true if the value number \p Num and NewNum have equal value. 1651 bool GVN::ValueTable::areCallValsEqual(uint32_t Num, uint32_t NewNum, argument 1730 if (uint32_t NewNum = expressionNumbering[Exp]) { 1731 if (Exp.opcode == Instruction::Call && NewNum != Num) 1732 return areCallValsEqual(Num, NewNum, Pred, PhiBlock, Gvn) ? NewNum : Num; 1733 return NewNum; [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVN.h | 123 bool areCallValsEqual(uint32_t Num, uint32_t NewNum, const BasicBlock *Pred,
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 457 const unsigned NewNum = SNCA.runDFS<true>(I, Num, AlwaysDescend, Num); local 458 const NodePtr FurthestAway = SNCA.NumToNode[NewNum]; 465 << NewNum << "\n\t\t\tRemoving DFS info\n"); local 466 for (unsigned i = NewNum; i > Num; --i) {
|
Completed in 121 milliseconds