jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

use the lastRead analysis; it's correct by construction, not a mess of special cases and seems to be just as fast as the old algorithm

Browse source
This commit is contained in:
Andreas Rumpf 2019-01-21 20:11:42 +01:00
commit 2655f242a8
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
compiler/destroyer.nim
View file

@ -176,8 +176,8 @@ proc isLastRead(n: PNode; c: var Con): bool =
# we go through all paths beginning from 'instr+1' and need to # we go through all paths beginning from 'instr+1' and need to
# ensure that we don't find another 'use X' instruction. # ensure that we don't find another 'use X' instruction.
if instr+1 >= c.g.len: return true if instr+1 >= c.g.len: return true
when false: when true:
result = isLastRead(n.sym, c, 0, -1) >= 0 result = isLastRead(n.sym, c, instr+1, -1) >= 0
else: else:
let s = n.sym let s = n.sym
var pcs: seq[int] = @[instr+1] var pcs: seq[int] = @[instr+1]