Math à la LaTeX

[pipstransfo.git] / pipstransfo.tex

diff --git a/pipstransfo.tex b/pipstransfo.tex
index 55ab7fa..65ecf0b 100644 (file)
--- a/pipstransfo.tex
+++ b/pipstransfo.tex
@@ -7,9 +7,12 @@
 
 \usepackage{listings}
 \usepackage{hyperref}
 
 \usepackage{listings}
 \usepackage{hyperref}

+\usepackage{xspace}

 
 

+\def\PIPS{PIPS\xspace}

 
 

-\title{PIPS~--- List of code transformations}
+
+\title{\PIPS~--- List of code transformations}

 
 
 
 
 
 


@@ -113,7 +116,7 @@
 \item constant propagation
 \end{itemize}
 
 \item constant propagation
 \end{itemize}
 

-\chapter{List of Pips transformations}
+\chapter{List of \PIPS transformations}

 
 \section{Memory allocation alteration}
 
 
 \section{Memory allocation alteration}
 


@@ -133,9 +136,9 @@
 \begin{description}
 
 \item[loop unrolling]{
 \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]{
   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
   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}
   generally~1.}
 
 \end{description}


@@ -251,7 +254,7 @@
   operator by its expanded form.}
 
 \item[n address code generation]{is the process of splitting
   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
 
 \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