Commit | Line | Data |
---|---|---|
48f88489 AT |
1 | @ (c) 2020 Aaron Taylor <ataylor at subgeniuskitty dot com> |
2 | @ See LICENSE.txt file for copyright and license details. | |
3 | ||
3625ff3a AT |
4 | #ifndef VVS_STDLIB_MATH |
5 | #define VVS_STDLIB_MATH | |
6 | ||
2612f47f | 7 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
bb21580a AT |
8 | @ Name: |
9 | @ random (10000) | |
2612f47f | 10 | @ Description: |
f969012f DNR |
11 | @ Returns a pseudo-random number. |
12 | @ Before using for the first time, seed heap[0] with a non-zero value. | |
13 | @ This PRNG was taken from: https://en.wikipedia.org/wiki/Xorshift | |
2612f47f AT |
14 | @ Call Stack: |
15 | @ empty | |
16 | @ Return Stack: | |
17 | @ random number <-- TOS | |
18 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ | |
f969012f | 19 | #include <logic.pvvs> |
2612f47f | 20 | NSSVTSSSSN | Mark: 10000 (random) |
b15f1da5 | 21 | |
f969012f | 22 | @ Fetch seed from heap[0]. |
b15f1da5 AT |
23 | SSSSN | PUSH 0 (ptr) |
24 | TTT | LOAD | |
b15f1da5 | 25 | |
f969012f DNR |
26 | @ Set TOS ^= TOS << 13 |
27 | SNS | DUP | |
28 | SSSTTSTN | PUSH +13 | |
29 | NSTTSTTSTN | JSR > 101101 (lshift) | |
30 | NSTTSTSTTN | JSR > 101011 (xor) | |
31 | ||
32 | @ Set TOS ^= TOS >> 7 | |
33 | SNS | DUP | |
34 | SSSTTTN | PUSH +7 | |
35 | NSTTSTTSSN | JSR > 101100 (rshift) | |
36 | NSTTSTSTTN | JSR > 101011 (xor) | |
37 | ||
38 | @ Set TOS ^= TOS << 17 | |
39 | SNS | DUP | |
40 | SSSTSSSTN | PUSH +17 | |
41 | NSTTSTTSTN | JSR > 101101 (lshift) | |
42 | NSTTSTSTTN | JSR > 101011 (xor) | |
43 | ||
44 | @ Store a copy of the new seed at heap[0] and return. | |
b15f1da5 AT |
45 | SNS | DUP |
46 | SSSSN | PUSH 0 (ptr) | |
47 | SNT | SWAP | |
48 | TTS | STORE | |
2612f47f AT |
49 | NTN | RTS |
50 | ||
d5a0b337 AT |
51 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
52 | @ Name: | |
53 | @ fastrand (10011) | |
54 | @ Description: | |
55 | @ Returns a pseudo-random number. | |
27c76338 | 56 | @ Probably not as good as `random`, but much faster since it does not use XOR. |
d5a0b337 AT |
57 | @ Based on the POSIX.1-2001 example for random(). |
58 | @ Before using for the first time, seed heap[0] with a value. | |
59 | @ Call Stack: | |
60 | @ empty | |
61 | @ Return Stack: | |
62 | @ random number <-- TOS | |
63 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ | |
64 | NSSVTSSTTN | Mark: 10011 (fastrand) | |
65 | ||
66 | @ Generate the next seed value | |
67 | SSSSN | PUSH 0 (ptr) | |
68 | TTT | LOAD | |
69 | SSSTSSSSSTTTSSSTTSSTSSTTTSSTTSTTSTN | PUSH 1103515245 | |
70 | TSSN | MULTIPLY | |
71 | SSSTTSSSSSSTTTSSTN | PUSH 12345 | |
72 | TSSS | ADD | |
73 | ||
74 | @ Store the next seed value but keep a copy on the stack. | |
75 | SNS | DUP | |
76 | SSSSN | PUSH 0 (ptr) | |
77 | SNT | SWAP | |
78 | TTS | STORE | |
79 | ||
80 | @ Calculate the random number and return. | |
81 | SSSTSSSSSSSSSSSSSSSSN | PUSH 65536 | |
82 | TSTS | DIVIDE | |
83 | SSSTSSSSSSSSSSSSSSSN | PUSH 32768 | |
84 | TSTT | MODULO | |
85 | NTN | RTS | |
86 | ||
3625ff3a | 87 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
bb21580a AT |
88 | @ Name: |
89 | @ abs (10001) | |
3625ff3a | 90 | @ Description: |
bb21580a | 91 | @ Returns the absolute value of its argument |
3625ff3a AT |
92 | @ Call Stack: |
93 | @ signed number <-- TOS | |
94 | @ Return Stack: | |
95 | @ abs(signed number) <-- TOS | |
96 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ | |
97 | NSSVTSSSTN | Mark: 10001 (absolute value) | |
7359501c AT |
98 | |
99 | @ Catch -(2^63) as a special case since its absolute value will overflow | |
100 | @ a twos-complement 64-bit word. Return zero as though the absolute value | |
101 | @ overflowed to the bottom of the non-negative integers rather than | |
102 | @ overflowing back to the most negative integer. | |
103 | SNS | DUP | |
104 | SSTTSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSN | -(2^63) | |
105 | TSST | SUBTRACT | |
106 | NTSSSSTSSSTSSSSSSTSN | BRZ > 00010001 00000010 | |
107 | ||
108 | @ Handle all the other numbers. | |
3625ff3a AT |
109 | SNS | DUP |
110 | NTTSSSTSSSTSSSSSSSSN | BMI > 00010001 00000000 | |
111 | NSNSSSTSSSTSSSSSSSTN | JMP > 00010001 00000001 | |
112 | NSSVSSSTSSSTSSSSSSSSN | Mark: 00010001 00000000 | |
113 | SSTTN | PUSH -1 | |
114 | TSSN | MULTIPLY | |
115 | NSSVSSSTSSSTSSSSSSSTN | Mark: 00010001 00000001 | |
116 | NTN | RTS | |
117 | ||
7359501c AT |
118 | @ Special case: Push 0 and return. |
119 | NSSVSSSTSSSTSSSSSSTSN | Mark: 00010001 00000010 | |
120 | SNN | DROP | |
121 | SSSSN | PUSH 0 | |
122 | NTN | RTS | |
123 | ||
37372ed0 AT |
124 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
125 | @ Name: | |
126 | @ gcd (10010) | |
127 | @ Description: | |
128 | @ Returns greatest common divisor of X and Y. | |
129 | @ Call Stack: | |
130 | @ Y | |
131 | @ X <-- TOS | |
132 | @ Return Stack: | |
133 | @ gcd(X,Y) <-- TOS | |
134 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ | |
135 | #include <stack.pvvs> | |
136 | NSSVTSSTSN | Mark: 10010 (gcd) | |
137 | ||
138 | @ Since 1 > -1, transform problem into gcd(abs(X),abs(Y)). | |
139 | SNT | SWAP | |
140 | NSTTSSSTN | JSR > 10001 (abs) | |
141 | SNT | SWAP | |
142 | NSTTSSSTN | JSR > 10001 (abs) | |
143 | ||
144 | @ Verify neither operand is zero. | |
145 | SNT | SWAP | |
146 | SNS | DUP | |
147 | NTSSSSTSSTSSSSSSSSSN | BRZ > 00010010 00000000 (gcd:zero input) | |
148 | SNT | SWAP | |
149 | SNS | DUP | |
150 | NTSSSSTSSTSSSSSSSSSN | BRZ > 00010010 00000000 (gcd:zero input) | |
151 | ||
152 | @ Verify X != Y and sort X,Y so the smaller is TOS. | |
153 | SNS | DUP | |
154 | SSSTTN | PUSH 3 | |
155 | NSTTTSSN | JSR > 1100 (deepdup) | |
156 | SNT | SWAP | |
157 | TSST | SUBTRACT | |
158 | @ TOS> Y-X, X, Y | |
159 | NTTSSSTSSTSSSSSSSSTN | BMI > 00010010 00000001 (gcd:swap inputs) | |
160 | NSNSSSTSSTSSSSSSSTSN | JMP > 00010010 00000010 (gcd:main loop) | |
161 | NSSVSSSTSSTSSSSSSSSTN | MARK: 00010010 00000001 (gcd:swap inputs) | |
162 | SNT | SWAP | |
163 | ||
164 | @ Main gcd loop. | |
165 | @ Euclidean algorithm. | |
166 | NSSVSSSTSSTSSSSSSSTSN | MARK: 00010010 00000010 (gcd:main loop) | |
167 | SNS | DUP | |
168 | SSSTTN | PUSH 3 | |
169 | NSTTSTSN | JSR > 1010 (stackrotate) | |
170 | TSTT | MODULO | |
171 | SNS | DUP | |
172 | NTSSSSTSSTSSSSSSSTTN | BRZ > 00010010 00000011 (gcd:loop termination) | |
173 | NSNSSSTSSTSSSSSSSTSN | JMP > 00010010 00000010 (gcd:main loop) | |
174 | NSSVSSSTSSTSSSSSSSTTN | MARK: 00010010 00000011 (gcd:loop termination) | |
175 | SNN | DROP | |
176 | NTN | RTS | |
177 | ||
178 | @ At least one operand was zero. | |
179 | @ Since we define gcd(a,0) = a, return the other operand. | |
180 | NSSVSSSTSSTSSSSSSSSSN | MARK: 00010010 00000000 (gcd:zero input) | |
181 | SNN | DROP | |
182 | NTN | RTS | |
183 | ||
3625ff3a | 184 | #endif |