Searched refs:n_op (Results 1 – 4 of 4) sorted by relevance
| /external/python/cpython3/Lib/lib2to3/fixes/ |
| D | fix_has_key.py | 95 n_op = Name("in", prefix=" ")
98 n_op = pytree.Node(syms.comp_op, (n_not, n_op))
99 new = pytree.Node(syms.comparison, (arg, n_op, before))
|
| /external/python/cpython2/Lib/lib2to3/fixes/ |
| D | fix_has_key.py | 96 n_op = Name(u"in", prefix=u" ")
99 n_op = pytree.Node(syms.comp_op, (n_not, n_op))
100 new = pytree.Node(syms.comparison, (arg, n_op, before))
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_tab.h | 274 __isl_take isl_basic_set *bset, int n_op, int n_region,
|
| D | isl_tab_pip.c | 5054 int n_op; member
5088 static int is_optimal(__isl_keep isl_vec *sol, int n_op) in is_optimal() argument
5092 for (i = 0; i < n_op; ++i) in is_optimal()
5113 __isl_keep isl_vec *sol, int n_op, int n_zero) in force_better_solution() argument
5122 for (i = n_zero; i < n_op; ++i) in force_better_solution()
5126 if (i == n_op) { in force_better_solution()
5129 return n_op; in force_better_solution()
5361 if (is_optimal(data->sol, data->n_op)) in enter_level()
5372 2 * local->n + 2 * data->n_op) < 0) in enter_level()
5398 data->sol, data->n_op, local->n_zero); in better_next_side()
[all …]
|