166 lines
4.6 KiB
C
166 lines
4.6 KiB
C
/* -*- mode: C; c-file-style: "k&r"; tab-width 4; indent-tabs-mode: t; -*- */
|
|
|
|
/*
|
|
* Copyright (C) 2014 Rob Clark <robclark@freedesktop.org>
|
|
*
|
|
* 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.
|
|
*
|
|
* Authors:
|
|
* Rob Clark <robclark@freedesktop.org>
|
|
*/
|
|
|
|
#include "util/u_math.h"
|
|
|
|
#include "ir3.h"
|
|
|
|
/*
|
|
* Instruction Depth:
|
|
*
|
|
* Calculates weighted instruction depth, ie. the sum of # of needed
|
|
* instructions plus delay slots back to original input (ie INPUT or
|
|
* CONST). That is to say, an instructions depth is:
|
|
*
|
|
* depth(instr) {
|
|
* d = 0;
|
|
* // for each src register:
|
|
* foreach (src in instr->regs[1..n])
|
|
* d = max(d, delayslots(src->instr, n) + depth(src->instr));
|
|
* return d + 1;
|
|
* }
|
|
*
|
|
* After an instruction's depth is calculated, it is inserted into the
|
|
* blocks depth sorted list, which is used by the scheduling pass.
|
|
*/
|
|
|
|
/* calculate required # of delay slots between the instruction that
|
|
* assigns a value and the one that consumes
|
|
*/
|
|
int ir3_delayslots(struct ir3_instruction *assigner,
|
|
struct ir3_instruction *consumer, unsigned n)
|
|
{
|
|
/* worst case is cat1-3 (alu) -> cat4/5 needing 6 cycles, normal
|
|
* alu -> alu needs 3 cycles, cat4 -> alu and texture fetch
|
|
* handled with sync bits
|
|
*/
|
|
|
|
if (is_meta(assigner))
|
|
return 0;
|
|
|
|
if (writes_addr(assigner))
|
|
return 6;
|
|
|
|
/* handled via sync flags: */
|
|
if (is_sfu(assigner) || is_tex(assigner) || is_mem(assigner))
|
|
return 0;
|
|
|
|
/* assigner must be alu: */
|
|
if (is_flow(consumer) || is_sfu(consumer) || is_tex(consumer) ||
|
|
is_mem(consumer)) {
|
|
return 6;
|
|
} else if ((consumer->category == 3) &&
|
|
(is_mad(consumer->opc) || is_madsh(consumer->opc)) &&
|
|
(n == 2)) {
|
|
/* special case, 3rd src to cat3 not required on first cycle */
|
|
return 1;
|
|
} else {
|
|
return 3;
|
|
}
|
|
}
|
|
|
|
void
|
|
ir3_insert_by_depth(struct ir3_instruction *instr, struct list_head *list)
|
|
{
|
|
/* remove from existing spot in list: */
|
|
list_delinit(&instr->node);
|
|
|
|
/* find where to re-insert instruction: */
|
|
list_for_each_entry (struct ir3_instruction, pos, list, node) {
|
|
if (pos->depth > instr->depth) {
|
|
list_add(&instr->node, &pos->node);
|
|
return;
|
|
}
|
|
}
|
|
/* if we get here, we didn't find an insertion spot: */
|
|
list_addtail(&instr->node, list);
|
|
}
|
|
|
|
static void
|
|
ir3_instr_depth(struct ir3_instruction *instr)
|
|
{
|
|
struct ir3_instruction *src;
|
|
|
|
/* if we've already visited this instruction, bail now: */
|
|
if (ir3_instr_check_mark(instr))
|
|
return;
|
|
|
|
instr->depth = 0;
|
|
|
|
foreach_ssa_src_n(src, i, instr) {
|
|
unsigned sd;
|
|
|
|
/* visit child to compute it's depth: */
|
|
ir3_instr_depth(src);
|
|
|
|
sd = ir3_delayslots(src, instr, i) + src->depth;
|
|
|
|
instr->depth = MAX2(instr->depth, sd);
|
|
}
|
|
|
|
if (!is_meta(instr))
|
|
instr->depth++;
|
|
|
|
ir3_insert_by_depth(instr, &instr->block->instr_list);
|
|
}
|
|
|
|
static void
|
|
remove_unused_by_block(struct ir3_block *block)
|
|
{
|
|
list_for_each_entry_safe (struct ir3_instruction, instr, &block->instr_list, node) {
|
|
if (!ir3_instr_check_mark(instr)) {
|
|
/* mark it, in case it is input, so we can
|
|
* remove unused inputs:
|
|
*/
|
|
instr->depth = DEPTH_UNUSED;
|
|
/* and remove from instruction list: */
|
|
list_delinit(&instr->node);
|
|
}
|
|
}
|
|
}
|
|
|
|
void ir3_block_depth(struct ir3_block *block)
|
|
{
|
|
unsigned i;
|
|
|
|
ir3_clear_mark(block->shader);
|
|
for (i = 0; i < block->noutputs; i++)
|
|
if (block->outputs[i])
|
|
ir3_instr_depth(block->outputs[i]);
|
|
|
|
/* mark un-used instructions: */
|
|
remove_unused_by_block(block);
|
|
|
|
/* cleanup unused inputs: */
|
|
for (i = 0; i < block->ninputs; i++) {
|
|
struct ir3_instruction *in = block->inputs[i];
|
|
if (in && (in->depth == DEPTH_UNUSED))
|
|
block->inputs[i] = NULL;
|
|
}
|
|
}
|