about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
...
* 4069Kartik K. Agaram2017-10-157-221/+383
| | | | subx: unconditional 'jump'
* 4068Kartik K. Agaram2017-10-152-6/+6
|
* 4067Kartik K. Agaram2017-10-156-6/+184
| | | | subx: 'mov'
* 4066Kartik K. Agaram2017-10-144-4/+4
| | | | | | I spent a while spelunking into the code generated by C compilers before realizing that ignoring the order of arguments for 'cmp' instructions clarifies everything.
* 4065Kartik K. Agaram2017-10-146-0/+456
| | | | | | subx: 'compare' Hopefully I've implemented the 'sense' of comparisons right..
* 4064Kartik K. Agaram2017-10-149-519/+477
|
* 4063Kartik K. Agaram2017-10-144-8/+8
|
* 4062Kartik K. Agaram2017-10-135-252/+260
|
* 4061Kartik K. Agaram2017-10-134-18/+18
|
* 4060 - subx: correct stale ReadmeKartik K. Agaram2017-10-131-7/+1
|
* 4059Kartik K. Agaram2017-10-133-242/+609
|
* 4058Kartik K. Agaram2017-10-132-0/+38
|
* 4057Kartik K. Agaram2017-10-133-0/+111
|
* 4056Kartik K. Agaram2017-10-133-0/+111
| | | | subx: 'or'
* 4055Kartik K. Agaram2017-10-133-0/+105
| | | | subx: Implement 'and' for the addressing modes we've built so far.
* 4054Kartik K. Agaram2017-10-1210-371/+375
|
* 4053Kartik K. Agaram2017-10-124-10/+10
|
* 4052Kartik K. Agaram2017-10-1210-140/+1949
|
* 4051Kartik K. Agaram2017-10-123-74/+74
| | | | subx: Move register direct mode before indirect in the exposition.
* 4050Kartik K. Agaram2017-10-121-0/+18
|
* 4049Kartik K. Agaram2017-10-123-99/+101
| | | | Instead of organizing layers by instruction, do so by addressing mode.
* 4048Kartik K. Agaram2017-10-121-0/+22
|
* 4047Kartik K. Agaram2017-10-121-0/+22
|
* 4046Kartik K. Agaram2017-10-121-0/+12
|
* 4045Kartik K. Agaram2017-10-121-3/+24
|
* 4044Kartik K. Agaram2017-10-122-2/+18
| | | | subx: now starting on subtraction instructions.
* 4043Kartik K. Agaram2017-10-122-2/+25
|
* 4042Kartik K. Agaram2017-10-121-4/+15
|
* 4041Kartik K. Agaram2017-10-121-0/+4
|
* 4040Kartik K. Agaram2017-10-122-3/+37
| | | | | | | subx: add immediate First example of a more complex opcode that needs to do its own decoding to decide what instruction to run.
* 4039Kartik K. Agaram2017-10-121-3/+3
|
* 4038Kartik K. Agaram2017-10-122-8/+10
|
* 4037Kartik K. Agaram2017-10-122-12/+15
| | | | Fix non-standard switch statement.
* 4036Kartik K. Agaram2017-10-121-6/+6
|
* 4035Kartik K. Agaram2017-10-121-0/+3
|
* 4034Kartik K. Agaram2017-10-123-0/+58
| | | | Start implementing core x86 addressing mode decoding.
* 4033Kartik K. Agaram2017-10-121-1/+0
|
* 4032Kartik K. Agaram2017-10-121-13/+13
| | | | Consistent naming for the common terms 'register' and 'memory'.
* 4031Kartik K. Agaram2017-10-121-7/+7
| | | | | | No, go back to a vector for `Memory`. We need it to be contiguously laid out in memory so that we can write words all at once rather than a byte at a time.
* 4030Kartik K. Agaram2017-10-121-18/+53
| | | | Take control of hex byte parsing.
* 4029Kartik K. Agaram2017-10-121-25/+25
|
* 4028Kartik K. Agaram2017-10-122-7/+7
|
* 4027Kartik K. Agaram2017-10-121-0/+249
| | | | Hacky one-time html rendering for a single layer in subx.
* 4026Kartik K. Agaram2017-10-122-29/+35
| | | | | | | | | | Make memory a sparse map rather than contiguous vector. In the process, a bugfix for `load_program`: support multiple lines of comments. Also save a local copy of the x86 cheatsheet I've been using: https://net.cs.uni-bonn.de/fileadmin/user_upload/plohmann/x86_opcode_structure_and_instruction_overview.pdf
* 4025Kartik K. Agaram2017-10-111-0/+1
| | | | Fix CI.
* 4024 - attempt to get CI working for SubXKartik K. Agaram2017-10-111-0/+1
|
* 4023Kartik K. Agaram2017-10-111-4/+4
|
* 4022Kartik K. Agaram2017-10-111-2/+4
|
* 4021Kartik K. Agaram2017-10-111-2/+2
|
* 4020Kartik K. Agaram2017-10-111-0/+1
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-07-02 20:31:02 +0000