mirror of https://gitlab.freedesktop.org/mesa/mesa
127 lines
3.0 KiB
C
127 lines
3.0 KiB
C
/*
|
|
* Copyright (c) 2022 Collabora Ltd.
|
|
* Copyright © 2014 Intel Corporation
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
* to deal in the Software without restriction, including without limitation
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice (including the next
|
|
* paragraph) shall be included in all copies or substantial portions of the
|
|
* Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
* IN THE SOFTWARE.
|
|
*/
|
|
|
|
#include "u_worklist.h"
|
|
#include "ralloc.h"
|
|
|
|
void
|
|
u_worklist_init(u_worklist *w, unsigned num_entries, void *mem_ctx)
|
|
{
|
|
w->size = num_entries;
|
|
w->count = 0;
|
|
w->start = 0;
|
|
|
|
w->present = rzalloc_array(mem_ctx, BITSET_WORD, BITSET_WORDS(num_entries));
|
|
w->entries = rzalloc_array(mem_ctx, unsigned *, num_entries);
|
|
}
|
|
|
|
void
|
|
u_worklist_fini(u_worklist *w)
|
|
{
|
|
ralloc_free(w->present);
|
|
ralloc_free(w->entries);
|
|
}
|
|
|
|
void
|
|
u_worklist_push_head_index(u_worklist *w, unsigned *index)
|
|
{
|
|
/* Pushing a block we already have is a no-op */
|
|
if (BITSET_TEST(w->present, *index))
|
|
return;
|
|
|
|
assert(w->count < w->size);
|
|
|
|
if (w->start == 0)
|
|
w->start = w->size - 1;
|
|
else
|
|
w->start--;
|
|
|
|
w->count++;
|
|
|
|
w->entries[w->start] = index;
|
|
BITSET_SET(w->present, *index);
|
|
}
|
|
|
|
unsigned *
|
|
u_worklist_peek_head_index(const u_worklist *w)
|
|
{
|
|
assert(w->count > 0);
|
|
|
|
return w->entries[w->start];
|
|
}
|
|
|
|
unsigned *
|
|
u_worklist_pop_head_index(u_worklist *w)
|
|
{
|
|
assert(w->count > 0);
|
|
|
|
unsigned head = w->start;
|
|
|
|
w->start = (w->start + 1) % w->size;
|
|
w->count--;
|
|
|
|
BITSET_CLEAR(w->present, *(w->entries[head]));
|
|
return w->entries[head];
|
|
}
|
|
|
|
void
|
|
u_worklist_push_tail_index(u_worklist *w, unsigned *index)
|
|
{
|
|
/* Pushing a block we already have is a no-op */
|
|
if (BITSET_TEST(w->present, *index))
|
|
return;
|
|
|
|
assert(w->count < w->size);
|
|
|
|
w->count++;
|
|
|
|
unsigned tail = (w->start + w->count - 1) % w->size;
|
|
|
|
w->entries[tail] = index;
|
|
BITSET_SET(w->present, *index);
|
|
}
|
|
|
|
unsigned *
|
|
u_worklist_peek_tail_index(const u_worklist *w)
|
|
{
|
|
assert(w->count > 0);
|
|
|
|
unsigned tail = (w->start + w->count - 1) % w->size;
|
|
|
|
return w->entries[tail];
|
|
}
|
|
|
|
unsigned *
|
|
u_worklist_pop_tail_index(u_worklist *w)
|
|
{
|
|
assert(w->count > 0);
|
|
|
|
unsigned tail = (w->start + w->count - 1) % w->size;
|
|
|
|
w->count--;
|
|
|
|
BITSET_CLEAR(w->present, *(w->entries[tail]));
|
|
return w->entries[tail];
|
|
}
|