Update mclinker for LLVM rebase to r222494.

This corresponds to the following upstream mclinker change:

commit b2f1691276052c4215abf36715d43248d6337cf8
Author: Diana Chen <mysekki@gmail.com>
Date:   Tue Nov 25 14:03:29 2014 +0800

    option: Allow `-hash-style' can be specified zero or more times

Change-Id: I332546680bb45cf9692adfa2c2d3dcdc84361afc

1 files changed, 34 insertions, 51 deletions

diff --git a/unittests/GraphTest.cpp b/unittests/GraphTest.cpp
index 0c97567..bd25707 100644
--- a/unittests/GraphTest.cpp
+++ b/unittests/GraphTest.cpp
@@ -7,38 +7,33 @@
 //
 //===----------------------------------------------------------------------===//
 #include "GraphTest.h"
-#include <mcld/ADT/GraphLite/Digraph.h>
-#include <mcld/ADT/GraphLite/ListDigraph.h>
+#include "mcld/ADT/GraphLite/Digraph.h"
+#include "mcld/ADT/GraphLite/ListDigraph.h"
 
 using namespace mcld;
 using namespace mcld::test;
 using namespace mcld::graph;
 
 // Constructor can do set-up work for all test here.
-GraphTest::GraphTest()
-{
+GraphTest::GraphTest() {
 }
 
 // Destructor can do clean-up work that doesn't throw exceptions here.
-GraphTest::~GraphTest()
-{
+GraphTest::~GraphTest() {
 }
 
 // SetUp() will be called immediately before each test.
-void GraphTest::SetUp()
-{
+void GraphTest::SetUp() {
 }
 
 // TearDown() will be called immediately after each test.
-void GraphTest::TearDown()
-{
+void GraphTest::TearDown() {
 }
 
 //===----------------------------------------------------------------------===//
 // Testcases
 //===----------------------------------------------------------------------===//
-TEST_F(GraphTest, list_digraph_add_n_erase_nodes_1)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_nodes_1) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -47,17 +42,17 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_1)
 
   ASSERT_TRUE(NULL == u1->first_in);
   ASSERT_TRUE(NULL == u1->first_out);
-  ASSERT_TRUE(u2   == u1->prev);
+  ASSERT_TRUE(u2 == u1->prev);
   ASSERT_TRUE(NULL == u1->next);
 
   ASSERT_TRUE(NULL == u2->first_in);
   ASSERT_TRUE(NULL == u2->first_out);
-  ASSERT_TRUE(u3   == u2->prev);
-  ASSERT_TRUE(u1   == u2->next);
+  ASSERT_TRUE(u3 == u2->prev);
+  ASSERT_TRUE(u1 == u2->next);
 
   ASSERT_TRUE(NULL == u3->first_in);
   ASSERT_TRUE(NULL == u3->first_out);
-  ASSERT_TRUE(u2   == u3->next);
+  ASSERT_TRUE(u2 == u3->next);
   ASSERT_TRUE(NULL == u3->prev);
 
   ListDigraph::Node* head = NULL;
@@ -68,12 +63,12 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_1)
 
   ASSERT_TRUE(NULL == u1->first_in);
   ASSERT_TRUE(NULL == u1->first_out);
-  ASSERT_TRUE(u3   == u1->prev);
+  ASSERT_TRUE(u3 == u1->prev);
   ASSERT_TRUE(NULL == u1->next);
 
   ASSERT_TRUE(NULL == u3->first_in);
   ASSERT_TRUE(NULL == u3->first_out);
-  ASSERT_TRUE(u1   == u3->next);
+  ASSERT_TRUE(u1 == u3->next);
   ASSERT_TRUE(NULL == u3->prev);
 
   ASSERT_TRUE(NULL == u2->first_in);
@@ -85,8 +80,7 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_1)
   ASSERT_TRUE(head == u3);
 }
 
-TEST_F(GraphTest, list_digraph_add_n_erase_nodes_2)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_nodes_2) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -95,17 +89,17 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_2)
 
   ASSERT_TRUE(NULL == u1->first_in);
   ASSERT_TRUE(NULL == u1->first_out);
-  ASSERT_TRUE(u2   == u1->prev);
+  ASSERT_TRUE(u2 == u1->prev);
   ASSERT_TRUE(NULL == u1->next);
 
   ASSERT_TRUE(NULL == u2->first_in);
   ASSERT_TRUE(NULL == u2->first_out);
-  ASSERT_TRUE(u3   == u2->prev);
-  ASSERT_TRUE(u1   == u2->next);
+  ASSERT_TRUE(u3 == u2->prev);
+  ASSERT_TRUE(u1 == u2->next);
 
   ASSERT_TRUE(NULL == u3->first_in);
   ASSERT_TRUE(NULL == u3->first_out);
-  ASSERT_TRUE(u2   == u3->next);
+  ASSERT_TRUE(u2 == u3->next);
   ASSERT_TRUE(NULL == u3->prev);
 
   ListDigraph::Node* head = NULL;
@@ -121,20 +115,19 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_2)
 
   ASSERT_TRUE(NULL == u2->first_in);
   ASSERT_TRUE(NULL == u2->first_out);
-  ASSERT_TRUE(u3   == u2->prev);
+  ASSERT_TRUE(u3 == u2->prev);
   ASSERT_TRUE(NULL == u2->next);
 
   ASSERT_TRUE(NULL == u3->first_in);
   ASSERT_TRUE(NULL == u3->first_out);
-  ASSERT_TRUE(u2   == u3->next);
+  ASSERT_TRUE(u2 == u3->next);
   ASSERT_TRUE(NULL == u3->prev);
 
   graph.getHead(head);
   ASSERT_TRUE(head == u3);
 }
 
-TEST_F(GraphTest, list_digraph_add_n_erase_nodes_3)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_nodes_3) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -143,17 +136,17 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_3)
 
   ASSERT_TRUE(NULL == u1->first_in);
   ASSERT_TRUE(NULL == u1->first_out);
-  ASSERT_TRUE(u2   == u1->prev);
+  ASSERT_TRUE(u2 == u1->prev);
   ASSERT_TRUE(NULL == u1->next);
 
   ASSERT_TRUE(NULL == u2->first_in);
   ASSERT_TRUE(NULL == u2->first_out);
-  ASSERT_TRUE(u3   == u2->prev);
-  ASSERT_TRUE(u1   == u2->next);
+  ASSERT_TRUE(u3 == u2->prev);
+  ASSERT_TRUE(u1 == u2->next);
 
   ASSERT_TRUE(NULL == u3->first_in);
   ASSERT_TRUE(NULL == u3->first_out);
-  ASSERT_TRUE(u2   == u3->next);
+  ASSERT_TRUE(u2 == u3->next);
   ASSERT_TRUE(NULL == u3->prev);
 
   ListDigraph::Node* head = NULL;
@@ -169,21 +162,19 @@ TEST_F(GraphTest, list_digraph_add_n_erase_nodes_3)
 
   ASSERT_TRUE(NULL == u1->first_in);
   ASSERT_TRUE(NULL == u1->first_out);
-  ASSERT_TRUE(u2   == u1->prev);
+  ASSERT_TRUE(u2 == u1->prev);
   ASSERT_TRUE(NULL == u1->next);
 
   ASSERT_TRUE(NULL == u2->first_in);
   ASSERT_TRUE(NULL == u2->first_out);
-  ASSERT_TRUE(u1   == u2->next);
+  ASSERT_TRUE(u1 == u2->next);
   ASSERT_TRUE(NULL == u2->prev);
 
   graph.getHead(head);
   ASSERT_TRUE(head == u2);
-
 }
 
-TEST_F(GraphTest, list_digraph_add_arcs_1)
-{
+TEST_F(GraphTest, list_digraph_add_arcs_1) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -203,8 +194,7 @@ TEST_F(GraphTest, list_digraph_add_arcs_1)
   ASSERT_TRUE(u3->first_in == a2 && u3->first_out == a3);
 }
 
-TEST_F(GraphTest, list_digraph_add_arcs_2)
-{
+TEST_F(GraphTest, list_digraph_add_arcs_2) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -224,8 +214,7 @@ TEST_F(GraphTest, list_digraph_add_arcs_2)
   ASSERT_TRUE(u3->first_in == a3 && u3->first_out == NULL);
 }
 
-TEST_F(GraphTest, list_digraph_add_n_erase_arcs_1)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_arcs_1) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -251,9 +240,7 @@ TEST_F(GraphTest, list_digraph_add_n_erase_arcs_1)
   ASSERT_TRUE(NULL == a2->next_in);
 }
 
-
-TEST_F(GraphTest, list_digraph_add_n_erase_arcs_2)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_arcs_2) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -279,8 +266,7 @@ TEST_F(GraphTest, list_digraph_add_n_erase_arcs_2)
   ASSERT_TRUE(NULL == a1->next_in);
 }
 
-TEST_F(GraphTest, list_digraph_add_n_erase_arcs_3)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_arcs_3) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -306,8 +292,7 @@ TEST_F(GraphTest, list_digraph_add_n_erase_arcs_3)
   ASSERT_TRUE(NULL == a3->next_in);
 }
 
-TEST_F(GraphTest, list_digraph_add_n_erase_arcs_4)
-{
+TEST_F(GraphTest, list_digraph_add_n_erase_arcs_4) {
   ListDigraph graph;
 
   ListDigraph::Node* u1 = graph.addNode();
@@ -323,11 +308,9 @@ TEST_F(GraphTest, list_digraph_add_n_erase_arcs_4)
   ASSERT_TRUE(u2->first_in == NULL);
   ASSERT_TRUE(u3->first_in == NULL);
   ASSERT_TRUE(a1->next_in == NULL);
-
 }
 
-TEST_F(GraphTest, api_test)
-{
+TEST_F(GraphTest, api_test) {
   Digraph graph;
 
   Digraph::Node node = graph.addNode();