Skip to content

Commit a49e4f0

Browse files
committed
Apply clang-tidy fixes for performance-unnecessary-value-param in QuasiPolynomial.cpp (NFC)
1 parent 154e883 commit a49e4f0

File tree

2 files changed

+5
-5
lines changed

2 files changed

+5
-5
lines changed

mlir/include/mlir/Analysis/Presburger/QuasiPolynomial.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ class QuasiPolynomial : public PresburgerSpace {
5757
QuasiPolynomial operator+(const QuasiPolynomial &x) const;
5858
QuasiPolynomial operator-(const QuasiPolynomial &x) const;
5959
QuasiPolynomial operator*(const QuasiPolynomial &x) const;
60-
QuasiPolynomial operator/(const Fraction x) const;
60+
QuasiPolynomial operator/(const Fraction &x) const;
6161

6262
// Removes terms which evaluate to zero from the expression
6363
// and folds affine functions which are constant into the

mlir/lib/Analysis/Presburger/QuasiPolynomial.cpp

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ QuasiPolynomial::QuasiPolynomial(
1919
std::vector<std::vector<SmallVector<Fraction>>> aff)
2020
: PresburgerSpace(/*numDomain=*/numVars, /*numRange=*/1, /*numSymbols=*/0,
2121
/*numLocals=*/0),
22-
coefficients(coeffs), affine(aff) {
22+
coefficients(std::move(coeffs)), affine(std::move(aff)) {
2323
#ifndef NDEBUG
2424
// For each term which involves at least one affine function,
2525
for (const std::vector<SmallVector<Fraction>> &term : affine) {
@@ -40,7 +40,7 @@ QuasiPolynomial::QuasiPolynomial(
4040
QuasiPolynomial::QuasiPolynomial(unsigned numVars, Fraction constant)
4141
: PresburgerSpace(/*numDomain=*/numVars, /*numRange=*/1, /*numSymbols=*/0,
4242
/*numLocals=*/0),
43-
coefficients({constant}), affine({{}}) {}
43+
coefficients({std::move(constant)}), affine({{}}) {}
4444

4545
QuasiPolynomial QuasiPolynomial::operator+(const QuasiPolynomial &x) const {
4646
assert(getNumInputs() == x.getNumInputs() &&
@@ -89,7 +89,7 @@ QuasiPolynomial QuasiPolynomial::operator*(const QuasiPolynomial &x) const {
8989
return QuasiPolynomial(getNumInputs(), coeffs, aff);
9090
}
9191

92-
QuasiPolynomial QuasiPolynomial::operator/(const Fraction x) const {
92+
QuasiPolynomial QuasiPolynomial::operator/(const Fraction &x) const {
9393
assert(x != 0 && "division by zero!");
9494
QuasiPolynomial qp(*this);
9595
for (Fraction &coeff : qp.coefficients)
@@ -131,7 +131,7 @@ QuasiPolynomial QuasiPolynomial::simplify() {
131131
newCoeff = coefficients[i];
132132
for (ArrayRef<Fraction> term : affine[i]) {
133133
bool allCoeffsZero = llvm::all_of(
134-
term.slice(0, numParam), [](const Fraction c) { return c == 0; });
134+
term.slice(0, numParam), [](const Fraction &c) { return c == 0; });
135135
if (allCoeffsZero)
136136
newCoeff *= term[numParam];
137137
else

0 commit comments

Comments
 (0)