2 * Copyright (c) 2017 Lima Project
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, sub license,
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
12 * next paragraph) shall be included in all copies or substantial portions
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 NON-INFRINGEMENT. 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.
25 #include "util/u_math.h"
26 #include "util/ralloc.h"
27 #include "util/bitscan.h"
31 const ppir_op_info ppir_op_infos
[] = {
35 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_SCL_MUL
,
36 PPIR_INSTR_SLOT_ALU_VEC_ADD
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
52 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
59 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
75 PPIR_INSTR_SLOT_ALU_VEC_ADD
, PPIR_INSTR_SLOT_END
81 PPIR_INSTR_SLOT_ALU_VEC_ADD
, PPIR_INSTR_SLOT_END
87 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
93 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
99 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
105 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
111 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
117 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
123 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_SCL_MUL
,
124 PPIR_INSTR_SLOT_ALU_VEC_ADD
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
131 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_SCL_MUL
,
132 PPIR_INSTR_SLOT_ALU_VEC_ADD
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
139 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
146 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
153 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
160 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
167 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
174 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
181 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_VEC_MUL
,
194 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_SCL_ADD
,
195 PPIR_INSTR_SLOT_ALU_VEC_MUL
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
202 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_SCL_ADD
,
203 PPIR_INSTR_SLOT_ALU_VEC_MUL
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
210 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_SCL_ADD
,
211 PPIR_INSTR_SLOT_ALU_VEC_MUL
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
218 PPIR_INSTR_SLOT_ALU_SCL_MUL
, PPIR_INSTR_SLOT_ALU_SCL_ADD
,
219 PPIR_INSTR_SLOT_ALU_VEC_MUL
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
226 PPIR_INSTR_SLOT_ALU_SCL_ADD
, PPIR_INSTR_SLOT_ALU_VEC_ADD
,
233 PPIR_INSTR_SLOT_ALU_COMBINE
, PPIR_INSTR_SLOT_END
236 [ppir_op_load_varying
] = {
238 .type
= ppir_node_type_load
,
240 PPIR_INSTR_SLOT_VARYING
, PPIR_INSTR_SLOT_END
243 [ppir_op_load_coords
] = {
245 .type
= ppir_node_type_load
,
247 PPIR_INSTR_SLOT_VARYING
, PPIR_INSTR_SLOT_END
250 [ppir_op_load_fragcoord
] = {
251 .name
= "ld_fragcoord",
252 .type
= ppir_node_type_load
,
254 PPIR_INSTR_SLOT_VARYING
, PPIR_INSTR_SLOT_END
257 [ppir_op_load_uniform
] = {
259 .type
= ppir_node_type_load
,
261 PPIR_INSTR_SLOT_UNIFORM
, PPIR_INSTR_SLOT_END
264 [ppir_op_load_texture
] = {
266 .type
= ppir_node_type_load_texture
,
268 PPIR_INSTR_SLOT_TEXLD
, PPIR_INSTR_SLOT_END
271 [ppir_op_load_temp
] = {
273 .type
= ppir_node_type_load
,
275 PPIR_INSTR_SLOT_UNIFORM
, PPIR_INSTR_SLOT_END
280 .type
= ppir_node_type_const
,
282 [ppir_op_store_color
] = {
284 .type
= ppir_node_type_store
,
286 [ppir_op_store_temp
] = {
288 .type
= ppir_node_type_store
,
290 PPIR_INSTR_SLOT_STORE_TEMP
, PPIR_INSTR_SLOT_END
293 [ppir_op_discard
] = {
295 .type
= ppir_node_type_discard
,
297 PPIR_INSTR_SLOT_BRANCH
, PPIR_INSTR_SLOT_END
302 .type
= ppir_node_type_branch
,
304 PPIR_INSTR_SLOT_BRANCH
, PPIR_INSTR_SLOT_END
309 void *ppir_node_create(ppir_block
*block
, ppir_op op
, int index
, unsigned mask
)
311 ppir_compiler
*comp
= block
->comp
;
312 static const int node_size
[] = {
313 [ppir_node_type_alu
] = sizeof(ppir_alu_node
),
314 [ppir_node_type_const
] = sizeof(ppir_const_node
),
315 [ppir_node_type_load
] = sizeof(ppir_load_node
),
316 [ppir_node_type_store
] = sizeof(ppir_store_node
),
317 [ppir_node_type_load_texture
] = sizeof(ppir_load_texture_node
),
318 [ppir_node_type_discard
] = sizeof(ppir_discard_node
),
319 [ppir_node_type_branch
] = sizeof(ppir_branch_node
),
322 ppir_node_type type
= ppir_op_infos
[op
].type
;
323 int size
= node_size
[type
];
324 ppir_node
*node
= rzalloc_size(block
, size
);
328 list_inithead(&node
->succ_list
);
329 list_inithead(&node
->pred_list
);
333 /* reg has 4 slots for each componemt write node */
335 comp
->var_nodes
[(index
<< 2) + comp
->reg_base
+ u_bit_scan(&mask
)] = node
;
336 snprintf(node
->name
, sizeof(node
->name
), "reg%d", index
);
338 comp
->var_nodes
[index
] = node
;
339 snprintf(node
->name
, sizeof(node
->name
), "ssa%d", index
);
343 snprintf(node
->name
, sizeof(node
->name
), "new");
347 node
->index
= comp
->cur_index
++;
353 void ppir_node_add_dep(ppir_node
*succ
, ppir_node
*pred
)
355 /* don't add dep for two nodes from different block */
356 if (succ
->block
!= pred
->block
)
359 /* don't add duplicated dep */
360 ppir_node_foreach_pred(succ
, dep
) {
361 if (dep
->pred
== pred
)
365 ppir_dep
*dep
= ralloc(succ
, ppir_dep
);
368 list_addtail(&dep
->pred_link
, &succ
->pred_list
);
369 list_addtail(&dep
->succ_link
, &pred
->succ_list
);
372 void ppir_node_remove_dep(ppir_dep
*dep
)
374 list_del(&dep
->succ_link
);
375 list_del(&dep
->pred_link
);
379 static void _ppir_node_replace_child(ppir_src
*src
, ppir_node
*old_child
, ppir_node
*new_child
)
381 ppir_dest
*od
= ppir_node_get_dest(old_child
);
382 if (ppir_node_target_equal(src
, od
)) {
383 ppir_dest
*nd
= ppir_node_get_dest(new_child
);
384 ppir_node_target_assign(src
, nd
);
388 void ppir_node_replace_child(ppir_node
*parent
, ppir_node
*old_child
, ppir_node
*new_child
)
390 if (parent
->type
== ppir_node_type_alu
) {
391 ppir_alu_node
*alu
= ppir_node_to_alu(parent
);
392 for (int i
= 0; i
< alu
->num_src
; i
++)
393 _ppir_node_replace_child(alu
->src
+ i
, old_child
, new_child
);
395 else if (parent
->type
== ppir_node_type_store
) {
396 ppir_store_node
*store
= ppir_node_to_store(parent
);
397 _ppir_node_replace_child(&store
->src
, old_child
, new_child
);
401 void ppir_node_replace_pred(ppir_dep
*dep
, ppir_node
*new_pred
)
403 list_del(&dep
->succ_link
);
404 dep
->pred
= new_pred
;
405 list_addtail(&dep
->succ_link
, &new_pred
->succ_list
);
408 void ppir_node_replace_all_succ(ppir_node
*dst
, ppir_node
*src
)
410 ppir_node_foreach_succ_safe(src
, dep
) {
411 ppir_node_replace_pred(dep
, dst
);
412 ppir_node_replace_child(dep
->succ
, src
, dst
);
416 void ppir_node_delete(ppir_node
*node
)
418 ppir_node_foreach_succ_safe(node
, dep
)
419 ppir_node_remove_dep(dep
);
421 ppir_node_foreach_pred_safe(node
, dep
)
422 ppir_node_remove_dep(dep
);
424 list_del(&node
->list
);
428 static void ppir_node_print_node(ppir_node
*node
, int space
)
430 for (int i
= 0; i
< space
; i
++)
432 printf("%s%s %d %s\n", node
->printed
&& !ppir_node_is_leaf(node
) ? "+" : "",
433 ppir_op_infos
[node
->op
].name
, node
->index
, node
->name
);
435 if (!node
->printed
) {
436 ppir_node_foreach_pred(node
, dep
) {
437 ppir_node
*pred
= dep
->pred
;
438 ppir_node_print_node(pred
, space
+ 2);
441 node
->printed
= true;
445 void ppir_node_print_prog(ppir_compiler
*comp
)
447 if (!(lima_debug
& LIMA_DEBUG_PP
))
450 list_for_each_entry(ppir_block
, block
, &comp
->block_list
, list
) {
451 list_for_each_entry(ppir_node
, node
, &block
->node_list
, list
) {
452 node
->printed
= false;
456 printf("========prog========\n");
457 list_for_each_entry(ppir_block
, block
, &comp
->block_list
, list
) {
458 printf("-------block------\n");
459 list_for_each_entry(ppir_node
, node
, &block
->node_list
, list
) {
460 if (ppir_node_is_root(node
))
461 ppir_node_print_node(node
, 0);
464 printf("====================\n");