Searched refs:SuccessorsCount (Results 1 – 2 of 2) sorted by relevance
386 DenseMap<BasicBlock*, int> SuccessorsCount; in processSwitch() local388 SuccessorsCount[Succ]++; in processSwitch()413 if (--SuccessorsCount[Succ] == 0) in processSwitch()
2995 int SuccessorsCount = isGuard(&TI) ? 2 : Visited.size(); in findBestNonTrivialUnswitchCandidate() local2996 assert(SuccessorsCount > 1 && in findBestNonTrivialUnswitchCandidate()2998 return (LoopCost - Cost) * (SuccessorsCount - 1); in findBestNonTrivialUnswitchCandidate()