change vector to vec

1 files changed, 7 insertions, 7 deletions

diff --git a/gcc/ipa-field-reorder.c b/gcc/ipa-field-reorder.c
index 9b02639933a..ce767e232f0 100644
--- a/gcc/ipa-field-reorder.c
+++ b/gcc/ipa-field-reorder.c
@@ -237,7 +237,7 @@ TypeReconstructorFieldReordering::_walk_RECORD_TYPE_post (tree t)
   // So, now we want to do a couple of things.
   // First, collect all fields in a struct and make a copy of them
   bool is_modified = get_is_modified (t);
-  std::vector<tree> to_reorder;
+  vec<tree> to_reorder2;
   is_modified = true;
   for (field_tuple_list_t::iterator i = field_tuple_list.begin (),
 	e = field_tuple_list.end ();
@@ -255,7 +255,7 @@ TypeReconstructorFieldReordering::_walk_RECORD_TYPE_post (tree t)
       log ("we can reorder %s ? %s\n",
 	   type_stringifier::get_field_identifier (field_tuple.first).c_str (),
 	   !modified_field ? "true" : "false");
-      to_reorder.push_back (
+      to_reorder2.safe_push(
 	(tree) copy_node (tree_to_tree (field_tuple.first)));
     }
 
@@ -264,7 +264,7 @@ TypeReconstructorFieldReordering::_walk_RECORD_TYPE_post (tree t)
       tree prev_field = NULL;
       bool entered_loop = false;
       // Sort them
-      std::sort (to_reorder.begin (), to_reorder.end (),
+      std::sort (to_reorder2.begin (), to_reorder2.end (),
 		 compare_FIELD_DECLs_TYPE_SIZE);
       is_modified = false;
 
@@ -290,8 +290,8 @@ TypeReconstructorFieldReordering::_walk_RECORD_TYPE_post (tree t)
 
 	  gcc_assert (!modified_field && is_modified);
 	  // Create new TYPE_FIELDS with the order we want
-	  for (std::vector<tree>::iterator j = to_reorder.begin (),
-		f = to_reorder.end (); j != f; ++j)
+	  for (auto j = to_reorder2.begin (),
+		f = to_reorder2.end (); j != f; ++j)
 	    {
 	      entered_loop = true;
 	      tree current_field_inner = *j;
@@ -313,8 +313,8 @@ TypeReconstructorFieldReordering::_walk_RECORD_TYPE_post (tree t)
 	}
 
       // Modify _reorg_fields map
-      for (std::vector<tree>::iterator i = to_reorder.begin (),
-		e = to_reorder.end (); i != e; ++i)
+      for (auto i = to_reorder2.begin (),
+		e = to_reorder2.end (); i != e; ++i)
 	{
 	  tree to_find = *i;
 	  unsigned to_find_i = bitpos_of_field (tree_to_tree (to_find));