-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathTraceAll.py
1531 lines (1081 loc) · 40.2 KB
/
TraceAll.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
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
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import logging
from types import TracebackType
from typing import (
Any,
Callable,
ContextManager,
Dict,
Iterable,
List,
Optional,
Tuple,
Union,
)
import libcst.matchers as m
from .BaseAnalysis import BaseAnalysis
from ..utils.nodeLocator import get_node_by_location
class TraceAll(BaseAnalysis):
"""
.. include:: ../../../docs/hooks.md
"""
def __init__(self, **kwargs) -> None:
super().__init__(**kwargs)
root_logger = logging.getLogger()
root_logger.setLevel(logging.INFO)
handler = logging.FileHandler("output.log", "w", "utf-8")
handler.setFormatter(logging.Formatter("%(message)s"))
root_logger.addHandler(handler)
def log(self, iid: int, *args, **kwargs):
args_str = " ".join([str(x) for x in args])
kwargs_str = " ".join([f"{k}={v}" for k, v in kwargs.items()])
logging.info(f"{iid}: {args_str} {kwargs_str}")
# Literals
def integer(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for integer literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the integer literal.
Returns
-------
Any
If provided, overwrites the value of the integer literal.
"""
self.log(iid, " Integer", "value:", val)
def _float(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for floating point literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the floating point literal.
Returns
-------
Any
If provided, overwrites the value of the float literal.
@public
"""
self.log(iid, " Float", "value:", val)
def imaginary(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for imaginary number literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the imaginary number literal.
Returns
-------
Any
If provided, overwrites the value of the imaginary number literal.
"""
self.log(iid, " Imaginary", "value:", val)
def string(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for string literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the string literal.
Returns
-------
Any
If provided, overwrites the value of the string literal.
"""
self.log(iid, " String", "value:", val)
def boolean(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for boolean literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the boolean literal.
Returns
-------
Any
If provided, overwrites the value of the boolean literal.
"""
self.log(iid, " Boolean", "value:", val)
def literal(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for all literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value of the literal.
Returns
-------
Any
If provided, overwrites the value of the literal.
"""
self.log(iid, "Literal ", "value:", val)
def dictionary(self, dyn_ast: str, iid: int, items: List[Any], value: Dict) -> Dict:
"""Hook for a dictionary definition.
E.g. `{'a': 1, 'b': 2}`
or `{i: i for i in range(10)}`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
items : List[Any]
The lis of key-value pairs.
value : Dict
The dictionary itself.
Returns
-------
Dict
If provided, overwrites the value of the dictionary.
"""
self.log(iid, "Dictionary", "items:", items)
def _list(self, dyn_ast: str, iid: int, value: List) -> List:
"""Hook for a list definition.
E.g. `[1, 2, 3]`
or `[i for i in range(10)]`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
value : List
The list itself.
Returns
-------
List
If provided, overwrites the value of the list.
@public
"""
self.log(iid, "List", value)
def _tuple(self, dyn_ast: str, iid: int, items: List[Any], value: tuple) -> tuple:
"""Hook for a tuple.
E.g. `(1, 2, 3)`
or `(i for i in range(10))`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
items : List[Any]
The lis of items in the tuple.
value : tuple
The tuple itself.
Returns
-------
tuple
If provided, overwrites the value of the tuple.
@public
"""
self.log(iid, "Tuple", "items:", items)
def _set(self, dyn_ast: str, iid: int, items: List[Any], value: set) -> set:
"""Hook for a set.
E.g. `{1, 2, 3}`
or `{i for i in range(10)}`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
items : List[Any]
The lis of items in the set.
value : set
The set itself.
Returns
-------
set
If provided, overwrites the value of the set.
@public
"""
self.log(iid, "Set", "items:", items)
def none(self, dyn_ast: str, iid: int, value: Any) -> Any:
"""Hook for None literals.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
value : Any
The value of the None literal.
Returns
-------
Any
If provided, overwrites the value of the None literal.
"""
self.log(iid, "None", "value:", value)
# Operations
def operation(
self, dyn_ast: str, iid: int, operator: str, operands: List[Any], result: Any
) -> Any:
"""Hook for any operation.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
operator : str
The operator of the operation.
operands : List[Any]
The operands of the operation.
result : Any
The result of the operation.
Returns
-------
Any
If provided, overwrites the result of the operation.
"""
pass
def binary_operation(
self, dyn_ast: str, iid: int, op: str, left: Any, right: Any, result: Any
) -> Any:
"""Hook for any binary operation.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
op : str
The operator of the operation.
left : Any
The left operand of the operation.
right : Any
The right operand of the operation.
result : Any
The result of the operation.
Returns
-------
Any
If provided, overwrites the result of the operation.
"""
self.log(iid, "Binary Operation", left, op, right, "->", result)
def add(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def bit_and(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def bit_or(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def bit_xor(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def divide(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def floor_divide(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def left_shift(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def right_shift(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def matrix_multiply(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def modulo(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def multiply(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def power(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def subtract(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Binary Operation", left, right, "->", result)
def _and(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
"""@public"""
self.log(iid, "Binary Operation", left, right, "->", result)
def _or(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
"""@public"""
self.log(iid, "Binary Operation", left, right, "->", result)
def unary_operation(
self, dyn_ast: str, iid: int, opr: Any, arg: Any, result: Any
) -> Any:
"""Hook for any unary operation.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
opr : str
The operator of the operation.
arg : Any
The operand of the operation.
result : Any
The result of the operation.
Returns
-------
Any
If provided, overwrites the result of the operation.
"""
self.log(iid, "Unary Operation", arg, "->", result)
def bit_invert(self, dyn_ast: str, iid: int, arg: Any, result: Any) -> Any:
self.log(iid, "Unary Operation", arg, "->", result)
def minus(self, dyn_ast: str, iid: int, arg: Any, result: Any) -> Any:
self.log(iid, "Unary Operation", arg, "->", result)
def _not(self, dyn_ast: str, iid: int, arg: Any, result: Any) -> Any:
"""@public"""
self.log(iid, "Unary Operation", arg, "->", result)
def plus(self, dyn_ast: str, iid: int, arg: Any, result: Any) -> Any:
self.log(iid, "Unary Operation", arg, "->", result)
def comparison(
self, dyn_ast: str, iid: int, op: str, left: Any, right: Any, result: Any
) -> Any:
"""Hook for the comparison operation.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
op : str
The operator of the operation.
left : Any
The left operand of the operation.
right : Any
The right operand of the operation.
result : Any
The result of the operation.
Returns
-------
Any
If provided, overwrites the result of the operation.
"""
self.log(iid, "Comparison", left, op, right, "->", result)
def equal(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def greater_than(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def greater_than_equal(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def _in(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
"""@public"""
self.log(iid, "Comparison", left, right, "->", result)
def _is(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
"""@public"""
self.log(iid, "Comparison", left, right, "->", result)
def less_than(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def less_than_equal(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def not_equal(
self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any
) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def is_not(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
def not_in(self, dyn_ast: str, iid: int, left: Any, right: Any, result: Any) -> Any:
self.log(iid, "Comparison", left, right, "->", result)
# Memory access
def memory_access(self, dyn_ast: str, iid: int, val: Any) -> Any:
"""Hook for any memory access, currently, except some write operations.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The value accessed.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(iid, "Accessing")
def read(self, dyn_ast: str, iid: int, val: Any) -> Any:
self.log(iid, " Reading")
def read_identifier(self, dyn_ast: str, iid: int, val: Any) -> Any:
self.log(iid, " Reading")
def write(
self, dyn_ast: str, iid: int, old_vals: List[Callable], new_val: Any
) -> Any:
"""Hook for writes.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
old_vals : Any
A list of old values before the write takes effect.
It's a list to support multiple assignments.
Each old value is wrapped into a lambda function, so that
the analysis writer can decide if and when to evaluate it.
new_val : Any
The value after the write takes effect.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(iid, " Writing")
def delete(
self, dyn_ast: str, iid: int, val: List[Tuple[Any, Any, bool]]
) -> Optional[bool]:
"""Hook for deletes.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : List[Tuple[Any, Any, bool]]
The list of values to be deleted. Each item in the list is a tuple of the form
(base, offset, is_sub). `is_sub` is True if the value is a subscript, e.g. `a[b]`.
Returns
-------
Any
If True cancels the deletion.
"""
self.log(iid, " Deleting")
def read_attribute(
self, dyn_ast: str, iid: int, base: Any, name: str, val: Any
) -> Any:
"""Hook for reading an object attribute.
E.g. `obj.attr`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
base : Any
The object to which the attribute is attached.
name : str
The name of the attribute.
val : Any
The resulting value.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(iid, "Attribute", name)
def read_subscript(
self, dyn_ast: str, iid: int, base: Any, sl: List[Union[int, Tuple]], val: Any
) -> Any:
"""Hook for reading a subscript, also known as a slice.
E.g. `obj[1, 2]`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
base : Any
The object to which the subscript is attached.
sl : List[Union[int, Tuple]]
The subscript.
val : Any
The resulting value.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(iid, "Slice", sl)
# Instrumented function
def function_enter(
self, dyn_ast: str, iid: int, args: List[Any], name: str, is_lambda: bool
) -> None:
"""Hook for when an instrumented function is entered.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
args : List[Any]
The arguments passed to the function.
name:
Name of the function called.
is_lambda : bool
Whether the function is a lambda function.
"""
tmp = self._get_ast(dyn_ast)
if tmp is not None:
ast, iids = tmp
else:
return
if (not is_lambda) and (
get_node_by_location(ast, iids.iid_to_location[iid], m.FunctionDef()).name
in ["__str__", "__repr__"]
):
self.log(iid, "Entered function", danger_of_recursion=True)
def function_exit(
self, dyn_ast: str, function_iid: int, name: str, result: Any
) -> Any:
"""Hook for exiting an instrumented function.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
function_iid: int
ID unique to the current file, referring to the function.
name: str
Name of the function called.
result : Any
The result of the function.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(function_iid, "Exiting function")
def _return(
self, dyn_ast: str, iid: int, function_iid: int, function_name: str, value: Any
) -> Any:
"""Hook for instrumented return statement.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid: int
ID unique to the current file, referring to the return statement.
function_iid: int
ID unique to the current file, referring to the function.
function_name: str
Name of the function returning from.
value : Any
The value returned.
@public
"""
self.log(iid, " Returning", value)
def _yield(
self, dyn_ast: str, iid: int, function_iid: int, function_name: str, value: Any
) -> Any:
"""Hook for instrumented yield statement.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid: int
ID unique to the current file, referring to the yield statement.
function_iid: int
ID unique to the current file, referring to the function.
function_name: str
Name of the function yielding from.
value : Any
The value yielded.
@public
"""
self.log(iid, " Yielding", value)
def implicit_return(
self, dyn_ast: str, iid: int, function_iid: int, function_name: str, value: Any
) -> Any:
"""Hook for exiting a function without a return or yield (by reaching the end of function body).
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid: int
ID unique to the current file, referring to the function definition.
function_iid: int
ID unique to the current file, referring to the function definition.
function_name: str
Name of the function exiting.
value : Any
The value returned (None).
"""
self.log(iid, " Exiting function")
# Function Call
def pre_call(
self, dyn_ast: str, iid: int, function: Callable, pos_args: List, kw_args: Dict
):
"""Hook called before a function call happens.
This hook is not called for a set of special functions.
These special functions are 'breakpoint', 'dir', 'eval', 'exec', 'globals', 'help', 'locals', 'super', 'vars'.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
function : str
Function which will be called.
pos_args : List
The positional arguments passed to the function.
kw_args : Dict
The keyword arguments passed to the function.
"""
self.log(iid, "Before function call")
def post_call(
self,
dyn_ast: str,
iid: int,
result: Any,
call: Callable,
pos_args: Tuple,
kw_args: Dict,
) -> Any:
"""Hook called after a function call.
Note: For a set of functions, that cannot be called from DynaPyt's runtime engine, the 'call' argument is not 'Callable', but is the resulting value.
These special functions are 'breakpoint', 'dir', 'eval', 'exec', 'globals', 'help', 'locals', 'super', 'vars'.
To check for these cases, you can check 'result is call', and if it is True, then it is one of these special functions.
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
val : Any
The return value of the function.
call: Callable
The function which was called.
pos_args : Tuple
The positional arguments passed to the function.
kw_args : Dict
The keyword arguments passed to the function.
Returns
-------
Any
If provided, overwrites the returned value.
"""
self.log(iid, "After function call")
# Statements
def augmented_assignment(
self, dyn_ast: str, iid: int, left: Any, op: str, right: Any
) -> Any:
"""Hook for any augmented assignment.
E.g. `a += 1`
Parameters
----------
dyn_ast : str
The path to the original code. Can be used to extract the syntax tree.
iid : int
Unique ID of the syntax tree node.
left : Any
The left operand.
op : str
The operator.
right : Any
The right operand.
val : Any
The resulting value.
Returns
-------
Any
If provided, overwrites the result.
"""
self.log(iid, "Augmented assignment", left, op, right)
def add_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def bit_and_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def bit_or_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def bit_xor_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def divide_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def floor_divide_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def left_shift_assign(self, dyn_ast: str, iid: int, left: Any, right: Any) -> Any:
self.log(iid, "Augmented assignment", left, right)
def matrix_multiply_assign(
self, dyn_ast: str, iid: int, left: Any, right: Any
) -> Any:
self.log(iid, "Augmented assignment", left, right)