test/published/Web/web4.cloog

   1 # CLooG example file #4.
   2 # Please read the first example which is fully documented to understand the
   3 # different parts of this input file.
   4 #
   5 ################################################################################
   6 # The problem here is to scan a single non-rectangular polyhedron.             #
   7 #                                      |                                       #
   8 #          j^ i>=2                     |                                       #
   9 #           | | j<=n+2-i               |                                       #
  10 #           | |\     | i<=n            |                                       #
  11 #           | | \    |                 |                                       #
  12 #         m-+-****---+-j<=m            |   for (i=2;i<=n;i++) {                #
  13 #           | *****  |                 |     for (j=2;j<=min(m,-i+n+2);j++) {  #
  14 #           | ****** |                ==>      S1 ;                            #
  15 #           | *******|                 |     }                                 #
  16 #         2-+-********-j>=2            |   }                                   #
  17 #           | |      |\                |                                       #
  18 #         0-+-+------+--->i            |                                       #
  19 #           | |      |                 |                                       #
  20 #           0 2      n                 |                                       #
  21 #         Context : n>=2               |                                       #
  22 #                   m>=2               |                                       #
  23 #         System  : 2<=i<=n            |                                       #
  24 #                   2<=j<=m            |                                       #
  25 #                   j<=n+2-i           |                                       #
  26 #                                      |                                       #
  27 ################################################################################
  28 #
  29 # 1. Language: C
  30 c
  31
  32 # 2. Parameters {n,m | n>=2 m>=2}
  33 2 4        # 2 rows ans 4 columns
  34 #  m  n  1
  35 1  1  0 -2 # m>=2
  36 1  0  1 -2 # n>=2
  37
  38 # 3. We set manually the parameter name: m, n
  39 1
  40 m n
  41
  42 # 4. Number of polyhedra:
  43 1
  44
  45 # 5. The polyhedron description:
  46 1
  47 # {i, j | 2<=i<=n 2<=j<=m n+2-i-j>=0}
  48 5 6                   # 5 rows and 6 columns
  49 #   i   j   m   n   1
  50 1   1   0   0   0  -2 # i>=2
  51 1  -1   0   0   1   0 # i<=n
  52 1   0   1   0   0  -2 # j>=2
  53 1   0  -1   1   0   0 # j<=m
  54 1  -1  -1   0   1   2 # j<=n+2-i
  55 0   0   0             # 3 zeroes !
  56
  57 # 6. We set manually the iterator names: i, j
  58 1
  59 i j
  60
  61 # 7. Let CLoog scan the polyhedron in the way it wants.
  62 0