This is an archive of the discontinued LLVM Phabricator instance.

	Show All 25 Lines
	enum class ReprKind { Inequality, Equality, None };			enum class ReprKind { Inequality, Equality, None };

	/// `MaybeLocalRepr` contains the indices of the contraints that can be			/// `MaybeLocalRepr` contains the indices of the contraints that can be
	/// expressed as a floordiv of an affine function. If it's an `equality`			/// expressed as a floordiv of an affine function. If it's an `equality`
	/// contraint `equalityIdx` is set, in case of `inequality` the `lowerBoundIdx`			/// contraint `equalityIdx` is set, in case of `inequality` the `lowerBoundIdx`
	/// and `upperBoundIdx` is set. By default the kind attribute is set to None.			/// and `upperBoundIdx` is set. By default the kind attribute is set to None.
	struct MaybeLocalRepr {			struct MaybeLocalRepr {
	ReprKind kind = ReprKind::None;			ReprKind kind = ReprKind::None;
				explicit operator bool() const { return kind != ReprKind::None; }
	union {			union {
	unsigned equalityIdx;			unsigned equalityIdx;
	struct {			struct {
	unsigned lowerBoundIdx, upperBoundIdx;			unsigned lowerBoundIdx, upperBoundIdx;
	} inequalityPair;			} inequalityPair;
	} repr;			} repr;
	};			};

	Show All 34 Lines

mlir/lib/Analysis/Presburger/IntegerPolyhedron.cpp

Show First 20 Lines • Show All 866 Lines • ▼ Show 20 Lines	void IntegerPolyhedron::getLocalReprs(
unsigned divOffset = getNumDimAndSymbolIds();		unsigned divOffset = getNumDimAndSymbolIds();
bool changed;		bool changed;
do {		do {
// Each time changed is true, at end of this iteration, one or more local		// Each time changed is true, at end of this iteration, one or more local
// vars have been detected as floor divs.		// vars have been detected as floor divs.
changed = false;		changed = false;
for (unsigned i = 0, e = getNumLocalIds(); i < e; ++i) {		for (unsigned i = 0, e = getNumLocalIds(); i < e; ++i) {
if (!foundRepr[i + divOffset]) {		if (!foundRepr[i + divOffset]) {
auto res = computeSingleVarRepr(*this, foundRepr, divOffset + i,		MaybeLocalRepr res = computeSingleVarRepr(
dividends[i], denominators[i]);		*this, foundRepr, divOffset + i, dividends[i], denominators[i]);
if (res.kind == ReprKind::None)		if (!res)
continue;		continue;
foundRepr[i + divOffset] = true;		foundRepr[i + divOffset] = true;
repr[i] = res;		repr[i] = res;
changed = true;		changed = true;
}		}
}		}
} while (changed);		} while (changed);

// Set 0 denominator for identifiers for which no division representation		// Set 0 denominator for identifiers for which no division representation
// could be found.		// could be found.
for (unsigned i = 0, e = repr.size(); i < e; ++i)		for (unsigned i = 0, e = repr.size(); i < e; ++i)
if (repr[i].kind == ReprKind::None)		if (!repr[i])
		bondhugulaUnsubmitted Not Done Reply Inline Actions Is this the only use? bondhugula: Is this the only use?
		arjunpAuthorUnsubmitted Done Reply Inline Actions These are the only ones I'm aware of currently. There will be another in PresburgerSet in a subsequent patch. arjunp: These are the only ones I'm aware of currently. There will be another in PresburgerSet in a…
denominators[i] = 0;		denominators[i] = 0;
}		}

/// Tightens inequalities given that we are dealing with integer spaces. This is		/// Tightens inequalities given that we are dealing with integer spaces. This is
/// analogous to the GCD test but applied to inequalities. The constant term can		/// analogous to the GCD test but applied to inequalities. The constant term can
/// be reduced to the preceding multiple of the GCD of the coefficients, i.e.,		/// be reduced to the preceding multiple of the GCD of the coefficients, i.e.,
/// 64i - 100 >= 0 => 64i - 128 >= 0 (since 'i' is an integer). This is a		/// 64i - 100 >= 0 => 64i - 128 >= 0 (since 'i' is an integer). This is a
/// fast method - linear in the number of coefficients.		/// fast method - linear in the number of coefficients.
▲ Show 20 Lines • Show All 1,228 Lines • Show Last 20 Lines

This is an archive of the discontinued LLVM Phabricator instance.

[MLIR][Presburger] MaybeLocalRepr: add explicit bool() for convenienceClosedPublic

Details

Diff Detail

Event Timeline

Revision Contents

Diff 406178

mlir/include/mlir/Analysis/Presburger/Utils.h

mlir/lib/Analysis/Presburger/IntegerPolyhedron.cpp

[MLIR][Presburger] MaybeLocalRepr: add explicit bool() for convenience
ClosedPublic