This project implements the path-sensitive data-flow analysis algorithms proposed in Comprehensive Path-sensitive Data-flow Analysis.
In this project, we (Long, Moses, and Kelsey) implements the path-sensitive data-flow analysis based SCCP. As SCCP is done under SSA form, our implementation only works for the SSA form. Under SSA form, the detection of destructive merges becomes very easy. We just need to detect, for each PHI node, whether there is some constant incoming values. If "yes", then it is a destructive merge. Similarly, the detection of influenced nodes and region of influence also becomes easier (than in traditional form). However, the "cloning" of basic blocks become much harder, since we have to handle every PHI node properly. What's worse, we need to insert some PHI nodes on some or all kill edges.
We did some experiments on some very simple examples. The results can be found at demos.
Dependencies:
- LLVM 4.0.1
- cmake
sudo apt-get install llvm-4.0 clang-4.0
sudo apt-get install cmake
cd /path/to/the/root/of/this/repo
mkdir build && cd build
export CC=/usr/lib/llvm-4.0/bin/clang CXX=/usr/lib/llvm-4.0/bin/clang++
cmake .. -DLLVM_ROOT_PATH=/usr/lib/llvm-4.0
make- Long Gong
- Moses Ike
- Kelsey Kurzeja