Lines Matching defs:Successors
523 if (int successors = TI->getNumSuccessors()) {
524 for (int i = 0; i != successors; ++i) {
610 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
611 if (Successors) {
612 if (Successors == 1) {
634 for (int i = 0; i != Successors; ++i)
638 Edge += Successors;
708 // All edges with successors that aren't branches are "complex", because it
732 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
733 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI)) {
734 for (int i = 0; i != Successors; ++i) {
743 Edge += Successors;
