vasilito
cb424d7448
verify-patch-sanity.py validates every active recipe .patch has internally- consistent hunk line counts — catching the 'malformed patch at line N' failure at commit/CI/preflight time instead of hours into a cook. This cycle hit that class three times (qtwaylandscanner, sddm, xwayland), each only discovered when cookbook tried to apply the patch. Running it across the repo found 29 latent malformed patches (validated against GNU patch: e.g. relibc/P3-sysv-ipc reproduces 'malformed patch at line 22'). They were harmless only because they sit in vendored recipes (baked, not re- applied) — but would fail on any version-bump re-derivation. --fix recounts the hunk headers (body untouched) and repaired all 29. Wired into build-preflight.sh (Phase 1.0D) and redbear-ci.yml, with a unit test (test-patch-sanity.sh). Skips archived/legacy trees and unvalidatable formats (empty placeholders, bare-@@ git hunks).
71 lines
2.8 KiB
C++
71 lines
2.8 KiB
C++
//===- LazyBlockFrequencyInfo.cpp - Lazy Block Frequency Analysis ---------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This is an alternative analysis pass to BlockFrequencyInfoWrapperPass. The
|
|
// difference is that with this pass the block frequencies are not computed when
|
|
// the analysis pass is executed but rather when the BFI result is explicitly
|
|
// requested by the analysis client.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/LazyBlockFrequencyInfo.h"
|
|
#include "llvm/Analysis/LazyBranchProbabilityInfo.h"
|
|
#include "llvm/Analysis/LoopInfo.h"
|
|
#include "llvm/IR/Dominators.h"
|
|
#include "llvm/InitializePasses.h"
|
|
|
|
using namespace llvm;
|
|
|
|
#define DEBUG_TYPE "lazy-block-freq"
|
|
|
|
INITIALIZE_PASS_BEGIN(LazyBlockFrequencyInfoPass, DEBUG_TYPE,
|
|
"Lazy Block Frequency Analysis", true, true)
|
|
INITIALIZE_PASS_DEPENDENCY(LazyBPIPass)
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
|
|
INITIALIZE_PASS_END(LazyBlockFrequencyInfoPass, DEBUG_TYPE,
|
|
"Lazy Block Frequency Analysis", true, true)
|
|
|
|
char LazyBlockFrequencyInfoPass::ID = 0;
|
|
|
|
LazyBlockFrequencyInfoPass::LazyBlockFrequencyInfoPass() : FunctionPass(ID) {}
|
|
|
|
void LazyBlockFrequencyInfoPass::print(raw_ostream &OS, const Module *) const {
|
|
LBFI.getCalculated().print(OS);
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AU);
|
|
// We require DT so it's available when LI is available. The LI updating code
|
|
// asserts that DT is also present so if we don't make sure that we have DT
|
|
// here, that assert will trigger.
|
|
AU.addRequiredTransitive<DominatorTreeWrapperPass>();
|
|
AU.addRequiredTransitive<LoopInfoWrapperPass>();
|
|
AU.setPreservesAll();
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::releaseMemory() { LBFI.releaseMemory(); }
|
|
|
|
bool LazyBlockFrequencyInfoPass::runOnFunction(Function &F) {
|
|
auto &BPIPass = getAnalysis<LazyBranchProbabilityInfoPass>();
|
|
LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
|
LBFI.setAnalysis(&F, &BPIPass, &LI);
|
|
return false;
|
|
}
|
|
|
|
void LazyBlockFrequencyInfoPass::getLazyBFIAnalysisUsage(AnalysisUsage &AU) {
|
|
LazyBranchProbabilityInfoPass::getLazyBPIAnalysisUsage(AU);
|
|
AU.addRequiredTransitive<LazyBlockFrequencyInfoPass>();
|
|
AU.addRequiredTransitive<LoopInfoWrapperPass>();
|
|
}
|
|
|
|
void llvm::initializeLazyBFIPassPass(PassRegistry &Registry) {
|
|
initializeLazyBPIPassPass(Registry);
|
|
INITIALIZE_PASS_DEPENDENCY(LazyBlockFrequencyInfoPass);
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass);
|
|
}
|