#if defined _DIVULONG_ASM_SMALL
static void
-_divlong_dummy (void) _naked
+_divlong_dummy (void) __naked
{
- _asm
+ __asm
- .globl __divulong
+ .globl __divulong
- __divulong:
+__divulong:
- #define count r2
+ #define count r2
- #define x0 dpl
- #define x1 dph
- #define x2 b
- #define x3 r3
+ #define x0 dpl
+ #define x1 dph
+ #define x2 b
+ #define x3 r3
- #define reste0 r4
- #define reste1 r5
- #define reste2 r6
- #define reste3 r7
+ #define reste0 r4
+ #define reste1 r5
+ #define reste2 r6
+ #define reste3 r7
#if !defined(SDCC_PARMS_IN_BANK1)
#if defined(SDCC_NOOVERLAY)
- .area DSEG (DATA)
+ .area DSEG (DATA)
#else
- .area OSEG (OVR,DATA)
+ .area OSEG (OVR,DATA)
#endif
- .globl __divulong_PARM_2
- .globl __divslong_PARM_2
+ .globl __divulong_PARM_2
+ .globl __divslong_PARM_2
- __divulong_PARM_2:
- __divslong_PARM_2:
- .ds 4
+__divulong_PARM_2:
+__divslong_PARM_2:
+ .ds 4
- .area CSEG (CODE)
+ .area CSEG (CODE)
- #define y0 (__divulong_PARM_2)
- #define y1 (__divulong_PARM_2 + 1)
- #define y2 (__divulong_PARM_2 + 2)
- #define y3 (__divulong_PARM_2 + 3)
+ #define y0 (__divulong_PARM_2)
+ #define y1 (__divulong_PARM_2 + 1)
+ #define y2 (__divulong_PARM_2 + 2)
+ #define y3 (__divulong_PARM_2 + 3)
#else
- #define y0 (b1_0)
- #define y1 (b1_1)
- #define y2 (b1_2)
- #define y3 (b1_3)
+ #define y0 (b1_0)
+ #define y1 (b1_1)
+ #define y2 (b1_2)
+ #define y3 (b1_3)
#endif // !SDCC_PARMS_IN_BANK1
- ; parameter x comes in a, b, dph, dpl
- mov x3,a ; save parameter x3
+ ; parameter x comes in a, b, dph, dpl
+ mov x3,a ; save parameter x3
- mov count,#32
- clr a
- mov reste0,a
- mov reste1,a
- mov reste2,a
- mov reste3,a
+ mov count,#32
+ clr a
+ mov reste0,a
+ mov reste1,a
+ mov reste2,a
+ mov reste3,a
; optimization loop in lp0 until the first bit is shifted into rest
- lp0: mov a,x0 ; x <<= 1
- add a,x0
- mov x0,a
- mov a,x1
- rlc a
- mov x1,a
- mov a,x2
- rlc a
- mov x2,a
- mov a,x3
- rlc a
- mov x3,a
-
- jc in_lp
- djnz count,lp0
-
- sjmp exit
-
- loop: mov a,x0 ; x <<= 1
- add a,x0
- mov x0,a
- mov a,x1
- rlc a
- mov x1,a
- mov a,x2
- rlc a
- mov x2,a
- mov a,x3
- rlc a
- mov x3,a
-
- in_lp: mov a,reste0 ; reste <<= 1
- rlc a ; feed in carry
- mov reste0,a
- mov a,reste1
- rlc a
- mov reste1,a
- mov a,reste2
- rlc a
- mov reste2,a
- mov a,reste3
- rlc a
- mov reste3,a
-
- mov a,reste0 ; reste - y
- subb a,y0 ; carry is always clear here, because
+lp0: mov a,x0 ; x <<= 1
+ add a,x0
+ mov x0,a
+ mov a,x1
+ rlc a
+ mov x1,a
+ mov a,x2
+ rlc a
+ mov x2,a
+ mov a,x3
+ rlc a
+ mov x3,a
+
+ jc in_lp
+ djnz count,lp0
+
+ sjmp exit
+
+loop: mov a,x0 ; x <<= 1
+ add a,x0
+ mov x0,a
+ mov a,x1
+ rlc a
+ mov x1,a
+ mov a,x2
+ rlc a
+ mov x2,a
+ mov a,x3
+ rlc a
+ mov x3,a
+
+in_lp: mov a,reste0 ; reste <<= 1
+ rlc a ; feed in carry
+ mov reste0,a
+ mov a,reste1
+ rlc a
+ mov reste1,a
+ mov a,reste2
+ rlc a
+ mov reste2,a
+ mov a,reste3
+ rlc a
+ mov reste3,a
+
+ mov a,reste0 ; reste - y
+ subb a,y0 ; carry is always clear here, because
; reste <<= 1 never overflows
- mov a,reste1
- subb a,y1
- mov a,reste2
- subb a,y2
- mov a,reste3
- subb a,y3
-
- jc minus ; reste >= y?
-
- ; -> yes; reste -= y;
- mov a,reste0
- subb a,y0 ; carry is always clear here (jc)
- mov reste0,a
- mov a,reste1
- subb a,y1
- mov reste1,a
- mov a,reste2
- subb a,y2
- mov reste2,a
- mov a,reste3
- subb a,y3
- mov reste3,a
-
- orl x0,#1
-
- minus: djnz count,loop ; -> no
-
- exit: mov a,x3 ; prepare the return value
- ret
-
- _endasm ;
+ mov a,reste1
+ subb a,y1
+ mov a,reste2
+ subb a,y2
+ mov a,reste3
+ subb a,y3
+
+ jc minus ; reste >= y?
+
+ ; -> yes; reste -= y;
+ mov a,reste0
+ subb a,y0 ; carry is always clear here (jc)
+ mov reste0,a
+ mov a,reste1
+ subb a,y1
+ mov reste1,a
+ mov a,reste2
+ subb a,y2
+ mov reste2,a
+ mov a,reste3
+ subb a,y3
+ mov reste3,a
+
+ orl x0,#1
+
+minus: djnz count,loop ; -> no
+
+exit: mov a,x3 ; prepare the return value
+ ret
+
+ __endasm;
}
#elif defined _DIVULONG_ASM_SMALL_AUTO
static void
-_divlong_dummy (void) _naked
+_divlong_dummy (void) __naked
{
- _asm
+ __asm
- .globl __divulong
+ .globl __divulong
- __divulong:
+__divulong:
- #define count r2
+ #define count r2
- #define x0 dpl
- #define x1 dph
- #define x2 b
- #define x3 r3
+ #define x0 dpl
+ #define x1 dph
+ #define x2 b
+ #define x3 r3
- #define reste0 r4
- #define reste1 r5
- #define reste2 r6
- #define reste3 r7
+ #define reste0 r4
+ #define reste1 r5
+ #define reste2 r6
+ #define reste3 r7
- .globl __divlong ; entry point for __divslong
+ .globl __divlong ; entry point for __divslong
- #define y0 r1
+ #define y0 r1
- ; parameter x comes in a, b, dph, dpl
- mov x3,a ; save parameter x3
+ ; parameter x comes in a, b, dph, dpl
+ mov x3,a ; save parameter x3
- mov a,sp
- add a,#-2-3 ; 2 bytes return address, 3 bytes param y
- mov r0,a ; r0 points to y0
+ mov a,sp
+ add a,#-2-3 ; 2 bytes return address, 3 bytes param y
+ mov r0,a ; r0 points to y0
- __divlong: ; entry point for __divslong
+__divlong: ; entry point for __divslong
- mov a,@r0 ; load y0
- mov r1,a
- inc r0 ; r0 points to y1
+ mov a,@r0 ; load y0
+ mov r1,a
+ inc r0 ; r0 points to y1
- mov count,#32
- clr a
- mov reste0,a
- mov reste1,a
- mov reste2,a
- mov reste3,a
+ mov count,#32
+ clr a
+ mov reste0,a
+ mov reste1,a
+ mov reste2,a
+ mov reste3,a
; optimization loop in lp0 until the first bit is shifted into rest
- lp0: mov a,x0 ; x <<= 1
- add a,x0
- mov x0,a
- mov a,x1
- rlc a
- mov x1,a
- mov a,x2
- rlc a
- mov x2,a
- mov a,x3
- rlc a
- mov x3,a
-
- jc in_lp
- djnz count,lp0
-
- sjmp exit
-
- loop: mov a,x0 ; x <<= 1
- add a,x0
- mov x0,a
- mov a,x1
- rlc a
- mov x1,a
- mov a,x2
- rlc a
- mov x2,a
- mov a,x3
- rlc a
- mov x3,a
-
- in_lp: mov a,reste0 ; reste <<= 1
- rlc a ; feed in carry
- mov reste0,a
- mov a,reste1
- rlc a
- mov reste1,a
- mov a,reste2
- rlc a
- mov reste2,a
- mov a,reste3
- rlc a
- mov reste3,a
-
- mov a,reste0 ; reste - y
- subb a,y0 ; carry is always clear here, because
- ; reste <<= 1 never overflows
- mov a,reste1
- subb a,@r0 ; y1
- mov a,reste2
- inc r0
- subb a,@r0 ; y2
- mov a,reste3
- inc r0
- subb a,@r0 ; y3
- dec r0
- dec r0
-
- jc minus ; reste >= y?
-
- ; -> yes; reste -= y;
- mov a,reste0
- subb a,y0 ; carry is always clear here (jc)
- mov reste0,a
- mov a,reste1
- subb a,@r0 ; y1
- mov reste1,a
- mov a,reste2
- inc r0
- subb a,@r0 ; y2
- mov reste2,a
- mov a,reste3
- inc r0
- subb a,@r0 ; y3
- mov reste3,a
- dec r0
- dec r0
-
- orl x0,#1
-
- minus: djnz count,loop ; -> no
-
- exit: mov a,x3 ; prepare the return value
- ret
-
- _endasm ;
+lp0: mov a,x0 ; x <<= 1
+ add a,x0
+ mov x0,a
+ mov a,x1
+ rlc a
+ mov x1,a
+ mov a,x2
+ rlc a
+ mov x2,a
+ mov a,x3
+ rlc a
+ mov x3,a
+
+ jc in_lp
+ djnz count,lp0
+
+ sjmp exit
+
+loop: mov a,x0 ; x <<= 1
+ add a,x0
+ mov x0,a
+ mov a,x1
+ rlc a
+ mov x1,a
+ mov a,x2
+ rlc a
+ mov x2,a
+ mov a,x3
+ rlc a
+ mov x3,a
+
+in_lp: mov a,reste0 ; reste <<= 1
+ rlc a ; feed in carry
+ mov reste0,a
+ mov a,reste1
+ rlc a
+ mov reste1,a
+ mov a,reste2
+ rlc a
+ mov reste2,a
+ mov a,reste3
+ rlc a
+ mov reste3,a
+
+ mov a,reste0 ; reste - y
+ subb a,y0 ; carry is always clear here, because
+ ; reste <<= 1 never overflows
+ mov a,reste1
+ subb a,@r0 ; y1
+ mov a,reste2
+ inc r0
+ subb a,@r0 ; y2
+ mov a,reste3
+ inc r0
+ subb a,@r0 ; y3
+ dec r0
+ dec r0
+
+ jc minus ; reste >= y?
+
+ ; -> yes; reste -= y;
+ mov a,reste0
+ subb a,y0 ; carry is always clear here (jc)
+ mov reste0,a
+ mov a,reste1
+ subb a,@r0 ; y1
+ mov reste1,a
+ mov a,reste2
+ inc r0
+ subb a,@r0 ; y2
+ mov reste2,a
+ mov a,reste3
+ inc r0
+ subb a,@r0 ; y3
+ mov reste3,a
+ dec r0
+ dec r0
+
+ orl x0,#1
+
+minus: djnz count,loop ; -> no
+
+exit: mov a,x3 ; prepare the return value
+ ret
+
+ __endasm;
}
#else // _DIVULONG_ASM