Hello:
This series was applied to bpf/bpf-next.git (master)
by Andrii Nakryiko <andrii@xxxxxxxxxx>:
On Tue, 26 Aug 2025 09:15:23 +0530 you wrote:
> Drop the value-mask decomposition technique and adopt straightforward
> long-multiplication with a twist: when LSB(a) is uncertain, find the
> two partial products (for LSB(a) = known 0 and LSB(a) = known 1) and
> take a union.
>
> Experiment shows that applying this technique in long multiplication
> improves the precision in a significant number of cases (at the cost
> of losing precision in a relatively lower number of cases).
>
> [...]
Here is the summary with links:
- [v6,bpf-next,1/2] bpf: Improve the general precision of tnum_mul
(no matching commit)
- [v6,bpf-next,2/2] bpf: Add selftest to check the verifier's abstract multiplication
https://git.kernel.org/bpf/bpf-next/c/2660b9d47750
You are awesome, thank you!
--
Deet-doot-dot, I am a bot.
https://korg.docs.kernel.org/patchwork/pwbot.html
