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"
31 #include "ir/lima_ir.h"
100 ppir_op_load_varying
,
102 ppir_op_load_fragcoord
,
103 ppir_op_load_pointcoord
,
104 ppir_op_load_frontface
,
105 ppir_op_load_texture
,
123 ppir_node_type_const
,
125 ppir_node_type_store
,
126 ppir_node_type_load_texture
,
127 ppir_node_type_discard
,
128 ppir_node_type_branch
,
137 extern const ppir_op_info ppir_op_infos
[];
141 struct list_head pred_link
;
142 struct list_head succ_link
;
145 typedef struct ppir_node
{
146 struct list_head list
;
152 struct ppir_instr
*instr
;
154 struct ppir_block
*block
;
157 struct list_head succ_list
;
158 struct list_head pred_list
;
162 ppir_pipeline_reg_const0
,
163 ppir_pipeline_reg_const1
,
164 ppir_pipeline_reg_sampler
,
165 ppir_pipeline_reg_uniform
,
166 ppir_pipeline_reg_vmul
,
167 ppir_pipeline_reg_fmul
,
168 ppir_pipeline_reg_discard
, /* varying load */
171 typedef struct ppir_reg
{
172 struct list_head list
;
176 /* whether this reg has to start from the x component
177 * of a full physical reg, this is true for reg used
178 * in load/store instr which has no swizzle field
181 /* instr live range */
182 int live_in
, live_out
;
188 ppir_target_pipeline
,
189 ppir_target_register
,
192 typedef struct ppir_src
{
199 ppir_pipeline pipeline
;
203 bool absolute
, negate
;
208 ppir_outmod_clamp_fraction
,
209 ppir_outmod_clamp_positive
,
213 typedef struct ppir_dest
{
219 ppir_pipeline pipeline
;
222 ppir_outmod modifier
;
223 unsigned write_mask
: 4;
231 int shift
: 3; /* Only used for ppir_op_mul */
234 typedef struct ppir_const
{
264 ppir_src src_coords
; /* not to be used after lowering */
267 } ppir_load_texture_node
;
273 enum ppir_instr_slot
{
274 PPIR_INSTR_SLOT_VARYING
,
275 PPIR_INSTR_SLOT_TEXLD
,
276 PPIR_INSTR_SLOT_UNIFORM
,
277 PPIR_INSTR_SLOT_ALU_VEC_MUL
,
278 PPIR_INSTR_SLOT_ALU_SCL_MUL
,
279 PPIR_INSTR_SLOT_ALU_VEC_ADD
,
280 PPIR_INSTR_SLOT_ALU_SCL_ADD
,
281 PPIR_INSTR_SLOT_ALU_COMBINE
,
282 PPIR_INSTR_SLOT_STORE_TEMP
,
283 PPIR_INSTR_SLOT_BRANCH
,
286 PPIR_INSTR_SLOT_ALU_START
= PPIR_INSTR_SLOT_ALU_VEC_MUL
,
287 PPIR_INSTR_SLOT_ALU_END
= PPIR_INSTR_SLOT_ALU_COMBINE
,
290 typedef struct ppir_instr
{
291 struct list_head list
;
294 int seq
; /* command sequence after schedule */
296 ppir_node
*slots
[PPIR_INSTR_SLOT_NUM
];
297 ppir_const constant
[2];
301 struct list_head succ_list
;
302 struct list_head pred_list
;
304 int est
; /* earliest start time */
311 typedef struct ppir_block
{
312 struct list_head list
;
313 struct list_head node_list
;
314 struct list_head instr_list
;
316 struct ppir_block
*successors
[2];
318 struct ppir_compiler
*comp
;
321 int sched_instr_index
;
322 int sched_instr_base
;
325 /* for liveness analysis */
328 BITSET_WORD
*live_in
;
329 BITSET_WORD
*live_out
;
344 struct lima_fs_shader_state
;
346 typedef struct ppir_compiler
{
347 struct list_head block_list
;
348 struct hash_table_u64
*blocks
;
352 struct list_head reg_list
;
354 /* array for searching ssa/reg node */
355 ppir_node
**var_nodes
;
359 struct lima_fs_shader_state
*prog
;
362 int sched_instr_base
;
364 /* for regalloc spilling debug */
372 ppir_block
*discard_block
;
373 ppir_block
*current_block
;
374 ppir_block
*loop_break_block
;
375 ppir_block
*loop_cont_block
;
378 void *ppir_node_create(ppir_block
*block
, ppir_op op
, int index
, unsigned mask
);
379 void ppir_node_add_dep(ppir_node
*succ
, ppir_node
*pred
);
380 void ppir_node_remove_dep(ppir_dep
*dep
);
381 void ppir_node_delete(ppir_node
*node
);
382 void ppir_node_print_prog(ppir_compiler
*comp
);
383 void ppir_node_replace_child(ppir_node
*parent
, ppir_node
*old_child
, ppir_node
*new_child
);
384 void ppir_node_replace_all_succ(ppir_node
*dst
, ppir_node
*src
);
385 void ppir_node_replace_pred(ppir_dep
*dep
, ppir_node
*new_pred
);
386 ppir_dep
*ppir_dep_for_pred(ppir_node
*node
, ppir_node
*pred
);
387 ppir_node
*ppir_node_clone(ppir_block
*block
, ppir_node
*node
);
388 /* Assumes that node successors are in the same block */
389 ppir_node
*ppir_node_insert_mov(ppir_node
*node
);
391 static inline bool ppir_node_is_root(ppir_node
*node
)
393 return list_empty(&node
->succ_list
);
396 static inline bool ppir_node_is_leaf(ppir_node
*node
)
398 return list_empty(&node
->pred_list
);
401 static inline bool ppir_node_has_single_succ(ppir_node
*node
)
403 return list_is_singular(&node
->succ_list
);
406 static inline ppir_node
*ppir_node_first_succ(ppir_node
*node
)
408 return list_first_entry(&node
->succ_list
, ppir_dep
, succ_link
)->succ
;
411 static inline bool ppir_node_has_single_pred(ppir_node
*node
)
413 return list_is_singular(&node
->pred_list
);
416 static inline ppir_node
*ppir_node_first_pred(ppir_node
*node
)
418 return list_first_entry(&node
->pred_list
, ppir_dep
, pred_link
)->pred
;
421 #define ppir_node_foreach_succ(node, dep) \
422 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
423 #define ppir_node_foreach_succ_safe(node, dep) \
424 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
425 #define ppir_node_foreach_pred(node, dep) \
426 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
427 #define ppir_node_foreach_pred_safe(node, dep) \
428 list_for_each_entry_safe(ppir_dep, dep, &node->pred_list, pred_link)
430 #define ppir_node_to_alu(node) ((ppir_alu_node *)(node))
431 #define ppir_node_to_const(node) ((ppir_const_node *)(node))
432 #define ppir_node_to_load(node) ((ppir_load_node *)(node))
433 #define ppir_node_to_store(node) ((ppir_store_node *)(node))
434 #define ppir_node_to_load_texture(node) ((ppir_load_texture_node *)(node))
435 #define ppir_node_to_discard(node) ((ppir_discard_node *)(node))
436 #define ppir_node_to_branch(node) ((ppir_branch_node *)(node))
438 static inline ppir_dest
*ppir_node_get_dest(ppir_node
*node
)
440 switch (node
->type
) {
441 case ppir_node_type_alu
:
442 return &ppir_node_to_alu(node
)->dest
;
443 case ppir_node_type_load
:
444 return &ppir_node_to_load(node
)->dest
;
445 case ppir_node_type_const
:
446 return &ppir_node_to_const(node
)->dest
;
447 case ppir_node_type_load_texture
:
448 return &ppir_node_to_load_texture(node
)->dest
;
454 static inline int ppir_node_get_src_num(ppir_node
*node
)
456 switch (node
->type
) {
457 case ppir_node_type_alu
:
458 return ppir_node_to_alu(node
)->num_src
;
459 case ppir_node_type_branch
:
460 return ppir_node_to_branch(node
)->num_src
;
461 case ppir_node_type_load
:
462 return ppir_node_to_load(node
)->num_src
;
463 case ppir_node_type_load_texture
:
464 case ppir_node_type_store
:
473 static inline ppir_src
*ppir_node_get_src(ppir_node
*node
, int idx
)
475 if (idx
< 0 || idx
>= ppir_node_get_src_num(node
))
478 switch (node
->type
) {
479 case ppir_node_type_alu
:
480 return &ppir_node_to_alu(node
)->src
[idx
];
481 case ppir_node_type_branch
:
482 return &ppir_node_to_branch(node
)->src
[idx
];
483 case ppir_node_type_load_texture
:
484 return &ppir_node_to_load_texture(node
)->src_coords
;
485 case ppir_node_type_load
:
486 return &ppir_node_to_load(node
)->src
;
487 case ppir_node_type_store
:
488 return &ppir_node_to_store(node
)->src
;
496 static inline ppir_reg
*ppir_src_get_reg(ppir_src
*src
)
499 case ppir_target_ssa
:
501 case ppir_target_register
:
508 static inline ppir_reg
*ppir_dest_get_reg(ppir_dest
*dest
)
510 switch (dest
->type
) {
511 case ppir_target_ssa
:
513 case ppir_target_register
:
520 static inline ppir_src
*ppir_node_get_src_for_pred(ppir_node
*node
, ppir_node
*pred
)
522 for (int i
= 0; i
< ppir_node_get_src_num(node
); i
++) {
523 ppir_src
*src
= ppir_node_get_src(node
, i
);
524 if (src
&& src
->node
== pred
)
531 static inline void ppir_node_target_assign(ppir_src
*src
, ppir_node
*node
)
533 ppir_dest
*dest
= ppir_node_get_dest(node
);
534 src
->type
= dest
->type
;
536 case ppir_target_ssa
:
537 src
->ssa
= &dest
->ssa
;
540 case ppir_target_register
:
541 src
->reg
= dest
->reg
;
542 /* Registers can be assigned from multiple nodes, so don't keep
543 * pointer to the node here
547 case ppir_target_pipeline
:
548 src
->pipeline
= dest
->pipeline
;
554 static inline bool ppir_node_target_equal(ppir_src
*src
, ppir_dest
*dest
)
556 if (src
->type
!= dest
->type
||
557 (src
->type
== ppir_target_ssa
&& src
->ssa
!= &dest
->ssa
) ||
558 (src
->type
== ppir_target_register
&& src
->reg
!= dest
->reg
) ||
559 (src
->type
== ppir_target_pipeline
&& src
->pipeline
!= dest
->pipeline
))
565 static inline int ppir_target_get_src_reg_index(ppir_src
*src
)
568 case ppir_target_ssa
:
570 return src
->ssa
->index
;
572 case ppir_target_register
:
574 return src
->reg
->index
;
576 case ppir_target_pipeline
:
577 if (src
->pipeline
== ppir_pipeline_reg_discard
)
579 return (src
->pipeline
+ 12) * 4;
585 static inline int ppir_target_get_dest_reg_index(ppir_dest
*dest
)
587 switch (dest
->type
) {
588 case ppir_target_ssa
:
589 return dest
->ssa
.index
;
590 case ppir_target_register
:
591 return dest
->reg
->index
;
592 case ppir_target_pipeline
:
593 if (dest
->pipeline
== ppir_pipeline_reg_discard
)
595 return (dest
->pipeline
+ 12) * 4;
601 static inline bool ppir_target_is_scaler(ppir_dest
*dest
)
603 switch (dest
->type
) {
604 case ppir_target_ssa
:
605 return dest
->ssa
.num_components
== 1;
606 case ppir_target_register
:
607 /* only one bit in mask is set */
608 if ((dest
->write_mask
& 0x3) == 0x3 ||
609 (dest
->write_mask
& 0x5) == 0x5 ||
610 (dest
->write_mask
& 0x9) == 0x9 ||
611 (dest
->write_mask
& 0x6) == 0x6 ||
612 (dest
->write_mask
& 0xa) == 0xa ||
613 (dest
->write_mask
& 0xc) == 0xc)
617 case ppir_target_pipeline
:
618 if (dest
->pipeline
== ppir_pipeline_reg_fmul
)
627 ppir_instr
*ppir_instr_create(ppir_block
*block
);
628 bool ppir_instr_insert_node(ppir_instr
*instr
, ppir_node
*node
);
629 void ppir_instr_add_dep(ppir_instr
*succ
, ppir_instr
*pred
);
630 void ppir_instr_print_list(ppir_compiler
*comp
);
631 void ppir_instr_print_dep(ppir_compiler
*comp
);
632 void ppir_instr_insert_mul_node(ppir_node
*add
, ppir_node
*mul
);
634 #define ppir_instr_foreach_succ(instr, dep) \
635 list_for_each_entry(ppir_dep, dep, &instr->succ_list, succ_link)
636 #define ppir_instr_foreach_succ_safe(instr, dep) \
637 list_for_each_entry_safe(ppir_dep, dep, &instr->succ_list, succ_link)
638 #define ppir_instr_foreach_pred(instr, dep) \
639 list_for_each_entry(ppir_dep, dep, &instr->pred_list, pred_link)
640 #define ppir_instr_foreach_pred_safe(instr, dep) \
641 list_for_each_entry_safe(ppir_dep, dep, &instr->pred_list, pred_link)
643 static inline bool ppir_instr_is_root(ppir_instr
*instr
)
645 return list_empty(&instr
->succ_list
);
648 static inline bool ppir_instr_is_leaf(ppir_instr
*instr
)
650 return list_empty(&instr
->pred_list
);
653 bool ppir_lower_prog(ppir_compiler
*comp
);
654 bool ppir_node_to_instr(ppir_compiler
*comp
);
655 bool ppir_schedule_prog(ppir_compiler
*comp
);
656 bool ppir_regalloc_prog(ppir_compiler
*comp
);
657 bool ppir_codegen_prog(ppir_compiler
*comp
);
658 void ppir_liveness_analysis(ppir_compiler
*comp
);