http://gcc.gnu.org/bugzilla/show_bug.cgi?id=50394
Markus Trippelsdorf <markus at trippelsdorf dot de> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |markus at trippelsdorf dot
| |de
--- Comment #2 from Markus Trippelsdorf <markus at trippelsdorf dot de>
2011-09-14 16:03:07 UTC ---
Just successfully built libreoffice with todays gcc without LTO.
I ran into three issues:
1) I use the following patch to include <unistd.h> in gcc/gthr-posix.h.
This gets rid of many trivial errors.
diff --git a/gcc/gthr-posix.h b/gcc/gthr-posix.h
index b1d499d..3c155d0 100644
--- a/gcc/gthr-posix.h
+++ b/gcc/gthr-posix.h
@@ -39,6 +39,7 @@ see the files COPYING3 and COPYING.RUNTIME respectively. If
not, see
#endif
#include <pthread.h>
+#include <unistd.h>
#if ((defined(_LIBOBJC) || defined(_LIBOBJC_WEAK)) \
|| !defined(_GTHREAD_USE_MUTEX_TIMEDLOCK))
Revision 176335 deleted this include and the authors insist that this is the
right thing to do...
2) There is an error in ./oox/inc/oox/helper/refmap.hxx:
../../inc/oox/helper/refmap.hxx:182:86: error: no matching function for call to
'find(oox::RefMap<std::pair<short int, rtl::OUString>,
oox::xls::DefinedName>::key_type&)'
Fixed by following the note given in the warning that proceeds the error:
../../inc/oox/helper/refmap.hxx:182:86: warning: 'find' was not declared in
this scope, and no declarations were found by argument-dependent lookup at the
point of instantiation [-fpermissive]
../../inc/oox/helper/refmap.hxx:182:86: note: declarations in dependent base
'std::map<int, boost::shared_ptr<oox::xls::Connection>, std::less<int>,
std::allocator<std::pair<const int, boost::shared_ptr<oox::xls::Connection> > >
>' are not found by unqualified lookup
../../inc/oox/helper/refmap.hxx:182:86: note: use 'this->find' instead
3) There were three identical errors in /sc/source/ui/view/dbfunc.cxx
(complaining that GetViewData() cannot be called without an object).
Fixed by putting a "this->" before GetViewData() in lines 434, 463 and 473.
