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
;
175 /* whether this reg has to start from the x component
176 * of a full physical reg, this is true for reg used
177 * in load/store instr which has no swizzle field
180 /* instr live range */
181 int live_in
, live_out
;
187 ppir_target_pipeline
,
188 ppir_target_register
,
191 typedef struct ppir_src
{
198 ppir_pipeline pipeline
;
202 bool absolute
, negate
;
207 ppir_outmod_clamp_fraction
,
208 ppir_outmod_clamp_positive
,
212 typedef struct ppir_dest
{
218 ppir_pipeline pipeline
;
221 ppir_outmod modifier
;
222 unsigned write_mask
: 4;
230 int shift
: 3; /* Only used for ppir_op_mul */
233 typedef struct ppir_const
{
262 ppir_src src_coords
; /* not to be used after lowering */
265 } ppir_load_texture_node
;
271 enum ppir_instr_slot
{
272 PPIR_INSTR_SLOT_VARYING
,
273 PPIR_INSTR_SLOT_TEXLD
,
274 PPIR_INSTR_SLOT_UNIFORM
,
275 PPIR_INSTR_SLOT_ALU_VEC_MUL
,
276 PPIR_INSTR_SLOT_ALU_SCL_MUL
,
277 PPIR_INSTR_SLOT_ALU_VEC_ADD
,
278 PPIR_INSTR_SLOT_ALU_SCL_ADD
,
279 PPIR_INSTR_SLOT_ALU_COMBINE
,
280 PPIR_INSTR_SLOT_STORE_TEMP
,
281 PPIR_INSTR_SLOT_BRANCH
,
284 PPIR_INSTR_SLOT_ALU_START
= PPIR_INSTR_SLOT_ALU_VEC_MUL
,
285 PPIR_INSTR_SLOT_ALU_END
= PPIR_INSTR_SLOT_ALU_COMBINE
,
288 typedef struct ppir_instr
{
289 struct list_head list
;
292 int seq
; /* command sequence after schedule */
294 ppir_node
*slots
[PPIR_INSTR_SLOT_NUM
];
295 ppir_const constant
[2];
299 struct list_head succ_list
;
300 struct list_head pred_list
;
302 int est
; /* earliest start time */
309 typedef struct ppir_block
{
310 struct list_head list
;
311 struct list_head node_list
;
312 struct list_head instr_list
;
313 struct ppir_compiler
*comp
;
316 int sched_instr_index
;
317 int sched_instr_base
;
332 struct lima_fs_shader_state
;
334 typedef struct ppir_compiler
{
335 struct list_head block_list
;
339 struct list_head reg_list
;
341 /* array for searching ssa/reg node */
342 ppir_node
**var_nodes
;
346 struct lima_fs_shader_state
*prog
;
349 int sched_instr_base
;
351 /* for regalloc spilling debug */
359 ppir_block
*discard_block
;
362 void *ppir_node_create(ppir_block
*block
, ppir_op op
, int index
, unsigned mask
);
363 void ppir_node_add_dep(ppir_node
*succ
, ppir_node
*pred
);
364 void ppir_node_remove_dep(ppir_dep
*dep
);
365 void ppir_node_delete(ppir_node
*node
);
366 void ppir_node_print_prog(ppir_compiler
*comp
);
367 void ppir_node_replace_child(ppir_node
*parent
, ppir_node
*old_child
, ppir_node
*new_child
);
368 void ppir_node_replace_all_succ(ppir_node
*dst
, ppir_node
*src
);
369 void ppir_node_replace_pred(ppir_dep
*dep
, ppir_node
*new_pred
);
370 ppir_node
*ppir_node_clone(ppir_block
*block
, ppir_node
*node
);
372 static inline bool ppir_node_is_root(ppir_node
*node
)
374 return list_empty(&node
->succ_list
);
377 static inline bool ppir_node_is_leaf(ppir_node
*node
)
379 return list_empty(&node
->pred_list
);
382 static inline bool ppir_node_has_single_succ(ppir_node
*node
)
384 return list_is_singular(&node
->succ_list
);
387 static inline ppir_node
*ppir_node_first_succ(ppir_node
*node
)
389 return list_first_entry(&node
->succ_list
, ppir_dep
, succ_link
)->succ
;
392 static inline bool ppir_node_has_single_pred(ppir_node
*node
)
394 return list_is_singular(&node
->pred_list
);
397 static inline ppir_node
*ppir_node_first_pred(ppir_node
*node
)
399 return list_first_entry(&node
->pred_list
, ppir_dep
, pred_link
)->pred
;
402 #define ppir_node_foreach_succ(node, dep) \
403 list_for_each_entry(ppir_dep, dep, &node->succ_list, succ_link)
404 #define ppir_node_foreach_succ_safe(node, dep) \
405 list_for_each_entry_safe(ppir_dep, dep, &node->succ_list, succ_link)
406 #define ppir_node_foreach_pred(node, dep) \
407 list_for_each_entry(ppir_dep, dep, &node->pred_list, pred_link)
408 #define ppir_node_foreach_pred_safe(node, dep) \
409 list_for_each_entry_safe(ppir_dep, dep, &node->pred_list, pred_link)
411 #define ppir_node_to_alu(node) ((ppir_alu_node *)(node))
412 #define ppir_node_to_const(node) ((ppir_const_node *)(node))
413 #define ppir_node_to_load(node) ((ppir_load_node *)(node))
414 #define ppir_node_to_store(node) ((ppir_store_node *)(node))
415 #define ppir_node_to_load_texture(node) ((ppir_load_texture_node *)(node))
416 #define ppir_node_to_discard(node) ((ppir_discard_node *)(node))
417 #define ppir_node_to_branch(node) ((ppir_branch_node *)(node))
419 static inline ppir_dest
*ppir_node_get_dest(ppir_node
*node
)
421 switch (node
->type
) {
422 case ppir_node_type_alu
:
423 return &ppir_node_to_alu(node
)->dest
;
424 case ppir_node_type_load
:
425 return &ppir_node_to_load(node
)->dest
;
426 case ppir_node_type_const
:
427 return &ppir_node_to_const(node
)->dest
;
428 case ppir_node_type_load_texture
:
429 return &ppir_node_to_load_texture(node
)->dest
;
435 static inline int ppir_node_get_src_num(ppir_node
*node
)
437 switch (node
->type
) {
438 case ppir_node_type_alu
:
439 return ppir_node_to_alu(node
)->num_src
;
440 case ppir_node_type_branch
:
441 return ppir_node_to_branch(node
)->num_src
;
442 case ppir_node_type_load_texture
:
443 case ppir_node_type_load
:
444 case ppir_node_type_store
:
453 static inline ppir_src
*ppir_node_get_src(ppir_node
*node
, int idx
)
455 if (idx
< 0 || idx
>= ppir_node_get_src_num(node
))
458 switch (node
->type
) {
459 case ppir_node_type_alu
:
460 return &ppir_node_to_alu(node
)->src
[idx
];
461 case ppir_node_type_branch
:
462 return &ppir_node_to_branch(node
)->src
[idx
];
463 case ppir_node_type_load_texture
:
464 return &ppir_node_to_load_texture(node
)->src_coords
;
465 case ppir_node_type_load
:
466 return &ppir_node_to_load(node
)->src
;
467 case ppir_node_type_store
:
468 return &ppir_node_to_store(node
)->src
;
476 static inline ppir_src
*ppir_node_get_src_for_pred(ppir_node
*node
, ppir_node
*pred
)
478 for (int i
= 0; i
< ppir_node_get_src_num(node
); i
++) {
479 ppir_src
*src
= ppir_node_get_src(node
, i
);
480 if (src
&& src
->node
== pred
)
487 static inline void ppir_node_target_assign(ppir_src
*src
, ppir_node
*node
)
489 ppir_dest
*dest
= ppir_node_get_dest(node
);
490 src
->type
= dest
->type
;
492 case ppir_target_ssa
:
493 src
->ssa
= &dest
->ssa
;
496 case ppir_target_register
:
497 src
->reg
= dest
->reg
;
498 /* Registers can be assigned from multiple nodes, so don't keep
499 * pointer to the node here
503 case ppir_target_pipeline
:
504 src
->pipeline
= dest
->pipeline
;
510 static inline bool ppir_node_target_equal(ppir_src
*src
, ppir_dest
*dest
)
512 if (src
->type
!= dest
->type
||
513 (src
->type
== ppir_target_ssa
&& src
->ssa
!= &dest
->ssa
) ||
514 (src
->type
== ppir_target_register
&& src
->reg
!= dest
->reg
) ||
515 (src
->type
== ppir_target_pipeline
&& src
->pipeline
!= dest
->pipeline
))
521 static inline int ppir_target_get_src_reg_index(ppir_src
*src
)
524 case ppir_target_ssa
:
526 return src
->ssa
->index
;
528 case ppir_target_register
:
530 return src
->reg
->index
;
532 case ppir_target_pipeline
:
533 if (src
->pipeline
== ppir_pipeline_reg_discard
)
535 return (src
->pipeline
+ 12) * 4;
541 static inline int ppir_target_get_dest_reg_index(ppir_dest
*dest
)
543 switch (dest
->type
) {
544 case ppir_target_ssa
:
545 return dest
->ssa
.index
;
546 case ppir_target_register
:
547 return dest
->reg
->index
;
548 case ppir_target_pipeline
:
549 if (dest
->pipeline
== ppir_pipeline_reg_discard
)
551 return (dest
->pipeline
+ 12) * 4;
557 static inline bool ppir_target_is_scaler(ppir_dest
*dest
)
559 switch (dest
->type
) {
560 case ppir_target_ssa
:
561 return dest
->ssa
.num_components
== 1;
562 case ppir_target_register
:
563 /* only one bit in mask is set */
564 if ((dest
->write_mask
& 0x3) == 0x3 ||
565 (dest
->write_mask
& 0x5) == 0x5 ||
566 (dest
->write_mask
& 0x9) == 0x9 ||
567 (dest
->write_mask
& 0x6) == 0x6 ||
568 (dest
->write_mask
& 0xa) == 0xa ||
569 (dest
->write_mask
& 0xc) == 0xc)
573 case ppir_target_pipeline
:
574 if (dest
->pipeline
== ppir_pipeline_reg_fmul
)
583 ppir_instr
*ppir_instr_create(ppir_block
*block
);
584 bool ppir_instr_insert_node(ppir_instr
*instr
, ppir_node
*node
);
585 void ppir_instr_add_dep(ppir_instr
*succ
, ppir_instr
*pred
);
586 void ppir_instr_print_list(ppir_compiler
*comp
);
587 void ppir_instr_print_dep(ppir_compiler
*comp
);
588 void ppir_instr_insert_mul_node(ppir_node
*add
, ppir_node
*mul
);
590 #define ppir_instr_foreach_succ(instr, dep) \
591 list_for_each_entry(ppir_dep, dep, &instr->succ_list, succ_link)
592 #define ppir_instr_foreach_succ_safe(instr, dep) \
593 list_for_each_entry_safe(ppir_dep, dep, &instr->succ_list, succ_link)
594 #define ppir_instr_foreach_pred(instr, dep) \
595 list_for_each_entry(ppir_dep, dep, &instr->pred_list, pred_link)
596 #define ppir_instr_foreach_pred_safe(instr, dep) \
597 list_for_each_entry_safe(ppir_dep, dep, &instr->pred_list, pred_link)
599 static inline bool ppir_instr_is_root(ppir_instr
*instr
)
601 return list_empty(&instr
->succ_list
);
604 static inline bool ppir_instr_is_leaf(ppir_instr
*instr
)
606 return list_empty(&instr
->pred_list
);
609 bool ppir_lower_prog(ppir_compiler
*comp
);
610 bool ppir_node_to_instr(ppir_compiler
*comp
);
611 bool ppir_schedule_prog(ppir_compiler
*comp
);
612 bool ppir_regalloc_prog(ppir_compiler
*comp
);
613 bool ppir_codegen_prog(ppir_compiler
*comp
);