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).
72 lines
2.3 KiB
C++
72 lines
2.3 KiB
C++
//==-- OverflowInstAnalysis.cpp - Utils to fold overflow insts ----*- C++ -*-=//
|
|
//
|
|
// 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 file holds routines to help analyse overflow instructions
|
|
// and fold them into constants or other overflow instructions
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Analysis/OverflowInstAnalysis.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
#include "llvm/IR/PatternMatch.h"
|
|
|
|
using namespace llvm;
|
|
using namespace llvm::PatternMatch;
|
|
|
|
bool llvm::isCheckForZeroAndMulWithOverflow(Value *Op0, Value *Op1, bool IsAnd,
|
|
Use *&Y) {
|
|
CmpPredicate Pred;
|
|
Value *X, *NotOp1;
|
|
int XIdx;
|
|
IntrinsicInst *II;
|
|
|
|
if (!match(Op0, m_ICmp(Pred, m_Value(X), m_Zero())))
|
|
return false;
|
|
|
|
/// %Agg = call { i4, i1 } @llvm.[us]mul.with.overflow.i4(i4 %X, i4 %???)
|
|
/// %V = extractvalue { i4, i1 } %Agg, 1
|
|
auto matchMulOverflowCheck = [X, &II, &XIdx](Value *V) {
|
|
auto *Extract = dyn_cast<ExtractValueInst>(V);
|
|
// We should only be extracting the overflow bit.
|
|
if (!Extract || !Extract->getIndices().equals(1))
|
|
return false;
|
|
|
|
II = dyn_cast<IntrinsicInst>(Extract->getAggregateOperand());
|
|
if (!II ||
|
|
!match(II, m_CombineOr(m_Intrinsic<Intrinsic::umul_with_overflow>(),
|
|
m_Intrinsic<Intrinsic::smul_with_overflow>())))
|
|
return false;
|
|
|
|
if (II->getArgOperand(0) == X)
|
|
XIdx = 0;
|
|
else if (II->getArgOperand(1) == X)
|
|
XIdx = 1;
|
|
else
|
|
return false;
|
|
return true;
|
|
};
|
|
|
|
bool Matched =
|
|
(IsAnd && Pred == ICmpInst::Predicate::ICMP_NE &&
|
|
matchMulOverflowCheck(Op1)) ||
|
|
(!IsAnd && Pred == ICmpInst::Predicate::ICMP_EQ &&
|
|
match(Op1, m_Not(m_Value(NotOp1))) && matchMulOverflowCheck(NotOp1));
|
|
|
|
if (!Matched)
|
|
return false;
|
|
|
|
Y = &II->getArgOperandUse(!XIdx);
|
|
return true;
|
|
}
|
|
|
|
bool llvm::isCheckForZeroAndMulWithOverflow(Value *Op0, Value *Op1,
|
|
bool IsAnd) {
|
|
Use *Y;
|
|
return isCheckForZeroAndMulWithOverflow(Op0, Op1, IsAnd, Y);
|
|
}
|