Home
last modified time | relevance | path

Searched refs:isl_bool_ok (Results 1 – 25 of 40) sorted by relevance

12

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_val.c1146 return isl_bool_ok(isl_int_is_one(v->d)); in isl_val_is_int()
1156 return isl_bool_ok(!isl_int_is_zero(v->d)); in isl_val_is_rat()
1209 return isl_bool_ok(isl_int_eq(v->n, v->d)); in isl_val_is_one()
1229 return isl_bool_ok(isl_int_is_pos(v->n)); in isl_val_is_pos()
1239 return isl_bool_ok(isl_int_is_neg(v->n)); in isl_val_is_neg()
1252 return isl_bool_ok(isl_int_is_nonneg(v->n)); in isl_val_is_nonneg()
1265 return isl_bool_ok(isl_int_is_nonpos(v->n)); in isl_val_is_nonpos()
1293 return isl_bool_ok(isl_int_lt(v1->n, v2->n)); in isl_val_lt()
1310 lt = isl_bool_ok(isl_int_is_neg(t)); in isl_val_lt()
1342 res = isl_bool_ok(isl_val_gt(v, vi)); in isl_val_gt_si()
[all …]
H A Disl_id_to_pw_aff.c5 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
H A Disl_id_to_ast_expr.c5 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
H A Disl_id_to_id.c5 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
H A Disl_set_to_ast_graft_list.c6 #define isl_ast_graft_list_is_identical(a, b) isl_bool_ok(a == b)
H A Disl_id.c97 return isl_bool_ok(!strcmp(id->name, nu->name)); in isl_id_has_name_and_user()
170 return isl_bool_ok(entry == name); in isl_id_eq()
H A Disl_union_multi.c470 return isl_bool_ok(u->table.n == 0); in FN()
483 *single = isl_bool_ok(group->part_table.n == 1); in FN()
H A Disl_vec.c337 return isl_bool_ok(isl_seq_first_non_zero(vec->el, vec->size) < 0); in isl_vec_is_zero()
348 return isl_bool_ok(isl_seq_eq(vec1->el, vec2->el, vec1->size)); in isl_vec_is_equal()
H A Disl_local.c108 return isl_bool_ok(isl_int_is_zero(mat->row[pos][0])); in isl_local_div_is_marked_unknown()
H A Disl_space.c106 return isl_bool_ok(r); in isl_space_is_map()
578 return isl_bool_ok(space->tuple_id[type - isl_dim_in] != NULL); in isl_space_has_tuple_id()
772 return isl_bool_ok(get_id(space, type, pos) != NULL); in isl_space_has_dim_id()
817 return isl_bool_ok(id && id->name); in isl_space_has_tuple_name()
861 return isl_bool_ok(id && id->name); in isl_space_has_dim_name()
2752 return isl_bool_ok(space->nested[1] != NULL); in isl_space_is_wrapping()
2765 return isl_bool_ok(space->nested[0] != NULL); in isl_space_domain_is_wrapping()
2778 return isl_bool_ok(space->nested[1] != NULL); in isl_space_range_is_wrapping()
H A Disl_ctx.c46 isl_bool isl_bool_ok(int b) in isl_bool_ok() function
H A Disl_constraint.c447 return isl_bool_ok(isl_int_is_pos(constraint->v->el[pos])); in isl_constraint_is_lower_bound()
460 return isl_bool_ok(isl_int_is_neg(constraint->v->el[pos])); in isl_constraint_is_upper_bound()
646 return isl_bool_ok(constraint->eq); in isl_constraint_is_equality()
H A Disl_schedule_band.c244 return isl_bool_ok(band->coincident[pos]); in isl_schedule_band_member_get_coincident()
277 return isl_bool_ok(band->permutable); in isl_schedule_band_get_permutable()
H A Disl_polynomial.c56 return isl_bool_ok(poly->var < 0); in isl_poly_is_cst()
155 return isl_bool_ok(r); in isl_poly_is_equal()
188 return isl_bool_ok(isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d)); in isl_poly_is_zero()
220 return isl_bool_ok(isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d)); in isl_poly_is_nan()
236 return isl_bool_ok(isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d)); in isl_poly_is_infty()
252 return isl_bool_ok(isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d)); in isl_poly_is_neginfty()
270 return isl_bool_ok(r); in isl_poly_is_one()
286 return isl_bool_ok(isl_int_is_negone(cst->n) && isl_int_is_one(cst->d)); in isl_poly_is_negone()
H A Disl_range.c79 r = isl_bool_ok(sign * isl_val_sgn(opt) >= 0); in has_sign()
H A Disl_convex_hull.c153 return isl_bool_ok(j >= set->n); in uset_is_bound()
1526 return isl_bool_ok(isl_seq_eq(a->c->row[0] + 1, b, a->c->n_col - 1)); in max_constraint_equal()
1584 return isl_bool_ok(isl_int_eq(c->c->row[0][0], con[0])); in has_constraint()
2038 return isl_bool_ok(isl_seq_eq(row + 1, v->p + 1, v->len) || in has_ineq()
H A Disl_schedule_tree.c445 return tree ? isl_bool_ok(tree->anchored) : isl_bool_error; in isl_schedule_tree_is_subtree_anchored()
671 equal = isl_bool_ok(tree1->mark == tree2->mark); in isl_schedule_tree_plain_is_equal()
1621 return n < 0 ? isl_bool_error : isl_bool_ok(n == 0); in domain_less()
H A Disl_point.c171 return isl_bool_ok(pnt->vec->size == 0); in isl_point_is_void()
H A Disl_ast.c393 return isl_bool_ok(expr1->u.id == expr2->u.id); in isl_ast_expr_is_equal()
1179 return isl_bool_ok(node->u.f.degenerate); in isl_ast_node_for_is_degenerate()
1297 return isl_bool_ok(node->u.i.else_node != NULL); in isl_ast_node_if_has_else_node()
H A Disl_schedule_node.c978 return isl_bool_ok(depth != 0); in isl_schedule_node_has_parent()
1021 return isl_bool_ok(node->child_pos[n - 1] > 0); in isl_schedule_node_has_previous_sibling()
1048 return isl_bool_ok(node->child_pos[n - 1] + 1 < n_child); in isl_schedule_node_has_next_sibling()
1061 return isl_bool_ok(!isl_schedule_tree_is_leaf(node->tree)); in isl_schedule_node_has_children()
H A Disl_stream.c28 return isl_bool_ok(!strcmp(keyword->name, val)); in same_name()
H A Disl_pw_templ.c327 return isl_bool_ok(pw->n == 0); in FN()
2040 equal = isl_bool_ok(pw1->n == pw2->n); in FN()
H A Disl_union_map.c704 return isl_bool_ok(n == 1); in isl_union_map_isa_map()
810 return isl_bool_ok(entry != isl_hash_table_entry_none); in isl_union_map_contains()
982 res.valid = isl_bool_ok(entry2 != isl_hash_table_entry_none); in bin_try_get_match()
H A Disl_test.c2932 if (check_bool(ctx, isl_bool_ok(0), isl_bool_false) < 0) in test_isl_bool()
2934 if (check_bool(ctx, isl_bool_ok(1), isl_bool_true) < 0) in test_isl_bool()
2936 if (check_bool(ctx, isl_bool_ok(-1), isl_bool_true) < 0) in test_isl_bool()
2938 if (check_bool(ctx, isl_bool_ok(2), isl_bool_true) < 0) in test_isl_bool()
2940 if (check_bool(ctx, isl_bool_ok(-2), isl_bool_true) < 0) in test_isl_bool()
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dctx.h95 isl_bool isl_bool_ok(int b);

12