reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
504 LLVM_DEBUG(dbgs() << "OPERAND: " << *Op << " (" << Weight << ")\n"); 505 assert(!Op->use_empty() && "No uses, so how did we get to it?!"); 509 if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) { 510 assert(Visited.insert(Op).second && "Not first visit!"); 511 LLVM_DEBUG(dbgs() << "DIRECT ADD: " << *Op << " (" << Weight << ")\n"); 517 LeafMap::iterator It = Leaves.find(Op); 520 assert(Visited.insert(Op).second && "Not first visit!"); 521 if (!Op->hasOneUse()) { 525 << "ADD USES LEAF: " << *Op << " (" << Weight << ")\n"); 526 LeafOrder.push_back(Op); 527 Leaves[Op] = Weight; 533 assert(It != Leaves.end() && Visited.count(Op) && 560 if (!Op->hasOneUse()) 572 assert((!isa<Instruction>(Op) || 573 cast<Instruction>(Op)->getOpcode() != Opcode 574 || (isa<FPMathOperator>(Op) && 575 !cast<Instruction>(Op)->isFast())) && 577 assert(Op->hasOneUse() && "Has uses outside the expression tree!"); 581 if (Instruction *Tmp = dyn_cast<Instruction>(Op)) 585 << "MORPH LEAF: " << *Op << " (" << Weight << ") TO "); 595 LLVM_DEBUG(dbgs() << "ADD LEAF: " << *Op << " (" << Weight << ")\n"); 596 assert(!isReassociableOp(Op, Opcode) && "Value was morphed?"); 597 LeafOrder.push_back(Op); 598 Leaves[Op] = Weight;