std::queue<cgraph_node*> -> vec<cgraph_node*>

1 files changed, 7 insertions, 7 deletions

diff --git a/gcc/ipa-type-escape-analysis.c b/gcc/ipa-type-escape-analysis.c
index 847f657a19c..6735b9e5b70 100644
--- a/gcc/ipa-type-escape-analysis.c
+++ b/gcc/ipa-type-escape-analysis.c
@@ -289,26 +289,26 @@ get_whitelisted_nodes2 ()
     leaf_nodes_decl.add (node->decl);
   }
 
-  std::queue<cgraph_node *> worklist;
+  vec<cgraph_node *> worklist = vNULL;
   for (hash_set<cgraph_node*>::iterator i = leaf_nodes.begin(), e = leaf_nodes.end (); i != e; ++i)
   {
     if (dump_file) fprintf (dump_file, "is a leaf node %s\n", (*i)->name ());
-    worklist.push (*i);
+    worklist.safe_push (*i);
   }
 
   for (hash_set<cgraph_node*>::iterator i = nodes.begin (),
     e = nodes.end (); i != e; ++i)
   {
-    worklist.push (*i);
+    worklist.safe_push (*i);
   }
 
   hash_map<tree, bool> *map = new hash_map<tree, bool>;
-  while (!worklist.empty ())
+  while (!worklist.is_empty ())
   {
 
     if (detected_incompatible_syntax) return map;
-    cgraph_node *i = worklist.front ();
-    worklist.pop ();
+    cgraph_node *i = worklist[0];
+    worklist.ordered_remove (0);
     if (dump_file) fprintf (dump_file, "analyzing %s %p\n", i->name (), (void*)i);
     tpartitions2_t temp;
     gimple_white_lister whitelister(temp);
@@ -331,7 +331,7 @@ get_whitelisted_nodes2 ()
     for (cgraph_edge *e = i->callers; place_callers_in_worklist && e;
       e = e->next_caller)
     {
-      worklist.push (e->caller);
+      worklist.safe_push (e->caller);
     }
   }