Go patch committed: Use macro Unordered_map instead of std::unordered_map

[Ian Lance Taylor]

This patch by Cherry Zhang fixes a case in the Go frontend that was
using std::unodered_map where it should use the macro Unordered_map
for more portability.  Bootstrapped on x86_64-pc-linux-gnu.  Committed
to mainline.

Ian

Index: gcc/go/gofrontend/MERGE
===================================================================
--- gcc/go/gofrontend/MERGE     (revision 256366)
+++ gcc/go/gofrontend/MERGE     (working copy)
@@ -1,4 +1,4 @@
-dbc0c7e4329aada2ae3554c20cfb8cfa48041213
+0445dc01fd75325ff99f839cfaab29cb9f2a1f97
 
 The first line of this file holds the git revision number of the last
 merge done from the gofrontend repository.
Index: gcc/go/gofrontend/escape.cc
===================================================================
--- gcc/go/gofrontend/escape.cc (revision 256366)
+++ gcc/go/gofrontend/escape.cc (working copy)
@@ -858,7 +858,7 @@ Gogo::analyze_escape()
 
       // Propagate levels across each dst.  This is the flood phase.
       std::set<Node*> dsts = context->dsts();
-      std::unordered_map<Node*, int> escapes;
+      Unordered_map(Node*, int) escapes;
       for (std::set<Node*>::iterator n = dsts.begin();
            n != dsts.end();
            ++n)