-
-
Notifications
You must be signed in to change notification settings - Fork 1.6k
/
optimizer.py
205 lines (174 loc) · 6.92 KB
/
optimizer.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
# -*- coding: utf-8 -*-
"""
jinja2.optimizer
~~~~~~~~~~~~~~~~
This module tries to optimize template trees by:
* eliminating constant nodes
* evaluating filters and macros on constant nodes
* unroll loops on constant values
* replace variables which are already known (because they doesn't
change often and you want to prerender a template) with constants
After the optimation you will get a new, simplier template which can
be saved again for later rendering. But even if you don't want to
prerender a template, this module might speed up your templates a bit
if you are using a lot of constants.
:copyright: Copyright 2008 by Christoph Hack.
:license: GNU GPL.
"""
from copy import deepcopy
from jinja2 import nodes
from jinja2.visitor import NodeVisitor, NodeTransformer
from jinja2.runtime import subscribe, LoopContext
class ContextStack(object):
"""Simple compile time context implementation."""
def __init__(self, initial=None):
self.stack = [{}]
if initial is not None:
self.stack.insert(0, initial)
def push(self):
self.stack.append({})
def pop(self):
self.stack.pop()
def get(self, key, default=None):
try:
return self[key]
except KeyError:
return default
def __getitem__(self, key):
for level in reversed(self.stack):
if key in level:
return level[key]
raise KeyError(key)
def __setitem__(self, key, value):
self.stack[-1][key] = value
def blank(self):
"""Return a new context with nothing but the root scope."""
return ContextStack(self.stack[0])
class Optimizer(NodeTransformer):
def __init__(self, environment):
self.environment = environment
def visit_Block(self, node, context):
return self.generic_visit(node, context.blank())
def visit_Filter(self, node, context):
"""Try to evaluate filters if possible."""
# XXX: nonconstant arguments? not-called visitors? generic visit!
try:
x = self.visit(node.node, context).as_const()
except nodes.Impossible:
return self.generic_visit(node, context)
for filter in reversed(node.filters):
# XXX: call filters with arguments
x = self.environment.filters[filter.name](x)
# XXX: don't optimize context dependent filters
return nodes.Const(x)
def visit_For(self, node, context):
"""Loop unrolling for iterable constant values."""
try:
iterable = self.visit(node.iter, context).as_const()
# we only unroll them if they have a length and are iterable
iter(iterable)
len(iterable)
except (nodes.Impossible, TypeError):
return self.generic_visit(node, context)
parent = context.get('loop')
context.push()
result = []
iterated = False
def assign(target, value):
if isinstance(target, nodes.Name):
context[target.name] = value
elif isinstance(target, nodes.Tuple):
try:
value = tuple(value)
except TypeError:
raise nodes.Impossible()
if len(target.items) != len(value):
raise nodes.Impossible()
for name, val in zip(target.items, value):
assign(name, val)
else:
raise AssertionError('unexpected assignable node')
try:
try:
for loop, item in LoopContext(iterable, parent, True):
context['loop'] = loop.make_static()
assign(node.target, item)
result.extend(self.visit(n, context)
for n in deepcopy(node.body))
iterated = True
if not iterated and node.else_:
result.extend(self.visit(n, context)
for n in deepcopy(node.else_))
except nodes.Impossible:
return node
finally:
context.pop()
return result
def visit_If(self, node, context):
try:
val = self.visit(node.test, context).as_const()
except nodes.Impossible:
return self.generic_visit(node, context)
if val:
return node.body
return node.else_
def visit_Name(self, node, context):
if node.ctx == 'load':
try:
return nodes.Const(context[node.name], lineno=node.lineno)
except KeyError:
pass
return node
def visit_Assign(self, node, context):
try:
target = node.target = self.generic_visit(node.target, context)
value = self.generic_visit(node.node, context).as_const()
except nodes.Impossible:
return node
result = []
lineno = node.lineno
def walk(target, value):
if isinstance(target, nodes.Name):
const_value = nodes.Const(value, lineno=lineno)
result.append(nodes.Assign(target, const_value, lineno=lineno))
context[target.name] = value
elif isinstance(target, nodes.Tuple):
try:
value = tuple(value)
except TypeError:
raise nodes.Impossible()
if len(target.items) != len(value):
raise nodes.Impossible()
for name, val in zip(target.items, value):
walk(name, val)
else:
raise AssertionError('unexpected assignable node')
try:
walk(target, value)
except nodes.Impossible:
return node
return result
def fold(self, node, context):
"""Do constant folding."""
node = self.generic_visit(node, context)
try:
return nodes.Const(node.as_const(), lineno=node.lineno)
except nodes.Impossible:
return node
visit_Add = visit_Sub = visit_Mul = visit_Div = visit_FloorDiv = \
visit_Pow = visit_Mod = visit_And = visit_Or = visit_Pos = visit_Neg = \
visit_Not = visit_Compare = fold
def visit_Subscript(self, node, context):
if node.ctx == 'load':
try:
item = self.visit(node.node, context).as_const()
arg = self.visit(node.arg, context).as_const()
except nodes.Impossible:
return self.generic_visit(node, context)
return nodes.Const(subscribe(item, arg, 'load'))
return self.generic_visit(node, context)
def optimize(node, environment, context_hint=None):
"""The context hint can be used to perform an static optimization
based on the context given."""
optimizer = Optimizer(environment)
return optimizer.visit(node, ContextStack(context_hint))