haiku-buildtools/isl/isl_list_templ.c

23 #define FN(TYPE,NAME) xFN(TYPE,NAME)
29 isl_ctx *FN(LIST(EL),get_ctx)(__isl_keep LIST(EL) *list)
34 __isl_give LIST(EL) *FN(LIST(EL),alloc)(isl_ctx *ctx, int n)
55 __isl_give LIST(EL) *FN(LIST(EL),copy)(__isl_keep LIST(EL) *list)
64 __isl_give LIST(EL) *FN(LIST(EL),dup)(__isl_keep LIST(EL) *list)
72 	dup = FN(LIST(EL),alloc)(FN(LIST(EL),get_ctx)(list), list->n);
76 		dup = FN(LIST(EL),add)(dup, FN(EL,copy)(list->p[i]));
80 __isl_give LIST(EL) *FN(LIST(EL),cow)(__isl_take LIST(EL) *list)
88 	return FN(LIST(EL),dup)(list);
97 static __isl_give LIST(EL) *FN(LIST(EL),grow)(__isl_take LIST(EL) *list, int n)
108 	ctx = FN(LIST(EL),get_ctx)(list);
114 			return FN(LIST(EL),free)(list);
122 	res = FN(LIST(EL),alloc)(ctx, new_size);
124 		return FN(LIST(EL),free)(list);
127 		res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
129 	FN(LIST(EL),free)(list);
133 __isl_give LIST(EL) *FN(LIST(EL),add)(__isl_take LIST(EL) *list,
136 	list = FN(LIST(EL),grow)(list, 1);
143 	FN(EL,free)(el);
144 	FN(LIST(EL),free)(list);
150 __isl_give LIST(EL) *FN(LIST(EL),drop)(__isl_take LIST(EL) *list,
159 			"index out of bounds", return FN(LIST(EL),free)(list));
162 	list = FN(LIST(EL),cow)(list);
166 		FN(EL,free)(list->p[first + i]);
180 __isl_give LIST(EL) *FN(LIST(EL),insert)(__isl_take LIST(EL) *list,
189 	ctx = FN(LIST(EL),get_ctx)(list);
202 	res = FN(LIST(EL),alloc)(ctx, list->n + 1);
204 		res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
205 	res = FN(LIST(EL),add)(res, el);
207 		res = FN(LIST(EL),add)(res, FN(EL,copy)(list->p[i]));
208 	FN(LIST(EL),free)(list);
212 	FN(EL,free)(el);
213 	FN(LIST(EL),free)(list);
217 void *FN(LIST(EL),free)(__isl_take LIST(EL) *list)
229 		FN(EL,free)(list->p[i]);
235 int FN(FN(LIST(EL),n),BASE)(__isl_keep LIST(EL) *list)
240 __isl_give EL *FN(FN(LIST(EL),get),BASE)(__isl_keep LIST(EL) *list, int index)
247 	return FN(EL,copy)(list->p[index]);
252 __isl_give LIST(EL) *FN(FN(LIST(EL),set),BASE)(__isl_take LIST(EL) *list,
261 		FN(EL,free)(el);
264 	list = FN(LIST(EL),cow)(list);
267 	FN(EL,free)(list->p[index]);
271 	FN(EL,free)(el);
272 	FN(LIST(EL),free)(list);
276 int FN(LIST(EL),foreach)(__isl_keep LIST(EL) *list,
285 		EL *el = FN(EL,copy(list->p[i]));
308 static int FN(LIST(EL),cmp)(const void *a, const void *b, void *user)
320 __isl_give LIST(EL) *FN(LIST(EL),sort)(__isl_take LIST(EL) *list,
329 	list = FN(LIST(EL),cow)(list);
334 			&FN(LIST(EL),cmp), &data) < 0)
335 		return FN(LIST(EL),free)(list);
355 static int FN(LIST(EL),follows)(int i, int j, void *user)
366 static int FN(LIST(EL),call_on_scc)(__isl_keep LIST(EL) *list, int *pos, int n,
373 	ctx = FN(LIST(EL),get_ctx)(list);
374 	slice = FN(LIST(EL),alloc)(ctx, n);
378 		el = FN(EL,copy)(list->p[pos[i]]);
379 		slice = FN(LIST(EL),add)(slice, el);
397 int FN(LIST(EL),foreach_scc)(__isl_keep LIST(EL) *list,
412 		return fn(FN(LIST(EL),copy)(list), fn_user);
414 	ctx = FN(LIST(EL),get_ctx)(list);
416 	g = isl_tarjan_graph_init(ctx, n, &FN(LIST(EL),follows), &data);
433 			return fn(FN(LIST(EL),copy)(list), fn_user);
435 		if (FN(LIST(EL),call_on_scc)(list, g->order + first, i - first,
446 __isl_give LIST(EL) *FN(FN(LIST(EL),from),BASE)(__isl_take EL *el)
453 	ctx = FN(EL,get_ctx)(el);
454 	list = FN(LIST(EL),alloc)(ctx, 1);
457 	list = FN(LIST(EL),add)(list, el);
460 	FN(EL,free)(el);
464 __isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
474 	ctx = FN(LIST(EL),get_ctx)(list1);
475 	res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
477 		res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
479 		res = FN(LIST(EL),add)(res, FN(EL,copy)(list2->p[i]));
481 	FN(LIST(EL),free)(list1);
482 	FN(LIST(EL),free)(list2);
485 	FN(LIST(EL),free)(list1);
486 	FN(LIST(EL),free)(list2);
510 void FN(LIST(EL),dump)(__isl_keep LIST(EL) *list)
517 	printer = isl_printer_to_file(FN(LIST(EL),get_ctx)(list), stderr);