Re: [Boost-bugs] [Boost C++ Libraries] #12861: Segmentation fault when creating R-tree with packing algorithm with gcc4.8.2

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #12861: Segmentation fault when creating R-tree with packing algorithm with gcc4.8.2
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2017-02-24 09:10:54

#12861: Segmentation fault when creating R-tree with packing algorithm with
gcc4.8.2
---------------------------------+----------------------
  Reporter:  michael.moessner@…  |      Owner:  awulkiew
      Type:  Bugs                |     Status:  new
 Milestone:  To Be Determined    |  Component:  geometry
   Version:  Boost 1.63.0        |   Severity:  Problem
Resolution:                      |   Keywords:  rtree
---------------------------------+----------------------

Comment (by anonymous):

 I tried setting the stack size to unlimited but the behaviour stays the
 same. I guess this would also be compiler independent?

 It is not clear to me why there are <optimized out> variables since I
 compiled with -O0 and -ggdb. And I was not able to figure out yet where
 this comes from.

 I tried investigating the error further and was able to track it down to
 the code section
 {{{
   /// This is a helper function...
   template<typename _RandomAccessIterator, typename _Tp, typename
 _Compare>
     _RandomAccessIterator
     __unguarded_partition(_RandomAccessIterator __first,
                           _RandomAccessIterator __last,
                           const _Tp& __pivot, _Compare __comp)
     {
       while (true)
         {
           while (__comp(*__first, __pivot))
             ++__first;
           --__last;
           while (__comp(__pivot, *__last))
             --__last;
           if (!(__first < __last))
             return __first;
           std::iter_swap(__first, __last);
           ++__first;
         }
     }
 }}}
 in std_algo.h. The Loop
 {{{
 while (__comp(*__first, __pivot))
             ++__first;
 }}}
 goes on and on until {{{__first}}} becomes invalid. (It seems to go on for
 an actually large number over 6000 elements).

 If there are further investigations I can do, please let me know.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/12861#comment:5>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.