mirror of
https://github.com/urbit/shrub.git
synced 2024-12-19 16:51:42 +03:00
98 lines
4.0 KiB
C
98 lines
4.0 KiB
C
|
|
||
|
|
/*============================================================================
|
||
|
|
|
||
|
|
This C source file is part of the SoftFloat IEEE Floating-Point Arithmetic
|
||
|
|
Package, Release 3, by John R. Hauser.
|
||
|
|
|
||
|
|
Copyright 2011, 2012, 2013, 2014, 2015 The Regents of the University of
|
||
|
|
California (Regents). All Rights Reserved. Redistribution and use in source
|
||
|
|
and binary forms, with or without modification, are permitted provided that
|
||
|
|
the following conditions are met:
|
||
|
|
|
||
|
|
Redistributions of source code must retain the above copyright notice,
|
||
|
|
this list of conditions, and the following two paragraphs of disclaimer.
|
||
|
|
Redistributions in binary form must reproduce the above copyright notice,
|
||
|
|
this list of conditions, and the following two paragraphs of disclaimer in the
|
||
|
|
documentation and/or other materials provided with the distribution. Neither
|
||
|
|
the name of the Regents nor the names of its contributors may be used to
|
||
|
|
endorse or promote products derived from this software without specific prior
|
||
|
|
written permission.
|
||
|
|
|
||
|
|
IN NO EVENT SHALL REGENTS BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT,
|
||
|
|
SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING
|
||
|
|
OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF REGENTS HAS
|
||
|
|
BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
|
||
|
|
REGENTS SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED
|
||
|
|
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||
|
|
PURPOSE. THE SOFTWARE AND ACCOMPANYING DOCUMENTATION, IF ANY, PROVIDED
|
||
|
|
HEREUNDER IS PROVIDED "AS IS". REGENTS HAS NO OBLIGATION TO PROVIDE
|
||
|
|
MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
||
|
|
|
||
|
|
=============================================================================*/
|
||
|
|
|
||
|
|
#include <stdint.h>
|
||
|
|
#include "platform.h"
|
||
|
|
#include "primitiveTypes.h"
|
||
|
|
|
||
|
|
#ifndef softfloat_mul128MTo256M
|
||
|
|
|
||
|
|
void
|
||
|
|
softfloat_mul128MTo256M(
|
||
|
|
const uint32_t *aPtr, const uint32_t *bPtr, uint32_t *zPtr )
|
||
|
|
{
|
||
|
|
uint32_t *lastZPtr, wordB;
|
||
|
|
uint64_t dwordProd;
|
||
|
|
uint32_t wordZ;
|
||
|
|
uint_fast8_t carry;
|
||
|
|
|
||
|
|
bPtr += indexWordLo( 4 );
|
||
|
|
lastZPtr = zPtr + indexMultiwordHi( 8, 5 );
|
||
|
|
zPtr += indexMultiwordLo( 8, 5 );
|
||
|
|
wordB = *bPtr;
|
||
|
|
dwordProd = (uint64_t) aPtr[indexWord( 4, 0 )] * wordB;
|
||
|
|
zPtr[indexWord( 5, 0 )] = dwordProd;
|
||
|
|
dwordProd = (uint64_t) aPtr[indexWord( 4, 1 )] * wordB + (dwordProd>>32);
|
||
|
|
zPtr[indexWord( 5, 1 )] = dwordProd;
|
||
|
|
dwordProd = (uint64_t) aPtr[indexWord( 4, 2 )] * wordB + (dwordProd>>32);
|
||
|
|
zPtr[indexWord( 5, 2 )] = dwordProd;
|
||
|
|
dwordProd = (uint64_t) aPtr[indexWord( 4, 3 )] * wordB + (dwordProd>>32);
|
||
|
|
zPtr[indexWord( 5, 3 )] = dwordProd;
|
||
|
|
zPtr[indexWord( 5, 4 )] = dwordProd>>32;
|
||
|
|
do {
|
||
|
|
bPtr += wordIncr;
|
||
|
|
zPtr += wordIncr;
|
||
|
|
wordB = *bPtr;
|
||
|
|
dwordProd = (uint64_t) aPtr[indexWord( 4, 0 )] * wordB;
|
||
|
|
wordZ = zPtr[indexWord( 5, 0 )] + (uint32_t) dwordProd;
|
||
|
|
zPtr[indexWord( 5, 0 )] = wordZ;
|
||
|
|
carry = (wordZ < (uint32_t) dwordProd);
|
||
|
|
dwordProd =
|
||
|
|
(uint64_t) aPtr[indexWord( 4, 1 )] * wordB + (dwordProd>>32);
|
||
|
|
wordZ = zPtr[indexWord( 5, 1 )] + (uint32_t) dwordProd + carry;
|
||
|
|
zPtr[indexWord( 5, 1 )] = wordZ;
|
||
|
|
carry =
|
||
|
|
carry ? (wordZ <= (uint32_t) dwordProd)
|
||
|
|
: (wordZ < (uint32_t) dwordProd);
|
||
|
|
dwordProd =
|
||
|
|
(uint64_t) aPtr[indexWord( 4, 2 )] * wordB + (dwordProd>>32);
|
||
|
|
wordZ = zPtr[indexWord( 5, 2 )] + (uint32_t) dwordProd + carry;
|
||
|
|
zPtr[indexWord( 5, 2 )] = wordZ;
|
||
|
|
carry =
|
||
|
|
carry ? (wordZ <= (uint32_t) dwordProd)
|
||
|
|
: (wordZ < (uint32_t) dwordProd);
|
||
|
|
dwordProd =
|
||
|
|
(uint64_t) aPtr[indexWord( 4, 3 )] * wordB + (dwordProd>>32);
|
||
|
|
wordZ = zPtr[indexWord( 5, 3 )] + (uint32_t) dwordProd + carry;
|
||
|
|
zPtr[indexWord( 5, 3 )] = wordZ;
|
||
|
|
carry =
|
||
|
|
carry ? (wordZ <= (uint32_t) dwordProd)
|
||
|
|
: (wordZ < (uint32_t) dwordProd);
|
||
|
|
zPtr[indexWord( 5, 4 )] = (dwordProd>>32) + carry;
|
||
|
|
} while ( zPtr != lastZPtr );
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|