Wed Apr 1 22:26:22 1998 Jeffrey A Law (law@cygnus.com)
+ * fold-const.c optimze_bit_field_compare): Initialize rnbitpos,
+ rnbitsize, rnmode and rinner.
+ (make_range): Initialize type.
+ (fold): Initialize arg0, arg1 and varop.
+
+ * function.c (instantiate_virtual_regs_1): Initialize offset, regnoi
+ and regnor.
+ (expand_function_start): Initialize last_ptr.
+
+ * stor-layout.c (layout_record): Initialize desired_align.
+ (get_best_mode): Initialize unit.
+
+ * tree.c (copy_node): Initialize length.
+
* c-lex.c (yylex): Initialize traditional_type, ansi_type and type.
* caller-save.c (insert_save_restore): Initialize pat, code and
tree lhs, rhs;
{
int lbitpos, lbitsize, rbitpos, rbitsize;
- int lnbitpos, lnbitsize, rnbitpos, rnbitsize;
+ int lnbitpos, lnbitsize, rnbitpos = 0, rnbitsize = 0;
tree type = TREE_TYPE (lhs);
tree signed_type, unsigned_type;
int const_p = TREE_CODE (rhs) == INTEGER_CST;
- enum machine_mode lmode, rmode, lnmode, rnmode;
+ enum machine_mode lmode, rmode, lnmode, rnmode = VOIDmode;
int lunsignedp, runsignedp;
int lvolatilep = 0, rvolatilep = 0;
int alignment;
- tree linner, rinner;
+ tree linner, rinner = NULL_TREE;
tree mask;
tree offset;
tree *plow, *phigh;
{
enum tree_code code;
- tree arg0, arg1, type;
+ tree arg0, arg1, type = NULL_TREE;
int in_p, n_in_p;
tree low, high, n_low, n_high;
tree t1 = NULL_TREE;
tree tem;
tree type = TREE_TYPE (expr);
- register tree arg0, arg1;
+ register tree arg0 = NULL_TREE, arg1 = NULL_TREE;
register enum tree_code code = TREE_CODE (t);
register int kind;
int invert;
First, see if one arg is constant; find the constant arg
and the other one. */
{
- tree constop = 0, varop;
+ tree constop = 0, varop = NULL_TREE;
int constopnum = -1;
if (TREE_CONSTANT (arg1))
rtx x;
RTX_CODE code;
rtx new = 0;
- int offset;
+ int offset = 0;
rtx temp;
rtx seq;
int i, j;
may need to do it in a wider mode. */
register rtx parmreg;
- int regno, regnoi, regnor;
+ int regno, regnoi = 0, regnor = 0;
unsignedp = TREE_UNSIGNED (TREE_TYPE (parm));
{
register int i;
tree tem;
- rtx last_ptr;
+ rtx last_ptr = NULL_RTX;
/* Make sure volatile mem refs aren't considered
valid operands of arithmetic insns. */
for (field = TYPE_FIELDS (rec); field; field = TREE_CHAIN (field))
{
register int known_align = var_size ? var_align : const_size;
- register int desired_align;
+ register int desired_align = 0;
/* If FIELD is static, then treat it like a separate variable,
not really like a structure field.
int volatilep;
{
enum machine_mode mode;
- int unit;
+ int unit = 0;
/* Find the narrowest integer mode that contains the bit field. */
for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
{
register tree t;
register enum tree_code code = TREE_CODE (node);
- register int length;
+ register int length = 0;
register int i;
switch (TREE_CODE_CLASS (code))