procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

varpool.c (varpool_last_needed_node): Fix comment typo.

Browse source 
* 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
This commit is contained in:
Tom Tromey 2007-08-24 21:10:41 +00:00 • committed by Tom Tromey
parent 787b0d199b
commit f9837879d5
3 changed files with 11 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
gcc/ChangeLog
View file

@ -1,3 +1,9 @@
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>
* config/alpha/alpha.c (alpha_mangle_type, decl_has_samegp,

8
gcc/c-decl.c
View file

@ -1930,7 +1930,7 @@ duplicate_decls (tree newdecl, tree olddecl)
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;
return false;
}
@ -2028,11 +2028,7 @@ warn_if_shadowing (tree new_decl)
Obviously, we don't want to generate a duplicate ..._TYPE node if
the TYPE_DECL node that we are now processing really represents a
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. */
standard built-in type. */
static void
clone_underlying_type (tree x)

5
gcc/varpool.c
View file

@ -57,8 +57,9 @@ struct varpool_node *varpool_nodes;
The queue is maintained via mark_needed_node, linked via node->next_needed
pointer.
LAST_NNEDED_NODE points to the end of queue, so it can be maintained in forward
order. QTY is needed to make it friendly to PCH.
LAST_NEEDED_NODE points to the end of queue, so it can be
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
twice: first time it is during cgraph construction, second time it is at the