| 1 | #ifndef VVS_STDLIB_HEAP |
| 2 | #define VVS_STDLIB_HEAP |
| 3 | |
| 4 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 5 | @ Description: |
| 6 | @ This function writes pattern into the memory locations: |
| 7 | @ startaddr -> startaddr+count |
| 8 | @ Call Stack: |
| 9 | @ pattern |
| 10 | @ startaddr |
| 11 | @ count <-- TOS |
| 12 | @ Return Stack: |
| 13 | @ <empty> |
| 14 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 15 | NSSVTTSSSN | Mark: 11000 (memset) |
| 16 | |
| 17 | @ Prepare the stack for computation. |
| 18 | @ Addr | Contents |
| 19 | @ 0 | count |
| 20 | @ 1 | startaddr |
| 21 | @ 2 | pattern |
| 22 | |
| 23 | SSSSN | PUSH 0 (ptr) |
| 24 | SNT | SWAP |
| 25 | TTS | STORE |
| 26 | SSSTN | PUSH 1 (ptr) |
| 27 | SNT | SWAP |
| 28 | TTS | STORE |
| 29 | SSSTSN | PUSH 2 (ptr) |
| 30 | SNT | SWAP |
| 31 | TTS | STORE |
| 32 | |
| 33 | @ Store pattern into one memory location on each pass through this loop. |
| 34 | NSSVSSSTTSSSSSSSSSSSN | Mark: 00011000 00000000 |
| 35 | SSSSN | PUSH 0 (ptr) |
| 36 | TTT | LOAD |
| 37 | SSSTN | PUSH 1 (ptr) |
| 38 | TTT | LOAD |
| 39 | TSSS | ADD |
| 40 | SSSTSN | PUSH 2 (ptr) |
| 41 | TTT | LOAD |
| 42 | TTS | STORE |
| 43 | |
| 44 | @ Decrement and check for loop end condition count == 0. |
| 45 | SSSSN | PUSH 0 (ptr) |
| 46 | TTT | LOAD |
| 47 | SNS | DUP |
| 48 | NTSSSSTTSSSSSSSSSSTN | BRZ > 00011000 00000001 |
| 49 | SSSTN | PUSH 1 |
| 50 | TSST | SUBTRACT |
| 51 | SSSSN | PUSH 0 (ptr) |
| 52 | SNT | SWAP |
| 53 | TTS | STORE |
| 54 | NSNSSSTTSSSSSSSSSSSN | JMP > 00011000 00000000 |
| 55 | |
| 56 | @ Clean up and return |
| 57 | NSSVSSSTTSSSSSSSSSSTN | Mark: 00011000 00000001 |
| 58 | SNN | DROP |
| 59 | NTN | RTS |
| 60 | |
| 61 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 62 | @ Description: |
| 63 | @ This function copies count+1 words from source to destination. |
| 64 | @ Call Stack: |
| 65 | @ source |
| 66 | @ destination |
| 67 | @ count <-- TOS |
| 68 | @ Return Stack: |
| 69 | @ <empty> |
| 70 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 71 | NSSVTTSSTN | Mark: 11001 (memcpy) |
| 72 | |
| 73 | @ Prepare the stack for computation. |
| 74 | @ Addr | Contents |
| 75 | @ 0 | count |
| 76 | @ 1 | destination |
| 77 | @ 2 | source |
| 78 | |
| 79 | SSSSN | PUSH 0 (ptr) |
| 80 | SNT | SWAP |
| 81 | TTS | STORE |
| 82 | SSSTN | PUSH 1 (ptr) |
| 83 | SNT | SWAP |
| 84 | TTS | STORE |
| 85 | SSSTSN | PUSH 2 (ptr) |
| 86 | SNT | SWAP |
| 87 | TTS | STORE |
| 88 | |
| 89 | @ Copy one word on each pass through this loop. |
| 90 | NSSVSSSTTSSTSSSSSSSSN | Mark: 00011001 00000000 |
| 91 | SSSTN | PUSH 1 (ptr) |
| 92 | TTT | LOAD |
| 93 | SSSSN | PUSH 0 (ptr) |
| 94 | TTT | LOAD |
| 95 | TSSS | ADD |
| 96 | SSSTSN | PUSH 2 (ptr) |
| 97 | TTT | LOAD |
| 98 | SSSSN | PUSH 0 (ptr) |
| 99 | TTT | LOAD |
| 100 | TSSS | ADD |
| 101 | TTT | LOAD |
| 102 | TTS | STORE |
| 103 | |
| 104 | @ Decrement and check for loop end conditions. |
| 105 | SSSSN | PUSH 0 (ptr) |
| 106 | TTT | LOAD |
| 107 | SNS | DUP |
| 108 | NTSSSSTTSSTSSSSSSSTN | BRZ > 00011001 00000001 |
| 109 | SSSTN | PUSH 1 |
| 110 | TSST | SUBTRACT |
| 111 | SSSSN | PUSH 0 (ptr) |
| 112 | SNT | SWAP |
| 113 | TTS | STORE |
| 114 | NSNSSSTTSSTSSSSSSSSN | JMP > 00011001 00000000 |
| 115 | |
| 116 | @ Clean up and return |
| 117 | NSSVSSSTTSSTSSSSSSSTN | Mark: 00011001 00000001 |
| 118 | SNN | DROP |
| 119 | NTN | RTS |
| 120 | |
| 121 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 122 | @ Description: |
| 123 | @ This function writes random words into the memory locations: |
| 124 | @ startaddr -> startaddr+count |
| 125 | @ Call Stack: |
| 126 | @ count |
| 127 | @ startaddr <-- TOS |
| 128 | @ Return Stack: |
| 129 | @ <empty> |
| 130 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 131 | NSSVTTSTSN | Mark: 11010 (memrand) |
| 132 | SSSSN | PUSH 0 (ptr) |
| 133 | SNT | SWAP |
| 134 | TTS | STORE |
| 135 | |
| 136 | @ Store random word into one memory location on each pass through this loop. |
| 137 | NSSVSSSTTSTSSSSSSSSSN | Mark: 00011010 00000000 |
| 138 | SNS | DUP |
| 139 | SSSSN | PUSH 0 (ptr) |
| 140 | TTT | LOAD |
| 141 | TSSS | ADD |
| 142 | NSTTSSSSN | JSR > 10000 (random) |
| 143 | TTS | STORE |
| 144 | |
| 145 | @ Decrement and check loop end conditions |
| 146 | SNS | DUP |
| 147 | NTSSSSTTSTSSSSSSSSTN | BRZ > 00011010 00000001 |
| 148 | SSSTN | PUSH 1 |
| 149 | TSST | SUBTRACT |
| 150 | NSNSSSTTSTSSSSSSSSSN | JMP > 00011010 00000000 |
| 151 | |
| 152 | @ Clean up and return |
| 153 | NSSVSSSTTSTSSSSSSSSTN | Mark: 00011010 00000001 |
| 154 | SNN | DROP |
| 155 | NTN | RTS |
| 156 | |
| 157 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 158 | @ Description: |
| 159 | @ This function compares two blocks of memory: |
| 160 | @ blk1ptr -> blk1ptr+count |
| 161 | @ -- versus -- |
| 162 | @ blk2ptr -> blk2ptr+count |
| 163 | @ The return value is zero if the blocks are identical, otherwise non-zero. |
| 164 | @ Call Stack: |
| 165 | @ count |
| 166 | @ blk1ptr |
| 167 | @ blk2ptr <-- TOS |
| 168 | @ Return Stack: |
| 169 | @ retvalue <-- TOS |
| 170 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 171 | NSSVTTSTTN | Mark: 11011 (memcmp) |
| 172 | |
| 173 | @ Prepare the stack for computation. |
| 174 | @ Addr | Contents |
| 175 | @ 0 | blk2ptr |
| 176 | @ 1 | blk1ptr |
| 177 | |
| 178 | SSSSN | PUSH 0 (ptr) |
| 179 | SNT | SWAP |
| 180 | TTS | STORE |
| 181 | SSSTN | PUSH 1 (ptr) |
| 182 | SNT | SWAP |
| 183 | TTS | STORE |
| 184 | |
| 185 | @ Compare one word on each pass through this loop. |
| 186 | NSSVSSSTTSTTSSSSSSSSN | Mark: 00011011 00000000 |
| 187 | SNS | DUP |
| 188 | SNS | DUP |
| 189 | SSSSN | PUSH 0 (ptr) |
| 190 | TTT | LOAD |
| 191 | TSSS | ADD |
| 192 | TTT | LOAD |
| 193 | SNT | SWAP |
| 194 | SSSTN | PUSH 1 (ptr) |
| 195 | TTT | LOAD |
| 196 | TSSS | ADD |
| 197 | TTT | LOAD |
| 198 | TSST | SUBTRACT |
| 199 | NTSSSSTTSTTSSSSSSTSN | BRZ > 00011011 00000010 (jump if words match) |
| 200 | |
| 201 | @ Return 'match? = false' |
| 202 | SNN | DROP |
| 203 | SSSTN | PUSH 1 |
| 204 | NTN | RTS |
| 205 | |
| 206 | @ Decrement and loop again if loop is not complete. |
| 207 | NSSVSSSTTSTTSSSSSSTSN | Mark: 00011011 00000010 |
| 208 | SNS | DUP |
| 209 | NTSSSSTTSTTSSSSSSSTN | BRZ > 00011011 00000001 (jump if loop is complete) |
| 210 | SSSTN | PUSH 1 |
| 211 | TSST | SUBTRACT |
| 212 | NSNSSSTTSTTSSSSSSSSN | JMP > 00011011 00000000 |
| 213 | |
| 214 | @ Return 'match? = true' |
| 215 | NSSVSSSTTSTTSSSSSSSTN | Mark: 00011011 00000001 |
| 216 | SNN | DROP |
| 217 | SSSSN | PUSH 0 |
| 218 | NTN | RTS |
| 219 | |
| 220 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 221 | @ Description: |
| 222 | @ This function searches the heap from address to address+count. |
| 223 | @ If pattern is found, the return value is a pointer to the matching word. |
| 224 | @ If not found, the return value is a null pointer. |
| 225 | @ Call Stack: |
| 226 | @ pattern |
| 227 | @ count |
| 228 | @ address <-- TOS |
| 229 | @ Return Stack: |
| 230 | @ pointer <-- TOS |
| 231 | @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ |
| 232 | NSSVTTTSSN | Mark: 11100 (memsrch) |
| 233 | |
| 234 | @ Prepare the stack for computation. |
| 235 | @ Stack: |
| 236 | @ offset <-- TOS |
| 237 | @ Addr | Contents |
| 238 | @ 0 | address |
| 239 | @ 1 | count |
| 240 | @ 2 | pattern |
| 241 | |
| 242 | SSSSN | PUSH 0 (ptr) |
| 243 | SNT | SWAP |
| 244 | TTS | STORE |
| 245 | SSSTN | PUSH 1 (ptr) |
| 246 | SNT | SWAP |
| 247 | TTS | STORE |
| 248 | SSSTSN | PUSH 2 (ptr) |
| 249 | SNT | SWAP |
| 250 | TTS | STORE |
| 251 | |
| 252 | @ Compare one word on each pass through this loop. |
| 253 | NSSVSSSTTTSSSSSSSSSSN | Mark: 00011100 00000000 |
| 254 | SNS | DUP |
| 255 | SSSSN | PUSH 0 (ptr) |
| 256 | TTT | LOAD |
| 257 | TSSS | ADD |
| 258 | TTT | LOAD |
| 259 | SSSTSN | PUSH 2 (ptr) |
| 260 | TTT | LOAD |
| 261 | TSST | SUBTRACT |
| 262 | NTSSSSTTTSSSSSSSSSTN | BRZ > 00011100 00000001 |
| 263 | SNS | DUP |
| 264 | SSSTN | PUSH 1 (ptr) |
| 265 | TTT | LOAD |
| 266 | TSST | SUBTRACT |
| 267 | NTSSSSTTTSSSSSSSSTSN | BRZ > 00011100 00000010 |
| 268 | SSSTN | PUSH 1 |
| 269 | TSSS | ADD |
| 270 | NSNSSSTTTSSSSSSSSSSN | JMP > 00011100 00000000 |
| 271 | |
| 272 | @ Found a match. Clean up and return. |
| 273 | NSSVSSSTTTSSSSSSSSSTN | Mark: 00011100 00000001 |
| 274 | SSSSN | PUSH 0 (ptr) |
| 275 | TTT | LOAD |
| 276 | TSSS | ADD |
| 277 | NTN | RTS |
| 278 | |
| 279 | @ No match found. Clean up and return. |
| 280 | NSSVSSSTTTSSSSSSSSTSN | Mark: 00011100 00000010 |
| 281 | SNN | DROP |
| 282 | SSSSN | PUSH 0 |
| 283 | NTN | RTS |
| 284 | |
| 285 | #include <math.pvvs> |
| 286 | |
| 287 | #endif |