705 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1,  in number_of_iterations_lt_to_ne()  argument
744 	    || (iv1->no_overflow && integer_nonzerop (iv1->step));  in number_of_iterations_lt_to_ne()
756 				    iv1->base, bound);  in number_of_iterations_lt_to_ne()
765 			      fold_build_pointer_plus (iv1->base, tmod));  in number_of_iterations_lt_to_ne()
770 					   iv1->base, tmod));  in number_of_iterations_lt_to_ne()
793 			      iv1->base);  in number_of_iterations_lt_to_ne()
798 			      iv1->base);  in number_of_iterations_lt_to_ne()
824 assert_no_overflow_lt (tree type, affine_iv *iv0, affine_iv *iv1,  in assert_no_overflow_lt()  argument
853 				iv1->base, bound);  in assert_no_overflow_lt()
858       if (iv1->no_overflow)  in assert_no_overflow_lt()
861       if (TREE_CODE (iv1->base) == INTEGER_CST)  in assert_no_overflow_lt()
864 			   fold_convert (niter_type, iv1->base),  in assert_no_overflow_lt()
884   iv1->no_overflow = true;  in assert_no_overflow_lt()
893 assert_loop_rolls_lt (tree type, affine_iv *iv0, affine_iv *iv1,  in assert_loop_rolls_lt()  argument
928       dstep = double_int_sext (tree_to_double_int (iv1->step),  in assert_loop_rolls_lt()
983       mbzr = fold_convert (type1, iv1->base);  in assert_loop_rolls_lt()
988 			  iv1->step, build_int_cst (type1, 1));  in assert_loop_rolls_lt()
995 				    iv1->base, bound);  in assert_loop_rolls_lt()
1000 			  fold_convert (type1, iv1->base), diff);  in assert_loop_rolls_lt()
1021 number_of_iterations_lt (tree type, affine_iv *iv0, affine_iv *iv1,  in number_of_iterations_lt()  argument
1033       niter->bound = iv1->base;  in number_of_iterations_lt()
1037       niter->control = *iv1;  in number_of_iterations_lt()
1043 		       fold_convert (niter_type, iv1->base),  in number_of_iterations_lt()
1047   if ((integer_onep (iv0->step) && integer_zerop (iv1->step))  in number_of_iterations_lt()
1048       || (integer_all_onesp (iv1->step) && integer_zerop (iv0->step)))  in number_of_iterations_lt()
1066 					  iv1->base, iv0->base);  in number_of_iterations_lt()
1076 			 fold_build1 (NEGATE_EXPR, type, iv1->step));  in number_of_iterations_lt()
1081   if (number_of_iterations_lt_to_ne (type, iv0, iv1, niter, &delta, step,  in number_of_iterations_lt()
1096   if (!assert_no_overflow_lt (type, iv0, iv1, niter, step))  in number_of_iterations_lt()
1102   assert_loop_rolls_lt (type, iv0, iv1, niter, bnds);  in number_of_iterations_lt()
1130 number_of_iterations_le (tree type, affine_iv *iv0, affine_iv *iv1,  in number_of_iterations_le()  argument
1152 				  iv1->base, TYPE_MAX_VALUE (type));  in number_of_iterations_le()
1167 	iv1->base = fold_build_pointer_plus_hwi (iv1->base, 1);  in number_of_iterations_le()
1169 	iv1->base = fold_build2 (PLUS_EXPR, type1, iv1->base,  in number_of_iterations_le()
1180   return number_of_iterations_lt (type, iv0, iv1, niter, exit_must_be_taken,  in number_of_iterations_le()
1224 			   affine_iv *iv1, struct tree_niter_desc *niter,  in number_of_iterations_cond()  argument
1248       SWAP (iv0, iv1);  in number_of_iterations_cond()
1260       iv1->no_overflow = true;  in number_of_iterations_cond()
1270       else if (!integer_zerop (iv1->step) && iv1->no_overflow)  in number_of_iterations_cond()
1277   if (!integer_zerop (iv0->step) && !integer_zerop (iv1->step))  in number_of_iterations_cond()
1284 					   iv0->step, iv1->step);  in number_of_iterations_cond()
1286       iv1->step = build_int_cst (step_type, 0);  in number_of_iterations_cond()
1287       iv1->no_overflow = true;  in number_of_iterations_cond()
1293   if (integer_zerop (iv0->step) && integer_zerop (iv1->step))  in number_of_iterations_cond()
1302       if (!integer_zerop (iv1->step) && !tree_int_cst_sign_bit (iv1->step))  in number_of_iterations_cond()
1307   if (integer_zerop (fold_build2 (code, boolean_type_node, iv0->base, iv1->base)))  in number_of_iterations_cond()
1316   bound_difference (loop, iv1->base, iv0->base, &bnds);  in number_of_iterations_cond()
1329       dump_affine_iv (dump_file, iv1);  in number_of_iterations_cond()
1342       gcc_assert (integer_zerop (iv1->step));  in number_of_iterations_cond()
1343       ret = number_of_iterations_ne (type, iv0, iv1->base, niter,  in number_of_iterations_cond()
1348       ret = number_of_iterations_lt (type, iv0, iv1, niter, exit_must_be_taken,  in number_of_iterations_cond()
1353       ret = number_of_iterations_le (type, iv0, iv1, niter, exit_must_be_taken,  in number_of_iterations_cond()
1811   affine_iv iv0, iv1;  in number_of_iterations_exit()  local
1849   if (!simple_iv (loop, loop_containing_stmt (stmt), op1, &iv1, false))  in number_of_iterations_exit()
1857   iv1.base = expand_simple_operations (iv1.base);  in number_of_iterations_exit()
1858   if (!number_of_iterations_cond (loop, type, &iv0, code, &iv1, niter,  in number_of_iterations_exit()
1902       if (!integer_zerop (iv1.step)  in number_of_iterations_exit()
1904 	     && (integer_onep (iv1.step) || integer_all_onesp (iv1.step)))  in number_of_iterations_exit()