Hi Thomas,
On Thu, Jul 26, 2018 at 09:59:44PM +0200, Thomas Helland wrote:
> Since we're always going top-down through the
> program there should be no need to "walk backwards",
> so this approach should be enough to get the whole chain
> of assignments in one pass. Neat.
The patch that incorpora
Since we're always going top-down through the
program there should be no need to "walk backwards",
so this approach should be enough to get the whole chain
of assignments in one pass. Neat.
Reviewed-by: Thomas Helland
2018-07-25 3:03 GMT+02:00 Caio Marcelo de Oliveira Filho
:
> When creating a ne
When creating a new acp_entry after an assignment "c = b", check if b
itself has an acp_entry with a full variable associated and use
that. This reduces the number of passes the algorithm needs to
propagate a value in a chain of assignments.
I've tried to make a similar change to the write_partial
