Searched refs:SuccessorsCount (Results 1 – 2 of 2) sorted by relevance
367 DenseMap<BasicBlock*, int> SuccessorsCount; in processSwitch() local369 SuccessorsCount[Succ]++; in processSwitch()394 if (--SuccessorsCount[Succ] == 0) in processSwitch()
3403 int SuccessorsCount = isGuard(&TI) ? 2 : Visited.size(); in findBestNonTrivialUnswitchCandidate() local3404 assert(SuccessorsCount > 1 && in findBestNonTrivialUnswitchCandidate()3406 return (LoopCost - Cost) * (SuccessorsCount - 1); in findBestNonTrivialUnswitchCandidate()