isl_pw_templ.c

   1 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
   2 #define FN(TYPE,NAME) xFN(TYPE,NAME)
   3 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
   4 #define S(TYPE,NAME) xS(TYPE,NAME)
   5
   6 static __isl_give PW *FN(PW,alloc_)(__isl_take isl_dim *dim, int n)
   7 {
   8         struct PW *pw;
   9
  10         if (!dim)
  11                 return NULL;
  12         isl_assert(dim->ctx, n >= 0, goto error);
  13         pw = isl_alloc(dim->ctx, struct PW,
  14                         sizeof(struct PW) + (n - 1) * sizeof(S(PW,piece)));
  15         if (!pw)
  16                 goto error;
  17
  18         pw->ref = 1;
  19         pw->size = n;
  20         pw->n = 0;
  21         pw->dim = dim;
  22         return pw;
  23 error:
  24         isl_dim_free(dim);
  25         return NULL;
  26 }
  27
  28 __isl_give PW *FN(PW,zero)(__isl_take isl_dim *dim)
  29 {
  30         return FN(PW,alloc_)(dim, 0);
  31 }
  32
  33 __isl_give PW *FN(PW,add_piece)(__isl_take PW *pw,
  34         __isl_take isl_set *set, __isl_take EL *el)
  35 {
  36         if (!pw || !set || !el)
  37                 goto error;
  38
  39         if (isl_set_fast_is_empty(set) || FN(EL,IS_ZERO)(el)) {
  40                 isl_set_free(set);
  41                 FN(EL,free)(el);
  42                 return pw;
  43         }
  44
  45         isl_assert(set->ctx, isl_dim_equal(pw->dim, el->dim), goto error);
  46         isl_assert(set->ctx, pw->n < pw->size, goto error);
  47
  48         pw->p[pw->n].set = set;
  49         pw->p[pw->n].FIELD = el;
  50         pw->n++;
  51
  52         return pw;
  53 error:
  54         FN(PW,free)(pw);
  55         isl_set_free(set);
  56         FN(EL,free)(el);
  57         return NULL;
  58 }
  59
  60 __isl_give PW *FN(PW,alloc)(__isl_take isl_set *set, __isl_take EL *el)
  61 {
  62         PW *pw;
  63
  64         if (!set || !el)
  65                 goto error;
  66
  67         pw = FN(PW,alloc_)(isl_set_get_dim(set), 1);
  68
  69         return FN(PW,add_piece)(pw, set, el);
  70 error:
  71         isl_set_free(set);
  72         FN(EL,free)(el);
  73         return NULL;
  74 }
  75
  76 __isl_give PW *FN(PW,dup)(__isl_keep PW *pw)
  77 {
  78         int i;
  79         PW *dup;
  80
  81         if (!pw)
  82                 return NULL;
  83
  84         dup = FN(PW,alloc_)(isl_dim_copy(pw->dim), pw->n);
  85         if (!dup)
  86                 return NULL;
  87
  88         for (i = 0; i < pw->n; ++i)
  89                 dup = FN(PW,add_piece)(dup, isl_set_copy(pw->p[i].set),
  90                                             FN(EL,copy)(pw->p[i].FIELD));
  91
  92         return dup;
  93 error:
  94         FN(PW,free)(dup);
  95         return NULL;
  96 }
  97
  98 __isl_give PW *FN(PW,cow)(__isl_take PW *pw)
  99 {
 100         if (!pw)
 101                 return NULL;
 102
 103         if (pw->ref == 1)
 104                 return pw;
 105         pw->ref--;
 106         return FN(PW,dup)(pw);
 107 }
 108
 109 __isl_give PW *FN(PW,copy)(__isl_keep PW *pw)
 110 {
 111         if (!pw)
 112                 return NULL;
 113
 114         pw->ref++;
 115         return pw;
 116 }
 117
 118 void FN(PW,free)(__isl_take PW *pw)
 119 {
 120         int i;
 121
 122         if (!pw)
 123                 return;
 124         if (--pw->ref > 0)
 125                 return;
 126
 127         for (i = 0; i < pw->n; ++i) {
 128                 isl_set_free(pw->p[i].set);
 129                 FN(EL,free)(pw->p[i].FIELD);
 130         }
 131         isl_dim_free(pw->dim);
 132         free(pw);
 133 }
 134
 135 int FN(PW,is_zero)(__isl_keep PW *pw)
 136 {
 137         if (!pw)
 138                 return -1;
 139
 140         return pw->n == 0;
 141 }
 142
 143 __isl_give PW *FN(PW,add)(__isl_take PW *pw1, __isl_take PW *pw2)
 144 {
 145         int i, j, n;
 146         struct PW *res;
 147         isl_set *set;
 148
 149         if (!pw1 || !pw2)
 150                 goto error;
 151
 152         isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
 153
 154         if (FN(PW,is_zero)(pw1)) {
 155                 FN(PW,free)(pw1);
 156                 return pw2;
 157         }
 158
 159         if (FN(PW,is_zero)(pw2)) {
 160                 FN(PW,free)(pw2);
 161                 return pw1;
 162         }
 163
 164         n = (pw1->n + 1) * (pw2->n + 1);
 165         res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), n);
 166
 167         for (i = 0; i < pw1->n; ++i) {
 168                 set = isl_set_copy(pw1->p[i].set);
 169                 for (j = 0; j < pw2->n; ++j) {
 170                         struct isl_set *common;
 171                         EL *sum;
 172                         set = isl_set_subtract(set,
 173                                         isl_set_copy(pw2->p[j].set));
 174                         common = isl_set_intersect(isl_set_copy(pw1->p[i].set),
 175                                                 isl_set_copy(pw2->p[j].set));
 176                         if (isl_set_fast_is_empty(common)) {
 177                                 isl_set_free(common);
 178                                 continue;
 179                         }
 180
 181                         sum = FN(EL,ADD)(FN(EL,copy)(pw1->p[i].FIELD),
 182                                          FN(EL,copy)(pw2->p[j].FIELD));
 183
 184                         res = FN(PW,add_piece)(res, common, sum);
 185                 }
 186                 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw1->p[i].FIELD));
 187         }
 188
 189         for (j = 0; j < pw2->n; ++j) {
 190                 set = isl_set_copy(pw2->p[j].set);
 191                 for (i = 0; i < pw1->n; ++i)
 192                         set = isl_set_subtract(set,
 193                                         isl_set_copy(pw1->p[i].set));
 194                 res = FN(PW,add_piece)(res, set, FN(EL,copy)(pw2->p[j].FIELD));
 195         }
 196
 197         FN(PW,free)(pw1);
 198         FN(PW,free)(pw2);
 199
 200         return res;
 201 error:
 202         FN(PW,free)(pw1);
 203         FN(PW,free)(pw2);
 204         return NULL;
 205 }
 206
 207 __isl_give PW *FN(PW,add_disjoint)(__isl_take PW *pw1, __isl_take PW *pw2)
 208 {
 209         int i;
 210         PW *res;
 211
 212         if (!pw1 || !pw2)
 213                 goto error;
 214
 215         isl_assert(pw1->dim->ctx, isl_dim_equal(pw1->dim, pw2->dim), goto error);
 216
 217         if (FN(PW,is_zero)(pw1)) {
 218                 FN(PW,free)(pw1);
 219                 return pw2;
 220         }
 221
 222         if (FN(PW,is_zero)(pw2)) {
 223                 FN(PW,free)(pw2);
 224                 return pw1;
 225         }
 226
 227         res = FN(PW,alloc_)(isl_dim_copy(pw1->dim), pw1->n + pw2->n);
 228
 229         for (i = 0; i < pw1->n; ++i)
 230                 res = FN(PW,add_piece)(res,
 231                                 isl_set_copy(pw1->p[i].set),
 232                                 FN(EL,copy)(pw1->p[i].FIELD));
 233
 234         for (i = 0; i < pw2->n; ++i)
 235                 res = FN(PW,add_piece)(res,
 236                                 isl_set_copy(pw2->p[i].set),
 237                                 FN(EL,copy)(pw2->p[i].FIELD));
 238
 239         FN(PW,free)(pw1);
 240         FN(PW,free)(pw2);
 241
 242         return res;
 243 error:
 244         FN(PW,free)(pw1);
 245         FN(PW,free)(pw2);
 246         return NULL;
 247 }
 248
 249 __isl_give isl_qpolynomial *FN(PW,eval)(__isl_take PW *pw,
 250         __isl_take isl_point *pnt)
 251 {
 252         int i;
 253         int found;
 254         isl_qpolynomial *qp;
 255
 256         if (!pw || !pnt)
 257                 goto error;
 258         isl_assert(pnt->dim->ctx, isl_dim_equal(pnt->dim, pw->dim), goto error);
 259
 260         for (i = 0; i < pw->n; ++i) {
 261                 found = isl_set_contains_point(pw->p[i].set, pnt);
 262                 if (found < 0)
 263                         goto error;
 264                 if (found)
 265                         break;
 266         }
 267         if (found)
 268                 qp = FN(EL,eval)(FN(EL,copy)(pw->p[i].FIELD),
 269                                             isl_point_copy(pnt));
 270         else
 271                 qp = isl_qpolynomial_zero(isl_dim_copy(pw->dim));
 272         FN(PW,free)(pw);
 273         isl_point_free(pnt);
 274         return qp;
 275 error:
 276         FN(PW,free)(pw);
 277         isl_point_free(pnt);
 278         return NULL;
 279 }
 280
 281 __isl_give isl_set *FN(PW,domain)(__isl_take PW *pw)
 282 {
 283         int i;
 284         isl_set *dom;
 285
 286         if (!pw)
 287                 return NULL;
 288
 289         dom = isl_set_empty(isl_dim_copy(pw->dim));
 290         for (i = 0; i < pw->n; ++i)
 291                 dom = isl_set_union_disjoint(dom, isl_set_copy(pw->p[i].set));
 292
 293         FN(PW,free)(pw);
 294
 295         return dom;
 296 }
 297
 298 __isl_give PW *FN(PW,intersect_domain)(__isl_take PW *pw, __isl_take isl_set *set)
 299 {
 300         int i;
 301
 302         if (!pw || !set)
 303                 goto error;
 304
 305         if (pw->n == 0) {
 306                 isl_set_free(set);
 307                 return pw;
 308         }
 309
 310         pw = FN(PW,cow)(pw);
 311         if (!pw)
 312                 goto error;
 313
 314         for (i = 0; i < pw->n; ++i) {
 315                 pw->p[i].set = isl_set_intersect(pw->p[i].set, isl_set_copy(set));
 316                 if (!pw->p[i].set)
 317                         goto error;
 318         }
 319
 320         isl_set_free(set);
 321         return pw;
 322 error:
 323         isl_set_free(set);
 324         FN(PW,free)(pw);
 325         return NULL;
 326 }