Introduction In the previous articles, we learned how to write analysis and transformation passes with LLVM. We started with a simple pass that counts, in a given module, how many add instructions there are. Next, we saw a simple implementation of Dead code elimination optimization and constant propagation. Our focus was on practicality: we simplify by making a few assumptions and start showing the code while keeping the theory to a minimum. We are keeping the same focus here: being pr...