| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | 3070 | Kartik K. Agaram | 2016-06-28 | 1 | -9/+4 |
| | | | | | | Extract out the implementation of 'allocate' so other instructions (ahem, deep-copy) can use it. | ||||
| * | 2972 - abandon recursive containers | Kartik K. Agaram | 2016-05-17 | 1 | -7/+114 |
| | | |||||
| * | 2970 | Kartik K. Agaram | 2016-05-17 | 1 | -4/+4 |
| | | |||||
| * | 2968 | Kartik K. Agaram | 2016-05-17 | 1 | -2/+2 |
| | | | | | | | | | | | | | | | | | | | | | | | | More reorganization in preparation for implementing recursive abandon(). Refcounts are getting incredibly hairy. I need to juggle containers containing other containers, and containers *pointing* to other containers. For a while I considered getting rid of address_element_info entirely and just going by types for every single update_refcount. But that's definitely more work, and it's unclear that things will be cleaner/shorter/simpler. I haven't measured the speedup, but it seems worth optimizing every pointer copy to make sure we aren't manipulating types at runtime. The key insight now is a) to continue to compute information about nested containers at load time, because that's the common case when updating refcounts, but b) to compute information about *pointed* values at run-time, because that's the uncommon case. As a result, we're going to cheat in the interpreter and use type information at runtime just for abandon(), just because the corresponding task when we get to a compiler will be radically different. It will still be tractable, though. | ||||
| * | 2961 | Kartik K. Agaram | 2016-05-15 | 1 | -1/+1 |
| | | |||||
| * | 2927 | Kartik K. Agaram | 2016-05-05 | 1 | -6/+9 |
| | | |||||
| * | 2922 | Kartik K. Agaram | 2016-05-04 | 1 | -20/+4 |
| | | | | | | | | | | A better primitive: manage refcounts for an assignment without actually doing the assignment itself. This way we can add refcounts as a new, independent bit of bookkeeping without littering early returns and duplicate code paths. (OCD: commit number.) | ||||
| * | 2898 - start filling in missing refcounts | Kartik K. Agaram | 2016-05-03 | 1 | -0/+1 |
| | | | | | | | | This commit covers instructions 'put', 'put-index' and 'maybe-convert'. Next up are the harder ones: 'copy' and 'merge'. In these cases there's a non-scalar being copied, and we need to figure out which locations within it need to update their refcount. | ||||
| * | 2897 | Kartik K. Agaram | 2016-05-03 | 1 | -0/+143 |