4 ms·
From what I understood, it’s not reference counting but trying to determine at compile time when to drop using data flow analysis to come up with an approximati
by eklavya 6y ago
From what I understood, it’s not reference counting but trying to determine at compile time when to drop using data flow analysis to come up with an approximation of the liveness.
I had a thought sometimes back, can compilers do a profile run to get information about the liveness of objects it couldn’t determine statically by dumping gc info?
- amedvednikov 6y agoMost programs are complex, have lots of branching, so this wouldn't work.
- deleted 6y ago[deleted]
- catblast 6y ago> get information about the liveness of objects it couldn’t determine statically by dumping gc info? Well it may be possible to optimize via profiling (this is what PGO is), but this of course wouldn’t be a static analysis, so it would just allow some optimizations on dynamic access. In theory you could use profiling as part of the implementation of a theorem prover, but I haven’t seen any examples where that is more effective then the conventional methods of data flow analysis. And in this case, it would still be static analysis.