AriasCreations/LSL-PyOptimizer
3
0
Fork 0
mirror of https://github.com/Sei-Lisa/LSL-PyOptimizer synced 2025-07-22 20:49:33 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add proper detection of functions inside the list

Browse source 
A recursive function checks every subnode.
This commit is contained in:
Sei Lisa 2018-11-19 14:13:10 +01:00
parent e5c2c4057e
commit d4bcafa1f7
1 changed files with 13 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

20
lslopt/lslfuncopt.py
View file

@ -127,6 +127,14 @@ def CastDL2S(self, node, index):
return self.Cast(self.Cast(elem, 'list'), 'string')
return self.Cast(elem, 'string')
# Quick hack to work around lack of cached per-node ContainsFunctions info
def FnFree(self, node):
if node.nt == 'FNCALL':
return False
if node.nt in ('CONST', 'IDENT', 'FLD'):
return True
return all(FnFree(self, node.ch[i]) for i in range(len(node.ch)))
# The 'self' parameter here is the constant folding object.
def OptimizeFunc(self, parent, index):
"""Look for possible optimizations taking advantage of the specific LSL
@ -187,15 +195,13 @@ def OptimizeFunc(self, parent, index):
return
for i in range(list_len):
# TODO: If there's a function call, don't optimize.
# Since we don't yet have a flag, for now, optimize variables
# and constants only (kinda like simple_expression_no_list).
# Also, if an element is a list, we can't optimize it, as that
# will produce a side effect (error). Neither can we if the
# single elements can't be extracted.
# Can't be optimized if the list has any function calls in any
# of the elements, or if they can't be extracted.
# If an element is a list, we can't optimize it either, as that
# will produce a side effect (namely an error).
val = self.GetListNodeElement(child[0], i)
if (val is False or type(val) == nr and (val.t == 'list'
or val.nt not in ('CONST', 'IDENT', 'FLD'))
or not FnFree(self, val))
):
# With our simple analysis, we can't guarantee that
# whatever the content is, there are no functions.