This is an archive of the discontinued LLVM Phabricator instance.

Differential D157216

[polly] Fix typo in comment
Needs ReviewPublic

Authored by Eymay on Aug 6 2023, 4:22 AM.

Details

Reviewers
bollu

Diff Detail

Event Timeline

Eymay created this revision.Aug 6 2023, 4:22 AM
Herald added a reviewer: bollu. · View Herald TranscriptAug 6 2023, 4:22 AM
Herald added a project: Restricted Project. · View Herald Transcript
Eymay requested review of this revision.Aug 6 2023, 4:22 AM
Herald added a project: Restricted Project. · View Herald TranscriptAug 6 2023, 4:22 AM
Herald added a subscriber: llvm-commits. · View Herald Transcript
Harbormaster completed remote builds in B250594: Diff 547554.Aug 6 2023, 4:31 AM

Revision Contents

PathSize
polly/
lib/
External/
isl/
2 lines

Diff 547554

polly/lib/External/isl/isl_map_subtract.c

Show First 20 Lines • Show All 282 Lines • ▼ Show 20 Lines
* a negative value is treated as an error, but the calling * a negative value is treated as an error, but the calling
* function can interpret the results based on the state of dc. * function can interpret the results based on the state of dc.
* *
* Assumes that map has known divs. * Assumes that map has known divs.
* *
* The difference is computed by a backtracking algorithm. * The difference is computed by a backtracking algorithm.
* Each level corresponds to a basic map in "map". * Each level corresponds to a basic map in "map".
* When a node in entered for the first time, we check * When a node in entered for the first time, we check
* if the corresonding basic map intersects the current piece * if the corresponding basic map intersects the current piece
* of "bmap". If not, we move to the next level. * of "bmap". If not, we move to the next level.
* Otherwise, we split the current piece into as many * Otherwise, we split the current piece into as many
* pieces as there are non-redundant constraints of the current * pieces as there are non-redundant constraints of the current
* basic map in the intersection. Each of these pieces is * basic map in the intersection. Each of these pieces is
* handled by a child of the current node. * handled by a child of the current node.
* In particular, if there are n non-redundant constraints, * In particular, if there are n non-redundant constraints,
* then for each 0 <= i < n, a piece is cut off by adding * then for each 0 <= i < n, a piece is cut off by adding
* constraints 0 <= j < i and adding the opposite of constraint i. * constraints 0 <= j < i and adding the opposite of constraint i.
▲ Show 20 Lines • Show All 645 Lines • Show Last 20 Lines