forked from ionelmc/python-hunter
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_predicates.pyx
More file actions
729 lines (618 loc) · 24 KB
/
_predicates.pyx
File metadata and controls
729 lines (618 loc) · 24 KB
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
# cython: linetrace=True, language_level=3str
from __future__ import absolute_import
from collections import deque
from inspect import isclass
from itertools import chain
from re import compile as re_compile
cimport cython
from cpython cimport bool
from cpython.object cimport Py_EQ
from cpython.object cimport Py_NE
from cpython.object cimport PyObject_RichCompare
from ._event cimport Event
from ._event cimport fast_clone
from ._event cimport fast_detach
from ._tracer cimport *
from .actions import Action
from .actions import ColorStreamAction
__all__ = (
'And',
'From',
'Not',
'Or',
'Query',
'When',
)
cdef tuple ALLOWED_KEYS = (
'function', 'module', 'lineno', 'globals', 'stdlib', 'arg', 'locals', 'kind', 'filename', 'source',
'fullsource', 'threadname', 'threadid', 'depth', 'calls', 'builtin',
)
cdef tuple ALLOWED_OPERATORS = (
'startswith', 'endswith', 'in', 'contains', 'regex',
'sw', 'ew', 'has', 'rx',
'gt', 'gte', 'lt', 'lte',
)
ctypedef object (*Event_getter_typedef)(Event)
cdef Event_get_function(Event event): return event.function_getter()
cdef Event_get_module(Event event): return event.module_getter()
cdef Event_get_lineno(Event event): return event.lineno_getter()
cdef Event_get_globals(Event event): return event.globals_getter()
cdef Event_get_stdlib(Event event): return event.stdlib_getter()
cdef Event_get_arg(Event event): return event.arg
cdef Event_get_locals(Event event): return event.locals_getter()
cdef Event_get_kind(Event event): return event.kind
cdef Event_get_filename(Event event): return event.filename_getter()
cdef Event_get_source(Event event): return event.source_getter()
cdef Event_get_fullsource(Event event): return event.fullsource_getter()
cdef Event_get_threadname(Event event): return event.threadname_getter()
cdef Event_get_threadid(Event event): return event.threadid_getter()
cdef Event_get_depth(Event event): return event.depth
cdef Event_get_calls(Event event): return event.calls
cdef Event_getter_typedef[15] Event_getters = [
Event_get_function,
Event_get_module,
Event_get_lineno,
Event_get_globals,
Event_get_stdlib,
Event_get_arg,
Event_get_locals,
Event_get_kind,
Event_get_filename,
Event_get_source,
Event_get_fullsource,
Event_get_threadname,
Event_get_threadid,
Event_get_depth,
Event_get_calls,
]
@cython.final
cdef class QueryEntry:
cdef Event_getter_typedef getter
cdef int getter_index
cdef object value
def __init__(self, object value, str name):
self.value = value
self.getter_index = ALLOWED_KEYS.index(name)
self.getter = Event_getters[self.getter_index]
def __str__(self):
return str(self.value)
def __repr__(self):
return repr(self.value)
def __eq__(self, other):
return (
isinstance(other, QueryEntry)
and self.value == (<QueryEntry> other).value
and self.getter_index == (<QueryEntry> other).getter_index
)
@cython.final
cdef class Query:
"""
A query class.
See :class:`hunter.event.Event` for fields that can be filtered on.
"""
def __init__(self, **query):
"""
Args:
query: criteria to match on.
Accepted arguments:
``arg``,
``calls``,
``code``,
``depth``,
``filename``,
``frame``,
``fullsource``,
``function``,
``globals``,
``kind``,
``lineno``,
``locals``,
``module``,
``source``,
``stdlib``,
``threadid``,
``threadname``.
"""
cdef void* prefix_getter_pointer
query_eq = {}
query_startswith = {}
query_endswith = {}
query_in = {}
query_contains = {}
query_regex = {}
query_lt = {}
query_lte = {}
query_gt = {}
query_gte = {}
for key, value in query.items():
parts = [p for p in key.split('_') if p]
count = len(parts)
if count > 2:
raise TypeError('Unexpected argument %r. Must be one of %s with optional operators like: %s' % (
key, ALLOWED_KEYS, ALLOWED_OPERATORS
))
elif count == 2:
prefix, operator = parts
if operator in ('startswith', 'sw'):
if not isinstance(value, basestring):
if not isinstance(value, (list, set, tuple)):
raise ValueError('Value %r for %r is invalid. Must be a string, list, tuple or set.' % (value, key))
value = tuple(value)
mapping = query_startswith
elif operator in ('endswith', 'ew'):
if not isinstance(value, basestring):
if not isinstance(value, (list, set, tuple)):
raise ValueError('Value %r for %r is invalid. Must be a string, list, tuple or set.' % (value, key))
value = tuple(value)
mapping = query_endswith
elif operator == 'in':
mapping = query_in
elif operator in ('contains', 'has'):
mapping = query_contains
elif operator in ('regex', 'rx'):
value = re_compile(value)
mapping = query_regex
elif operator == 'lt':
mapping = query_lt
elif operator == 'lte':
mapping = query_lte
elif operator == 'gt':
mapping = query_gt
elif operator == 'gte':
mapping = query_gte
else:
raise TypeError('Unexpected operator %r. Must be one of %s.' % (operator, ALLOWED_OPERATORS))
else:
mapping = query_eq
prefix = key
if prefix not in ALLOWED_KEYS:
raise TypeError('Unexpected argument %r. Must be one of %s.' % (key, ALLOWED_KEYS))
mapping[prefix] = QueryEntry(value, prefix)
self.query_eq = tuple(sorted(query_eq.items()))
self.query_startswith = tuple(sorted(query_startswith.items()))
self.query_endswith = tuple(sorted(query_endswith.items()))
self.query_in = tuple(sorted(query_in.items()))
self.query_contains = tuple(sorted(query_contains.items()))
self.query_regex = tuple(sorted(query_regex.items()))
self.query_lt = tuple(sorted(query_lt.items()))
self.query_lte = tuple(sorted(query_lte.items()))
self.query_gt = tuple(sorted(query_gt.items()))
self.query_gte = tuple(sorted(query_gte.items()))
def __str__(self):
return 'Query(%s)' % (
', '.join(
', '.join('%s%s=%r' % (key, kind, value) for key, value in mapping)
for kind, mapping in [
('', self.query_eq),
('_in', self.query_in),
('_contains', self.query_contains),
('_startswith', self.query_startswith),
('_endswith', self.query_endswith),
('_regex', self.query_regex),
('_lt', self.query_lt),
('_lte', self.query_lte),
('_gt', self.query_gt),
('_gte', self.query_gte),
] if mapping
)
)
def __repr__(self):
return '<hunter._predicates.Query: %s>' % ' '.join(
fmt % (mapping,) for fmt, mapping in [
('query_eq=%r', self.query_eq),
('query_in=%r', self.query_in),
('query_contains=%r', self.query_contains),
('query_startswith=%r', self.query_startswith),
('query_endswith=%r', self.query_endswith),
('query_regex=%r', self.query_regex),
('query_lt=%r', self.query_lt),
('query_lte=%r', self.query_lte),
('query_gt=%r', self.query_gt),
('query_gte=%r', self.query_gte),
] if mapping
)
def __eq__(self, other):
return (
isinstance(other, Query)
and self.query_eq == (<Query> other).query_eq
and self.query_startswith == (<Query> other).query_startswith
and self.query_endswith == (<Query> other).query_endswith
and self.query_in == (<Query> other).query_in
and self.query_contains == (<Query> other).query_contains
and self.query_regex == (<Query> other).query_regex
and self.query_lt == (<Query>other).query_lt
and self.query_lte == (<Query>other).query_lte
and self.query_gt == (<Query>other).query_gt
and self.query_gte == (<Query>other).query_gte
)
def __call__(self, Event event):
return fast_Query_call(self, event)
def __or__(self, other):
return Or(self, other)
def __and__(self, other):
return And(self, other)
def __invert__(self):
return Not(self)
cdef fast_Query_call(Query self, Event event):
for key, entry in self.query_eq:
value_from_event = (<QueryEntry>entry).getter(event)
if value_from_event != (<QueryEntry>entry).value:
return False
for key, entry in self.query_in:
value_from_event = (<QueryEntry>entry).getter(event)
if (<str?>value_from_event) not in (<QueryEntry>entry).value:
return False
for key, entry in self.query_contains:
value_from_event = (<QueryEntry>entry).getter(event)
if (<QueryEntry>entry).value not in (<str?>value_from_event):
return False
for key, entry in self.query_startswith:
value_from_event = (<QueryEntry>entry).getter(event)
if not (<str?>value_from_event).startswith((<QueryEntry>entry).value):
return False
for key, entry in self.query_endswith:
value_from_event = (<QueryEntry>entry).getter(event)
if not (<str?>value_from_event).endswith((<QueryEntry>entry).value):
return False
for key, entry in self.query_regex:
value_from_event = (<QueryEntry>entry).getter(event)
if not (<QueryEntry>entry).value.match(value_from_event):
return False
for key, entry in self.query_gt:
value_from_event = (<QueryEntry>entry).getter(event)
if not value_from_event > (<QueryEntry>entry).value:
return False
for key, entry in self.query_gte:
value_from_event = (<QueryEntry>entry).getter(event)
if not value_from_event >= (<QueryEntry>entry).value:
return False
for key, entry in self.query_lt:
value_from_event = (<QueryEntry>entry).getter(event)
if not value_from_event < (<QueryEntry>entry).value:
return False
for key, entry in self.query_lte:
value_from_event = (<QueryEntry>entry).getter(event)
if not value_from_event <= (<QueryEntry>entry).value:
return False
return True
@cython.final
cdef class When:
"""
Runs ``actions`` when ``condition(event)`` is ``True``.
Actions take a single ``event`` argument.
"""
def __init__(self, condition, *actions):
if not actions:
raise TypeError('Must give at least one action.')
self.condition = condition
self.actions = tuple(
action() if isclass(action) and issubclass(action, Action) else action
for action in actions)
def __str__(self):
return 'When(%s, %s)' % (
self.condition,
', '.join(repr(p) for p in self.actions)
)
def __repr__(self):
return '<hunter._predicates.When: condition=%r, actions=%r>' % (self.condition, self.actions)
def __eq__(self, other):
return (
isinstance(other, When)
and self.condition == (<When> other).condition
and self.actions == (<When> other).actions
)
def __call__(self, Event event):
return fast_When_call(self, event)
def __or__(self, other):
return Or(self, other)
def __and__(self, other):
return And(self, other)
def __invert__(self):
return Not(self)
cdef inline fast_When_call(When self, Event event):
cdef object result
result = fast_call(self.condition, event)
if result:
for action in self.actions:
action(event)
return result
@cython.final
cdef class From:
"""
Keep running ``predicates`` after ``condition(event)`` is ``True``.
"""
def __init__(self, condition, predicate=None, watermark=0):
self.condition = condition
self.predicate = predicate
self.watermark = watermark
self.origin_depth = -1
self.origin_calls = -1
def __str__(self):
return 'From(%s, %s, watermark=%s)' % (
self.condition, self.predicate, self.watermark
)
def __repr__(self):
return '<hunter._predicates.From: condition=%r, predicate=%r, watermark=%r>' % (
self.condition, self.predicate, self.watermark
)
def __eq__(self, other):
return (
isinstance(other, From)
and self.condition == (<From> other).condition
and self.predicate == (<From> other).predicate
)
def __call__(self, Event event):
return fast_From_call(self, event)
def __or__(self, other):
return Or(self, other)
def __and__(self, other):
return And(self, other)
def __invert__(self):
return Not(self)
cdef inline fast_From_call(From self, Event event):
cdef object result
cdef int delta_depth
cdef int delta_calls
if self.origin_depth == -1:
result = fast_call(self.condition, event)
if result:
self.origin_depth = event.depth
self.origin_calls = event.calls
delta_depth = delta_calls = 0
else:
return False
else:
delta_depth = event.depth - self.origin_depth
delta_calls = event.calls - self.origin_calls
if delta_depth < self.watermark:
self.origin_depth = -1
return False
if self.predicate is None:
return True
else:
relative_event = fast_clone(event)
relative_event.depth = delta_depth
relative_event.calls = delta_calls
return fast_call(self.predicate, relative_event)
@cython.final
cdef class And:
"""
`And` predicate. Exits at the first sub-predicate that returns ``False``.
"""
def __init__(self, *predicates):
self.predicates = predicates
def __str__(self):
return 'And(%s)' % ', '.join(str(p) for p in self.predicates)
def __repr__(self):
return '<hunter._predicates.And: predicates=%r>' % (self.predicates,)
def __eq__(self, other):
return (
isinstance(other, And)
and self.predicates == (<And> other).predicates
)
def __call__(self, Event event):
return fast_And_call(self, event)
def __or__(self, other):
return Or(self, other)
def __and__(self, other):
cdef list predicates
if type(self) is And:
predicates = list((<And>self).predicates)
else:
predicates = [self]
if isinstance(other, And):
predicates.extend((<And> other).predicates)
else:
predicates.append(other)
return And(*predicates)
def __invert__(self):
return Not(self)
cdef inline fast_And_call(And self, Event event):
for predicate in self.predicates:
if not fast_call(predicate, event):
return False
else:
return True
@cython.final
cdef class Or:
"""
`Or` predicate. Exits at first sub-predicate that returns ``True``.
"""
def __init__(self, *predicates):
self.predicates = predicates
def __str__(self):
return 'Or(%s)' % ', '.join(str(p) for p in self.predicates)
def __repr__(self):
return '<hunter._predicates.Or: predicates=%r>' % (self.predicates,)
def __eq__(self, other):
return (
isinstance(other, Or)
and self.predicates == (<Or> other).predicates
)
def __call__(self, Event event):
return fast_Or_call(self, event)
def __or__(self, other):
cdef list predicates
if type(self) is Or:
predicates = list((<Or> self).predicates)
else:
predicates = [self]
if type(other) is Or:
predicates.extend((<Or> other).predicates)
else:
predicates.append(other)
return Or(*predicates)
def __and__(self, other):
return And(self, other)
def __invert__(self):
return Not(self)
cdef inline fast_Or_call(Or self, Event event):
for predicate in self.predicates:
if fast_call(predicate, event):
return True
else:
return False
cdef class Not:
"""
`Not` predicate.
"""
def __init__(self, predicate):
self.predicate = predicate
def __str__(self):
return 'Not(%s)' % self.predicate
def __repr__(self):
return '<hunter._predicates.Not: predicate=%r>' % self.predicate
def __eq__(self, other):
return (
isinstance(other, Not)
and self.predicate == (<Not> other).predicate
)
def __call__(self, Event event):
return fast_Not_call(self, event)
def __or__(self, other):
if type(self) is Not and type(other) is Not:
return Not(And((<Not> self).predicate, (<Not> other).predicate))
else:
return Or(self, other)
def __and__(self, other):
if type(self) is Not and type(other) is Not:
return Not(Or((<Not> self).predicate, (<Not> other).predicate))
else:
return And(self, other)
def __invert__(self):
return self.predicate
cdef inline fast_Not_call(Not self, Event event):
return not fast_call(self.predicate, event)
cdef inline fast_call(callable, Event event):
if type(callable) is Query:
return fast_Query_call(<Query> callable, event)
elif type(callable) is Or:
return fast_Or_call(<Or> callable, event)
elif type(callable) is And:
return fast_And_call(<And> callable, event)
elif type(callable) is Not:
return fast_Not_call(<Not> callable, event)
elif type(callable) is When:
return fast_When_call(<When> callable, event)
elif type(callable) is From:
return fast_From_call(<From> callable, event)
elif type(callable) is Backlog:
return fast_Backlog_call(<Backlog> callable, event)
else:
return callable(event)
@cython.final
cdef class Backlog(object):
def __init__(self, condition, size=100, stack=10, vars=False, strip=True, action=None, filter=None):
self.action = action() if isclass(action) and issubclass(action, Action) else action
if not isinstance(self.action, ColorStreamAction):
raise TypeError("Action %r must be a ColorStreamAction." % self.action)
self.condition = condition
self.queue = deque(maxlen=size)
self.size = size
self.stack = stack
self.strip = strip
self.vars = vars
self._try_repr = self.action.try_repr if self.vars else None
self._filter = filter
def __call__(self, event):
return fast_Backlog_call(self, event)
def __str__(self):
return 'Backlog(%s, size=%s, stack=%s, vars=%s, action=%s, filter=%s)' % (
self.condition, self.size, self.stack, self.vars, self.action, self._filter
)
def __repr__(self):
return '<hunter.predicates.Backlog: condition=%r, size=%r, stack=%r, vars=%r, action=%r, filter=%r>' % (
self.condition, self.size, self.stack, self.vars, self.action, self._filter
)
def __eq__(self, other):
return (
isinstance(other, Backlog) and
self.condition == (<Backlog> other).condition and
self.size == (<Backlog> other).size and
self.stack == (<Backlog> other).stack and
self.vars == (<Backlog> other).vars and
self.action == (<Backlog> other).action
)
def __or__(self, other):
return Or(self, other)
def __and__(self, other):
return And(self, other)
def __invert__(self):
return Backlog(Not(self.condition), size=self.size, stack=self.stack, vars=self.vars, action=self.action, filter=self._filter)
def __ror__(self, other):
return Or(other, self)
def __rand__(self, other):
return And(other, self)
def filter(self, *predicates, **kwargs):
from hunter import _merge
if self._filter is not None:
predicates = (self._filter,) + predicates
return Backlog(
self.condition,
size=self.size, stack=self.stack, vars=self.vars, action=self.action,
filter=_merge(*predicates, **kwargs)
)
cdef inline fast_Backlog_call(Backlog self, Event event):
cdef bint first_is_call
cdef Event detached_event
cdef Event first_event
cdef Event stack_event
cdef FrameType first_frame
cdef FrameType frame
cdef int backlog_call_depth
cdef int depth_delta
cdef int first_depth
cdef int missing_depth
cdef object result
cdef object stack_events
result = fast_call(self.condition, event)
if result:
if self.queue:
self.action.cleanup()
first_event = <Event>self.queue[0]
first_depth = first_event.depth
backlog_call_depth = event.depth - first_depth
first_is_call = first_event.kind == 'call' # note that True is 1, thus the following math is valid
missing_depth = min(first_depth, max(0, self.stack - backlog_call_depth + first_is_call))
if missing_depth:
if first_is_call and first_event.frame is not None:
first_frame = first_event.frame.f_back
else:
first_frame = first_event.frame
if first_frame is not None:
stack_events = deque() # a new deque because self.queue is limited, we can't add while it's full
frame = first_frame
depth_delta = 0
while frame and depth_delta < missing_depth:
stack_event = Event(
frame=frame, kind=0, arg=None,
threading_support=event.threading_support,
depth=first_depth - depth_delta - 1, calls=-1
)
if not self.vars:
# noinspection PyPropertyAccess
stack_event._locals = {}
stack_event._globals = {}
stack_event.detached = True
stack_events.appendleft(stack_event)
frame = frame.f_back
depth_delta += 1
for stack_event in stack_events:
if self._filter is None or self._filter(stack_event):
self.action(stack_event)
for backlog_event in self.queue:
if self._filter is None:
self.action(backlog_event)
elif fast_call(self._filter, <Event>backlog_event):
self.action(backlog_event)
self.queue.clear()
else:
if self.strip and event.depth < 1:
# Looks like we're back to depth 0 for some reason.
# Delete everything because we don't want to see what is likely just a long stream of useless returns.
self.queue.clear()
if self._filter is None or self._filter(event):
detached_event = fast_detach(event, self._try_repr)
detached_event.frame = event.frame
self.queue.append(detached_event)
return result