isl_dim_map.c

   1 /*
   2  * Copyright 2008-2009 Katholieke Universiteit Leuven
   3  * Copyright 2010-2011 INRIA Saclay
   4  *
   5  * Use of this software is governed by the MIT license
   6  *
   7  * Written by Sven Verdoolaege, K.U.Leuven, Departement
   8  * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
   9  * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
  10  * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
  11  */
  12
  13 #include <isl_map_private.h>
  14 #include <isl_space_private.h>
  15 #include <isl_dim_map.h>
  16 #include <isl_reordering.h>
  17
  18 struct isl_dim_map_entry {
  19         int pos;
  20         int sgn;
  21 };
  22
  23 /* Maps dst positions to src positions */
  24 struct isl_dim_map {
  25         unsigned len;
  26         struct isl_dim_map_entry m[1];
  27 };
  28
  29 __isl_give isl_dim_map *isl_dim_map_alloc(isl_ctx *ctx, unsigned len)
  30 {
  31         int i;
  32         struct isl_dim_map *dim_map;
  33         dim_map = isl_alloc(ctx, struct isl_dim_map,
  34             sizeof(struct isl_dim_map) + len * sizeof(struct isl_dim_map_entry));
  35         if (!dim_map)
  36                 return NULL;
  37         dim_map->len = 1 + len;
  38         dim_map->m[0].pos = 0;
  39         dim_map->m[0].sgn = 1;
  40         for (i = 0; i < len; ++i)
  41                 dim_map->m[1 + i].sgn = 0;
  42         return dim_map;
  43 }
  44
  45 /* Free "dim_map" and return NULL.
  46  */
  47 __isl_null isl_dim_map *isl_dim_map_free(__isl_take isl_dim_map *dim_map)
  48 {
  49         free(dim_map);
  50         return NULL;
  51 }
  52
  53 void isl_dim_map_range(__isl_keep isl_dim_map *dim_map,
  54         unsigned dst_pos, int dst_stride, unsigned src_pos, int src_stride,
  55         unsigned n, int sign)
  56 {
  57         int i;
  58
  59         if (!dim_map)
  60                 return;
  61
  62         for (i = 0; i < n; ++i) {
  63                 unsigned d = 1 + dst_pos + dst_stride * i;
  64                 unsigned s = 1 + src_pos + src_stride * i;
  65                 dim_map->m[d].pos = s;
  66                 dim_map->m[d].sgn = sign;
  67         }
  68 }
  69
  70 void isl_dim_map_dim_range(__isl_keep isl_dim_map *dim_map,
  71         __isl_keep isl_space *space, enum isl_dim_type type,
  72         unsigned first, unsigned n, unsigned dst_pos)
  73 {
  74         int i;
  75         unsigned src_pos;
  76
  77         if (!dim_map || !space)
  78                 return;
  79
  80         src_pos = 1 + isl_space_offset(space, type);
  81         for (i = 0; i < n; ++i) {
  82                 dim_map->m[1 + dst_pos + i].pos = src_pos + first + i;
  83                 dim_map->m[1 + dst_pos + i].sgn = 1;
  84         }
  85 }
  86
  87 void isl_dim_map_dim(__isl_keep isl_dim_map *dim_map,
  88         __isl_keep isl_space *space, enum isl_dim_type type, unsigned dst_pos)
  89 {
  90         isl_dim_map_dim_range(dim_map, space, type,
  91                               0, isl_space_dim(space, type), dst_pos);
  92 }
  93
  94 void isl_dim_map_div(__isl_keep isl_dim_map *dim_map,
  95         __isl_keep isl_basic_map *bmap, unsigned dst_pos)
  96 {
  97         int i;
  98         unsigned src_pos;
  99
 100         if (!dim_map || !bmap)
 101                 return;
 102
 103         src_pos = 1 + isl_space_dim(bmap->dim, isl_dim_all);
 104         for (i = 0; i < bmap->n_div; ++i) {
 105                 dim_map->m[1 + dst_pos + i].pos = src_pos + i;
 106                 dim_map->m[1 + dst_pos + i].sgn = 1;
 107         }
 108 }
 109
 110 void isl_dim_map_dump(struct isl_dim_map *dim_map)
 111 {
 112         int i;
 113
 114         for (i = 0; i < dim_map->len; ++i)
 115                 fprintf(stderr, "%d -> %d * %d; ", i,
 116                         dim_map->m[i].sgn, dim_map->m[i].pos);
 117         fprintf(stderr, "\n");
 118 }
 119
 120 static void copy_constraint_dim_map(isl_int *dst, isl_int *src,
 121                                         struct isl_dim_map *dim_map)
 122 {
 123         int i;
 124
 125         for (i = 0; i < dim_map->len; ++i) {
 126                 if (dim_map->m[i].sgn == 0)
 127                         isl_int_set_si(dst[i], 0);
 128                 else if (dim_map->m[i].sgn > 0)
 129                         isl_int_set(dst[i], src[dim_map->m[i].pos]);
 130                 else
 131                         isl_int_neg(dst[i], src[dim_map->m[i].pos]);
 132         }
 133 }
 134
 135 static void copy_div_dim_map(isl_int *dst, isl_int *src,
 136                                         struct isl_dim_map *dim_map)
 137 {
 138         isl_int_set(dst[0], src[0]);
 139         copy_constraint_dim_map(dst+1, src+1, dim_map);
 140 }
 141
 142 __isl_give isl_basic_map *isl_basic_map_add_constraints_dim_map(
 143         __isl_take isl_basic_map *dst, __isl_take isl_basic_map *src,
 144         __isl_take isl_dim_map *dim_map)
 145 {
 146         int i;
 147
 148         if (!src || !dst || !dim_map)
 149                 goto error;
 150
 151         for (i = 0; i < src->n_eq; ++i) {
 152                 int i1 = isl_basic_map_alloc_equality(dst);
 153                 if (i1 < 0)
 154                         goto error;
 155                 copy_constraint_dim_map(dst->eq[i1], src->eq[i], dim_map);
 156         }
 157
 158         for (i = 0; i < src->n_ineq; ++i) {
 159                 int i1 = isl_basic_map_alloc_inequality(dst);
 160                 if (i1 < 0)
 161                         goto error;
 162                 copy_constraint_dim_map(dst->ineq[i1], src->ineq[i], dim_map);
 163         }
 164
 165         for (i = 0; i < src->n_div; ++i) {
 166                 int i1 = isl_basic_map_alloc_div(dst);
 167                 if (i1 < 0)
 168                         goto error;
 169                 copy_div_dim_map(dst->div[i1], src->div[i], dim_map);
 170         }
 171
 172         isl_dim_map_free(dim_map);
 173         isl_basic_map_free(src);
 174
 175         return dst;
 176 error:
 177         isl_dim_map_free(dim_map);
 178         isl_basic_map_free(src);
 179         isl_basic_map_free(dst);
 180         return NULL;
 181 }
 182
 183 __isl_give isl_basic_set *isl_basic_set_add_constraints_dim_map(
 184         __isl_take isl_basic_set *dst, __isl_take isl_basic_set *src,
 185         __isl_take isl_dim_map *dim_map)
 186 {
 187         return isl_basic_map_add_constraints_dim_map(dst, src, dim_map);
 188 }
 189
 190 /* Extend the given dim_map with mappings for the divs in bmap.
 191  */
 192 __isl_give isl_dim_map *isl_dim_map_extend(__isl_keep isl_dim_map *dim_map,
 193         __isl_keep isl_basic_map *bmap)
 194 {
 195         int i;
 196         struct isl_dim_map *res;
 197         int offset;
 198
 199         if (!dim_map)
 200                 return NULL;
 201
 202         offset = isl_basic_map_offset(bmap, isl_dim_div);
 203
 204         res = isl_dim_map_alloc(bmap->ctx, dim_map->len - 1 + bmap->n_div);
 205         if (!res)
 206                 return NULL;
 207
 208         for (i = 0; i < dim_map->len; ++i)
 209                 res->m[i] = dim_map->m[i];
 210         for (i = 0; i < bmap->n_div; ++i) {
 211                 res->m[dim_map->len + i].pos = offset + i;
 212                 res->m[dim_map->len + i].sgn = 1;
 213         }
 214
 215         return res;
 216 }
 217
 218 /* Extract a dim_map from a reordering.
 219  * We essentially need to reverse the mapping, and add an offset
 220  * of 1 for the constant term.
 221  */
 222 __isl_give isl_dim_map *isl_dim_map_from_reordering(
 223         __isl_keep isl_reordering *exp)
 224 {
 225         int i;
 226         isl_ctx *ctx;
 227         isl_space *space;
 228         struct isl_dim_map *dim_map;
 229
 230         if (!exp)
 231                 return NULL;
 232
 233         ctx = isl_reordering_get_ctx(exp);
 234         space = isl_reordering_peek_space(exp);
 235         dim_map = isl_dim_map_alloc(ctx, isl_space_dim(space, isl_dim_all));
 236         if (!dim_map)
 237                 return NULL;
 238
 239         for (i = 0; i < exp->len; ++i) {
 240                 dim_map->m[1 + exp->pos[i]].pos = 1 + i;
 241                 dim_map->m[1 + exp->pos[i]].sgn = 1;
 242         }
 243
 244         return dim_map;
 245 }