2 * Copyright (c) 2017 Lima Project
3 * Copyright (c) 2013 Connor Abbott
5 * Permission is hereby granted, free of charge, to any person obtaining a copy
6 * of this software and associated documentation files (the "Software"), to deal
7 * in the Software without restriction, including without limitation the rights
8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 * copies of the Software, and to permit persons to whom the Software is
10 * furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice shall be included in
13 * all copies or substantial portions of the Software.
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 THE
18 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #ifndef LIMA_IR_PP_PPIR_H
26 #define LIMA_IR_PP_PPIR_H
28 #include "util/u_math.h"
29 #include "util/list.h"
32 #include "ir/lima_ir.h"
100 ppir_op_load_uniform
,
101 ppir_op_load_varying
,
103 ppir_op_load_coords_reg
,
104 ppir_op_load_fragcoord
,
105 ppir_op_load_pointcoord
,
106 ppir_op_load_frontface
,
107 ppir_op_load_texture
,
126 ppir_node_type_const
,
128 ppir_node_type_store
,
129 ppir_node_type_load_texture
,
130 ppir_node_type_discard
,
131 ppir_node_type_branch
,
140 extern const ppir_op_info ppir_op_infos
[];
144 ppir_dep_write_after_read
,
151 struct list_head pred_link
;
152 struct list_head succ_link
;
155 typedef struct ppir_node
{
156 struct list_head list
;
162 struct ppir_instr
*instr
;
164 struct ppir_block
*block
;
167 struct list_head succ_list
;
168 struct list_head pred_list
;
172 ppir_pipeline_reg_const0
,
173 ppir_pipeline_reg_const1
,
174 ppir_pipeline_reg_sampler
,
175 ppir_pipeline_reg_uniform
,
176 ppir_pipeline_reg_vmul
,
177 ppir_pipeline_reg_fmul
,
178 ppir_pipeline_reg_discard
, /* varying load */
181 typedef struct ppir_reg
{
182 struct list_head list
;
187 /* whether this reg has to start from the x component
188 * of a full physical reg, this is true for reg used
189 * in load/store instr which has no swizzle field */
197 ppir_target_pipeline
,
198 ppir_target_register
,
201 typedef struct ppir_src
{
208 ppir_pipeline pipeline
;
212 bool absolute
, negate
;
217 ppir_outmod_clamp_fraction
,
218 ppir_outmod_clamp_positive
,
222 typedef struct ppir_dest
{
228 ppir_pipeline pipeline
;
231 ppir_outmod modifier
;
232 unsigned write_mask
: 4;
240 int shift
: 3; /* Only used for ppir_op_mul */
243 typedef struct ppir_const
{
273 ppir_src src
[2]; /* src[0] temporarily stores src_coords,
274 not to be used after lowering */
280 } ppir_load_texture_node
;
286 enum ppir_instr_slot
{
287 PPIR_INSTR_SLOT_VARYING
,
288 PPIR_INSTR_SLOT_TEXLD
,
289 PPIR_INSTR_SLOT_UNIFORM
,
290 PPIR_INSTR_SLOT_ALU_VEC_MUL
,
291 PPIR_INSTR_SLOT_ALU_SCL_MUL
,
292 PPIR_INSTR_SLOT_ALU_VEC_ADD
,
293 PPIR_INSTR_SLOT_ALU_SCL_ADD
,
294 PPIR_INSTR_SLOT_ALU_COMBINE
,
295 PPIR_INSTR_SLOT_STORE_TEMP
,
296 PPIR_INSTR_SLOT_BRANCH
,
299 PPIR_INSTR_SLOT_ALU_START
= PPIR_INSTR_SLOT_ALU_VEC_MUL
,
300 PPIR_INSTR_SLOT_ALU_END
= PPIR_INSTR_SLOT_ALU_COMBINE
,
303 struct ppir_liveness
{
308 typedef struct ppir_instr
{
309 struct list_head list
;
312 int seq
; /* command sequence after schedule */
314 ppir_node
*slots
[PPIR_INSTR_SLOT_NUM
];
315 ppir_const constant
[2];
319 struct list_head succ_list
;
320 struct list_head pred_list
;
322 int est
; /* earliest start time */
328 /* for liveness analysis */
329 struct ppir_liveness
*live_in
;
330 struct ppir_liveness
*live_out
;
331 /* live_internal is to mark registers only live within an
332 * instruction, without propagation */
333 struct ppir_liveness
*live_internal
;
334 struct set
*live_in_set
;
335 struct set
*live_out_set
;
336 struct set
*live_internal_set
;
339 typedef struct ppir_block
{
340 struct list_head list
;
341 struct list_head node_list
;
342 struct list_head instr_list
;
344 struct ppir_block
*successors
[2];
346 struct ppir_compiler
*comp
;
349 int sched_instr_index
;
350 int sched_instr_base
;
353 /* for liveness analysis */
354 struct ppir_liveness
*live_in
;
355 struct ppir_liveness
*live_out
;
356 struct set
*live_in_set
;
357 struct set
*live_out_set
;
372 struct lima_fs_shader_state
;
374 typedef struct ppir_compiler
{
375 struct list_head block_list
;
376 struct hash_table_u64
*blocks
;
380 struct list_head reg_list
;
382 /* array for searching ssa/reg node */
383 ppir_node
**var_nodes
;
387 struct lima_fs_shader_state
*prog
;
390 int sched_instr_base
;
392 /* for regalloc spilling debug */
400 ppir_block
*discard_block
;
401 ppir_block
*current_block
;
402 ppir_block
*loop_break_block
;
403 ppir_block
*loop_cont_block
;
406 void *ppir_node_create(ppir_block
*block
, ppir_op op
, int index
, unsigned mask
);
407 void ppir_node_add_dep(ppir_node
*succ
, ppir_node
*pred
, ppir_dep_type type
);
408 void ppir_node_remove_dep(ppir_dep
*dep
);
409 void ppir_node_delete(ppir_node
*node
);
410 void ppir_node_print_prog(ppir_compiler
*comp
);
411 void ppir_node_replace_child(ppir_node
*parent
, ppir_node
*old_child
, ppir_node
*new_child
);
412 void ppir_node_replace_all_succ(ppir_node
*dst
, ppir_node
*src
);
413 void ppir_node_replace_pred(ppir_dep
*dep
, ppir_node
*new_pred
);
414 void ppir_delete_if_orphan(ppir_block
*block
, ppir_node
*node
);
415 ppir_dep
*ppir_dep_for_pred(ppir_node
*node
, ppir_node
*pred
);
416 ppir_node
*ppir_node_clone(ppir_block
*block
, ppir_node
*node
);
417 /* Assumes that node successors are in the same block */
418 ppir_node
*ppir_node_insert_mov(ppir_node
*node
);
419 ppir_node
*ppir_node_insert_mov_all_blocks(ppir_node
*node
);
421 static inline bool ppir_node_is_root(ppir_node
*node
)
423 return list_is_empty(&node
->succ_list
);
426 static inline bool ppir_node_is_leaf(ppir_node
*node
)
428 return list_is_empty(&node
->pred_list
);
431 static inline bool ppir_node_has_single_succ(ppir_node
*node
)
433 return list_is_singular(&node
->succ_list
);
436 bool ppir_node_has_single_src_succ(ppir_node
*node
);
438 static inline ppir_node
*ppir_node_first_succ(ppir_node
*node
)
440 return list_first_entry(&node
->succ_list
, ppir_dep
, succ_link
)->succ
;
443 static inline bool ppir_node_has_single_pred(ppir_node
*node
)
445 return list_is_singular(&node
->pred_list
);
448 static inline ppir_node
*ppir_node_first_pred(ppir_node
*node
)
450 return list_first_entry(&node
->pred_list
, ppir_dep
, pred_link
)->pred
;
453 #define ppir_node_foreach_succ(node, dep) \
454 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
455 #define ppir_node_foreach_succ_safe(node, dep) \
456 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
457 #define ppir_node_foreach_pred(node, dep) \
458 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
459 #define ppir_node_foreach_pred_safe(node, dep) \
460 list_for_each_entry_safe(ppir_dep, dep, &node->pred_list, pred_link)
462 #define ppir_node_to_alu(node) ((ppir_alu_node *)(node))
463 #define ppir_node_to_const(node) ((ppir_const_node *)(node))
464 #define ppir_node_to_load(node) ((ppir_load_node *)(node))
465 #define ppir_node_to_store(node) ((ppir_store_node *)(node))
466 #define ppir_node_to_load_texture(node) ((ppir_load_texture_node *)(node))
467 #define ppir_node_to_discard(node) ((ppir_discard_node *)(node))
468 #define ppir_node_to_branch(node) ((ppir_branch_node *)(node))
470 static inline ppir_dest
*ppir_node_get_dest(ppir_node
*node
)
472 switch (node
->type
) {
473 case ppir_node_type_alu
:
474 return &ppir_node_to_alu(node
)->dest
;
475 case ppir_node_type_load
:
476 return &ppir_node_to_load(node
)->dest
;
477 case ppir_node_type_const
:
478 return &ppir_node_to_const(node
)->dest
;
479 case ppir_node_type_load_texture
:
480 return &ppir_node_to_load_texture(node
)->dest
;
486 static inline int ppir_node_get_src_num(ppir_node
*node
)
488 switch (node
->type
) {
489 case ppir_node_type_alu
:
490 return ppir_node_to_alu(node
)->num_src
;
491 case ppir_node_type_branch
:
492 return ppir_node_to_branch(node
)->num_src
;
493 case ppir_node_type_load
:
494 return ppir_node_to_load(node
)->num_src
;
495 case ppir_node_type_load_texture
:
496 return ppir_node_to_load_texture(node
)->num_src
;
497 case ppir_node_type_store
:
506 static inline ppir_src
*ppir_node_get_src(ppir_node
*node
, int idx
)
508 if (idx
< 0 || idx
>= ppir_node_get_src_num(node
))
511 switch (node
->type
) {
512 case ppir_node_type_alu
:
513 return &ppir_node_to_alu(node
)->src
[idx
];
514 case ppir_node_type_branch
:
515 return &ppir_node_to_branch(node
)->src
[idx
];
516 case ppir_node_type_load_texture
:
517 return &ppir_node_to_load_texture(node
)->src
[idx
];
518 case ppir_node_type_load
:
519 return &ppir_node_to_load(node
)->src
;
520 case ppir_node_type_store
:
521 return &ppir_node_to_store(node
)->src
;
529 static inline ppir_reg
*ppir_src_get_reg(ppir_src
*src
)
532 case ppir_target_ssa
:
534 case ppir_target_register
:
541 static inline ppir_reg
*ppir_dest_get_reg(ppir_dest
*dest
)
543 switch (dest
->type
) {
544 case ppir_target_ssa
:
546 case ppir_target_register
:
553 static inline ppir_src
*ppir_node_get_src_for_pred(ppir_node
*node
, ppir_node
*pred
)
555 for (int i
= 0; i
< ppir_node_get_src_num(node
); i
++) {
556 ppir_src
*src
= ppir_node_get_src(node
, i
);
557 if (src
&& src
->node
== pred
)
564 static inline void ppir_node_target_assign(ppir_src
*src
, ppir_node
*node
)
566 ppir_dest
*dest
= ppir_node_get_dest(node
);
567 src
->type
= dest
->type
;
569 case ppir_target_ssa
:
570 src
->ssa
= &dest
->ssa
;
573 case ppir_target_register
:
574 src
->reg
= dest
->reg
;
575 /* Registers can be assigned from multiple nodes, so don't keep
576 * pointer to the node here
580 case ppir_target_pipeline
:
581 src
->pipeline
= dest
->pipeline
;
587 static inline bool ppir_node_target_equal(ppir_src
*src
, ppir_dest
*dest
)
589 if (src
->type
!= dest
->type
||
590 (src
->type
== ppir_target_ssa
&& src
->ssa
!= &dest
->ssa
) ||
591 (src
->type
== ppir_target_register
&& src
->reg
!= dest
->reg
) ||
592 (src
->type
== ppir_target_pipeline
&& src
->pipeline
!= dest
->pipeline
))
598 static inline int ppir_target_get_src_reg_index(ppir_src
*src
)
601 case ppir_target_ssa
:
603 return src
->ssa
->index
;
605 case ppir_target_register
:
607 return src
->reg
->index
;
609 case ppir_target_pipeline
:
610 if (src
->pipeline
== ppir_pipeline_reg_discard
)
612 return (src
->pipeline
+ 12) * 4;
618 static inline int ppir_target_get_dest_reg_index(ppir_dest
*dest
)
620 switch (dest
->type
) {
621 case ppir_target_ssa
:
622 return dest
->ssa
.index
;
623 case ppir_target_register
:
624 return dest
->reg
->index
;
625 case ppir_target_pipeline
:
626 if (dest
->pipeline
== ppir_pipeline_reg_discard
)
628 return (dest
->pipeline
+ 12) * 4;
634 static inline int ppir_src_get_mask(ppir_src
*src
)
636 ppir_reg
*reg
= ppir_src_get_reg(src
);
639 for (int i
= 0; i
< reg
->num_components
; i
++)
640 mask
|= (1 << src
->swizzle
[i
]);
645 static inline bool ppir_target_is_scaler(ppir_dest
*dest
)
647 switch (dest
->type
) {
648 case ppir_target_ssa
:
649 return dest
->ssa
.num_components
== 1;
650 case ppir_target_register
:
651 /* only one bit in mask is set */
652 if ((dest
->write_mask
& 0x3) == 0x3 ||
653 (dest
->write_mask
& 0x5) == 0x5 ||
654 (dest
->write_mask
& 0x9) == 0x9 ||
655 (dest
->write_mask
& 0x6) == 0x6 ||
656 (dest
->write_mask
& 0xa) == 0xa ||
657 (dest
->write_mask
& 0xc) == 0xc)
661 case ppir_target_pipeline
:
662 if (dest
->pipeline
== ppir_pipeline_reg_fmul
)
671 ppir_instr
*ppir_instr_create(ppir_block
*block
);
672 bool ppir_instr_insert_node(ppir_instr
*instr
, ppir_node
*node
);
673 void ppir_instr_add_dep(ppir_instr
*succ
, ppir_instr
*pred
);
674 void ppir_instr_print_list(ppir_compiler
*comp
);
675 void ppir_instr_print_dep(ppir_compiler
*comp
);
676 void ppir_instr_insert_mul_node(ppir_node
*add
, ppir_node
*mul
);
678 #define ppir_instr_foreach_succ(instr, dep) \
679 list_for_each_entry(ppir_dep, dep, &instr->succ_list, succ_link)
680 #define ppir_instr_foreach_succ_safe(instr, dep) \
681 list_for_each_entry_safe(ppir_dep, dep, &instr->succ_list, succ_link)
682 #define ppir_instr_foreach_pred(instr, dep) \
683 list_for_each_entry(ppir_dep, dep, &instr->pred_list, pred_link)
684 #define ppir_instr_foreach_pred_safe(instr, dep) \
685 list_for_each_entry_safe(ppir_dep, dep, &instr->pred_list, pred_link)
687 static inline bool ppir_instr_is_root(ppir_instr
*instr
)
689 return list_is_empty(&instr
->succ_list
);
692 static inline bool ppir_instr_is_leaf(ppir_instr
*instr
)
694 return list_is_empty(&instr
->pred_list
);
697 bool ppir_lower_prog(ppir_compiler
*comp
);
698 bool ppir_node_to_instr(ppir_compiler
*comp
);
699 bool ppir_schedule_prog(ppir_compiler
*comp
);
700 bool ppir_regalloc_prog(ppir_compiler
*comp
);
701 bool ppir_codegen_prog(ppir_compiler
*comp
);
702 void ppir_liveness_analysis(ppir_compiler
*comp
);