contrib/gcc/tree-vrp.c

53    SSA name may have more than one assertion associated with it, these
58   /* Basic block where the assertion would be inserted.  */
65   /* Pointer to the statement that generated this assertion.  */
1078      other kind of assertion, we cannot derive a range from LIMIT's
1112 	 this assertion is an inequality (NE_EXPR), then we cannot
1114 	 LIMIT's range was ~[0, 0], the assertion 'VAR != LIMIT' does
3054    create a new SSA name N and return the assertion assignment
3060   tree n, assertion;
3068       assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, a);
3075       assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, boolean_false_node);
3081       assertion = build2 (MODIFY_EXPR, TREE_TYPE (v), n, boolean_true_node);
3086   SSA_NAME_DEF_STMT (n) = assertion;
3094   return assertion;
3133      for the assertion, anyway.  */
3261   /* The new assertion A will be inserted at BB or E.  We need to
3274      the new location to move another assertion previously registered
3280      one.  Similarly, if the same assertion already exists at a block
3282      edge, then update the existing location for the assertion (i.e.,
3283      move the assertion up in the dominance tree).
3298 	  /* If the assertion NAME COMP_CODE VAL has already been
3300 	     we don't need to insert the same assertion again.  Note
3302 	     replicating the same assertion inside the same basic
3307 	     new assertion is to be inserted on edge E, then it will
3316 	     dominates the existing location for the assertion, move
3317 	     the assertion up in the dominance tree by updating its
3334   /* If we didn't find an assertion already registered for
3354 /* Try to register an edge assertion for SSA name NAME on edge E for
3355    the conditional jump pointed to by SI.  Return true if an assertion
3377      Register an assertion for NAME according to the value that NAME
3416 	  /* If we are inserting the assertion on the ELSE edge, we
3531    If a statement produces a useful assertion A for name N_i, then the
3535    If N_i already had the assertion A at a location dominating the
3572       In this case, an assertion on the THEN clause is useful to
3573       determine that 'a' is always 9 on that edge.  However, an assertion
3636       /* See if we can derive an assertion for any of STMT's operands.  */
3650 	     range for it, and we don't find a previous assertion for
3651 	     it, create a new assertion location node for OP.  */
3735       /* We have been asked to insert the assertion on an edge.  This
3883 /* Convert range assertion expressions into the implied copies and
3890    instance, if we had the assertion N_i = ASSERT_EXPR <N_j, N_j > 3>,
3893    However, by converting the assertion into the implied copy
5454    copy operations.  Since p_5 is an assertion on p_4, and p_4 was the
5455    result of another assertion, then we can use the fact that p_5 and
5465    in contexts where that assertion does not hold (e.g., in line 6).