commit 553d3719337f8698cf152d5932e60722a3745d34
author Pierre-Eric Pelloux-Prayer <pierre-eric.pelloux-prayer@amd.com> Mon Sep 07 15:15:50 2020 +0200
committer Pierre-Eric Pelloux-Prayer <pierre-eric.pelloux-prayer@amd.com> Thu Sep 10 09:07:11 2020 +0200
tree fe7158f0833910e0862689a9c2332180f6761a26
parent e808d38299565669105fc95d1b4a469f79b070c5

util/idalloc: add lowest_free_idx to avoid iterating from 0

lowest_free_idx is a conservative estimation of the lowest index
where a free id can be found.

Reviewed-by: Marek Olšák <marek.olsak@amd.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/6600>

src/util/u_idalloc.c

diff --git a/src/util/u_idalloc.c b/src/util/u_idalloc.c
index f08ec47..b5d886d 100644
--- a/src/util/u_idalloc.c
+++ b/src/util/u_idalloc.c
@@ -71,18 +71,21 @@
 {
    unsigned num_elements = buf->num_elements;
 
-   for (unsigned i = 0; i < num_elements / 32; i++) {
+   for (unsigned i = buf->lowest_free_idx; i < num_elements / 32; i++) {
       if (buf->data[i] == 0xffffffff)
          continue;
 
       unsigned bit = ffs(~buf->data[i]) - 1;
       buf->data[i] |= 1u << bit;
+      buf->lowest_free_idx = i;
       return i * 32 + bit;
    }
 
    /* No slots available, resize and return the first free. */
    util_idalloc_resize(buf, num_elements * 2);
 
+   buf->lowest_free_idx = num_elements / 32;
+
    buf->data[num_elements / 32] |= 1 << (num_elements % 32);
 
    return num_elements;
@@ -92,7 +95,9 @@
 util_idalloc_free(struct util_idalloc *buf, unsigned id)
 {
    assert(id < buf->num_elements);
-   buf->data[id / 32] &= ~(1 << (id % 32));
+   unsigned idx = id / 32;
+   buf->lowest_free_idx = MIN2(idx, buf->lowest_free_idx);
+   buf->data[idx] &= ~(1 << (id % 32));
 }
 
 void

src/util/u_idalloc.h

diff --git a/src/util/u_idalloc.h b/src/util/u_idalloc.h
index d78a0d4..bd86e26 100644
--- a/src/util/u_idalloc.h
+++ b/src/util/u_idalloc.h
@@ -38,6 +38,7 @@
 {
    uint32_t *data;
    unsigned num_elements;
+   unsigned lowest_free_idx;
 };
 
 void