cgraph.c (cgraph_mark_needed_node, [...]): Use next_needed field instead of aux to...

	* cgraph.c (cgraph_mark_needed_node, cgraph_varpool_mark_needed_node,
	cgraph_varpool_finalize_decl, cgraph_varpool_assemble_pending_decls):
	Use next_needed field instead of aux to maintain the queue.
	* cgraph.h (cgraph_node): Add next_needed.
	(cgraph_varpool_node): Add next_needed; remove aux.
	* cgraphunit.c (cgraph_finalize_compilation_unit): Use next_needed.

From-SVN: r68807

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 716fb7a4dda6509db74486c796c7900e35ab6a06..dd61cda1260a42c6aeae68d0e5ed342a34aaf536 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,12 @@
+Wed Jul  2 02:16:48 CEST 2003  Jan Hubicka  <jh@suse.cz>
+
+       * cgraph.c (cgraph_mark_needed_node, cgraph_varpool_mark_needed_node,
+       cgraph_varpool_finalize_decl, cgraph_varpool_assemble_pending_decls):
+       Use next_needed field instead of aux to maintain the queue.
+       * cgraph.h (cgraph_node): Add next_needed.
+       (cgraph_varpool_node): Add next_needed; remove aux.
+       * cgraphunit.c (cgraph_finalize_compilation_unit): Use next_needed.
+
 Wed Jul  2 02:12:51 CEST 2003  Jan Hubicka  <jh@suse.cz>
 
        * cgraphunit.c (cgraph_finalize_function): Set finalized.

diff --git a/gcc/cgraph.c b/gcc/cgraph.c
index 0f10934a68171732ee1838d8d918404b9c49f6fc..36d9814e3653e85f75e7d33493fe34bf02f07014 100644 (file)
--- a/gcc/cgraph.c
+++ b/gcc/cgraph.c
@@ -235,7 +235,7 @@ cgraph_mark_needed_node (node, needed)
       node->reachable = 1;
       if (DECL_SAVED_TREE (node->decl))
        {
-         node->aux = cgraph_nodes_queue;
+         node->next_needed = cgraph_nodes_queue;
          cgraph_nodes_queue = node;
         }
     }
@@ -428,7 +428,7 @@ cgraph_varpool_mark_needed_node (struct cgraph_varpool_node *node)
 {
   if (!node->needed && node->finalized)
     {
-      node->aux = cgraph_varpool_nodes_queue;
+      node->next_needed = cgraph_varpool_nodes_queue;
       cgraph_varpool_nodes_queue = node;
     }
   node->needed = 1;
@@ -441,7 +441,7 @@ cgraph_varpool_finalize_decl (tree decl)
 
   if (node->needed && !node->finalized)
     {
-      node->aux = cgraph_varpool_nodes_queue;
+      node->next_needed = cgraph_varpool_nodes_queue;
       cgraph_varpool_nodes_queue = node;
     }
   node->finalized = true;
@@ -469,13 +469,13 @@ cgraph_varpool_assemble_pending_decls ()
       tree decl = cgraph_varpool_nodes_queue->decl;
       struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue;
 
-      cgraph_varpool_nodes_queue = cgraph_varpool_nodes_queue->aux;
+      cgraph_varpool_nodes_queue = cgraph_varpool_nodes_queue->next_needed;
       if (!TREE_ASM_WRITTEN (decl))
        {
          assemble_variable (decl, 0, 1, 0);
          changed = true;
        }
-      node->aux = NULL;
+      node->next_needed = NULL;
     }
   return changed;
 }

diff --git a/gcc/cgraph.h b/gcc/cgraph.h
index bbf1c2886182e2539c8303fadf4c086767721f83..dbd012fecce60d2db393c438d8a6216086750412 100644 (file)
--- a/gcc/cgraph.h
+++ b/gcc/cgraph.h
@@ -75,6 +75,8 @@ struct cgraph_node GTY(())
   struct cgraph_node *nested;
   /* Pointer to the next function with same origin, if any.  */
   struct cgraph_node *next_nested;
+  /* Pointer to the next function in cgraph_nodes_queue.  */
+  struct cgraph_node *next_needed;
   PTR GTY ((skip (""))) aux;
 
   /* Set when function must be output - it is externally visible
@@ -108,7 +110,8 @@ struct cgraph_edge GTY(())
 struct cgraph_varpool_node GTY(())
 {
   tree decl;
-  PTR GTY ((skip (""))) aux;
+  /* Pointer to the next function in cgraph_varpool_nodes_queue.  */
+  struct cgraph_varpool_node *next_needed;
 
   /* Set when function must be output - it is externally visible
      or it's address is taken.  */

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 75eae991d951f8717353703aea5a39021a3c0d3f..f9e2ff6c2f8268c7229fcf59bcf6303436143619 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -157,7 +157,7 @@ cgraph_finalize_compilation_unit ()
       tree decl = cgraph_nodes_queue->decl;
 
       node = cgraph_nodes_queue;
-      cgraph_nodes_queue = cgraph_nodes_queue->aux;
+      cgraph_nodes_queue = cgraph_nodes_queue->next_needed;
 
       if (node->lowered || !node->reachable || !DECL_SAVED_TREE (decl))
        abort ();