On Thu, Feb 9, 2023 at 3:25 PM Richard Biener via Gcc-patches
wrote:
>
> When the set of candidates becomes very large then repeated
> bit checks on it during the build of an actual chain can become
> slow because of the O(n) nature of bitmap tests. The following
> switches the candidates bitmaps
On Thu, 9 Feb 2023, Richard Biener wrote:
> When the set of candidates becomes very large then repeated
> bit checks on it during the build of an actual chain can become
> slow because of the O(n) nature of bitmap tests. The following
> switches the candidates bitmaps to the tree representation b
