2
* Copyright © 2010 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
21
* DEALINGS IN THE SOFTWARE.
24
#include "glsl_types.h"
25
#include "loop_analysis.h"
26
#include "ir_hierarchical_visitor.h"
28
class loop_unroll_visitor : public ir_hierarchical_visitor {
30
loop_unroll_visitor(loop_state *state, unsigned max_iterations)
33
this->progress = false;
34
this->max_iterations = max_iterations;
37
virtual ir_visitor_status visit_leave(ir_loop *ir);
42
unsigned max_iterations;
47
loop_unroll_visitor::visit_leave(ir_loop *ir)
49
loop_variable_state *const ls = this->state->get(ir);
51
/* If we've entered a loop that hasn't been analyzed, something really,
52
* really bad has happened.
56
return visit_continue;
59
/* Don't try to unroll loops where the number of iterations is not known
62
if (ls->max_iterations < 0)
63
return visit_continue;
65
/* Don't try to unroll loops that have zillions of iterations either.
67
if (ls->max_iterations > max_iterations)
68
return visit_continue;
70
if (ls->num_loop_jumps > 0)
71
return visit_continue;
73
void *const mem_ctx = talloc_parent(ir);
75
for (int i = 0; i < ls->max_iterations; i++) {
78
copy_list.make_empty();
79
clone_ir_list(mem_ctx, ©_list, &ir->body_instructions);
81
ir->insert_before(©_list);
84
/* The loop has been replaced by the unrolled copies. Remove the original
85
* loop from the IR sequence.
89
this->progress = true;
90
return visit_continue;
95
unroll_loops(exec_list *instructions, loop_state *ls, unsigned max_iterations)
97
loop_unroll_visitor v(ls, max_iterations);