X-Git-Url: https://scm.cri.mines-paristech.fr/git/pipstransfo.git/blobdiff_plain/02027ecde6656646e93344862f87279a416a6671..2baa95348d39d3ac59ed69768e53ffdf9070ee55:/pipstransfo.tex?ds=inline

diff --git a/pipstransfo.tex b/pipstransfo.tex
index 55ab7fa..b9a9f6d 100644
--- a/pipstransfo.tex
+++ b/pipstransfo.tex
@@ -7,9 +7,12 @@
 
 \usepackage{listings}
 \usepackage{hyperref}
+\usepackage{xspace}
 
+\newcommand\PIPS{PIPS\xspace}
 
-\title{PIPS~--- List of code transformations}
+
+\title{\PIPS~--- List of code transformations}
 
 
 
@@ -113,7 +116,7 @@
 \item constant propagation
 \end{itemize}
 
-\chapter{List of Pips transformations}
+\chapter{List of \PIPS transformations}
 
 \section{Memory allocation alteration}
 
@@ -133,9 +136,9 @@
 \begin{description}
 
 \item[loop unrolling]{
-  is a loop transformation. 
-  Unrolling a loop by a factor of $n$ consists in the substitution of a loop
-  body by itself, replicated $n$ times. A prelude and/or postlude are
+  is a loop transformation.
+  Unrolling a loop by a factor of \(n\) consists in the substitution of a loop
+  body by itself, replicated \(n\) times. A prelude and/or postlude are
   added to preserve the number of iteration.}
 
 \item[loop fusion]{
@@ -156,7 +159,7 @@
   containing the loop without the test in both true and false branch.}
 
 \item[loop normalization]{is a loop transformation that changes
-  the loop initial increment value or the loop range to enforce certain values, 
+  the loop initial increment value or the loop range to enforce certain values,
   generally~1.}
 
 \end{description}
@@ -213,6 +216,7 @@
 \item[goto elimination]{
   is the process of replacing \texttt{goto} instructions by a hierarchical control flow
   graph.}
+
 \item[outlining]{
   is the process of extracting part of a function body into a new function
   and replacing it in the initial function by a function call.}
@@ -251,7 +255,7 @@
   operator by its expanded form.}
 
 \item[n address code generation]{is the process of splitting
-  complex expression in simpler ones that take at most $n$ operands.}
+  complex expression in simpler ones that take at most \(n\) operands.}
 
 \item[memory footprint reduction]{is the process of tiling a loop
   to make sure the iteration over the tile has a memory footprint bounded by