diff --git a/llvm/include/llvm/Transforms/Scalar/JumpThreading.h b/llvm/include/llvm/Transforms/Scalar/JumpThreading.h --- a/llvm/include/llvm/Transforms/Scalar/JumpThreading.h +++ b/llvm/include/llvm/Transforms/Scalar/JumpThreading.h @@ -75,15 +75,17 @@ /// In this case, the unconditional branch at the end of the first if can be /// revectored to the false side of the second if. class JumpThreadingPass : public PassInfoMixin { - TargetLibraryInfo *TLI; - TargetTransformInfo *TTI; - LazyValueInfo *LVI; - AAResults *AA; - DomTreeUpdater *DTU; - std::unique_ptr BFI; - std::unique_ptr BPI; - bool HasProfileData = false; + Function *F = nullptr; + FunctionAnalysisManager *FAM = nullptr; + TargetLibraryInfo *TLI = nullptr; + TargetTransformInfo *TTI = nullptr; + LazyValueInfo *LVI = nullptr; + AAResults *AA = nullptr; + DomTreeUpdater *DTU = nullptr; + Optional BFI = None; + Optional BPI = None; bool HasGuards = false; + bool HasProfile = false; #ifndef LLVM_ENABLE_ABI_BREAKING_CHECKS SmallPtrSet LoopHeaders; #else @@ -97,18 +99,14 @@ JumpThreadingPass(int T = -1); // Glue for old PM. - bool runImpl(Function &F, TargetLibraryInfo *TLI, TargetTransformInfo *TTI, + bool runImpl(Function &F, FunctionAnalysisManager *FAM, + TargetLibraryInfo *TLI, TargetTransformInfo *TTI, LazyValueInfo *LVI, AAResults *AA, DomTreeUpdater *DTU, - bool HasProfileData, std::unique_ptr BFI, - std::unique_ptr BPI); + Optional BFI, + Optional BPI); PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM); - void releaseMemory() { - BFI.reset(); - BPI.reset(); - } - void findLoopHeaders(Function &F); bool processBlock(BasicBlock *BB); bool maybeMergeBasicBlockIntoOnlyPred(BasicBlock *BB); @@ -171,6 +169,26 @@ BasicBlock *NewBB, BasicBlock *SuccBB); /// Check if the block has profile metadata for its outgoing edges. bool doesBlockHaveProfileData(BasicBlock *BB); + + /// Returns an existing instance of BPI if any, otherwise nullptr. By + /// "existing" we mean either cached result provided by FunctionAnalysisManger + /// or created by preceding call to 'getOrCreateBPI'. + BranchProbabilityInfo *getBPI(); + + /// Returns an existing instance of BFI if any, otherwise nullptr. By + /// "existing" we mean either cached result provided by FunctionAnalysisManger + /// or created by preceding call to 'getOrCreateBFI'. + BlockFrequencyInfo *getBFI(); + + /// Returns an existing instance of BPI if any, otherwise: + /// if 'HasProfile' is true creates new instance through + /// FunctionAnalysisManager, otherwise nullptr. + BranchProbabilityInfo *getOrCreateBPI(); + + /// Returns an existing instance of BFI if any, otherwise: + /// if 'HasProfile' is true creates new instance through + /// FunctionAnalysisManager, otherwise nullptr. + BlockFrequencyInfo *getOrCreateBFI(); }; } // end namespace llvm diff --git a/llvm/lib/Transforms/Scalar/JumpThreading.cpp b/llvm/lib/Transforms/Scalar/JumpThreading.cpp --- a/llvm/lib/Transforms/Scalar/JumpThreading.cpp +++ b/llvm/lib/Transforms/Scalar/JumpThreading.cpp @@ -155,8 +155,6 @@ AU.addRequired(); AU.addRequired(); } - - void releaseMemory() override { Impl.releaseMemory(); } }; } // end anonymous namespace @@ -328,8 +326,8 @@ BFI.reset(new BlockFrequencyInfo(F, *BPI, LI)); } - bool Changed = Impl.runImpl(F, TLI, TTI, LVI, AA, &DTU, F.hasProfileData(), - std::move(BFI), std::move(BPI)); + bool Changed = + Impl.runImpl(F, nullptr, TLI, TTI, LVI, AA, &DTU, BFI.get(), BPI.get()); if (PrintLVIAfterJumpThreading) { dbgs() << "LVI for function '" << F.getName() << "':\n"; LVI->printLVI(F, DTU.getDomTree(), dbgs()); @@ -349,16 +347,8 @@ auto &AA = AM.getResult(F); DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy); - std::unique_ptr BFI; - std::unique_ptr BPI; - if (F.hasProfileData()) { - LoopInfo LI{DT}; - BPI.reset(new BranchProbabilityInfo(F, LI, &TLI)); - BFI.reset(new BlockFrequencyInfo(F, *BPI, LI)); - } - - bool Changed = runImpl(F, &TLI, &TTI, &LVI, &AA, &DTU, F.hasProfileData(), - std::move(BFI), std::move(BPI)); + bool Changed = + runImpl(F, &AM, &TLI, &TTI, &LVI, &AA, &DTU, None, None); if (PrintLVIAfterJumpThreading) { dbgs() << "LVI for function '" << F.getName() << "':\n"; @@ -367,42 +357,53 @@ if (!Changed) return PreservedAnalyses::all(); + +#ifndef NDEBUG + DTU.flush(); +#if defined(EXPENSIVE_CHECKS) + assert(DT.verify(DominatorTree::VerificationLevel::Full) && + "DT broken after JumpThreading"); +#else + assert( + DT.verify(DominatorTree::VerificationLevel::Fast) + && "DT broken after JumpThreading"); +#endif +#endif + PreservedAnalyses PA; PA.preserve(); PA.preserve(); + + // TODO: We would like to preserve BPI/BFI. Enable once all paths update them. + // TODO: Would be nice to verify BPI/BFI consistency as well. + return PA; } -bool JumpThreadingPass::runImpl(Function &F, TargetLibraryInfo *TLI_, +bool JumpThreadingPass::runImpl(Function &F_, FunctionAnalysisManager *FAM_, TargetLibraryInfo *TLI_, TargetTransformInfo *TTI_, LazyValueInfo *LVI_, AliasAnalysis *AA_, DomTreeUpdater *DTU_, - bool HasProfileData_, - std::unique_ptr BFI_, - std::unique_ptr BPI_) { - LLVM_DEBUG(dbgs() << "Jump threading on function '" << F.getName() << "'\n"); + Optional BFI_, + Optional BPI_) { + LLVM_DEBUG(dbgs() << "Jump threading on function '" << F_.getName() << "'\n"); + F = &F_; + FAM = FAM_; TLI = TLI_; TTI = TTI_; LVI = LVI_; AA = AA_; DTU = DTU_; - BFI.reset(); - BPI.reset(); - // When profile data is available, we need to update edge weights after - // successful jump threading, which requires both BPI and BFI being available. - HasProfileData = HasProfileData_; - auto *GuardDecl = F.getParent()->getFunction( + BFI = BFI_; + BPI = BPI_; + auto *GuardDecl = F->getParent()->getFunction( Intrinsic::getName(Intrinsic::experimental_guard)); HasGuards = GuardDecl && !GuardDecl->use_empty(); - if (HasProfileData) { - BPI = std::move(BPI_); - BFI = std::move(BFI_); - } // Reduce the number of instructions duplicated when optimizing strictly for // size. if (BBDuplicateThreshold.getNumOccurrences()) BBDupThreshold = BBDuplicateThreshold; - else if (F.hasFnAttribute(Attribute::MinSize)) + else if (F->hasFnAttribute(Attribute::MinSize)) BBDupThreshold = 3; else BBDupThreshold = DefaultBBDupThreshold; @@ -413,18 +414,23 @@ assert(DTU && "DTU isn't passed into JumpThreading before using it."); assert(DTU->hasDomTree() && "JumpThreading relies on DomTree to proceed."); DominatorTree &DT = DTU->getDomTree(); - for (auto &BB : F) + for (auto &BB : *F) { if (!DT.isReachableFromEntry(&BB)) Unreachable.insert(&BB); + } if (!ThreadAcrossLoopHeaders) - findLoopHeaders(F); + findLoopHeaders(*F); + + HasProfile = llvm::any_of(*F, [&](BasicBlock &BB) { + return this->doesBlockHaveProfileData(&BB); + }); bool EverChanged = false; bool Changed; do { Changed = false; - for (auto &BB : F) { + for (auto &BB : *F) { if (Unreachable.count(&BB)) continue; while (processBlock(&BB)) // Thread all of the branches we can over BB. @@ -438,7 +444,7 @@ // Stop processing BB if it's the entry or is now deleted. The following // routines attempt to eliminate BB and locating a suitable replacement // for the entry is non-trivial. - if (&BB == &F.getEntryBlock() || DTU->isBBPendingDeletion(&BB)) + if (&BB == &F->getEntryBlock() || DTU->isBBPendingDeletion(&BB)) continue; if (pred_empty(&BB)) { @@ -1142,7 +1148,7 @@ << '\n'); ++NumFolds; ConstantFoldTerminator(BB, true, nullptr, DTU); - if (HasProfileData) + if (auto *BPI = getBPI()) BPI->eraseBlock(BB); return true; } @@ -1297,7 +1303,7 @@ FICond->eraseFromParent(); DTU->applyUpdatesPermissive({{DominatorTree::Delete, BB, RemoveSucc}}); - if (HasProfileData) + if (auto *BPI = getBPI()) BPI->eraseBlock(BB); return true; } @@ -1741,7 +1747,7 @@ ++NumFolds; Term->eraseFromParent(); DTU->applyUpdatesPermissive(Updates); - if (HasProfileData) + if (auto *BPI = getBPI()) BPI->eraseBlock(BB); // If the condition is now dead due to the removal of the old terminator, @@ -2272,6 +2278,10 @@ LLVM_DEBUG(dbgs() << " Threading through '" << PredBB->getName() << "' and '" << BB->getName() << "'\n"); + // Build BPI/BFI before any changes are made to IR. + auto *BPI = getOrCreateBPI(); + auto *BFI = getOrCreateBFI(); + BranchInst *CondBr = cast(BB->getTerminator()); BranchInst *PredBBBranch = cast(PredBB->getTerminator()); @@ -2281,7 +2291,8 @@ NewBB->moveAfter(PredBB); // Set the block frequency of NewBB. - if (HasProfileData) { + if (BFI) { + assert(BPI && "It's expected BPI to exist along with BFI"); auto NewBBFreq = BFI->getBlockFreq(PredPredBB) * BPI->getEdgeProbability(PredPredBB, PredBB); BFI->setBlockFreq(NewBB, NewBBFreq.getFrequency()); @@ -2294,7 +2305,7 @@ cloneInstructions(PredBB->begin(), PredBB->end(), NewBB, PredPredBB); // Copy the edge probabilities from PredBB to NewBB. - if (HasProfileData) + if (BPI) BPI->copyEdgeProbabilities(PredBB, NewBB); // Update the terminator of PredPredBB to jump to NewBB instead of PredBB. @@ -2378,6 +2389,10 @@ assert(!LoopHeaders.count(BB) && !LoopHeaders.count(SuccBB) && "Don't thread across loop headers"); + // Build BPI/BFI before any changes are made to IR. + auto *BPI = getOrCreateBPI(); + auto *BFI = getOrCreateBFI(); + // And finally, do it! Start by factoring the predecessors if needed. BasicBlock *PredBB; if (PredBBs.size() == 1) @@ -2401,7 +2416,8 @@ NewBB->moveAfter(PredBB); // Set the block frequency of NewBB. - if (HasProfileData) { + if (BFI) { + assert(BPI && "It's expected BPI to exist along with BFI"); auto NewBBFreq = BFI->getBlockFreq(PredBB) * BPI->getEdgeProbability(PredBB, BB); BFI->setBlockFreq(NewBB, NewBBFreq.getFrequency()); @@ -2460,7 +2476,9 @@ // Collect the frequencies of all predecessors of BB, which will be used to // update the edge weight of the result of splitting predecessors. DenseMap FreqMap; - if (HasProfileData) + auto *BFI = getBFI(); + auto *BPI = getBPI(); + if (BFI) for (auto *Pred : Preds) FreqMap.insert(std::make_pair( Pred, BFI->getBlockFreq(Pred) * BPI->getEdgeProbability(Pred, BB))); @@ -2482,10 +2500,10 @@ for (auto *Pred : predecessors(NewBB)) { Updates.push_back({DominatorTree::Delete, Pred, BB}); Updates.push_back({DominatorTree::Insert, Pred, NewBB}); - if (HasProfileData) // Update frequencies between Pred -> NewBB. + if (BFI) // Update frequencies between Pred -> NewBB. NewBBFreq += FreqMap.lookup(Pred); } - if (HasProfileData) // Apply the summed frequency to NewBB. + if (BFI) // Apply the summed frequency to NewBB. BFI->setBlockFreq(NewBB, NewBBFreq.getFrequency()); } @@ -2495,7 +2513,8 @@ bool JumpThreadingPass::doesBlockHaveProfileData(BasicBlock *BB) { const Instruction *TI = BB->getTerminator(); - assert(TI->getNumSuccessors() > 1 && "not a split"); + if (!TI || TI->getNumSuccessors() < 2) + return false; MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof); if (!WeightsNode) @@ -2517,11 +2536,19 @@ BasicBlock *BB, BasicBlock *NewBB, BasicBlock *SuccBB) { - if (!HasProfileData) + bool DoesBlockHaveProfile = doesBlockHaveProfileData(BB); + auto *BFI = getBFI(); + auto *BPI = getBPI(); + assert( + (!DoesBlockHaveProfile || (BFI && BPI)) + && "BFI & BPI should have already been created"); + assert( + ((BFI && BPI) || (!BFI && !BFI)) + && "It's not expected to have only either BPI or BFI"); + + if (!BFI) return; - assert(BFI && BPI && "BFI & BPI should have been created here"); - // As the edge from PredBB to BB is deleted, we have to update the block // frequency of BB. auto BBOrigFreq = BFI->getBlockFreq(BB); @@ -2534,26 +2561,27 @@ // edge probabilities. SmallVector BBSuccFreq; for (BasicBlock *Succ : successors(BB)) { - auto SuccFreq = (Succ == SuccBB) - ? BB2SuccBBFreq - NewBBFreq - : BBOrigFreq * BPI->getEdgeProbability(BB, Succ); + auto SuccFreq = + (Succ == SuccBB) ? + BB2SuccBBFreq - NewBBFreq : + BBOrigFreq * BPI->getEdgeProbability(BB, Succ); BBSuccFreq.push_back(SuccFreq.getFrequency()); } - uint64_t MaxBBSuccFreq = - *std::max_element(BBSuccFreq.begin(), BBSuccFreq.end()); + uint64_t MaxBBSuccFreq = *std::max_element(BBSuccFreq.begin(), + BBSuccFreq.end()); SmallVector BBSuccProbs; if (MaxBBSuccFreq == 0) BBSuccProbs.assign(BBSuccFreq.size(), - {1, static_cast(BBSuccFreq.size())}); + { 1, static_cast(BBSuccFreq.size()) }); else { for (uint64_t Freq : BBSuccFreq) BBSuccProbs.push_back( BranchProbability::getBranchProbability(Freq, MaxBBSuccFreq)); // Normalize edge probabilities so that they sum up to one. BranchProbability::normalizeProbabilities(BBSuccProbs.begin(), - BBSuccProbs.end()); + BBSuccProbs.end()); } // Update edge probabilities in BPI. @@ -2593,7 +2621,7 @@ // FIXME this locally as well so that BPI and BFI are consistent as well. We // shouldn't make edges extremely likely or unlikely based solely on static // estimation. - if (BBSuccProbs.size() >= 2 && doesBlockHaveProfileData(BB)) { + if (BBSuccProbs.size() >= 2 && DoesBlockHaveProfile) { SmallVector Weights; for (auto Prob : BBSuccProbs) Weights.push_back(Prob.getNumerator()); @@ -2725,7 +2753,7 @@ // Remove the unconditional branch at the end of the PredBB block. OldPredBranch->eraseFromParent(); - if (HasProfileData) + if (auto *BPI = getBPI()) BPI->copyEdgeProbabilities(BB, PredBB); DTU->applyUpdatesPermissive(Updates); @@ -3079,3 +3107,50 @@ } return true; } + +BranchProbabilityInfo *JumpThreadingPass::getBPI() { + if (!BPI) { + assert(FAM && "Can't create BPI without FunctionAnalysisManager"); + BPI = FAM->getCachedResult(*F); + } + return *BPI; +} + +BlockFrequencyInfo *JumpThreadingPass::getBFI() { + if (!BFI) { + assert(FAM && "Can't create BFI without FunctionAnalysisManager"); + BFI = FAM->getCachedResult(*F); + } + return *BFI; +} + +// Important note on validity of BPI/BFI. JumpThreading tries to preserve +// BPI/BFI as it goes. Thus if cached instance exists it will be updated. +// Otherwise, new instance of BPI/BFI is created wich is up to date by +// definition. +BranchProbabilityInfo *JumpThreadingPass::getOrCreateBPI() { + if (HasProfile && (!BPI || *BPI == nullptr)) { + assert(FAM && "Can't create BPI without FunctionAnalysisManager"); + // BranchProbabilityAnalysis depends on DT. Make sure DT is consistent. + if (DTU->hasPendingUpdates()) { + DTU->flush(); + assert(DTU->getDomTree().verify(DominatorTree::VerificationLevel::Fast)); + } + BPI = &FAM->getResult(*F); + } + return getBPI(); +} + +BlockFrequencyInfo *JumpThreadingPass::getOrCreateBFI() { + if (HasProfile && (!BFI || *BFI == nullptr)) { + assert(FAM && "Can't create BFI without FunctionAnalysisManager"); + // BlockFrequencyAnalysis depends on DT. Make sure DT is consistent. + if (DTU->hasPendingUpdates()) { + DTU->flush(); + assert(DTU->getDomTree().verify(DominatorTree::VerificationLevel::Fast)); + } + BFI = &FAM->getResult(*F); + } + return getBFI(); +} + diff --git a/llvm/test/Transforms/JumpThreading/thread-prob-2.ll b/llvm/test/Transforms/JumpThreading/thread-prob-2.ll --- a/llvm/test/Transforms/JumpThreading/thread-prob-2.ll +++ b/llvm/test/Transforms/JumpThreading/thread-prob-2.ll @@ -1,10 +1,13 @@ -; RUN: opt -debug-only=branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -enable-new-pm=false -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes="require,jump-threading" -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes=jump-threading -S %s 2>&1 | FileCheck %s --check-prefix=CHECK-NOBPI ; REQUIRES: asserts ; Make sure that we clear edge probabilities for bb.cond as we fold ; the conditional branch in it. ; CHECK: eraseBlock bb.cond +; CHECK-NOBPI-NOT: eraseBlock bb.cond define i32 @foo(i1 %cond) !prof !0 { ; CHECK-LABEL: @foo diff --git a/llvm/test/Transforms/JumpThreading/thread-prob-3.ll b/llvm/test/Transforms/JumpThreading/thread-prob-3.ll --- a/llvm/test/Transforms/JumpThreading/thread-prob-3.ll +++ b/llvm/test/Transforms/JumpThreading/thread-prob-3.ll @@ -1,4 +1,6 @@ -; RUN: opt -debug-only=branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -enable-new-pm=false -branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes="require,jump-threading" -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes=jump-threading -S %s 2>&1 | FileCheck %s --check-prefix=CHECK-NOBPI ; REQUIRES: asserts ; Make sure that we set edge probabilities for bb2 as we @@ -7,6 +9,7 @@ ; CHECK-LABEL: ---- Branch Probability Info : foo ; CHECK: set edge bb2 -> 0 successor probability to 0x80000000 / 0x80000000 = 100.00% ; CHECK-NEXT: set edge bb2 -> 1 successor probability to 0x00000000 / 0x80000000 = 0.00% +; CHECK-NOBPI-NOT: ---- Branch Probability Info : foo define void @foo(i1 %f0, i1 %f1, i1 %f2) !prof !{!"function_entry_count", i64 0} { ; CHECK-LABEL: @foo( bb1: diff --git a/llvm/test/Transforms/JumpThreading/thread-prob-4.ll b/llvm/test/Transforms/JumpThreading/thread-prob-4.ll --- a/llvm/test/Transforms/JumpThreading/thread-prob-4.ll +++ b/llvm/test/Transforms/JumpThreading/thread-prob-4.ll @@ -1,10 +1,13 @@ -; RUN: opt -debug-only=branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -enable-new-pm=false -branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes="require,jump-threading" -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes=jump-threading -S %s 2>&1 | FileCheck %s --check-prefix=CHECK-NOBPI ; REQUIRES: asserts ; Make sure that we clear edge probabilities for bb1 as we fold ; the conditional branch in it. ; CHECK: eraseBlock bb1 +; CHECK-NOBPI-NOT: eraseBlock bb1 define i32 @foo(i32 %arg) !prof !0 { ; CHECK-LABEL: @foo diff --git a/llvm/test/Transforms/JumpThreading/thread-prob-5.ll b/llvm/test/Transforms/JumpThreading/thread-prob-5.ll --- a/llvm/test/Transforms/JumpThreading/thread-prob-5.ll +++ b/llvm/test/Transforms/JumpThreading/thread-prob-5.ll @@ -1,10 +1,13 @@ -; RUN: opt -debug-only=branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -enable-new-pm=false -branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes="require,jump-threading" -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes=jump-threading -S %s 2>&1 | FileCheck %s --check-prefix=CHECK-NOBPI ; REQUIRES: asserts ; Make sure that we clear edge probabilities for bb1 as we fold ; the conditional branch in it. ; CHECK: eraseBlock bb1 +; CHECK-NOBPI-NOT: eraseBlock bb1 define void @foo(i32 %i, i32 %len) !prof !0 { ; CHECK-LABEL: @foo diff --git a/llvm/test/Transforms/JumpThreading/thread-prob-6.ll b/llvm/test/Transforms/JumpThreading/thread-prob-6.ll --- a/llvm/test/Transforms/JumpThreading/thread-prob-6.ll +++ b/llvm/test/Transforms/JumpThreading/thread-prob-6.ll @@ -1,10 +1,13 @@ -; RUN: opt -debug-only=branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -enable-new-pm=false -branch-prob -jump-threading -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes="require,jump-threading" -S %s 2>&1 | FileCheck %s +; RUN: opt -debug-only=branch-prob -passes=jump-threading -S %s 2>&1 | FileCheck %s --check-prefix=CHECK-NOBPI ; REQUIRES: asserts ; Make sure that we clear edge probabilities for bb1 as we fold ; the conditional branch in it. ; CHECK: eraseBlock bb1 +; CHECK-NOBPI-NOT: eraseBlock bb1 define i32 @foo() !prof !0 { ; CHECK-LABEL: @foo diff --git a/llvm/test/Transforms/JumpThreading/threading_prof1.ll b/llvm/test/Transforms/JumpThreading/threading_prof1.ll --- a/llvm/test/Transforms/JumpThreading/threading_prof1.ll +++ b/llvm/test/Transforms/JumpThreading/threading_prof1.ll @@ -96,4 +96,4 @@ !0 = !{!"branch_weights", i32 2146410443, i32 1073205} ;CHECK: ![[PROF1]] = !{!"branch_weights", i32 1073205, i32 2146410443} -;CHECK: ![[PROF2]] = !{!"branch_weights", i32 2146410443, i32 1073205} +;CHECK: ![[PROF2]] = !{!"branch_weights", i32 -2147483648, i32 0} diff --git a/llvm/test/Transforms/JumpThreading/threading_prof2.ll b/llvm/test/Transforms/JumpThreading/threading_prof2.ll --- a/llvm/test/Transforms/JumpThreading/threading_prof2.ll +++ b/llvm/test/Transforms/JumpThreading/threading_prof2.ll @@ -39,4 +39,4 @@ !0 = !{!"branch_weights", i32 2146410443, i32 1073205} ;CHECK: ![[PROF1]] = !{!"branch_weights", i32 1073205, i32 2146410443} -;CHECK: ![[PROF2]] = !{!"branch_weights", i32 2146410443, i32 1073205} +;CHECK: ![[PROF2]] = !{!"branch_weights", i32 -2147483648, i32 0} diff --git a/llvm/test/Transforms/JumpThreading/threading_prof3.ll b/llvm/test/Transforms/JumpThreading/threading_prof3.ll --- a/llvm/test/Transforms/JumpThreading/threading_prof3.ll +++ b/llvm/test/Transforms/JumpThreading/threading_prof3.ll @@ -27,4 +27,4 @@ ret void } -;CHECK: ![[PROF]] = !{!"branch_weights", i32 0, i32 0} +;CHECK: ![[PROF]] = !{!"branch_weights", i32 -2147483648, i32 0}