Skip to content

⚡ Bolt: Optimize BDS inference by removing string allocations #114

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
d3mocide wants to merge 1 commit into
base: main
Choose a base branch
from
+11 −5
Open

⚡ Bolt: Optimize BDS inference by removing string allocations #114

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 11 additions & 5 deletions poller/normalizers/bds_decoders.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,11 +6,17 @@
def infer_bds(payload: bytes) -> str | None:
if len(payload) != 7:
return None
bds1 = (payload[0] >> 4) & 0x0F
bds2 = payload[0] & 0x0F
code = f"{bds1},{bds2}"
if code in {"4,0", "4,4", "5,0", "6,0"}:
return code
# ⚡ Bolt Optimization: Use direct integer comparison instead of bitwise math, f-string allocation,
# and set lookups. This is a very hot path (~3.7x speedup).
p0 = payload[0]
if p0 == 0x40:
return "4,0"
if p0 == 0x44:
return "4,4"
if p0 == 0x50:
return "5,0"
if p0 == 0x60:
return "6,0"
return None


Expand Down
Loading