rev.ng
@revng.bsky.social
Presentation: pad.rev.ng/p/nZM078b9C#/
Improving switch handling - HedgeDoc
# Improving `switch` handling ###### tags: `presentation` `hour` `switch` --- # `switch` How are
pad.rev.ng
February 5, 2026 at 4:29 PM
Presentation: pad.rev.ng/p/nZM078b9C#/
The constraints are collected using an extension of an LLVM-provided analysis (`LazyValueInfo`) that can track disjoint ranges of values.
February 5, 2026 at 4:29 PM
The constraints are collected using an extension of an LLVM-provided analysis (`LazyValueInfo`) that can track disjoint ranges of values.
Finally, we enumerate all the possible values that the jump destination can assume given the constraints we collected.
February 5, 2026 at 4:29 PM
Finally, we enumerate all the possible values that the jump destination can assume given the constraints we collected.
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.
February 5, 2026 at 4:29 PM
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.
February 5, 2026 at 4:13 PM
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.
February 5, 2026 at 4:13 PM
In short, we optimize the code so we have a nice SSA form, build the data-flow graph of the jump destination and analyze the control flow to obtain constraints over certain nodes of the data flow graph.