about summary refs log tree commit diff stats
path: root/subx/052kernel-string-equal.subx
Commit message (Collapse)AuthorAgeFilesLines
* 5102Kartik Agaram2019-04-161-2/+2
|
* 5084Kartik Agaram2019-04-111-1/+1
|
* 5037Kartik Agaram2019-03-291-2/+2
|
* 5011Kartik Agaram2019-03-201-1/+1
| | | | | | | New convention: compare 'with' for asymmetric comparisons (greater or lesser than), and compare 'and' for symmetric comparisons. Worth making this distinction even though the opcodes are identical; when we compare 'with', the order of operands is significant.
* 4981 - no, go back to 3 phasesKartik Agaram2019-02-181-1/+1
| | | | | | | | | | | | | Considering how much trouble a merge phase would be (commit 4978), it seems simpler to just add the extra syntax for controlling the entry point of the generated ELF binary. But I wouldn't have noticed this if I hadn't taken the time to write out the commit messages of 4976 and 4978. Even if we happened to already have linked list primitives built, this may still be a good idea considering that I'm saving quite a lot of code in duplicated entrypoints.
* 4963Kartik Agaram2019-02-141-3/+3
|
* 4961Kartik Agaram2019-02-141-23/+31
|
* 4933Kartik Agaram2019-01-161-26/+26
|
* 4916Kartik Agaram2019-01-101-11/+11
| | | | | In the process of building slice primitives I found an out-of-bounds access in write-byte.
* 4911Kartik Agaram2019-01-061-10/+9
|
* 4901Kartik Agaram2019-01-031-0/+260