lisphs, branch lower-to-isaLisp half-compiler written in Haskell
https://git.tomsmeding.com/lisphs/atom?h=lower-to-isa2019-05-11T20:49:50ZLiveness analysis2019-05-11T20:49:50Ztomsmedingtom.smeding@gmail.com2019-05-11T20:49:50Zurn:sha1:b2d9c2b8e971a63de1a5be36e01068f3bc03f054WIP dataflow analysis for lifetime analysis2019-04-28T15:56:08Ztomsmedingtom.smeding@gmail.com2019-04-28T15:56:08Zurn:sha1:b6720c744c642048f93e04a3a2d4b6895d8b2c83Preliminary finish of lowering2019-04-28T14:49:32Ztomsmedingtom.smeding@gmail.com2019-04-28T14:49:32Zurn:sha1:b2320404202ad3296480bd472a6a79f5e5427de8
That is to say, there is no register allocation yet, but I think the
currently generated code can be regalloc'd without much trouble.
Prepare for setting up register spilling2019-04-24T13:17:09ZTom Smedingtom.smeding@gmail.com2019-04-24T13:17:09Zurn:sha1:3c40705b60d40f4c863c72091b3b4f30ff79c916Add TODO note2019-04-24T08:06:02ZTom Smedingtom.smeding@gmail.com2019-04-24T08:06:02Zurn:sha1:368c5972b648508d6a07b98b1b883f54a4eddd07Possibly working lowering to isa-with-infinite-regs2019-04-23T21:31:19ZTom Smedingtom.smeding@gmail.com2019-04-23T21:31:19Zurn:sha1:19260ae02f1447ccd382b5c278cc5d1f22d004b3Initial lowering code2019-04-22T16:35:21Ztomsmedingtom.smeding@gmail.com2019-04-22T16:35:21Zurn:sha1:607d918e9645cb9ea101515aae003a8d1d9fe8a7Lower to isa WIP2019-04-18T21:24:56ZTom Smedingtom.smeding@gmail.com2019-04-18T21:24:56Zurn:sha1:d37b2cfec1cfcbc3b6cfcedc88a9c6775312f8ebBuild with stack2018-03-26T19:35:24ZTom Smedingtom.smeding@gmail.com2018-03-26T19:35:24Zurn:sha1:7b2f8b602e65ed2462b7d2c5a432d102f0ba6705Rename files for case-sensitive file system2018-03-26T19:34:51ZTom Smedingtom.smeding@gmail.com2018-03-26T19:34:51Zurn:sha1:0e1f435314b382cb78056f04d0997df43e4f8fcf