+2005-07-22 Manfred Hollstein <mh@suse.com>
+
+ * tree-ssa-structalias.c (merge_graph_nodes): Fix uninitialised
+ warnings.
+ (int_add_graph_edge): Likewise.
+ (collapse_nodes): Likewise.
+ (process_unification_queue): Likewise.
+
2005-07-22 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
Laurent GUERBY <laurent@guerby.net>
+2005-07-22 Manfred Hollstein <mh@suse.com>
+
+ * parser.c (cp_parser_declaration): Fix unitialised warnings.
+
2005-07-21 Andrew Pinski <pinskia@physics.uc.edu>
* class.c (build_base_path): Fix typo.
if (token1.type != CPP_EOF)
token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
+ else
+ token2.type = token2.keyword = RID_MAX;
/* Get the high-water mark for the DECLARATOR_OBSTACK. */
p = obstack_alloc (&declarator_obstack, 0);
+2005-07-22 Manfred Hollstein <mh@suse.com>
+
+ * match.c (gfc_match_symbol): Fix uninitialised warnings.
+ * matchexp.c (gfc_match_expr): Likewise.
+
2005-07-20 Giovanni Bajo <giovannibajo@libero.it>
Make CONSTRUCTOR use VEC to store initializers.
else
*matched_symbol = NULL;
}
+ else
+ *matched_symbol = NULL;
return m;
}
for (;;)
{
+ uop = NULL;
m = match_defined_operator (&uop);
if (m == MATCH_NO)
break;
+2005-07-22 Manfred Hollstein <mh@suse.com>
+
+ * verify-impl.c (check_class_constant): Fix uninitialised warnings.
+ (check_constant): Likewise.
+ (check_wide_constant): Likewise.
+
2005-07-20 Giovanni Bajo <giovannibajo@libero.it>
Make CONSTRUCTOR use VEC to store initializers.
static type
check_class_constant (int index)
{
- type t;
+ type t = { 0, 0, 0 };
vfy_constants *pool;
check_pool_index (index);
static type
check_constant (int index)
{
- type t;
+ type t = { 0, 0, 0 };
vfy_constants *pool;
check_pool_index (index);
static type
check_wide_constant (int index)
{
- type t;
+ type t = { 0, 0, 0 };
vfy_constants *pool;
check_pool_index (index);
add_graph_edge (graph, newe);
olde.src = from;
olde.dest = c->dest;
+ olde.weights = NULL;
temp = get_graph_weights (graph, olde);
weights = get_graph_weights (graph, newe);
bitmap_ior_into (weights, temp);
add_graph_edge (graph, newe);
olde.src = c->dest;
olde.dest = from;
+ olde.weights = NULL;
temp = get_graph_weights (graph, olde);
weights = get_graph_weights (graph, newe);
bitmap_ior_into (weights, temp);
struct constraint_edge edge;
edge.src = to;
edge.dest = from;
+ edge.weights = NULL;
r = add_graph_edge (graph, edge);
r |= !bitmap_bit_p (get_graph_weights (graph, edge), weight);
bitmap_set_bit (get_graph_weights (graph, edge), weight);
merge_graph_nodes (graph, to, from);
edge.src = to;
edge.dest = to;
+ edge.weights = NULL;
if (valid_graph_edge (graph, edge))
{
bitmap weights = get_graph_weights (graph, edge);
bitmap_clear (tmp);
edge.src = n;
edge.dest = n;
+ edge.weights = NULL;
if (valid_graph_edge (graph, edge))
{
bitmap weights = get_graph_weights (graph, edge);