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
24 * Eric Anholt <eric@anholt.net>
33 * Walks the shader instructions generated and creates a set of basic
34 * blocks with successor/predecessor edges connecting them.
38 pop_stack(exec_list
*list
)
40 bblock_link
*link
= (bblock_link
*)list
->get_tail();
41 bblock_t
*block
= link
->block
;
47 bblock_t::bblock_t() :
48 start_ip(0), end_ip(0), block_num(0)
54 children
.make_empty();
62 bblock_t::add_successor(void *mem_ctx
, bblock_t
*successor
)
64 successor
->parents
.push_tail(this->make_list(mem_ctx
));
65 children
.push_tail(successor
->make_list(mem_ctx
));
69 bblock_t::make_list(void *mem_ctx
)
71 return new(mem_ctx
) bblock_link(this);
75 bblock_t::dump(backend_visitor
*v
)
77 int ip
= this->start_ip
;
78 for (backend_instruction
*inst
= (backend_instruction
*)this->start
;
79 inst
!= this->end
->next
;
80 inst
= (backend_instruction
*) inst
->next
) {
82 v
->dump_instruction(inst
);
87 cfg_t::cfg_t(backend_visitor
*v
)
89 create(v
->mem_ctx
, &v
->instructions
);
92 cfg_t::cfg_t(void *mem_ctx
, exec_list
*instructions
)
94 create(mem_ctx
, instructions
);
98 cfg_t::create(void *parent_mem_ctx
, exec_list
*instructions
)
100 mem_ctx
= ralloc_context(NULL
);
101 block_list
.make_empty();
107 bblock_t
*entry
= new_block();
108 bblock_t
*cur_if
= NULL
, *cur_else
= NULL
, *cur_endif
= NULL
;
109 bblock_t
*cur_do
= NULL
, *cur_while
= NULL
;
110 exec_list if_stack
, else_stack
, do_stack
, while_stack
;
113 set_next_block(entry
);
115 entry
->start
= (backend_instruction
*) instructions
->get_head();
117 foreach_list(node
, instructions
) {
118 backend_instruction
*inst
= (backend_instruction
*)node
;
122 /* set_next_block wants the post-incremented ip */
125 switch (inst
->opcode
) {
127 /* Push our information onto a stack so we can recover from
130 if_stack
.push_tail(cur_if
->make_list(mem_ctx
));
131 else_stack
.push_tail(cur_else
->make_list(mem_ctx
));
137 /* Set up our immediately following block, full of "then"
141 next
->start
= (backend_instruction
*)inst
->next
;
142 cur_if
->add_successor(mem_ctx
, next
);
144 set_next_block(next
);
147 case BRW_OPCODE_ELSE
:
151 next
->start
= (backend_instruction
*)inst
->next
;
152 cur_if
->add_successor(mem_ctx
, next
);
154 set_next_block(next
);
157 case BRW_OPCODE_ENDIF
: {
158 if (cur
->start
== inst
) {
159 /* New block was just created; use it. */
162 cur_endif
= new_block();
163 cur_endif
->start
= inst
;
165 cur
->end
= (backend_instruction
*)inst
->prev
;
166 cur
->add_successor(mem_ctx
, cur_endif
);
169 set_next_block(cur_endif
);
173 backend_instruction
*else_inst
= NULL
;
175 else_inst
= (backend_instruction
*)cur_else
->end
;
177 cur_else
->add_successor(mem_ctx
, cur_endif
);
179 cur_if
->add_successor(mem_ctx
, cur_endif
);
182 assert(cur_if
->end
->opcode
== BRW_OPCODE_IF
);
183 assert(!else_inst
|| else_inst
->opcode
== BRW_OPCODE_ELSE
);
184 assert(inst
->opcode
== BRW_OPCODE_ENDIF
);
186 cur_if
->if_inst
= cur_if
->end
;
187 cur_if
->else_inst
= else_inst
;
188 cur_if
->endif_inst
= inst
;
191 cur_else
->if_inst
= cur_if
->end
;
192 cur_else
->else_inst
= else_inst
;
193 cur_else
->endif_inst
= inst
;
196 cur
->if_inst
= cur_if
->end
;
197 cur
->else_inst
= else_inst
;
198 cur
->endif_inst
= inst
;
200 /* Pop the stack so we're in the previous if/else/endif */
201 cur_if
= pop_stack(&if_stack
);
202 cur_else
= pop_stack(&else_stack
);
206 /* Push our information onto a stack so we can recover from
209 do_stack
.push_tail(cur_do
->make_list(mem_ctx
));
210 while_stack
.push_tail(cur_while
->make_list(mem_ctx
));
212 /* Set up the block just after the while. Don't know when exactly
213 * it will start, yet.
215 cur_while
= new_block();
217 /* Set up our immediately following block, full of "then"
221 next
->start
= (backend_instruction
*)inst
->next
;
222 cur
->add_successor(mem_ctx
, next
);
225 set_next_block(next
);
228 case BRW_OPCODE_CONTINUE
:
229 cur
->add_successor(mem_ctx
, cur_do
);
232 next
->start
= (backend_instruction
*)inst
->next
;
234 cur
->add_successor(mem_ctx
, next
);
236 set_next_block(next
);
239 case BRW_OPCODE_BREAK
:
240 cur
->add_successor(mem_ctx
, cur_while
);
243 next
->start
= (backend_instruction
*)inst
->next
;
245 cur
->add_successor(mem_ctx
, next
);
247 set_next_block(next
);
250 case BRW_OPCODE_WHILE
:
251 cur_while
->start
= (backend_instruction
*)inst
->next
;
253 cur
->add_successor(mem_ctx
, cur_do
);
254 set_next_block(cur_while
);
256 /* Pop the stack so we're in the previous loop */
257 cur_do
= pop_stack(&do_stack
);
258 cur_while
= pop_stack(&while_stack
);
273 ralloc_free(mem_ctx
);
279 bblock_t
*block
= new(mem_ctx
) bblock_t();
285 cfg_t::set_next_block(bblock_t
*block
)
288 assert(cur
->end
->next
== block
->start
);
289 cur
->end_ip
= ip
- 1;
292 block
->start_ip
= ip
;
293 block
->block_num
= num_blocks
++;
294 block_list
.push_tail(block
->make_list(mem_ctx
));
299 cfg_t::make_block_array()
301 blocks
= ralloc_array(mem_ctx
, bblock_t
*, num_blocks
);
304 foreach_list(block_node
, &block_list
) {
305 bblock_link
*link
= (bblock_link
*)block_node
;
306 blocks
[i
++] = link
->block
;
308 assert(i
== num_blocks
);
312 cfg_t::dump(backend_visitor
*v
)
314 for (int b
= 0; b
< this->num_blocks
; b
++) {
315 bblock_t
*block
= this->blocks
[b
];
316 printf("START B%d", b
);
317 foreach_list(node
, &block
->parents
) {
318 bblock_link
*link
= (bblock_link
*)node
;
319 printf(" <-B%d", link
->block
->block_num
);
323 printf("END B%d", b
);
324 foreach_list(node
, &block
->children
) {
325 bblock_link
*link
= (bblock_link
*)node
;
326 printf(" ->B%d", link
->block
->block_num
);