Commit f9837879 by Tom Tromey Committed by Tom Tromey

varpool.c (varpool_last_needed_node): Fix comment typo.

	* varpool.c (varpool_last_needed_node): Fix comment typo.
	* c-decl.c (duplicate_decls): Fix comment typo.
	(clone_underlying_type): Update comment.

From-SVN: r127788
parent 787b0d19
2007-08-24 Tom Tromey <tromey@redhat.com>
* varpool.c (varpool_last_needed_node): Fix comment typo.
* c-decl.c (duplicate_decls): Fix comment typo.
(clone_underlying_type): Update comment.
2007-08-24 Kaveh R. Ghazi <ghazi@caip.rutgers.edu> 2007-08-24 Kaveh R. Ghazi <ghazi@caip.rutgers.edu>
* config/alpha/alpha.c (alpha_mangle_type, decl_has_samegp, * config/alpha/alpha.c (alpha_mangle_type, decl_has_samegp,
......
...@@ -1930,7 +1930,7 @@ duplicate_decls (tree newdecl, tree olddecl) ...@@ -1930,7 +1930,7 @@ duplicate_decls (tree newdecl, tree olddecl)
if (!diagnose_mismatched_decls (newdecl, olddecl, &newtype, &oldtype)) if (!diagnose_mismatched_decls (newdecl, olddecl, &newtype, &oldtype))
{ {
/* Avoid `unused variable' and other warnings warnings for OLDDECL. */ /* Avoid `unused variable' and other warnings for OLDDECL. */
TREE_NO_WARNING (olddecl) = 1; TREE_NO_WARNING (olddecl) = 1;
return false; return false;
} }
...@@ -2028,11 +2028,7 @@ warn_if_shadowing (tree new_decl) ...@@ -2028,11 +2028,7 @@ warn_if_shadowing (tree new_decl)
Obviously, we don't want to generate a duplicate ..._TYPE node if Obviously, we don't want to generate a duplicate ..._TYPE node if
the TYPE_DECL node that we are now processing really represents a the TYPE_DECL node that we are now processing really represents a
standard built-in type. standard built-in type. */
Since all standard types are effectively declared at line zero
in the source file, we can easily check to see if we are working
on a standard type by checking the current value of lineno. */
static void static void
clone_underlying_type (tree x) clone_underlying_type (tree x)
......
...@@ -57,8 +57,9 @@ struct varpool_node *varpool_nodes; ...@@ -57,8 +57,9 @@ struct varpool_node *varpool_nodes;
The queue is maintained via mark_needed_node, linked via node->next_needed The queue is maintained via mark_needed_node, linked via node->next_needed
pointer. pointer.
LAST_NNEDED_NODE points to the end of queue, so it can be maintained in forward LAST_NEEDED_NODE points to the end of queue, so it can be
order. QTY is needed to make it friendly to PCH. maintained in forward order. QTY is needed to make it friendly to
PCH.
During unit-at-a-time compilation we construct the queue of needed variables During unit-at-a-time compilation we construct the queue of needed variables
twice: first time it is during cgraph construction, second time it is at the twice: first time it is during cgraph construction, second time it is at the
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment