Lines Matching defs:this

40    The special attribute `length' is also recognized.  For this operand,
42 (address (pc)), are valid. In this case, an initial pass is made to
81 A way to do this is to iterate over all possible combinations of values
163 struct insn_ent *first_insn; /* First insn with this value. */
164 int num_insns; /* Number of insns with this value. */
165 int has_asm_insn; /* True if this value used for `asm' insns */
174 struct attr_value *first_value; /* First value of this attribute. */
175 struct attr_value *default_val; /* Default value for this attribute. */
177 unsigned is_numeric : 1; /* Values of this attribute are numeric. */
292 int hashcode; /* Hash code of this rtx or string. */
746 /* Copy this just to make it permanent,
751 constant attribute, so don't expand this until it's time to
1163 expressions by converting them into a COND. This removes cases from this
1210 /* Fall through to COND case since this is now a COND. */
1421 /* If no value is specified for this insn for this attribute, use the
1444 ADDRESS_FN. If not but it is a COND or IF_THEN_ELSE, call this routine
1465 /* Make a new copy of this COND, replacing each element. */
1638 Also call ourselves on any COND operations that are values of this COND.
1670 /* Simplify this test. */
1675 /* See if this value may need simplification. */
1679 /* Look for ways to delete or combine this test. */
1682 /* If test is true, make this value the default
1683 and discard this + any following tests. */
1700 /* If this value and the value for the prev test are the same,
1707 /* Delete this test/value. */
1843 /* Make a copy of this expression and call recursively. */
1910 of "attr" for this insn code. From that value, we can compute a test
1974 rtx this = simplify_test_exp_in_temp (XVECEXP (value, 0, i),
1977 right = insert_right_side (AND, andexp, this,
1988 /* Add this condition into the AND expression. */
1989 newexp = attr_rtx (NOT, this);
2032 this can be replaced by (eq_attr "att" "v2"). To do this we need to
2079 /* Check for simplifications. Do some extra checking here since this
2477 present on both sides, apply the distributive law since this will
2513 in this tree. Optimize if so. */
2540 /* If all alternatives are excluded, this is false. */
2548 optimization. We do not want to do this if the insn has one
2614 in this tree. Optimize if so. */
2633 /* If all alternatives are included, this is true. */
2641 optimization. We do not want to do this if the insn has one
2716 /* Look at the value for this insn code in the specified attribute.
2717 We normally can replace this comparison with the condition that
2718 would give this insn the values being tested for. */
2737 /* We have already simplified this expression. Simplifying it again
2804 We use it to mean "already simplified for this insn". */
2911 attr->default_val, since it is initialized by this routine. */
2968 number of alternatives as this should be checked elsewhere. */
3414 /* The address of the current insn. We implement this actually as the
3418 intervening alignments between this insn and its destination. */
3585 /* Since this is an arbitrary expression, it can look at anything.
3753 expression is always false, this is the last case, so break
3754 out and let this value be the `else' case. */
3766 /* If this is always false, skip it. */
3861 /* See what we have to do to output this value. */
4060 ordinal times this number plus one, plus the slot number as an index into
4338 /* Sequence number of this insn. */
4341 /* Whether a (define_bypass) construct names this insn in its