From 502d8c49998d45fa20d0b640d1c198bd4445fb9f Mon Sep 17 00:00:00 2001 From: tgangwani Date: Wed, 6 Jan 2016 10:59:27 +0530 Subject: [PATCH] Update README.md --- README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 00a64a0..4c6a896 100644 --- a/README.md +++ b/README.md @@ -1,16 +1,16 @@ Partial Redundancy Elimination (PRE) ==================================== -Is a compiler optimization that eliminates +PRE is a compiler optimization that eliminates expressions that are redundant on some but not necessarily all paths through a -program. In this project, we implemented a PRE optimization pass in LLVM -and measured results on a variety of applications. It's a powerful technique that subsumes +program. We implement a PRE optimization pass in the LLVM framework, and evaluate the benefits +on a variety of applications. PRE is a powerful technique that subsumes Common Subexpression Elimination (CSE) and Loop Invariant Code Motion (LICM), and hence has a potential to greatly improve performance. -Commnads +Commands ------- -opts_lcm = "-mem2reg -loop-rotate -reassociate -lcm -mem2reg -simplifycfy; +opts_lcm = "-mem2reg -loop-rotate -reassociate -lcm -mem2reg -simplifycfy; $opt -load $load_pass $opts_lcm $test.bc -o $test-lcm.bc