aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Object/WasmObjectFile.cpp
diff options
context:
space:
mode:
authorPhilip Reames <listmail@philipreames.com>2021-03-08 08:33:05 -0800
committerPhilip Reames <listmail@philipreames.com>2021-03-08 08:59:00 -0800
commit97a7bc5831152eabcd61e5b970c054ce67c2c91b (patch)
tree49f5c01067f563ec04593a7439eba326e237d780 /llvm/lib/Object/WasmObjectFile.cpp
parent63abbeb6a8b7dbc57ff90a13c73ac2b41486ee70 (diff)
downloadllvm-97a7bc5831152eabcd61e5b970c054ce67c2c91b.zip
llvm-97a7bc5831152eabcd61e5b970c054ce67c2c91b.tar.gz
llvm-97a7bc5831152eabcd61e5b970c054ce67c2c91b.tar.bz2
[gvn] Precisely propagate equalities to phi operands
The code used for propagating equalities (e.g. assume facts) was conservative in two ways - one of which this patch fixes. Specifically, it shifts the code reasoning about whether a use is dominated by the end of the assume block to consider phi uses to exist on the predecessor edge. This matches the dominator tree handling for dominates(Edge, Use), and simply extends it to dominates(BB, Use). Note that the decision to use the end of the block is itself a conservative choice. The more precise option would be to use the later of the assume and the value, and replace all uses after that. GVN handles that case separately (with the replace operand mechanism) because it used to be expensive to ask dominator questions within blocks. With the new instruction ordering support, we should probably rewrite this code at some point to simplify. Differential Revision: https://reviews.llvm.org/D98082
Diffstat (limited to 'llvm/lib/Object/WasmObjectFile.cpp')
0 files changed, 0 insertions, 0 deletions