* fibonacci_heap.h (min): Return m_data instead of non-existing data.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@218797 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index da10096480462a38dcf97853a9d1a02eea3a21ee..54e7aa90a925a156cd18ac8673f60e484a7d9fbb 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,7 @@
+2014-12-16  Jan Hubicka  <hubicka@ucw.cz>
+
+       * fibonacci_heap.h (min): Return m_data instead of non-existing data.
+
 2014-12-16  Jan Hubicka  <hubicka@ucw.cz>
 
        * ipa-inline-analysis.c (will_be_nonconstant_predicate): Consider

diff --git a/gcc/fibonacci_heap.h b/gcc/fibonacci_heap.h
index 3fce3701737c552cc6b96fc3bf777c9ddc5a9d1a..5bbde26aef0447aa7bc7e3f58b10658406ec5a8b 100644 (file)
--- a/gcc/fibonacci_heap.h
+++ b/gcc/fibonacci_heap.h
@@ -211,7 +211,7 @@ public:
     if (m_min == NULL)
       return NULL;
 
-    return m_min->data;
+    return m_min->m_data;
   }
 
   /* Replace data associated with NODE and replace it with DATA.  */