HomeSort by: relevance | last modified time | path
    Searched refs:is_bound (Results 1 - 7 of 7) sorted by relevancy

  /src/external/mit/isl/dist/
isl_box.c 255 isl_bool is_bound, any_divs; local
257 is_bound = isl_constraint_is_lower_bound(c, isl_dim_set, pos);
258 if (is_bound < 0 || !is_bound)
259 return is_bound;
282 isl_bool is_bound, better; local
284 is_bound = is_suitable_bound(c, info->pos);
285 if (is_bound < 0 || !is_bound) {
287 return is_bound < 0 ? isl_stat_error : isl_stat_ok
    [all...]
isl_convex_hull.c 395 isl_bool is_bound; local
407 is_bound = uset_is_bound(set, bounds->row[0], 1 + dim);
408 if (is_bound < 0)
410 isl_assert(set->ctx, is_bound, goto error);
2124 static int is_bound(struct sh_data *data, __isl_keep isl_set *set, int j, function
2213 * of the inequality, so we directly call is_bound.
2265 bound = is_bound(data, set, j, hull->ineq[k], shift);
2282 bound = is_bound(data, set, j, hull->ineq[k], shift);
2692 * we call is_bound to perform the test.
2736 bound = is_bound(data, set, i, ineq, 0)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/ttm/
ttm_agp_backend.c 95 if (agp_be->mem->is_bound)
  /src/usr.sbin/rpcbind/
rpcbind.h 89 bool_t is_bound(const char *, const char *);
check_bound.c 151 is_bound(const char *netid, const char *uaddr) function
pmap_svc.c 314 if (is_bound(netid, serveuaddr)) {
rpcb_svc_com.c 305 if (is_bound(rbl->rpcb_map.r_netid, rbl->rpcb_map.r_addr))

Completed in 18 milliseconds