Lines Matching refs:op0
153 tree op0, op1, op2, op3;
260 orig_op0 = op0 = TREE_OPERAND (expr, 0);
263 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
265 STRIP_TYPE_NOPS (op0);
266 if (op0 != orig_op0)
267 ret = build3 (COMPONENT_REF, TREE_TYPE (expr), op0, op1, op2);
278 orig_op0 = op0 = TREE_OPERAND (expr, 0);
282 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
284 STRIP_TYPE_NOPS (op0);
291 ret = c_fold_array_ref (TREE_TYPE (expr), op0, op1);
296 if (op0 != orig_op0 || op1 != orig_op1)
297 ret = build4 (ARRAY_REF, TREE_TYPE (expr), op0, op1, op2, op3);
352 orig_op0 = op0 = TREE_OPERAND (expr, 0);
354 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
357 STRIP_TYPE_NOPS (op0);
365 if (for_int_const && (TREE_CODE (op0) != INTEGER_CST
369 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
371 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
372 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
376 && !TREE_OVERFLOW_P (op0)
377 && !(BINARY_CLASS_P (op0) && TREE_OVERFLOW_P (TREE_OPERAND (op0, 1)))
384 && TREE_CODE (op0) == INTEGER_CST
387 && tree_int_cst_sgn (op0) < 0)
421 /* If either OP0 has been folded to INTEGER_CST... */
425 && TREE_CODE (op0) == INTEGER_CST)
433 maybe_warn_shift_overflow (loc, op0, op1);
478 orig_op0 = op0 = TREE_OPERAND (expr, 0);
479 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
482 STRIP_TYPE_NOPS (op0);
484 if (for_int_const && TREE_CODE (op0) != INTEGER_CST)
489 if (op0 != orig_op0
491 && (op1 = get_base_address (op0)) != NULL_TREE
494 ret = fold_offsetof (op0, TREE_TYPE (expr));
495 else if (op0 != orig_op0 || in_init)
497 ? fold_build1_initializer_loc (loc, code, TREE_TYPE (expr), op0)
498 : fold_build1_loc (loc, code, TREE_TYPE (expr), op0);
519 if (TREE_OVERFLOW_P (ret) && !TREE_OVERFLOW_P (op0))
520 overflow_warning (EXPR_LOCATION (expr), ret, op0);
529 orig_op0 = op0 = TREE_OPERAND (expr, 0);
531 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self,
533 STRIP_TYPE_NOPS (op0);
535 unused_p = (op0 == (code == TRUTH_ANDIF_EXPR
545 && (TREE_CODE (op0) != INTEGER_CST
550 if (op0 != orig_op0 || op1 != orig_op1 || in_init)
552 ? fold_build2_initializer_loc (loc, code, TREE_TYPE (expr), op0, op1)
553 : fold_build2_loc (loc, code, TREE_TYPE (expr), op0, op1);
562 ? op0 == truthvalue_false_node
563 : op0 == truthvalue_true_node)))
568 ? op0 == truthvalue_false_node
569 : op0 == truthvalue_true_node)))
574 orig_op0 = op0 = TREE_OPERAND (expr, 0);
577 op0 = c_fully_fold_internal (op0, in_init, &op0_const, &op0_const_self,
580 STRIP_TYPE_NOPS (op0);
581 c_disable_warnings (op0 == truthvalue_false_node);
585 c_enable_warnings (op0 == truthvalue_false_node);
587 c_disable_warnings (op0 == truthvalue_true_node);
591 c_enable_warnings (op0 == truthvalue_true_node);
594 && (TREE_CODE (op0) != INTEGER_CST
596 || (op0 == truthvalue_true_node
601 if (op0 != orig_op0 || op1 != orig_op1 || op2 != orig_op2)
602 ret = fold_build3_loc (loc, code, TREE_TYPE (expr), op0, op1, op2);
610 && op0 == truthvalue_false_node))
614 && op0 == truthvalue_false_node))
619 && op0 == truthvalue_true_node))
623 && op0 == truthvalue_true_node))
628 orig_op0 = op0 = TREE_OPERAND (expr, 0);
631 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
633 STRIP_TYPE_NOPS (op0);
641 if (op0 != orig_op0 || op1 != orig_op1 || op2 != orig_op2)
642 ret = fold_build3_loc (loc, code, TREE_TYPE (expr), op0, op1, op2);
658 op0 = TREE_OPERAND (expr, 0);
661 op0 = c_fully_fold_internal (op0, in_init, maybe_const_operands,
664 TREE_OPERAND (expr, 0) = op0;
668 if (tree_invariant_p (op0))
669 ret = op0;