mirror of
https://github.com/hsoft/collapseos.git
synced 2025-04-06 07:18:40 +10:00
67adc6fcfc
Now instead of skipping leading zeroes, the first digit is loaded directly into hl without first multiplying by 10. This means the first loop is skipped in the overhead, making the method 2-3 times faster overall, and is now faster for the more common fewer digit cases too. The number of bytes is exactly the same, and the inner loop is slightly faster too thanks to no longer needing to load a into c. To be more precise about the speed increase over the current code, for decimals of length 1 it'll be 3.18x faster, for decimals of length 2, 2.50x faster, for length 3, 2.31x faster, for length 4, 2.22x faster, and for length 5 and above, at least 2.03x faster. In terms of cycles, this is around 100+(132*length) cycles saved per decimal. |
||
|---|---|---|
| .. | ||
| parse.asm | ||
| README.md | ||
| util.asm | ||
Common code used by more than one app, but not by the kernel.