blob: 3c2347d65c5dda2ba8dccb1630d5359e4a47778a [file] [log] [blame]
# -*- coding: utf-8 -*-
"""
jinja2.compiler
~~~~~~~~~~~~~~~
Compiles nodes into python code.
:copyright: Copyright 2008 by Armin Ronacher.
:license: GNU GPL.
"""
from copy import copy
from random import randrange
from cStringIO import StringIO
from jinja2 import nodes
from jinja2.visitor import NodeVisitor, NodeTransformer
from jinja2.exceptions import TemplateAssertionError
from jinja2.runtime import StaticLoopContext
operators = {
'eq': '==',
'ne': '!=',
'gt': '>',
'gteq': '>=',
'lt': '<',
'lteq': '<=',
'in': 'in',
'notin': 'not in'
}
try:
exec '(0 if 0 else 0)'
except SyntaxError:
have_condexpr = False
else:
have_condexpr = True
def generate(node, environment, filename, stream=None):
"""Generate the python source for a node tree."""
is_child = node.find(nodes.Extends) is not None
generator = CodeGenerator(environment, is_child, filename, stream)
generator.visit(node)
if stream is None:
return generator.stream.getvalue()
def has_safe_repr(value):
"""Does the node have a safe representation?"""
if value is None or value is NotImplemented or value is Ellipsis:
return True
if isinstance(value, (bool, int, long, float, complex, basestring,
StaticLoopContext)):
return True
if isinstance(value, (tuple, list, set, frozenset)):
for item in value:
if not has_safe_repr(item):
return False
return True
elif isinstance(value, dict):
for key, value in value.iteritems():
if not has_safe_repr(key):
return False
if not has_safe_repr(value):
return False
return True
return False
class Identifiers(object):
"""Tracks the status of identifiers in frames."""
def __init__(self):
# variables that are known to be declared (probably from outer
# frames or because they are special for the frame)
self.declared = set()
# names that are accessed without being explicitly declared by
# this one or any of the outer scopes. Names can appear both in
# declared and undeclared.
self.undeclared = set()
# names that are declared locally
self.declared_locally = set()
# names that are declared by parameters
self.declared_parameter = set()
# filters/tests that are referenced
self.filters = set()
self.tests = set()
def add_special(self, name):
"""Register a special name like `loop`."""
self.undeclared.discard(name)
self.declared.add(name)
def is_declared(self, name, local_only=False):
"""Check if a name is declared in this or an outer scope."""
if name in self.declared_locally or name in self.declared_parameter:
return True
if local_only:
return False
return name in self.declared
def find_shadowed(self):
"""Find all the shadowed names."""
return self.declared & (self.declared_locally | self.declared_parameter)
class Frame(object):
"""Holds compile time information for us."""
def __init__(self, parent=None):
self.identifiers = Identifiers()
# a toplevel frame is the root + soft frames such as if conditions.
self.toplevel = False
# the root frame is basically just the outermost frame, so no if
# conditions. This information is used to optimize inheritance
# situations.
self.rootlevel = False
self.parent = parent
self.buffer = None
self.name_overrides = {}
self.block = parent and parent.block or None
if parent is not None:
self.identifiers.declared.update(
parent.identifiers.declared |
parent.identifiers.declared_locally |
parent.identifiers.declared_parameter
)
self.buffer = parent.buffer
self.name_overrides = parent.name_overrides.copy()
def copy(self):
"""Create a copy of the current one."""
rv = copy(self)
rv.identifiers = copy(self.identifiers)
rv.name_overrides = self.name_overrides.copy()
return rv
def inspect(self, nodes, hard_scope=False):
"""Walk the node and check for identifiers. If the scope
is hard (eg: enforce on a python level) overrides from outer
scopes are tracked differently.
"""
visitor = FrameIdentifierVisitor(self.identifiers, hard_scope)
for node in nodes:
visitor.visit(node)
def inner(self):
"""Return an inner frame."""
return Frame(self)
def soft(self):
"""Return a soft frame. A soft frame may not be modified as
standalone thing as it shares the resources with the frame it
was created of, but it's not a rootlevel frame any longer.
"""
rv = copy(self)
rv.rootlevel = False
return rv
class FrameIdentifierVisitor(NodeVisitor):
"""A visitor for `Frame.inspect`."""
def __init__(self, identifiers, hard_scope):
self.identifiers = identifiers
self.hard_scope = hard_scope
def visit_Name(self, node):
"""All assignments to names go through this function."""
if node.ctx in ('store', 'param'):
self.identifiers.declared_locally.add(node.name)
elif node.ctx == 'load':
if not self.identifiers.is_declared(node.name, self.hard_scope):
self.identifiers.undeclared.add(node.name)
def visit_Filter(self, node):
self.generic_visit(node)
self.identifiers.filters.add(node.name)
def visit_Test(self, node):
self.generic_visit(node)
self.identifiers.tests.add(node.name)
def visit_Macro(self, node):
"""Macros set local."""
self.identifiers.declared_locally.add(node.name)
def visit_Include(self, node):
"""Some includes set local."""
self.generic_visit(node)
if node.target is not None:
self.identifiers.declared_locally.add(node.target)
def visit_Assign(self, node):
"""Visit assignments in the correct order."""
self.visit(node.node)
self.visit(node.target)
# stop traversing at instructions that have their own scope.
visit_Block = visit_CallBlock = visit_FilterBlock = \
visit_For = lambda s, n: None
class CompilerExit(Exception):
"""Raised if the compiler encountered a situation where it just
doesn't make sense to further process the code. Any block that
raises such an exception is not further processed."""
class CodeGenerator(NodeVisitor):
def __init__(self, environment, is_child, filename, stream=None):
if stream is None:
stream = StringIO()
self.environment = environment
self.is_child = is_child
self.filename = filename
self.stream = stream
self.blocks = {}
self.indentation = 0
self.new_lines = 0
self.last_identifier = 0
self.extends_so_far = 0
self.has_known_extends = False
self._last_line = 0
self._first_write = True
def temporary_identifier(self):
self.last_identifier += 1
return 't%d' % self.last_identifier
def indent(self):
self.indentation += 1
def outdent(self, step=1):
self.indentation -= step
def blockvisit(self, nodes, frame, indent=True, force_generator=True):
if indent:
self.indent()
if frame.buffer is None and force_generator:
self.writeline('if 0: yield None')
try:
for node in nodes:
self.visit(node, frame)
except CompilerExit:
pass
if indent:
self.outdent()
def write(self, x):
if self.new_lines:
if not self._first_write:
self.stream.write('\n' * self.new_lines)
self._first_write = False
self.stream.write(' ' * self.indentation)
self.new_lines = 0
self.stream.write(x)
def writeline(self, x, node=None, extra=0):
self.newline(node, extra)
self.write(x)
def newline(self, node=None, extra=0):
self.new_lines = max(self.new_lines, 1 + extra)
if node is not None and node.lineno != self._last_line:
self.write('# line: %s' % node.lineno)
self.new_lines = 1
self._last_line = node.lineno
def signature(self, node, frame, have_comma=True, extra_kwargs=None):
have_comma = have_comma and [True] or []
def touch_comma():
if have_comma:
self.write(', ')
else:
have_comma.append(True)
for arg in node.args:
touch_comma()
self.visit(arg, frame)
for kwarg in node.kwargs:
touch_comma()
self.visit(kwarg, frame)
if extra_kwargs is not None:
touch_comma()
self.write(extra_kwargs)
if node.dyn_args:
touch_comma()
self.write('*')
self.visit(node.dyn_args, frame)
if node.dyn_kwargs:
touch_comma()
self.write('**')
self.visit(node.dyn_kwargs, frame)
def pull_locals(self, frame, indent=True):
if indent:
self.indent()
for name in frame.identifiers.undeclared:
self.writeline('l_%s = context[%r]' % (name, name))
for name in frame.identifiers.filters:
self.writeline('f_%s = environment.filters[%r]' % (name, name))
for name in frame.identifiers.tests:
self.writeline('t_%s = environment.tests[%r]' % (name, name))
if indent:
self.outdent()
def collect_shadowed(self, frame):
# make sure we "backup" overridden, local identifiers
# TODO: we should probably optimize this and check if the
# identifier is in use afterwards.
aliases = {}
for name in frame.identifiers.find_shadowed():
aliases[name] = ident = self.temporary_identifier()
self.writeline('%s = l_%s' % (ident, name))
return aliases
def function_scoping(self, node, frame):
func_frame = frame.inner()
func_frame.inspect(node.iter_child_nodes(), hard_scope=True)
# variables that are undeclared (accessed before declaration) and
# declared locally *and* part of an outside scope raise a template
# assertion error. Reason: we can't generate reasonable code from
# it without aliasing all the variables. XXX: alias them ^^
overriden_closure_vars = (
func_frame.identifiers.undeclared &
func_frame.identifiers.declared &
(func_frame.identifiers.declared_locally |
func_frame.identifiers.declared_parameter)
)
if overriden_closure_vars:
vars = ', '.join(sorted(overriden_closure_vars))
raise TemplateAssertionError('It\'s not possible to set and '
'access variables derived from '
'an outer scope! (affects: %s' %
vars, node.lineno, self.filename)
# remove variables from a closure from the frame's undeclared
# identifiers.
func_frame.identifiers.undeclared -= (
func_frame.identifiers.undeclared &
func_frame.identifiers.declared
)
func_frame.accesses_arguments = False
func_frame.accesses_caller = False
func_frame.arguments = args = ['l_' + x.name for x in node.args]
if 'arguments' in func_frame.identifiers.undeclared:
func_frame.accesses_arguments = True
func_frame.identifiers.add_special('arguments')
args.append('l_arguments')
if 'caller' in func_frame.identifiers.undeclared:
func_frame.accesses_caller = True
func_frame.identifiers.add_special('caller')
args.append('l_caller')
return func_frame
# -- Visitors
def visit_Template(self, node, frame=None):
assert frame is None, 'no root frame allowed'
self.writeline('from jinja2.runtime import *')
self.writeline('filename = %r' % self.filename)
# do we have an extends tag at all? If not, we can save some
# overhead by just not processing any inheritance code.
have_extends = node.find(nodes.Extends) is not None
# find all blocks
for block in node.find_all(nodes.Block):
if block.name in self.blocks:
raise TemplateAssertionError('block %r defined twice' %
block.name, block.lineno,
self.filename)
self.blocks[block.name] = block
# generate the root render function.
self.writeline('def root(globals, environment=environment'
', standalone=False):', extra=1)
self.indent()
self.writeline('context = TemplateContext(globals, %r, blocks'
', standalone)' % self.filename)
if have_extends:
self.writeline('parent_root = None')
self.outdent()
# process the root
frame = Frame()
frame.inspect(node.body)
frame.toplevel = frame.rootlevel = True
self.indent()
self.pull_locals(frame, indent=False)
self.writeline('yield context')
self.blockvisit(node.body, frame, indent=False)
self.outdent()
# make sure that the parent root is called.
if have_extends:
if not self.has_known_extends:
self.indent()
self.writeline('if parent_root is not None:')
self.indent()
self.writeline('stream = parent_root(context)')
self.writeline('stream.next()')
self.writeline('for event in stream:')
self.indent()
self.writeline('yield event')
self.outdent(1 + self.has_known_extends)
# at this point we now have the blocks collected and can visit them too.
for name, block in self.blocks.iteritems():
block_frame = Frame()
block_frame.inspect(block.body)
block_frame.block = name
self.writeline('def block_%s(context, environment=environment):'
% name, block, 1)
self.pull_locals(block_frame)
self.blockvisit(block.body, block_frame)
self.writeline('blocks = {%s}' % ', '.join('%r: block_%s' % (x, x)
for x in self.blocks), extra=1)
def visit_Block(self, node, frame):
"""Call a block and register it for the template."""
level = 1
if frame.toplevel:
# if we know that we are a child template, there is no need to
# check if we are one
if self.has_known_extends:
return
if self.extends_so_far > 0:
self.writeline('if parent_root is None:')
self.indent()
level += 1
self.writeline('for event in context.blocks[%r][-1](context):' % node.name)
self.indent()
if frame.buffer is None:
self.writeline('yield event')
else:
self.writeline('%s.append(event)' % frame.buffer)
self.outdent(level)
def visit_Extends(self, node, frame):
"""Calls the extender."""
if not frame.toplevel:
raise TemplateAssertionError('cannot use extend from a non '
'top-level scope', node.lineno,
self.filename)
# if the number of extends statements in general is zero so
# far, we don't have to add a check if something extended
# the template before this one.
if self.extends_so_far > 0:
# if we have a known extends we just add a template runtime
# error into the generated code. We could catch that at compile
# time too, but i welcome it not to confuse users by throwing the
# same error at different times just "because we can".
if not self.has_known_extends:
self.writeline('if parent_root is not None:')
self.indent()
self.writeline('raise TemplateRuntimeError(%r)' %
'extended multiple times')
# if we have a known extends already we don't need that code here
# as we know that the template execution will end here.
if self.has_known_extends:
raise CompilerExit()
self.outdent()
self.writeline('parent_root = environment.get_template(', node, 1)
self.visit(node.template, frame)
self.write(', %r).root_render_func' % self.filename)
# if this extends statement was in the root level we can take
# advantage of that information and simplify the generated code
# in the top level from this point onwards
self.has_known_extends = True
# and now we have one more
self.extends_so_far += 1
def visit_Include(self, node, frame):
"""Handles includes."""
# simpled include is include into a variable. This kind of
# include works the same on every level, so we handle it first.
if node.target is not None:
self.writeline('l_%s = ' % node.target, node)
if frame.toplevel:
self.write('context[%r] = ' % node.target)
self.write('IncludedTemplate(environment, context, ')
self.visit(node.template, frame)
self.write(')')
return
self.writeline('included_stream = environment.get_template(', node)
self.visit(node.template, frame)
self.write(').root_render_func(context, standalone=True)')
self.writeline('included_context = included_stream.next()')
self.writeline('for event in included_stream:')
self.indent()
if frame.buffer is None:
self.writeline('yield event')
else:
self.writeline('%s.append(event)' % frame.buffer)
self.outdent()
# if we have a toplevel include the exported variables are copied
# into the current context without exporting them. context.udpate
# does *not* mark the variables as exported
if frame.toplevel:
self.writeline('context.update(included_context.get_exported())')
def visit_For(self, node, frame):
loop_frame = frame.inner()
loop_frame.inspect(node.iter_child_nodes())
extended_loop = bool(node.else_) or \
'loop' in loop_frame.identifiers.undeclared
if extended_loop:
loop_frame.identifiers.add_special('loop')
aliases = self.collect_shadowed(loop_frame)
self.pull_locals(loop_frame, indent=False)
if node.else_:
self.writeline('l_loop = None')
self.newline(node)
self.writeline('for ')
self.visit(node.target, loop_frame)
self.write(extended_loop and ', l_loop in LoopContext(' or ' in ')
# the expression pointing to the parent loop. We make the
# undefined a bit more debug friendly at the same time.
parent_loop = 'loop' in aliases and aliases['loop'] \
or "Undefined('loop', extra=%r)" % \
'the filter section of a loop as well as the ' \
'else block doesn\'t have access to the special ' \
"'loop' variable of the current loop. Because " \
'there is no parent loop it\'s undefined.'
# if we have an extened loop and a node test, we filter in the
# "outer frame".
if extended_loop and node.test is not None:
self.write('(')
self.visit(node.target, loop_frame)
self.write(' for ')
self.visit(node.target, loop_frame)
self.write(' in ')
self.visit(node.iter, loop_frame)
self.write(' if (')
test_frame = loop_frame.copy()
test_frame.name_overrides['loop'] = parent_loop
self.visit(node.test, test_frame)
self.write('))')
else:
self.visit(node.iter, loop_frame)
if 'loop' in aliases:
self.write(', ' + aliases['loop'])
self.write(extended_loop and '):' or ':')
# tests in not extended loops become a continue
if not extended_loop and node.test is not None:
self.indent()
self.writeline('if ')
self.visit(node.test)
self.write(':')
self.indent()
self.writeline('continue')
self.outdent(2)
self.blockvisit(node.body, loop_frame, force_generator=False)
if node.else_:
self.writeline('if l_loop is None:')
self.indent()
self.writeline('l_loop = ' + parent_loop)
self.outdent()
self.blockvisit(node.else_, loop_frame, force_generator=False)
# reset the aliases if there are any.
for name, alias in aliases.iteritems():
self.writeline('l_%s = %s' % (name, alias))
def visit_If(self, node, frame):
if_frame = frame.soft()
self.writeline('if ', node)
self.visit(node.test, if_frame)
self.write(':')
self.blockvisit(node.body, if_frame)
if node.else_:
self.writeline('else:')
self.blockvisit(node.else_, if_frame)
def visit_Macro(self, node, frame):
macro_frame = self.function_scoping(node, frame)
args = macro_frame.arguments
self.writeline('def macro(%s):' % ', '.join(args), node)
macro_frame.buffer = buf = self.temporary_identifier()
self.indent()
self.pull_locals(macro_frame, indent=False)
self.writeline('%s = []' % buf)
self.blockvisit(node.body, macro_frame, indent=False)
self.writeline("return TemplateData(u''.join(%s))" % buf)
self.outdent()
self.newline()
if frame.toplevel:
self.write('context[%r] = ' % node.name)
arg_tuple = ', '.join(repr(x.name) for x in node.args)
if len(node.args) == 1:
arg_tuple += ','
self.write('l_%s = Macro(macro, %r, (%s), (' % (node.name, node.name,
arg_tuple))
for arg in node.defaults:
self.visit(arg, macro_frame)
self.write(', ')
self.write('), %s, %s)' % (
macro_frame.accesses_arguments and '1' or '0',
macro_frame.accesses_caller and '1' or '0'
))
def visit_CallBlock(self, node, frame):
call_frame = self.function_scoping(node, frame)
args = call_frame.arguments
self.writeline('def call(%s):' % ', '.join(args), node)
call_frame.buffer = buf = self.temporary_identifier()
self.indent()
self.pull_locals(call_frame, indent=False)
self.writeline('%s = []' % buf)
self.blockvisit(node.body, call_frame, indent=False)
self.writeline("return TemplateData(u''.join(%s))" % buf)
self.outdent()
arg_tuple = ', '.join(repr(x.name) for x in node.args)
if len(node.args) == 1:
arg_tuple += ','
self.writeline('caller = Macro(call, None, (%s), (' % arg_tuple)
for arg in node.defaults:
self.visit(arg)
self.write(', ')
self.write('), %s, 0)' % (call_frame.accesses_arguments and '1' or '0'))
if frame.buffer is None:
self.writeline('yield ', node)
else:
self.writeline('%s.append(' % frame.buffer, node)
self.visit_Call(node.call, call_frame, extra_kwargs='caller=caller')
if frame.buffer is not None:
self.write(')')
def visit_FilterBlock(self, node, frame):
filter_frame = frame.inner()
filter_frame.inspect(node.iter_child_nodes())
aliases = self.collect_shadowed(filter_frame)
self.pull_locals(filter_frame, indent=False)
filter_frame.buffer = buf = self.temporary_identifier()
self.writeline('%s = []' % buf, node)
for child in node.body:
self.visit(child, filter_frame)
if frame.buffer is None:
self.writeline('yield ', node)
else:
self.writeline('%s.append(' % frame.buffer, node)
self.visit_Filter(node.filter, filter_frame, "u''.join(%s)" % buf)
if frame.buffer is not None:
self.write(')')
def visit_ExprStmt(self, node, frame):
self.newline(node)
self.visit(node, frame)
def visit_Output(self, node, frame):
# if we have a known extends statement, we don't output anything
if self.has_known_extends and frame.toplevel:
return
self.newline(node)
if self.environment.finalize is unicode:
finalizer = 'unicode'
have_finalizer = False
else:
finalizer = 'context.finalize'
have_finalizer = False
# if we are in the toplevel scope and there was already an extends
# statement we have to add a check that disables our yield(s) here
# so that they don't appear in the output.
outdent_later = False
if frame.toplevel and self.extends_so_far != 0:
self.writeline('if parent_root is None:')
self.indent()
outdent_later = True
# try to evaluate as many chunks as possible into a static
# string at compile time.
body = []
for child in node.nodes:
try:
const = unicode(child.as_const())
except:
body.append(child)
continue
if body and isinstance(body[-1], list):
body[-1].append(const)
else:
body.append([const])
# if we have less than 3 nodes we just yield them
if len(body) < 3:
for item in body:
if isinstance(item, list):
val = repr(u''.join(item))
if frame.buffer is None:
self.writeline('yield ' + val)
else:
self.writeline('%s.append(%s)' % (frame.buffer, val))
else:
self.newline(item)
if frame.buffer is None:
self.write('yield ')
else:
self.write('%s.append(' % frame.buffer)
self.write(finalizer + '(')
self.visit(item, frame)
self.write(')' * (1 + (frame.buffer is not None)))
# otherwise we create a format string as this is faster in that case
else:
format = []
arguments = []
for item in body:
if isinstance(item, list):
format.append(u''.join(item).replace('%', '%%'))
else:
format.append('%s')
arguments.append(item)
if frame.buffer is None:
self.writeline('yield ')
else:
self.writeline('%s.append(' % frame.buffer)
self.write(repr(u''.join(format)) + ' % (')
idx = -1
for idx, argument in enumerate(arguments):
if idx:
self.write(', ')
if have_finalizer:
self.write('(')
self.visit(argument, frame)
if have_finalizer:
self.write(')')
self.write(idx == 0 and ',)' or ')')
if frame.buffer is not None:
self.write(')')
if outdent_later:
self.outdent()
def visit_Assign(self, node, frame):
self.newline(node)
# toplevel assignments however go into the local namespace and
# the current template's context. We create a copy of the frame
# here and add a set so that the Name visitor can add the assigned
# names here.
if frame.toplevel:
assignment_frame = frame.copy()
assignment_frame.assigned_names = set()
else:
assignment_frame = frame
self.visit(node.target, assignment_frame)
self.write(' = ')
self.visit(node.node, frame)
# make sure toplevel assignments are added to the context.
if frame.toplevel:
for name in assignment_frame.assigned_names:
self.writeline('context[%r] = l_%s' % (name, name))
def visit_Name(self, node, frame):
if node.ctx == 'store':
if frame.toplevel:
frame.assigned_names.add(node.name)
frame.name_overrides.pop(node.name, None)
elif node.ctx == 'load':
if node.name in frame.name_overrides:
self.write(frame.name_overrides[node.name])
return
self.write('l_' + node.name)
def visit_Const(self, node, frame):
val = node.value
if isinstance(val, float):
# XXX: add checks for infinity and nan
self.write(str(val))
else:
self.write(repr(val))
def visit_Tuple(self, node, frame):
self.write('(')
idx = -1
for idx, item in enumerate(node.items):
if idx:
self.write(', ')
self.visit(item, frame)
self.write(idx == 0 and ',)' or ')')
def visit_List(self, node, frame):
self.write('[')
for idx, item in enumerate(node.items):
if idx:
self.write(', ')
self.visit(item, frame)
self.write(']')
def visit_Dict(self, node, frame):
self.write('{')
for idx, item in enumerate(node.items):
if idx:
self.write(', ')
self.visit(item.key, frame)
self.write(': ')
self.visit(item.value, frame)
self.write('}')
def binop(operator):
def visitor(self, node, frame):
self.write('(')
self.visit(node.left, frame)
self.write(' %s ' % operator)
self.visit(node.right, frame)
self.write(')')
return visitor
def uaop(operator):
def visitor(self, node, frame):
self.write('(' + operator)
self.visit(node.node)
self.write(')')
return visitor
visit_Add = binop('+')
visit_Sub = binop('-')
visit_Mul = binop('*')
visit_Div = binop('/')
visit_FloorDiv = binop('//')
visit_Pow = binop('**')
visit_Mod = binop('%')
visit_And = binop('and')
visit_Or = binop('or')
visit_Pos = uaop('+')
visit_Neg = uaop('-')
visit_Not = uaop('not ')
del binop, uaop
def visit_Compare(self, node, frame):
self.visit(node.expr, frame)
for op in node.ops:
self.visit(op, frame)
def visit_Operand(self, node, frame):
self.write(' %s ' % operators[node.op])
self.visit(node.expr, frame)
def visit_Subscript(self, node, frame):
if isinstance(node.arg, nodes.Slice):
self.visit(node.node, frame)
self.write('[')
self.visit(node.arg, frame)
self.write(']')
return
try:
const = node.arg.as_const()
have_const = True
except nodes.Impossible:
have_const = False
if have_const:
if isinstance(const, (int, long, float)):
self.visit(node.node, frame)
self.write('[%s]' % const)
return
self.write('subscribe(')
self.visit(node.node, frame)
self.write(', ')
if have_const:
self.write(repr(const))
else:
self.visit(node.arg, frame)
self.write(')')
def visit_Slice(self, node, frame):
if node.start is not None:
self.visit(node.start, frame)
self.write(':')
if node.stop is not None:
self.visit(node.stop, frame)
if node.step is not None:
self.write(':')
self.visit(node.step, frame)
def visit_Filter(self, node, frame, initial=None):
self.write('f_%s(' % node.name)
if initial is not None:
self.write(initial)
else:
func = self.environment.filters.get(node.name)
if getattr(func, 'contextfilter', False):
self.write('context, ')
self.visit(node.node, frame)
self.signature(node, frame)
self.write(')')
def visit_Test(self, node, frame):
self.write('t_%s(' % node.name)
func = self.environment.tests.get(node.name)
if getattr(func, 'contexttest', False):
self.write('context, ')
self.visit(node.node, frame)
self.signature(node, frame)
self.write(')')
def visit_CondExpr(self, node, frame):
if not have_condexpr:
self.write('((')
self.visit(node.test, frame)
self.write(') and (')
self.visit(node.expr1, frame)
self.write(',) or (')
self.visit(node.expr2, frame)
self.write(',))[0]')
else:
self.write('(')
self.visit(node.expr1, frame)
self.write(' if ')
self.visit(node.test, frame)
self.write(' else ')
self.visit(node.expr2, frame)
self.write(')')
def visit_Call(self, node, frame, extra_kwargs=None):
self.visit(node.node, frame)
self.write('(')
self.signature(node, frame, False, extra_kwargs)
self.write(')')
def visit_Keyword(self, node, frame):
self.visit(node.key, frame)
self.write('=')
self.visit(node.value, frame)