aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/SafeStack.cpp
diff options
context:
space:
mode:
authorAlexandre Rames <arames@apple.com>2021-10-05 10:53:02 -0700
committerAlexandre Rames <arames@apple.com>2021-10-06 09:41:33 -0700
commitfd9613324d305f036d8177469e4f1d0ed521b3a7 (patch)
treebc8600b2d871434119ca58397ae4748f0ec109b8 /llvm/lib/CodeGen/SafeStack.cpp
parent1301a8b473c614f99171728d928b424b56e7ed27 (diff)
downloadllvm-fd9613324d305f036d8177469e4f1d0ed521b3a7.zip
llvm-fd9613324d305f036d8177469e4f1d0ed521b3a7.tar.gz
llvm-fd9613324d305f036d8177469e4f1d0ed521b3a7.tar.bz2
[MLIR] Rename Shape dialect's `join` to `meet`.
For the type lattice, we (now) use the "less specialized or equal" partial order, leading to the bottom representing the empty set, and the top representing any type. This naming is more in line with the generally used conventions, where the top of the lattice is the full set, and the bottom of the lattice is the empty set. A typical example is the powerset of a finite set: generally, meet would be the intersection, and join would be the union. ``` top: {a,b,c} / | \ {a,b} {a,c} {b,c} | X X | {a} { b } {c} \ | / bottom: { } ``` This is in line with the examined lattice representations in LLVM: * lattice for `BitTracker::BitValue` in `Hexagon/BitTracker.h` * lattice for constant propagation in `HexagonConstPropagation.cpp` * lattice in `VarLocBasedImpl.cpp` * lattice for address space inference code in `InferAddressSpaces.cpp` Reviewed By: silvas, jpienaar Differential Revision: https://reviews.llvm.org/D110766
Diffstat (limited to 'llvm/lib/CodeGen/SafeStack.cpp')
0 files changed, 0 insertions, 0 deletions