isl_list_templ.c

   1 /*
   2  * Copyright 2008-2009 Katholieke Universiteit Leuven
   3  * Copyright 2011      INRIA Saclay
   4  * Copyright 2012-2013 Ecole Normale Superieure
   5  * Copyright 2017      Sven Verdoolaege
   6  *
   7  * Use of this software is governed by the MIT license
   8  *
   9  * Written by Sven Verdoolaege, K.U.Leuven, Departement
  10  * Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
  11  * and INRIA Saclay - Ile-de-France, Parc Club Orsay Universite,
  12  * ZAC des vignes, 4 rue Jacques Monod, 91893 Orsay, France
  13  * and Ecole Normale Superieure, 45 rue d’Ulm, 75230 Paris, France
  14  */
  15
  16 #include <isl_sort.h>
  17 #include <isl_tarjan.h>
  18 #include <isl/printer.h>
  19
  20 #define xCAT(A,B) A ## B
  21 #define CAT(A,B) xCAT(A,B)
  22 #undef EL
  23 #define EL CAT(isl_,BASE)
  24 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
  25 #define FN(TYPE,NAME) xFN(TYPE,NAME)
  26 #define xLIST(EL) EL ## _list
  27 #define LIST(EL) xLIST(EL)
  28 #define xS(TYPE,NAME) struct TYPE ## _ ## NAME
  29 #define S(TYPE,NAME) xS(TYPE,NAME)
  30
  31 isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
  32 {
  33         return list ? list->ctx : NULL;
  34 }
  35
  36 __isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
  37 {
  38         LIST(EL) *list;
  39
  40         if (n < 0)
  41                 isl_die(ctx, isl_error_invalid,
  42                         "cannot create list of negative length",
  43                         return NULL);
  44         list = isl_alloc(ctx, LIST(EL),
  45                          sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
  46         if (!list)
  47                 return NULL;
  48
  49         list->ctx = ctx;
  50         isl_ctx_ref(ctx);
  51         list->ref = 1;
  52         list->size = n;
  53         list->n = 0;
  54         return list;
  55 }
  56
  57 __isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
  58 {
  59         if (!list)
  60                 return NULL;
  61
  62         list->ref++;
  63         return list;
  64 }
  65
  66 __isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list)
  67 {
  68         int i;
  69         LIST(EL) *dup;
  70
  71         if (!list)
  72                 return NULL;
  73
  74         dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
  75         if (!dup)
  76                 return NULL;
  77         for (i = 0; i < list->n; ++i)
  78                 dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
  79         return dup;
  80 }
  81
  82 __isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
  83 {
  84         if (!list)
  85                 return NULL;
  86
  87         if (list->ref == 1)
  88                 return list;
  89         list->ref--;
  90         return FN(LIST(EL),dup)(list);
  91 }
  92
  93 /* Make sure "list" has room for at least "n" more pieces.
  94  * Always return a list with a single reference.
  95  *
  96  * If there is only one reference to list, we extend it in place.
  97  * Otherwise, we create a new LIST(EL) and copy the elements.
  98  */
  99 static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n)
 100 {
 101         isl_ctx *ctx;
 102         int i, new_size;
 103         LIST(EL) *res;
 104
 105         if (!list)
 106                 return NULL;
 107         if (list->ref == 1 && list->n + n <= list->size)
 108                 return list;
 109
 110         ctx = FN(LIST(EL),get_ctx)(list);
 111         new_size = ((list->n + n + 1) * 3) / 2;
 112         if (list->ref == 1) {
 113                 res = isl_realloc(ctx, list, LIST(EL),
 114                             sizeof(LIST(EL)) + (new_size - 1) * sizeof(EL *));
 115                 if (!res)
 116                         return FN(LIST(EL),free)(list);
 117                 res->size = new_size;
 118                 return res;
 119         }
 120
 121         if (list->n + n <= list->size && list->size < new_size)
 122                 new_size = list->size;
 123
 124         res = FN(LIST(EL),alloc)(ctx, new_size);
 125         if (!res)
 126                 return FN(LIST(EL),free)(list);
 127
 128         for (i = 0; i < list->n; ++i)
 129                 res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
 130
 131         FN(LIST(EL),free)(list);
 132         return res;
 133 }
 134
 135 /* Check that "index" is a valid position in "list".
 136  */
 137 static isl_stat FN(LIST(EL),check_index)(__isl_keep LIST(EL) *list, int index)
 138 {
 139         if (!list)
 140                 return isl_stat_error;
 141         if (index < 0 || index >= list->n)
 142                 isl_die(FN(LIST(EL),get_ctx)(list), isl_error_invalid,
 143                         "index out of bounds", return isl_stat_error);
 144         return isl_stat_ok;
 145 }
 146
 147 __isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
 148         __isl_take struct EL *el)
 149 {
 150         list = FN(LIST(EL),grow)(list, 1);
 151         if (!list || !el)
 152                 goto error;
 153         list->p[list->n] = el;
 154         list->n++;
 155         return list;
 156 error:
 157         FN(EL,free)(el);
 158         FN(LIST(EL),free)(list);
 159         return NULL;
 160 }
 161
 162 /* Remove the "n" elements starting at "first" from "list".
 163  */
 164 __isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
 165         unsigned first, unsigned n)
 166 {
 167         int i;
 168
 169         if (!list)
 170                 return NULL;
 171         if (first + n > list->n || first + n < first)
 172                 isl_die(list->ctx, isl_error_invalid,
 173                         "index out of bounds", return FN(LIST(EL),free)(list));
 174         if (n == 0)
 175                 return list;
 176         list = FN(LIST(EL),cow)(list);
 177         if (!list)
 178                 return NULL;
 179         for (i = 0; i < n; ++i)
 180                 FN(EL,free)(list->p[first + i]);
 181         for (i = first; i + n < list->n; ++i)
 182                 list->p[i] = list->p[i + n];
 183         list->n -= n;
 184         return list;
 185 }
 186
 187 /* Insert "el" at position "pos" in "list".
 188  *
 189  * If there is only one reference to "list" and if it already has space
 190  * for one extra element, we insert it directly into "list".
 191  * Otherwise, we create a new list consisting of "el" and copied
 192  * elements from "list".
 193  */
 194 __isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list,
 195         unsigned pos, __isl_take struct EL *el)
 196 {
 197         int i;
 198         isl_ctx *ctx;
 199         LIST(EL) *res;
 200
 201         if (!list || !el)
 202                 goto error;
 203         ctx = FN(LIST(EL),get_ctx)(list);
 204         if (pos > list->n)
 205                 isl_die(ctx, isl_error_invalid,
 206                         "index out of bounds", goto error);
 207
 208         if (list->ref == 1 && list->size > list->n) {
 209                 for (i = list->n; i > pos; --i)
 210                         list->p[i] = list->p[i - 1];
 211                 list->n++;
 212                 list->p[pos] = el;
 213                 return list;
 214         }
 215
 216         res = FN(LIST(EL),alloc)(ctx, list->n + 1);
 217         for (i = 0; i < pos; ++i)
 218                 res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
 219         res = FN(LIST(EL),add)(res, el);
 220         for (i = pos; i < list->n; ++i)
 221                 res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
 222         FN(LIST(EL),free)(list);
 223
 224         return res;
 225 error:
 226         FN(EL,free)(el);
 227         FN(LIST(EL),free)(list);
 228         return NULL;
 229 }
 230
 231 __isl_null LIST(EL) *FN(LIST(EL),free)(__isl_take LIST(EL) *list)
 232 {
 233         int i;
 234
 235         if (!list)
 236                 return NULL;
 237
 238         if (--list->ref > 0)
 239                 return NULL;
 240
 241         isl_ctx_deref(list->ctx);
 242         for (i = 0; i < list->n; ++i)
 243                 FN(EL,free)(list->p[i]);
 244         free(list);
 245
 246         return NULL;
 247 }
 248
 249 int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
 250 {
 251         return list ? list->n : 0;
 252 }
 253
 254 /* Return the element at position "index" in "list".
 255  */
 256 static __isl_keep EL *FN(LIST(EL),peek)(__isl_keep LIST(EL) *list, int index)
 257 {
 258         if (FN(LIST(EL),check_index)(list, index) < 0)
 259                 return NULL;
 260         return list->p[index];
 261 }
 262
 263 /* Return a copy of the element at position "index" in "list".
 264  */
 265 __isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
 266 {
 267         return FN(EL,copy)(FN(LIST(EL),peek)(list, index));
 268 }
 269
 270 /* Replace the element at position "index" in "list" by "el".
 271  */
 272 __isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list,
 273         int index, __isl_take EL *el)
 274 {
 275         if (!list || !el)
 276                 goto error;
 277         if (FN(LIST(EL),check_index)(list, index) < 0)
 278                 goto error;
 279         if (list->p[index] == el) {
 280                 FN(EL,free)(el);
 281                 return list;
 282         }
 283         list = FN(LIST(EL),cow)(list);
 284         if (!list)
 285                 goto error;
 286         FN(EL,free)(list->p[index]);
 287         list->p[index] = el;
 288         return list;
 289 error:
 290         FN(EL,free)(el);
 291         FN(LIST(EL),free)(list);
 292         return NULL;
 293 }
 294
 295 /* Return the element at position "index" of "list".
 296  * This may be either a copy or the element itself
 297  * if there is only one reference to "list".
 298  * This allows the element to be modified inplace
 299  * if both the list and the element have only a single reference.
 300  * The caller is not allowed to modify "list" between
 301  * this call to isl_list_*_take_* and a subsequent call
 302  * to isl_list_*_restore_*.
 303  * The only exception is that isl_list_*_free can be called instead.
 304  */
 305 static __isl_give EL *FN(FN(LIST(EL),take),BASE)(__isl_keep LIST(EL) *list,
 306         int index)
 307 {
 308         EL *el;
 309
 310         if (FN(LIST(EL),check_index)(list, index) < 0)
 311                 return NULL;
 312         if (list->ref != 1)
 313                 return FN(FN(LIST(EL),get),BASE)(list, index);
 314         el = list->p[index];
 315         list->p[index] = NULL;
 316         return el;
 317 }
 318
 319 /* Set the element at position "index" of "list" to "el",
 320  * where the position may be empty due to a previous call
 321  * to isl_list_*_take_*.
 322  */
 323 static __isl_give LIST(EL) *FN(FN(LIST(EL),restore),BASE)(
 324         __isl_take LIST(EL) *list, int index, __isl_take EL *el)
 325 {
 326         return FN(FN(LIST(EL),set),BASE)(list, index, el);
 327 }
 328
 329 isl_stat FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
 330         isl_stat (*fn)(__isl_take EL *el, void *user), void *user)
 331 {
 332         int i;
 333
 334         if (!list)
 335                 return isl_stat_error;
 336
 337         for (i = 0; i < list->n; ++i) {
 338                 EL *el = FN(EL,copy)(list->p[i]);
 339                 if (!el)
 340                         return isl_stat_error;
 341                 if (fn(el, user) < 0)
 342                         return isl_stat_error;
 343         }
 344
 345         return isl_stat_ok;
 346 }
 347
 348 /* Replace each element in "list" by the result of calling "fn"
 349  * on the element.
 350  */
 351 __isl_give LIST(EL) *FN(LIST(EL),map)(__isl_keep LIST(EL) *list,
 352         __isl_give EL *(*fn)(__isl_take EL *el, void *user), void *user)
 353 {
 354         int i, n;
 355
 356         if (!list)
 357                 return NULL;
 358
 359         n = list->n;
 360         for (i = 0; i < n; ++i) {
 361                 EL *el = FN(FN(LIST(EL),take),BASE)(list, i);
 362                 if (!el)
 363                         return FN(LIST(EL),free)(list);
 364                 el = fn(el, user);
 365                 list = FN(FN(LIST(EL),restore),BASE)(list, i, el);
 366         }
 367
 368         return list;
 369 }
 370
 371 /* Internal data structure for isl_*_list_sort.
 372  *
 373  * "cmp" is the original comparison function.
 374  * "user" is a user provided pointer that should be passed to "cmp".
 375  */
 376 S(LIST(EL),sort_data) {
 377         int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user);
 378         void *user;
 379 };
 380
 381 /* Compare two entries of an isl_*_list based on the user provided
 382  * comparison function on pairs of isl_* objects.
 383  */
 384 static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user)
 385 {
 386         S(LIST(EL),sort_data) *data = user;
 387         EL * const *el1 = a;
 388         EL * const *el2 = b;
 389
 390         return data->cmp(*el1, *el2, data->user);
 391 }
 392
 393 /* Sort the elements of "list" in ascending order according to
 394  * comparison function "cmp".
 395  */
 396 __isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
 397         int (*cmp)(__isl_keep EL *a, __isl_keep EL *b, void *user), void *user)
 398 {
 399         S(LIST(EL),sort_data) data = { cmp, user };
 400
 401         if (!list)
 402                 return NULL;
 403         if (list->n <= 1)
 404                 return list;
 405         list = FN(LIST(EL),cow)(list);
 406         if (!list)
 407                 return NULL;
 408
 409         if (isl_sort(list->p, list->n, sizeof(list->p[0]),
 410                         &FN(LIST(EL),cmp), &data) < 0)
 411                 return FN(LIST(EL),free)(list);
 412
 413         return list;
 414 }
 415
 416 /* Internal data structure for isl_*_list_foreach_scc.
 417  *
 418  * "list" is the original list.
 419  * "follows" is the user provided callback that defines the edges of the graph.
 420  */
 421 S(LIST(EL),foreach_scc_data) {
 422         LIST(EL) *list;
 423         isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user);
 424         void *follows_user;
 425 };
 426
 427 /* Does element i of data->list follow element j?
 428  *
 429  * Use the user provided callback to find out.
 430  */
 431 static isl_bool FN(LIST(EL),follows)(int i, int j, void *user)
 432 {
 433         S(LIST(EL),foreach_scc_data) *data = user;
 434
 435         return data->follows(data->list->p[i], data->list->p[j],
 436                                 data->follows_user);
 437 }
 438
 439 /* Call "fn" on the sublist of "list" that consists of the elements
 440  * with indices specified by the "n" elements of "pos".
 441  */
 442 static isl_stat FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos,
 443         int n, isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *user)
 444 {
 445         int i;
 446         isl_ctx *ctx;
 447         LIST(EL) *slice;
 448
 449         ctx = FN(LIST(EL),get_ctx)(list);
 450         slice = FN(LIST(EL),alloc)(ctx, n);
 451         for (i = 0; i < n; ++i) {
 452                 EL *el;
 453
 454                 el = FN(EL,copy)(list->p[pos[i]]);
 455                 slice = FN(LIST(EL),add)(slice, el);
 456         }
 457
 458         return fn(slice, user);
 459 }
 460
 461 /* Call "fn" on each of the strongly connected components (SCCs) of
 462  * the graph with as vertices the elements of "list" and
 463  * a directed edge from node b to node a iff follows(a, b)
 464  * returns 1.  follows should return -1 on error.
 465  *
 466  * If SCC a contains a node i that follows a node j in another SCC b
 467  * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
 468  * after being called on SCC b.
 469  *
 470  * We simply call isl_tarjan_graph_init, extract the SCCs from the result and
 471  * call fn on each of them.
 472  */
 473 isl_stat FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
 474         isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
 475         void *follows_user,
 476         isl_stat (*fn)(__isl_take LIST(EL) *scc, void *user), void *fn_user)
 477 {
 478         S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user };
 479         int i, n;
 480         isl_ctx *ctx;
 481         struct isl_tarjan_graph *g;
 482
 483         if (!list)
 484                 return isl_stat_error;
 485         if (list->n == 0)
 486                 return isl_stat_ok;
 487         if (list->n == 1)
 488                 return fn(FN(LIST(EL),copy)(list), fn_user);
 489
 490         ctx = FN(LIST(EL),get_ctx)(list);
 491         n = list->n;
 492         g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
 493         if (!g)
 494                 return isl_stat_error;
 495
 496         i = 0;
 497         do {
 498                 int first;
 499
 500                 if (g->order[i] == -1)
 501                         isl_die(ctx, isl_error_internal, "cannot happen",
 502                                 break);
 503                 first = i;
 504                 while (g->order[i] != -1) {
 505                         ++i; --n;
 506                 }
 507                 if (first == 0 && n == 0) {
 508                         isl_tarjan_graph_free(g);
 509                         return fn(FN(LIST(EL),copy)(list), fn_user);
 510                 }
 511                 if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
 512                                             fn, fn_user) < 0)
 513                         break;
 514                 ++i;
 515         } while (n);
 516
 517         isl_tarjan_graph_free(g);
 518
 519         return n > 0 ? isl_stat_error : isl_stat_ok;
 520 }
 521
 522 __isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
 523 {
 524         isl_ctx *ctx;
 525         LIST(EL) *list;
 526
 527         if (!el)
 528                 return NULL;
 529         ctx = FN(EL,get_ctx)(el);
 530         list = FN(LIST(EL),alloc)(ctx, 1);
 531         if (!list)
 532                 goto error;
 533         list = FN(LIST(EL),add)(list, el);
 534         return list;
 535 error:
 536         FN(EL,free)(el);
 537         return NULL;
 538 }
 539
 540 /* Append the elements of "list2" to "list1", where "list1" is known
 541  * to have only a single reference and enough room to hold
 542  * the extra elements.
 543  */
 544 static __isl_give LIST(EL) *FN(LIST(EL),concat_inplace)(
 545         __isl_take LIST(EL) *list1, __isl_take LIST(EL) *list2)
 546 {
 547         int i;
 548
 549         for (i = 0; i < list2->n; ++i)
 550                 list1 = FN(LIST(EL),add)(list1, FN(EL,copy)(list2->p[i]));
 551         FN(LIST(EL),free)(list2);
 552         return list1;
 553 }
 554
 555 /* Concatenate "list1" and "list2".
 556  * If "list1" has only one reference and has enough room
 557  * for the elements of "list2", the add the elements to "list1" itself.
 558  * Otherwise, create a new list to store the result.
 559  */
 560 __isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
 561         __isl_take LIST(EL) *list2)
 562 {
 563         int i;
 564         isl_ctx *ctx;
 565         LIST(EL) *res;
 566
 567         if (!list1 || !list2)
 568                 goto error;
 569
 570         if (list1->ref == 1 && list1->n + list2->n <= list1->size)
 571                 return FN(LIST(EL),concat_inplace)(list1, list2);
 572
 573         ctx = FN(LIST(EL),get_ctx)(list1);
 574         res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
 575         for (i = 0; i < list1->n; ++i)
 576                 res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
 577         for (i = 0; i < list2->n; ++i)
 578                 res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
 579
 580         FN(LIST(EL),free)(list1);
 581         FN(LIST(EL),free)(list2);
 582         return res;
 583 error:
 584         FN(LIST(EL),free)(list1);
 585         FN(LIST(EL),free)(list2);
 586         return NULL;
 587 }
 588
 589 __isl_give isl_printer *CAT(isl_printer_print_,LIST(BASE))(
 590         __isl_take isl_printer *p, __isl_keep LIST(EL) *list)
 591 {
 592         int i;
 593
 594         if (!p || !list)
 595                 goto error;
 596         p = isl_printer_print_str(p, "(");
 597         for (i = 0; i < list->n; ++i) {
 598                 if (i)
 599                         p = isl_printer_print_str(p, ",");
 600                 p = CAT(isl_printer_print_,BASE)(p, list->p[i]);
 601         }
 602         p = isl_printer_print_str(p, ")");
 603         return p;
 604 error:
 605         isl_printer_free(p);
 606         return NULL;
 607 }
 608
 609 void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
 610 {
 611         isl_printer *printer;
 612
 613         if (!list)
 614                 return;
 615
 616         printer = isl_printer_to_file(FN(LIST(EL),get_ctx)(list), stderr);
 617         printer = CAT(isl_printer_print_,LIST(BASE))(printer, list);
 618         printer = isl_printer_end_line(printer);
 619
 620         isl_printer_free(printer);
 621 }