11 #include <isl/stream.h>
14 #include <isl/union_set.h>
15 #include <isl/union_map.h>
16 #include <isl/vertices.h>
18 #include <isl/schedule.h>
19 #include <isl/ast_build.h>
20 #include <isl/printer.h>
21 #include <isl_obj_list.h>
22 #include <isl_obj_str.h>
23 #include <barvinok/isl.h>
24 #include <barvinok/options.h>
25 #include "lattice_width.h"
32 static isl_ctx
*main_ctx
;
34 static void handler(int signum
)
36 if (isl_ctx_aborted(main_ctx
))
38 isl_ctx_abort(main_ctx
);
41 static struct sigaction sa_old
;
43 static void install_signal_handler(isl_ctx
*ctx
)
49 memset(&sa
, 0, sizeof(struct sigaction
));
50 sa
.sa_handler
= &handler
;
51 sa
.sa_flags
= SA_RESTART
;
52 sigaction(SIGINT
, &sa
, &sa_old
);
55 static void remove_signal_handler(isl_ctx
*ctx
)
57 sigaction(SIGINT
, &sa_old
, NULL
);
62 static void install_signal_handler(isl_ctx
*ctx
)
66 static void remove_signal_handler(isl_ctx
*ctx
)
76 int pet_options_set_autodetect(isl_ctx
*ctx
, int val
)
80 int pet_options_set_encapsulate_dynamic_control(isl_ctx
*ctx
, int val
)
86 static int iscc_bool_false
= 0;
87 static int iscc_bool_true
= 1;
88 static int iscc_bool_error
= -1;
90 enum iscc_op
{ ISCC_READ
, ISCC_WRITE
, ISCC_SOURCE
, ISCC_VERTICES
,
91 ISCC_LAST
, ISCC_ANY
, ISCC_BEFORE
, ISCC_UNDER
,
93 ISCC_MINIMIZING
, ISCC_RESPECTING
,
94 ISCC_CODEGEN
, ISCC_USING
,
95 ISCC_TYPEOF
, ISCC_PRINT
, ISCC_ASSERT
,
97 static const char *op_name
[ISCC_N_OP
] = {
98 [ISCC_ASSERT
] = "assert",
100 [ISCC_WRITE
] = "write",
101 [ISCC_PRINT
] = "print",
102 [ISCC_SOURCE
] = "source",
103 [ISCC_VERTICES
] = "vertices",
104 [ISCC_LAST
] = "last",
106 [ISCC_BEFORE
] = "before",
107 [ISCC_UNDER
] = "under",
108 [ISCC_SCHEDULE
] = "schedule",
109 [ISCC_MINIMIZING
] = "minimizing",
110 [ISCC_RESPECTING
] = "respecting",
111 [ISCC_CODEGEN
] = "codegen",
112 [ISCC_USING
] = "using",
113 [ISCC_TYPEOF
] = "typeof"
115 static enum isl_token_type iscc_op
[ISCC_N_OP
];
117 struct isl_arg_choice iscc_format
[] = {
118 {"isl", ISL_FORMAT_ISL
},
119 {"omega", ISL_FORMAT_OMEGA
},
120 {"polylib", ISL_FORMAT_POLYLIB
},
121 {"ext-polylib", ISL_FORMAT_EXT_POLYLIB
},
122 {"latex", ISL_FORMAT_LATEX
},
127 struct iscc_options
{
128 struct barvinok_options
*barvinok
;
129 struct pet_options
*pet
;
134 ISL_ARGS_START(struct iscc_options
, iscc_options_args
)
135 ISL_ARG_CHILD(struct iscc_options
, barvinok
, "barvinok", &barvinok_options_args
,
138 ISL_ARG_CHILD(struct iscc_options
, pet
, "pet", &pet_options_args
, "pet options")
140 ISL_ARG_CHOICE(struct iscc_options
, format
, 0, "format", \
141 iscc_format
, ISL_FORMAT_ISL
, "output format")
142 ISL_ARG_BOOL(struct iscc_options
, io
, 0, "io", 1,
143 "allow read and write operations")
146 ISL_ARG_DEF(iscc_options
, struct iscc_options
, iscc_options_args
)
147 ISL_ARG_CTX_DEF(iscc_options
, struct iscc_options
, iscc_options_args
)
149 static void *isl_obj_bool_copy(void *v
)
154 static void isl_obj_bool_free(void *v
)
158 static __isl_give isl_printer
*isl_obj_bool_print(__isl_take isl_printer
*p
,
161 if (v
== &iscc_bool_true
)
162 return isl_printer_print_str(p
, "True");
163 else if (v
== &iscc_bool_false
)
164 return isl_printer_print_str(p
, "False");
166 return isl_printer_print_str(p
, "Error");
169 static void *isl_obj_bool_add(void *v1
, void *v2
)
174 struct isl_obj_vtable isl_obj_bool_vtable
= {
180 #define isl_obj_bool (&isl_obj_bool_vtable)
182 int *iscc_bool_from_int(int res
)
184 return res
< 0 ? &iscc_bool_error
:
185 res
? &iscc_bool_true
: &iscc_bool_false
;
188 /* Conjunction of "b1" and "b2".
189 * The result is returned as an integer because it is post-processed by
190 * iscc_bool_from_int.
192 static int isl_bool_and(isl_bool
*b1
, __isl_take isl_bool
*b2
)
194 if (b1
== &iscc_bool_error
|| b2
== &iscc_bool_error
)
196 return b1
== &iscc_bool_true
&& b2
== &iscc_bool_true
;
199 /* Disjunction of "b1" and "b2".
200 * The result is returned as an integer because it is post-processed by
201 * iscc_bool_from_int.
203 static int isl_bool_or(isl_bool
*b1
, __isl_take isl_bool
*b2
)
205 if (b1
== &iscc_bool_error
|| b2
== &iscc_bool_error
)
207 return b1
== &iscc_bool_true
|| b2
== &iscc_bool_true
;
210 static int isl_union_map_is_superset(__isl_take isl_union_map
*map1
,
211 __isl_take isl_union_map
*map2
)
213 return isl_union_map_is_subset(map2
, map1
);
215 static int isl_union_set_is_superset(__isl_take isl_union_set
*set1
,
216 __isl_take isl_union_set
*set2
)
218 return isl_union_set_is_subset(set2
, set1
);
221 static int isl_union_map_is_strict_superset(__isl_take isl_union_map
*map1
,
222 __isl_take isl_union_map
*map2
)
224 return isl_union_map_is_strict_subset(map2
, map1
);
226 static int isl_union_set_is_strict_superset(__isl_take isl_union_set
*set1
,
227 __isl_take isl_union_set
*set2
)
229 return isl_union_set_is_strict_subset(set2
, set1
);
232 extern struct isl_obj_vtable isl_obj_list_vtable
;
233 #define isl_obj_list (&isl_obj_list_vtable)
235 typedef void *(*isc_bin_op_fn
)(void *lhs
, void *rhs
);
236 typedef int (*isc_bin_test_fn
)(void *lhs
, void *rhs
);
238 enum isl_token_type op
;
244 isc_bin_test_fn test
;
247 struct isc_named_bin_op
{
249 struct isc_bin_op op
;
251 /* Compound binary operator.
252 * "full" is only used to generate a unique token number for op.op
253 * in register_named_ops.
254 * "op1" is the first part of the compound operator.
255 * "op2" is the second part of the compound operator.
257 struct iscc_compound_bin_op
{
259 enum isl_token_type op1
;
260 enum isl_token_type op2
;
261 struct isc_bin_op op
;
265 isl_union_pw_qpolynomial
*upwqp
;
266 isl_union_pw_qpolynomial
*res
;
269 static isl_stat
eval_at(__isl_take isl_point
*pnt
, void *user
)
271 struct iscc_at
*at
= (struct iscc_at
*) user
;
276 set
= isl_set_from_point(isl_point_copy(pnt
));
277 v
= isl_union_pw_qpolynomial_eval(
278 isl_union_pw_qpolynomial_copy(at
->upwqp
), pnt
);
279 qp
= isl_qpolynomial_val_on_domain(isl_set_get_space(set
), v
);
281 at
->res
= isl_union_pw_qpolynomial_add(at
->res
,
282 isl_union_pw_qpolynomial_from_pw_qpolynomial(
283 isl_pw_qpolynomial_alloc(set
, qp
)));
288 __isl_give isl_union_pw_qpolynomial
*isl_union_pw_qpolynomial_at(
289 __isl_take isl_union_pw_qpolynomial
*upwqp
,
290 __isl_take isl_union_set
*uset
)
295 at
.res
= isl_union_pw_qpolynomial_zero(isl_union_set_get_space(uset
));
297 isl_union_set_foreach_point(uset
, eval_at
, &at
);
299 isl_union_pw_qpolynomial_free(upwqp
);
300 isl_union_set_free(uset
);
305 struct iscc_fold_at
{
306 isl_union_pw_qpolynomial_fold
*upwf
;
307 isl_union_pw_qpolynomial
*res
;
310 static isl_stat
eval_fold_at(__isl_take isl_point
*pnt
, void *user
)
312 struct iscc_fold_at
*at
= (struct iscc_fold_at
*) user
;
317 set
= isl_set_from_point(isl_point_copy(pnt
));
318 v
= isl_union_pw_qpolynomial_fold_eval(
319 isl_union_pw_qpolynomial_fold_copy(at
->upwf
), pnt
);
320 qp
= isl_qpolynomial_val_on_domain(isl_set_get_space(set
), v
);
322 at
->res
= isl_union_pw_qpolynomial_add(at
->res
,
323 isl_union_pw_qpolynomial_from_pw_qpolynomial(
324 isl_pw_qpolynomial_alloc(set
, qp
)));
329 __isl_give isl_union_pw_qpolynomial
*isl_union_pw_qpolynomial_fold_at(
330 __isl_take isl_union_pw_qpolynomial_fold
*upwf
,
331 __isl_take isl_union_set
*uset
)
333 struct iscc_fold_at at
;
336 at
.res
= isl_union_pw_qpolynomial_zero(isl_union_set_get_space(uset
));
338 isl_union_set_foreach_point(uset
, eval_fold_at
, &at
);
340 isl_union_pw_qpolynomial_fold_free(upwf
);
341 isl_union_set_free(uset
);
346 static __isl_give isl_union_pw_qpolynomial_fold
*union_pw_qpolynomial_add_union_pw_qpolynomial_fold(
347 __isl_take isl_union_pw_qpolynomial
*upwqp
,
348 __isl_take isl_union_pw_qpolynomial_fold
*upwf
)
350 return isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial(upwf
,
354 static __isl_give
struct isl_list
*union_map_apply_union_pw_qpolynomial_fold(
355 __isl_take isl_union_map
*umap
,
356 __isl_take isl_union_pw_qpolynomial_fold
*upwf
)
359 struct isl_list
*list
;
362 ctx
= isl_union_map_get_ctx(umap
);
363 list
= isl_list_alloc(ctx
, 2);
367 list
->obj
[0].type
= isl_obj_union_pw_qpolynomial_fold
;
368 list
->obj
[0].v
= isl_union_map_apply_union_pw_qpolynomial_fold(umap
,
370 list
->obj
[1].type
= isl_obj_bool
;
371 list
->obj
[1].v
= tight
? &iscc_bool_true
: &iscc_bool_false
;
372 if (tight
< 0 || !list
->obj
[0].v
)
377 isl_union_map_free(umap
);
378 isl_union_pw_qpolynomial_fold_free(upwf
);
384 static __isl_give
struct isl_list
*union_set_apply_union_pw_qpolynomial_fold(
385 __isl_take isl_union_set
*uset
,
386 __isl_take isl_union_pw_qpolynomial_fold
*upwf
)
389 struct isl_list
*list
;
392 ctx
= isl_union_set_get_ctx(uset
);
393 list
= isl_list_alloc(ctx
, 2);
397 list
->obj
[0].type
= isl_obj_union_pw_qpolynomial_fold
;
398 list
->obj
[0].v
= isl_union_set_apply_union_pw_qpolynomial_fold(uset
,
400 list
->obj
[1].type
= isl_obj_bool
;
401 list
->obj
[1].v
= tight
? &iscc_bool_true
: &iscc_bool_false
;
402 if (tight
< 0 || !list
->obj
[0].v
)
407 isl_union_set_free(uset
);
408 isl_union_pw_qpolynomial_fold_free(upwf
);
414 static __isl_give isl_union_pw_qpolynomial
*isl_val_mul_union_pw_qpolynomial(
415 __isl_take isl_val
*v
, __isl_take isl_union_pw_qpolynomial
*upwqp
)
417 return isl_union_pw_qpolynomial_scale_val(upwqp
, v
);
420 static __isl_give isl_union_pw_qpolynomial_fold
*
421 int_val_mul_union_pw_qpolynomial_fold(__isl_take isl_val
*v
,
422 __isl_take isl_union_pw_qpolynomial_fold
*upwf
)
424 return isl_union_pw_qpolynomial_fold_scale_val(upwf
, v
);
427 /* Are the two strings "str1" and "str2" equal to each other?
429 static int str_eq(__isl_keep isl_str
*str1
, __isl_keep isl_str
*str2
)
434 return !strcmp(str1
->s
, str2
->s
);
437 struct isc_bin_op bin_ops
[] = {
438 { '+', isl_obj_bool
, isl_obj_bool
, isl_obj_bool
,
439 (isc_bin_op_fn
) &isl_bool_or
},
440 { '*', isl_obj_bool
, isl_obj_bool
, isl_obj_bool
,
441 (isc_bin_op_fn
) &isl_bool_and
},
442 { '+', isl_obj_val
, isl_obj_val
, isl_obj_val
,
443 (isc_bin_op_fn
) &isl_val_add
},
444 { '-', isl_obj_val
, isl_obj_val
, isl_obj_val
,
445 (isc_bin_op_fn
) &isl_val_sub
},
446 { '*', isl_obj_val
, isl_obj_val
, isl_obj_val
,
447 (isc_bin_op_fn
) &isl_val_mul
},
448 { '+', isl_obj_pw_multi_aff
, isl_obj_pw_multi_aff
,
449 isl_obj_pw_multi_aff
,
450 (isc_bin_op_fn
) &isl_pw_multi_aff_add
},
451 { '+', isl_obj_union_set
, isl_obj_union_set
,
453 (isc_bin_op_fn
) &isl_union_set_union
},
454 { '+', isl_obj_union_map
, isl_obj_union_map
,
456 (isc_bin_op_fn
) &isl_union_map_union
},
457 { '-', isl_obj_union_set
, isl_obj_union_set
,
459 (isc_bin_op_fn
) &isl_union_set_subtract
},
460 { '-', isl_obj_union_map
, isl_obj_union_map
,
462 (isc_bin_op_fn
) &isl_union_map_subtract
},
463 { '-', isl_obj_union_map
, isl_obj_union_set
,
465 (isc_bin_op_fn
) &isl_union_map_subtract_domain
},
466 { '*', isl_obj_union_set
, isl_obj_union_set
,
468 (isc_bin_op_fn
) &isl_union_set_intersect
},
469 { '*', isl_obj_union_map
, isl_obj_union_map
,
471 (isc_bin_op_fn
) &isl_union_map_intersect
},
472 { '*', isl_obj_union_map
, isl_obj_union_set
,
474 (isc_bin_op_fn
) &isl_union_map_intersect_domain
},
475 { '.', isl_obj_union_map
, isl_obj_union_map
,
477 (isc_bin_op_fn
) &isl_union_map_apply_range
},
478 { '.', isl_obj_union_map
, isl_obj_union_pw_qpolynomial
,
479 isl_obj_union_pw_qpolynomial
,
480 (isc_bin_op_fn
) &isl_union_map_apply_union_pw_qpolynomial
},
481 { '.', isl_obj_union_map
, isl_obj_union_pw_qpolynomial_fold
,
483 (isc_bin_op_fn
) &union_map_apply_union_pw_qpolynomial_fold
},
484 { ISL_TOKEN_TO
, isl_obj_union_set
, isl_obj_union_set
,
486 (isc_bin_op_fn
) &isl_union_map_from_domain_and_range
},
487 { '=', isl_obj_union_set
, isl_obj_union_set
, isl_obj_bool
,
488 { .test
= (isc_bin_test_fn
) &isl_union_set_is_equal
} },
489 { '=', isl_obj_union_map
, isl_obj_union_map
, isl_obj_bool
,
490 { .test
= (isc_bin_test_fn
) &isl_union_map_is_equal
} },
491 { ISL_TOKEN_LE
, isl_obj_union_set
, isl_obj_union_set
,
493 { .test
= (isc_bin_test_fn
) &isl_union_set_is_subset
} },
494 { ISL_TOKEN_LE
, isl_obj_union_map
, isl_obj_union_map
,
496 { .test
= (isc_bin_test_fn
) &isl_union_map_is_subset
} },
497 { ISL_TOKEN_LT
, isl_obj_union_set
, isl_obj_union_set
,
499 { .test
= (isc_bin_test_fn
) &isl_union_set_is_strict_subset
} },
500 { ISL_TOKEN_LT
, isl_obj_union_map
, isl_obj_union_map
,
502 { .test
= (isc_bin_test_fn
) &isl_union_map_is_strict_subset
} },
503 { ISL_TOKEN_GE
, isl_obj_union_set
, isl_obj_union_set
,
505 { .test
= (isc_bin_test_fn
) &isl_union_set_is_superset
} },
506 { ISL_TOKEN_GE
, isl_obj_union_map
, isl_obj_union_map
,
508 { .test
= (isc_bin_test_fn
) &isl_union_map_is_superset
} },
509 { ISL_TOKEN_GT
, isl_obj_union_set
, isl_obj_union_set
,
512 (isc_bin_test_fn
) &isl_union_set_is_strict_superset
} },
513 { ISL_TOKEN_GT
, isl_obj_union_map
, isl_obj_union_map
,
516 (isc_bin_test_fn
) &isl_union_map_is_strict_superset
} },
517 { ISL_TOKEN_LEX_LE
, isl_obj_union_set
, isl_obj_union_set
,
519 (isc_bin_op_fn
) &isl_union_set_lex_le_union_set
},
520 { ISL_TOKEN_LEX_LT
, isl_obj_union_set
, isl_obj_union_set
,
522 (isc_bin_op_fn
) &isl_union_set_lex_lt_union_set
},
523 { ISL_TOKEN_LEX_GE
, isl_obj_union_set
, isl_obj_union_set
,
525 (isc_bin_op_fn
) &isl_union_set_lex_ge_union_set
},
526 { ISL_TOKEN_LEX_GT
, isl_obj_union_set
, isl_obj_union_set
,
528 (isc_bin_op_fn
) &isl_union_set_lex_gt_union_set
},
529 { ISL_TOKEN_LEX_LE
, isl_obj_union_map
, isl_obj_union_map
,
531 (isc_bin_op_fn
) &isl_union_map_lex_le_union_map
},
532 { ISL_TOKEN_LEX_LT
, isl_obj_union_map
, isl_obj_union_map
,
534 (isc_bin_op_fn
) &isl_union_map_lex_lt_union_map
},
535 { ISL_TOKEN_LEX_GE
, isl_obj_union_map
, isl_obj_union_map
,
537 (isc_bin_op_fn
) &isl_union_map_lex_ge_union_map
},
538 { ISL_TOKEN_LEX_GT
, isl_obj_union_map
, isl_obj_union_map
,
540 (isc_bin_op_fn
) &isl_union_map_lex_gt_union_map
},
541 { '.', isl_obj_union_pw_qpolynomial_fold
,
542 isl_obj_union_pw_qpolynomial_fold
,
543 isl_obj_union_pw_qpolynomial_fold
,
544 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_fold
},
545 { '+', isl_obj_union_pw_qpolynomial
, isl_obj_union_pw_qpolynomial
,
546 isl_obj_union_pw_qpolynomial
,
547 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_add
},
548 { '+', isl_obj_union_pw_qpolynomial
,
549 isl_obj_union_pw_qpolynomial_fold
,
550 isl_obj_union_pw_qpolynomial_fold
,
551 (isc_bin_op_fn
) &union_pw_qpolynomial_add_union_pw_qpolynomial_fold
},
552 { '+', isl_obj_union_pw_qpolynomial_fold
,
553 isl_obj_union_pw_qpolynomial
,
554 isl_obj_union_pw_qpolynomial_fold
,
555 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_add_union_pw_qpolynomial
},
556 { '-', isl_obj_union_pw_qpolynomial
, isl_obj_union_pw_qpolynomial
,
557 isl_obj_union_pw_qpolynomial
,
558 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_sub
},
559 { '*', isl_obj_val
, isl_obj_union_pw_qpolynomial
,
560 isl_obj_union_pw_qpolynomial
,
561 (isc_bin_op_fn
) &isl_val_mul_union_pw_qpolynomial
},
562 { '*', isl_obj_union_pw_qpolynomial
, isl_obj_val
,
563 isl_obj_union_pw_qpolynomial
,
564 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_scale_val
},
565 { '*', isl_obj_val
, isl_obj_union_pw_qpolynomial_fold
,
566 isl_obj_union_pw_qpolynomial_fold
,
567 (isc_bin_op_fn
) &int_val_mul_union_pw_qpolynomial_fold
},
568 { '*', isl_obj_union_pw_qpolynomial_fold
, isl_obj_val
,
569 isl_obj_union_pw_qpolynomial_fold
,
570 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_scale_val
},
571 { '*', isl_obj_union_pw_qpolynomial
, isl_obj_union_pw_qpolynomial
,
572 isl_obj_union_pw_qpolynomial
,
573 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_mul
},
574 { '*', isl_obj_union_pw_qpolynomial
, isl_obj_union_set
,
575 isl_obj_union_pw_qpolynomial
,
576 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_intersect_domain
},
577 { '*', isl_obj_union_pw_qpolynomial_fold
, isl_obj_union_set
,
578 isl_obj_union_pw_qpolynomial_fold
,
579 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_intersect_domain
},
580 { '@', isl_obj_union_pw_qpolynomial
, isl_obj_union_set
,
581 isl_obj_union_pw_qpolynomial
,
582 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_at
},
583 { '@', isl_obj_union_pw_qpolynomial_fold
, isl_obj_union_set
,
584 isl_obj_union_pw_qpolynomial
,
585 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_at
},
586 { '%', isl_obj_union_set
, isl_obj_union_set
,
588 (isc_bin_op_fn
) &isl_union_set_gist
},
589 { '%', isl_obj_union_map
, isl_obj_union_map
,
591 (isc_bin_op_fn
) &isl_union_map_gist
},
592 { '%', isl_obj_union_map
, isl_obj_union_set
,
594 (isc_bin_op_fn
) &isl_union_map_gist_domain
},
595 { '%', isl_obj_union_pw_qpolynomial
, isl_obj_union_set
,
596 isl_obj_union_pw_qpolynomial
,
597 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_gist
},
598 { '%', isl_obj_union_pw_qpolynomial_fold
, isl_obj_union_set
,
599 isl_obj_union_pw_qpolynomial_fold
,
600 (isc_bin_op_fn
) &isl_union_pw_qpolynomial_fold_gist
},
601 { ISL_TOKEN_EQ_EQ
, isl_obj_union_pw_qpolynomial
,
602 isl_obj_union_pw_qpolynomial
, isl_obj_bool
,
603 { .test
= (isc_bin_test_fn
)
604 &isl_union_pw_qpolynomial_plain_is_equal
} },
605 { ISL_TOKEN_EQ_EQ
, isl_obj_union_pw_qpolynomial_fold
,
606 isl_obj_union_pw_qpolynomial_fold
, isl_obj_bool
,
607 { .test
= (isc_bin_test_fn
)
608 &isl_union_pw_qpolynomial_fold_plain_is_equal
} },
609 { '+', isl_obj_str
, isl_obj_str
, isl_obj_str
,
610 (isc_bin_op_fn
) &isl_str_concat
},
611 { '=', isl_obj_str
, isl_obj_str
, isl_obj_bool
,
612 { .test
= (isc_bin_test_fn
) &str_eq
} },
616 struct iscc_compound_bin_op compound_bin_ops
[] = {
617 { "->*", ISL_TOKEN_TO
, '*',
618 { -1, isl_obj_union_map
, isl_obj_union_set
,
620 (isc_bin_op_fn
) &isl_union_map_intersect_range
} },
621 { "->-", ISL_TOKEN_TO
, '-',
622 { -1, isl_obj_union_map
, isl_obj_union_set
,
624 (isc_bin_op_fn
) &isl_union_map_subtract_range
} },
628 static __isl_give isl_union_map
*map_after_map(__isl_take isl_union_map
*umap1
,
629 __isl_take isl_union_map
*umap2
)
631 return isl_union_map_apply_range(umap2
, umap1
);
634 static __isl_give isl_union_pw_qpolynomial
*qpolynomial_after_map(
635 __isl_take isl_union_pw_qpolynomial
*upwqp
,
636 __isl_take isl_union_map
*umap
)
638 return isl_union_map_apply_union_pw_qpolynomial(umap
, upwqp
);
641 static __isl_give
struct isl_list
*qpolynomial_fold_after_map(
642 __isl_take isl_union_pw_qpolynomial_fold
*upwf
,
643 __isl_take isl_union_map
*umap
)
645 return union_map_apply_union_pw_qpolynomial_fold(umap
, upwf
);
648 struct isc_named_bin_op named_bin_ops
[] = {
649 { "after", { -1, isl_obj_union_map
, isl_obj_union_map
,
651 (isc_bin_op_fn
) &map_after_map
} },
652 { "after", { -1, isl_obj_union_pw_qpolynomial
,
653 isl_obj_union_map
, isl_obj_union_pw_qpolynomial
,
654 (isc_bin_op_fn
) &qpolynomial_after_map
} },
655 { "after", { -1, isl_obj_union_pw_qpolynomial_fold
,
656 isl_obj_union_map
, isl_obj_list
,
657 (isc_bin_op_fn
) &qpolynomial_fold_after_map
} },
658 { "before", { -1, isl_obj_union_map
, isl_obj_union_map
,
660 (isc_bin_op_fn
) &isl_union_map_apply_range
} },
661 { "before", { -1, isl_obj_union_map
,
662 isl_obj_union_pw_qpolynomial
, isl_obj_union_pw_qpolynomial
,
663 (isc_bin_op_fn
) &isl_union_map_apply_union_pw_qpolynomial
} },
664 { "before", { -1, isl_obj_union_map
,
665 isl_obj_union_pw_qpolynomial_fold
, isl_obj_list
,
666 (isc_bin_op_fn
) &union_map_apply_union_pw_qpolynomial_fold
} },
667 { "cross", { -1, isl_obj_union_set
, isl_obj_union_set
,
669 (isc_bin_op_fn
) &isl_union_set_product
} },
670 { "cross", { -1, isl_obj_union_map
, isl_obj_union_map
,
672 (isc_bin_op_fn
) &isl_union_map_product
} },
673 { "cross_range", { -1, isl_obj_union_map
,
674 isl_obj_union_map
, isl_obj_union_map
,
675 (isc_bin_op_fn
) &isl_union_map_range_product
} },
679 __isl_give isl_set
*union_set_sample(__isl_take isl_union_set
*uset
)
681 return isl_set_from_basic_set(isl_union_set_sample(uset
));
684 __isl_give isl_map
*union_map_sample(__isl_take isl_union_map
*umap
)
686 return isl_map_from_basic_map(isl_union_map_sample(umap
));
689 static __isl_give
struct isl_list
*union_map_power(
690 __isl_take isl_union_map
*umap
)
693 struct isl_list
*list
;
696 ctx
= isl_union_map_get_ctx(umap
);
697 list
= isl_list_alloc(ctx
, 2);
701 list
->obj
[0].type
= isl_obj_union_map
;
702 list
->obj
[0].v
= isl_union_map_power(umap
, &exact
);
703 list
->obj
[1].type
= isl_obj_bool
;
704 list
->obj
[1].v
= exact
? &iscc_bool_true
: &iscc_bool_false
;
705 if (exact
< 0 || !list
->obj
[0].v
)
710 isl_union_map_free(umap
);
716 /* Compute a lower or upper bound on "upwqp" depending on "type" and
717 * return a list containing two elements, the bound and a boolean
718 * indicating whether the result is tight.
720 static __isl_give
struct isl_list
*union_pw_qpolynomial_bound(
721 __isl_take isl_union_pw_qpolynomial
*upwqp
, enum isl_fold type
)
724 struct isl_list
*list
;
727 ctx
= isl_union_pw_qpolynomial_get_ctx(upwqp
);
728 list
= isl_list_alloc(ctx
, 2);
732 list
->obj
[0].type
= isl_obj_union_pw_qpolynomial_fold
;
733 list
->obj
[0].v
= isl_union_pw_qpolynomial_bound(upwqp
, type
, &tight
);
734 list
->obj
[1].type
= isl_obj_bool
;
735 list
->obj
[1].v
= tight
? &iscc_bool_true
: &iscc_bool_false
;
736 if (tight
< 0 || !list
->obj
[0].v
)
741 isl_union_pw_qpolynomial_free(upwqp
);
747 /* Compute a lower bound on "upwqp" and return a list containing
748 * two elements, the bound and a booleanindicating whether
749 * the result is tight.
751 static __isl_give
struct isl_list
*union_pw_qpolynomial_lower_bound(
752 __isl_take isl_union_pw_qpolynomial
*upwqp
)
754 return union_pw_qpolynomial_bound(upwqp
, isl_fold_min
);
757 /* Compute a upper bound on "upwqp" and return a list containing
758 * two elements, the bound and a booleanindicating whether
759 * the result is tight.
761 static __isl_give
struct isl_list
*union_pw_qpolynomial_upper_bound(
762 __isl_take isl_union_pw_qpolynomial
*upwqp
)
764 return union_pw_qpolynomial_bound(upwqp
, isl_fold_max
);
768 /* Collect all statement instances, except those of kill statements.
770 static __isl_give isl_union_set
*collect_non_kill_instances(
771 struct pet_scop
*scop
)
775 isl_union_set
*domain
;
780 domain
= isl_union_set_empty(isl_set_get_space(scop
->context
));
782 for (i
= 0; i
< scop
->n_stmt
; ++i
) {
783 struct pet_stmt
*stmt
= scop
->stmts
[i
];
785 if (pet_stmt_is_kill(stmt
))
787 domain_i
= isl_set_copy(stmt
->domain
);
788 if (scop
->stmts
[i
]->n_arg
> 0)
789 domain_i
= isl_map_domain(isl_set_unwrap(domain_i
));
790 domain
= isl_union_set_add_set(domain
, domain_i
);
796 static __isl_give isl_list
*parse(__isl_take isl_str
*str
)
799 struct isl_list
*list
;
800 struct pet_scop
*scop
;
802 isl_union_map
*may_reads
, *must_writes
, *may_writes
;
803 isl_union_set
*domain
;
804 struct iscc_options
*options
;
810 options
= isl_ctx_peek_iscc_options(ctx
);
811 if (!options
|| !options
->io
) {
813 isl_die(ctx
, isl_error_invalid
,
814 "parse_file operation not allowed", return NULL
);
817 list
= isl_list_alloc(ctx
, 5);
821 scop
= pet_scop_extract_from_C_source(ctx
, str
->s
, NULL
);
822 domain
= collect_non_kill_instances(scop
);
823 sched
= pet_scop_get_schedule(scop
);
824 sched
= isl_schedule_intersect_domain(sched
,
825 isl_union_set_copy(domain
));
826 may_reads
= pet_scop_get_may_reads(scop
);
827 may_writes
= pet_scop_get_may_writes(scop
);
828 must_writes
= pet_scop_get_must_writes(scop
);
831 list
->obj
[0].type
= isl_obj_union_set
;
832 list
->obj
[0].v
= domain
;
833 list
->obj
[1].type
= isl_obj_union_map
;
834 list
->obj
[1].v
= must_writes
;
835 list
->obj
[2].type
= isl_obj_union_map
;
836 list
->obj
[2].v
= may_writes
;
837 list
->obj
[3].type
= isl_obj_union_map
;
838 list
->obj
[3].v
= may_reads
;
839 list
->obj
[4].type
= isl_obj_schedule
;
840 list
->obj
[4].v
= sched
;
842 if (!list
->obj
[0].v
|| !list
->obj
[1].v
||
843 !list
->obj
[2].v
|| !list
->obj
[3].v
|| !list
->obj
[4].v
)
855 static isl_stat
add_point(__isl_take isl_point
*pnt
, void *user
)
857 isl_union_set
**scan
= (isl_union_set
**) user
;
859 *scan
= isl_union_set_add_set(*scan
, isl_set_from_point(pnt
));
864 static __isl_give isl_union_set
*union_set_scan(__isl_take isl_union_set
*uset
)
868 scan
= isl_union_set_empty(isl_union_set_get_space(uset
));
870 if (isl_union_set_foreach_point(uset
, add_point
, &scan
) < 0) {
871 isl_union_set_free(scan
);
875 isl_union_set_free(uset
);
879 static __isl_give isl_union_map
*union_map_scan(__isl_take isl_union_map
*umap
)
881 return isl_union_set_unwrap(union_set_scan(isl_union_map_wrap(umap
)));
884 static __isl_give isl_union_pw_qpolynomial
*union_pw_qpolynomial_poly(
885 __isl_take isl_union_pw_qpolynomial
*upwqp
)
887 return isl_union_pw_qpolynomial_to_polynomial(upwqp
, 0);
890 static __isl_give isl_union_pw_qpolynomial
*union_pw_qpolynomial_lpoly(
891 __isl_take isl_union_pw_qpolynomial
*upwqp
)
893 return isl_union_pw_qpolynomial_to_polynomial(upwqp
, -1);
896 static __isl_give isl_union_pw_qpolynomial
*union_pw_qpolynomial_upoly(
897 __isl_take isl_union_pw_qpolynomial
*upwqp
)
899 return isl_union_pw_qpolynomial_to_polynomial(upwqp
, 1);
902 /* Return the domain of "schedule".
904 static __isl_give isl_union_set
*schedule_domain(
905 __isl_take isl_schedule
*schedule
)
907 isl_union_set
*domain
;
909 domain
= isl_schedule_get_domain(schedule
);
910 isl_schedule_free(schedule
);
915 /* Convert "schedule" to a union map representation.
917 static __isl_give isl_union_map
*schedule_map(__isl_take isl_schedule
*schedule
)
921 map
= isl_schedule_get_map(schedule
);
922 isl_schedule_free(schedule
);
927 typedef void *(*isc_un_op_fn
)(void *arg
);
929 enum isl_token_type op
;
934 struct isc_named_un_op
{
938 struct isc_named_un_op named_un_ops
[] = {
939 {"aff", { -1, isl_obj_union_map
, isl_obj_union_map
,
940 (isc_un_op_fn
) &isl_union_map_affine_hull
} },
941 {"aff", { -1, isl_obj_union_set
, isl_obj_union_set
,
942 (isc_un_op_fn
) &isl_union_set_affine_hull
} },
943 {"card", { -1, isl_obj_union_set
,
944 isl_obj_union_pw_qpolynomial
,
945 (isc_un_op_fn
) &isl_union_set_card
} },
946 {"card", { -1, isl_obj_union_map
,
947 isl_obj_union_pw_qpolynomial
,
948 (isc_un_op_fn
) &isl_union_map_card
} },
949 {"coalesce", { -1, isl_obj_union_set
, isl_obj_union_set
,
950 (isc_un_op_fn
) &isl_union_set_coalesce
} },
951 {"coalesce", { -1, isl_obj_union_map
, isl_obj_union_map
,
952 (isc_un_op_fn
) &isl_union_map_coalesce
} },
953 {"coalesce", { -1, isl_obj_union_pw_qpolynomial
,
954 isl_obj_union_pw_qpolynomial
,
955 (isc_un_op_fn
) &isl_union_pw_qpolynomial_coalesce
} },
956 {"coalesce", { -1, isl_obj_union_pw_qpolynomial_fold
,
957 isl_obj_union_pw_qpolynomial_fold
,
958 (isc_un_op_fn
) &isl_union_pw_qpolynomial_fold_coalesce
} },
959 {"coefficients", { -1, isl_obj_union_set
,
961 (isc_un_op_fn
) &isl_union_set_coefficients
} },
962 {"solutions", { -1, isl_obj_union_set
, isl_obj_union_set
,
963 (isc_un_op_fn
) &isl_union_set_solutions
} },
964 {"deltas", { -1, isl_obj_union_map
, isl_obj_union_set
,
965 (isc_un_op_fn
) &isl_union_map_deltas
} },
966 {"deltas_map", { -1, isl_obj_union_map
, isl_obj_union_map
,
967 (isc_un_op_fn
) &isl_union_map_deltas_map
} },
968 {"dom", { -1, isl_obj_schedule
, isl_obj_union_set
,
969 (isc_un_op_fn
) &schedule_domain
} },
970 {"dom", { -1, isl_obj_union_map
, isl_obj_union_set
,
971 (isc_un_op_fn
) &isl_union_map_domain
} },
972 {"dom", { -1, isl_obj_union_pw_qpolynomial
, isl_obj_union_set
,
973 (isc_un_op_fn
) &isl_union_pw_qpolynomial_domain
} },
974 {"dom", { -1, isl_obj_union_pw_qpolynomial_fold
,
976 (isc_un_op_fn
) &isl_union_pw_qpolynomial_fold_domain
} },
977 {"domain", { -1, isl_obj_schedule
, isl_obj_union_set
,
978 (isc_un_op_fn
) &schedule_domain
} },
979 {"domain", { -1, isl_obj_union_map
, isl_obj_union_set
,
980 (isc_un_op_fn
) &isl_union_map_domain
} },
981 {"domain", { -1, isl_obj_union_pw_qpolynomial
,
983 (isc_un_op_fn
) &isl_union_pw_qpolynomial_domain
} },
984 {"domain", { -1, isl_obj_union_pw_qpolynomial_fold
,
986 (isc_un_op_fn
) &isl_union_pw_qpolynomial_fold_domain
} },
987 {"domain_map", { -1, isl_obj_union_map
, isl_obj_union_map
,
988 (isc_un_op_fn
) &isl_union_map_domain_map
} },
989 {"ran", { -1, isl_obj_union_map
, isl_obj_union_set
,
990 (isc_un_op_fn
) &isl_union_map_range
} },
991 {"range", { -1, isl_obj_union_map
, isl_obj_union_set
,
992 (isc_un_op_fn
) &isl_union_map_range
} },
993 {"range_map", { -1, isl_obj_union_map
, isl_obj_union_map
,
994 (isc_un_op_fn
) &isl_union_map_range_map
} },
995 {"identity", { -1, isl_obj_union_set
, isl_obj_union_map
,
996 (isc_un_op_fn
) &isl_union_set_identity
} },
997 {"lattice_width", { -1, isl_obj_union_set
,
998 isl_obj_union_pw_qpolynomial
,
999 (isc_un_op_fn
) &isl_union_set_lattice_width
} },
1000 {"lb", { -1, isl_obj_union_pw_qpolynomial
, isl_obj_list
,
1001 (isc_un_op_fn
) &union_pw_qpolynomial_lower_bound
} },
1002 {"lexmin", { -1, isl_obj_union_map
, isl_obj_union_map
,
1003 (isc_un_op_fn
) &isl_union_map_lexmin
} },
1004 {"lexmax", { -1, isl_obj_union_map
, isl_obj_union_map
,
1005 (isc_un_op_fn
) &isl_union_map_lexmax
} },
1006 {"lexmin", { -1, isl_obj_union_set
, isl_obj_union_set
,
1007 (isc_un_op_fn
) &isl_union_set_lexmin
} },
1008 {"lexmax", { -1, isl_obj_union_set
, isl_obj_union_set
,
1009 (isc_un_op_fn
) &isl_union_set_lexmax
} },
1010 {"lift", { -1, isl_obj_union_set
, isl_obj_union_set
,
1011 (isc_un_op_fn
) &isl_union_set_lift
} },
1012 {"map", { -1, isl_obj_schedule
, isl_obj_union_map
,
1013 (isc_un_op_fn
) &schedule_map
} },
1014 {"params", { -1, isl_obj_union_map
, isl_obj_set
,
1015 (isc_un_op_fn
) &isl_union_map_params
} },
1016 {"params", { -1, isl_obj_union_set
, isl_obj_set
,
1017 (isc_un_op_fn
) &isl_union_set_params
} },
1018 {"poly", { -1, isl_obj_union_map
, isl_obj_union_map
,
1019 (isc_un_op_fn
) &isl_union_map_polyhedral_hull
} },
1020 {"poly", { -1, isl_obj_union_set
, isl_obj_union_set
,
1021 (isc_un_op_fn
) &isl_union_set_polyhedral_hull
} },
1022 {"poly", { -1, isl_obj_union_pw_qpolynomial
,
1023 isl_obj_union_pw_qpolynomial
,
1024 (isc_un_op_fn
) &union_pw_qpolynomial_poly
} },
1025 {"lpoly", { -1, isl_obj_union_pw_qpolynomial
,
1026 isl_obj_union_pw_qpolynomial
,
1027 (isc_un_op_fn
) &union_pw_qpolynomial_lpoly
} },
1028 {"upoly", { -1, isl_obj_union_pw_qpolynomial
,
1029 isl_obj_union_pw_qpolynomial
,
1030 (isc_un_op_fn
) &union_pw_qpolynomial_upoly
} },
1032 {"parse_file", { -1, isl_obj_str
, isl_obj_list
,
1033 (isc_un_op_fn
) &parse
} },
1035 {"pow", { -1, isl_obj_union_map
, isl_obj_list
,
1036 (isc_un_op_fn
) &union_map_power
} },
1037 {"sample", { -1, isl_obj_union_set
, isl_obj_set
,
1038 (isc_un_op_fn
) &union_set_sample
} },
1039 {"sample", { -1, isl_obj_union_map
, isl_obj_map
,
1040 (isc_un_op_fn
) &union_map_sample
} },
1041 {"scan", { -1, isl_obj_union_set
, isl_obj_union_set
,
1042 (isc_un_op_fn
) &union_set_scan
} },
1043 {"scan", { -1, isl_obj_union_map
, isl_obj_union_map
,
1044 (isc_un_op_fn
) &union_map_scan
} },
1045 {"sum", { -1, isl_obj_union_pw_qpolynomial
,
1046 isl_obj_union_pw_qpolynomial
,
1047 (isc_un_op_fn
) &isl_union_pw_qpolynomial_sum
} },
1048 {"ub", { -1, isl_obj_union_pw_qpolynomial
, isl_obj_list
,
1049 (isc_un_op_fn
) &union_pw_qpolynomial_upper_bound
} },
1050 {"unwrap", { -1, isl_obj_union_set
, isl_obj_union_map
,
1051 (isc_un_op_fn
) &isl_union_set_unwrap
} },
1052 {"wrap", { -1, isl_obj_union_map
, isl_obj_union_set
,
1053 (isc_un_op_fn
) &isl_union_map_wrap
} },
1054 {"zip", { -1, isl_obj_union_map
, isl_obj_union_map
,
1055 (isc_un_op_fn
) &isl_union_map_zip
} },
1059 struct isl_named_obj
{
1064 static void free_obj(struct isl_obj obj
)
1066 obj
.type
->free(obj
.v
);
1069 static int same_name(const void *entry
, const void *val
)
1071 const struct isl_named_obj
*named
= (const struct isl_named_obj
*)entry
;
1073 return !strcmp(named
->name
, val
);
1076 static int do_assign(struct isl_ctx
*ctx
, struct isl_hash_table
*table
,
1077 char *name
, struct isl_obj obj
)
1079 struct isl_hash_table_entry
*entry
;
1081 struct isl_named_obj
*named
;
1083 name_hash
= isl_hash_string(isl_hash_init(), name
);
1084 entry
= isl_hash_table_find(ctx
, table
, name_hash
, same_name
, name
, 1);
1088 named
= entry
->data
;
1089 free_obj(named
->obj
);
1092 named
= isl_alloc_type(ctx
, struct isl_named_obj
);
1096 entry
->data
= named
;
1107 static struct isl_obj
stored_obj(struct isl_ctx
*ctx
,
1108 struct isl_hash_table
*table
, char *name
)
1110 struct isl_obj obj
= { isl_obj_none
, NULL
};
1111 struct isl_hash_table_entry
*entry
;
1114 name_hash
= isl_hash_string(isl_hash_init(), name
);
1115 entry
= isl_hash_table_find(ctx
, table
, name_hash
, same_name
, name
, 0);
1117 struct isl_named_obj
*named
;
1118 named
= entry
->data
;
1120 } else if (isdigit(name
[0]))
1121 fprintf(stderr
, "unknown identifier '$%s'\n", name
);
1123 fprintf(stderr
, "unknown identifier '%s'\n", name
);
1126 obj
.v
= obj
.type
->copy(obj
.v
);
1130 static int is_subtype(struct isl_obj obj
, isl_obj_type super
)
1132 if (obj
.type
== super
)
1134 if (obj
.type
== isl_obj_map
&& super
== isl_obj_union_map
)
1136 if (obj
.type
== isl_obj_set
&& super
== isl_obj_union_set
)
1138 if (obj
.type
== isl_obj_schedule
&& super
== isl_obj_union_map
)
1140 if (obj
.type
== isl_obj_pw_multi_aff
&& super
== isl_obj_union_set
) {
1141 isl_space
*space
= isl_pw_multi_aff_get_space(obj
.v
);
1142 int is_set
= isl_space_is_set(space
);
1143 isl_space_free(space
);
1146 if (obj
.type
== isl_obj_pw_qpolynomial
&&
1147 super
== isl_obj_union_pw_qpolynomial
)
1149 if (obj
.type
== isl_obj_pw_qpolynomial_fold
&&
1150 super
== isl_obj_union_pw_qpolynomial_fold
)
1152 if (obj
.type
== isl_obj_union_set
&& isl_union_set_is_empty(obj
.v
))
1154 if (obj
.type
== isl_obj_list
) {
1155 struct isl_list
*list
= obj
.v
;
1156 if (list
->n
== 2 && list
->obj
[1].type
== isl_obj_bool
)
1157 return is_subtype(list
->obj
[0], super
);
1159 if (super
== isl_obj_str
)
1164 static struct isl_obj
obj_at(struct isl_obj obj
, int i
)
1166 struct isl_list
*list
= obj
.v
;
1169 obj
.v
= obj
.type
->copy(obj
.v
);
1171 isl_list_free(list
);
1176 static struct isl_obj
convert(isl_ctx
*ctx
, struct isl_obj obj
,
1179 if (obj
.type
== type
)
1181 if (obj
.type
== isl_obj_pw_multi_aff
&& type
== isl_obj_union_set
) {
1182 isl_set
*set
= isl_set_from_pw_multi_aff(obj
.v
);
1183 obj
.type
= isl_obj_union_set
;
1184 obj
.v
= isl_union_set_from_set(set
);
1187 if (obj
.type
== isl_obj_map
&& type
== isl_obj_union_map
) {
1188 obj
.type
= isl_obj_union_map
;
1189 obj
.v
= isl_union_map_from_map(obj
.v
);
1192 if (obj
.type
== isl_obj_schedule
&& type
== isl_obj_union_map
) {
1193 obj
.type
= isl_obj_union_map
;
1194 obj
.v
= schedule_map(obj
.v
);
1197 if (obj
.type
== isl_obj_set
&& type
== isl_obj_union_set
) {
1198 obj
.type
= isl_obj_union_set
;
1199 obj
.v
= isl_union_set_from_set(obj
.v
);
1202 if (obj
.type
== isl_obj_pw_qpolynomial
&&
1203 type
== isl_obj_union_pw_qpolynomial
) {
1204 obj
.type
= isl_obj_union_pw_qpolynomial
;
1205 obj
.v
= isl_union_pw_qpolynomial_from_pw_qpolynomial(obj
.v
);
1208 if (obj
.type
== isl_obj_pw_qpolynomial_fold
&&
1209 type
== isl_obj_union_pw_qpolynomial_fold
) {
1210 obj
.type
= isl_obj_union_pw_qpolynomial_fold
;
1211 obj
.v
= isl_union_pw_qpolynomial_fold_from_pw_qpolynomial_fold(obj
.v
);
1214 if (obj
.type
== isl_obj_union_set
&& isl_union_set_is_empty(obj
.v
)) {
1215 if (type
== isl_obj_union_map
) {
1216 obj
.type
= isl_obj_union_map
;
1219 if (type
== isl_obj_union_pw_qpolynomial
) {
1220 isl_space
*dim
= isl_union_set_get_space(obj
.v
);
1221 isl_union_set_free(obj
.v
);
1222 obj
.v
= isl_union_pw_qpolynomial_zero(dim
);
1223 obj
.type
= isl_obj_union_pw_qpolynomial
;
1226 if (type
== isl_obj_union_pw_qpolynomial_fold
) {
1227 isl_space
*dim
= isl_union_set_get_space(obj
.v
);
1228 isl_union_set_free(obj
.v
);
1229 obj
.v
= isl_union_pw_qpolynomial_fold_zero(dim
,
1231 obj
.type
= isl_obj_union_pw_qpolynomial_fold
;
1235 if (obj
.type
== isl_obj_list
) {
1236 struct isl_list
*list
= obj
.v
;
1237 if (list
->n
== 2 && list
->obj
[1].type
== isl_obj_bool
)
1238 return convert(ctx
, obj_at(obj
, 0), type
);
1240 if (type
== isl_obj_str
) {
1245 p
= isl_printer_to_str(ctx
);
1248 p
= obj
.type
->print(p
, obj
.v
);
1249 s
= isl_printer_get_str(p
);
1250 isl_printer_free(p
);
1252 str
= isl_str_from_string(ctx
, s
);
1257 obj
.type
= isl_obj_str
;
1263 obj
.type
= isl_obj_none
;
1268 static struct isc_bin_op
*read_bin_op_if_available(struct isl_stream
*s
,
1273 struct isl_token
*tok
, *tok2
;
1275 tok
= isl_stream_next_token(s
);
1279 for (i
= 0; ; ++i
) {
1282 if (bin_ops
[i
].op
!= isl_token_get_type(tok
))
1284 if (!is_subtype(lhs
, bin_ops
[i
].lhs
))
1287 isl_token_free(tok
);
1291 for (i
= 0; ; ++i
) {
1292 if (!named_bin_ops
[i
].name
)
1294 if (named_bin_ops
[i
].op
.op
!= isl_token_get_type(tok
))
1296 if (!is_subtype(lhs
, named_bin_ops
[i
].op
.lhs
))
1299 isl_token_free(tok
);
1300 return &named_bin_ops
[i
].op
;
1303 for (i
= 0; ; ++i
) {
1304 if (!compound_bin_ops
[i
].full
)
1306 if (compound_bin_ops
[i
].op1
!= isl_token_get_type(tok
))
1309 tok2
= isl_stream_next_token(s
);
1311 if (compound_bin_ops
[i
].op2
!= isl_token_get_type(tok2
))
1313 if (!is_subtype(lhs
, compound_bin_ops
[i
].op
.lhs
))
1316 isl_token_free(tok2
);
1317 isl_token_free(tok
);
1318 return &compound_bin_ops
[i
].op
;
1322 isl_stream_push_token(s
, tok2
);
1323 isl_stream_push_token(s
, tok
);
1328 static struct isc_un_op
*read_prefix_un_op_if_available(struct isl_stream
*s
)
1331 struct isl_token
*tok
;
1333 tok
= isl_stream_next_token(s
);
1337 for (i
= 0; ; ++i
) {
1338 if (!named_un_ops
[i
].name
)
1340 if (named_un_ops
[i
].op
.op
!= isl_token_get_type(tok
))
1343 isl_token_free(tok
);
1344 return &named_un_ops
[i
].op
;
1347 isl_stream_push_token(s
, tok
);
1352 static struct isc_un_op
*find_matching_un_op(struct isc_un_op
*like
,
1357 for (i
= 0; ; ++i
) {
1358 if (!named_un_ops
[i
].name
)
1360 if (named_un_ops
[i
].op
.op
!= like
->op
)
1362 if (!is_subtype(arg
, named_un_ops
[i
].op
.arg
))
1365 return &named_un_ops
[i
].op
;
1371 static int is_assign(struct isl_stream
*s
)
1373 struct isl_token
*tok
;
1374 struct isl_token
*tok2
;
1377 tok
= isl_stream_next_token(s
);
1380 if (isl_token_get_type(tok
) != ISL_TOKEN_IDENT
) {
1381 isl_stream_push_token(s
, tok
);
1385 tok2
= isl_stream_next_token(s
);
1387 isl_stream_push_token(s
, tok
);
1390 assign
= isl_token_get_type(tok2
) == ISL_TOKEN_DEF
;
1391 isl_stream_push_token(s
, tok2
);
1392 isl_stream_push_token(s
, tok
);
1397 static struct isl_obj
read_obj(struct isl_stream
*s
,
1398 struct isl_hash_table
*table
);
1399 static struct isl_obj
read_expr(struct isl_stream
*s
,
1400 struct isl_hash_table
*table
);
1402 static struct isl_obj
read_un_op_expr(struct isl_stream
*s
,
1403 struct isl_hash_table
*table
, struct isc_un_op
*op
)
1406 struct isl_obj obj
= { isl_obj_none
, NULL
};
1408 obj
= read_obj(s
, table
);
1412 op
= find_matching_un_op(op
, obj
);
1414 ctx
= isl_stream_get_ctx(s
);
1416 isl_die(ctx
, isl_error_invalid
,
1417 "no such unary operator defined on given operand",
1420 obj
= convert(ctx
, obj
, op
->arg
);
1421 obj
.v
= op
->fn(obj
.v
);
1427 obj
.type
= isl_obj_none
;
1432 static struct isl_obj
transitive_closure(struct isl_ctx
*ctx
, struct isl_obj obj
)
1434 struct isl_list
*list
;
1437 if (obj
.type
!= isl_obj_union_map
)
1438 obj
= convert(ctx
, obj
, isl_obj_union_map
);
1439 isl_assert(ctx
, obj
.type
== isl_obj_union_map
, goto error
);
1440 list
= isl_list_alloc(ctx
, 2);
1444 list
->obj
[0].type
= isl_obj_union_map
;
1445 list
->obj
[0].v
= isl_union_map_transitive_closure(obj
.v
, &exact
);
1446 list
->obj
[1].type
= isl_obj_bool
;
1447 list
->obj
[1].v
= exact
? &iscc_bool_true
: &iscc_bool_false
;
1449 obj
.type
= isl_obj_list
;
1450 if (exact
< 0 || !list
->obj
[0].v
)
1456 obj
.type
= isl_obj_none
;
1461 static struct isl_obj
obj_at_index(struct isl_stream
*s
, struct isl_obj obj
)
1463 struct isl_list
*list
= obj
.v
;
1464 struct isl_token
*tok
;
1469 tok
= isl_stream_next_token(s
);
1470 if (!tok
|| isl_token_get_type(tok
) != ISL_TOKEN_VALUE
) {
1471 isl_stream_error(s
, tok
, "expecting index");
1473 isl_stream_push_token(s
, tok
);
1476 ctx
= isl_stream_get_ctx(s
);
1477 v
= isl_token_get_val(ctx
, tok
);
1478 i
= isl_val_get_num_si(v
);
1480 isl_token_free(tok
);
1481 isl_assert(ctx
, i
< list
->n
, goto error
);
1482 if (isl_stream_eat(s
, ']'))
1485 return obj_at(obj
, i
);
1488 obj
.type
= isl_obj_none
;
1493 static struct isl_obj
apply(struct isl_stream
*s
, __isl_take isl_union_map
*umap
,
1494 struct isl_hash_table
*table
)
1499 obj
= read_expr(s
, table
);
1500 ctx
= isl_stream_get_ctx(s
);
1501 isl_assert(ctx
, is_subtype(obj
, isl_obj_union_set
) ||
1502 is_subtype(obj
, isl_obj_union_map
), goto error
);
1504 if (obj
.type
== isl_obj_list
) {
1505 struct isl_list
*list
= obj
.v
;
1506 if (list
->n
== 2 && list
->obj
[1].type
== isl_obj_bool
)
1507 obj
= obj_at(obj
, 0);
1509 if (obj
.type
== isl_obj_set
)
1510 obj
= convert(ctx
, obj
, isl_obj_union_set
);
1511 else if (obj
.type
== isl_obj_map
)
1512 obj
= convert(ctx
, obj
, isl_obj_union_map
);
1513 if (obj
.type
== isl_obj_union_set
) {
1514 obj
.v
= isl_union_set_apply(obj
.v
, umap
);
1516 obj
.v
= isl_union_map_apply_range(obj
.v
, umap
);
1520 if (isl_stream_eat(s
, ')'))
1525 isl_union_map_free(umap
);
1528 obj
.type
= isl_obj_none
;
1533 static struct isl_obj
apply_fun_set(struct isl_obj obj
,
1534 __isl_take isl_union_set
*uset
)
1536 if (obj
.type
== isl_obj_union_pw_qpolynomial
) {
1537 obj
.v
= isl_union_set_apply_union_pw_qpolynomial(uset
, obj
.v
);
1539 obj
.type
= isl_obj_list
;
1540 obj
.v
= union_set_apply_union_pw_qpolynomial_fold(uset
, obj
.v
);
1545 static struct isl_obj
apply_fun_map(struct isl_obj obj
,
1546 __isl_take isl_union_map
*umap
)
1548 if (obj
.type
== isl_obj_union_pw_qpolynomial
) {
1549 obj
.v
= isl_union_map_apply_union_pw_qpolynomial(umap
, obj
.v
);
1551 obj
.type
= isl_obj_list
;
1552 obj
.v
= union_map_apply_union_pw_qpolynomial_fold(umap
, obj
.v
);
1557 static struct isl_obj
apply_fun(struct isl_stream
*s
,
1558 struct isl_obj obj
, struct isl_hash_table
*table
)
1563 arg
= read_expr(s
, table
);
1564 ctx
= isl_stream_get_ctx(s
);
1565 if (!is_subtype(arg
, isl_obj_union_map
) &&
1566 !is_subtype(arg
, isl_obj_union_set
))
1567 isl_die(ctx
, isl_error_invalid
,
1568 "expecting set of map argument", goto error
);
1570 if (arg
.type
== isl_obj_list
) {
1571 struct isl_list
*list
= arg
.v
;
1572 if (list
->n
== 2 && list
->obj
[1].type
== isl_obj_bool
)
1573 arg
= obj_at(arg
, 0);
1575 if (arg
.type
== isl_obj_set
)
1576 arg
= convert(ctx
, arg
, isl_obj_union_set
);
1577 else if (arg
.type
== isl_obj_map
)
1578 arg
= convert(ctx
, arg
, isl_obj_union_map
);
1579 if (arg
.type
== isl_obj_union_set
)
1580 obj
= apply_fun_set(obj
, arg
.v
);
1582 obj
= apply_fun_map(obj
, arg
.v
);
1586 if (isl_stream_eat(s
, ')'))
1594 obj
.type
= isl_obj_none
;
1599 struct add_vertex_data
{
1600 struct isl_list
*list
;
1604 static isl_stat
add_vertex(__isl_take isl_vertex
*vertex
, void *user
)
1606 struct add_vertex_data
*data
= (struct add_vertex_data
*)user
;
1610 ma
= isl_vertex_get_expr(vertex
);
1611 dom
= isl_set_from_basic_set(isl_vertex_get_domain(vertex
));
1613 data
->list
->obj
[data
->i
].type
= isl_obj_pw_multi_aff
;
1614 data
->list
->obj
[data
->i
].v
= isl_pw_multi_aff_alloc(dom
, ma
);
1617 isl_vertex_free(vertex
);
1622 static isl_stat
set_vertices(__isl_take isl_set
*set
, void *user
)
1625 isl_basic_set
*hull
;
1626 isl_vertices
*vertices
= NULL
;
1627 struct isl_list
*list
= NULL
;
1629 struct add_vertex_data
*data
= (struct add_vertex_data
*)user
;
1631 set
= isl_set_remove_divs(set
);
1632 hull
= isl_set_convex_hull(set
);
1633 vertices
= isl_basic_set_compute_vertices(hull
);
1634 isl_basic_set_free(hull
);
1638 ctx
= isl_vertices_get_ctx(vertices
);
1639 data
->list
= isl_list_alloc(ctx
, isl_vertices_get_n_vertices(vertices
));
1644 r
= isl_vertices_foreach_vertex(vertices
, &add_vertex
, user
);
1646 data
->list
= isl_list_concat(list
, data
->list
);
1648 isl_vertices_free(vertices
);
1653 isl_vertices_free(vertices
);
1654 return isl_stat_error
;
1657 static struct isl_obj
vertices(struct isl_stream
*s
,
1658 struct isl_hash_table
*table
)
1662 struct isl_list
*list
= NULL
;
1663 isl_union_set
*uset
= NULL
;
1664 struct add_vertex_data data
= { NULL
};
1666 obj
= read_expr(s
, table
);
1667 ctx
= isl_stream_get_ctx(s
);
1668 obj
= convert(ctx
, obj
, isl_obj_union_set
);
1669 isl_assert(ctx
, obj
.type
== isl_obj_union_set
, goto error
);
1673 list
= isl_list_alloc(ctx
, 0);
1679 if (isl_union_set_foreach_set(uset
, &set_vertices
, &data
) < 0)
1682 isl_union_set_free(uset
);
1684 obj
.type
= isl_obj_list
;
1689 isl_union_set_free(uset
);
1690 isl_list_free(data
.list
);
1692 obj
.type
= isl_obj_none
;
1697 static struct isl_obj
type_of(struct isl_stream
*s
,
1698 struct isl_hash_table
*table
)
1701 const char *type
= "unknown";
1703 obj
= read_expr(s
, table
);
1705 if (obj
.type
== isl_obj_map
||
1706 obj
.type
== isl_obj_union_map
)
1708 if (obj
.type
== isl_obj_set
||
1709 obj
.type
== isl_obj_union_set
)
1711 if (obj
.type
== isl_obj_pw_multi_aff
)
1712 type
= "piecewise multi-quasiaffine expression";
1713 if (obj
.type
== isl_obj_pw_qpolynomial
||
1714 obj
.type
== isl_obj_union_pw_qpolynomial
)
1715 type
= "piecewise quasipolynomial";
1716 if (obj
.type
== isl_obj_pw_qpolynomial_fold
||
1717 obj
.type
== isl_obj_union_pw_qpolynomial_fold
)
1718 type
= "piecewise quasipolynomial fold";
1719 if (obj
.type
== isl_obj_list
)
1721 if (obj
.type
== isl_obj_bool
)
1723 if (obj
.type
== isl_obj_str
)
1725 if (obj
.type
== isl_obj_val
)
1727 if (obj
.type
== isl_obj_schedule
)
1731 obj
.type
= isl_obj_str
;
1732 obj
.v
= isl_str_from_string(isl_stream_get_ctx(s
), strdup(type
));
1737 static __isl_give isl_union_set
*read_set(struct isl_stream
*s
,
1738 struct isl_hash_table
*table
)
1743 obj
= read_obj(s
, table
);
1744 ctx
= isl_stream_get_ctx(s
);
1745 obj
= convert(ctx
, obj
, isl_obj_union_set
);
1746 isl_assert(ctx
, obj
.type
== isl_obj_union_set
, goto error
);
1753 static __isl_give isl_union_map
*read_map(struct isl_stream
*s
,
1754 struct isl_hash_table
*table
)
1759 obj
= read_obj(s
, table
);
1760 ctx
= isl_stream_get_ctx(s
);
1761 obj
= convert(ctx
, obj
, isl_obj_union_map
);
1762 isl_assert(ctx
, obj
.type
== isl_obj_union_map
, goto error
);
1769 /* Read a schedule in the form of either a schedule (tree) or a union map
1770 * from "s" and store the schedule in "access".
1772 static __isl_give isl_union_access_info
*access_info_set_schedule(
1773 __isl_take isl_union_access_info
*access
, struct isl_stream
*s
,
1774 struct isl_hash_table
*table
)
1779 obj
= read_obj(s
, table
);
1780 if (obj
.type
== isl_obj_schedule
)
1781 return isl_union_access_info_set_schedule(access
, obj
.v
);
1782 ctx
= isl_stream_get_ctx(s
);
1783 obj
= convert(ctx
, obj
, isl_obj_union_map
);
1785 return isl_union_access_info_set_schedule_map(access
, obj
.v
);
1788 static struct isl_obj
last_any(struct isl_stream
*s
,
1789 struct isl_hash_table
*table
, __isl_take isl_union_map
*must_source
,
1790 __isl_take isl_union_map
*may_source
)
1792 struct isl_obj obj
= { isl_obj_none
, NULL
};
1793 isl_union_access_info
*access
;
1794 isl_union_flow
*flow
;
1795 isl_union_map
*sink
= NULL
;
1796 isl_union_map
*may_dep
;
1798 if (isl_stream_eat(s
, iscc_op
[ISCC_BEFORE
]))
1801 sink
= read_map(s
, table
);
1805 if (isl_stream_eat(s
, iscc_op
[ISCC_UNDER
]))
1808 access
= isl_union_access_info_from_sink(sink
);
1809 access
= isl_union_access_info_set_must_source(access
, must_source
);
1810 access
= isl_union_access_info_set_may_source(access
, may_source
);
1811 access
= access_info_set_schedule(access
, s
, table
);
1812 flow
= isl_union_access_info_compute_flow(access
);
1813 may_dep
= isl_union_flow_get_may_dependence(flow
);
1814 isl_union_flow_free(flow
);
1819 obj
.type
= isl_obj_union_map
;
1824 isl_union_map_free(may_source
);
1825 isl_union_map_free(must_source
);
1826 isl_union_map_free(sink
);
1828 obj
.type
= isl_obj_none
;
1833 static struct isl_obj
any(struct isl_stream
*s
, struct isl_hash_table
*table
)
1835 struct isl_obj obj
= { isl_obj_none
, NULL
};
1836 isl_union_access_info
*access
;
1837 isl_union_flow
*flow
;
1838 isl_union_map
*may_source
= NULL
;
1839 isl_union_map
*sink
= NULL
;
1840 isl_union_map
*may_dep
;
1842 may_source
= read_map(s
, table
);
1846 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_LAST
])) {
1847 isl_union_map
*must_source
;
1848 must_source
= read_map(s
, table
);
1851 return last_any(s
, table
, must_source
, may_source
);
1854 if (isl_stream_eat(s
, iscc_op
[ISCC_BEFORE
]))
1857 sink
= read_map(s
, table
);
1861 if (isl_stream_eat(s
, iscc_op
[ISCC_UNDER
]))
1864 access
= isl_union_access_info_from_sink(sink
);
1865 access
= isl_union_access_info_set_may_source(access
, may_source
);
1866 access
= access_info_set_schedule(access
, s
, table
);
1867 flow
= isl_union_access_info_compute_flow(access
);
1868 may_dep
= isl_union_flow_get_may_dependence(flow
);
1869 isl_union_flow_free(flow
);
1874 obj
.type
= isl_obj_union_map
;
1879 isl_union_map_free(may_source
);
1880 isl_union_map_free(sink
);
1882 obj
.type
= isl_obj_none
;
1887 static struct isl_obj
last(struct isl_stream
*s
, struct isl_hash_table
*table
)
1889 struct isl_obj obj
= { isl_obj_none
, NULL
};
1890 struct isl_list
*list
= NULL
;
1891 isl_union_access_info
*access
;
1892 isl_union_flow
*flow
;
1893 isl_union_map
*must_source
= NULL
;
1894 isl_union_map
*sink
= NULL
;
1895 isl_union_map
*must_dep
;
1896 isl_union_map
*must_no_source
;
1898 must_source
= read_map(s
, table
);
1902 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_ANY
])) {
1903 isl_union_map
*may_source
;
1904 may_source
= read_map(s
, table
);
1907 return last_any(s
, table
, must_source
, may_source
);
1910 list
= isl_list_alloc(isl_stream_get_ctx(s
), 2);
1914 if (isl_stream_eat(s
, iscc_op
[ISCC_BEFORE
]))
1917 sink
= read_map(s
, table
);
1921 if (isl_stream_eat(s
, iscc_op
[ISCC_UNDER
]))
1924 access
= isl_union_access_info_from_sink(sink
);
1925 access
= isl_union_access_info_set_must_source(access
, must_source
);
1926 access
= access_info_set_schedule(access
, s
, table
);
1927 flow
= isl_union_access_info_compute_flow(access
);
1928 must_dep
= isl_union_flow_get_must_dependence(flow
);
1929 must_no_source
= isl_union_flow_get_must_no_source(flow
);
1930 isl_union_flow_free(flow
);
1932 list
->obj
[0].type
= isl_obj_union_map
;
1933 list
->obj
[0].v
= must_dep
;
1934 list
->obj
[1].type
= isl_obj_union_map
;
1935 list
->obj
[1].v
= must_no_source
;
1937 if (!must_dep
|| !must_no_source
) {
1938 isl_list_free(list
);
1943 obj
.type
= isl_obj_list
;
1947 isl_list_free(list
);
1948 isl_union_map_free(must_source
);
1949 isl_union_map_free(sink
);
1951 obj
.type
= isl_obj_none
;
1956 static __isl_give isl_schedule
*get_schedule(struct isl_stream
*s
,
1957 struct isl_hash_table
*table
)
1959 isl_union_set
*domain
;
1960 isl_union_map
*validity
;
1961 isl_union_map
*proximity
;
1963 domain
= read_set(s
, table
);
1967 validity
= isl_union_map_empty(isl_union_set_get_space(domain
));
1968 proximity
= isl_union_map_empty(isl_union_set_get_space(domain
));
1971 isl_union_map
*umap
;
1972 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_RESPECTING
])) {
1973 umap
= read_map(s
, table
);
1974 validity
= isl_union_map_union(validity
, umap
);
1975 } else if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_MINIMIZING
])) {
1976 umap
= read_map(s
, table
);
1977 proximity
= isl_union_map_union(proximity
, umap
);
1982 return isl_union_set_compute_schedule(domain
, validity
, proximity
);
1985 static struct isl_obj
schedule(struct isl_stream
*s
,
1986 struct isl_hash_table
*table
)
1988 struct isl_obj obj
= { isl_obj_none
, NULL
};
1989 isl_schedule
*schedule
;
1991 schedule
= get_schedule(s
, table
);
1994 obj
.type
= isl_obj_schedule
;
1999 /* Read a schedule for code generation in the form of either
2000 * a schedule tree or a union map.
2002 static struct isl_obj
get_codegen_schedule(struct isl_stream
*s
,
2003 struct isl_hash_table
*table
)
2008 obj
= read_obj(s
, table
);
2009 ctx
= isl_stream_get_ctx(s
);
2011 if (obj
.type
== isl_obj_schedule
)
2013 if (is_subtype(obj
, isl_obj_union_map
))
2014 return convert(ctx
, obj
, isl_obj_union_map
);
2018 obj
.type
= isl_obj_none
;
2019 isl_die(ctx
, isl_error_invalid
, "expecting schedule or map",
2023 /* Generate an AST for the given schedule and options and return the AST.
2025 static __isl_give isl_ast_node
*get_ast_from_union_map(
2026 __isl_take isl_union_map
*schedule
, __isl_take isl_union_map
*options
)
2030 isl_ast_build
*build
;
2033 space
= isl_union_map_get_space(schedule
);
2034 context
= isl_set_universe(isl_space_params(space
));
2036 build
= isl_ast_build_from_context(context
);
2037 build
= isl_ast_build_set_options(build
, options
);
2038 tree
= isl_ast_build_ast_from_schedule(build
, schedule
);
2039 isl_ast_build_free(build
);
2044 /* Generate an AST for the given schedule and return the AST.
2046 static __isl_give isl_ast_node
*get_ast_from_schedule(
2047 __isl_take isl_schedule
*schedule
)
2049 isl_ast_build
*build
;
2052 build
= isl_ast_build_alloc(isl_schedule_get_ctx(schedule
));
2053 tree
= isl_ast_build_node_from_schedule(build
, schedule
);
2054 isl_ast_build_free(build
);
2059 /* Print the AST "tree" on the printer "p".
2061 static __isl_give isl_printer
*print_ast(__isl_take isl_printer
*p
,
2062 __isl_take isl_ast_node
*tree
)
2066 format
= isl_printer_get_output_format(p
);
2067 p
= isl_printer_set_output_format(p
, ISL_FORMAT_C
);
2068 p
= isl_printer_print_ast_node(p
, tree
);
2069 p
= isl_printer_set_output_format(p
, format
);
2071 isl_ast_node_free(tree
);
2076 /* Perform the codegen operation.
2077 * In particular, read a schedule, check if the user has specified any options
2078 * and then generate an AST from the schedule (and options) and print it.
2079 * In case the schedule is specified as a schedule tree, the AST generation
2080 * options are embedded in the schedule, so they are not read in separately.
2082 static __isl_give isl_printer
*codegen(struct isl_stream
*s
,
2083 struct isl_hash_table
*table
, __isl_take isl_printer
*p
)
2088 obj
= get_codegen_schedule(s
, table
);
2092 if (obj
.type
== isl_obj_schedule
) {
2093 isl_schedule
*schedule
= obj
.v
;
2095 tree
= get_ast_from_schedule(schedule
);
2097 isl_union_map
*schedule
= obj
.v
;
2098 isl_union_map
*options
;
2100 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_USING
]))
2101 options
= read_map(s
, table
);
2103 options
= isl_union_map_empty(
2104 isl_union_map_get_space(schedule
));
2106 tree
= get_ast_from_union_map(schedule
, options
);
2110 p
= print_ast(p
, tree
);
2112 isl_stream_eat(s
, ';');
2117 static struct isl_obj
power(struct isl_stream
*s
, struct isl_obj obj
)
2119 struct isl_token
*tok
;
2123 ctx
= isl_stream_get_ctx(s
);
2124 if (isl_stream_eat_if_available(s
, '+'))
2125 return transitive_closure(ctx
, obj
);
2127 isl_assert(ctx
, is_subtype(obj
, isl_obj_union_map
), goto error
);
2128 if (obj
.type
!= isl_obj_union_map
)
2129 obj
= convert(ctx
, obj
, isl_obj_union_map
);
2131 tok
= isl_stream_next_token(s
);
2132 if (!tok
|| isl_token_get_type(tok
) != ISL_TOKEN_VALUE
) {
2133 isl_stream_error(s
, tok
, "expecting integer exponent");
2135 isl_stream_push_token(s
, tok
);
2139 v
= isl_token_get_val(ctx
, tok
);
2140 if (isl_val_is_zero(v
)) {
2141 isl_stream_error(s
, tok
, "expecting non-zero exponent");
2144 isl_stream_push_token(s
, tok
);
2148 obj
.v
= isl_union_map_fixed_power_val(obj
.v
, v
);
2149 isl_token_free(tok
);
2156 obj
.type
= isl_obj_none
;
2161 static struct isl_obj
check_assert(struct isl_stream
*s
,
2162 struct isl_hash_table
*table
)
2167 obj
= read_expr(s
, table
);
2168 ctx
= isl_stream_get_ctx(s
);
2169 if (obj
.type
!= isl_obj_bool
)
2170 isl_die(ctx
, isl_error_invalid
,
2171 "expecting boolean expression", goto error
);
2172 if (obj
.v
!= &iscc_bool_true
)
2173 isl_die(ctx
, isl_error_unknown
,
2174 "assertion failed", abort());
2177 obj
.type
= isl_obj_none
;
2182 static struct isl_obj
read_from_file(struct isl_stream
*s
)
2186 struct isl_token
*tok
;
2187 struct isl_stream
*s_file
;
2188 struct iscc_options
*options
;
2192 tok
= isl_stream_next_token(s
);
2193 if (!tok
|| isl_token_get_type(tok
) != ISL_TOKEN_STRING
) {
2194 isl_stream_error(s
, tok
, "expecting filename");
2195 isl_token_free(tok
);
2199 ctx
= isl_stream_get_ctx(s
);
2200 options
= isl_ctx_peek_iscc_options(ctx
);
2201 if (!options
|| !options
->io
) {
2202 isl_token_free(tok
);
2203 isl_die(ctx
, isl_error_invalid
,
2204 "read operation not allowed", goto error
);
2207 name
= isl_token_get_str(ctx
, tok
);
2208 isl_token_free(tok
);
2209 file
= fopen(name
, "r");
2211 isl_assert(ctx
, file
, goto error
);
2213 s_file
= isl_stream_new_file(ctx
, file
);
2219 obj
= isl_stream_read_obj(s_file
);
2221 isl_stream_free(s_file
);
2226 obj
.type
= isl_obj_none
;
2231 static struct isl_obj
write_to_file(struct isl_stream
*s
,
2232 struct isl_hash_table
*table
)
2234 struct isl_obj obj
= { isl_obj_none
, NULL
};
2235 struct isl_token
*tok
;
2236 struct iscc_options
*options
;
2242 tok
= isl_stream_next_token(s
);
2243 if (!tok
|| isl_token_get_type(tok
) != ISL_TOKEN_STRING
) {
2244 isl_stream_error(s
, tok
, "expecting filename");
2245 isl_token_free(tok
);
2249 obj
= read_expr(s
, table
);
2251 ctx
= isl_stream_get_ctx(s
);
2252 options
= isl_ctx_peek_iscc_options(ctx
);
2253 if (!options
|| !options
->io
) {
2254 isl_token_free(tok
);
2255 isl_die(ctx
, isl_error_invalid
,
2256 "write operation not allowed", goto error
);
2259 name
= isl_token_get_str(ctx
, tok
);
2260 isl_token_free(tok
);
2261 file
= fopen(name
, "w");
2264 isl_die(ctx
, isl_error_unknown
,
2265 "could not open file for writing", goto error
);
2267 p
= isl_printer_to_file(ctx
, file
);
2268 p
= isl_printer_set_output_format(p
, options
->format
);
2269 p
= obj
.type
->print(p
, obj
.v
);
2270 p
= isl_printer_end_line(p
);
2271 isl_printer_free(p
);
2276 obj
.type
= isl_obj_none
;
2281 static struct isl_obj
read_string_if_available(struct isl_stream
*s
)
2283 struct isl_token
*tok
;
2284 struct isl_obj obj
= { isl_obj_none
, NULL
};
2286 tok
= isl_stream_next_token(s
);
2289 if (isl_token_get_type(tok
) == ISL_TOKEN_STRING
) {
2291 str
= isl_str_alloc(isl_stream_get_ctx(s
));
2294 str
->s
= isl_token_get_str(isl_stream_get_ctx(s
), tok
);
2295 isl_token_free(tok
);
2297 obj
.type
= isl_obj_str
;
2299 isl_stream_push_token(s
, tok
);
2302 isl_token_free(tok
);
2306 static struct isl_obj
read_bool_if_available(struct isl_stream
*s
)
2308 struct isl_token
*tok
;
2309 struct isl_obj obj
= { isl_obj_none
, NULL
};
2312 tok
= isl_stream_next_token(s
);
2315 type
= isl_token_get_type(tok
);
2316 if (type
== ISL_TOKEN_FALSE
|| type
== ISL_TOKEN_TRUE
) {
2317 int is_true
= type
== ISL_TOKEN_TRUE
;
2318 isl_token_free(tok
);
2319 obj
.v
= is_true
? &iscc_bool_true
: &iscc_bool_false
;
2320 obj
.type
= isl_obj_bool
;
2322 isl_stream_push_token(s
, tok
);
2326 static __isl_give
char *read_ident(struct isl_stream
*s
)
2330 struct isl_token
*tok
, *tok2
;
2332 name
= isl_stream_read_ident_if_available(s
);
2336 tok
= isl_stream_next_token(s
);
2339 if (isl_token_get_type(tok
) != '$') {
2340 isl_stream_push_token(s
, tok
);
2343 tok2
= isl_stream_next_token(s
);
2344 if (!tok2
|| isl_token_get_type(tok2
) != ISL_TOKEN_VALUE
) {
2346 isl_stream_push_token(s
, tok2
);
2347 isl_stream_push_token(s
, tok
);
2351 v
= isl_token_get_val(isl_stream_get_ctx(s
), tok2
);
2352 name
= isl_val_to_str(v
);
2354 isl_token_free(tok
);
2355 isl_token_free(tok2
);
2360 static struct isl_obj
read_list(struct isl_stream
*s
,
2361 struct isl_hash_table
*table
, struct isl_obj obj
)
2363 struct isl_list
*list
;
2365 list
= isl_list_alloc(isl_stream_get_ctx(s
), 2);
2369 list
->obj
[1] = read_obj(s
, table
);
2371 obj
.type
= isl_obj_list
;
2373 if (!list
->obj
[1].v
)
2376 while (isl_stream_eat_if_available(s
, ',')) {
2377 obj
.v
= list
= isl_list_add_obj(list
, read_obj(s
, table
));
2385 obj
.type
= isl_obj_none
;
2390 static struct isl_obj
read_obj(struct isl_stream
*s
,
2391 struct isl_hash_table
*table
)
2394 struct isl_obj obj
= { isl_obj_none
, NULL
};
2396 struct isc_un_op
*op
= NULL
;
2398 obj
= read_string_if_available(s
);
2401 obj
= read_bool_if_available(s
);
2404 ctx
= isl_stream_get_ctx(s
);
2405 if (isl_stream_eat_if_available(s
, '(')) {
2406 if (isl_stream_next_token_is(s
, ')')) {
2407 obj
.type
= isl_obj_list
;
2408 obj
.v
= isl_list_alloc(ctx
, 0);
2410 obj
= read_expr(s
, table
);
2411 if (obj
.v
&& isl_stream_eat_if_available(s
, ','))
2412 obj
= read_list(s
, table
, obj
);
2414 if (!obj
.v
|| isl_stream_eat(s
, ')'))
2417 op
= read_prefix_un_op_if_available(s
);
2419 return read_un_op_expr(s
, table
, op
);
2421 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_ASSERT
]))
2422 return check_assert(s
, table
);
2423 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_READ
]))
2424 return read_from_file(s
);
2425 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_WRITE
]))
2426 return write_to_file(s
, table
);
2427 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_VERTICES
]))
2428 return vertices(s
, table
);
2429 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_ANY
]))
2430 return any(s
, table
);
2431 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_LAST
]))
2432 return last(s
, table
);
2433 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_SCHEDULE
]))
2434 return schedule(s
, table
);
2435 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_TYPEOF
]))
2436 return type_of(s
, table
);
2438 name
= read_ident(s
);
2440 obj
= stored_obj(ctx
, table
, name
);
2442 obj
= isl_stream_read_obj(s
);
2447 if (isl_stream_eat_if_available(s
, '^'))
2448 obj
= power(s
, obj
);
2449 else if (obj
.type
== isl_obj_list
&& isl_stream_eat_if_available(s
, '['))
2450 obj
= obj_at_index(s
, obj
);
2451 else if (is_subtype(obj
, isl_obj_union_map
) &&
2452 isl_stream_eat_if_available(s
, '(')) {
2453 obj
= convert(ctx
, obj
, isl_obj_union_map
);
2454 obj
= apply(s
, obj
.v
, table
);
2455 } else if (is_subtype(obj
, isl_obj_union_pw_qpolynomial
) &&
2456 isl_stream_eat_if_available(s
, '(')) {
2457 obj
= convert(ctx
, obj
, isl_obj_union_pw_qpolynomial
);
2458 obj
= apply_fun(s
, obj
, table
);
2459 } else if (is_subtype(obj
, isl_obj_union_pw_qpolynomial_fold
) &&
2460 isl_stream_eat_if_available(s
, '(')) {
2461 obj
= convert(ctx
, obj
, isl_obj_union_pw_qpolynomial_fold
);
2462 obj
= apply_fun(s
, obj
, table
);
2468 obj
.type
= isl_obj_none
;
2473 static struct isc_bin_op
*find_matching_bin_op(struct isc_bin_op
*like
,
2474 struct isl_obj lhs
, struct isl_obj rhs
)
2478 for (i
= 0; ; ++i
) {
2481 if (bin_ops
[i
].op
!= like
->op
)
2483 if (!is_subtype(lhs
, bin_ops
[i
].lhs
))
2485 if (!is_subtype(rhs
, bin_ops
[i
].rhs
))
2491 for (i
= 0; ; ++i
) {
2492 if (!named_bin_ops
[i
].name
)
2494 if (named_bin_ops
[i
].op
.op
!= like
->op
)
2496 if (!is_subtype(lhs
, named_bin_ops
[i
].op
.lhs
))
2498 if (!is_subtype(rhs
, named_bin_ops
[i
].op
.rhs
))
2501 return &named_bin_ops
[i
].op
;
2504 for (i
= 0; ; ++i
) {
2505 if (!compound_bin_ops
[i
].full
)
2507 if (compound_bin_ops
[i
].op
.op
!= like
->op
)
2509 if (!is_subtype(lhs
, compound_bin_ops
[i
].op
.lhs
))
2511 if (!is_subtype(rhs
, compound_bin_ops
[i
].op
.rhs
))
2514 return &compound_bin_ops
[i
].op
;
2520 static int next_is_neg_int(struct isl_stream
*s
)
2522 struct isl_token
*tok
;
2525 tok
= isl_stream_next_token(s
);
2526 if (tok
&& isl_token_get_type(tok
) == ISL_TOKEN_VALUE
) {
2528 v
= isl_token_get_val(isl_stream_get_ctx(s
), tok
);
2529 ret
= isl_val_is_neg(v
);
2533 isl_stream_push_token(s
, tok
);
2538 static struct isl_obj
call_bin_op(isl_ctx
*ctx
, struct isc_bin_op
*op
,
2539 struct isl_obj lhs
, struct isl_obj rhs
)
2543 lhs
= convert(ctx
, lhs
, op
->lhs
);
2544 rhs
= convert(ctx
, rhs
, op
->rhs
);
2545 if (op
->res
!= isl_obj_bool
)
2546 obj
.v
= op
->o
.fn(lhs
.v
, rhs
.v
);
2548 int res
= op
->o
.test(lhs
.v
, rhs
.v
);
2551 obj
.v
= iscc_bool_from_int(res
);
2558 static struct isl_obj
read_expr(struct isl_stream
*s
,
2559 struct isl_hash_table
*table
)
2562 struct isl_obj obj
= { isl_obj_none
, NULL
};
2563 struct isl_obj right_obj
= { isl_obj_none
, NULL
};
2565 obj
= read_obj(s
, table
);
2566 ctx
= isl_stream_get_ctx(s
);
2568 struct isc_bin_op
*op
= NULL
;
2570 op
= read_bin_op_if_available(s
, obj
);
2574 right_obj
= read_obj(s
, table
);
2576 op
= find_matching_bin_op(op
, obj
, right_obj
);
2579 isl_die(ctx
, isl_error_invalid
,
2580 "no such binary operator defined on given operands",
2583 obj
= call_bin_op(ctx
, op
, obj
, right_obj
);
2586 if (obj
.type
== isl_obj_val
&& next_is_neg_int(s
)) {
2587 right_obj
= read_obj(s
, table
);
2588 obj
.v
= isl_val_add(obj
.v
, right_obj
.v
);
2593 free_obj(right_obj
);
2595 obj
.type
= isl_obj_none
;
2600 static __isl_give isl_printer
*source_file(struct isl_stream
*s
,
2601 struct isl_hash_table
*table
, __isl_take isl_printer
*p
);
2603 /* Print "obj" to the printer "p".
2604 * If the object is a schedule, then print it in block format.
2606 static __isl_give isl_printer
*print_obj(__isl_take isl_printer
*p
,
2609 if (obj
.type
!= isl_obj_schedule
)
2610 return obj
.type
->print(p
, obj
.v
);
2612 p
= isl_printer_set_yaml_style(p
, ISL_YAML_STYLE_BLOCK
);
2613 p
= obj
.type
->print(p
, obj
.v
);
2614 p
= isl_printer_set_yaml_style(p
, ISL_YAML_STYLE_FLOW
);
2619 static __isl_give isl_printer
*read_line(struct isl_stream
*s
,
2620 struct isl_hash_table
*table
, __isl_take isl_printer
*p
, int tty
)
2623 struct isl_obj obj
= { isl_obj_none
, NULL
};
2631 if (isl_stream_is_empty(s
))
2634 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_SOURCE
]))
2635 return source_file(s
, table
, p
);
2636 if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_CODEGEN
]))
2637 return codegen(s
, table
, p
);
2639 assign
= is_assign(s
);
2641 lhs
= isl_stream_read_ident_if_available(s
);
2642 if (isl_stream_eat(s
, ISL_TOKEN_DEF
))
2644 } else if (isl_stream_eat_if_available(s
, iscc_op
[ISCC_PRINT
]))
2649 obj
= read_expr(s
, table
);
2650 ctx
= isl_stream_get_ctx(s
);
2651 if (isl_stream_eat(s
, ';'))
2655 if (obj
.type
!= isl_obj_none
&& obj
.v
!= NULL
) {
2656 p
= print_obj(p
, obj
);
2657 p
= isl_printer_end_line(p
);
2662 if (!assign
&& obj
.type
!= isl_obj_none
&& obj
.v
!= NULL
) {
2663 static int count
= 0;
2664 snprintf(buf
, sizeof(buf
), "$%d", count
++);
2665 lhs
= strdup(buf
+ 1);
2667 p
= isl_printer_print_str(p
, buf
);
2668 p
= isl_printer_print_str(p
, " := ");
2669 p
= obj
.type
->print(p
, obj
.v
);
2670 p
= isl_printer_end_line(p
);
2672 if (lhs
&& do_assign(ctx
, table
, lhs
, obj
))
2677 isl_stream_flush_tokens(s
);
2678 isl_stream_skip_line(s
);
2684 static isl_stat
free_cb(void **entry
, void *user
)
2686 struct isl_named_obj
*named
= *entry
;
2688 free_obj(named
->obj
);
2695 static void register_named_ops(struct isl_stream
*s
)
2699 for (i
= 0; i
< ISCC_N_OP
; ++i
) {
2700 iscc_op
[i
] = isl_stream_register_keyword(s
, op_name
[i
]);
2701 assert(iscc_op
[i
] != ISL_TOKEN_ERROR
);
2704 for (i
= 0; ; ++i
) {
2705 if (!named_un_ops
[i
].name
)
2707 named_un_ops
[i
].op
.op
= isl_stream_register_keyword(s
,
2708 named_un_ops
[i
].name
);
2709 assert(named_un_ops
[i
].op
.op
!= ISL_TOKEN_ERROR
);
2712 for (i
= 0; ; ++i
) {
2713 if (!named_bin_ops
[i
].name
)
2715 named_bin_ops
[i
].op
.op
= isl_stream_register_keyword(s
,
2716 named_bin_ops
[i
].name
);
2717 assert(named_bin_ops
[i
].op
.op
!= ISL_TOKEN_ERROR
);
2720 for (i
= 0; ; ++i
) {
2721 if (!compound_bin_ops
[i
].full
)
2723 compound_bin_ops
[i
].op
.op
= isl_stream_register_keyword(s
,
2724 compound_bin_ops
[i
].full
);
2725 assert(compound_bin_ops
[i
].op
.op
!= ISL_TOKEN_ERROR
);
2729 static __isl_give isl_printer
*source_file(struct isl_stream
*s
,
2730 struct isl_hash_table
*table
, __isl_take isl_printer
*p
)
2733 struct isl_token
*tok
;
2734 struct isl_stream
*s_file
;
2735 struct iscc_options
*options
;
2739 tok
= isl_stream_next_token(s
);
2740 if (!tok
|| isl_token_get_type(tok
) != ISL_TOKEN_STRING
) {
2741 isl_stream_error(s
, tok
, "expecting filename");
2742 isl_token_free(tok
);
2746 isl_stream_eat(s
, ';');
2748 ctx
= isl_stream_get_ctx(s
);
2749 options
= isl_ctx_peek_iscc_options(ctx
);
2750 if (!options
|| !options
->io
) {
2751 isl_token_free(tok
);
2752 isl_die(ctx
, isl_error_invalid
,
2753 "source operation not allowed", return p
);
2756 name
= isl_token_get_str(ctx
, tok
);
2757 isl_token_free(tok
);
2758 file
= fopen(name
, "r");
2760 isl_assert(ctx
, file
, return p
);
2762 s_file
= isl_stream_new_file(ctx
, file
);
2768 register_named_ops(s_file
);
2770 while (!isl_stream_is_empty(s_file
))
2771 p
= read_line(s_file
, table
, p
, 0);
2773 isl_stream_free(s_file
);
2779 int main(int argc
, char **argv
)
2781 struct isl_ctx
*ctx
;
2782 struct isl_stream
*s
;
2783 struct isl_hash_table
*table
;
2784 struct iscc_options
*options
;
2786 int tty
= isatty(0);
2788 options
= iscc_options_new_with_defaults();
2791 ctx
= isl_ctx_alloc_with_options(&iscc_options_args
, options
);
2792 pet_options_set_autodetect(ctx
, 1);
2793 pet_options_set_encapsulate_dynamic_control(ctx
, 1);
2794 argc
= isl_ctx_parse_options(ctx
, argc
, argv
, ISL_ARG_ALL
);
2795 s
= isl_stream_new_file(ctx
, stdin
);
2797 table
= isl_hash_table_alloc(ctx
, 10);
2799 p
= isl_printer_to_file(ctx
, stdout
);
2800 p
= isl_printer_set_output_format(p
, options
->format
);
2803 register_named_ops(s
);
2805 install_signal_handler(ctx
);
2810 empty
= isl_stream_is_empty(s
);
2811 if (empty
&& isl_ctx_last_error(ctx
) != isl_error_abort
)
2814 p
= read_line(s
, table
, p
, tty
);
2815 if (isl_ctx_last_error(ctx
) == isl_error_abort
) {
2816 fprintf(stderr
, "Interrupted\n");
2817 isl_ctx_resume(ctx
);
2818 isl_ctx_reset_error(ctx
);
2822 remove_signal_handler(ctx
);
2824 isl_printer_free(p
);
2825 isl_hash_table_foreach(ctx
, table
, free_cb
, NULL
);
2826 isl_hash_table_free(ctx
, table
);