Lines Matching defs:F

61 static bool removeDeadBlocks_v1(Function &F) {
65   for (BasicBlock &BB : make_early_inc_range(F)) {
69     if (&F.getEntryBlock() == &BB || !pred_empty(&BB))
100 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) {
106   for (BasicBlock &BB : make_early_inc_range(F)) {
110     if (&F.getEntryBlock() == &BB || !pred_empty(&BB))
137 static bool eliminateCondBranches_v1(Function &F) {
141   for (BasicBlock &BB : F) {
171 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) {
177   for (BasicBlock &BB : F) {
217 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT) {
223   for (BasicBlock &BB : F) {
265 static bool mergeIntoSinglePredecessor_v1(Function &F) {
269   for (BasicBlock &BB : make_early_inc_range(F)) {
305 static bool mergeIntoSinglePredecessor_v2(Function &F, DominatorTree &DT) {
311   for (BasicBlock &BB : make_early_inc_range(F)) {
355 static bool doSimplify_v1(Function &F) {
356   return (int)eliminateCondBranches_v1(F) | mergeIntoSinglePredecessor_v1(F) |
357          removeDeadBlocks_v1(F);
360 static bool doSimplify_v2(Function &F, DominatorTree &DT) {
361   return (int)eliminateCondBranches_v2(F, DT) |
362          mergeIntoSinglePredecessor_v2(F, DT) | removeDeadBlocks_v2(F, DT);
365 static bool doSimplify_v3(Function &F, DominatorTree &DT) {
366   return (int)eliminateCondBranches_v3(F, DT) |
367          mergeIntoSinglePredecessor_v2(F, DT) | removeDeadBlocks_v2(F, DT);
372   PreservedAnalyses run(Function &F, FunctionAnalysisManager &FAM) {
375       doSimplify_v1(F);
378       DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F);
379       doSimplify_v2(F, DT);
383       DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F);
384       doSimplify_v3(F, DT);