2 * Copyright 2008-2009 Katholieke Universiteit Leuven
3 * Copyright 2011 INRIA Saclay
5 * Use of this software is governed by the GNU LGPLv2.1 license
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
13 #define xCAT(A,B) A ## B
14 #define CAT(A,B) xCAT(A,B)
16 #define EL CAT(isl_,BASE)
17 #define xFN(TYPE,NAME) TYPE ## _ ## NAME
18 #define FN(TYPE,NAME) xFN(TYPE,NAME)
19 #define xLIST(EL) EL ## _list
20 #define LIST(EL) xLIST(EL)
22 isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
24 return list ? list->ctx : NULL;
27 __isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
32 isl_die(ctx, isl_error_invalid,
33 "cannot create list of negative length",
35 list = isl_alloc(ctx, LIST(EL),
36 sizeof(LIST(EL)) + (n - 1) * sizeof(struct EL *));
48 __isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
57 __isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
58 __isl_take struct EL *el)
62 isl_assert(list->ctx, list->n < list->size, goto error);
63 list->p[list->n] = el;
68 FN(LIST(EL),free)(list);
72 void FN(LIST(EL),free)(__isl_take LIST(EL) *list)
82 isl_ctx_deref(list->ctx);
83 for (i = 0; i < list->n; ++i)
84 FN(EL,free)(list->p[i]);
88 int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
90 return list ? list->n : 0;
93 __isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
97 if (index < 0 || index >= list->n)
98 isl_die(list->ctx, isl_error_invalid,
99 "index out of bounds", return NULL);
100 return FN(EL,copy)(list->p[index]);
103 int FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
104 int (*fn)(__isl_take EL *el, void *user), void *user)
111 for (i = 0; i < list->n; ++i) {
112 EL *el = FN(EL,copy(list->p[i]));
115 if (fn(el, user) < 0)