Re: [PATCH bpf-next] bpf: tnums: Provably sound, faster, and more precise algorithm for tnum_mul

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On 6/1/21 10:11 AM, Edward Cree wrote:
On 30/05/2021 06:59, Andrii Nakryiko wrote:
I think your algorithm makes sense, but I've also CC'ed original
author of tnum logic. Edward, please take a look as well.Yep, I've been in discussions with them about the paper and their
  algorithm appears fine to me.  As for the patch, nothing to add
  beyond your observations.

SGTM, Edward, okay to add your Acked-by or Reviewed-by in that case when applying v2 [0]?

Thanks,
Daniel

  [0] https://patchwork.kernel.org/project/netdevbpf/patch/20210531020157.7386-1-harishankar.vishwanathan@xxxxxxxxxxx/



[Index of Archives]     [Linux Samsung SoC]     [Linux Rockchip SoC]     [Linux Actions SoC]     [Linux for Synopsys ARC Processors]     [Linux NFS]     [Linux NILFS]     [Linux USB Devel]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]


  Powered by Linux