mirror of https://github.com/irmen/prog8.git
67 lines
1.6 KiB
Lua
67 lines
1.6 KiB
Lua
%import textio
|
|
%import test_stack
|
|
%zeropage basicsafe
|
|
%zpreserved 50,80
|
|
%zpreserved 150,155
|
|
%address $4000
|
|
|
|
; Note: this program is compatible with C64 and CX16.
|
|
%option align_word
|
|
|
|
main {
|
|
%option align_word
|
|
|
|
ubyte[256] sieve
|
|
ubyte candidate_prime = 2 ; is increased in the loop
|
|
|
|
sub start() {
|
|
sys.memset(sieve, 256, false) ; clear the sieve, to reset starting situation on subsequent runs
|
|
|
|
%breakpoint
|
|
%asmbinary "LICENSE", 10 ,1
|
|
|
|
|
|
; calculate primes
|
|
txt.print("prime numbers up to 255:\n\n")
|
|
ubyte amount=0
|
|
repeat {
|
|
ubyte prime = find_next_prime()
|
|
if prime==0
|
|
break
|
|
txt.print_ub(prime)
|
|
txt.print(", ")
|
|
amount++
|
|
}
|
|
txt.nl()
|
|
txt.print("number of primes (expected 54): ")
|
|
txt.print_ub(amount)
|
|
txt.nl()
|
|
|
|
uword[] @shared array = [111,222,333,444,555]
|
|
|
|
amount = amount |> sin8u() |> cos8u() |> sin8u()
|
|
|
|
; test_stack.test()
|
|
}
|
|
|
|
sub find_next_prime() -> ubyte {
|
|
|
|
while sieve[candidate_prime] {
|
|
candidate_prime++
|
|
if candidate_prime==0
|
|
return 0 ; we wrapped; no more primes available in the sieve
|
|
}
|
|
|
|
; found next one, mark the multiples and return it.
|
|
sieve[candidate_prime] = true
|
|
uword multiple = candidate_prime
|
|
|
|
|
|
while multiple < len(sieve) {
|
|
sieve[lsb(multiple)] = true
|
|
multiple += candidate_prime
|
|
}
|
|
return candidate_prime
|
|
}
|
|
}
|