else
return cost->shift_var;
}
- return cost->shift_const;
}
/* Compute a (partial) cost for rtx X. Return true if the complete
else
/* Neither LHS nor RHS is a conjunction. */
return std::make_pair (0, false);
- gcc_unreachable ();
}
if (conjunction_p (lhs))
{
else
/* Neither LHS nor RHS is a conjunction. */
return std::make_pair (2, false);
- gcc_unreachable ();
}
if (conjunction_p (lhs))
{
val = iterative_hash_template_arg (TREE_OPERAND (arg, i), val);
return val;
}
-
- gcc_unreachable ();
- return 0;
}
/* Unregister the specialization SPEC as a specialization of TMPL.
*siz = 0;
return false;
}
- return true;
}
setter_argument, NULL);
return setter;
}
-
- /* Unreachable, but the compiler may not realize. */
- return error_mark_node;
}
/* This hook routine is called when a MODIFY_EXPR is being built. We
return (rtx_equal_p (x, in)
|| reg_overlap_mentioned_for_reload_p (x, XEXP (in, 0))
|| reg_overlap_mentioned_for_reload_p (x, XEXP (in, 1)));
- else return (reg_overlap_mentioned_for_reload_p (XEXP (x, 0), in)
- || reg_overlap_mentioned_for_reload_p (XEXP (x, 1), in));
+ else
+ return (reg_overlap_mentioned_for_reload_p (XEXP (x, 0), in)
+ || reg_overlap_mentioned_for_reload_p (XEXP (x, 1), in));
}
-
- gcc_unreachable ();
}
/* Return nonzero if anything in X contains a MEM. Look also for pseudo
default:
return bb->next_bb;
}
-
- gcc_unreachable ();
}
\f
default:
return false;
}
-
- return false;
}
/* Return true if CHREC is invariant in loop LOOPNUM, false otherwise. */
}
return false;
}
-
- return true;
}
/* Assumes that BB has more than 1 predecessors.
default:
return e;
}
- return e;
}
/* Translate the VUSE backwards through phi nodes in E->dest, so that
else
return -2;
}
-
- return 0;
}
/* Compare two values VAL1 and VAL2. Return
default:
return 0;
}
-
- gcc_unreachable ();
}
\f
/* Return the section into which constant EXP should be placed. */
case 'x':
return convert_hex (pfile, from, limit, tbuf, cvt,
char_range, loc_reader, ranges);
- break;
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':