106   new_op->ops[0] = orig_op->cond.cond;  in convert_conditional_op()
108     new_op->ops[i + 1] = orig_op->ops[i];  in convert_conditional_op()
112 					       num_ops, orig_op->ops);  in convert_conditional_op()
113   new_op->ops[num_ops + 1] = else_value;  in convert_conditional_op()
154 	op_could_trap = generic_expr_could_trap_p (res_op->ops[0]);  in maybe_resimplify_conditional_op()
177 		     res_op->cond.cond, res_op->ops[0],  in maybe_resimplify_conditional_op()
202   if (constant_for_folding (res_op->ops[0]))  in gimple_resimplify1()
210 	    tem = const_unop (res_op->code, res_op->type, res_op->ops[0]);  in gimple_resimplify1()
214 			       res_op->ops[0]);  in gimple_resimplify1()
243 		       res_op->code, res_op->type, res_op->ops[0]))  in gimple_resimplify1()
267   if (constant_for_folding (res_op->ops[0])  in gimple_resimplify2()
268       && constant_for_folding (res_op->ops[1]))  in gimple_resimplify2()
277 			       res_op->ops[0], res_op->ops[1]);  in gimple_resimplify2()
281 			       res_op->ops[0], res_op->ops[1]);  in gimple_resimplify2()
298       && tree_swap_operands_p (res_op->ops[0], res_op->ops[1]))  in gimple_resimplify2()
300       std::swap (res_op->ops[0], res_op->ops[1]);  in gimple_resimplify2()
320 		       res_op->ops[0], res_op->ops[1]))  in gimple_resimplify2()
344   if (constant_for_folding (res_op->ops[0])  in gimple_resimplify3()
345       && constant_for_folding (res_op->ops[1])  in gimple_resimplify3()
346       && constant_for_folding (res_op->ops[2]))  in gimple_resimplify3()
355 						res_op->ops[0], res_op->ops[1],  in gimple_resimplify3()
356 						res_op->ops[2]);  in gimple_resimplify3()
360 			       res_op->ops[0], res_op->ops[1], res_op->ops[2]);  in gimple_resimplify3()
376       && tree_swap_operands_p (res_op->ops[0], res_op->ops[1]))  in gimple_resimplify3()
378       std::swap (res_op->ops[0], res_op->ops[1]);  in gimple_resimplify3()
396 		       res_op->ops[0], res_op->ops[1], res_op->ops[2]))  in gimple_resimplify3()
436 		       res_op->ops[0], res_op->ops[1], res_op->ops[2],  in gimple_resimplify4()
437 		       res_op->ops[3]))  in gimple_resimplify4()
466 		       res_op->ops[0], res_op->ops[1], res_op->ops[2],  in gimple_resimplify5()
467 		       res_op->ops[3], res_op->ops[4]))  in gimple_resimplify5()
516       val = build1 (code, res_op->type, res_op->ops[0]);  in maybe_build_generic_op()
520       val = build3 (code, res_op->type, res_op->ops[0], res_op->ops[1],  in maybe_build_generic_op()
521 		    res_op->ops[2]);  in maybe_build_generic_op()
540 						  res_op->ops);  in build_call_internal()
560   tree *ops = res_op->ops;  in maybe_push_res_to_seq()  local
573 	return ops[0];  in maybe_push_res_to_seq()
588     if (TREE_CODE (ops[i]) == SSA_NAME  in maybe_push_res_to_seq()
589 	&& SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ops[i]))  in maybe_push_res_to_seq()
592   if (num_ops > 0 && COMPARISON_CLASS_P (ops[0]))  in maybe_push_res_to_seq()
594       if (TREE_CODE (TREE_OPERAND (ops[0], i)) == SSA_NAME  in maybe_push_res_to_seq()
595 	  && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (TREE_OPERAND (ops[0], i)))  in maybe_push_res_to_seq()
864   gimple_match_op cond_op (gimple_match_cond (res_op->ops[0],  in try_conditional_simplification()
865 					      res_op->ops[num_ops - 1]),  in try_conditional_simplification()
868   memcpy (cond_op.ops, res_op->ops + 1, (num_ops - 1) * sizeof *cond_op.ops);  in try_conditional_simplification()
985 					   res_op2.ops[0], res_op2.ops[1]);  in gimple_simplify()
989 			    rhs1 = res_op2.ops[0];  in gimple_simplify()
1044 	      res_op->ops[i] = do_valueize (arg, top_valueize, valueized);  in gimple_simplify()