mirror of
https://gitlab.freedesktop.org/mesa/mesa.git
synced 2026-01-03 11:30:21 +01:00
pan/util: Move liveness logic to midgard
Only used in midgard. Signed-off-by: Mary Guillemard <mary.guillemard@collabora.com> Acked-by: Boris Brezillon <boris.brezillon@collabora.com> Acked-by: Erik Faye-Lund <erik.faye-lund@collabora.com> Acked-by: Eric R. Smith <eric.smith@collabora.com> Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/32650>
This commit is contained in:
Mary Guillemard
Marge Bot
parent
49261faac8
commit
fdef86a4a2
4 changed files with 138 additions and 192 deletions
|
|
@ -24,28 +24,115 @@
|
|||
|
||||
#include "compiler.h"
|
||||
|
||||
/* Routines for liveness analysis. Liveness is tracked per byte per node. Per
|
||||
* byte granularity is necessary for proper handling of int8 */
|
||||
|
||||
static void
|
||||
mir_liveness_gen(uint16_t *live, unsigned node, unsigned max, uint16_t mask)
|
||||
{
|
||||
if (node >= max)
|
||||
return;
|
||||
|
||||
live[node] |= mask;
|
||||
}
|
||||
|
||||
static void
|
||||
mir_liveness_kill(uint16_t *live, unsigned node, unsigned max, uint16_t mask)
|
||||
{
|
||||
if (node >= max)
|
||||
return;
|
||||
|
||||
live[node] &= ~mask;
|
||||
}
|
||||
|
||||
static bool
|
||||
mir_liveness_get(uint16_t *live, unsigned node, uint16_t max)
|
||||
{
|
||||
if (node >= max)
|
||||
return false;
|
||||
|
||||
return live[node];
|
||||
}
|
||||
|
||||
void
|
||||
mir_liveness_ins_update(uint16_t *live, const midgard_instruction *ins,
|
||||
unsigned max)
|
||||
{
|
||||
/* live_in[s] = GEN[s] + (live_out[s] - KILL[s]) */
|
||||
|
||||
pan_liveness_kill(live, ins->dest, max, mir_bytemask(ins));
|
||||
mir_liveness_kill(live, ins->dest, max, mir_bytemask(ins));
|
||||
|
||||
mir_foreach_src(ins, src) {
|
||||
unsigned node = ins->src[src];
|
||||
unsigned bytemask = mir_bytemask_of_read_components(ins, node);
|
||||
|
||||
pan_liveness_gen(live, node, max, bytemask);
|
||||
mir_liveness_gen(live, node, max, bytemask);
|
||||
}
|
||||
}
|
||||
|
||||
/* live_out[s] = sum { p in succ[s] } ( live_in[p] ) */
|
||||
|
||||
static void
|
||||
mir_liveness_ins_update_wrap(uint16_t *live, void *ins, unsigned max)
|
||||
liveness_block_live_out(pan_block *blk, unsigned temp_count)
|
||||
{
|
||||
mir_liveness_ins_update(live, (midgard_instruction *)ins, max);
|
||||
pan_foreach_successor(blk, succ) {
|
||||
for (unsigned i = 0; i < temp_count; ++i)
|
||||
blk->live_out[i] |= succ->live_in[i];
|
||||
}
|
||||
}
|
||||
|
||||
/* Liveness analysis is a backwards-may dataflow analysis pass. Within a block,
|
||||
* we compute live_out from live_in. The intrablock pass is linear-time. It
|
||||
* returns whether progress was made. */
|
||||
|
||||
static bool
|
||||
liveness_block_update(pan_block *blk, unsigned temp_count)
|
||||
{
|
||||
bool progress = false;
|
||||
|
||||
liveness_block_live_out(blk, temp_count);
|
||||
|
||||
uint16_t *live = ralloc_array(blk, uint16_t, temp_count);
|
||||
memcpy(live, blk->live_out, temp_count * sizeof(uint16_t));
|
||||
|
||||
pan_foreach_instr_in_block_rev(blk, ins)
|
||||
mir_liveness_ins_update(live, (midgard_instruction *)ins, temp_count);
|
||||
|
||||
/* To figure out progress, diff live_in */
|
||||
|
||||
for (unsigned i = 0; (i < temp_count) && !progress; ++i)
|
||||
progress |= (blk->live_in[i] != live[i]);
|
||||
|
||||
ralloc_free(blk->live_in);
|
||||
blk->live_in = live;
|
||||
|
||||
return progress;
|
||||
}
|
||||
|
||||
/* Once liveness data is no longer valid, call this */
|
||||
|
||||
static void
|
||||
mir_free_liveness(struct list_head *blocks)
|
||||
{
|
||||
list_for_each_entry(pan_block, block, blocks, link)
|
||||
{
|
||||
if (block->live_in)
|
||||
ralloc_free(block->live_in);
|
||||
|
||||
if (block->live_out)
|
||||
ralloc_free(block->live_out);
|
||||
|
||||
block->live_in = NULL;
|
||||
block->live_out = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
/* Globally, liveness analysis uses a fixed-point algorithm based on a
|
||||
* worklist. We initialize a work list with the exit block. We iterate the work
|
||||
* list to compute live_in from live_out for each block on the work list,
|
||||
* adding the predecessors of the block to the work list if we made progress.
|
||||
*/
|
||||
|
||||
void
|
||||
mir_compute_liveness(compiler_context *ctx)
|
||||
{
|
||||
|
|
@ -54,15 +141,56 @@ mir_compute_liveness(compiler_context *ctx)
|
|||
return;
|
||||
|
||||
mir_compute_temp_count(ctx);
|
||||
pan_compute_liveness(&ctx->blocks, ctx->temp_count,
|
||||
mir_liveness_ins_update_wrap);
|
||||
|
||||
/* Set of pan_block */
|
||||
struct set *work_list =
|
||||
_mesa_set_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
|
||||
|
||||
struct set *visited =
|
||||
_mesa_set_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
|
||||
|
||||
/* Free any previous liveness, and allocate */
|
||||
|
||||
mir_free_liveness(&ctx->blocks);
|
||||
|
||||
list_for_each_entry(pan_block, block, &ctx->blocks, link)
|
||||
{
|
||||
block->live_in = rzalloc_array(block, uint16_t, ctx->temp_count);
|
||||
block->live_out = rzalloc_array(block, uint16_t, ctx->temp_count);
|
||||
}
|
||||
|
||||
/* Initialize the work list with the exit block */
|
||||
struct set_entry *cur;
|
||||
|
||||
cur = _mesa_set_add(work_list, pan_exit_block(&ctx->blocks));
|
||||
|
||||
/* Iterate the work list */
|
||||
|
||||
do {
|
||||
/* Pop off a block */
|
||||
pan_block *blk = (struct pan_block *)cur->key;
|
||||
_mesa_set_remove(work_list, cur);
|
||||
|
||||
/* Update its liveness information */
|
||||
bool progress = liveness_block_update(blk, ctx->temp_count);
|
||||
|
||||
/* If we made progress, we need to process the predecessors */
|
||||
|
||||
if (progress || !_mesa_set_search(visited, blk)) {
|
||||
pan_foreach_predecessor(blk, pred)
|
||||
_mesa_set_add(work_list, pred);
|
||||
}
|
||||
|
||||
_mesa_set_add(visited, blk);
|
||||
} while ((cur = _mesa_set_next_entry(work_list, NULL)) != NULL);
|
||||
|
||||
_mesa_set_destroy(visited, NULL);
|
||||
_mesa_set_destroy(work_list, NULL);
|
||||
|
||||
/* Liveness is now valid */
|
||||
ctx->metadata |= MIDGARD_METADATA_LIVENESS;
|
||||
}
|
||||
|
||||
/* Once liveness data is no longer valid, call this */
|
||||
|
||||
void
|
||||
mir_invalidate_liveness(compiler_context *ctx)
|
||||
{
|
||||
|
|
@ -70,7 +198,7 @@ mir_invalidate_liveness(compiler_context *ctx)
|
|||
if (!(ctx->metadata & MIDGARD_METADATA_LIVENESS))
|
||||
return;
|
||||
|
||||
pan_free_liveness(&ctx->blocks);
|
||||
mir_free_liveness(&ctx->blocks);
|
||||
|
||||
/* It's now invalid regardless */
|
||||
ctx->metadata &= ~MIDGARD_METADATA_LIVENESS;
|
||||
|
|
@ -84,7 +212,7 @@ mir_is_live_after(compiler_context *ctx, const midgard_block *block,
|
|||
|
||||
/* Check whether we're live in the successors */
|
||||
|
||||
if (pan_liveness_get(block->base.live_out, src, ctx->temp_count))
|
||||
if (mir_liveness_get(block->base.live_out, src, ctx->temp_count))
|
||||
return true;
|
||||
|
||||
/* Check the rest of the block for liveness */
|
||||
|
|
|
|||
|
|
@ -6,7 +6,6 @@ libpanfrost_util_files = files(
|
|||
'pan_collect_varyings.c',
|
||||
'pan_ir.c',
|
||||
'pan_ir.h',
|
||||
'pan_liveness.c',
|
||||
'pan_lower_frag_coord_zw.c',
|
||||
'pan_lower_framebuffer.c',
|
||||
'pan_lower_helper_invocation.c',
|
||||
|
|
|
|||
|
|
@ -369,19 +369,6 @@ pan_exit_block(struct list_head *blocks)
|
|||
return last;
|
||||
}
|
||||
|
||||
typedef void (*pan_liveness_update)(uint16_t *, void *, unsigned max);
|
||||
|
||||
void pan_liveness_gen(uint16_t *live, unsigned node, unsigned max,
|
||||
uint16_t mask);
|
||||
void pan_liveness_kill(uint16_t *live, unsigned node, unsigned max,
|
||||
uint16_t mask);
|
||||
bool pan_liveness_get(uint16_t *live, unsigned node, uint16_t max);
|
||||
|
||||
void pan_compute_liveness(struct list_head *blocks, unsigned temp_count,
|
||||
pan_liveness_update callback);
|
||||
|
||||
void pan_free_liveness(struct list_head *blocks);
|
||||
|
||||
uint16_t pan_to_bytemask(unsigned bytes, unsigned mask);
|
||||
|
||||
void pan_block_add_successor(pan_block *block, pan_block *successor);
|
||||
|
|
|
|||
|
|
@ -1,168 +0,0 @@
|
|||
/*
|
||||
* Copyright (C) 2019-2020 Collabora, Ltd.
|
||||
*
|
||||
* 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 "util/list.h"
|
||||
#include "util/set.h"
|
||||
#include "util/u_memory.h"
|
||||
#include "pan_ir.h"
|
||||
|
||||
/* Routines for liveness analysis. Liveness is tracked per byte per node. Per
|
||||
* byte granularity is necessary for proper handling of int8 */
|
||||
|
||||
void
|
||||
pan_liveness_gen(uint16_t *live, unsigned node, unsigned max, uint16_t mask)
|
||||
{
|
||||
if (node >= max)
|
||||
return;
|
||||
|
||||
live[node] |= mask;
|
||||
}
|
||||
|
||||
void
|
||||
pan_liveness_kill(uint16_t *live, unsigned node, unsigned max, uint16_t mask)
|
||||
{
|
||||
if (node >= max)
|
||||
return;
|
||||
|
||||
live[node] &= ~mask;
|
||||
}
|
||||
|
||||
bool
|
||||
pan_liveness_get(uint16_t *live, unsigned node, uint16_t max)
|
||||
{
|
||||
if (node >= max)
|
||||
return false;
|
||||
|
||||
return live[node];
|
||||
}
|
||||
|
||||
/* live_out[s] = sum { p in succ[s] } ( live_in[p] ) */
|
||||
|
||||
static void
|
||||
liveness_block_live_out(pan_block *blk, unsigned temp_count)
|
||||
{
|
||||
pan_foreach_successor(blk, succ) {
|
||||
for (unsigned i = 0; i < temp_count; ++i)
|
||||
blk->live_out[i] |= succ->live_in[i];
|
||||
}
|
||||
}
|
||||
|
||||
/* Liveness analysis is a backwards-may dataflow analysis pass. Within a block,
|
||||
* we compute live_out from live_in. The intrablock pass is linear-time. It
|
||||
* returns whether progress was made. */
|
||||
|
||||
static bool
|
||||
liveness_block_update(pan_block *blk, unsigned temp_count,
|
||||
pan_liveness_update callback)
|
||||
{
|
||||
bool progress = false;
|
||||
|
||||
liveness_block_live_out(blk, temp_count);
|
||||
|
||||
uint16_t *live = ralloc_array(blk, uint16_t, temp_count);
|
||||
memcpy(live, blk->live_out, temp_count * sizeof(uint16_t));
|
||||
|
||||
pan_foreach_instr_in_block_rev(blk, ins)
|
||||
callback(live, (void *)ins, temp_count);
|
||||
|
||||
/* To figure out progress, diff live_in */
|
||||
|
||||
for (unsigned i = 0; (i < temp_count) && !progress; ++i)
|
||||
progress |= (blk->live_in[i] != live[i]);
|
||||
|
||||
ralloc_free(blk->live_in);
|
||||
blk->live_in = live;
|
||||
|
||||
return progress;
|
||||
}
|
||||
|
||||
/* Globally, liveness analysis uses a fixed-point algorithm based on a
|
||||
* worklist. We initialize a work list with the exit block. We iterate the work
|
||||
* list to compute live_in from live_out for each block on the work list,
|
||||
* adding the predecessors of the block to the work list if we made progress.
|
||||
*/
|
||||
|
||||
void
|
||||
pan_compute_liveness(struct list_head *blocks, unsigned temp_count,
|
||||
pan_liveness_update callback)
|
||||
{
|
||||
|
||||
/* Set of pan_block */
|
||||
struct set *work_list =
|
||||
_mesa_set_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
|
||||
|
||||
struct set *visited =
|
||||
_mesa_set_create(NULL, _mesa_hash_pointer, _mesa_key_pointer_equal);
|
||||
|
||||
/* Free any previous liveness, and allocate */
|
||||
|
||||
pan_free_liveness(blocks);
|
||||
|
||||
list_for_each_entry(pan_block, block, blocks, link) {
|
||||
block->live_in = rzalloc_array(block, uint16_t, temp_count);
|
||||
block->live_out = rzalloc_array(block, uint16_t, temp_count);
|
||||
}
|
||||
|
||||
/* Initialize the work list with the exit block */
|
||||
struct set_entry *cur;
|
||||
|
||||
cur = _mesa_set_add(work_list, pan_exit_block(blocks));
|
||||
|
||||
/* Iterate the work list */
|
||||
|
||||
do {
|
||||
/* Pop off a block */
|
||||
pan_block *blk = (struct pan_block *)cur->key;
|
||||
_mesa_set_remove(work_list, cur);
|
||||
|
||||
/* Update its liveness information */
|
||||
bool progress = liveness_block_update(blk, temp_count, callback);
|
||||
|
||||
/* If we made progress, we need to process the predecessors */
|
||||
|
||||
if (progress || !_mesa_set_search(visited, blk)) {
|
||||
pan_foreach_predecessor(blk, pred)
|
||||
_mesa_set_add(work_list, pred);
|
||||
}
|
||||
|
||||
_mesa_set_add(visited, blk);
|
||||
} while ((cur = _mesa_set_next_entry(work_list, NULL)) != NULL);
|
||||
|
||||
_mesa_set_destroy(visited, NULL);
|
||||
_mesa_set_destroy(work_list, NULL);
|
||||
}
|
||||
|
||||
void
|
||||
pan_free_liveness(struct list_head *blocks)
|
||||
{
|
||||
list_for_each_entry(pan_block, block, blocks, link) {
|
||||
if (block->live_in)
|
||||
ralloc_free(block->live_in);
|
||||
|
||||
if (block->live_out)
|
||||
ralloc_free(block->live_out);
|
||||
|
||||
block->live_in = NULL;
|
||||
block->live_out = NULL;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Reference in a new issue