Project 2

Shell Files

Note that all the shell files are for Linux. If you run them on Mac or other OSes, you may encounter issues. In particular, the files that the shell files download

FILE1: download.sh

wget http://llvm.org/releases/3.4/llvm-3.4.src.tar.gz

wget http://llvm.org/releases/3.4/clang-3.4.src.tar.gz

tar xvzf llvm-3.4.src.tar.gz

tar xvzf clang-3.4.src.tar.gz

mv llvm-3.4 src

mv clang-3.4 src/tools/clang

FILE2: build.sh

mkdir build

cd build

../src/configure

make

FILE3: compile_project.sh

echo "Moving to the Project2 Folder..."

cd ~/llvm/build/lib/Transforms/Project2

echo "Results:"

ls ~/llvm/build/Release+Asserts/lib/Project2.so -alc

cp ~/llvm/build/Release+Asserts/lib/Project2.so ~/llvm/Project2.so

make

FILE4: runpass.sh

opt -load ~/llvm/Project2.so -Project2 < ~/llvm/testprograms/test.bc > /dev/null

Tasks

Task 1. Getting a Control Flow Graph:

• Given a function, you are asked to get a control flow graph of the function in .dot file format.
• You are also asked to print out all possible execution paths of each function.
• In addition, you are asked to detect a loop in order to do an efficient analysis. Please provide how you detect the loop while you are doing the Task 1.
• Hints: Remember that LLVM already provides you basic-blocks and their connectivity (e.g., predecessors). Your task is to leverage such information to construct control flow graph.

Task 2. Getting a Call Graph:

• Given a program, you are asked to get a call graph of the program.
• Call graph is a graph consisting of callers and callees. In a call graph, a node represents a function, and an edge shows a relationship between the nodes. For instance, an edge from a node A to a node B represents, a B function (Callee) call from a function A (caller).
• You are asked to print out two different call graphs. One call graph that shows all the function calls from main(). Another call graph that shows all function calls from any function (one that is not reachable from main()).