Elazar Gershuni
Elazar Gershuni
An ad-hoc solution might be to add IncrementLoopCounter to the AssertionConstraint variant for now. The better solution is probably to move wto analysis to the creation of the CFG. How...
I think we need to 1. Verify the callback function assuming its declared signature (found in the BTF information?). I don't see it as too different from the current verifiction,...
Looks like we know the map because the verifier should make sure was initialized by bpf_timer_init(). There are requirements that are not easy to find, and some information may pass...
The specifications for each function must be encoded in its signature. I don't want to end up with spec scattered all over the place. This is the reason why we...
This specific challenge can be solved by analyzing the possible map size. I don't think it's difficult, but I'm not sure we want to enter the rabbit hole of inferring...
I _think_ the entire `else` branch there (the assertion and the set-to-top action) can be simply removed.
I can't reproduce it. What flags do you pass?
I think the overhead has already been paid by the inefficient implementation of the radix tree - I think it has some issues in the iterator. Significant portion or the...
Freezing it for now.
Thank you for the report! This definitely looks like a bug to me. Can you provide the object file, for reproducibility?