1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/*
* Copyright (C) 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.
*
* Authors (Collabora):
* Alyssa Rosenzweig <alyssa.rosenzweig@collabora.com>
*/
#include "compiler.h"
/* Finds the clause type required or return none */
static enum bifrost_clause_type
bi_clause_type_for_ins(bi_instruction *ins)
{
unsigned T = ins->type;
/* Only high latency ops impose clause types */
if (!(bi_class_props[T] & BI_SCHED_HI_LATENCY))
return BIFROST_CLAUSE_NONE;
switch (T) {
case BI_BRANCH:
case BI_DISCARD:
return BIFROST_CLAUSE_NONE;
case BI_LOAD_VAR:
return BIFROST_CLAUSE_LOAD_VARY;
case BI_LOAD_UNIFORM:
case BI_LOAD_ATTR:
case BI_LOAD_VAR_ADDRESS:
return BIFROST_CLAUSE_UBO;
case BI_TEX:
return BIFROST_CLAUSE_TEX;
case BI_LOAD:
return BIFROST_CLAUSE_SSBO_LOAD;
case BI_STORE:
case BI_STORE_VAR:
return BIFROST_CLAUSE_SSBO_STORE;
case BI_BLEND:
return BIFROST_CLAUSE_BLEND;
case BI_ATEST:
return BIFROST_CLAUSE_ATEST;
default:
unreachable("Invalid high-latency class");
}
}
/* Eventually, we'll need a proper scheduling, grouping instructions
* into clauses and ordering/assigning grouped instructions to the
* appropriate FMA/ADD slots. Right now we do the dumbest possible
* thing just to have the scheduler stubbed out so we can focus on
* codegen */
void
bi_schedule(bi_context *ctx)
{
unsigned ids = 0;
unsigned last_id = 0;
bool is_first = true;
bi_foreach_block(ctx, block) {
bi_block *bblock = (bi_block *) block;
list_inithead(&bblock->clauses);
bi_foreach_instr_in_block(bblock, ins) {
unsigned props = bi_class_props[ins->type];
bi_clause *u = rzalloc(ctx, bi_clause);
u->bundle_count = 1;
if (props & BI_SCHED_FMA)
u->bundles[0].fma = ins;
else
u->bundles[0].add = ins;
u->scoreboard_id = ids++;
if (is_first)
is_first = false;
else
u->dependencies |= (1 << last_id);
ids = ids & 1;
last_id = u->scoreboard_id;
u->back_to_back = true;
/* Rule: first instructions cannot have write barriers */
if (!is_first)
u->data_register_write_barrier = true;
u->constant_count = 1;
u->constants[0] = ins->constant.u64;
u->clause_type = bi_clause_type_for_ins(ins);
list_addtail(&u->link, &bblock->clauses);
}
bblock->scheduled = true;
}
}
|
