linux-kernel - Re: [RESEND PATCH v3] iommu/iova: Optimize alloc_iova with rbtree

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:   Fri, 23 Sep 2022 02:52:19 +0800
From:   Peng Zhang <zhangpeng.00@...edance.com>
To:     joro@...tes.org, will@...nel.org
Cc:     wangjie125@...wei.com, iommu@...ts.linux.dev,
        linux-kernel@...r.kernel.org, robin.murphy@....com,
        haifeng.zhao@...ux.intel.com, john.garry@...wei.com
Subject: Re: [RESEND PATCH v3] iommu/iova: Optimize alloc_iova with
 rbtree_augmented

Hello everyone,

Compared with v2, v3 mainly updated the commit message,
and set the upper limit when scanning the linked list.

In the normal case, the performance of this algorithm
is almost the same as before. In extreme cases, this
algorithm is much better than before. And this algorithm
does not bring additional memory overhead.

Comments welcome.

Thanks.
Peng