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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
|
/*
* Copyright © 2014 Broadcom
*
* 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.
*/
/**
* @file vc4_opt_cse.c
*
* Implements CSE for QIR without control flow.
*
* For each operation that writes a destination (and isn't just a MOV), put it
* in the hash table of all instructions that do so. When faced with another
* one, look it up in the hash table by its opcode and operands. If there's
* an entry in the table, then just reuse the entry's destination as the
* source of a MOV instead of reproducing the computation. That MOV will then
* get cleaned up by copy propagation.
*/
#include "vc4_qir.h"
#include "util/hash_table.h"
#include "util/ralloc.h"
static bool debug;
struct inst_key {
enum qop op;
struct qreg src[4];
/**
* If the instruction depends on the flags, how many QOP_SFs have been
* seen before this instruction, or if it depends on r4, how many r4
* writes have been seen.
*/
uint32_t implicit_arg_update_count;
};
static bool
inst_key_equals(const void *a, const void *b)
{
const struct inst_key *key_a = a;
const struct inst_key *key_b = b;
return memcmp(key_a, key_b, sizeof(*key_a)) == 0;
}
static struct qinst *
vc4_find_cse(struct vc4_compile *c, struct hash_table *ht,
struct qinst *inst, uint32_t sf_count,
uint32_t r4_count)
{
if (inst->dst.file != QFILE_TEMP ||
inst->op == QOP_MOV ||
qir_get_op_nsrc(inst->op) > 4) {
return NULL;
}
struct inst_key key;
memset(&key, 0, sizeof(key));
key.op = inst->op;
memcpy(key.src, inst->src,
qir_get_op_nsrc(inst->op) * sizeof(key.src[0]));
if (qir_depends_on_flags(inst))
key.implicit_arg_update_count = sf_count;
if (qir_reads_r4(inst))
key.implicit_arg_update_count = r4_count;
uint32_t hash = _mesa_hash_data(&key, sizeof(key));
struct hash_entry *entry =
_mesa_hash_table_search_pre_hashed(ht, hash, &key);
if (entry) {
if (debug) {
fprintf(stderr, "CSE found match:\n");
fprintf(stderr, " Original inst: ");
qir_dump_inst(c, entry->data);
fprintf(stderr, "\n");
fprintf(stderr, " Our inst: ");
qir_dump_inst(c, inst);
fprintf(stderr, "\n");
}
return entry->data;
}
struct inst_key *alloc_key = ralloc(ht, struct inst_key);
if (!alloc_key)
return NULL;
memcpy(alloc_key, &key, sizeof(*alloc_key));
_mesa_hash_table_insert_pre_hashed(ht, hash, alloc_key, inst);
if (debug) {
fprintf(stderr, "Added to CSE HT: ");
qir_dump_inst(c, inst);
fprintf(stderr, "\n");
}
return NULL;
}
bool
qir_opt_cse(struct vc4_compile *c)
{
bool progress = false;
struct simple_node *node, *t;
struct qinst *last_sf = NULL;
uint32_t sf_count = 0, r4_count = 0;
struct hash_table *ht = _mesa_hash_table_create(NULL, NULL,
inst_key_equals);
if (!ht)
return false;
foreach_s(node, t, &c->instructions) {
struct qinst *inst = (struct qinst *)node;
if (qir_has_side_effects(c, inst) ||
qir_has_side_effect_reads(c, inst)) {
if (inst->op == QOP_TLB_DISCARD_SETUP)
last_sf = NULL;
continue;
}
if (inst->op == QOP_SF) {
if (last_sf &&
qir_reg_equals(last_sf->src[0], inst->src[0])) {
if (debug) {
fprintf(stderr,
"Removing redundant SF: ");
qir_dump_inst(c, inst);
fprintf(stderr, "\n");
}
qir_remove_instruction(inst);
progress = true;
continue;
} else {
last_sf = inst;
sf_count++;
}
} else {
struct qinst *cse = vc4_find_cse(c, ht, inst,
sf_count, r4_count);
if (cse) {
inst->src[0] = cse->dst;
for (int i = 1; i < qir_get_op_nsrc(inst->op);
i++)
inst->src[i] = c->undef;
inst->op = QOP_MOV;
progress = true;
if (debug) {
fprintf(stderr, " Turned into: ");
qir_dump_inst(c, inst);
fprintf(stderr, "\n");
}
}
}
if (qir_writes_r4(inst))
r4_count++;
}
ralloc_free(ht);
return progress;
}
|
