3 @c % /**-----------------------------------------------------------------**
5 @c % **-----------------------------------------------------------------**
7 @c % **-----------------------------------------------------------------**
8 @c % ** First version: july 6th 2002 **
9 @c % **-----------------------------------------------------------------**/
11 @c % release 1.0: September 17th 2002
12 @c % release 1.1: December 5th 2002
13 @c % release 1.2: April 22th 2003
14 @c % release 2.0: November 21th 2005 (and now in texinfo instead of LaTeX)
15 @c % release 2.1: October 15th 2007
17 @c %/**************************************************************************
18 @c % * CLooG : the Chunky Loop Generator (experimental) *
19 @c % **************************************************************************/
20 @c %/* CAUTION: the English used is probably the worst you ever read, please
21 @c % * feel free to correct and improve it !
24 @c %\textit{"I found the ultimate transformation functions, optimization for
25 @c %static control programs is now a closed problem, I have \textnormal{just}
26 @c %to generate the target code !"}
30 @c % /*************************************************************************
31 @c % * PART I: HEADER *
32 @c % *************************************************************************/
34 @setfilename cloog.info
35 @settitle CLooG - a loop generator for scanning polyhedra
38 @include gitversion.texi
39 @set UPDATED October 15th 2007
40 @setchapternewpage odd
44 @c % /*************************************************************************
45 @c % * PART II: SUMMARY DESCRIPTION AND COPYRIGHT *
46 @c % *************************************************************************/
49 This manual is for CLooG version @value{VERSION}, a software
50 which generates loops for scanning Z-polyhedra. That is, CLooG produces a
51 code visiting each integral point of a union of parametrized
52 polyhedra. CLooG is designed to avoid control overhead and to produce a very
55 It would be quite kind to refer the following paper in any publication that
56 results from the use of the CLooG software or its library:
59 @@InProceedings@{Bas04,
60 @ @ author =@ @ @ @ @{C. Bastoul@},
61 @ @ title =@ @ @ @ @ @{Code Generation in the Polyhedral Model
62 @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ Is Easier Than You Think@},
63 @ @ booktitle = @{PACT'13 IEEE International Conference on
64 @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ Parallel Architecture and Compilation Techniques@},
65 @ @ year =@ @ @ @ @ @ 2004,
66 @ @ pages =@ @ @ @ @ @{7--16@},
67 @ @ month =@ @ @ @ @ @{september@},
68 @ @ address =@ @ @ @{Juan-les-Pins@}
72 Copyright @copyright{} 2002-2005 C@'edric Bastoul.
75 Permission is granted to copy, distribute and/or modify this document under
76 the terms of the GNU Free Documentation License, Version 1.2
77 published by the Free Software Foundation. To receive a copy of the
78 GNU Free Documentation License, write to the Free Software Foundation, Inc.,
79 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
83 @c % /*************************************************************************
84 @c % * PART III: TITLEPAGE, CONTENTS, COPYRIGHT *
85 @c % *************************************************************************/
88 @subtitle A Loop Generator For Scanning Polyhedra
89 @subtitle Edition @value{EDITION}, for CLooG @value{VERSION}
90 @subtitle @value{UPDATED}
91 @author C@'edric Bastoul
93 @c The following two commands start the copyright page.
95 @noindent (September 2001)
97 @item C@'edric Bastoul
98 SCHEDULES GENERATE !!! I just need to apply them now, where can I find
99 a good code generator ?!
102 Hmmm. I fear that if you want something powerful enough, you'll have to
106 @vskip 0pt plus 1filll
110 @c Output the table of contents at the beginning.
113 @c % /*************************************************************************
114 @c % * PART IV: TOP NODE AND MASTER MENU *
115 @c % *************************************************************************/
135 @c % /*************************************************************************
136 @c % * PART V: BODY OF THE DOCUMENT *
137 @c % *************************************************************************/
139 @c % ****************************** INTRODUCTION ******************************
141 @chapter Introduction
142 CLooG is a free software and library generating loops for scanning Z-polyhedra.
143 That is, it finds a code (e.g. in C, FORTRAN...) that reaches each integral
144 point of one or more parameterized polyhedra. CLooG has been originally
145 written to solve the code generation problem for optimizing compilers based on
146 the polytope model. Nevertheless it is used now in various area, e.g., to build
147 control automata for high-level synthesis or to find the best polynomial
148 approximation of a function. CLooG may help in any situation where scanning
149 polyhedra matters. It uses the best state-of-the-art code generation
150 algorithm known as the Quiller@'e et al. algorithm (@pxref{Qui00})
151 with our own improvements and extensions (@pxref{Bas04}).
152 The user has full control on generated code quality.
153 On one hand, generated code size has to be tuned for sake of
154 readability or instruction cache use. On the other hand, we must ensure that
155 a bad control management does not hamper performance of the generated code,
156 for instance by producing redundant guards or complex loop bounds.
157 CLooG is specially designed to avoid control overhead and to produce a very
160 CLooG stands for @emph{Chunky Loop Generator}: it is a part of the Chunky
161 project, a research tool for data locality improvement (@pxref{Bas03a}).
163 also to be the back-end of automatic parallelizers like LooPo (@pxref{Gri04}).
165 compilable code oriented and provides powerful program transformation
166 facilities. Mainly, it allows the user to specify very general schedules where,
167 e.g., unimodularity or invertibility of the transformation doesn't matter.
169 The current version is still under
170 evaluation, and there is no guarantee that the upward compatibility
171 will be respected (but the previous API has been stable for two years,
172 we hope this one will be as successful -and we believe it-).
173 A lot of reports are necessary to freeze the library
174 API and the input file shape. Most API changes from 0.12.x to 0.14.x
175 have been requested by the users themselves.
176 Thus you are very welcome and encouraged
177 to post reports on bugs, wishes, critics, comments, suggestions or
178 successful experiences in the forum of @code{http://www.CLooG.org}
179 or to send them to cedric.bastoul@@inria.fr directly.
187 @section Basically, what's the point ?
188 If you want to use CLooG, this is because you want to scan or to find
189 something inside the integral points of a set of polyhedra. There are many
190 reasons for that. Maybe you need the generated code itself because it
191 actually implements a very smart program transformation you found.
192 Maybe you want to use the generated code
193 because you know that the solution of your problem belongs to the integral
194 points of those damned polyhedra and you don't know which one. Maybe you just
195 want to know if a polyhedron has integral points depending on some parameters,
196 which is the lexicographic minimum, maximum, the third on the basis of the
197 left etc. Probably you have your own reasons to use CLooG.
199 Let us illustrate a basic use of CLooG. Suppose we have a set of affine
200 constraints that describes a part of a whatever-dimensional space,
201 called a @strong{domain}, and we
202 want to scan it. Let us consider for instance the following set of constraints
204 and @samp{j} are the unknown (the two dimensions of the space) and
205 @samp{m} and @samp{n} are the parameters (some symbolic constants):
213 Let us also consider that we have a partial knowledge of the parameter values,
214 called the @strong{context}, expressed as affine constraints as well,
222 Note that using parameters is optional, if you are not comfortable with
223 parameter manipulation, just replace them with any scalar value that fits
224 @code{m>=2} and @code{n>=2}.
225 A graphical representation of this part of the 2-dimensional space, where
226 the integral points are represented using heavy dots would be for instance:
228 @image{images/basic,6cm}
230 The affine constraints of both the domain and the context are what we will
231 provide to CLooG as input (in a particular shape that will be described later).
232 The output of CLooG is a pseudo-code to scan the integral points of the
233 input domain according to the context:
236 for (i=2;i<=n;i++) @{
237 for (j=2;j<=min(m,-i+n+2);j++) @{
243 If you felt such a basic example is yet interesting, there is a good chance
244 that CLooG is appropriate for you. CLooG can do much more: scanning several
245 polyhedra or unions of polyhedra at the same time, applying general affine
246 transformations to the polyhedra, generate compilable code etc. Welcome
247 to the CLooG's user's guide !
250 @section Defining a Scanning Order: Scattering Functions
251 In CLooG, domains only define the set of integral points to scan and their
252 coordinates. In particular, CLooG is free to choose the scanning order for
253 generating the most efficient code. This means, for optimizing/parallelizing
254 compiler people, that CLooG doesn't make any speculation on dependences on and
255 between statements (by the way, it's not its job !).
256 For instance, if an user give to
257 CLooG only two domains @code{S1:1<=i<=n}, @code{S2:1<=i<=n} and the context
258 @code{n>=1}, the following pseudo-codes are considered to be equivalent:
262 /* A convenient target pseudo-code. */
263 for (i=1;i<=N;i++) @{
266 for (i=1;i<=N;i++) @{
274 /* Another convenient target pseudo-code. */
275 for (i=1;i<=N;i++) @{
282 The default behaviour
283 of CLooG is to generate the second one, since it is optimized in control.
284 It is right if there are no data dependences
285 between @code{S1} and @code{S2}, but wrong otherwise.
287 Thus it is often useful to force scanning to respect a given order. This can be
288 done in CLooG by using @strong{scattering functions}. Scattering is a
289 shortcut for scheduling, allocation, chunking functions and the like we can
290 find in the restructuring compilation literature. There are a lot of reasons
291 to scatter the integral points of the domains (i.e. the statement instances
292 of a program, for compilation people), parallelization or optimization are good
293 examples. For instance, if the user wants for any reason to set some
294 precedence constraints between the statements of our example above
295 in order to force the generation of the
296 first code, he can do it easily by setting (for example) the following
297 scheduling functions:
300 $$\theta _{S1}(i) = (1)$$
301 $$\theta _{S2}(j) = (2)$$
313 This scattering means that each integral point of the domain @code{S1}
314 is scanned at logical date @code{1} while each integral point of the domain
315 @code{S2} is scanned at logical date @code{2}. As a result, the whole
316 domain @code{S1} is scanned before domain @code{S2} and the first code in our
317 example is generated.
319 The user can set every kind of affine scanning order thanks to the
320 scattering functions. Each domain has its own scattering function and
321 each scattering function may be multi-dimensional. A multi-dimensional logical
322 date may be seen as classical date (year,month,day,hour,minute,etc.) where
323 the first dimensions are the most significant. Each scattering dimension
324 may depend linearly on the original dimensions (e.g., @code{i}), the
325 parameters (e.g., @code{n}) ans scalars (e.g., @code{2}).
327 A very useful example of multi-dimensional scattering functions is, for
328 compilation people, the scheduling of the original program.
329 The basic data to use for code generation are statement iteration domains.
330 As we saw, these data are not sufficient to rebuild the original
331 program (what is the ordering between instances of different statements ?).
332 The missing data can be put in the scattering functions as the original
333 scheduling. The method to compute it is quite simple (@pxref{Fea92}). The idea is to
334 build an abstract syntax tree of the program and to read the scheduling for
335 each statement. For instance, let us consider the following implementation of
336 a Cholesky factorization:
340 /* A Cholesky factorization kernel. */
341 for (i=1;i<=N;i++) @{
342 for (j=1;j<=i-1;j++) @{
343 a[i][i] -= a[i][j] ; /* S1 */
345 a[i][i] = sqrt(a[i][i]) ; /* S2 */
346 for (j=i+1;j<=N;j++) @{
347 for (k=1;k<=i-1;k++) @{
348 a[j][i] -= a[j][k]*a[i][k] ; /* S3 */
350 a[j][i] /= a[i][i] ; /* S4 */
357 The corresponding abstract syntax tree is given in the following figure.
358 It directly gives the scattering functions (schedules) for all the
359 statements of the program.
361 @image{images/tree,6cm}
365 \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (0,i,0,j,0)^T$\cr
366 \theta _{S2}(i) &$= (0,i,1)^T$\cr
367 \theta _{S3}(i,j,k)^T &$= (0,i,2,j,0,k,0)^T$\cr
368 \theta _{S4}(i,j)^T &$= (0,i,2,j,1)^T$}$}
375 T_S1(i,j)^T = (0,i,0,j,0)^T
377 T_S3(i,j,k)^T = (0,i,2,j,0,k,0)^T
378 T_S4(i,j)^T = (0,i,2,j,1)^T
383 These schedules depend on the iterators and give for each instance of each
384 statement a unique execution date. Using such scattering functions allow
385 CLooG to re-generate the input code.
391 @c % ***********************Using the CLooG Software **************************
393 @chapter Using the CLooG Software
398 * Writing The Input File::
404 @c %/*************************************************************************
405 @c % * A FIRST EXAMPLE *
406 @c % *************************************************************************/
407 @node A First Example
408 @section A First Example
409 CLooG takes as input a file that must be written accordingly to a grammar
410 described in depth in a further section (@pxref{Writing The Input File}).
411 Moreover it supports many options to tune the target code presentation or
412 quality as discussed in a dedicated section (@pxref{Calling CLooG}).
414 of CLooG is not very complex and we present in this section how to generate the
415 code corresponding to a basic example discussed earlier (@pxref{Basics}).
417 The problem is to find the code that scans a 2-dimensional polyhedron
418 where @samp{i} and @samp{j} are the unknown (the two dimensions of the space)
419 and @samp{m} and @samp{n} are the parameters (the symbolic constants),
420 defined by the following set of constraints:
428 @noindent We also consider a partial knowledge of the parameter values,
429 expressed thanks to the following affine constraints:
437 An input file that corresponds to this problem, and asks for a generated
438 code in C, may be the following. Note that we do not describe here precisely
439 the structure and the components of this file (@pxref{Writing The Input File}
440 for such information, if you feel it necessary):
443 # ---------------------- CONTEXT ----------------------
446 # Context (constraints on two parameters)
447 2 4 # 2 lines and 4 columns
448 # eq/in m n 1 eq/in: 1 for inequality >=0, 0 for equality =0
449 1 1 0 -2 # 1*m + 0*n -2*1 >= 0, i.e. m>=2
450 1 0 1 -2 # 0*m + 1*n -2*1 >= 0, i.e. n>=2
452 1 # We want to set manually the parameter names
453 m n # parameter names
455 # --------------------- STATEMENTS --------------------
456 1 # Number of statements
458 1 # First statement: one domain
460 5 6 # 5 lines and 6 columns
462 1 1 0 0 0 -2 # i >= 2
463 1 -1 0 0 1 0 # i <= n
464 1 0 1 0 0 -2 # j >= 2
465 1 0 -1 1 0 0 # j <= m
466 1 -1 -1 0 1 2 # n+2-i>=j
467 0 0 0 # for future options
469 1 # We want to set manually the iterator names
472 # --------------------- SCATTERING --------------------
473 0 # No scattering functions
476 This file may be called @samp{basic.cloog}
477 (this example is provided in the CLooG distribution as
478 @code{test/manual_basic.cloog}) and we can ask CLooG to process it
479 and to generate the code by a simple calling to CLooG with this file as input:
480 @samp{cloog basic.cloog}. By default, CLooG will print the generated code in
485 /* Generated by CLooG v@value{VERSION} in 0.00s. */
486 for (i=2;i<=n;i++) @{
487 for (j=2;j<=min(m,-i+n+2);j++) @{
494 @c %/*************************************************************************
496 @c % *************************************************************************/
497 @node Writing The Input File
498 @section Writing The Input File
499 The input text file contains a problem description, i.e. the context,
500 the domains and the scattering functions.
501 Because CLooG is very 'compilable code generation oriented', we can associate
502 some additional informations to each domain. We call this association a
503 @emph{statement}. The set of all informations is
504 called a @emph{program}. The input file respects the grammar below
505 (terminals are preceded by "_"):
509 Program ::= Context Statements Scattering
510 Context ::= Language Domain Naming
511 Statements ::= Nb_statements Statement_list Naming
512 Scattering ::= Nb_functions Domain_list Naming
513 Naming ::= Option Name_list
514 Name_list ::= _String Name_list | (void)
515 Statement_list ::= Statement Statement_list | (void)
516 Domain_list ::= _Domain Domain_list | (void)
517 Statement ::= Iteration_domain 0 0 0
518 Iteration_domain ::= Domain_union
519 Domain_union ::= Nb_domains Domain_list
522 Nb_statements ::= _Integer
523 Nb_domains ::= _Integer
524 Nb_functions ::= _Integer
528 @item @samp{Context} represents the informations that are
529 shared by all the statements. It consists on
530 the language used (which can be @samp{c} for C or @samp{f} for FORTRAN 90)
531 and the global constraints on parameters.
532 These constraints are essential
533 since they give to CLooG the number of parameters. If there is no
534 parameter or no constraints on parameters, just give a constraint
535 always satisfied like @math{1 \geq 0}. @samp{Naming} sets the parameter
537 If the naming option @samp{Option} is 1, parameter names will be read
538 on the next line. There must be exactly as many names as parameters.
539 If the naming option @samp{Option} is 0, parameter names are
540 automatically generated. The name of the first parameter will
541 be @samp{M}, and the name of the @math{(n+1)^{th}} parameter directly
542 follows the name of the @math{n^{th}} parameter in ASCII code.
543 It is the user responsibility to ensure that parameter names,
544 iterators and scattering dimension names are different.
545 @item @samp{Statements} represents the informations on the statements.
546 @samp{Nb_statements} is the number of statements in the program,
547 i.e. the number of @samp{Statement} items in the @samp{Statement_list}.
548 @samp{Statement} represents the informations on a given statement.
549 To each statement is associated a domain
550 (the statement iteration domain: @samp{Iteration_domain}) and three
551 zeroes that represents future options.
552 @samp{Naming} sets the iterator names. If the naming option
553 @samp{Option} is 1, the iterator names
554 will be read on the next line. There must be exactly as many names as
555 nesting level in the deepest iteration domain. If the naming option
556 @samp{Option} is 0, iterator names are automatically generated.
557 The iterator name of the outermost loop will be @samp{i}, and the
558 iterator name of the loop at level @math{n+1} directly follows the
559 iterator name of the loop at level @math{n} in ASCII code.
560 @item @samp{Scattering} represents the informations on scattering functions.
561 @samp{Nb_functions} is the number of functions (it must be
562 equal to the number of statements or 0 if there is no scattering
563 function). The function themselves are represented through
565 @samp{Naming} sets the scattering dimension names. If the naming option
566 @samp{Option} is 1, the scattering dimension names will be read on the
568 There must be exactly as many names as scattering dimensions. If the
569 naming option @samp{Option} is 0, scattering dimension names are automatically
570 generated. The name of the @math{n^{th}} scattering dimension
575 * Domain Representation::
576 * Scattering Representation::
579 @node Domain Representation
580 @subsection Domain Representation
581 As shown by the grammar, the input file describes the various informations
582 thanks to characters, integers and domains. Each domain is defined by a set of
583 constraints in the PolyLib format (@pxref{Wil93}). They have the
586 @item some optional comment lines beginning with @samp{#},
587 @item the row and column numbers, possibly followed by comments,
588 @item the constraint rows, each row corresponds to a constraint the
589 domain have to satisfy. Each row must be on a single line and is possibly
590 followed by comments. The constraint is an equality @math{p(x) = 0} if the
591 first element is 0, an inequality @math{p(x) \geq 0} if the first element
592 is 1. The next elements are the unknown coefficients, followed by
593 the parameter coefficients. The last element is the constant factor.
595 For instance, assuming that @samp{i}, @samp{j} and @samp{k} are iterators and
596 @samp{m} and @samp{n} are parameters, the domain defined by the following
601 \hbox{$ \cases{ -i + m &$\geq 0$\cr
603 i + j - k &$\geq 0$}$}
617 @noindent can be written in the input file as follows :
622 3 7 # 3 lines and 7 columns
624 1 -1 0 0 1 0 0 # -i + m >= 0
625 1 0 -1 0 0 1 0 # -j + n >= 0
626 1 1 1 -1 0 0 0 # i + j - k >= 0
630 Each iteration domain @samp{Iteration_domain} of a given statement
631 is a union of polyhedra
632 @samp{Domain_union}. A union is defined by its number of elements
633 @samp{Nb_domains} and the elements themselves @samp{Domain_list}.
634 For instance, let us consider the following pseudo-code:
638 for (i=1;i<=n;i++) @{
639 if ((i >= m) || (i <= 2*m))
647 @noindent The iteration domain of @samp{S1} can be divided into two
648 polyhedra and written in the input file as follows:
652 2 # Number of polyhedra in the union
654 3 5 # 3 lines and 5 columns
660 3 5 # 3 lines and 5 columns
664 1 -1 2 0 0 # i <= 2*m
668 @node Scattering Representation
669 @subsection Scattering Function Representation
670 Scattering functions are depicted in the input file thanks a representation
671 very close to the domain one.
672 An integer gives the number of functions @samp{Nb_functions} and each function
673 is represented by a domain. Each line of the domain corresponds to an equality
674 defining a dimension of the function. Note that at present
675 (CLooG @value{VERSION})
676 @strong{all functions must have the same scattering dimension number}. If a
677 user wants to set scattering functions with different dimensionality, he has
678 to complete the smaller one with zeroes to reach the maximum dimensionality.
679 For instance, let us consider the following code and
680 scheduling functions:
684 for (i=1;i<=n;i++) @{
685 if ((i >= m) || (i <= 2*m))
695 \hbox{$ \cases{ \theta _{S1}(i) &$= (i,0)^T$\cr
696 \theta _{S2}(i,j)^T &$= (n,i+j)^T$}$}
704 T_S2(i,j)^T = (n,i+j)^T
710 @noindent This scheduling can be written in the input file as follows:
714 2 # Number of scattering functions
716 2 7 # 2 lines and 7 columns
717 # eq/in c1 c2 i m n 1
718 0 1 0 -1 0 0 0 # c1 = i
719 0 0 1 0 0 0 0 # c2 = 0
721 2 8 # 2 lines and 8 columns
722 # eq/in c1 c2 i j m n 1
723 0 1 0 0 0 0 -1 0 # c1 = n
724 0 0 1 -1 -1 0 0 0 # c2 = i+j
727 The complete input file for the user who wants to generate the code for this
728 example with the preceding scheduling would be
729 (this file is provided in the CLooG distribution
730 as @code{test/manual_scattering.cloog}:
733 # ---------------------- CONTEXT ----------------------
736 # Context (no constraints on two parameters)
737 1 4 # 1 lines and 4 columns
739 1 0 0 0 # 0 >= 0, always true
741 1 # We want to set manually the parameter names
742 m n # parameter names
744 # --------------------- STATEMENTS --------------------
745 2 # Number of statements
747 2 # First statement: two domains
749 3 5 # 3 lines and 5 columns
755 3 5 # 3 lines and 5 columns
759 1 -1 2 0 0 # i <= 2*m
760 0 0 0 # for future options
762 1 # Second statement: one domain
763 4 6 # 4 lines and 6 columns
765 1 1 0 0 0 -1 # i >= 1
766 1 -1 0 0 1 0 # i <= n
767 1 -1 1 0 0 -1 # j >= i+1
768 1 0 -1 1 0 0 # j <= m
769 0 0 0 # for future options
771 1 # We want to set manually the iterator names
774 # --------------------- SCATTERING --------------------
775 2 # Scattering functions
777 2 7 # 2 lines and 7 columns
778 # eq/in p1 p2 i m n 1
779 0 1 0 -1 0 0 0 # p1 = i
780 0 0 1 0 0 0 0 # p2 = 0
782 2 8 # 2 lines and 8 columns
783 # eq/in p1 p2 i j m n 1
784 0 1 0 0 0 0 -1 0 # p1 = n
785 0 0 1 -1 -1 0 0 0 # p2 = i+j
787 1 # We want to set manually the scattering dimension names
788 p1 p2 # scattering dimension names
792 @c %/*************************************************************************
793 @c % * Calling CLooG *
794 @c % *************************************************************************/
796 @section Calling CLooG
797 CLooG is called by the following command:
799 cloog [ options | file ]
801 The default behavior of CLooG is to read the input informations from a file and
802 to print the generated code or pseudo-code on the standard output.
803 CLooG's behavior and the output code shape is under the user control thanks
804 to many options which are detailed a further section (@pxref{CLooG Options}).
805 @code{file} is the input file. @code{stdin} is a special value: when used,
806 input is standard input. For instance, we can call CLooG to treat the
807 input file @code{basic.cloog} with default options by typing:
808 @code{cloog basic.cloog} or @code{more basic.cloog | cloog stdin}.
810 @c %/*************************************************************************
811 @c % * CLooG Options *
812 @c % *************************************************************************/
814 @section CLooG Options
817 * Last Depth to Optimize Control::
818 * First Depth to Optimize Control::
819 * Simplify Convex Hull::
820 * Once Time Loop Elimination::
821 * Equality Spreading::
822 * First Level for Spreading::
832 @node Last Depth to Optimize Control
833 @subsection Last Depth to Optimize Control @code{-l <depth>}
835 @code{-l <depth>}: this option sets the last loop depth to be optimized in
836 control. The higher this depth, the less control overhead.
837 For instance, with some input file, a user can generate
838 different pseudo-codes with different @code{depth} values as shown below.
841 /* Generated using a given input file and @strong{option -l 1} */
842 for (i=0;i<=M;i++) @{
844 for (j=0;j<=N;j++) @{
847 for (j=0;j<=N;j++) @{
856 /* Generated using the same input file but @strong{option -l 2} */
857 for (i=0;i<=M;i++) @{
859 for (j=0;j<=N;j++) @{
867 In this example we can see that this option can change the operation
868 execution order between statements. Let us remind that CLooG does not
869 make any speculation on dependences between statements
870 (@pxref{Scattering}). Thus if nothing (i.e. scattering functions)
871 forbids this, CLooG considers the above codes to be equivalent.
872 If there is no scattering functions, the minimum value for @code{depth}
873 is 1 (in the case of 0, the user doesn't really need a loop generator !),
874 and the number of scattering dimensions otherwise (CLooG will warn the
875 user if he doesn't respect such constraint).
876 The maximum value for depth is -1 (infinity).
877 Default value is infinity.
879 @node First Depth to Optimize Control
880 @subsection First Depth to Optimize Control @code{-f <depth>}
882 @code{-f <depth>}: this option sets the first loop depth to be optimized
883 in control. The lower this depth, the less control overhead (and the longer
884 the generated code). For instance, with some input file, a user
885 can generate different pseudo-codes with different @code{depth} values
887 The minimum value for @code{depth} is 1, and the
888 maximum value is -1 (infinity).
892 /* Generated using a given input file and @strong{option -f 3} */
893 for (i=1;i<=N;i++) @{
894 for (j=1;j<=M;j++) @{
905 /* Generated using the same input file but @strong{option -f 2} */
906 for (i=1;i<=N;i++) @{
907 for (j=1;j<=9;j++) @{
910 for (j=10;j<=M;j++) @{
918 @node Simplify Convex Hull
919 @subsection Simplify Convex Hull @code{-sh <boolean>}
921 @code{-sh <boolean>}: this option enables (@code{boolean=1})
922 or forbids (@code{boolean=0}) a simplification step
923 that may simplify some constraints.
924 This option works only for generated code without
925 code duplication (it means, you have to tune @code{-f} and
926 @code{-l} options first to generate only a loop nest with internal
927 guards). For instance, with the input file @code{test/union.cloog}, a user
928 can generate different pseudo-codes as shown below.
932 /* Generated using test/union.cloog and @strong{option -f -1 -l 2 -override} */
933 for (i=0;i<=11;i++) @{
934 for (j=max(0,5*i-50);j<=min(15,5*i+10);j++) @{
935 if ((i <= 10) && (j <= 10)) @{
938 if ((i >= 1) && (j >= 5)) @{
947 /* Generated using the same input file but @strong{option -sh 1 -f -1 -l 2 -override} */
948 for (i=0;i<=11;i++) @{
949 for (j=0;j<=15;j++) @{
950 if ((i <= 10) && (j <= 10)) @{
953 if ((i >= 1) && (j >= 5)) @{
961 @node Once Time Loop Elimination
962 @subsection Once Time Loop Elimination @code{-otl <boolean>}
964 @code{-otl <boolean>}: this option allows (@code{boolean=1}) or
965 forbids (@code{boolean=0}) the simplification of loops running
966 once. Default value is 1.
969 /* Generated using a given input file and @strong{option -otl 0} */
970 for (j=i+1;j<=i+1;j++) @{
977 /* Generated using the same input file but @strong{option -otl 1} */
984 @node Equality Spreading
985 @subsection Equality Spreading @code{-esp <boolean>}
987 @code{-esp <boolean>}: this option allows (@code{boolean=1}) or
988 forbids (@code{boolean=0}) values spreading when there
989 are equalities. Default value is 1.
992 /* Generated using a given input file and @strong{option -esp 0} */
995 for (k=i;k<=j+M;k++) @{
1002 /* Generated using the same input file but @strong{option -esp 1} */
1003 for (k=M+2;k<=N+M;k++) @{
1004 S1(i = M+2, j = N) ;
1010 @node First Level for Spreading
1011 @subsection First Level for Spreading @code{-fsp <level>}
1013 @code{-fsp <level>}: it can be useful to set a
1014 first level to begin equality spreading. Particularly when using
1015 scattering functions, the user may want to see the scattering dimension
1016 values instead of spreading or hiding them. If user has set a
1017 spreading, @code{level} is
1018 the first level to start it. Default value is 1.
1021 /* Generated using a given input file and @strong{option -fsp 1} */
1022 for (j=0;j<=N+M;j++) @{
1025 for (j=0;j<=N+M;j++) @{
1032 /* Generated using the same input file but @strong{option -fsp 2} */
1034 for (j=0;j<=c1+M;j++) @{
1038 for (j=0;j<=N+c1;j++) @{
1045 @node Statement Block
1046 @subsection Statement Block @code{-block <boolean>}
1048 @code{-block <boolean>}: this option allows (@code{boolean=1}) to
1049 create a statement block for each new iterator, even if there is only
1050 an equality. This can be useful in order to parse the generated
1051 pseudo-code. When @code{boolean} is set to 0 or when the generation
1052 language is FORTRAN, this feature is disabled. Default value is 0.
1055 /* Generated using a given input file and @strong{option -block 0} */
1063 /* Generated using the same input file but @strong{option -block 1} */
1074 @subsection Loop Strides @code{-strides <boolean>}
1076 @code{-strides <boolean>}: this options allows (@code{boolean=1}) to
1077 handle non-unit strides for loop increments. This can remove a lot of
1078 guards and make the generated code more efficient. Default value is 0.
1081 /* Generated using a given input file and @strong{option -strides 0} */
1082 for (i=1;i<=n;i++) @{
1094 /* Generated using the same input file but @strong{option -strides 1} */
1095 for (i=2;i<=n;i+=2) @{
1104 @node Compilable Code
1105 @subsection Compilable Code @code{-compilable <value>}
1107 @code{-compilable <value>}: this options allows (@code{value} is not 0)
1108 to generate a compilable code where all parameters have the integral value
1109 @code{value}. This option creates a macro for each statement. Since
1110 CLooG do not know anything about the statement sources, it fills the
1111 macros with a basic increment that computes the total number of
1112 scanned integral points. The user may change easily the macros according
1113 to his own needs. This option is possible only if the generated code is
1114 in C. Default value is 0.
1117 /* Generated using a given input file and @strong{option -compilable 0} */
1118 for (i=0;i<=n;i++) @{
1119 for (j=0;j<=n;j++) @{
1128 /* Generated using the same input file but @strong{option -compilable 10} */
1129 /* DON'T FORGET TO USE -lm OPTION TO COMPILE. */
1131 /* Useful headers. */
1136 /* Parameter value. */
1139 /* Statement macros (please set). */
1140 #define S1(i,j) @{total++;@}
1141 #define S2(i,j) @{total++;@}
1142 #define S3(i) @{total++;@}
1145 /* Original iterators. */
1148 int n=PARVAL, total=0 ;
1150 for (i=0;i<=n;i++) @{
1151 for (j=0;j<=n;j++) @{
1158 printf("Number of integral points: %d.\n",total) ;
1164 @subsection Callable Code @code{-callable <boolean>}
1166 @code{-callable <boolean>}: if @code{boolean=1}, then a @code{test}
1167 function will be generated that has the parameters as arguments.
1168 Similarly to the @code{-compilable} option,
1169 a macro for each statement is generated. The generated definitions of
1170 these macros are as used during the correctness testing, but they
1171 can easily be changed by the user to suit her own needs.
1172 This option is only available if the target language is C.
1173 The default value is 0.
1176 /* Generated from double.cloog with @strong{option -callable 0} */
1177 for (i=0;i<=M;i++) @{
1179 for (j=0;j<=N;j++) @{
1187 /* Generated from double.cloog with @strong{option -callable 1} */
1188 extern void hash(int);
1190 /* Useful macros. */
1191 #define floord(n,d) (((n)<0) ? ((n)-(d)+1)/(d) : (n)/(d))
1192 #define ceild(n,d) (((n)<0) ? (n)/(d) : ((n)+(d)+1)/(d))
1193 #define max(x,y) ((x) > (y) ? (x) : (y))
1194 #define min(x,y) ((x) < (y) ? (x) : (y))
1196 #define S1(i) @{ hash(1); hash(i); @}
1197 #define S2(i,j) @{ hash(2); hash(i); hash(j); @}
1198 #define S3(i,j) @{ hash(3); hash(i); hash(j); @}
1199 #define S4(i) @{ hash(4); hash(i); @}
1201 void test(int M, int N)
1203 /* Original iterators. */
1205 for (i=0;i<=M;i++) @{
1207 for (j=0;j<=N;j++) @{
1217 @subsection Output @code{-o <output>}
1219 @code{-o <output>}: this option sets the output file. @code{stdout} is a
1220 special value: when used, output is standard output.
1221 Default value is @code{stdout}.
1224 @subsection Help @code{--help} or @code{-h}
1226 @code{--help} or @code{-h}: this option ask CLooG to print a short help.
1229 @subsection Version @code{--version} or @code{-v}
1231 @code{--version} or @code{-v}: this option ask CLooG to print some version
1235 @subsection Quiet @code{--quiet} or @code{-q}
1237 @code{--quiet} or @code{-q}: this option tells CLooG not to print
1238 any informational messages.
1241 @c %/*************************************************************************
1242 @c % * A Full Example *
1243 @c % *************************************************************************/
1245 @section A Full Example
1247 Let us consider the allocation problem of a Gaussian elimination, i.e. we want
1248 to distribute the various statement instances of the compute kernel onto
1249 different processors. The original code is the following:
1252 for (i=1;j<=N-1;i++) @{
1253 for (j=i+1;j<=N;j++) @{
1254 c[i][j] = a[j][i]/a[i][i] ; /* S1 */
1255 for (k=i+1;k<=N;k++) @{
1256 a[j][k] -= c[i][j]*a[i][k] ; /* S2 */
1263 @noindent The best affine allocation functions can be found by any good automatic
1264 parallelizer like LooPo (@pxref{Gri04}):
1268 \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i)$\cr
1269 \theta _{S2}(i,j,k)^T &$= (k)$}$}
1282 @noindent To ensure that on each processor, the set of statement instances is
1283 executed according to the original ordering, we add as minor scattering
1284 dimensions the original scheduling (@pxref{Scattering}):
1288 \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i,0,i,0,j,0)^T$\cr
1289 \theta _{S2}(i,j,k)^T &$= (k,0,i,0,j,1,k,0)^T$}$}
1296 T_S1(i,j)^T = (i,0,i,0,j,0)^T
1297 T_S2(i,j,k)^T = (k,0,i,0,j,1,k,0)^T
1302 @noindent To ensure that the scattering functions have the same dimensionality, we
1303 complete the first function with zeroes
1304 (this is a CLooG @value{VERSION} and previous versions requirement,
1305 it should be removed in a future version, don't worry it's absolutely legal !):
1309 \hbox{$ \cases{ \theta _{S1}(i,j)^T &$= (i,0,i,0,j,0,0,0)^T$\cr
1310 \theta _{S2}(i,j,k)^T &$= (k,0,i,0,j,1,k,0)^T$}$}
1317 T_S1(i,j)^T = (i,0,i,0,j,0,0,0)^T
1318 T_S2(i,j,k)^T = (k,0,i,0,j,1,k,0)^T
1323 @noindent The input file corresponding to this code generation problem
1324 could be (this file is provided in the CLooG distribution
1325 as @code{test/manual_gauss.cloog}:
1328 # ---------------------- CONTEXT ----------------------
1331 # Context (no constraints on one parameter)
1332 1 3 # 1 line and 3 columns
1334 1 0 0 # 0 >= 0, always true
1336 1 # We want to set manually the parameter name
1339 # --------------------- STATEMENTS --------------------
1340 2 # Number of statements
1342 1 # First statement: one domain
1343 4 5 # 4 lines and 3 columns
1346 1 -1 0 1 -1 # i <= n-1
1347 1 -1 1 0 -1 # j >= i+1
1349 0 0 0 # for future options
1352 # Second statement: one domain
1353 6 6 # 6 lines and 3 columns
1355 1 1 0 0 0 -1 # i >= 1
1356 1 -1 0 0 1 -1 # i <= n-1
1357 1 -1 1 0 0 -1 # j >= i+1
1358 1 0 -1 0 1 0 # j <= n
1359 1 -1 0 1 0 -1 # k >= i+1
1360 1 0 0 -1 1 0 # k <= n
1361 0 0 0 # for future options
1363 0 # We let CLooG set the iterator names
1365 # --------------------- SCATTERING --------------------
1366 2 # Scattering functions
1368 8 13 # 3 lines and 3 columns
1369 # eq/in p1 p2 p3 p4 p5 p6 p7 p8 i j n 1
1370 0 1 0 0 0 0 0 0 0 -1 0 0 0 # p1 = i
1371 0 0 1 0 0 0 0 0 0 0 0 0 0 # p2 = 0
1372 0 0 0 1 0 0 0 0 0 -1 0 0 0 # p3 = i
1373 0 0 0 0 1 0 0 0 0 0 0 0 0 # p4 = 0
1374 0 0 0 0 0 1 0 0 0 0 -1 0 0 # p5 = j
1375 0 0 0 0 0 0 1 0 0 0 0 0 0 # p6 = 0
1376 0 0 0 0 0 0 0 1 0 0 0 0 0 # p7 = 0
1377 0 0 0 0 0 0 0 0 1 0 0 0 0 # p8 = 0
1379 8 14 # 3 lines and 3 columns
1380 # eq/in p1 p2 p3 p4 p5 p6 p7 p8 i j k n 1
1381 0 1 0 0 0 0 0 0 0 0 0 -1 0 0 # p1 = k
1382 0 0 1 0 0 0 0 0 0 0 0 0 0 0 # p2 = 0
1383 0 0 0 1 0 0 0 0 0 -1 0 0 0 0 # p3 = i
1384 0 0 0 0 1 0 0 0 0 0 0 0 0 0 # p4 = 0
1385 0 0 0 0 0 1 0 0 0 0 -1 0 0 0 # p5 = j
1386 0 0 0 0 0 0 1 0 0 0 0 0 0 -1 # p6 = 1
1387 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 # p7 = k
1388 0 0 0 0 0 0 0 0 1 0 0 0 0 0 # p8 = 0
1390 1 # We want to set manually the scattering dimension names
1391 p1 p2 p3 p4 p5 p6 p7 p8 # scattering dimension names
1394 Calling CLooG, with for instance the command line
1395 @code{cloog -fsp 2 gauss.cloog} for a better view
1396 of the allocation (the processor number is given by @code{p1}),
1397 will result on the following target code that actually implements
1398 the transformation. A minor processing on the dimension @code{p1}
1399 to implement, e.g., MPI calls, which is not shown here may
1400 result in dramatic speedups !
1405 for (p5=2;p5<=n;p5++) @{
1409 for (p1=2;p1<=n-1;p1++) @{
1410 for (p3=1;p3<=p1-1;p3++) @{
1411 for (p5=p3+1;p5<=n;p5++) @{
1412 S2(i = p3,j = p5,k = p1) ;
1415 for (p5=p1+1;p5<=n;p5++) @{
1421 for (p3=1;p3<=n-1;p3++) @{
1422 for (p5=p3+1;p5<=n;p5++) @{
1423 S2(i = p3,j = p5,k = n) ;
1430 @c %/*************************************************************************
1431 @c % * A Full Example *
1432 @c % *************************************************************************/
1434 @chapter Using the CLooG Library
1435 The CLooG Library was implemented to allow the user to call CLooG
1436 directly from his programs, without file accesses or system calls. The
1437 user only needs to link his programs with C libraries. The CLooG
1438 library mainly provides one function (@code{cloog_program_generate})
1439 which takes as input the problem
1440 description with some options, and returns the data structure corresponding
1441 to the generated code (a @code{CloogProgram} structure) which is more or less
1442 an abstract syntax tree.
1443 The user can work with this data structure and/or use
1444 our pretty printing function to write the final code in either C or FORTRAN.
1445 Some other functions are provided for convenience reasons.
1446 These functions as well as the data structures are described in this section.
1449 * CLooG Data Structures::
1452 * Example of Library Utilization::
1456 @node CLooG Data Structures
1457 @section CLooG Data Structures Description
1458 In this section, we describe the data structures used by the loop
1459 generator to represent and to process a code generation problem.
1466 * CloogScatteringList::
1478 @subsection CloogState
1481 CloogState *cloog_state_malloc(void);
1482 void cloog_state_free(CloogState *state);
1486 @noindent The @code{CloogState} structure is (implicitly) needed to perform
1487 any CLooG operation. It should be created using @code{cloog_state_malloc}
1488 before any other CLooG objects are created and destroyed using
1489 @code{cloog_state_free} after all objects have been freed.
1490 It is allowed to use more than one @code{CloogState} structure at
1491 the same time, but an object created within the state of a one
1492 @code{CloogState} structure is not allowed to interact with an object
1493 created within the state of an other @code{CloogState} structure.
1497 @subsection CloogMatrix
1499 @noindent The @code{CloogMatrix} structure is equivalent to the PolyLib
1500 @code{Matrix} data structure (@pxref{Wil93}). This structure is devoted to
1501 represent a set of constraints.
1506 @{ unsigned NbRows ; /* Number of rows. */
1507 unsigned NbColumns ; /* Number of columns. */
1508 cloog_int_t **p; /* Array of pointers to the matrix rows. */
1509 cloog_int_t *p_Init; /* Matrix rows contiguously in memory. */
1511 typedef struct cloogmatrix CloogMatrix;
1515 @noindent The whole matrix is stored in memory row after row at the
1516 @code{p_Init} address. @code{p} is an array of pointers where
1517 @code{p[i]} points to the first element of the @math{i^{th}} row.
1518 @code{NbRows} and @code{NbColumns} are respectively the number of
1519 rows and columns of the matrix.
1520 Each row corresponds to a constraint. The first element of each row is an
1521 equality/inequality tag. The
1522 constraint is an equality @math{p(x) = 0} if the first element is 0, but it is
1523 an inequality @math{p(x) \geq 0} if the first element is 1.
1524 The next elements are the coefficients of the unknowns,
1525 followed by the coefficients of the parameters, and finally the constant term.
1526 For instance, the following three constraints:
1530 \hbox{$ \cases{ -i + m &$= 0$\cr
1532 j + i - k &$\geq 0$}$}
1546 @noindent would be represented by the following rows:
1550 # eq/in i j k m n cst
1557 @noindent To be able to provide different precision version (CLooG
1558 supports 32 bits, 64 bits and arbitrary precision through the GMP library),
1559 the @code{cloog_int_t} type depends on the configuration options (it may be
1560 @code{long int} for 32 bits version, @code{long long int} for 64 bits version,
1561 and @code{mpz_t} for multiple precision version).
1564 @subsection CloogDomain
1567 CloogDomain *cloog_domain_union_read(CloogState *state,
1568 FILE *input, int nb_parameters);
1569 void cloog_domain_free(CloogDomain *domain);
1573 @noindent @code{CloogDomain} is an opaque type representing a polyhedral
1574 domain (a union of polyhedra).
1575 A @code{CloogDomain} can be read
1576 from a file using @code{cloog_domain_union_read}.
1577 The input format is that of @ref{Domain Representation}.
1578 The @code{CloogDomain} can be freed using @code{cloog_domain_free}.
1579 There are also some backend dependent functions for creating
1580 @code{CloogDomain}s.
1583 * CloogDomain/PolyLib::
1587 @node CloogDomain/PolyLib
1588 @subsubsection PolyLib
1591 #include <cloog/polylib/cloog.h>
1592 CloogDomain *cloog_domain_from_polylib_polyhedron(CloogState *state,
1593 Polyhedron *, int nb_par);
1596 The function @code{cloog_domain_from_polylib_polyhedron} takes a PolyLib
1597 @code{Polyhedron} as input and returns a pointer to a @code{CloogDomain}.
1598 The @code{nb_par} parameter indicates the number of parameters
1599 in the domain. The input data structure if neither modified nor freed.
1601 @node CloogDomain/isl
1605 #include <cloog/isl/cloog.h>
1606 CloogDomain *cloog_domain_from_isl_set(struct isl_set *set);
1609 The function @code{cloog_domain_from_isl_set} takes a
1610 @code{struct isl_set} as input and returns a pointer to a @code{CloogDomain}.
1611 The function consumes a reference to the given @code{struct isl_set}.
1614 @node CloogScattering
1615 @subsection CloogScattering
1618 CloogScattering *cloog_domain_read_scattering(CloogDomain *domain,
1620 void cloog_scattering_free(CloogScattering *);
1625 The @code{CloogScattering} type represents a scattering function.
1626 A @code{CloogScattering} for a given @code{CloogDomain} can be read
1627 from a file using @code{cloog_scattering_read}.
1628 It can be freed using @code{cloog_scattering_free}.
1629 There are also some backend dependent functions for creating
1630 @code{CloogScattering}s.
1633 * CloogScattering/PolyLib::
1634 * CloogScattering/isl::
1638 @node CloogScattering/PolyLib
1639 @subsubsection PolyLib
1642 #include <cloog/polylib/cloog.h>
1643 CloogScattering *cloog_scattering_from_polylib_polyhedron(
1644 CloogState *state, Polyhedron *polyhedron, int nb_par);
1647 The function @code{cloog_scattering_from_polylib_polyhedron} takes a PolyLib
1648 @code{Polyhedron} as input and returns a pointer to a @code{CloogScattering}.
1649 The @code{nb_par} parameter indicates the number of parameters
1650 in the domain. The input data structure if neither modified nor freed.
1652 @node CloogScattering/isl
1656 #include <cloog/isl/cloog.h>
1657 CloogScattering *cloog_scattering_from_isl_map(struct isl_map *map);
1660 The function @code{cloog_scattering_from_isl_map} takes a
1661 @code{struct isl_map} as input and returns a pointer to a @code{CloogScattering}.
1662 The input dimensions of the @code{struct isl_map} correspond to the
1663 scattering dimensions, while the output dimensions correspond to the
1665 The function consumes a reference to the given @code{struct isl_map}.
1668 @node CloogScatteringList
1669 @subsection CloogScatteringList
1672 struct cloogscatteringlist @{
1673 CloogScattering *scatt;
1674 struct cloogscatteringlist *next;
1676 typedef struct cloogscatteringlist CloogScatteringList;
1680 @noindent The CloogScatteringList structure represents
1681 a @code{NULL} terminated linked list of scattering functions.
1684 @node CloogStatement
1685 @subsection CloogStatement
1688 struct cloogstatement
1689 @{ int number ; /* The statement unique number. */
1690 void * usr ; /* Pointer for user's convenience. */
1691 struct cloogstatement * next ;/* Next element of the linked list. */
1693 typedef struct cloogstatement CloogStatement ;
1697 @noindent The @code{CloogStatement} structure represents a @code{NULL}
1699 list of statements. In CLooG, a statement is only defined by its unique
1700 number (@code{number}). The user can use the pointer @code{usr} for his
1701 own convenience to link his own statement representation to the
1702 corresponding @code{CloogStatement} structure. The whole management of the
1703 @code{usr} pointer is under the responsibility of the user, in particular,
1704 CLooG never tries to print, to allocate or to free a memory block pointed
1709 @subsection CloogBlock
1713 @{ CloogStatement * statement ; /* Statement list of the block. */
1714 CloogMatrix * scattering ; /* Scattering function of the block. */
1715 int depth ; /* Original block depth.*/
1716 void * usr; /* Pointer for user's convenience. */
1718 typedef struct cloogblock CloogBlock ;
1722 @noindent The @code{CloogBlock} structure represents a statement block.
1723 In a statement block, every statements have the same iteration
1724 domain and the same scattering function (actually, the scattering
1725 functions may differ only by a scalar
1726 coefficient if it just precises the ordering of the statements within
1727 the block). @code{statement} is the statement list where the
1728 statement order matters, @code{scattering} is one of
1729 the statement scattering functions and
1730 @code{depth} is the number of dimensions of the
1731 iteration domain (only the unknown, not the tag/parameters/scalar).
1732 @code{usr} is a pointer for library user's convenience. Note this pointer
1733 is never allocated, freed or printed by CLooG.
1735 @node CloogBlockList
1736 @subsection CloogBlockList
1739 struct cloogdblocklist
1740 @{ CloogBlock * block ;
1741 struct cloogblocklist * next ;
1743 typedef struct cloogblocklist CloogBlockList ;
1747 @noindent The CloogBlockList structure represents a @code{NULL} terminated linked list
1752 @subsection CloogLoop
1756 @{ CloogDomain * domain; /* Iteration domain. */
1757 Value stride ; /* Loop stride. */
1758 CloogBlock * block ; /* Included statement block.*/
1759 void * usr; /* Pointer for user's convenience. */
1760 struct cloogloop * inner ; /* Loop at the next level. */
1761 struct cloogloop * next ; /* Next loop at the same level. */
1763 typedef struct cloogloop CloogLoop ;
1767 @noindent The @code{CloogLoop} structure represents a loop.
1769 loop has an iteration domain (@code{domain}). The iterator's stride for loop
1770 increment is @code{stride}. The loop can include a statement block
1771 in the field @code{block}. If there is no included statement block,
1772 @code{block} is set to @code{NULL}. @code{usr} is a pointer for library
1773 user's convenience. Note that this pointer is never allocated, freed or
1774 printed by CLooG. @code{inner} is a pointer to the inner
1775 loop, and @code{next} a pointer to the next loop in the textual order. If
1776 there are no inner loop or no next loop, the corresponding pointer is set
1781 @subsection CloogNames
1785 @{ int nb_scattering ; /* Scattering dimension number. */
1786 int nb_iterators ; /* Iterator number. */
1787 int nb_parameters ; /* Parameter number. */
1788 char ** scattering ; /* The scattering dimension names. */
1789 char ** iterators ; /* The iterator names. */
1790 char ** parameters ; /* The parameter names. */
1792 typedef struct cloognames CloogNames ;
1796 @noindent The @code{CloogNames} structure represents the scattering dimension,
1797 the iterator and the parameter names in the final program.
1798 @code{nb_scattering}
1799 (respectively @code{nb_iterators} and @code{nb_parameters})
1800 is the number of scattering dimensions number
1801 (respectively the iterator and parameter number)
1802 and of elements in the corresponding array of strings
1804 (respectively @code{iterators} and @code{parameters}).
1805 The @math{i^{th}} scattering dimension name will be associated with the
1806 to the dimension @math{i} of the scattering function.
1807 The @math{i^{th}} iterator name will be associated with the
1808 dimension @math{i} of the iteration domain.
1809 The @math{i^{th}} parameter name will be associated with the
1810 dimension @math{i} of the context polyhedron.
1811 The user has to ensure that there are
1812 enough scattering dimension, iterator and parameter names.
1816 @subsection CloogProgram
1820 @{ char language ; /* The language of the program. */
1821 int nb_scattdims ; /* Scattering dimension number. */
1822 CloogNames * names ; /* Iterators and parameters names. */
1823 CloogDomain * context ; /* The context of the program. */
1824 CloogLoop * loop ; /* The loops of the program. */
1825 CloogBlockList * blocklist ; /* The statement block list. */
1826 void * usr; /* For library user's convenience. */
1828 typedef struct cloogprogram CloogProgram ;
1832 @noindent The @code{CloogProgram} structure represents a static control program kernel.
1833 @code{language} precises the language (@code{c} for C or @code{f} for FORTRAN).
1834 @code{nb_scattdims} gives the number of scattering dimensions.
1835 @code{context} is a pointer to the constraints on the program parameters,
1837 @code{NULL} pointer even if there are no constraints on parameters. In such a
1838 case, set a polyhedron with as many dimensions as there are parameters, with
1839 an @emph{always true} constraint like @math{1 \geq 0} (this is necessary
1840 since the number of parameters is deduced from the dimension number of
1841 the context constraints). @code{loop} is a pointer
1842 to the first loop of the program. @code{names} is a pointer to the various
1843 element names (scattering dimension, iterators, parameters)
1844 of the final program. @code{names} can be the @code{NULL}
1845 pointer if the user do not want to use our pretty printing function.
1846 @code{blocklist} is the linked list of all the statement block structures.
1847 @code{usr} is a pointer for library user's convenience. Note that this pointer
1848 is never allocated, freed or printed by CLooG.
1849 As an example, let us consider the following loop nest:
1852 for (i=0; i<=n; i++) @{
1853 for (j=0; j<=n; j++) @{
1857 for (j=n+1; j<=2*n; j++) @{
1863 @noindent The next figure gives a possible representation in memory for this
1864 program thanks to the CLooG data structures (it has been actually printed
1865 by the @code{cloog_program_print} function). In this figure,
1866 @samp{+-- CloogLoop} denotes an @samp{inner} loop, while a @samp{CloogLoop}
1867 on the same column pointed by an arrow denotes a @samp{next} loop:
1874 | Scattering dimension number: 0
1878 | | Scattering dimension number: 0
1880 | | +-- No scattering string
1882 | | Iterator number -----------: 2
1884 | | +-- Iterator strings ------: i j
1886 | | Parameter number ----------: 1
1888 | | +-- Parameter strings -----: n
1903 | | +-- Null CloogBlock
1907 | | | +-- CloogDomain
1908 | | | | [ 1 0 1 0 0 ]
1909 | | | | [ 1 0 -1 1 0 ]
1910 | | | | [ 1 0 0 0 1 ]
1914 | | | +-- Null CloogBlock
1918 | | | | +-- CloogDomain
1919 | | | | | [ 1 0 0 0 1 ]
1923 | | | | +-- CloogBlock
1925 | | | | | +-- CloogStatement 1
1928 | | | | | | CloogStatement 2
1930 | | | | | +-- Null scattering function
1938 | | | +-- CloogDomain
1939 | | | | [ 1 0 -1 2 0 ]
1940 | | | | [ 1 0 1 -1 -1 ]
1941 | | | | [ 1 0 0 0 1 ]
1945 | | | +-- Null CloogBlock
1949 | | | | +-- CloogDomain
1950 | | | | | [ 1 0 0 0 1 ]
1954 | | | | +-- CloogBlock
1956 | | | | | +-- CloogStatement 3
1958 | | | | | +-- Null scattering function
1970 @subsection CloogOptions
1974 @{ int l ; /* -l option. */
1975 int f ; /* -f option. */
1976 int strides ; /* -strides option. */
1977 int sh ; /* -sh option. */
1978 int esp ; /* -esp option. */
1979 int fsp ; /* -fsp option. */
1980 int otl ; /* -otl option. */
1981 int block ; /* -block option. */
1982 int cpp ; /* -cpp option. */
1983 int compilable ; /* -compilable option. */
1985 typedef struct cloogoptions CloogOptions ;
1989 @noindent The @code{CloogOptions} structure contains all the possible options to
1990 rule CLooG's behaviour (@pxref{Calling CLooG}).
1991 As a reminder, the default values are:
1993 @item @math{l = -1} (optimize control until the innermost loops),
1994 @item @math{f = 1} (optimize control from the outermost loops),
1995 @item @math{strides = 0} (use only unit strides),
1996 @item @math{sh = 0} (do not simplify convex hulls),
1997 @item @math{esp = 1} (do not spread complex equalities),
1998 @item @math{fsp = 1} (start to spread from the first iterators),
1999 @item @math{otl = 1} (simplify loops running only once).
2000 @item @math{block = 0} (do not make statement blocks when not necessary).
2001 @item @math{cpp = 0} (do not generate a compilable part of code using preprocessor).
2002 @item @math{compilable = 0} (do not generate a compilable code).
2006 @node CLooG Functions
2007 @section CLooG Functions Description
2010 * cloog_program_generate::
2011 * cloog_program_scatter::
2012 * cloog_program_pprint::
2013 * cloog_program_read::
2014 * Allocation and Initialization Functions::
2015 * Memory Deallocation Functions::
2016 * Printing Functions::
2020 @node cloog_program_generate
2021 @subsection cloog_program_generate
2024 CloogProgram * cloog_program_generate
2025 ( CloogProgram * program, /* Input program. */
2026 CloogOptions * options /* Options. */
2031 @noindent The @code{cloog_program_generate} function generates
2032 the data structure of the source code that scans the input
2033 polyhedra pointed by @code{program}
2034 according to the options pointed by @code{options}.
2035 The process is made directly on the input structure pointed by
2036 @code{program}, thus the original structure is no longer available
2037 after a call to this function. It returns a pointer to a
2038 @code{CloogProgram} structure containing the
2039 solution in CLooG structures.
2041 The input @code{CloogProgram} structure must have only one loop level
2042 (no inner loops): there is one loop per statement block. For a given block,
2043 the corresponding loop carries the iteration domain, the statement block,
2044 and a loop stride initialized to 1. For instance, the input @code{CloogProgram} structure
2045 that have been sent to @code{cloog_program_generate} to achieve the final
2046 structure and code shown as example in the @code{CloogProgram} structure
2047 description (@pxref{CloogProgram}) was the following one:
2054 | Scattering dimension number: 0
2058 | | Scattering dimension number: 0
2060 | | +-- No scattering string
2062 | | Iterator number -----------: 2
2064 | | +-- Iterator strings ------: i j
2066 | | Parameter number ----------: 1
2068 | | +-- Parameter strings -----: n
2077 | | | [ 1 -1 0 1 0 ]
2079 | | | [ 1 0 -1 1 0 ]
2085 | | | +-- CloogStatement 1
2088 | | | | CloogStatement 2
2090 | | | +-- Null scattering function
2099 | | | [ 1 -1 0 1 0 ]
2100 | | | [ 1 0 1 -1 -1 ]
2101 | | | [ 1 0 -1 2 0 ]
2107 | | | +-- CloogStatement 3
2109 | | | +-- Null scattering function
2118 @node cloog_program_pprint
2119 @subsection cloog_program_pprint
2122 void cloog_program_pprint
2123 ( FILE * file, /* Output file. */
2124 CloogProgram * program, /* Program to print. */
2125 CloogOptions * options /* Options. */
2130 @noindent The function @code{cloog_program_pprint} is a pretty printer for
2131 @code{CloogProgram} structures when it is a solution provided by
2132 the @code{cloog_program_generate} function. It prints the code or pseudo-code in the
2133 file pointed by @code{file} (possibly @code{stdout}) with regards to the
2134 options pointed by @code{options}.
2137 @node cloog_program_scatter
2138 @subsection cloog_program_scatter
2141 void cloog_program_scatter(
2142 CloogProgram *program, /* Input program. */
2143 CloogScatteringList *scatt, /* Additional scattering functions. */
2144 CloogOptions *options /* Options. */
2149 @noindent The function @code{cloog_program_scatter} applies scattering
2150 functions to the @code{CloogProgram} structure pointed by @code{program}.
2151 Original domains of @code{program} are freed. Scattering functions
2152 are inside the @code{CloogScatteringList} structure pointed by @code{scattering}.
2153 There must be as many scattering functions in the @code{CloogScatteringList}
2154 structure as loops (i.e. iteration domains) in the @code{CloogProgram}
2155 structure. The first scattering function of the list will be applied to the
2156 iteration domain of the first loop in the program, and so on.
2157 @code{names} gives the scattering dimension names as an array of strings. If
2158 @code{names} is @code{NULL}, names are automatically generated: the name of
2159 the @math{n^{th}} scattering dimension will be @code{cn}.
2162 @node cloog_program_read
2163 @subsection cloog_program_read
2165 CloogProgram * cloog_program_read(FILE *) ;
2167 @noindent The @code{cloog_program_read} function
2168 reads the program data from a CLooG input file
2169 (@pxref{Writing The Input File}). It takes
2170 as input a pointer to the file it has to read (possibly @code{stdin}), and
2171 return a pointer to the read @code{CloogProgram} structure.
2174 @node Allocation and Initialization Functions
2175 @subsection Allocation and Initialization Functions
2177 CloogStructure * cloog_structure_malloc() ;
2179 @noindent Each CLooG data structure has an allocation and initialization
2180 function as shown above, where @code{Structure} and @code{structure} have to
2181 be replaced by the name of the convenient structure (without @samp{Cloog} prefix) for
2182 instance @code{CloogLoop * cloog_loop_malloc() ;}. These functions return
2183 pointers to an allocated structure with fields set to convenient default
2184 values. @strong{Using those functions is mandatory} to support internal
2185 management fields and to avoid upward compatibility problems if
2186 new fields appear. An exception is @code{cloog_matrix_malloc} since the
2187 @code{CloogMatrix} comes directly from the PolyLib. It takes two parameters:
2188 the number of rows and columns of the matrix we want to allocate:
2190 CloogMatrix * cloog_matrix_malloc(unsigned nbrows, unsigned nbcolumns);
2194 @node Memory Deallocation Functions
2195 @subsection Memory Deallocation Functions
2197 void cloog_structure_free(CloogStructure *) ;
2199 @noindent Each CLooG data structure has a deallocation function as shown above,
2200 where @code{Structure} and @code{structure} have to
2201 be replaced by the name of the convenient structure (without @samp{Cloog} prefix) for
2202 instance @code{void cloog_loop_free(CloogLoop *) ;}. These functions
2203 free the allocated memory for the structure provided as input. They free
2204 memory recursively, i.e. they also free the allocated memory for the internal
2206 @strong{Using those functions is mandatory} to avoid memory leaks on internal
2207 management fields and to avoid upward compatibility problems if
2211 @node Printing Functions
2212 @subsection Printing Functions
2214 void cloog_structure_print(FILE *, CloogStructure *) ;
2216 @noindent Each CLooG data structure has a printing function as shown above,
2217 where @code{Structure} and @code{structure} have to
2218 be replaced by the name of the convenient structure (without @samp{Cloog} prefix) for
2219 instance @code{void cloog_loop_print(FILE *, CloogLoop *) ;}. These functions
2220 print the pointed structure (and its fields recursively) to the file provided
2221 as input (possibly @code{stdout}).
2225 @section CLooG Output
2228 Given a @code{CloogProgram} for scanning the input polyhedra,
2229 computed using @code{cloog_program_generate}
2230 (@pxref{cloog_program_generate}),
2231 an AST corresponding to the @code{CloogProgram} can be constructed
2232 using @code{cloog_clast_create} and destroyed using
2233 @code{free_clast_stmt}.
2235 struct clast_stmt *cloog_clast_create(CloogProgram *program,
2236 CloogOptions *options);
2237 void free_clast_stmt(struct clast_stmt *s);
2240 @code{clast_stmt} represents a linked list of ``statements''.
2242 struct clast_stmt @{
2243 const struct clast_stmt_op *op;
2244 struct clast_stmt *next;
2248 The entries in the list are not of type @code{clast_stmt} itself,
2249 but of some larger type. The following statement types are defined
2253 struct clast_root @{
2254 struct clast_stmt stmt;
2257 struct clast_root *new_clast_root(CloogNames *names);
2259 struct clast_assignment @{
2260 struct clast_stmt stmt;
2262 struct clast_expr * RHS;
2264 struct clast_assignment *new_clast_assignment(const char *lhs,
2265 struct clast_expr *rhs);
2267 struct clast_block @{
2268 struct clast_stmt stmt;
2269 struct clast_stmt * body;
2271 struct clast_block *new_clast_block(void);
2273 struct clast_user_stmt @{
2274 struct clast_stmt stmt;
2275 CloogStatement * statement;
2276 struct clast_stmt * substitutions;
2278 struct clast_user_stmt *new_clast_user_stmt(CloogStatement *stmt,
2279 struct clast_stmt *subs);
2282 struct clast_stmt stmt;
2283 const char * iterator;
2284 struct clast_expr * LB;
2285 struct clast_expr * UB;
2287 struct clast_stmt * body;
2289 struct clast_for *new_clast_for(const char *it, struct clast_expr *LB,
2290 struct clast_expr *UB, cloog_int_t stride);
2292 struct clast_guard @{
2293 struct clast_stmt stmt;
2294 struct clast_stmt * then;
2296 struct clast_equation eq[1];
2298 struct clast_guard *new_clast_guard(int n);
2301 The @code{clast_stmt} returned by @code{cloog_clast_create}
2302 is a @code{clast_root}.
2303 It contains a placeholder for all the variable names that appear
2304 in the AST and a (list of) nested statement(s).
2307 A @code{clast_assignment} assigns the value given by
2308 the @code{clast_expr} @code{RHS} to a variable named @code{LHS}.
2311 A @code{clast_block} groups a list of statements into one statement.
2312 These statements are only generated if the @code{block} option is set,
2313 @pxref{Statement Block} and @ref{CloogOptions}.
2316 A @code{clast_user_stmt} represents a call to a statement specified
2317 by the user, @pxref{CloogStatement}.
2318 @code{substitutions} is a list of @code{clast_assignment} statements
2319 assigning an expression in terms of the scattering dimensions to
2320 each of the original iterators in the original order.
2321 The @code{LHS}s of these assignments are left blank (@code{NULL}).
2324 A @code{clast_for} represents a for loop, iterating @code{body} for each
2325 value of @code{iterator} between @code{LB} and @code{UB} in steps
2326 of size @code{stride}.
2329 A @code{clast_guard} represents the guarded execution of the @code{then}
2330 (list of) statement(s) by a conjunction of @code{n} (in)equalities.
2331 Each (in)equality is represented by a @code{clast_equation}.
2333 struct clast_equation @{
2334 struct clast_expr * LHS;
2335 struct clast_expr * RHS;
2340 The condition expressed by a @code{clast_equation} is
2341 @code{LHS <= RHS}, @code{LHS == RHS} or @code{LHS >= RHS}
2342 depending on whether @code{sign} is less than zero, equal
2343 to zero, or greater than zero.
2345 The dynamic type of a @code{clast_stmt} can be determined
2346 using the macro @code{CLAST_STMT_IS_A(stmt,type)},
2347 where @code{stmt} is a pointer to a @code{clast_stmt}
2348 and @code{type} is one of @code{stmt_root}, @code{stmt_ass},
2349 @code{stmt_user}, @code{stmt_block}, @code{stmt_for} or
2351 Users are allowed to define their own statement types by
2352 assigning the @code{op} field of the statements a pointer
2353 to a @code{clast_stmt_op} structure.
2355 struct clast_stmt_op @{
2356 void (*free)(struct clast_stmt *);
2360 The @code{free} field of this structure should point
2361 to a function that frees the user defined statement.
2364 A @code{clast_expr} can be an identifier, a term,
2365 a binary expression or a reduction.
2367 enum clast_expr_type @{
2373 struct clast_expr @{
2374 enum clast_expr_type type;
2376 void free_clast_expr(struct clast_expr *e);
2380 Identifiers are of subtype @code{clast_name}.
2382 struct clast_name @{
2383 struct clast_expr expr;
2386 struct clast_name *new_clast_name(const char *name);
2387 void free_clast_name(struct clast_name *t);
2390 The character string pointed to by @code{name} is
2391 assumed to be part of the @code{CloogNames} structure
2392 in the root of the clast as is therefore not copied.
2395 Terms are of type @code{clast_term}.
2397 struct clast_term @{
2398 struct clast_expr expr;
2400 struct clast_expr *var;
2402 struct clast_term *new_clast_term(cloog_int_t c, struct clast_expr *v);
2403 void free_clast_term(struct clast_term *t);
2406 If @code{var} is set to @code{NULL}, then the term represents
2407 the integer value @code{val}. Otherwise, it represents
2408 the term @code{val * var}.
2409 @code{new_clast_term} simply copies the @code{v} pointer
2410 without copying the underlying @code{clast_expr}.
2411 @code{free_clast_term}, on the other hand, recursively frees
2415 Binary expressions are of type @code{clast_bin_type} and
2416 represent either the floor of a division (fdiv),
2417 the ceil of a division (cdiv), an exact division or
2418 the remainder of an fdiv.
2420 enum clast_bin_type @{ clast_bin_fdiv, clast_bin_cdiv,
2421 clast_bin_div, clast_bin_mod @};
2422 struct clast_binary @{
2423 struct clast_expr expr;
2424 enum clast_bin_type type;
2425 struct clast_expr* LHS;
2428 struct clast_binary *new_clast_binary(enum clast_bin_type t,
2429 struct clast_expr *lhs, cloog_int_t rhs);
2430 void free_clast_binary(struct clast_binary *b);
2434 Reductions are of type @code{clast_reduction} and
2435 can represent either the sum, the minimum or the maximum
2438 enum clast_red_type @{ clast_red_sum, clast_red_min, clast_red_max @};
2439 struct clast_reduction @{
2440 struct clast_expr expr;
2441 enum clast_red_type type;
2443 struct clast_expr* elts[1];
2445 struct clast_reduction *new_clast_reduction(enum clast_red_type t,
2447 void free_clast_reduction(struct clast_reduction *r);
2451 @node Example of Library Utilization
2452 @section Example of Library Utilization
2453 Here is a basic example showing how it is possible to use the CLooG library,
2454 assuming that a standard installation has been done.
2455 The following C program reads a CLooG input file on the standard input,
2456 then prints the solution on the standard output.
2457 Options are preselected to the default values of the CLooG software.
2458 This example is provided in the @code{example} directory of the
2463 # include <cloog/cloog.h>
2468 CloogProgram *program;
2469 CloogOptions * options ;
2471 /* Setting options and reading program informations. */
2472 state = cloog_state_malloc();
2473 options = cloog_options_malloc(state);
2474 program = cloog_program_read(stdin,options) ;
2476 /* Generating and printing the code. */
2477 program = cloog_program_generate(program,options) ;
2478 cloog_program_pprint(stdout,program,options) ;
2480 cloog_options_free(options) ;
2481 cloog_program_free(program) ;
2482 cloog_state_free(state);
2487 @noindent The compilation command could be:
2489 gcc example.c -lcloog -o example
2491 @noindent A calling command with the input file test.cloog could be:
2493 more test.cloog | ./example
2497 @c % ******************************** HACKING *********************************
2499 @c @chapter Hacking CLooG
2502 @c * Program organization::
2503 @c * Special Options::
2504 @c * CLooG Coding Standards::
2507 @c @node Program organization
2508 @c @section Program organization
2510 @c @node Special Options
2511 @c @section Special Options
2513 @c @node CLooG Coding Standards
2514 @c @section CLooG Coding Standards
2517 @c % ****************************** INSTALLING ********************************
2519 @chapter Installing CLooG
2524 * Basic Installation::
2525 * Optional Features::
2531 First of all, it would be very kind to refer the following paper in any
2532 publication that result from the use of the CLooG software or its library,
2533 @pxref{Bas04} (a bibtex entry is provided behind the title page of this
2534 manual, along with copyright notice, and in the CLooG home
2535 @code{http://www.CLooG.org}.
2537 This library is free software; you can redistribute it and/or
2538 modify it under the terms of the GNU Lesser General Public
2539 License as published by the Free Software Foundation; either
2540 version 2.1 of the License, or (at your option) any later version.
2541 This library is distributed in the hope that it will be useful,
2542 but WITHOUT ANY WARRANTY; without even the implied warranty of
2543 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
2544 Lesser General Public License for more details.
2545 @code{http://www.gnu.org/licenses/lgpl-2.1.html}
2547 Note, though, that if you link CLooG against a GPL library such
2548 as the PolyLib backend, then the combination becomes GPL too.
2549 In particular, a CLooG library based on the PolyLib backend
2550 is GPL version 2 only.
2551 Since the isl backend is LGPL, linking against it does not affect
2552 the license of CLooG.
2556 @section Requirements
2558 CLooG can be used with one of two possible backends,
2559 one using isl and one using PolyLib.
2560 The isl library is included in the CLooG distribution,
2561 while the PolyLib library needs to be obtained separately.
2562 On the other hand, isl requires GMP, while PolyLib can be
2563 compiled with or without the use of GMP.
2564 The user therefore needs to install at least one of
2574 @subsection PolyLib (optional)
2575 To successfully install CLooG with the PolyLib backend,
2576 the user first needs to install PolyLib
2577 version 5.22.1 or above (default 64 bits version is satisfying
2578 as well as 32 bits or GMP multiple precision version).
2579 Polylib can be downloaded freely
2580 at @code{http://icps.u-strasbg.fr/PolyLib/} or
2581 @code{http://www.irisa.fr/polylib/}. Once downloaded and unpacked
2582 (e.g. using the @samp{tar -zxvf polylib-5.22.3.tar.gz} command),
2583 the user can compile
2584 it by typing the following commands on the PolyLib's root directory:
2587 @item @code{./configure}
2589 @item And as root: @code{make install}
2592 Alternatively, the latest development version can be obtained from the
2595 @item @code{git clone git://repo.or.cz/polylib.git}
2596 @item @code{cd polylib}
2597 @item @code{./autogen.sh}
2598 @item @code{./configure}
2600 @item And as root: @code{make install}
2603 The PolyLib default installation is @code{/usr/local}. This directory may
2604 not be inside your library path. To fix the problem, the user should set
2606 export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/usr/local/lib
2608 @noindent if your shell is, e.g., bash or
2610 setenv LD_LIBRARY_PATH $LD_LIBRARY_PATH:/usr/local/lib
2612 @noindent if your shell is, e.g., tcsh. Add the line to your .bashrc or .tcshrc (or
2613 whatever convenient file) to make this change permanent. Another solution
2614 is to ask PolyLib to install in the standard path by using the prefix
2615 option of the configure script:
2616 @samp{./configure --prefix=/usr}.
2618 CLooG makes intensive calls to polyhedral operations, and PolyLib
2619 functions do the job. Polylib is a free library written in C for the
2620 manipulation of polyhedra. The library is operating on objects like
2621 vectors, matrices, lattices, polyhedra, Z-polyhedra, unions of
2622 polyhedra and a lot of other intermediary structures. It provides
2623 functions for all the important operations on these structures.
2626 @subsection GMP Library (optional)
2628 To be able to deal with insanely large coefficient, the user will need to
2629 install the GNU Multiple Precision Library (GMP for short) version 4.1.4
2630 or above. It can be freely downloaded from @code{http://www.swox.com/gmp}.
2631 Note that the isl backend currently requires GMP.
2632 The user can compile GMP by typing the following commands on the GMP root
2636 @item @code{./configure}
2638 @item And as root: @code{make install}
2641 The GMP default installation is @code{/usr/local}, the same method to
2642 fix a library path problem applies as with PolyLib (@pxref{PolyLib}).
2644 If you want to use the PolyLib backend, then
2645 PolyLib has to be built using the GMP library by specifying the option
2646 @samp{--with-libgmp=PATH_TO_GMP} to the PolyLib configure script
2647 (where @code{PATH_TO_GMP} is @code{/usr/local} if you did not change the GMP
2648 installation directory). Then you have to set the convenient CLooG configure
2649 script options to build the GMP version (@pxref{Optional Features}).
2652 @node Basic Installation
2653 @section CLooG Basic Installation
2655 Once downloaded and unpacked
2656 (e.g. using the @samp{tar -zxvf cloog-@value{VERSION}.tar.gz} command),
2657 you can compile CLooG by typing the following commands on the CLooG's root
2661 @item @code{./configure}
2663 @item And as root: @code{make install}
2666 Alternatively, the latest development version can be obtained from the
2669 @item @code{git clone git://repo.or.cz/cloog.git}
2670 @item @code{cd cloog}
2671 @item @code{./get_submodules.sh}
2672 @item @code{./autogen.sh}
2673 @item @code{./configure}
2675 @item And as root: @code{make install}
2678 Depending on which backend you want to use and where they
2679 are located, you may need to pass some
2680 options to the configure script, @pxref{Optional Features}.
2682 The program binaries and object files can be removed from the
2683 source code directory by typing @code{make clean}. To also remove the
2684 files that the @code{configure} script created (so you can compile the
2685 package for a different kind of computer) type @code{make distclean}.
2687 Both the CLooG software and library have been successfully compiled
2688 on the following systems:
2690 @item PC's under Linux, with the @code{gcc} compiler,
2691 @item PC's under Windows (Cygwin), with the @code{gcc} compiler,
2692 @item Sparc and UltraSparc Stations, with the @code{gcc} compiler.
2695 @node Optional Features
2696 @section Optional Features
2697 The @code{configure} shell script attempts to guess correct values for
2698 various system-dependent variables and user options used during compilation.
2699 It uses those values to create the @code{Makefile}. Various user options
2700 are provided by the CLooG's configure script. They are summarized in the
2701 following list and may be printed by typing @code{./configure --help} in the
2702 CLooG top-level directory.
2705 @item By default, the installation directory is @code{/usr/local}:
2706 @code{make install} will install the package's files in
2707 @code{/usr/local/bin}, @code{/usr/local/lib} and @code{/usr/local/include}.
2708 The user can specify an installation prefix other than @code{/usr/local} by
2709 giving @code{configure} the option @code{--prefix=PATH}.
2711 @item By default, the isl backend will use the version of isl
2712 that is @code{bundled} together with CLooG.
2713 Using the @code{--with-isl} option of @code{configure}
2714 the user can specify that @code{no} isl,
2715 a previously installed (@code{system}) isl or a @code{build} isl
2717 In the latter case, the user should also specify the build location
2718 using @code{--with-isl-builddir=PATH}.
2719 In case of an installed isl,
2720 the installation location can be specified using the
2721 @code{--with-isl-prefix=PATH} and
2722 @code{--with-isl-exec-prefix=PATH} options of @code{configure}.
2724 @item By default, the PolyLib backend will use an installed
2725 (@code{system}) PolyLib, if any.
2726 The installation location can be specified using the
2727 @code{--with-polylib-prefix=PATH} and
2728 @code{--with-polylib-exec-prefix=PATH} options of @code{configure}.
2729 Using the @code{--with-polylib} option of @code{configure}
2730 the user can specify that @code{no} PolyLib or a @code{build} PolyLib
2732 In the latter case, the user should also specify the build location
2733 using @code{--with-polylib-builddir=PATH}.
2735 @item By default, the PolyLib backend of CLooG is built
2736 in 64bits version if such version of the
2737 PolyLib is found by @code{configure}. If the only existing version of the
2738 PolyLib is the 32bits or if the user give to @code{configure} the option
2739 @code{--with-bits=32}, the 32bits version of CLooG will be compiled. In the
2740 same way, the option @code{--with-bits=gmp} have to be used to build
2741 the multiple precision version.
2743 @item By default, @code{configure} will look for the GMP library
2744 (necessary to build the multiple precision version) in standard
2745 locations. If necessary, the user can specify the GMP path by giving
2746 @code{configure} the option @code{--with-gmp-prefix=PATH} and/or
2747 @code{--with-gmp-exec-prefix=PATH}.
2750 @node Uninstallation
2751 @section Uninstallation
2752 The user can easily remove the CLooG software and library from his system
2753 by typing (as root if necessary) from the CLooG top-level directory
2754 @code{make uninstall}.
2756 @c % **************************** DOCUMENTATION ******************************
2758 @chapter Documentation
2759 The CLooG distribution provides several documentation sources. First, the
2760 source code itself is as documented as possible. The code comments use a
2761 Doxygen-compatible presentation (something similar to what JavaDoc does for
2762 JAVA). The user may install Doxygen
2763 (see @code{http://www.stack.nl/~dimitri/doxygen}) to automatically
2764 generate a technical documentation by typing @code{make doc} or
2765 @code{doxygen ./autoconf/Doxyfile} at the CLooG top-level directory after
2766 running the configure script (@pxref{Installing}). Doxygen will generate
2767 documentation sources (in HTML, LaTeX and man) in the @code{doc/source}
2768 directory of the CLooG distribution.
2770 The Texinfo sources of the present document are also provided in the @code{doc}
2771 directory. You can build it in either DVI format (by typing
2772 @code{texi2dvi cloog.texi}) or PDF format
2773 (by typing @code{texi2pdf cloog.texi}) or HTML format
2774 (by typing @code{makeinfo --html cloog.texi}, using @code{--no-split}
2775 option to generate a single HTML file) or info format
2776 (by typing @code{makeinfo cloog.texi}).
2778 @c % ****************************** REFERENCES ********************************
2784 @anchor{Bas03a}[Bas03a] C. Bastoul, P. Feautrier. Improving data locality
2785 by chunking. CC'12 International Conference on Compiler Construction,
2786 LNCS 2622, pages 320-335, Warsaw, april 2003.
2789 @anchor{Bas03b}[Bas03b] C. Bastoul. Efficient code generation for automatic
2790 parallelization and optimization. ISPDC'03 IEEE International Symposium on
2791 Parallel and Distributed Computing, pages 23-30, Ljubljana, october 2003.
2794 @anchor{Bas04}[Bas04] C. Bastoul. Code Generation in the Polyhedral Model
2795 Is Easier Than You Think. PACT'13 IEEE International Conference on Parallel
2796 Architecture and Compilation Techniques, pages 7-16, Juan-les-Pins,
2800 @anchor{Fea92}[Fea92] P. Feautrier Some efficient solutions to the affine
2801 scheduling problem, part II: multidimensional time.
2802 International Journal of Parallel Programming, 21(6):389--420, December 1992.
2805 @anchor{Gri04}[Gri04] M. Griebl. Automatic parallelization of loop programs
2806 for distributed memory architectures. Habilitation Thesis. Facult@"at f@"ur
2807 Mathematik und Informatik, Universit@"at Passau, 2004.
2808 @emph{http://www.infosun.fmi.uni-passau.de/cl/loopo/}
2811 @anchor{Qui00}[Qui00] F. Quiller@'e, S. Rajopadhye, and D. Wilde.
2812 Generation of efficient nested loops from polyhedra.
2813 International Journal of Parallel Programming, 28(5):469-498,
2817 @anchor{Wil93}[Wil93] Doran K. Wilde.
2818 A library for doing polyhedral operations.
2819 Technical Report 785, IRISA, Rennes, France, 1993.
2826 @c % /*************************************************************************
2827 @c % * PART VI: END OF THE DOCUMENT *
2828 @c % *************************************************************************/
2829 @c @unnumbered Index