Skip to content

[analysis] Implement an array lattice #6057

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
tlively merged 2 commits into from
Oct 31, 2023
Merged

[analysis] Implement an array lattice #6057

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
aff38de
[analysis] Implement an array lattice
tlively Oct 25, 2023
8601941
expand comment
tlively Oct 30, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
expand comment
  • Loading branch information
@tlively
tlively committed Oct 30, 2023
commit 860194173d640e0d208d11e6e5779031d27b4d75
3 changes: 2 additions & 1 deletion src/analysis/lattices/array.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,7 +60,8 @@ template<Lattice L, size_t N> struct Array {
return getTopImpl(std::make_index_sequence<N>());
}

// `a` <= `b` if their elements are pairwise <=, etc.
// `a` <= `b` if all their elements are pairwise <=, etc. Unless we determine
// that there is no relation, we must check all the elements.
LatticeComparison compare(const Element& a, const Element& b) const noexcept {
auto result = EQUAL;
for (size_t i = 0; i < N; ++i) {
Expand Down