HomeSort by: relevance | last modified time | path
    Searched refs:isl_bool_ok (Results 1 - 25 of 40) sorted by relevancy

1 2

  /src/external/mit/isl/dist/
isl_id_to_ast_expr.c 6 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
isl_id_to_id.c 5 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
isl_id_to_pw_aff.c 6 #define isl_id_is_equal(id1,id2) isl_bool_ok(id1 == id2)
isl_set_to_ast_graft_list.c 6 #define isl_ast_graft_list_is_identical(a, b) isl_bool_ok(a == b)
isl_val.c 973 return isl_bool_ok(isl_int_is_divisible_by(v1->n, v2->n));
1146 return isl_bool_ok(isl_int_is_one(v->d));
1156 return isl_bool_ok(!isl_int_is_zero(v->d));
1166 return isl_bool_ok(isl_int_is_zero(v->n) && isl_int_is_zero(v->d));
1176 return isl_bool_ok(isl_int_is_pos(v->n) && isl_int_is_zero(v->d));
1186 return isl_bool_ok(isl_int_is_neg(v->n) && isl_int_is_zero(v->d));
1196 return isl_bool_ok(isl_int_is_zero(v->n) && !isl_int_is_zero(v->d));
1209 return isl_bool_ok(isl_int_eq(v->n, v->d));
1219 return isl_bool_ok(isl_int_is_neg(v->n) && isl_int_abs_eq(v->n, v->d));
1229 return isl_bool_ok(isl_int_is_pos(v->n))
    [all...]
isl_id.c 97 return isl_bool_ok(!strcmp(id->name, nu->name));
170 return isl_bool_ok(entry == name);
isl_union_multi.c 470 return isl_bool_ok(u->table.n == 0);
483 *single = isl_bool_ok(group->part_table.n == 1);
isl_vec.c 338 return isl_bool_ok(isl_seq_first_non_zero(vec->el, vec->size) < 0);
349 return isl_bool_ok(isl_seq_eq(vec1->el, vec2->el, vec1->size));
isl_ctx.c 46 isl_bool isl_bool_ok(int b) function
isl_local.c 116 return isl_bool_ok(isl_int_is_zero(mat->row[pos][0]));
isl_stream.c 28 return isl_bool_ok(!strcmp(keyword->name, val));
110 return isl_bool_ok(tok->u.s != NULL);
1043 return isl_bool_ok(isl_stream_eat_if_available(s, ','));
isl_constraint.c 447 return isl_bool_ok(isl_int_is_pos(constraint->v->el[pos]));
460 return isl_bool_ok(isl_int_is_neg(constraint->v->el[pos]));
646 return isl_bool_ok(constraint->eq);
isl_schedule_band.c 244 return isl_bool_ok(band->coincident[pos]);
277 return isl_bool_ok(band->permutable);
isl_space.c 106 return isl_bool_ok(r);
593 return isl_bool_ok(space->tuple_id[type - isl_dim_in] != NULL);
787 return isl_bool_ok(get_id(space, type, pos) != NULL);
832 return isl_bool_ok(id && id->name);
876 return isl_bool_ok(id && id->name);
2860 return isl_bool_ok(space->nested[1] != NULL);
2873 return isl_bool_ok(space->nested[0] != NULL);
2886 return isl_bool_ok(space->nested[1] != NULL);
isl_range.c 79 r = isl_bool_ok(sign * isl_val_sgn(opt) >= 0);
isl_polynomial.c 56 return isl_bool_ok(poly->var < 0);
155 return isl_bool_ok(r);
188 return isl_bool_ok(isl_int_is_zero(cst->n) && isl_int_is_pos(cst->d));
220 return isl_bool_ok(isl_int_is_zero(cst->n) && isl_int_is_zero(cst->d));
236 return isl_bool_ok(isl_int_is_pos(cst->n) && isl_int_is_zero(cst->d));
252 return isl_bool_ok(isl_int_is_neg(cst->n) && isl_int_is_zero(cst->d));
270 return isl_bool_ok(r);
286 return isl_bool_ok(isl_int_is_negone(cst->n) && isl_int_is_one(cst->d));
isl_schedule_tree.c 445 return tree ? isl_bool_ok(tree->anchored) : isl_bool_error;
671 equal = isl_bool_ok(tree1->mark == tree2->mark);
1621 return n < 0 ? isl_bool_error : isl_bool_ok(n == 0);
isl_ast.c 525 return isl_bool_ok(expr1->u.id == expr2->u.id);
1372 return isl_bool_ok(node->u.f.degenerate);
1494 return isl_bool_ok(node->u.i.else_node != NULL);
3301 return isl_bool_ok(seq);
isl_convex_hull.c 153 return isl_bool_ok(j >= set->n);
1526 return isl_bool_ok(isl_seq_eq(a->c->row[0] + 1, b, a->c->n_col - 1));
1584 return isl_bool_ok(isl_int_eq(c->c->row[0][0], con[0]));
2038 return isl_bool_ok(isl_seq_eq(row + 1, v->p + 1, v->len) ||
isl_point.c 177 return isl_bool_ok(pnt->vec->size == 0);
isl_schedule_node.c 978 return isl_bool_ok(depth != 0);
1021 return isl_bool_ok(node->child_pos[n - 1] > 0);
1048 return isl_bool_ok(node->child_pos[n - 1] + 1 < n_child);
1061 return isl_bool_ok(!isl_schedule_tree_is_leaf(node->tree));
isl_pw_templ.c 576 return isl_bool_ok(pw->n == 0);
1847 equal = isl_bool_ok(pw1->n == pw2->n);
isl_scheduler_clustering.c 689 return isl_bool_ok(n_coincident >= max_coincident);
isl_union_map.c 748 return isl_bool_ok(n == 1);
854 return isl_bool_ok(entry != isl_hash_table_entry_none);
1026 res.valid = isl_bool_ok(entry2 != isl_hash_table_entry_none);
  /src/external/mit/isl/dist/include/isl/
ctx.h 95 isl_bool isl_bool_ok(int b);

Completed in 47 milliseconds

1 2