Re: [Boost-bugs] [Boost C++ Libraries] #9233: Suboptimal shift by multiples of 8 bits

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #9233: Suboptimal shift by multiples of 8 bits
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2016-02-26 11:40:10

#9233: Suboptimal shift by multiples of 8 bits
-------------------------------+----------------------------
  Reporter:  psiha             |      Owner:  johnmaddock
      Type:  Bugs              |     Status:  closed
 Milestone:  To Be Determined  |  Component:  multiprecision
   Version:  Boost 1.54.0      |   Severity:  Optimization
Resolution:  wontfix           |   Keywords:
-------------------------------+----------------------------

Comment (by anonymous):

 >if you order the limbs in 'machine endianess' (I'm guessing) the rest of
 the code can be endianness agnostic (and more readily assume correct byte
 ordering/use memcpy/move/set more easily)

 No I'd have to rewrite everything - multiplication, addition, subtraction,
 the works.  Two versions for each, one little endian, one big.  And I'd
 have no means of testing the big endian code either...

 Not going to happen, sorry!

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