Lines Matching refs:left

1080          attribute test, it is left be.  */
1859 the root. A new node will be created with the root's code. Its left
2101 rtx left, right;
2108 left = simplify_and_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2110 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2112 newexp = attr_rtx (AND, left, right);
2123 left = simplify_and_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2133 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2135 newexp = attr_rtx (IOR, left, right);
2231 rtx left, right;
2238 left = simplify_or_tree (XEXP (exp, 0), pterm, insn_code, insn_index);
2240 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2242 newexp = attr_rtx (GET_CODE (exp), left, right);
2253 left = simplify_or_tree (XEXP (exp, 0), &temp, insn_code, insn_index);
2263 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2265 newexp = attr_rtx (GET_CODE (exp), left, right);
2509 rtx left, right;
2524 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
2525 if (left == false_rtx)
2531 if (GET_CODE (left) == EQ_ATTR_ALT
2534 exp = attr_alt_intersection (left, right);
2541 if ((GET_CODE (left) == IOR || GET_CODE (right) == IOR)
2542 && compute_alternative_mask (left, IOR)
2545 if (GET_CODE (left) == IOR)
2547 rtx tem = left;
2548 left = right;
2553 attr_rtx (AND, left, XEXP (right, 0)),
2554 attr_rtx (AND, left, XEXP (right, 1)));
2560 right = simplify_and_tree (right, &left, insn_code, insn_index);
2561 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
2562 left = simplify_and_tree (left, &right, insn_code, insn_index);
2564 if (left == false_rtx || right == false_rtx)
2566 else if (left == true_rtx)
2572 return left;
2577 if (GET_CODE (left) == NOT)
2578 left_alt = (GET_CODE (XEXP (left, 0)) == EQ_ATTR
2579 && XSTR (XEXP (left, 0), 0) == alternative_name);
2581 left_alt = (GET_CODE (left) == EQ_ATTR_ALT
2582 && XINT (left, 1));
2592 && (GET_CODE (left) == AND
2612 left = make_alternative_compare (i);
2613 right = simplify_and_tree (exp, &left, insn_code, insn_index);
2614 newexp = attr_rtx (AND, left, right);
2620 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2622 newexp = attr_rtx (AND, left, right);
2628 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
2629 if (left == true_rtx)
2635 if (GET_CODE (left) == EQ_ATTR_ALT
2638 exp = attr_alt_union (left, right);
2642 right = simplify_or_tree (right, &left, insn_code, insn_index);
2643 if (left == XEXP (exp, 0) && right == XEXP (exp, 1))
2644 left = simplify_or_tree (left, &right, insn_code, insn_index);
2646 if (right == true_rtx || left == true_rtx)
2648 else if (left == false_rtx)
2654 return left;
2664 else if (GET_CODE (left) == AND && GET_CODE (right) == AND
2665 && attr_equal_p (XEXP (left, 0), XEXP (right, 0)))
2667 newexp = attr_rtx (IOR, XEXP (left, 1), XEXP (right, 1));
2669 left = XEXP (left, 0);
2671 newexp = attr_rtx (AND, left, right);
2679 && (GET_CODE (left) == IOR
2680 || (GET_CODE (left) == EQ_ATTR_ALT
2681 && !XINT (left, 1))
2682 || (GET_CODE (left) == EQ_ATTR
2683 && XSTR (left, 0) == alternative_name)
2705 left = make_alternative_compare (i);
2706 right = simplify_and_tree (exp, &left, insn_code, insn_index);
2707 newexp = attr_rtx (IOR, attr_rtx (NOT, left), right);
2713 if (left != XEXP (exp, 0) || right != XEXP (exp, 1))
2715 newexp = attr_rtx (IOR, left, right);
2723 left = SIMPLIFY_TEST_EXP (XEXP (XEXP (exp, 0), 0),
2725 return left;
2728 left = SIMPLIFY_TEST_EXP (XEXP (exp, 0), insn_code, insn_index);
2729 if (GET_CODE (left) == NOT)
2730 return XEXP (left, 0);
2732 if (left == false_rtx)
2734 if (left == true_rtx)
2737 if (GET_CODE (left) == EQ_ATTR_ALT)
2739 exp = attr_alt_complement (left);
2744 if (GET_CODE (left) == IOR)
2747 attr_rtx (NOT, XEXP (left, 0)),
2748 attr_rtx (NOT, XEXP (left, 1)));
2752 else if (GET_CODE (left) == AND)
2755 attr_rtx (NOT, XEXP (left, 0)),
2756 attr_rtx (NOT, XEXP (left, 1)));
2760 else if (left != XEXP (exp, 0))
2762 newexp = attr_rtx (NOT, left);