| 1 | #ifndef VVS_STDLIB_MATH |
| 2 | #define VVS_STDLIB_MATH |
| 3 | |
| 4 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 5 | @ Name: |
| 6 | @ random (10000) |
| 7 | @ Description: |
| 8 | @ Returns a kinda-random number. |
| 9 | @ Before using for the first time, seed heap[0] with a value. |
| 10 | @ Call Stack: |
| 11 | @ empty |
| 12 | @ Return Stack: |
| 13 | @ random number <-- TOS |
| 14 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 15 | NSSVTSSSSN | Mark: 10000 (random) |
| 16 | |
| 17 | @ Generate the next seed value |
| 18 | SSSSN | PUSH 0 (ptr) |
| 19 | TTT | LOAD |
| 20 | SSSTSSSSSTTTSSSTTSSTSSTTTSSTTSTTSTN | PUSH 1103515245 |
| 21 | TSSN | MULTIPLY |
| 22 | SSSTTSSSSSSTTTSSTN | PUSH 12345 |
| 23 | TSSS | ADD |
| 24 | |
| 25 | @ Store the next seed value but keep a copy on the stack. |
| 26 | SNS | DUP |
| 27 | SSSSN | PUSH 0 (ptr) |
| 28 | SNT | SWAP |
| 29 | TTS | STORE |
| 30 | |
| 31 | @ Calculate the random number and return. |
| 32 | SSSTSSSSSSSSSSSSSSSSN | PUSH 65536 |
| 33 | TSTS | DIVIDE |
| 34 | SSSTSSSSSSSSSSSSSSSN | PUSH 32768 |
| 35 | TSTT | MODULO |
| 36 | NTN | RTS |
| 37 | |
| 38 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 39 | @ Name: |
| 40 | @ abs (10001) |
| 41 | @ Description: |
| 42 | @ Returns the absolute value of its argument |
| 43 | @ Call Stack: |
| 44 | @ signed number <-- TOS |
| 45 | @ Return Stack: |
| 46 | @ abs(signed number) <-- TOS |
| 47 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 48 | NSSVTSSSTN | Mark: 10001 (absolute value) |
| 49 | |
| 50 | @ Catch -(2^63) as a special case since its absolute value will overflow |
| 51 | @ a twos-complement 64-bit word. Return zero as though the absolute value |
| 52 | @ overflowed to the bottom of the non-negative integers rather than |
| 53 | @ overflowing back to the most negative integer. |
| 54 | SNS | DUP |
| 55 | SSTTSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSN | -(2^63) |
| 56 | TSST | SUBTRACT |
| 57 | NTSSSSTSSSTSSSSSSTSN | BRZ > 00010001 00000010 |
| 58 | |
| 59 | @ Handle all the other numbers. |
| 60 | SNS | DUP |
| 61 | NTTSSSTSSSTSSSSSSSSN | BMI > 00010001 00000000 |
| 62 | NSNSSSTSSSTSSSSSSSTN | JMP > 00010001 00000001 |
| 63 | NSSVSSSTSSSTSSSSSSSSN | Mark: 00010001 00000000 |
| 64 | SSTTN | PUSH -1 |
| 65 | TSSN | MULTIPLY |
| 66 | NSSVSSSTSSSTSSSSSSSTN | Mark: 00010001 00000001 |
| 67 | NTN | RTS |
| 68 | |
| 69 | @ Special case: Push 0 and return. |
| 70 | NSSVSSSTSSSTSSSSSSTSN | Mark: 00010001 00000010 |
| 71 | SNN | DROP |
| 72 | SSSSN | PUSH 0 |
| 73 | NTN | RTS |
| 74 | |
| 75 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 76 | @ Name: |
| 77 | @ gcd (10010) |
| 78 | @ Description: |
| 79 | @ Returns greatest common divisor of X and Y. |
| 80 | @ Call Stack: |
| 81 | @ Y |
| 82 | @ X <-- TOS |
| 83 | @ Return Stack: |
| 84 | @ gcd(X,Y) <-- TOS |
| 85 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 86 | #include <stack.pvvs> |
| 87 | NSSVTSSTSN | Mark: 10010 (gcd) |
| 88 | |
| 89 | @ Since 1 > -1, transform problem into gcd(abs(X),abs(Y)). |
| 90 | SNT | SWAP |
| 91 | NSTTSSSTN | JSR > 10001 (abs) |
| 92 | SNT | SWAP |
| 93 | NSTTSSSTN | JSR > 10001 (abs) |
| 94 | |
| 95 | @ Verify neither operand is zero. |
| 96 | SNT | SWAP |
| 97 | SNS | DUP |
| 98 | NTSSSSTSSTSSSSSSSSSN | BRZ > 00010010 00000000 (gcd:zero input) |
| 99 | SNT | SWAP |
| 100 | SNS | DUP |
| 101 | NTSSSSTSSTSSSSSSSSSN | BRZ > 00010010 00000000 (gcd:zero input) |
| 102 | |
| 103 | @ Verify X != Y and sort X,Y so the smaller is TOS. |
| 104 | SNS | DUP |
| 105 | SSSTTN | PUSH 3 |
| 106 | NSTTTSSN | JSR > 1100 (deepdup) |
| 107 | SNT | SWAP |
| 108 | TSST | SUBTRACT |
| 109 | @ TOS> Y-X, X, Y |
| 110 | NTTSSSTSSTSSSSSSSSTN | BMI > 00010010 00000001 (gcd:swap inputs) |
| 111 | NSNSSSTSSTSSSSSSSTSN | JMP > 00010010 00000010 (gcd:main loop) |
| 112 | NSSVSSSTSSTSSSSSSSSTN | MARK: 00010010 00000001 (gcd:swap inputs) |
| 113 | SNT | SWAP |
| 114 | |
| 115 | @ Main gcd loop. |
| 116 | @ Euclidean algorithm. |
| 117 | NSSVSSSTSSTSSSSSSSTSN | MARK: 00010010 00000010 (gcd:main loop) |
| 118 | SNS | DUP |
| 119 | SSSTTN | PUSH 3 |
| 120 | NSTTSTSN | JSR > 1010 (stackrotate) |
| 121 | TSTT | MODULO |
| 122 | SNS | DUP |
| 123 | NTSSSSTSSTSSSSSSSTTN | BRZ > 00010010 00000011 (gcd:loop termination) |
| 124 | NSNSSSTSSTSSSSSSSTSN | JMP > 00010010 00000010 (gcd:main loop) |
| 125 | NSSVSSSTSSTSSSSSSSTTN | MARK: 00010010 00000011 (gcd:loop termination) |
| 126 | SNN | DROP |
| 127 | NTN | RTS |
| 128 | |
| 129 | @ At least one operand was zero. |
| 130 | @ Since we define gcd(a,0) = a, return the other operand. |
| 131 | NSSVSSSTSSTSSSSSSSSSN | MARK: 00010010 00000000 (gcd:zero input) |
| 132 | SNN | DROP |
| 133 | NTN | RTS |
| 134 | |
| 135 | #endif |