23 return 0 if x
in (None, JS_Undefined
) else x
26 return op(zeroise(a
), zeroise(b
)) & 0xffffffff
34 if JS_Undefined
in (a
, b
):
36 return op(a
or 0, b
or 0)
42 if JS_Undefined
in (a
, b
) or not (a
and b
):
44 return (a
or 0) / b
if b
else float('inf')
48 if JS_Undefined
in (a
, b
) or not b
:
55 return 1 # even 0 ** 0 !!
56 elif JS_Undefined
in (a
, b
):
64 if {a, b}
<= {None, JS_Undefined}
:
74 if JS_Undefined
in (a
, b
):
76 if isinstance(a
, str) or isinstance(b
, str):
77 return op(str(a
or 0), str(b
or 0))
78 return op(a
or 0, b
or 0)
83 def _js_ternary(cndn
, if_true
=True, if_false
=False):
84 """Simulate JS's ternary operator (cndn?if_true:if_false)"""
85 if cndn
in (False, None, 0, '', JS_Undefined
):
87 with contextlib
.suppress(TypeError):
88 if math
.isnan(cndn
): # NB: NaN cannot be checked by membership
93 # Ref: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_Precedence
94 _OPERATORS
= { # None => Defined in JSInterpreter._operator
100 '|': _js_bit_op(operator
.or_
),
101 '^': _js_bit_op(operator
.xor
),
102 '&': _js_bit_op(operator
.and_
),
105 '!==': operator
.is_not
,
106 '==': _js_eq_op(operator
.eq
),
107 '!=': _js_eq_op(operator
.ne
),
109 '<=': _js_comp_op(operator
.le
),
110 '>=': _js_comp_op(operator
.ge
),
111 '<': _js_comp_op(operator
.lt
),
112 '>': _js_comp_op(operator
.gt
),
114 '>>': _js_bit_op(operator
.rshift
),
115 '<<': _js_bit_op(operator
.lshift
),
117 '+': _js_arith_op(operator
.add
),
118 '-': _js_arith_op(operator
.sub
),
120 '*': _js_arith_op(operator
.mul
),
126 _COMP_OPERATORS
= {'===', '!==', '==', '!=', '<=', '>=', '<', '>'}
128 _NAME_RE
= r
'[a-zA-Z_$][\w$]*'
129 _MATCHING_PARENS
= dict(zip(*zip('()', '{}', '[]')))
137 class JS_Break(ExtractorError
):
139 ExtractorError
.__init
__(self
, 'Invalid break')
142 class JS_Continue(ExtractorError
):
144 ExtractorError
.__init
__(self
, 'Invalid continue')
147 class JS_Throw(ExtractorError
):
148 def __init__(self
, e
):
150 ExtractorError
.__init
__(self
, f
'Uncaught exception {e}')
153 class LocalNameSpace(collections
.ChainMap
):
154 def __setitem__(self
, key
, value
):
155 for scope
in self
.maps
:
159 self
.maps
[0][key
] = value
161 def __delitem__(self
, key
):
162 raise NotImplementedError('Deleting is not supported')
167 ENABLED
= False and 'pytest' in sys
.modules
170 def write(*args
, level
=100):
171 write_string(f
'[debug] JS: {" " * (100 - level)}'
172 f
'{" ".join(truncate_string(str(x), 50, 50) for x in args)}\n')
175 def wrap_interpreter(cls
, f
):
176 def interpret_statement(self
, stmt
, local_vars
, allow_recursion
, *args
, **kwargs
):
177 if cls
.ENABLED
and stmt
.strip():
178 cls
.write(stmt
, level
=allow_recursion
)
180 ret
, should_ret
= f(self
, stmt
, local_vars
, allow_recursion
, *args
, **kwargs
)
181 except Exception as e
:
183 if isinstance(e
, ExtractorError
):
185 cls
.write('=> Raises:', e
, '<-|', stmt
, level
=allow_recursion
)
187 if cls
.ENABLED
and stmt
.strip():
188 if should_ret
or not repr(ret
) == stmt
:
189 cls
.write(['->', '=>'][should_ret
], repr(ret
), '<-|', stmt
, level
=allow_recursion
)
190 return ret
, should_ret
191 return interpret_statement
195 __named_object_counter
= 0
198 # special knowledge: Python's re flags are bitmask values, current max 128
199 # invent new bitmask values well above that for literal parsing
200 # TODO: new pattern class to execute matches with these flags
201 'd': 1024, # Generate indices for substring matches
202 'g': 2048, # Global search
203 'i': re
.I
, # Case-insensitive search
204 'm': re
.M
, # Multi-line search
205 's': re
.S
, # Allows . to match newline characters
206 'u': re
.U
, # Treat a pattern as a sequence of unicode code points
207 'y': 4096, # Perform a "sticky" search that matches starting at the current position in the target string
210 def __init__(self
, code
, objects
=None):
211 self
.code
, self
._functions
= code
, {}
212 self
._objects
= {} if objects
is None else objects
214 class Exception(ExtractorError
):
215 def __init__(self
, msg
, expr
=None, *args
, **kwargs
):
217 msg
= f
'{msg.rstrip()} in: {truncate_string(expr, 50, 50)}'
218 super().__init
__(msg
, *args
, **kwargs
)
220 def _named_object(self
, namespace
, obj
):
221 self
.__named
_object
_counter
+= 1
222 name
= f
'__yt_dlp_jsinterp_obj{self.__named_object_counter}'
223 if callable(obj
) and not isinstance(obj
, function_with_repr
):
224 obj
= function_with_repr(obj
, f
'F<{self.__named_object_counter}>')
225 namespace
[name
] = obj
229 def _regex_flags(cls
, expr
):
233 for idx
, ch
in enumerate(expr
):
234 if ch
not in cls
._RE
_FLAGS
:
236 flags |
= cls
._RE
_FLAGS
[ch
]
237 return flags
, expr
[idx
+ 1:]
240 def _separate(expr
, delim
=',', max_split
=None):
241 OP_CHARS
= '+-*/%&|^=<>!,;{}:['
244 counters
= {k: 0 for k in _MATCHING_PARENS.values()}
245 start
, splits
, pos
, delim_len
= 0, 0, 0, len(delim
) - 1
246 in_quote
, escaping
, after_op
, in_regex_char_group
= None, False, True, False
247 for idx
, char
in enumerate(expr
):
248 if not in_quote
and char
in _MATCHING_PARENS
:
249 counters
[_MATCHING_PARENS
[char
]] += 1
250 elif not in_quote
and char
in counters
:
251 # Something's wrong if we get negative, but ignore it anyway
255 if char
in _QUOTES
and in_quote
in (char
, None):
256 if in_quote
or after_op
or char
!= '/':
257 in_quote
= None if in_quote
and not in_regex_char_group
else char
258 elif in_quote
== '/' and char
in '[]':
259 in_regex_char_group
= char
== '['
260 escaping
= not escaping
and in_quote
and char
== '\\'
261 after_op
= not in_quote
and char
in OP_CHARS
or (char
.isspace() and after_op
)
263 if char
!= delim
[pos
] or any(counters
.values()) or in_quote
:
266 elif pos
!= delim_len
:
269 yield expr
[start
: idx
- delim_len
]
270 start
, pos
= idx
+ 1, 0
272 if max_split
and splits
>= max_split
:
277 def _separate_at_paren(cls
, expr
, delim
=None):
279 delim
= expr
and _MATCHING_PARENS
[expr
[0]]
280 separated
= list(cls
._separate
(expr
, delim
, 1))
281 if len(separated
) < 2:
282 raise cls
.Exception(f
'No terminating paren {delim}', expr
)
283 return separated
[0][1:].strip(), separated
[1].strip()
285 def _operator(self
, op
, left_val
, right_expr
, expr
, local_vars
, allow_recursion
):
286 if op
in ('||', '&&'):
287 if (op
== '&&') ^
_js_ternary(left_val
):
288 return left_val
# short circuiting
290 if left_val
not in (None, JS_Undefined
):
293 right_expr
= _js_ternary(left_val
, *self
._separate
(right_expr
, ':', 1))
295 right_val
= self
.interpret_expression(right_expr
, local_vars
, allow_recursion
)
296 if not _OPERATORS
.get(op
):
300 return _OPERATORS
[op
](left_val
, right_val
)
301 except Exception as e
:
302 raise self
.Exception(f
'Failed to evaluate {left_val!r} {op} {right_val!r}', expr
, cause
=e
)
304 def _index(self
, obj
, idx
, allow_undefined
=False):
308 return obj
[int(idx
)] if isinstance(obj
, list) else obj
[idx
]
309 except Exception as e
:
312 raise self
.Exception(f
'Cannot get index {idx}', repr(obj
), cause
=e
)
314 def _dump(self
, obj
, namespace
):
316 return json
.dumps(obj
)
318 return self
._named
_object
(namespace
, obj
)
320 @Debugger.wrap_interpreter
321 def interpret_statement(self
, stmt
, local_vars
, allow_recursion
=100):
322 if allow_recursion
< 0:
323 raise self
.Exception('Recursion limit reached')
326 should_return
= False
327 sub_statements
= list(self
._separate
(stmt
, ';')) or ['']
328 expr
= stmt
= sub_statements
.pop().strip()
330 for sub_stmt
in sub_statements
:
331 ret
, should_return
= self
.interpret_statement(sub_stmt
, local_vars
, allow_recursion
)
333 return ret
, should_return
335 m
= re
.match(r
'(?P<var>(?:var|const|let)\s)|return(?:\s+|(?=["\'])|$
)|
(?P
<throw
>throw\s
+)', stmt)
337 expr = stmt[len(m.group(0)):].strip()
339 raise JS_Throw(self.interpret_expression(expr, local_vars, allow_recursion))
340 should_return = not m.group('var
')
342 return None, should_return
344 if expr[0] in _QUOTES:
345 inner, outer = self._separate(expr, expr[0], 1)
347 flags, outer = self._regex_flags(outer)
348 # Avoid https://github.com/python/cpython/issues/74534
349 inner = re.compile(inner[1:].replace('[[', r'[\
['), flags=flags)
351 inner = json.loads(js_to_json(f'{inner}{expr[0]}
', strict=True))
353 return inner, should_return
354 expr = self._named_object(local_vars, inner) + outer
356 if expr.startswith('new
'):
358 if obj.startswith('Date('):
359 left, right = self._separate_at_paren(obj[4:])
360 date = unified_timestamp(
361 self.interpret_expression(left, local_vars, allow_recursion), False)
363 raise self.Exception(f'Failed to parse date {left!r}
', expr)
364 expr = self._dump(int(date * 1000), local_vars) + right
366 raise self.Exception(f'Unsupported
object {obj}
', expr)
368 if expr.startswith('void
'):
369 left = self.interpret_expression(expr[5:], local_vars, allow_recursion)
370 return None, should_return
372 if expr.startswith('{'):
373 inner, outer = self._separate_at_paren(expr)
374 # try for object expression (Map)
375 sub_expressions = [list(self._separate(sub_expr.strip(), ':', 1)) for sub_expr in self._separate(inner)]
376 if all(len(sub_expr) == 2 for sub_expr in sub_expressions):
377 def dict_item(key, val):
378 val = self.interpret_expression(val, local_vars, allow_recursion)
379 if re.match(_NAME_RE, key):
381 return self.interpret_expression(key, local_vars, allow_recursion), val
383 return dict(dict_item(k, v) for k, v in sub_expressions), should_return
385 inner, should_abort = self.interpret_statement(inner, local_vars, allow_recursion)
386 if not outer or should_abort:
387 return inner, should_abort or should_return
389 expr = self._dump(inner, local_vars) + outer
391 if expr.startswith('('):
392 inner, outer = self._separate_at_paren(expr)
393 inner, should_abort = self.interpret_statement(inner, local_vars, allow_recursion)
394 if not outer or should_abort:
395 return inner, should_abort or should_return
397 expr = self._dump(inner, local_vars) + outer
399 if expr.startswith('['):
400 inner, outer = self._separate_at_paren(expr)
401 name = self._named_object(local_vars, [
402 self.interpret_expression(item, local_vars, allow_recursion)
403 for item in self._separate(inner)])
406 m = re.match(r'''(?x)
409 (?P<switch>switch)\s*\(|
412 md = m.groupdict() if m else {}
414 cndn, expr = self._separate_at_paren(expr[m.end() - 1:])
415 if_expr, expr = self._separate_at_paren(expr.lstrip())
416 # TODO: "else if" is not handled
418 m = re.match(r'else\s
*{', expr)
420 else_expr, expr = self._separate_at_paren(expr[m.end() - 1:])
421 cndn = _js_ternary(self.interpret_expression(cndn, local_vars, allow_recursion))
422 ret, should_abort = self.interpret_statement(
423 if_expr if cndn else else_expr, local_vars, allow_recursion)
428 try_expr, expr = self._separate_at_paren(expr[m.end() - 1:])
431 ret, should_abort = self.interpret_statement(try_expr, local_vars, allow_recursion)
434 except Exception as e:
435 # XXX: This works for now, but makes debugging future issues very hard
438 pending = (None, False)
439 m = re.match(r'catch\s
*(?P
<err
>\
(\s
*{_NAME_RE}\s
*\
))?\
{{'.format(**globals()), expr)
441 sub_expr, expr = self._separate_at_paren(expr[m.end() - 1:])
445 catch_vars[m.group('err
')] = err.error if isinstance(err, JS_Throw) else err
446 catch_vars = local_vars.new_child(catch_vars)
447 err, pending = None, self.interpret_statement(sub_expr, catch_vars, allow_recursion)
449 m = re.match(r'finally\s
*\
{', expr)
451 sub_expr, expr = self._separate_at_paren(expr[m.end() - 1:])
452 ret, should_abort = self.interpret_statement(sub_expr, local_vars, allow_recursion)
456 ret, should_abort = pending
464 constructor, remaining = self._separate_at_paren(expr[m.end() - 1:])
465 if remaining.startswith('{'):
466 body, expr = self._separate_at_paren(remaining)
468 switch_m = re.match(r'switch\s
*\
(', remaining) # FIXME
470 switch_val, remaining = self._separate_at_paren(remaining[switch_m.end() - 1:])
471 body, expr = self._separate_at_paren(remaining, '}')
472 body = 'switch(%s){%s}
' % (switch_val, body)
474 body, expr = remaining, ''
475 start, cndn, increment = self._separate(constructor, ';')
476 self.interpret_expression(start, local_vars, allow_recursion)
478 if not _js_ternary(self.interpret_expression(cndn, local_vars, allow_recursion)):
481 ret, should_abort = self.interpret_statement(body, local_vars, allow_recursion)
488 self.interpret_expression(increment, local_vars, allow_recursion)
490 elif md.get('switch
'):
491 switch_val, remaining = self._separate_at_paren(expr[m.end() - 1:])
492 switch_val = self.interpret_expression(switch_val, local_vars, allow_recursion)
493 body, expr = self._separate_at_paren(remaining, '}')
494 items = body.replace('default
:', 'case default
:').split('case
')[1:]
495 for default in (False, True):
498 case, stmt = (i.strip() for i in self._separate(item, ':', 1))
500 matched = matched or case == 'default
'
502 matched = (case != 'default
'
503 and switch_val == self.interpret_expression(case, local_vars, allow_recursion))
507 ret, should_abort = self.interpret_statement(stmt, local_vars, allow_recursion)
516 ret, should_abort = self.interpret_statement(expr, local_vars, allow_recursion)
517 return ret, should_abort or should_return
519 # Comma separated statements
520 sub_expressions = list(self._separate(expr))
521 if len(sub_expressions) > 1:
522 for sub_expr in sub_expressions:
523 ret, should_abort = self.interpret_statement(sub_expr, local_vars, allow_recursion)
528 for m in re.finditer(rf'''(?x)
529 (?P<pre_sign>\+\+|--)(?P<var1>{_NAME_RE})|
530 (?P<var2>{_NAME_RE})(?P<post_sign>\+\+|--)''', expr):
531 var = m.group('var1
') or m.group('var2
')
532 start, end = m.span()
533 sign = m.group('pre_sign
') or m.group('post_sign
')
534 ret = local_vars[var]
535 local_vars[var] += 1 if sign[0] == '+' else -1
536 if m.group('pre_sign
'):
537 ret = local_vars[var]
538 expr = expr[:start] + self._dump(ret, local_vars) + expr[end:]
541 return None, should_return
543 m = re.match(fr'''(?x)
545 (?P<out>{_NAME_RE})(?:\[(?P<index>[^\]]+?)\])?\s*
546 (?P<op>{"|".join(map(re.escape, set(_OPERATORS) - _COMP_OPERATORS))})?
549 (?!if|return|true|false|null|undefined|NaN)(?P<name>{_NAME_RE})$
551 (?P<in>{_NAME_RE})\[(?P<idx>.+)\]$
553 (?P<var>{_NAME_RE})(?:(?P<nullish>\?)?\.(?P<member>[^(]+)|\[(?P<member2>[^\]]+)\])\s*
555 (?P<fname>{_NAME_RE})\((?P<args>.*)\)$
557 if m and m.group('assign
'):
558 left_val = local_vars.get(m.group('out
'))
560 if not m.group('index
'):
561 local_vars[m.group('out
')] = self._operator(
562 m.group('op
'), left_val, m.group('expr
'), expr, local_vars, allow_recursion)
563 return local_vars[m.group('out
')], should_return
564 elif left_val in (None, JS_Undefined):
565 raise self.Exception(f'Cannot index undefined variable {m.group("out")}
', expr)
567 idx = self.interpret_expression(m.group('index
'), local_vars, allow_recursion)
568 if not isinstance(idx, (int, float)):
569 raise self.Exception(f'List index {idx} must be integer
', expr)
571 left_val[idx] = self._operator(
572 m.group('op
'), self._index(left_val, idx), m.group('expr
'), expr, local_vars, allow_recursion)
573 return left_val[idx], should_return
576 return int(expr), should_return
578 elif expr == 'break':
580 elif expr == 'continue':
582 elif expr == 'undefined
':
583 return JS_Undefined, should_return
585 return float('NaN
'), should_return
587 elif m and m.group('return'):
588 return local_vars.get(m.group('name
'), JS_Undefined), should_return
590 with contextlib.suppress(ValueError):
591 return json.loads(js_to_json(expr, strict=True)), should_return
593 if m and m.group('indexing
'):
594 val = local_vars[m.group('in')]
595 idx = self.interpret_expression(m.group('idx
'), local_vars, allow_recursion)
596 return self._index(val, idx), should_return
598 for op in _OPERATORS:
599 separated = list(self._separate(expr, op))
600 right_expr = separated.pop()
602 if op in '?
<>*-' and len(separated) > 1 and not separated[-1].strip():
604 elif not (separated and op == '?
' and right_expr.startswith('.')):
606 right_expr = f'{op}{right_expr}
'
608 right_expr = f'{separated.pop()}{op}{right_expr}
'
611 left_val = self.interpret_expression(op.join(separated), local_vars, allow_recursion)
612 return self._operator(op, left_val, right_expr, expr, local_vars, allow_recursion), should_return
614 if m and m.group('attribute
'):
615 variable, member, nullish = m.group('var
', 'member
', 'nullish
')
617 member = self.interpret_expression(m.group('member2
'), local_vars, allow_recursion)
618 arg_str = expr[m.end():]
619 if arg_str.startswith('('):
620 arg_str, remaining = self._separate_at_paren(arg_str)
622 arg_str, remaining = None, arg_str
624 def assertion(cndn, msg):
625 """ assert, but without risk of getting optimized out """
627 raise self.Exception(f'{member} {msg}
', expr)
630 if (variable, member) == ('console
', 'debug
'):
632 Debugger.write(self.interpret_expression(f'[{arg_str}
]', local_vars, allow_recursion))
639 obj = local_vars.get(variable, types.get(variable, NO_DEFAULT))
640 if obj is NO_DEFAULT:
641 if variable not in self._objects:
643 self._objects[variable] = self.extract_object(variable)
644 except self.Exception:
647 obj = self._objects.get(variable, JS_Undefined)
649 if nullish and obj is JS_Undefined:
654 return self._index(obj, member, nullish)
658 self.interpret_expression(v, local_vars, allow_recursion)
659 for v in self._separate(arg_str)]
662 if member == 'fromCharCode
':
663 assertion(argvals, 'takes one
or more arguments
')
664 return ''.join(map(chr, argvals))
665 raise self.Exception(f'Unsupported String method {member}
', expr)
668 assertion(len(argvals) == 2, 'takes two arguments
')
669 return argvals[0] ** argvals[1]
670 raise self.Exception(f'Unsupported Math method {member}
', expr)
672 if member == 'split
':
673 assertion(argvals, 'takes one
or more arguments
')
674 assertion(len(argvals) == 1, 'with limit argument
is not implemented
')
675 return obj.split(argvals[0]) if argvals[0] else list(obj)
676 elif member == 'join
':
677 assertion(isinstance(obj, list), 'must be applied on a
list')
678 assertion(len(argvals) == 1, 'takes exactly one argument
')
679 return argvals[0].join(obj)
680 elif member == 'reverse
':
681 assertion(not argvals, 'does
not take any arguments
')
684 elif member == 'slice':
685 assertion(isinstance(obj, list), 'must be applied on a
list')
686 assertion(len(argvals) == 1, 'takes exactly one argument
')
687 return obj[argvals[0]:]
688 elif member == 'splice
':
689 assertion(isinstance(obj, list), 'must be applied on a
list')
690 assertion(argvals, 'takes one
or more arguments
')
691 index, howMany = map(int, (argvals + [len(obj)])[:2])
694 add_items = argvals[2:]
696 for i in range(index, min(index + howMany, len(obj))):
697 res.append(obj.pop(index))
698 for i, item in enumerate(add_items):
699 obj.insert(index + i, item)
701 elif member == 'unshift
':
702 assertion(isinstance(obj, list), 'must be applied on a
list')
703 assertion(argvals, 'takes one
or more arguments
')
704 for item in reversed(argvals):
707 elif member == 'pop
':
708 assertion(isinstance(obj, list), 'must be applied on a
list')
709 assertion(not argvals, 'does
not take any arguments
')
713 elif member == 'push
':
714 assertion(argvals, 'takes one
or more arguments
')
717 elif member == 'forEach
':
718 assertion(argvals, 'takes one
or more arguments
')
719 assertion(len(argvals) <= 2, 'takes at
-most
2 arguments
')
720 f, this = (argvals + [''])[:2]
721 return [f((item, idx, obj), {'this': this}, allow_recursion) for idx, item in enumerate(obj)]
722 elif member == 'indexOf
':
723 assertion(argvals, 'takes one
or more arguments
')
724 assertion(len(argvals) <= 2, 'takes at
-most
2 arguments
')
725 idx, start = (argvals + [0])[:2]
727 return obj.index(idx, start)
730 elif member == 'charCodeAt
':
731 assertion(isinstance(obj, str), 'must be applied on a string
')
732 assertion(len(argvals) == 1, 'takes exactly one argument
')
733 idx = argvals[0] if isinstance(argvals[0], int) else 0
738 idx = int(member) if isinstance(obj, list) else member
739 return obj[idx](argvals, allow_recursion=allow_recursion)
742 ret, should_abort = self.interpret_statement(
743 self._named_object(local_vars, eval_method()) + remaining,
744 local_vars, allow_recursion)
745 return ret, should_return or should_abort
747 return eval_method(), should_return
749 elif m and m.group('function
'):
750 fname = m.group('fname
')
751 argvals = [self.interpret_expression(v, local_vars, allow_recursion)
752 for v in self._separate(m.group('args
'))]
753 if fname in local_vars:
754 return local_vars[fname](argvals, allow_recursion=allow_recursion), should_return
755 elif fname not in self._functions:
756 self._functions[fname] = self.extract_function(fname)
757 return self._functions[fname](argvals, allow_recursion=allow_recursion), should_return
759 raise self.Exception(
760 f'Unsupported JS expression {truncate_string(expr, 20, 20) if expr != stmt else ""}
', stmt)
762 def interpret_expression(self, expr, local_vars, allow_recursion):
763 ret, should_return = self.interpret_statement(expr, local_vars, allow_recursion)
765 raise self.Exception('Cannot
return from an expression
', expr)
768 def extract_object(self, objname):
769 _FUNC_NAME_RE = r'''(?:[a-zA-Z$0-9]+|"[a-zA-Z$0-9]+"|'[a
-zA
-Z$
0-9]+')'''
773 (?<!this\.)%s\s*=\s*{\s*
774 (?P<fields>(%s\s*:\s*function\s*\(.*?\)\s*{.*?}(?:,\s*)?)*)
776 ''' % (re.escape(objname), _FUNC_NAME_RE),
779 raise self.Exception(f'Could
not find
object {objname}
')
780 fields = obj_m.group('fields
')
781 # Currently, it only supports function definitions
782 fields_m = re.finditer(
784 (?P<key>%s)\s*:\s*function\s*\((?P<args>(?:%s|,)*)\){(?P<code>[^}]+)}
785 ''' % (_FUNC_NAME_RE, _NAME_RE),
788 argnames = f.group('args
').split(',')
789 name = remove_quotes(f.group('key
'))
790 obj[name] = function_with_repr(self.build_function(argnames, f.group('code
')), f'F
<{name}
>')
794 def extract_function_code(self, funcname):
795 """ @returns argnames, code """
800 [{;,]\s*%(name)s\s*=\s*function|
801 (?:var|const|let)\s+%(name)s\s*=\s*function
803 \((?P<args>[^)]*)\)\s*
804 (?P<code>{.+})''' % {'name': re.escape(funcname)},
806 code, _ = self._separate_at_paren(func_m.group('code
'))
808 raise self.Exception(f'Could
not find JS function
"{funcname}"')
809 return [x.strip() for x in func_m.group('args
').split(',')], code
811 def extract_function(self, funcname):
812 return function_with_repr(
813 self.extract_function_from_code(*self.extract_function_code(funcname)),
816 def extract_function_from_code(self, argnames, code, *global_stack):
819 mobj = re.search(r'function\
((?P
<args
>[^
)]*)\
)\s
*{', code)
822 start, body_start = mobj.span()
823 body, remaining = self._separate_at_paren(code[body_start - 1:])
824 name = self._named_object(local_vars, self.extract_function_from_code(
825 [x.strip() for x in mobj.group('args
').split(',')],
826 body, local_vars, *global_stack))
827 code = code[:start] + name + remaining
828 return self.build_function(argnames, code, local_vars, *global_stack)
830 def call_function(self, funcname, *args):
831 return self.extract_function(funcname)(args)
833 def build_function(self, argnames, code, *global_stack):
834 global_stack = list(global_stack) or [{}]
835 argnames = tuple(argnames)
837 def resf(args, kwargs={}, allow_recursion=100):
838 global_stack[0].update(itertools.zip_longest(argnames, args, fillvalue=None))
839 global_stack[0].update(kwargs)
840 var_stack = LocalNameSpace(*global_stack)
841 ret, should_abort = self.interpret_statement(code.replace('\n', ' '), var_stack, allow_recursion - 1)