mirror of
https://gitlab.com/freepascal.org/fpc/source.git
synced 2025-08-20 09:49:08 +02:00
- Split division routines out into an include file.
- Reuse division routines for calculating both division and modulus. - Add implementations of BsfByte and BsrByte that don't use a lookup table. git-svn-id: trunk@42494 -
This commit is contained in:
Jeppe Johansen
parent
ff3372567f
commit
4b93eb64b3
1
.gitattributes
vendored
1
.gitattributes
vendored
@ -8975,6 +8975,7 @@ rtl/atari/xbios.inc svneol=native#text/plain
|
|||||||
rtl/avr/avr.inc svneol=native#text/plain
|
rtl/avr/avr.inc svneol=native#text/plain
|
||||||
rtl/avr/cpuh.inc svneol=native#text/plain
|
rtl/avr/cpuh.inc svneol=native#text/plain
|
||||||
rtl/avr/cpuinnr.inc svneol=native#text/plain
|
rtl/avr/cpuinnr.inc svneol=native#text/plain
|
||||||
|
rtl/avr/divide.inc svneol=native#text/plain
|
||||||
rtl/avr/int64p.inc svneol=native#text/plain
|
rtl/avr/int64p.inc svneol=native#text/plain
|
||||||
rtl/avr/intrinsics.pp svneol=native#text/pascal
|
rtl/avr/intrinsics.pp svneol=native#text/pascal
|
||||||
rtl/avr/makefile.cpu svneol=native#text/plain
|
rtl/avr/makefile.cpu svneol=native#text/plain
|
||||||
|
|||||||
137
rtl/avr/divide.inc
Normal file
137
rtl/avr/divide.inc
Normal file
@ -0,0 +1,137 @@
|
|||||||
|
// Based on restoring division algorithm
|
||||||
|
// Algorithm source document: Lecture notes by S. Galal and D. Pham, Division algorithms and hardware implementations.
|
||||||
|
// Link to documentation http://www.seas.ucla.edu/~ingrid/ee213a/lectures/division_presentV2.pdf
|
||||||
|
// Also refer to description on Wikipedia: https://en.wikipedia.org/wiki/Division_algorithm#Restoring_division
|
||||||
|
|
||||||
|
// Note that the algorithm automatically yields the following results for special cases:
|
||||||
|
// z div 0 = MAX(type)
|
||||||
|
// 0 div 0 = MAX(type)
|
||||||
|
// 0 div n = 0
|
||||||
|
// Checks for z = 0; n = [0,1]; n = z and n > z could shortcut the algorithm for speed-ups
|
||||||
|
// but would add extra code
|
||||||
|
// Perhaps add the checks depending on optimization settings?
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_divmod_byte(n, z: byte): byte; assembler; nostackframe;
|
||||||
|
label
|
||||||
|
div1, div2, div3, finish;
|
||||||
|
asm
|
||||||
|
// Symbol Name Register(s)
|
||||||
|
// z (A) dividend R22
|
||||||
|
// n (B) divisor R24
|
||||||
|
// p (P) remainder R20
|
||||||
|
// i counter R18
|
||||||
|
clr R20 // clear remainder
|
||||||
|
ldi R18, 8 // iterate over 8 bits
|
||||||
|
|
||||||
|
div1:
|
||||||
|
lsl R22 // shift left A
|
||||||
|
rol R20 // shift left P with carry from A shift
|
||||||
|
sub R20, R24 // Subtract B from P, P <= P - B
|
||||||
|
brlo div2
|
||||||
|
ori R22, 1 // Set A[0] = 1
|
||||||
|
rjmp div3
|
||||||
|
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
||||||
|
add R20, R24 // restore old value of P
|
||||||
|
|
||||||
|
div3:
|
||||||
|
dec R18
|
||||||
|
brne div1
|
||||||
|
|
||||||
|
finish:
|
||||||
|
mov R24, R22 // Move result from R22 to R24
|
||||||
|
end;
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_divmod_word(n, z: word): word; assembler; nostackframe;
|
||||||
|
label
|
||||||
|
div1, div2, div3, finish;
|
||||||
|
asm
|
||||||
|
// Symbol Name Register(s)
|
||||||
|
// z (A) dividend R23, R22
|
||||||
|
// n (B) divisor R25, R24
|
||||||
|
// p (P) remainder R21, R20
|
||||||
|
// i counter R18
|
||||||
|
|
||||||
|
clr R20 // clear remainder low
|
||||||
|
clr R21 // clear remainder hi
|
||||||
|
ldi R18, 16 // iterate over 16 bits
|
||||||
|
|
||||||
|
div1:
|
||||||
|
lsl R22 // shift left A_L
|
||||||
|
rol R23
|
||||||
|
rol R20 // shift left P with carry from A shift
|
||||||
|
rol R21
|
||||||
|
sub R20, R24 // Subtract B from P, P <= P - B
|
||||||
|
sbc R21, R25
|
||||||
|
brlo div2
|
||||||
|
ori R22, 1 // Set A[0] = 1
|
||||||
|
rjmp div3
|
||||||
|
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
||||||
|
add R20, R24 // restore old value of P
|
||||||
|
adc R21, R25
|
||||||
|
|
||||||
|
div3:
|
||||||
|
dec R18
|
||||||
|
brne div1
|
||||||
|
|
||||||
|
finish:
|
||||||
|
movw R24, R22 // Move result from R22:R23 to R24:R25
|
||||||
|
end;
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_divmod_dword(n, z: dword): dword; assembler; nostackframe;
|
||||||
|
label
|
||||||
|
div1, div2, div3, finish;
|
||||||
|
asm
|
||||||
|
// Symbol Name Register(s)
|
||||||
|
// z (A) dividend R21, R20, R19, R18
|
||||||
|
// n (B) divisor R25, R24, R23, R22
|
||||||
|
// p (P) remainder R17, R16, R15, R14 -> Returned in R25, R24, R23, R22
|
||||||
|
// i counter R26
|
||||||
|
push R17
|
||||||
|
push R16
|
||||||
|
push R15
|
||||||
|
push R14
|
||||||
|
|
||||||
|
clr R14 // clear remainder
|
||||||
|
clr R15 // clear remainder
|
||||||
|
clr R16
|
||||||
|
clr R17
|
||||||
|
ldi R26, 32 // iterate over 32 bits
|
||||||
|
|
||||||
|
div1:
|
||||||
|
lsl R18 // shift left A_L
|
||||||
|
rol R19
|
||||||
|
rol R20
|
||||||
|
rol R21
|
||||||
|
rol R14 // shift left P with carry from A shift
|
||||||
|
rol R15
|
||||||
|
rol R16
|
||||||
|
rol R17
|
||||||
|
sub R14, R22 // Subtract B from P, P <= P - B
|
||||||
|
sbc R15, R23
|
||||||
|
sbc R16, R24
|
||||||
|
sbc R17, R25
|
||||||
|
brlo div2
|
||||||
|
ori R18, 1 // Set A[0] = 1
|
||||||
|
rjmp div3
|
||||||
|
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
||||||
|
add R14, R22 // restore old value of P
|
||||||
|
adc R15, R23
|
||||||
|
adc R16, R24
|
||||||
|
adc R17, R25
|
||||||
|
|
||||||
|
div3:
|
||||||
|
dec R26
|
||||||
|
brne div1
|
||||||
|
|
||||||
|
finish:
|
||||||
|
movw R22, R14 // Move remainder into reg that is not volatile
|
||||||
|
movw R24, R16
|
||||||
|
|
||||||
|
pop R14
|
||||||
|
pop R15
|
||||||
|
pop R16
|
||||||
|
pop R17
|
||||||
|
end;
|
||||||
341
rtl/avr/math.inc
341
rtl/avr/math.inc
@ -14,81 +14,31 @@
|
|||||||
|
|
||||||
**********************************************************************}
|
**********************************************************************}
|
||||||
|
|
||||||
// Based on restoring division algorithm
|
{$i divide.inc}
|
||||||
// Algorithm source document: Lecture notes by S. Galal and D. Pham, Division algorithms and hardware implementations.
|
|
||||||
// Link to documentation http://www.seas.ucla.edu/~ingrid/ee213a/lectures/division_presentV2.pdf
|
|
||||||
// Also refer to description on Wikipedia: https://en.wikipedia.org/wiki/Division_algorithm#Restoring_division
|
|
||||||
|
|
||||||
// Note that the algorithm automatically yields the following results for special cases:
|
|
||||||
// z div 0 = MAX(type)
|
|
||||||
// 0 div 0 = MAX(type)
|
|
||||||
// 0 div n = 0
|
|
||||||
// Checks for z = 0; n = [0,1]; n = z and n > z could shortcut the algorithm for speed-ups
|
|
||||||
// but would add extra code
|
|
||||||
// Perhaps add the checks depending on optimization settings?
|
|
||||||
|
|
||||||
// z (dividend) = q(quotient) x n(divisor) + p(remainder)
|
|
||||||
|
|
||||||
{$ifndef FPC_SYSTEM_HAS_DIV_BYTE}
|
{$ifndef FPC_SYSTEM_HAS_DIV_BYTE}
|
||||||
{$define FPC_SYSTEM_HAS_DIV_BYTE}
|
{$define FPC_SYSTEM_HAS_DIV_BYTE}
|
||||||
|
|
||||||
|
// z (dividend) = q(quotient) x n(divisor) + p(remainder)
|
||||||
|
|
||||||
// z in Ra, n in Rb, 0 in Rp
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
function fpc_div_byte(n, z: byte): byte; assembler; nostackframe;
|
function fpc_div_byte(n, z: byte): byte; assembler; nostackframe;
|
||||||
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_BYTE'];{$endif}
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_BYTE'];{$endif}
|
||||||
label
|
|
||||||
start, div1, div2, div3, finish;
|
|
||||||
asm
|
asm
|
||||||
// Symbol Name Register(s)
|
|
||||||
// z (A) dividend R22
|
|
||||||
// n (B) divisor R24
|
|
||||||
// p (P) remainder R20
|
|
||||||
// i counter R18
|
|
||||||
|
|
||||||
cp R24, R1
|
cp R24, R1
|
||||||
brne start
|
brne .LNonZero
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
call get_pc_addr
|
call fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
call fpc_divmod_byte
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
rcall get_pc_addr
|
rcall fpc_divbyzero
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
.LNonZero:
|
||||||
movw R20, R24
|
rcall fpc_divmod_byte
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call get_frame
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall get_frame
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
|
||||||
movw R18, R24
|
|
||||||
ldi R22, 200
|
|
||||||
clr R23
|
|
||||||
clr R24
|
|
||||||
clr R25
|
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call HandleErrorAddrFrameInd
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall HandleErrorAddrFrameInd
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
|
||||||
|
mov R24, R22
|
||||||
start:
|
|
||||||
clr R20 // clear remainder
|
|
||||||
ldi R18, 8 // iterate over 8 bits
|
|
||||||
|
|
||||||
div1:
|
|
||||||
lsl R22 // shift left A
|
|
||||||
rol R20 // shift left P with carry from A shift
|
|
||||||
sub R20, R24 // Subtract B from P, P <= P - B
|
|
||||||
brlo div2
|
|
||||||
ori R22, 1 // Set A[0] = 1
|
|
||||||
rjmp div3
|
|
||||||
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
|
||||||
add R20, R24 // restore old value of P
|
|
||||||
|
|
||||||
div3:
|
|
||||||
dec R18
|
|
||||||
brne div1
|
|
||||||
|
|
||||||
finish:
|
|
||||||
mov R24, R22 // Move result from R22 to R24
|
|
||||||
end;
|
end;
|
||||||
|
|
||||||
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
@ -97,70 +47,57 @@ function fpc_div_byte(n, z: byte): byte; external name 'FPC_DIV_BYTE';
|
|||||||
{$endif FPC_IS_SYSTEM}
|
{$endif FPC_IS_SYSTEM}
|
||||||
{$endif FPC_SYSTEM_HAS_DIV_BYTE}
|
{$endif FPC_SYSTEM_HAS_DIV_BYTE}
|
||||||
|
|
||||||
|
|
||||||
|
{$ifndef FPC_SYSTEM_HAS_MOD_BYTE}
|
||||||
|
{$define FPC_SYSTEM_HAS_MOD_BYTE}
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_mod_byte(n, z: byte): byte; assembler; nostackframe;
|
||||||
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_MOD_BYTE'];{$endif}
|
||||||
|
asm
|
||||||
|
cp R24, R1
|
||||||
|
brne .LNonZero
|
||||||
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
|
call fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
call fpc_divmod_byte
|
||||||
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
|
rcall fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
rcall fpc_divmod_byte
|
||||||
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
|
||||||
|
mov R24, R20
|
||||||
|
end;
|
||||||
|
|
||||||
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
|
{$ifdef FPC_IS_SYSTEM}
|
||||||
|
function fpc_mod_byte(n, z: byte): byte; external name 'FPC_MOD_BYTE';
|
||||||
|
{$endif FPC_IS_SYSTEM}
|
||||||
|
{$endif FPC_SYSTEM_HAS_MOD_BYTE}
|
||||||
|
|
||||||
|
|
||||||
{$ifndef FPC_SYSTEM_HAS_DIV_WORD}
|
{$ifndef FPC_SYSTEM_HAS_DIV_WORD}
|
||||||
{$define FPC_SYSTEM_HAS_DIV_WORD}
|
{$define FPC_SYSTEM_HAS_DIV_WORD}
|
||||||
|
|
||||||
// z in Ra, n in Rb, 0 in Rp
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
function fpc_div_word(n, z: word): word; assembler; nostackframe;
|
function fpc_div_word(n, z: word): word; assembler; nostackframe;
|
||||||
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_WORD'];{$endif}
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_WORD'];{$endif}
|
||||||
label
|
|
||||||
start, div1, div2, div3, finish;
|
|
||||||
asm
|
asm
|
||||||
// Symbol Name Register(s)
|
|
||||||
// z (A) dividend R23, R22
|
|
||||||
// n (B) divisor R25, R24
|
|
||||||
// p (P) remainder R21, R20
|
|
||||||
// i counter R18
|
|
||||||
|
|
||||||
cp R24, R1
|
cp R24, R1
|
||||||
brne start
|
cpc R25, R1
|
||||||
|
brne .LNonZero
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
call get_pc_addr
|
call fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
call fpc_divmod_word
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
rcall get_pc_addr
|
rcall fpc_divbyzero
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
.LNonZero:
|
||||||
movw R20, R24
|
rcall fpc_divmod_word
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call get_frame
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall get_frame
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
|
||||||
movw R18, R24
|
|
||||||
ldi R22, 200
|
|
||||||
clr R23
|
|
||||||
clr R24
|
|
||||||
clr R25
|
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call HandleErrorAddrFrameInd
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall HandleErrorAddrFrameInd
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
|
||||||
start: // Start of division...
|
movw R24, R22
|
||||||
clr R20 // clear remainder low
|
|
||||||
clr R21 // clear remainder hi
|
|
||||||
ldi R18, 16 // iterate over 16 bits
|
|
||||||
|
|
||||||
div1:
|
|
||||||
lsl R22 // shift left A_L
|
|
||||||
rol R23
|
|
||||||
rol R20 // shift left P with carry from A shift
|
|
||||||
rol R21
|
|
||||||
sub R20, R24 // Subtract B from P, P <= P - B
|
|
||||||
sbc R21, R25
|
|
||||||
brlo div2
|
|
||||||
ori R22, 1 // Set A[0] = 1
|
|
||||||
rjmp div3
|
|
||||||
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
|
||||||
add R20, R24 // restore old value of P
|
|
||||||
adc R21, R25
|
|
||||||
|
|
||||||
div3:
|
|
||||||
dec R18
|
|
||||||
brne div1
|
|
||||||
|
|
||||||
finish:
|
|
||||||
movw R24, R22 // Move result from R22:R23 to R24:R25
|
|
||||||
end;
|
end;
|
||||||
|
|
||||||
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
@ -170,95 +107,60 @@ function fpc_div_word(n, z: word): word; external name 'FPC_DIV_WORD';
|
|||||||
{$endif FPC_SYSTEM_HAS_DIV_WORD}
|
{$endif FPC_SYSTEM_HAS_DIV_WORD}
|
||||||
|
|
||||||
|
|
||||||
|
{$ifndef FPC_SYSTEM_HAS_MOD_WORD}
|
||||||
|
{$define FPC_SYSTEM_HAS_MOD_WORD}
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_mod_word(n, z: word): word; assembler; nostackframe;
|
||||||
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_MOD_WORD'];{$endif}
|
||||||
|
asm
|
||||||
|
cp R24, R1
|
||||||
|
cpc R25, R1
|
||||||
|
brne .LNonZero
|
||||||
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
|
call fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
call fpc_divmod_word
|
||||||
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
|
rcall fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
rcall fpc_divmod_word
|
||||||
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
|
||||||
|
movw R24, R20
|
||||||
|
end;
|
||||||
|
|
||||||
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
|
{$ifdef FPC_IS_SYSTEM}
|
||||||
|
function fpc_mod_word(n, z: word): word; external name 'FPC_MOD_WORD';
|
||||||
|
{$endif FPC_IS_SYSTEM}
|
||||||
|
{$endif FPC_SYSTEM_HAS_MOD_WORD}
|
||||||
|
|
||||||
|
|
||||||
{$ifndef FPC_SYSTEM_HAS_DIV_DWORD}
|
{$ifndef FPC_SYSTEM_HAS_DIV_DWORD}
|
||||||
{$define FPC_SYSTEM_HAS_DIV_DWORD}
|
{$define FPC_SYSTEM_HAS_DIV_DWORD}
|
||||||
|
|
||||||
// z in Ra, n in Rb, 0 in Rp
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
function fpc_div_dword(n, z: dword): dword; assembler; nostackframe;
|
function fpc_div_dword(n, z: dword): dword; assembler; nostackframe;
|
||||||
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_DWORD'];{$endif}
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_DIV_DWORD'];{$endif}
|
||||||
label
|
|
||||||
start, div1, div2, div3, finish;
|
|
||||||
asm
|
asm
|
||||||
// Symbol Name Register(s)
|
|
||||||
// z (A) dividend R21, R20, R19, R18
|
|
||||||
// n (B) divisor R25, R24, R23, R22
|
|
||||||
// p (P) remainder R17, R16, R15, R14
|
|
||||||
// i counter R26
|
|
||||||
|
|
||||||
cp R24, R1
|
cp R24, R1
|
||||||
cpc R25, R1
|
cpc R25, R1
|
||||||
cpc R22, R1
|
cpc R22, R1
|
||||||
cpc R23, R1
|
cpc R23, R1
|
||||||
brne .LNonZero
|
brne .LNonZero
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
call get_pc_addr
|
call fpc_divbyzero
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall get_pc_addr
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
|
||||||
movw R20, R24
|
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call get_frame
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall get_frame
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
|
||||||
movw R18, R24
|
|
||||||
ldi R22, 200
|
|
||||||
clr R23
|
|
||||||
clr R24
|
|
||||||
clr R25
|
|
||||||
{$ifdef CPUAVR_HAS_JMP_CALL}
|
|
||||||
call HandleErrorAddrFrameInd
|
|
||||||
{$else CPUAVR_HAS_JMP_CALL}
|
|
||||||
rcall HandleErrorAddrFrameInd
|
|
||||||
{$endif CPUAVR_HAS_JMP_CALL}
|
|
||||||
|
|
||||||
.LNonZero:
|
.LNonZero:
|
||||||
push R17
|
call fpc_divmod_dword
|
||||||
push R16
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
push R15
|
rcall fpc_divbyzero
|
||||||
push R14
|
.LNonZero:
|
||||||
|
rcall fpc_divmod_dword
|
||||||
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
|
||||||
start: // Start of division...
|
|
||||||
clr R14 // clear remainder
|
|
||||||
clr R15 // clear remainder
|
|
||||||
clr R16
|
|
||||||
clr R17
|
|
||||||
ldi R26, 32 // iterate over 32 bits
|
|
||||||
|
|
||||||
div1:
|
|
||||||
lsl R18 // shift left A_L
|
|
||||||
rol R19
|
|
||||||
rol R20
|
|
||||||
rol R21
|
|
||||||
rol R14 // shift left P with carry from A shift
|
|
||||||
rol R15
|
|
||||||
rol R16
|
|
||||||
rol R17
|
|
||||||
sub R14, R22 // Subtract B from P, P <= P - B
|
|
||||||
sbc R15, R23
|
|
||||||
sbc R16, R24
|
|
||||||
sbc R17, R25
|
|
||||||
brlo div2
|
|
||||||
ori R18, 1 // Set A[0] = 1
|
|
||||||
rjmp div3
|
|
||||||
div2: // negative branch, A[0] = 0 (default after shift), restore P
|
|
||||||
add R14, R22 // restore old value of P
|
|
||||||
adc R15, R23
|
|
||||||
adc R16, R24
|
|
||||||
adc R17, R25
|
|
||||||
|
|
||||||
div3:
|
|
||||||
dec R26
|
|
||||||
brne div1
|
|
||||||
|
|
||||||
finish:
|
|
||||||
movw R22, R18 // Move result from R18:R21 to R22:R25
|
movw R22, R18 // Move result from R18:R21 to R22:R25
|
||||||
movw R24, R20
|
movw R24, R20
|
||||||
|
|
||||||
pop R14
|
|
||||||
pop R15
|
|
||||||
pop R16
|
|
||||||
pop R17
|
|
||||||
end;
|
end;
|
||||||
|
|
||||||
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
@ -267,3 +169,72 @@ function fpc_div_dword(n, z: dword): dword; external name 'FPC_DIV_DWORD';
|
|||||||
{$endif FPC_IS_SYSTEM}
|
{$endif FPC_IS_SYSTEM}
|
||||||
{$endif FPC_SYSTEM_HAS_DIV_DWORD}
|
{$endif FPC_SYSTEM_HAS_DIV_DWORD}
|
||||||
|
|
||||||
|
|
||||||
|
{$ifndef FPC_SYSTEM_HAS_MOD_DWORD}
|
||||||
|
{$define FPC_SYSTEM_HAS_MOD_DWORD}
|
||||||
|
|
||||||
|
// z in Ra, n in Rb, 0 in Rp
|
||||||
|
function fpc_mod_dword(n, z: dword): dword; assembler; nostackframe;
|
||||||
|
{$ifdef FPC_IS_SYSTEM}[public,alias: 'FPC_MOD_DWORD'];{$endif}
|
||||||
|
asm
|
||||||
|
cp R24, R1
|
||||||
|
cpc R25, R1
|
||||||
|
cpc R22, R1
|
||||||
|
cpc R23, R1
|
||||||
|
brne .LNonZero
|
||||||
|
{$ifdef CPUAVR_HAS_JMP_CALL}
|
||||||
|
call fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
call fpc_divmod_dword
|
||||||
|
{$else CPUAVR_HAS_JMP_CALL}
|
||||||
|
rcall fpc_divbyzero
|
||||||
|
.LNonZero:
|
||||||
|
rcall fpc_divmod_dword
|
||||||
|
{$endif CPUAVR_HAS_JMP_CALL}
|
||||||
|
end;
|
||||||
|
|
||||||
|
{It is a compilerproc (systemh.inc), make an alias for internal use.}
|
||||||
|
{$ifdef FPC_IS_SYSTEM}
|
||||||
|
function fpc_mod_dword(n, z: dword): dword; external name 'FPC_MOD_DWORD';
|
||||||
|
{$endif FPC_IS_SYSTEM}
|
||||||
|
{$endif FPC_SYSTEM_HAS_MOD_DWORD}
|
||||||
|
|
||||||
|
|
||||||
|
{$ifndef FPC_SYSTEM_HAS_BSF_BYTE}
|
||||||
|
{$define FPC_SYSTEM_HAS_BSF_BYTE}
|
||||||
|
|
||||||
|
function BsfByte(Const AValue: Byte): Byte;
|
||||||
|
var
|
||||||
|
i, value: byte;
|
||||||
|
begin
|
||||||
|
Value:=AValue;
|
||||||
|
for i:=0 to 7 do
|
||||||
|
begin
|
||||||
|
if odd(Value) then
|
||||||
|
exit(i);
|
||||||
|
Value:=Value shr 1;
|
||||||
|
end;
|
||||||
|
result:=$FF;
|
||||||
|
end;
|
||||||
|
|
||||||
|
{$endif}
|
||||||
|
|
||||||
|
|
||||||
|
{$ifndef FPC_SYSTEM_HAS_BSR_BYTE}
|
||||||
|
{$define FPC_SYSTEM_HAS_BSR_BYTE}
|
||||||
|
|
||||||
|
function BsrByte(Const AValue: Byte): Byte;
|
||||||
|
var
|
||||||
|
i, value: byte;
|
||||||
|
begin
|
||||||
|
Value:=AValue;
|
||||||
|
for i:=0 to 7 do
|
||||||
|
begin
|
||||||
|
if (Value and $80)<>0 then
|
||||||
|
exit(i);
|
||||||
|
Value:=Value shl 1;
|
||||||
|
end;
|
||||||
|
result:=$FF;
|
||||||
|
end;
|
||||||
|
|
||||||
|
{$endif}
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user