2 * Copyright © 2012 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
27 /** @file brw_fs_cse.cpp
29 * Support for local common subexpression elimination.
31 * See Muchnik's Advanced Compiler Design and Implementation, section
36 struct aeb_entry : public exec_node {
37 /** The instruction that generates the expression value. */
40 /** The temporary where the value is stored. */
46 is_expression(const fs_inst *const inst)
48 switch (inst->opcode) {
69 case FS_OPCODE_UNIFORM_PULL_CONSTANT_LOAD:
70 case FS_OPCODE_CINTERP:
71 case FS_OPCODE_LINTERP:
79 operands_match(fs_reg *xs, fs_reg *ys)
81 return xs[0].equals(ys[0]) && xs[1].equals(ys[1]) && xs[2].equals(ys[2]);
85 fs_visitor::opt_cse_local(bblock_t *block, exec_list *aeb)
87 bool progress = false;
89 void *mem_ctx = ralloc_context(this->mem_ctx);
91 for (fs_inst *inst = (fs_inst *)block->start;
92 inst != block->end->next;
93 inst = (fs_inst *) inst->next) {
95 /* Skip some cases. */
96 if (is_expression(inst) && !inst->predicate && inst->mlen == 0 &&
97 !inst->force_uncompressed && !inst->force_sechalf &&
98 !inst->conditional_mod)
103 foreach_list(entry_node, aeb) {
104 entry = (aeb_entry *) entry_node;
106 /* Match current instruction's expression against those in AEB. */
107 if (inst->opcode == entry->generator->opcode &&
108 inst->saturate == entry->generator->saturate &&
109 inst->dst.type == entry->generator->dst.type &&
110 operands_match(entry->generator->src, inst->src)) {
119 /* Our first sighting of this expression. Create an entry. */
120 aeb_entry *entry = ralloc(mem_ctx, aeb_entry);
121 entry->tmp = reg_undef;
122 entry->generator = inst;
123 aeb->push_tail(entry);
125 /* This is at least our second sighting of this expression.
126 * If we don't have a temporary already, make one.
128 bool no_existing_temp = entry->tmp.file == BAD_FILE;
129 if (no_existing_temp) {
130 entry->tmp = fs_reg(this, glsl_type::float_type);
131 entry->tmp.type = inst->dst.type;
133 fs_inst *copy = new(ralloc_parent(inst))
134 fs_inst(BRW_OPCODE_MOV, entry->generator->dst, entry->tmp);
135 entry->generator->insert_after(copy);
136 entry->generator->dst = entry->tmp;
140 assert(inst->dst.type == entry->tmp.type);
141 fs_inst *copy = new(ralloc_parent(inst))
142 fs_inst(BRW_OPCODE_MOV, inst->dst, entry->tmp);
143 copy->force_writemask_all = inst->force_writemask_all;
144 inst->replace_with(copy);
146 /* Appending an instruction may have changed our bblock end. */
147 if (inst == block->end) {
151 /* Continue iteration with copy->next */
156 /* Kill all AEB entries that use the destination. */
157 foreach_list_safe(entry_node, aeb) {
158 aeb_entry *entry = (aeb_entry *)entry_node;
160 for (int i = 0; i < 3; i++) {
161 if (inst->overwrites_reg(entry->generator->src[i])) {
170 ralloc_free(mem_ctx);
173 this->live_intervals_valid = false;
179 fs_visitor::opt_cse()
181 bool progress = false;
185 for (int b = 0; b < cfg.num_blocks; b++) {
186 bblock_t *block = cfg.blocks[b];
189 progress = opt_cse_local(block, &aeb) || progress;