Geza Lore fb9ec03c3f DfgPeephole: Use a work list driven algorithm for speed ... Replace the 'run to fixed point' algorithm with a work list driven approach. Instead of marking the graph as changed, we explicitly add vertices to the work list, to be visited, when a vertex is changed. This improves both memory locality (as the work list is processed in last in first out order), and removed unnecessary visitations when only a few nodes changes.		2022-11-05 20:31:09 +00:00
..
t	DfgPeephole: Use a work list driven algorithm for speed	2022-11-05 20:31:09 +00:00
.gdbinit
.gitignore
CMakeLists.txt
driver.pl	Remove --no-threads; require --threads 1 for single threaded (#3703).	2022-11-05 08:47:34 -04:00
input.vc
input.xsim.vc
Makefile
Makefile_obj