/* Implement rule 4 for the OR predicate PREDS:
2) ((x AND y) != 0) OR (x != 0 AND y != 0) is equivalent to
- (x != 0 ANd y != 0). */
+ (x != 0 AND y != 0). */
bool
predicate::simplify_4 ()
/* Structure holding data required to describe a constant jump function. */
struct GTY(()) ipa_constant_data
{
- /* THe value of the constant. */
+ /* The value of the constant. */
tree value;
/* Pointer to the structure that describes the reference. */
struct ipa_cst_ref_desc GTY((skip)) *rdesc;
n = id->decl_map->get (name);
if (n)
{
- /* WHen we perform edge redirection as part of CFG copy, IPA-SRA can
+ /* When we perform edge redirection as part of CFG copy, IPA-SRA can
remove an unused LHS from a call statement. Such LHS can however
still appear in debug statements, but their value is lost in this
function and we do not want to map them. */
// Otherwise, check if this's pair occurs before R's.
if (wi::lt_p (wi::to_wide (u), wi::to_wide (rl), sign))
{
- // THere's still at leats one pair of R left.
+ // There's still at leats one pair of R left.
if (++i >= num_pairs ())
return false;
l = m_base[i * 2];
ptr->dump (dump_file);
}
// Check into whether we can simply replace the relation rather than
- // intersecting it. THis may help with some optimistic iterative
+ // intersecting it. This may help with some optimistic iterative
// updating algorithms.
bool new_rel = ptr->intersect (vr);
if (dump_file && (dump_flags & TDF_DETAILS))