contrib/gcc/tree-ssa-loop-niter.c

138 			 struct tree_niter_desc *niter, bool never_infinite)
143   niter->control = *iv;
144   niter->bound = final;
145   niter->cmp = NE_EXPR;
168       niter->niter = c;
192 	niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
193 					  niter->assumptions, assumption);
198   niter->niter = fold_build2 (BIT_AND_EXPR, niter_type, tmp, bound);
212 			       struct tree_niter_desc *niter,
266     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
267 				      niter->assumptions,
270     niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
271 				      niter->may_be_zero,
284 		       struct tree_niter_desc *niter, tree step)
339     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
340 				      niter->assumptions, assumption);
352 		      struct tree_niter_desc *niter)
398     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
399 				      niter->assumptions, assumption);
401     niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,
402 				      niter->may_be_zero, mbz);
411 			 struct tree_niter_desc *niter,
419       niter->control = *iv0;
420       niter->cmp = LT_EXPR;
421       niter->bound = iv1->base;
425       niter->control = *iv1;
426       niter->cmp = GT_EXPR;
427       niter->bound = iv0->base;
448       niter->may_be_zero = fold_build2 (LT_EXPR, boolean_type_node,
450       niter->niter = delta;
463   if (number_of_iterations_lt_to_ne (type, iv0, iv1, niter, &delta, step))
473       return number_of_iterations_ne (type, &zps, delta, niter, true);
477   if (!assert_no_overflow_lt (type, iv0, iv1, niter, step))
483   assert_loop_rolls_lt (type, iv0, iv1, niter);
488   niter->niter = fold_build2 (FLOOR_DIV_EXPR, niter_type, delta, step);
501 			 struct tree_niter_desc *niter, bool never_infinite)
522 	niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
523 					  niter->assumptions, assumption);
532   return number_of_iterations_lt (type, iv0, iv1, niter, never_infinite);
554 			   affine_iv *iv1, struct tree_niter_desc *niter,
563        niter != 0.  */
564   niter->assumptions = boolean_true_node;
565   niter->may_be_zero = boolean_false_node;
566   niter->niter = NULL_TREE;
567   niter->additional_info = boolean_true_node;
569   niter->bound = NULL_TREE;
570   niter->cmp = ERROR_MARK;
652       niter->niter = build_int_cst (unsigned_type_for (type), 0);
662       return number_of_iterations_ne (type, iv0, iv1->base, niter, never_infinite);
664       return number_of_iterations_lt (type, iv0, iv1, niter, never_infinite);
666       return number_of_iterations_le (type, iv0, iv1, niter, never_infinite);
1046 			   struct tree_niter_desc *niter,
1057   niter->assumptions = boolean_false_node;
1100   if (!number_of_iterations_cond (type, &iv0, code, &iv1, niter,
1109       niter->assumptions = simplify_using_outer_evolutions (loop,
1110 							    niter->assumptions);
1111       niter->may_be_zero = simplify_using_outer_evolutions (loop,
1112 							    niter->may_be_zero);
1113       niter->niter = simplify_using_outer_evolutions (loop, niter->niter);
1116   niter->additional_info = boolean_true_node;
1117   niter->assumptions
1119 					       niter->assumptions,
1120 					       &niter->additional_info);
1121   niter->may_be_zero
1123 					       niter->may_be_zero,
1124 					       &niter->additional_info);
1128   if (integer_onep (niter->assumptions))
1134   if (integer_zerop (niter->assumptions))
1138     niter->assumptions = boolean_true_node;
1182   tree niter = NULL_TREE, aniter;
1199 	  niter = build_int_cst (unsigned_type_node, 0);
1207       aniter = desc.niter;
1209       if (!niter)
1212 	  niter = aniter;
1221       if (TREE_CODE (niter) != INTEGER_CST)
1223 	  niter = aniter;
1228       if (tree_int_cst_lt (aniter, niter))
1230 	  niter = aniter;
1237   return niter ? niter : chrec_dont_know;
1476   tree niter = NULL_TREE, aniter;
1489       if (niter
1490 	  && !tree_int_cst_lt (aniter, niter))
1493       niter = aniter;
1498   return niter ? niter : chrec_dont_know;
1854   tree niter, type;
1873       niter = niter_desc.niter;
1874       type = TREE_TYPE (niter);
1877 	niter = build3 (COND_EXPR, type, niter_desc.may_be_zero,
1879 			niter);
1880       record_estimate (loop, niter,
1945 			 tree niter)
1950   tree nit_type = TREE_TYPE (niter);
1959     niter = fold_convert (bound_type, niter);
1970   cond = fold_binary (cmp, boolean_type_node, niter, bound);