HomeSort by: relevance | last modified time | path
    Searched defs:tight (Results 1 - 5 of 5) sorted by relevancy

  /src/external/mit/isl/dist/
isl_bound.c 26 enum isl_fold type, isl_bool *tight)
34 if (tight)
35 *tight = isl_bool_true;
40 /* Add the bound "pwf", which is not known to be tight,
50 /* Add the bound "pwf", which is known to be tight,
63 * add it to the tight bounds of "bound".
299 __isl_take isl_pw_qpolynomial_fold *pwf, isl_bool *tight)
321 if (tight)
322 *tight = isl_bool_true;
329 if (tight)
382 isl_bool tight; member in struct:isl_union_bound_data
    [all...]
isl_bernstein.c 98 /* Check whether the bound associated to the selection "k" is tight,
105 * the bound is necessarily tight.
131 isl_bool tight; local
135 tight = isl_bool_false;
137 tight = is_tight(k, n, d, data->cell);
138 if (tight < 0)
140 if (tight)
371 isl_bool *tight)
383 return isl_qpolynomial_cst_bound(bset, poly, data->type, tight);
389 return isl_qpolynomial_cst_bound(bset, poly, data->type, tight);
557 isl_bool tight = isl_bool_false; local
    [all...]
isl_range.c 15 int tight; member in struct:range_data
61 data_m.tight = 0;
266 * depending on whether the result has been determined to be tight.
282 if (data->tight)
298 * and mark the result as not being tight.
321 data->tight = 0;
342 * If the current polynomial is tight and if this bound is integer,
343 * then the result is still tight. In all other cases, the results
344 * may not be tight.
357 int save_tight = data->tight;
    [all...]
isl_fold.c 1885 isl_bool *tight)
1919 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
1930 isl_bool *tight)
1932 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight);
1939 isl_bool tight; member in struct:isl_apply_fold_data
1960 pwf, data->tight ? &data->tight : NULL);
1984 __isl_take isl_union_pw_qpolynomial_fold *upwf, isl_bool *tight)
1996 data.tight = tight ? isl_bool_true : isl_bool_false
    [all...]
isl_test.c 4014 * "tight" is set if the result is expected to be tight.
4017 int tight; member in struct:__anon23704
4070 isl_bool equal, tight; local
4077 pwf1 = isl_pw_qpolynomial_bound(pwqp, type, &tight);
4088 if (bound_tests[i].tight && !tight)
4090 "bound unexpectedly not tight", return -1);

Completed in 24 milliseconds