about summary refs log tree commit diff stats
path: root/cpp/.traces
Commit message (Collapse)AuthorAgeFilesLines
* 1231Kartik K. Agaram2015-05-014-0/+145
|
* 1230 - start building scenarios out of 'pseudo recipes'Kartik K. Agaram2015-05-012-0/+72
|
* 1229Kartik K. Agaram2015-05-014-12/+12
|
* 1227Kartik K. Agaram2015-04-301-0/+1076
|
* 1226 - bugfix in allocating arraysKartik K. Agaram2015-04-3027-2680/+3222
| | | | Also our first test of printing to screen.
* 1225Kartik K. Agaram2015-04-29117-0/+1891
| | | | Finally start tracing the actual instructions as they run.
* 1223 - more stable traces for parse scenariosKartik K. Agaram2015-04-29147-463/+463
|
* 1222Kartik K. Agaram2015-04-291-0/+4
|
* 1217 - string literals weren't handling later commentsKartik K. Agaram2015-04-282-7/+3
|
* 1216Kartik K. Agaram2015-04-283-3/+10
|
* 1214Kartik K. Agaram2015-04-281-0/+234
|
* 1213Kartik K. Agaram2015-04-2865-111/+121
|
* 1211 - /same-as-ingredient property is now checkedKartik K. Agaram2015-04-281-0/+32
|
* 1209 - channels painlessly ported overKartik K. Agaram2015-04-289-0/+3041
| | | | | | | | I've made some tweaks to the arc version. In/out params should be identical; it was ugly that the in param was a pointer but the out wasn't. Still need to check the /same-as-ingredient property.
* 1207Kartik K. Agaram2015-04-271-0/+0
|
* 1206 - 'wait' state for synchronizing routinesKartik K. Agaram2015-04-2734-56/+96
| | | | I think I have enough now to port channels over.
* 1197Kartik K. Agaram2015-04-251-0/+44
|
* 1196Kartik K. Agaram2015-04-241-0/+0
|
* 1195Kartik K. Agaram2015-04-241-0/+20
|
* 1194Kartik K. Agaram2015-04-24102-0/+104
|
* 1193Kartik K. Agaram2015-04-2415-65/+65
|
* 1192Kartik K. Agaram2015-04-241-5/+5
|
* 1187Kartik K. Agaram2015-04-241-0/+37
|
* 1184 - finally, concurrencyKartik K. Agaram2015-04-24117-52/+175
|
* 1168Kartik K. Agaram2015-04-2413-75/+75
|
* 1166Kartik K. Agaram2015-04-249-23/+23
| | | | | | | Why did I think STL's map wasn't efficient? It has logarithmic complexity (maintains a tree internally) and is faster than hashing for small containers. It's the more portable solution and should be what I turn to by default.
* 1163Kartik K. Agaram2015-04-242-2/+2
|
* 1146 - yet another out-of-bounds accessKartik K. Agaram2015-04-221-0/+40
| | | | | | | | | | | | | | There's a test in this commit, but it doesn't actually fail, because by some accident the memory at index 2 of recipe 'f' has data at the is_label offset and breaks out of the loop. Graah. How did I ever misplace that "Reading One Instruction" waypoint? I could swear I was concerned about this possibility when I implemented calls. Today has been tough on my confidence. STL helps avoid memory leaks but doesn't help with buffer overflows nearly as much as I thought. Oh brilliant, valgrind caught the problem! And there weren't any others. I feel much better.
* 1126 - 'mu test x.mu' runs just scenarios in x.muKartik K. Agaram2015-04-221-0/+210
| | | | | | | Required still more tweaking of Recipe namespaces. Mindlessly inserting setup() took a couple of hours to debug because the test function and the function it was testing ended up getting the same recipe number, with the inevitable infinite loop :/
* 1125Kartik K. Agaram2015-04-221-26/+26
|
* 1116 - simpler memory checksKartik K. Agaram2015-04-201-0/+29
|
* 1109 - interpolate stringsKartik K. Agaram2015-04-203-0/+2078
|
* 1108 - check for typos in memory expectations in scenariosKartik K. Agaram2015-04-201-0/+5
|
* 1107Kartik K. Agaram2015-04-201-0/+3
|
* 1105 - more primitives for managing ingredientsKartik K. Agaram2015-04-1932-50/+99
|
* 1103Kartik K. Agaram2015-04-191-0/+11
|
* 1101Kartik K. Agaram2015-04-1913-22/+22
|
* 1100Kartik K. Agaram2015-04-191-0/+759
|
* 1099 - new recipe: convert integer to decimal stringKartik K. Agaram2015-04-187-4/+1189
|
* 1097 - 'grow-buffer' works the first time!Kartik K. Agaram2015-04-181-0/+355
| | | | | | | | | | | | | | | | | | | I thought I'd need to duplicate scenarios to simulate running some code, making some checks, running some more code. But I can just keep saving state to raw locations! I'd still have to manage raw locations myself, though. And it can be ping-pongy to have to check on the other blocks then go back to the run block. But what's the alternative? Multiple run blocks (even excluding the implementation effort) raise questions of namespace sharing across them. If it gets too bad I can intersperse recipes inside the scenario. Yes, that will work. Of course, overly long tests might themselves be a bad idea. We'll see, this is all terra incognita syntactically speaking. This might not be enough to check that a routine is waiting on a channel, but should keep us until then. Wait, even there what you need is a way to check on the status of your child routines. Yeah, doable. Even if we're getting ahead of ourselves.
* 1090Kartik K. Agaram2015-04-174-11/+537
|
* 1089Kartik K. Agaram2015-04-171-0/+51
|
* 1088 - start porting the 'buffer' typeKartik K. Agaram2015-04-171-0/+204
|
* 1087 - mu files can now define containers and exclusive containersKartik K. Agaram2015-04-172-0/+10
|
* 1086 - support variant names in 'maybe-convert'Kartik K. Agaram2015-04-171-0/+32
|
* 1085 - to access variants of sum types use 'maybe-convert'Kartik K. Agaram2015-04-172-0/+62
|
* 1084Kartik K. Agaram2015-04-1729-51/+51
|
* 1083 - start of a sum type for muKartik K. Agaram2015-04-171-0/+34
|
* 1075Kartik K. Agaram2015-04-1743-145/+130
|
* 1074Kartik K. Agaram2015-04-1730-52/+52
|
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-07-31 20:25:59 +0000