Intravision/reactos
1
0
Fork 0
mirror of https://github.com/reactos/reactos.git synced 2025-08-03 13:35:47 +00:00
Code Issues Projects Releases Packages Wiki Activity

[CRT]

Browse source 
- Make all x86assembly ML compatible
- Remove memcpy, it was duplicated from memmove, copy the label instead
- Guard some code against compilation on msvc, as these functions are intrinsics on MSVC and cannot be implemented
- Fix some x64 assembly (don't modify stack below rsp)

svn path=/branches/cmake-bringup/; revision=49421
This commit is contained in:
Timo Kreuzer 2010-11-02 00:06:33 +00:00
parent 0d7a1c46a0
commit a3623f23de
49 changed files with 912 additions and 918 deletions
Download patch file Download diff file Expand all files Collapse all files

18
lib/sdk/crt/math/i386/alldiv_asm.s
View file

@ -33,18 +33,22 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __alldiv
.globl __fltused
#include <reactos/asm.h>
PUBLIC __alldiv
PUBLIC __fltused
/* DATA ********************************************************************/
.data
ASSUME CS:NOTHING, DS:NOTHING, ES:NOTHING, FS:NOTHING, GS:NOTHING
__fltused:
.long 0x9875
.long HEX(9875)
.intel_syntax noprefix
/* FUNCTIONS ***************************************************************/
.code
//
// lldiv - signed long divide
@ -222,3 +226,5 @@ L8:
pop edi
ret 16
END

51
lib/sdk/crt/math/i386/alldvrm_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __alldvrm
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __alldvrm
/* FUNCTIONS ***************************************************************/
.code
__alldvrm:
push edi
@ -88,7 +89,7 @@ __alldvrm:
mov eax,DVNDHI // hi word of a
or eax,eax // test to see if signed
jge short ....L1 // skip rest if a is already positive
jge short .L1 // skip rest if a is already positive
inc edi // complement result sign flag
inc ebp // complement result sign flag
mov edx,DVNDLO // lo word of a
@ -97,10 +98,10 @@ __alldvrm:
sbb eax,0
mov DVNDHI,eax // save positive value
mov DVNDLO,edx
....L1:
.L1:
mov eax,DVSRHI // hi word of b
or eax,eax // test to see if signed
jge short ....L2 // skip rest if b is already positive
jge short .L2 // skip rest if b is already positive
inc edi // complement the result sign flag
mov edx,DVSRLO // lo word of a
neg eax // make b positive
@ -108,7 +109,7 @@ __alldvrm:
sbb eax,0
mov DVSRHI,eax // save positive value
mov DVSRLO,edx
....L2:
.L2:
//
// Now do the divide. First look to see if the divisor is less than 4194304K.
@ -119,7 +120,7 @@ __alldvrm:
//
or eax,eax // check to see if divisor < 4194304K
jnz short ....L3 // nope, gotta do this the hard way
jnz short .L3 // nope, gotta do this the hard way
mov ecx,DVSRLO // load divisor
mov eax,DVNDHI // load high word of dividend
xor edx,edx
@ -137,24 +138,24 @@ __alldvrm:
mov eax,esi // set up low word of quotient
mul dword ptr DVSRLO // LOWORD(QUOT) * DVSR
add edx,ecx // EDX:EAX = QUOT * DVSR
jmp short ....L4 // complete remainder calculation
jmp short .L4 // complete remainder calculation
//
// Here we do it the hard way. Remember, eax contains the high word of DVSR
//
....L3:
.L3:
mov ebx,eax // ebx:ecx <- divisor
mov ecx,DVSRLO
mov edx,DVNDHI // edx:eax <- dividend
mov eax,DVNDLO
....L5:
.L5:
shr ebx,1 // shift divisor right one bit
rcr ecx,1
shr edx,1 // shift dividend right one bit
rcr eax,1
or ebx,ebx
jnz short ....L5 // loop until divisor < 4194304K
jnz short .L5 // loop until divisor < 4194304K
div ecx // now divide, ignore remainder
mov esi,eax // save quotient
@ -170,7 +171,7 @@ __alldvrm:
mov eax,DVSRLO
mul esi // QUOT * DVSRLO
add edx,ecx // EDX:EAX = QUOT * DVSR
jc short ....L6 // carry means Quotient is off by 1
jc short .L6 // carry means Quotient is off by 1
//
// do long compare here between original dividend and the result of the
@ -179,18 +180,18 @@ __alldvrm:
//
cmp edx,DVNDHI // compare hi words of result and original
ja short ....L6 // if result > original, do subtract
jb short ....L7 // if result < original, we are ok
ja short .L6 // if result > original, do subtract
jb short .L7 // if result < original, we are ok
cmp eax,DVNDLO // hi words are equal, compare lo words
jbe short ....L7 // if less or equal we are ok, else subtract
....L6:
jbe short .L7 // if less or equal we are ok, else subtract
.L6:
dec esi // subtract 1 from quotient
sub eax,DVSRLO // subtract divisor from result
sbb edx,DVSRHI
....L7:
.L7:
xor ebx,ebx // ebx:esi <- quotient
....L4:
.L4:
//
// Calculate remainder by subtracting the result from the original dividend.
// Since the result is already in a register, we will do the subtract in the
@ -208,7 +209,7 @@ __alldvrm:
//
dec ebp // check result sign flag
jns short ....L9 // result is ok, set up the quotient
jns short .L9 // result is ok, set up the quotient
neg edx // otherwise, negate the result
neg eax
sbb edx,0
@ -216,7 +217,7 @@ __alldvrm:
//
// Now we need to get the quotient into edx:eax and the remainder into ebx:ecx.
//
....L9:
.L9:
mov ecx,edx
mov edx,ebx
mov ebx,ecx
@ -229,7 +230,7 @@ __alldvrm:
//
dec edi // check to see if result is negative
jnz short ....L8 // if EDI == 0, result should be negative
jnz short .L8 // if EDI == 0, result should be negative
neg edx // otherwise, negate the result
neg eax
sbb edx,0
@ -238,9 +239,11 @@ __alldvrm:
// Restore the saved registers and return.
//
....L8:
.L8:
pop ebp
pop esi
pop edi
ret 16
END

8
lib/sdk/crt/math/i386/allmul_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __allmul
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __allmul
/* FUNCTIONS ***************************************************************/
.code
//
// llmul - long multiply routine
@ -113,3 +114,4 @@ hard:
ret 16 // callee restores the stack
END

11
lib/sdk/crt/math/i386/allrem_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __allrem
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __allrem
/* FUNCTIONS ***************************************************************/
.code
//
// llrem - signed long remainder
@ -227,3 +228,5 @@ __allrem :
pop ebx
ret 16
END

9
lib/sdk/crt/math/i386/allshl_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __allshl
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __allshl
/* FUNCTIONS ***************************************************************/
.code
//
// llshl - long shift left
@ -92,3 +93,5 @@ RETZERO:
xor eax,eax
xor edx,edx
ret
END

11
lib/sdk/crt/math/i386/allshr_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __allshr
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __allshr
/* FUNCTIONS ***************************************************************/
.code
//
// llshr - long shift right
@ -93,3 +94,5 @@ __allshr:
sar edx,31
mov eax,edx
ret
END

11
lib/sdk/crt/math/i386/atan_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _atan
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _atan
/* FUNCTIONS ***************************************************************/
.code
_atan:
push ebp
@ -48,3 +49,5 @@ _atan:
fpatan // Take the arctangent
pop ebp
ret
END

33
lib/sdk/crt/math/i386/aulldiv_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __aulldiv
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __aulldiv
/* FUNCTIONS ***************************************************************/
.code
//
// ulldiv - unsigned long divide
@ -105,7 +106,7 @@ __aulldiv:
mov eax,DVSRHI // check to see if divisor < 4194304K
or eax,eax
jnz short ..L1 // nope, gotta do this the hard way
jnz short .L1 // nope, gotta do this the hard way
mov ecx,DVSRLO // load divisor
mov eax,DVNDHI // load high word of dividend
xor edx,edx
@ -114,24 +115,24 @@ __aulldiv:
mov eax,DVNDLO // edx:eax <- remainder:lo word of dividend
div ecx // get low order bits of quotient
mov edx,ebx // edx:eax <- quotient hi:quotient lo
jmp short ..L2 // restore stack and return
jmp short .L2 // restore stack and return
//
// Here we do it the hard way. Remember, eax contains DVSRHI
//
..L1:
.L1:
mov ecx,eax // ecx:ebx <- divisor
mov ebx,DVSRLO
mov edx,DVNDHI // edx:eax <- dividend
mov eax,DVNDLO
..L3:
.L3:
shr ecx,1 // shift divisor right one bit// hi bit <- 0
rcr ebx,1
shr edx,1 // shift dividend right one bit// hi bit <- 0
rcr eax,1
or ecx,ecx
jnz short ..L3 // loop until divisor < 4194304K
jnz short .L3 // loop until divisor < 4194304K
div ebx // now divide, ignore remainder
mov esi,eax // save quotient
@ -147,7 +148,7 @@ __aulldiv:
mov eax,DVSRLO
mul esi // QUOT * DVSRLO
add edx,ecx // EDX:EAX = QUOT * DVSR
jc short ..L4 // carry means Quotient is off by 1
jc short .L4 // carry means Quotient is off by 1
//
// do long compare here between original dividend and the result of the
@ -156,13 +157,13 @@ __aulldiv:
//
cmp edx,DVNDHI // compare hi words of result and original
ja short ..L4 // if result > original, do subtract
jb short ..L5 // if result < original, we are ok
ja short .L4 // if result > original, do subtract
jb short .L5 // if result < original, we are ok
cmp eax,DVNDLO // hi words are equal, compare lo words
jbe short ..L5 // if less or equal we are ok, else subtract
..L4:
jbe short .L5 // if less or equal we are ok, else subtract
.L4:
dec esi // subtract 1 from quotient
..L5:
.L5:
xor edx,edx // edx:eax <- quotient
mov eax,esi
@ -171,9 +172,11 @@ __aulldiv:
// Restore the saved registers and return.
//
..L2:
.L2:
pop esi
pop ebx
ret 16
END

35
lib/sdk/crt/math/i386/aulldvrm_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __aulldvrm
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __aulldvrm
/* FUNCTIONS ***************************************************************/
.code
__aulldvrm:
@ -101,7 +102,7 @@ __aulldvrm:
mov eax,DVSRHI // check to see if divisor < 4194304K
or eax,eax
jnz short .....L1 // nope, gotta do this the hard way
jnz short .L1 // nope, gotta do this the hard way
mov ecx,DVSRLO // load divisor
mov eax,DVNDHI // load high word of dividend
xor edx,edx
@ -120,24 +121,24 @@ __aulldvrm:
mov eax,esi // set up low word of quotient
mul dword ptr DVSRLO // LOWORD(QUOT) * DVSR
add edx,ecx // EDX:EAX = QUOT * DVSR
jmp short .....L2 // complete remainder calculation
jmp short .L2 // complete remainder calculation
//
// Here we do it the hard way. Remember, eax contains DVSRHI
//
.....L1:
.L1:
mov ecx,eax // ecx:ebx <- divisor
mov ebx,DVSRLO
mov edx,DVNDHI // edx:eax <- dividend
mov eax,DVNDLO
.....L3:
.L3:
shr ecx,1 // shift divisor right one bit// hi bit <- 0
rcr ebx,1
shr edx,1 // shift dividend right one bit// hi bit <- 0
rcr eax,1
or ecx,ecx
jnz short .....L3 // loop until divisor < 4194304K
jnz short .L3 // loop until divisor < 4194304K
div ebx // now divide, ignore remainder
mov esi,eax // save quotient
@ -153,7 +154,7 @@ __aulldvrm:
mov eax,DVSRLO
mul esi // QUOT * DVSRLO
add edx,ecx // EDX:EAX = QUOT * DVSR
jc short .....L4 // carry means Quotient is off by 1
jc short .L4 // carry means Quotient is off by 1
//
// do long compare here between original dividend and the result of the
@ -162,18 +163,18 @@ __aulldvrm:
//
cmp edx,DVNDHI // compare hi words of result and original
ja short .....L4 // if result > original, do subtract
jb short .....L5 // if result < original, we are ok
ja short .L4 // if result > original, do subtract
jb short .L5 // if result < original, we are ok
cmp eax,DVNDLO // hi words are equal, compare lo words
jbe short .....L5 // if less or equal we are ok, else subtract
.....L4:
jbe short .L5 // if less or equal we are ok, else subtract
.L4:
dec esi // subtract 1 from quotient
sub eax,DVSRLO // subtract divisor from result
sbb edx,DVSRHI
.....L5:
.L5:
xor ebx,ebx // ebx:esi <- quotient
.....L2:
.L2:
//
// Calculate remainder by subtracting the result from the original dividend.
// Since the result is already in a register, we will do the subtract in the
@ -202,3 +203,5 @@ __aulldvrm:
pop esi
ret 16
END

35
lib/sdk/crt/math/i386/aullrem_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __aullrem
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __aullrem
/* FUNCTIONS ***************************************************************/
.code
//
// ullrem - unsigned long remainder
@ -101,7 +102,7 @@ __aullrem:
mov eax,DVSRHI // check to see if divisor < 4194304K
or eax,eax
jnz short ...L1 // nope, gotta do this the hard way
jnz short .L1 // nope, gotta do this the hard way
mov ecx,DVSRLO // load divisor
mov eax,DVNDHI // load high word of dividend
xor edx,edx
@ -110,24 +111,24 @@ __aullrem:
div ecx // edx <- final remainder
mov eax,edx // edx:eax <- remainder
xor edx,edx
jmp short ...L2 // restore stack and return
jmp short .L2 // restore stack and return
//
// Here we do it the hard way. Remember, eax contains DVSRHI
//
...L1:
.L1:
mov ecx,eax // ecx:ebx <- divisor
mov ebx,DVSRLO
mov edx,DVNDHI // edx:eax <- dividend
mov eax,DVNDLO
...L3:
.L3:
shr ecx,1 // shift divisor right one bit// hi bit <- 0
rcr ebx,1
shr edx,1 // shift dividend right one bit// hi bit <- 0
rcr eax,1
or ecx,ecx
jnz short ...L3 // loop until divisor < 4194304K
jnz short .L3 // loop until divisor < 4194304K
div ebx // now divide, ignore remainder
//
@ -142,7 +143,7 @@ __aullrem:
xchg ecx,eax // put partial product in ECX, get quotient in EAX
mul dword ptr DVSRLO
add edx,ecx // EDX:EAX = QUOT * DVSR
jc short ...L4 // carry means Quotient is off by 1
jc short .L4 // carry means Quotient is off by 1
//
// do long compare here between original dividend and the result of the
@ -151,14 +152,14 @@ __aullrem:
//
cmp edx,DVNDHI // compare hi words of result and original
ja short ...L4 // if result > original, do subtract
jb short ...L5 // if result < original, we're ok
ja short .L4 // if result > original, do subtract
jb short .L5 // if result < original, we're ok
cmp eax,DVNDLO // hi words are equal, compare lo words
jbe short ...L5 // if less or equal we're ok, else subtract
...L4:
jbe short .L5 // if less or equal we're ok, else subtract
.L4:
sub eax,DVSRLO // subtract divisor from result
sbb edx,DVSRHI
...L5:
.L5:
//
// Calculate remainder by subtracting the result from the original dividend.
@ -177,8 +178,10 @@ __aullrem:
// Restore the saved registers and return.
//
...L2:
.L2:
pop ebx
ret 16
END

19
lib/sdk/crt/math/i386/aullshr_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __aullshr
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __aullshr
/* FUNCTIONS ***************************************************************/
.code
//
// ullshr - long shift right
@ -65,13 +66,13 @@ __aullshr:
// depends only on the high order bit of edx).
//
cmp cl,64
jae short ..RETZERO
jae short .RETZERO
//
// Handle shifts of between 0 and 31 bits
//
cmp cl, 32
jae short ..MORE32
jae short .MORE32
shrd eax,edx,cl
shr edx,cl
ret
@ -79,7 +80,7 @@ __aullshr:
//
// Handle shifts of between 32 and 63 bits
//
..MORE32:
.MORE32:
mov eax,edx
xor edx,edx
and cl,31
@ -89,7 +90,9 @@ __aullshr:
//
// return 0 in edx:eax
//
..RETZERO:
.RETZERO:
xor eax,eax
xor edx,edx
ret
END

11
lib/sdk/crt/math/i386/ceil_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _ceil
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _ceil
/* FUNCTIONS ***************************************************************/
.code
_ceil:
push ebp
@ -47,7 +48,7 @@ _ceil:
fld qword ptr [ebp+8] // Load real from stack
fstcw [ebp-2] // Save control word
fclex // Clear exceptions
mov word ptr [ebp-4],0xb63 // Rounding control word
mov word ptr [ebp-4], HEX(0b63) // Rounding control word
fldcw [ebp-4] // Set new rounding control
frndint // Round to integer
fclex // Clear exceptions
@ -55,3 +56,5 @@ _ceil:
mov esp,ebp // Deallocate temporary space
pop ebp
ret
END

53
lib/sdk/crt/math/i386/ceilf.S
View file

@ -3,53 +3,34 @@
* This file is part of the w64 mingw-runtime package.
* No warranty is given; refer to the file DISCLAIMER.PD within this package.
*/
#include <_mingw_mac.h>
.file "ceilf.S"
.text
.align 4
.globl __MINGW_USYMBOL(ceilf)
.def __MINGW_USYMBOL(ceilf); .scl 2; .type 32; .endef
__MINGW_USYMBOL(ceilf):
#ifdef _WIN64
subq $24,%rsp
movss %xmm0,8(%rsp)
flds 8(%rsp)
#include <reactos/asm.h>
fstcw 4(%rsp) /* store fpu control word */
.code
.align 4
movl $0x0800,%edx /* round towards +oo */
orl 4(%rsp),%edx
andl $0xfbff,%edx
movl %edx,(%rsp)
fldcw (%rsp) /* load modified control word */
PUBLIC _ceilf
_ceilf:
frndint /* round */
fld dword ptr [esp + 4]
sub esp, 8
fldcw 4(%rsp) /* restore original control word */
fstps 8(%rsp)
movss 8(%rsp),%xmm0
addq $24,%rsp
ret
#else
flds 4(%esp)
subl $8,%esp
fstcw 4(%esp) /* store fpu control word */
fstcw [esp + 4] /* store fpu control word */
/* We use here %edx although only the low 1 bits are defined.
But none of the operations should care and they are faster
than the 16 bit operations. */
movl $0x0800,%edx /* round towards +oo */
orl 4(%esp),%edx
andl $0xfbff,%edx
movl %edx,(%esp)
fldcw (%esp) /* load modified control word */
mov edx, [esp + 4]
or edx, HEX(0800) /* round towards +oo */
and edx, HEX(fbff)
mov [esp], edx
fldcw [esp] /* load modified control word */
frndint /* round */
fldcw 4(%esp) /* restore original control word */
fldcw [esp + 4] /* restore original control word */
addl $8,%esp
add esp, 8
ret
#endif
END

9
lib/sdk/crt/math/i386/cos_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _cos
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _cos
/* FUNCTIONS ***************************************************************/
.code
_cos:
push ebp
@ -47,3 +48,5 @@ _cos:
fcos // Take the cosine
pop ebp
ret
END

11
lib/sdk/crt/math/i386/fabs_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _fabs
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _fabs
/* FUNCTIONS ***************************************************************/
.code
_fabs:
push ebp
@ -47,3 +48,5 @@ _fabs:
fabs // Take the absolute value
pop ebp
ret
END

13
lib/sdk/crt/math/i386/floor_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _floor
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _floor
/* FUNCTIONS ***************************************************************/
.code
_floor:
push ebp
@ -47,7 +48,7 @@ _floor:
fld qword ptr [ebp+8] // Load real from stack
fstcw [ebp-2] // Save control word
fclex // Clear exceptions
mov word ptr [ebp-4],0x763 // Rounding control word
mov word ptr [ebp-4], HEX(0763) // Rounding control word
fldcw [ebp-4] // Set new rounding control
frndint // Round to integer
fclex // Clear exceptions
@ -55,3 +56,5 @@ _floor:
mov esp,ebp
pop ebp
ret
END

57
lib/sdk/crt/math/i386/floorf.S
View file

@ -7,57 +7,34 @@
* Removed header file dependency for use in libmingwex.a by
* Danny Smith <dannysmith@users.sourceforge.net>
*/
#include <_mingw_mac.h>
.file "floorf.S"
.text
#ifdef _WIN64
.align 8
#else
.align 4
#endif
.globl __MINGW_USYMBOL(floorf)
.def __MINGW_USYMBOL(floorf); .scl 2; .type 32; .endef
__MINGW_USYMBOL(floorf):
#ifdef _WIN64
subq $24,%rsp
movss %xmm0,8(%rsp)
flds 8(%rsp)
#include <reactos/asm.h>
fstcw 4(%rsp) /* store fpu control word */
movl $0x400,%edx /* round towards -oo */
orl 4(%rsp),%edx
andl $0xf7ff,%edx
movl %edx,(%rsp)
fldcw (%rsp) /* load modified control word */
.code
.align 4
frndint /* round */
PUBLIC _floorf
_floorf:
fldcw 4(%rsp) /* restore original control word */
fld dword ptr [esp + 4]
sub esp, 8
fstps 8(%rsp)
movss 8(%rsp),%xmm0
addq $24,%rsp
ret
#else
flds 4(%esp)
subl $8,%esp
fstcw 4(%esp) /* store fpu control word */
fstcw [esp + 4] /* store fpu control word */
/* We use here %edx although only the low 1 bits are defined.
But none of the operations should care and they are faster
than the 16 bit operations. */
movl $0x400,%edx /* round towards -oo */
orl 4(%esp),%edx
andl $0xf7ff,%edx
movl %edx,(%esp)
fldcw (%esp) /* load modified control word */
mov edx, [esp + 4]
or edx, HEX(0400) /* round towards -oo */
and edx, HEX(0f7ff)
mov [esp], edx
fldcw [esp] /* load modified control word */
frndint /* round */
fldcw 4(%esp) /* restore original control word */
fldcw [esp + 4] /* restore original control word */
addl $8,%esp
add esp, 8
ret
#endif
END

13
lib/sdk/crt/math/i386/ftol_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl __ftol
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC __ftol
/* FUNCTIONS ***************************************************************/
.code
/*
* This routine is called by MSVC-generated code to convert from floating point
@ -54,7 +55,7 @@ __ftol:
fstcw [ebp-2]
wait
mov ax, [ebp-2]
or ah, 0xC
or ah, 12
mov [ebp-4], ax
fldcw [ebp-4]
@ -71,3 +72,5 @@ __ftol:
/* Remove stack frame and return*/
leave
ret
END

8
lib/sdk/crt/math/i386/log10_asm.s
View file

@ -7,12 +7,13 @@
* PROGRAMER: Magnus Olsen (magnus@greatlord.com)
*
*/
.globl _log10
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _log10
/* FUNCTIONS ***************************************************************/
.code
_log10:
@ -25,3 +26,4 @@ _log10:
pop ebp
ret
END

11
lib/sdk/crt/math/i386/log_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _log
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _log
/* FUNCTIONS ***************************************************************/
.code
_log:
push ebp
@ -49,3 +50,5 @@ _log:
fyl2x // Compute the natural log(x)
pop ebp
ret
END

371
lib/sdk/crt/math/i386/pow_asm.s
View file

@ -19,41 +19,54 @@
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
/* Reacros modifications */
/* Reactos modifications */
#include <reactos/asm.h>
#define ALIGNARG(log2) log2
#define ASM_TYPE_DIRECTIVE(name,typearg)
#define ASM_SIZE_DIRECTIVE(name)
#define cfi_adjust_cfa_offset(x)
#define ENTRY(x)
#define END(x)
.global _pow
PUBLIC _pow
.data
.text
ASSUME CS:NOTHING, DS:NOTHING, ES:NOTHING, FS:NOTHING, GS:NOTHING
.align ALIGNARG(4)
ASM_TYPE_DIRECTIVE(infinity,@object)
inf_zero:
infinity:
.byte 0, 0, 0, 0, 0, 0, 0xf0, 0x7f
.byte 0, 0, 0, 0, 0, 0, HEX(f0), HEX(7f)
ASM_SIZE_DIRECTIVE(infinity)
ASM_TYPE_DIRECTIVE(zero,@object)
zero: .double 0.0
zero:
.double 0.0
ASM_SIZE_DIRECTIVE(zero)
ASM_TYPE_DIRECTIVE(minf_mzero,@object)
minf_mzero:
minfinity:
.byte 0, 0, 0, 0, 0, 0, 0xf0, 0xff
.byte 0, 0, 0, 0, 0, 0, HEX(f0), HEX(ff)
mzero:
.byte 0, 0, 0, 0, 0, 0, 0, 0x80
.byte 0, 0, 0, 0, 0, 0, 0, HEX(80)
ASM_SIZE_DIRECTIVE(minf_mzero)
ASM_TYPE_DIRECTIVE(one,@object)
one: .double 1.0
one:
.double 1.0
ASM_SIZE_DIRECTIVE(one)
ASM_TYPE_DIRECTIVE(limit,@object)
limit: .double 0.29
limit:
.double 0.29
ASM_SIZE_DIRECTIVE(limit)
ASM_TYPE_DIRECTIVE(p63,@object)
p63: .byte 0, 0, 0, 0, 0, 0, 0xe0, 0x43
p63:
.byte 0, 0, 0, 0, 0, 0, HEX(e0), HEX(43)
ASM_SIZE_DIRECTIVE(p63)
#ifdef PIC
@ -61,308 +74,310 @@ p63: .byte 0, 0, 0, 0, 0, 0, 0xe0, 0x43
#define MOX(op,x,f) op##@GOTOFF(%ecx,x,f)
#else
#define MO(op) op
#define MOX(op,x,f) op(,x,f)
#define MOX(op,x,f) op[x*f]
#endif
.code
.text
_pow:
ENTRY(__ieee754_pow)
fldl 12(%esp) // y
fld qword ptr [esp + 12] // y
fxam
#ifdef PIC
LOAD_PIC_REG (cx)
#endif
fnstsw
movb %ah, %dl
andb $0x45, %ah
cmpb $0x40, %ah // is y == 0 ?
je 11f
fnstsw ax
mov dl, ah
and ah, HEX(045)
cmp ah, HEX(040) // is y == 0 ?
je L11
cmpb $0x05, %ah // is y == ±inf ?
je 12f
cmp ah, 5 // is y == ±inf ?
je L12
cmpb $0x01, %ah // is y == NaN ?
je 30f
cmp ah, 1 // is y == NaN ?
je L30
fldl 4(%esp) // x : y
fld qword ptr [esp + 4] // x : y
subl $8,%esp
sub esp, 8
cfi_adjust_cfa_offset (8)
fxam
fnstsw
movb %ah, %dh
andb $0x45, %ah
cmpb $0x40, %ah
je 20f // x is ±0
fnstsw ax
mov dh, ah
and ah, HEX(45)
cmp ah, HEX(040)
je L20 // x is ±0
cmpb $0x05, %ah
je 15f // x is ±inf
cmp ah, 5
je L15 // x is ±inf
fxch // y : x
fxch st(1) // y : x
/* fistpll raises invalid exception for |y| >= 1L<<63. */
fld %st // y : y : x
fld st // y : y : x
fabs // |y| : y : x
fcompl MO(p63) // y : x
fnstsw
fcomp qword ptr MO(p63) // y : x
fnstsw ax
sahf
jnc 2f
jnc L2
/* First see whether `y' is a natural number. In this case we
can use a more precise algorithm. */
fld %st // y : y : x
fistpll (%esp) // y : x
fildll (%esp) // int(y) : y : x
fucomp %st(1) // y : x
fnstsw
fld st // y : y : x
fistp qword ptr [esp] // y : x
fild qword ptr [esp] // int(y) : y : x
fucomp st(1) // y : x
fnstsw ax
sahf
jne 2f
jne L2
/* OK, we have an integer value for y. */
popl %eax
pop eax
cfi_adjust_cfa_offset (-4)
popl %edx
pop edx
cfi_adjust_cfa_offset (-4)
orl $0, %edx
fstp %st(0) // x
jns 4f // y >= 0, jump
fdivrl MO(one) // 1/x (now referred to as x)
negl %eax
adcl $0, %edx
negl %edx
4: fldl MO(one) // 1 : x
fxch
or edx, 0
fstp st // x
jns L4 // y >= 0, jump
fdivr qword ptr MO(one) // 1/x (now referred to as x)
neg eax
adc edx, 0
neg edx
L4: fld qword ptr MO(one) // 1 : x
fxch st(1)
6: shrdl $1, %edx, %eax
jnc 5f
fxch
fmul %st(1) // x : ST*x
fxch
5: fmul %st(0), %st // x*x : ST*x
shrl $1, %edx
movl %eax, %ecx
orl %edx, %ecx
jnz 6b
fstp %st(0) // ST*x
L6: shrd eax, edx, 1
jnc L5
fxch st(1)
fmul st, st(1) // x : ST*x
fxch st(1)
L5: fmul st, st // x*x : ST*x
shr edx, 1
mov ecx, eax
or ecx, edx
jnz L6
fstp st // ST*x
ret
/* y is ±NAN */
30: fldl 4(%esp) // x : y
fldl MO(one) // 1.0 : x : y
fucomp %st(1) // x : y
fnstsw
L30:
fld qword ptr [esp + 4] // x : y
fld qword ptr MO(one) // 1.0 : x : y
fucomp st(1) // x : y
fnstsw ax
sahf
je 31f
fxch // y : x
31: fstp %st(1)
je L31
fxch st(1) // y : x
L31:fstp st(1)
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
2: /* y is a real number. */
fxch // x : y
fldl MO(one) // 1.0 : x : y
fldl MO(limit) // 0.29 : 1.0 : x : y
fld %st(2) // x : 0.29 : 1.0 : x : y
fsub %st(2) // x-1 : 0.29 : 1.0 : x : y
L2: /* y is a real number. */
fxch st(1) // x : y
fld qword ptr MO(one) // 1.0 : x : y
fld qword ptr MO(limit) // 0.29 : 1.0 : x : y
fld st(2) // x : 0.29 : 1.0 : x : y
fsub st, st(2) // x-1 : 0.29 : 1.0 : x : y
fabs // |x-1| : 0.29 : 1.0 : x : y
fucompp // 1.0 : x : y
fnstsw
fxch // x : 1.0 : y
fnstsw ax
fxch st(1) // x : 1.0 : y
sahf
ja 7f
fsub %st(1) // x-1 : 1.0 : y
ja L7
fsub st, st(1) // x-1 : 1.0 : y
fyl2xp1 // log2(x) : y
jmp 8f
jmp L8
7: fyl2x // log2(x) : y
8: fmul %st(1) // y*log2(x) : y
fst %st(1) // y*log2(x) : y*log2(x)
L7: fyl2x // log2(x) : y
L8: fmul st, st(1) // y*log2(x) : y
fst st(1) // y*log2(x) : y*log2(x)
frndint // int(y*log2(x)) : y*log2(x)
fsubr %st, %st(1) // int(y*log2(x)) : fract(y*log2(x))
fsubr st(1), st // int(y*log2(x)) : fract(y*log2(x))
fxch // fract(y*log2(x)) : int(y*log2(x))
f2xm1 // 2^fract(y*log2(x))-1 : int(y*log2(x))
faddl MO(one) // 2^fract(y*log2(x)) : int(y*log2(x))
fadd qword ptr MO(one) // 2^fract(y*log2(x)) : int(y*log2(x))
fscale // 2^fract(y*log2(x))*2^int(y*log2(x)) : int(y*log2(x))
addl $8, %esp
add esp, 8
cfi_adjust_cfa_offset (-8)
fstp %st(1) // 2^fract(y*log2(x))*2^int(y*log2(x))
fstp st(1) // 2^fract(y*log2(x))*2^int(y*log2(x))
ret
// pow(x,±0) = 1
.align ALIGNARG(4)
11: fstp %st(0) // pop y
fldl MO(one)
L11:fstp st(0) // pop y
fld qword ptr MO(one)
ret
// y == ±inf
.align ALIGNARG(4)
12: fstp %st(0) // pop y
fldl MO(one) // 1
fldl 4(%esp) // x : 1
L12: fstp st(0) // pop y
fld qword ptr MO(one) // 1
fld qword ptr [esp + 4] // x : 1
fabs // abs(x) : 1
fucompp // < 1, == 1, or > 1
fnstsw
andb $0x45, %ah
cmpb $0x45, %ah
je 13f // jump if x is NaN
fnstsw ax
and ah, HEX(45)
cmp ah, HEX(45)
je L13 // jump if x is NaN
cmpb $0x40, %ah
je 14f // jump if |x| == 1
cmp ah, HEX(40)
je L14 // jump if |x| == 1
shlb $1, %ah
xorb %ah, %dl
andl $2, %edx
fldl MOX(inf_zero, %edx, 4)
shl ah, 1
xor dl, ah
and edx, 2
fld qword ptr MOX(inf_zero, edx, 4)
ret
.align ALIGNARG(4)
14: fldl MO(one)
L14:fld qword ptr MO(one)
ret
.align ALIGNARG(4)
13: fldl 4(%esp) // load x == NaN
L13:fld qword ptr [esp + 4] // load x == NaN
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
// x is ±inf
15: fstp %st(0) // y
testb $2, %dh
jz 16f // jump if x == +inf
L15: fstp st(0) // y
test dh, 2
jz L16 // jump if x == +inf
// We must find out whether y is an odd integer.
fld %st // y : y
fistpll (%esp) // y
fildll (%esp) // int(y) : y
fld st // y : y
fistp qword ptr [esp] // y
fild qword ptr [esp] // int(y) : y
fucompp // <empty>
fnstsw
fnstsw ax
sahf
jne 17f
jne L17
// OK, the value is an integer, but is the number of bits small
// enough so that all are coming from the mantissa?
popl %eax
pop eax
cfi_adjust_cfa_offset (-4)
popl %edx
pop edx
cfi_adjust_cfa_offset (-4)
andb $1, %al
jz 18f // jump if not odd
movl %edx, %eax
orl %edx, %edx
jns 155f
negl %eax
155: cmpl $0x00200000, %eax
ja 18f // does not fit in mantissa bits
and al, 1
jz L18 // jump if not odd
mov eax, edx
or edx, edx
jns L155
neg eax
L155:
cmp eax, HEX(000200000)
ja L18 // does not fit in mantissa bits
// It's an odd integer.
shrl $31, %edx
fldl MOX(minf_mzero, %edx, 8)
shr edx, 31
fld qword ptr MOX(minf_mzero, edx, 8)
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
16: fcompl MO(zero)
addl $8, %esp
L16:fcomp qword ptr MO(zero)
add esp, 8
cfi_adjust_cfa_offset (-8)
fnstsw
shrl $5, %eax
andl $8, %eax
fldl MOX(inf_zero, %eax, 1)
fnstsw ax
shr eax, 5
and eax, 8
fld qword ptr MOX(inf_zero, eax, 1)
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
17: shll $30, %edx // sign bit for y in right position
addl $8, %esp
L17: shl ecx, 30 // sign bit for y in right position
add esp, 8
cfi_adjust_cfa_offset (-8)
18: shrl $31, %edx
fldl MOX(inf_zero, %edx, 8)
L18: shr edx, 31
fld qword ptr MOX(inf_zero, edx, 8)
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
// x is ±0
20: fstp %st(0) // y
testb $2, %dl
jz 21f // y > 0
L20: fstp st(0) // y
test dl, 2
jz L21 // y > 0
// x is ±0 and y is < 0. We must find out whether y is an odd integer.
testb $2, %dh
jz 25f
test dh, 2
jz L25
fld %st // y : y
fistpll (%esp) // y
fildll (%esp) // int(y) : y
fld st // y : y
fistp qword ptr [esp] // y
fild qword ptr [esp] // int(y) : y
fucompp // <empty>
fnstsw
fnstsw ax
sahf
jne 26f
jne L26
// OK, the value is an integer, but is the number of bits small
// enough so that all are coming from the mantissa?
popl %eax
pop eax
cfi_adjust_cfa_offset (-4)
popl %edx
pop edx
cfi_adjust_cfa_offset (-4)
andb $1, %al
jz 27f // jump if not odd
cmpl $0xffe00000, %edx
jbe 27f // does not fit in mantissa bits
and al, 1
jz L27 // jump if not odd
cmp edx, HEX(0ffe00000)
jbe L27 // does not fit in mantissa bits
// It's an odd integer.
// Raise divide-by-zero exception and get minus infinity value.
fldl MO(one)
fdivl MO(zero)
fld qword ptr MO(one)
fdiv qword ptr MO(zero)
fchs
ret
cfi_adjust_cfa_offset (8)
25: fstp %st(0)
26: addl $8, %esp
L25: fstp st(0)
L26: add esp, 8
cfi_adjust_cfa_offset (-8)
27: // Raise divide-by-zero exception and get infinity value.
fldl MO(one)
fdivl MO(zero)
L27: // Raise divide-by-zero exception and get infinity value.
fld qword ptr MO(one)
fdiv qword ptr MO(zero)
ret
cfi_adjust_cfa_offset (8)
.align ALIGNARG(4)
// x is ±0 and y is > 0. We must find out whether y is an odd integer.
21: testb $2, %dh
jz 22f
L21:test dh, 2
jz L22
fld %st // y : y
fistpll (%esp) // y
fildll (%esp) // int(y) : y
fld st // y : y
fistp qword ptr [esp] // y
fild qword ptr [esp] // int(y) : y
fucompp // <empty>
fnstsw
fnstsw ax
sahf
jne 23f
jne L23
// OK, the value is an integer, but is the number of bits small
// enough so that all are coming from the mantissa?
popl %eax
pop eax
cfi_adjust_cfa_offset (-4)
popl %edx
pop edx
cfi_adjust_cfa_offset (-4)
andb $1, %al
jz 24f // jump if not odd
cmpl $0xffe00000, %edx
jae 24f // does not fit in mantissa bits
and al, 1
jz L24 // jump if not odd
cmp edx, HEX(0ffe00000)
jae L24 // does not fit in mantissa bits
// It's an odd integer.
fldl MO(mzero)
fld qword ptr MO(mzero)
ret
cfi_adjust_cfa_offset (8)
22: fstp %st(0)
23: addl $8, %esp // Don't use 2 x pop
L22: fstp st(0)
L23: add esp, 8 // Don't use 2 x pop
cfi_adjust_cfa_offset (-8)
24: fldl MO(zero)
L24: fld qword ptr MO(zero)
ret
END(__ieee754_pow)
END

9
lib/sdk/crt/math/i386/sin_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _sin
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _sin
/* FUNCTIONS ***************************************************************/
.code
_sin:
push ebp // Save register bp
@ -47,3 +48,5 @@ _sin:
fsin // Take the sine
pop ebp // Restore register bp
ret
END

11
lib/sdk/crt/math/i386/sqrt_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _sqrt
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _sqrt
/* FUNCTIONS ***************************************************************/
.code
_sqrt:
push ebp
@ -47,3 +48,5 @@ _sqrt:
fsqrt // Take the square root
pop ebp
ret
END

11
lib/sdk/crt/math/i386/tan_asm.s
View file

@ -33,12 +33,13 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
.globl _tan
.intel_syntax noprefix
#include <reactos/asm.h>
PUBLIC _tan
/* FUNCTIONS ***************************************************************/
.code
_tan:
push ebp
@ -50,3 +51,5 @@ _tan:
mov esp,ebp // Deallocate temporary space
pop ebp
ret
END