varun-r-mallya/python-bpf
1
0
Fork 0
mirror of https://github.com/varun-r-mallya/Python-BPF.git synced 2025-12-31 21:06:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

format chore

Browse Source
This commit is contained in:
varun-r-mallya
2025-10-13 19:11:59 +05:30
parent 69d8669e44
commit b34f7dd68a
2 changed files with 8 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
tests/failing_tests/assign/retype.py
View File

@ -11,6 +11,7 @@ from pythonbpf.maps import HashMap
# We can allow bitcasts in cases where the width of the types is the same in # We can allow bitcasts in cases where the width of the types is the same in
# the future. But for now, we do not allow any re-interpretation of variables. # the future. But for now, we do not allow any re-interpretation of variables.
@bpf @bpf
@map @map
def last() -> HashMap: def last() -> HashMap:

9
tests/passing_tests/assign/comprehensive.py
View File

@ -9,6 +9,7 @@ from pythonbpf.helper import ktime
# the compiler, it is recommended to use named variables to reduce the amount of # the compiler, it is recommended to use named variables to reduce the amount of
# scratch space that needs to be allocated. # scratch space that needs to be allocated.
@bpf @bpf
@struct @struct
class data_t: class data_t:
@ -48,8 +49,12 @@ def hello_world(ctx: c_void_p) -> c_int64:
a = last.lookup(0) a = last.lookup(0)
print(f"a is {a}") print(f"a is {a}")
last.update(9, 9) last.update(9, 9)
last.update(0, last.lookup(last.lookup(0)) + last.update(
last.lookup(last.lookup(0)) + last.lookup(last.lookup(0))) 0,
last.lookup(last.lookup(0))
+ last.lookup(last.lookup(0))
+ last.lookup(last.lookup(0)),
)
z = last.lookup(0) z = last.lookup(0)
print(f"new map val at index 0 is {z}") print(f"new map val at index 0 is {z}")
else: else: