Home
last modified time | relevance | path

Searched refs:zero_p (Results 1 – 7 of 7) sorted by relevance

/openbsd-src/gnu/gcc/gcc/
H A Dtree-ssa-loop-niter.c59 zero_p (tree arg) in zero_p() function
231 if (!iv1->no_overflow && !zero_p (mod)) in number_of_iterations_lt_to_ne()
237 if (zero_p (assumption)) in number_of_iterations_lt_to_ne()
250 if (!iv0->no_overflow && !zero_p (mod)) in number_of_iterations_lt_to_ne()
256 if (zero_p (assumption)) in number_of_iterations_lt_to_ne()
269 if (!zero_p (noloop)) in number_of_iterations_lt_to_ne()
336 if (zero_p (assumption)) in assert_no_overflow_lt()
400 if (!zero_p (mbz)) in assert_loop_rolls_lt()
436 && zero_p (iv1->step)) in number_of_iterations_lt()
438 && zero_p (iv0->step))) in number_of_iterations_lt()
[all …]
H A Dtree-ssa-loop-ivopts.c785 && zero_p (desc.may_be_zero) in niter_for_exit()
957 return (zero_p (iv.step) ? NULL_TREE : iv.step); in determine_biv_step()
1213 if (zero_p (iv->step)) in find_interesting_uses_op()
1277 || (!zero_p (iv0->step) && !zero_p (iv1->step))) in find_interesting_uses_cond()
1284 if (zero_p (iv0->step) && zero_p (iv1->step)) in find_interesting_uses_cond()
1291 *civ = zero_p (iv0->step) ? *iv1: *iv0; in find_interesting_uses_cond()
1567 if (zero_p (step)) in find_interesting_uses_address()
1577 || zero_p (step)) in find_interesting_uses_address()
1651 if (iv && !zero_p (iv->step)) in find_interesting_uses_stmt()
1693 if (iv && !zero_p (iv->step)) in find_interesting_uses_stmt()
[all …]
H A Dtree-ssa-address.c277 if (!zero_p (offset)) in tree_mem_ref_addr()
327 if (addr->offset && zero_p (addr->offset)) in create_mem_ref_raw()
H A Dtree-ssa-loop-prefetch.c351 if (zero_p (step)) in idx_analyze_ref()
H A Dtree-ssa-loop-manip.c739 if (!zero_p (desc->may_be_zero)) in determine_exit_conditions()
H A Dtree.h4004 extern bool zero_p (tree);
H A Dtree-cfg.c2174 return (zero_p (val) ? false_edge : true_edge); in find_taken_edge_cond_expr()