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).
79 lines
2.5 KiB
C++
79 lines
2.5 KiB
C++
//===- IntegerSet.cpp - MLIR Integer Set class ----------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "mlir/IR/IntegerSet.h"
|
|
#include "IntegerSetDetail.h"
|
|
|
|
using namespace mlir;
|
|
using namespace mlir::detail;
|
|
|
|
unsigned IntegerSet::getNumDims() const { return set->dimCount; }
|
|
unsigned IntegerSet::getNumSymbols() const { return set->symbolCount; }
|
|
unsigned IntegerSet::getNumInputs() const {
|
|
return set->dimCount + set->symbolCount;
|
|
}
|
|
|
|
unsigned IntegerSet::getNumConstraints() const {
|
|
return set->constraints.size();
|
|
}
|
|
|
|
unsigned IntegerSet::getNumEqualities() const {
|
|
unsigned numEqualities = 0;
|
|
for (unsigned i = 0, e = getNumConstraints(); i < e; i++)
|
|
if (isEq(i))
|
|
++numEqualities;
|
|
return numEqualities;
|
|
}
|
|
|
|
unsigned IntegerSet::getNumInequalities() const {
|
|
return getNumConstraints() - getNumEqualities();
|
|
}
|
|
|
|
bool IntegerSet::isEmptyIntegerSet() const {
|
|
return *this == getEmptySet(set->dimCount, set->symbolCount, getContext());
|
|
}
|
|
|
|
ArrayRef<AffineExpr> IntegerSet::getConstraints() const {
|
|
return set->constraints;
|
|
}
|
|
|
|
AffineExpr IntegerSet::getConstraint(unsigned idx) const {
|
|
return getConstraints()[idx];
|
|
}
|
|
|
|
/// Returns the equality bits, which specify whether each of the constraints
|
|
/// is an equality or inequality.
|
|
ArrayRef<bool> IntegerSet::getEqFlags() const { return set->eqFlags; }
|
|
|
|
/// Returns true if the idx^th constraint is an equality, false if it is an
|
|
/// inequality.
|
|
bool IntegerSet::isEq(unsigned idx) const { return getEqFlags()[idx]; }
|
|
|
|
MLIRContext *IntegerSet::getContext() const {
|
|
return getConstraint(0).getContext();
|
|
}
|
|
|
|
/// Walk all of the AffineExpr's in this set. Each node in an expression
|
|
/// tree is visited in postorder.
|
|
void IntegerSet::walkExprs(function_ref<void(AffineExpr)> callback) const {
|
|
for (auto expr : getConstraints())
|
|
expr.walk(callback);
|
|
}
|
|
|
|
IntegerSet IntegerSet::replaceDimsAndSymbols(
|
|
ArrayRef<AffineExpr> dimReplacements, ArrayRef<AffineExpr> symReplacements,
|
|
unsigned numResultDims, unsigned numResultSyms) {
|
|
SmallVector<AffineExpr, 8> constraints;
|
|
constraints.reserve(getNumConstraints());
|
|
for (auto cst : getConstraints())
|
|
constraints.push_back(
|
|
cst.replaceDimsAndSymbols(dimReplacements, symReplacements));
|
|
|
|
return get(numResultDims, numResultSyms, constraints, getEqFlags());
|
|
}
|