freedreno/ir3: drop unused instr category arg
[mesa.git] / src / gallium / drivers / freedreno / ir3 / ir3.h
1 /*
2 * Copyright (c) 2013 Rob Clark <robdclark@gmail.com>
3 *
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:
10 *
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
13 * Software.
14 *
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 FROM,
20 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 * SOFTWARE.
22 */
23
24 #ifndef IR3_H_
25 #define IR3_H_
26
27 #include <stdint.h>
28 #include <stdbool.h>
29
30 #include "util/u_debug.h"
31 #include "util/list.h"
32
33 #include "instr-a3xx.h"
34 #include "disasm.h" /* TODO move 'enum shader_t' somewhere else.. */
35
36 /* low level intermediate representation of an adreno shader program */
37
38 struct ir3_compiler;
39 struct ir3;
40 struct ir3_instruction;
41 struct ir3_block;
42
43 struct ir3_info {
44 uint32_t gpu_id;
45 uint16_t sizedwords;
46 uint16_t instrs_count; /* expanded to account for rpt's */
47 /* NOTE: max_reg, etc, does not include registers not touched
48 * by the shader (ie. vertex fetched via VFD_DECODE but not
49 * touched by shader)
50 */
51 int8_t max_reg; /* highest GPR # used by shader */
52 int8_t max_half_reg;
53 int16_t max_const;
54 };
55
56 struct ir3_register {
57 enum {
58 IR3_REG_CONST = 0x001,
59 IR3_REG_IMMED = 0x002,
60 IR3_REG_HALF = 0x004,
61 IR3_REG_RELATIV= 0x008,
62 IR3_REG_R = 0x010,
63 /* Most instructions, it seems, can do float abs/neg but not
64 * integer. The CP pass needs to know what is intended (int or
65 * float) in order to do the right thing. For this reason the
66 * abs/neg flags are split out into float and int variants. In
67 * addition, .b (bitwise) operations, the negate is actually a
68 * bitwise not, so split that out into a new flag to make it
69 * more clear.
70 */
71 IR3_REG_FNEG = 0x020,
72 IR3_REG_FABS = 0x040,
73 IR3_REG_SNEG = 0x080,
74 IR3_REG_SABS = 0x100,
75 IR3_REG_BNOT = 0x200,
76 IR3_REG_EVEN = 0x400,
77 IR3_REG_POS_INF= 0x800,
78 /* (ei) flag, end-input? Set on last bary, presumably to signal
79 * that the shader needs no more input:
80 */
81 IR3_REG_EI = 0x1000,
82 /* meta-flags, for intermediate stages of IR, ie.
83 * before register assignment is done:
84 */
85 IR3_REG_SSA = 0x2000, /* 'instr' is ptr to assigning instr */
86 IR3_REG_ARRAY = 0x4000,
87 IR3_REG_PHI_SRC= 0x8000, /* phi src, regs[0]->instr points to phi */
88
89 } flags;
90 union {
91 /* normal registers:
92 * the component is in the low two bits of the reg #, so
93 * rN.x becomes: (N << 2) | x
94 */
95 int num;
96 /* immediate: */
97 int32_t iim_val;
98 uint32_t uim_val;
99 float fim_val;
100 /* relative: */
101 struct {
102 uint16_t id;
103 int16_t offset;
104 } array;
105 };
106
107 /* For IR3_REG_SSA, src registers contain ptr back to assigning
108 * instruction.
109 *
110 * For IR3_REG_ARRAY, the pointer is back to the last dependent
111 * array access (although the net effect is the same, it points
112 * back to a previous instruction that we depend on).
113 */
114 struct ir3_instruction *instr;
115
116 union {
117 /* used for cat5 instructions, but also for internal/IR level
118 * tracking of what registers are read/written by an instruction.
119 * wrmask may be a bad name since it is used to represent both
120 * src and dst that touch multiple adjacent registers.
121 */
122 unsigned wrmask;
123 /* for relative addressing, 32bits for array size is too small,
124 * but otoh we don't need to deal with disjoint sets, so instead
125 * use a simple size field (number of scalar components).
126 */
127 unsigned size;
128 };
129 };
130
131 struct ir3_instruction {
132 struct ir3_block *block;
133 opc_t opc;
134 enum {
135 /* (sy) flag is set on first instruction, and after sample
136 * instructions (probably just on RAW hazard).
137 */
138 IR3_INSTR_SY = 0x001,
139 /* (ss) flag is set on first instruction, and first instruction
140 * to depend on the result of "long" instructions (RAW hazard):
141 *
142 * rcp, rsq, log2, exp2, sin, cos, sqrt
143 *
144 * It seems to synchronize until all in-flight instructions are
145 * completed, for example:
146 *
147 * rsq hr1.w, hr1.w
148 * add.f hr2.z, (neg)hr2.z, hc0.y
149 * mul.f hr2.w, (neg)hr2.y, (neg)hr2.y
150 * rsq hr2.x, hr2.x
151 * (rpt1)nop
152 * mad.f16 hr2.w, hr2.z, hr2.z, hr2.w
153 * nop
154 * mad.f16 hr2.w, (neg)hr0.w, (neg)hr0.w, hr2.w
155 * (ss)(rpt2)mul.f hr1.x, (r)hr1.x, hr1.w
156 * (rpt2)mul.f hr0.x, (neg)(r)hr0.x, hr2.x
157 *
158 * The last mul.f does not have (ss) set, presumably because the
159 * (ss) on the previous instruction does the job.
160 *
161 * The blob driver also seems to set it on WAR hazards, although
162 * not really clear if this is needed or just blob compiler being
163 * sloppy. So far I haven't found a case where removing the (ss)
164 * causes problems for WAR hazard, but I could just be getting
165 * lucky:
166 *
167 * rcp r1.y, r3.y
168 * (ss)(rpt2)mad.f32 r3.y, (r)c9.x, r1.x, (r)r3.z
169 *
170 */
171 IR3_INSTR_SS = 0x002,
172 /* (jp) flag is set on jump targets:
173 */
174 IR3_INSTR_JP = 0x004,
175 IR3_INSTR_UL = 0x008,
176 IR3_INSTR_3D = 0x010,
177 IR3_INSTR_A = 0x020,
178 IR3_INSTR_O = 0x040,
179 IR3_INSTR_P = 0x080,
180 IR3_INSTR_S = 0x100,
181 IR3_INSTR_S2EN = 0x200,
182 IR3_INSTR_G = 0x400,
183 /* meta-flags, for intermediate stages of IR, ie.
184 * before register assignment is done:
185 */
186 IR3_INSTR_MARK = 0x1000,
187 IR3_INSTR_UNUSED= 0x2000,
188 } flags;
189 int repeat;
190 #ifdef DEBUG
191 unsigned regs_max;
192 #endif
193 unsigned regs_count;
194 struct ir3_register **regs;
195 union {
196 struct {
197 char inv;
198 char comp;
199 int immed;
200 struct ir3_block *target;
201 } cat0;
202 struct {
203 type_t src_type, dst_type;
204 } cat1;
205 struct {
206 enum {
207 IR3_COND_LT = 0,
208 IR3_COND_LE = 1,
209 IR3_COND_GT = 2,
210 IR3_COND_GE = 3,
211 IR3_COND_EQ = 4,
212 IR3_COND_NE = 5,
213 } condition;
214 } cat2;
215 struct {
216 unsigned samp, tex;
217 type_t type;
218 } cat5;
219 struct {
220 type_t type;
221 int src_offset;
222 int dst_offset;
223 int iim_val;
224 } cat6;
225 /* for meta-instructions, just used to hold extra data
226 * before instruction scheduling, etc
227 */
228 struct {
229 int off; /* component/offset */
230 } fo;
231 struct {
232 /* used to temporarily hold reference to nir_phi_instr
233 * until we resolve the phi srcs
234 */
235 void *nphi;
236 } phi;
237 struct {
238 struct ir3_block *block;
239 } inout;
240 };
241
242 /* transient values used during various algorithms: */
243 union {
244 /* The instruction depth is the max dependency distance to output.
245 *
246 * You can also think of it as the "cost", if we did any sort of
247 * optimization for register footprint. Ie. a value that is just
248 * result of moving a const to a reg would have a low cost, so to
249 * it could make sense to duplicate the instruction at various
250 * points where the result is needed to reduce register footprint.
251 */
252 unsigned depth;
253 /* When we get to the RA stage, we no longer need depth, but
254 * we do need instruction's position/name:
255 */
256 struct {
257 uint16_t ip;
258 uint16_t name;
259 };
260 };
261
262 /* used for per-pass extra instruction data.
263 */
264 void *data;
265
266 /* Used during CP and RA stages. For fanin and shader inputs/
267 * outputs where we need a sequence of consecutive registers,
268 * keep track of each src instructions left (ie 'n-1') and right
269 * (ie 'n+1') neighbor. The front-end must insert enough mov's
270 * to ensure that each instruction has at most one left and at
271 * most one right neighbor. During the copy-propagation pass,
272 * we only remove mov's when we can preserve this constraint.
273 * And during the RA stage, we use the neighbor information to
274 * allocate a block of registers in one shot.
275 *
276 * TODO: maybe just add something like:
277 * struct ir3_instruction_ref {
278 * struct ir3_instruction *instr;
279 * unsigned cnt;
280 * }
281 *
282 * Or can we get away without the refcnt stuff? It seems like
283 * it should be overkill.. the problem is if, potentially after
284 * already eliminating some mov's, if you have a single mov that
285 * needs to be grouped with it's neighbors in two different
286 * places (ex. shader output and a fanin).
287 */
288 struct {
289 struct ir3_instruction *left, *right;
290 uint16_t left_cnt, right_cnt;
291 } cp;
292
293 /* an instruction can reference at most one address register amongst
294 * it's src/dst registers. Beyond that, you need to insert mov's.
295 *
296 * NOTE: do not write this directly, use ir3_instr_set_address()
297 */
298 struct ir3_instruction *address;
299
300 /* Entry in ir3_block's instruction list: */
301 struct list_head node;
302
303 #ifdef DEBUG
304 uint32_t serialno;
305 #endif
306 };
307
308 static inline struct ir3_instruction *
309 ir3_neighbor_first(struct ir3_instruction *instr)
310 {
311 while (instr->cp.left)
312 instr = instr->cp.left;
313 return instr;
314 }
315
316 static inline int ir3_neighbor_count(struct ir3_instruction *instr)
317 {
318 int num = 1;
319
320 debug_assert(!instr->cp.left);
321
322 while (instr->cp.right) {
323 num++;
324 instr = instr->cp.right;
325 }
326
327 return num;
328 }
329
330 struct ir3_heap_chunk;
331
332 struct ir3 {
333 struct ir3_compiler *compiler;
334
335 unsigned ninputs, noutputs;
336 struct ir3_instruction **inputs;
337 struct ir3_instruction **outputs;
338
339 /* Track bary.f (and ldlv) instructions.. this is needed in
340 * scheduling to ensure that all varying fetches happen before
341 * any potential kill instructions. The hw gets grumpy if all
342 * threads in a group are killed before the last bary.f gets
343 * a chance to signal end of input (ei).
344 */
345 unsigned baryfs_count, baryfs_sz;
346 struct ir3_instruction **baryfs;
347
348 /* Track all indirect instructions (read and write). To avoid
349 * deadlock scenario where an address register gets scheduled,
350 * but other dependent src instructions cannot be scheduled due
351 * to dependency on a *different* address register value, the
352 * scheduler needs to ensure that all dependencies other than
353 * the instruction other than the address register are scheduled
354 * before the one that writes the address register. Having a
355 * convenient list of instructions that reference some address
356 * register simplifies this.
357 */
358 unsigned indirects_count, indirects_sz;
359 struct ir3_instruction **indirects;
360 /* and same for instructions that consume predicate register: */
361 unsigned predicates_count, predicates_sz;
362 struct ir3_instruction **predicates;
363
364 /* Track instructions which do not write a register but other-
365 * wise must not be discarded (such as kill, stg, etc)
366 */
367 unsigned keeps_count, keeps_sz;
368 struct ir3_instruction **keeps;
369
370 /* List of blocks: */
371 struct list_head block_list;
372
373 /* List of ir3_array's: */
374 struct list_head array_list;
375
376 unsigned heap_idx;
377 struct ir3_heap_chunk *chunk;
378 };
379
380 typedef struct nir_variable nir_variable;
381
382 struct ir3_array {
383 struct list_head node;
384 unsigned length;
385 unsigned id;
386
387 nir_variable *var;
388
389 /* We track the last write and last access (read or write) to
390 * setup dependencies on instructions that read or write the
391 * array. Reads can be re-ordered wrt. other reads, but should
392 * not be re-ordered wrt. to writes. Writes cannot be reordered
393 * wrt. any other access to the array.
394 *
395 * So array reads depend on last write, and array writes depend
396 * on the last access.
397 */
398 struct ir3_instruction *last_write, *last_access;
399
400 /* extra stuff used in RA pass: */
401 unsigned base; /* base vreg name */
402 unsigned reg; /* base physical reg */
403 uint16_t start_ip, end_ip;
404 };
405
406 struct ir3_array * ir3_lookup_array(struct ir3 *ir, unsigned id);
407
408 typedef struct nir_block nir_block;
409
410 struct ir3_block {
411 struct list_head node;
412 struct ir3 *shader;
413
414 nir_block *nblock;
415
416 struct list_head instr_list; /* list of ir3_instruction */
417
418 /* each block has either one or two successors.. in case of
419 * two successors, 'condition' decides which one to follow.
420 * A block preceding an if/else has two successors.
421 */
422 struct ir3_instruction *condition;
423 struct ir3_block *successors[2];
424
425 uint16_t start_ip, end_ip;
426
427 /* used for per-pass extra block data. Mainly used right
428 * now in RA step to track livein/liveout.
429 */
430 void *data;
431
432 #ifdef DEBUG
433 uint32_t serialno;
434 #endif
435 };
436
437 struct ir3 * ir3_create(struct ir3_compiler *compiler,
438 unsigned nin, unsigned nout);
439 void ir3_destroy(struct ir3 *shader);
440 void * ir3_assemble(struct ir3 *shader,
441 struct ir3_info *info, uint32_t gpu_id);
442 void * ir3_alloc(struct ir3 *shader, int sz);
443
444 struct ir3_block * ir3_block_create(struct ir3 *shader);
445
446 struct ir3_instruction * ir3_instr_create(struct ir3_block *block, opc_t opc);
447 struct ir3_instruction * ir3_instr_create2(struct ir3_block *block,
448 opc_t opc, int nreg);
449 struct ir3_instruction * ir3_instr_clone(struct ir3_instruction *instr);
450 const char *ir3_instr_name(struct ir3_instruction *instr);
451
452 struct ir3_register * ir3_reg_create(struct ir3_instruction *instr,
453 int num, int flags);
454 struct ir3_register * ir3_reg_clone(struct ir3 *shader,
455 struct ir3_register *reg);
456
457 void ir3_instr_set_address(struct ir3_instruction *instr,
458 struct ir3_instruction *addr);
459
460 static inline bool ir3_instr_check_mark(struct ir3_instruction *instr)
461 {
462 if (instr->flags & IR3_INSTR_MARK)
463 return true; /* already visited */
464 instr->flags |= IR3_INSTR_MARK;
465 return false;
466 }
467
468 void ir3_block_clear_mark(struct ir3_block *block);
469 void ir3_clear_mark(struct ir3 *shader);
470
471 unsigned ir3_count_instructions(struct ir3 *ir);
472
473 static inline int ir3_instr_regno(struct ir3_instruction *instr,
474 struct ir3_register *reg)
475 {
476 unsigned i;
477 for (i = 0; i < instr->regs_count; i++)
478 if (reg == instr->regs[i])
479 return i;
480 return -1;
481 }
482
483
484 #define MAX_ARRAYS 16
485
486 /* comp:
487 * 0 - x
488 * 1 - y
489 * 2 - z
490 * 3 - w
491 */
492 static inline uint32_t regid(int num, int comp)
493 {
494 return (num << 2) | (comp & 0x3);
495 }
496
497 static inline uint32_t reg_num(struct ir3_register *reg)
498 {
499 return reg->num >> 2;
500 }
501
502 static inline uint32_t reg_comp(struct ir3_register *reg)
503 {
504 return reg->num & 0x3;
505 }
506
507 static inline bool is_flow(struct ir3_instruction *instr)
508 {
509 return (opc_cat(instr->opc) == 0);
510 }
511
512 static inline bool is_kill(struct ir3_instruction *instr)
513 {
514 return instr->opc == OPC_KILL;
515 }
516
517 static inline bool is_nop(struct ir3_instruction *instr)
518 {
519 return instr->opc == OPC_NOP;
520 }
521
522 /* Is it a non-transformative (ie. not type changing) mov? This can
523 * also include absneg.s/absneg.f, which for the most part can be
524 * treated as a mov (single src argument).
525 */
526 static inline bool is_same_type_mov(struct ir3_instruction *instr)
527 {
528 struct ir3_register *dst = instr->regs[0];
529
530 /* mov's that write to a0.x or p0.x are special: */
531 if (dst->num == regid(REG_P0, 0))
532 return false;
533 if (dst->num == regid(REG_A0, 0))
534 return false;
535
536 if (dst->flags & (IR3_REG_RELATIV | IR3_REG_ARRAY))
537 return false;
538
539 switch (instr->opc) {
540 case OPC_MOV:
541 return instr->cat1.src_type == instr->cat1.dst_type;
542 case OPC_ABSNEG_F:
543 case OPC_ABSNEG_S:
544 return true;
545 default:
546 return false;
547 }
548 }
549
550 static inline bool is_alu(struct ir3_instruction *instr)
551 {
552 return (1 <= opc_cat(instr->opc)) && (opc_cat(instr->opc) <= 3);
553 }
554
555 static inline bool is_sfu(struct ir3_instruction *instr)
556 {
557 return (opc_cat(instr->opc) == 4);
558 }
559
560 static inline bool is_tex(struct ir3_instruction *instr)
561 {
562 return (opc_cat(instr->opc) == 5);
563 }
564
565 static inline bool is_mem(struct ir3_instruction *instr)
566 {
567 return (opc_cat(instr->opc) == 6);
568 }
569
570 static inline bool
571 is_store(struct ir3_instruction *instr)
572 {
573 /* these instructions, the "destination" register is
574 * actually a source, the address to store to.
575 */
576 switch (instr->opc) {
577 case OPC_STG:
578 case OPC_STP:
579 case OPC_STL:
580 case OPC_STLW:
581 case OPC_L2G:
582 case OPC_G2L:
583 return true;
584 default:
585 return false;
586 }
587 }
588
589 static inline bool is_load(struct ir3_instruction *instr)
590 {
591 switch (instr->opc) {
592 case OPC_LDG:
593 case OPC_LDL:
594 case OPC_LDP:
595 case OPC_L2G:
596 case OPC_LDLW:
597 case OPC_LDC_4:
598 case OPC_LDLV:
599 /* probably some others too.. */
600 return true;
601 default:
602 return false;
603 }
604 }
605
606 static inline bool is_input(struct ir3_instruction *instr)
607 {
608 /* in some cases, ldlv is used to fetch varying without
609 * interpolation.. fortunately inloc is the first src
610 * register in either case
611 */
612 switch (instr->opc) {
613 case OPC_LDLV:
614 case OPC_BARY_F:
615 return true;
616 default:
617 return false;
618 }
619 }
620
621 static inline bool is_meta(struct ir3_instruction *instr)
622 {
623 /* TODO how should we count PHI (and maybe fan-in/out) which
624 * might actually contribute some instructions to the final
625 * result?
626 */
627 return (opc_cat(instr->opc) == -1);
628 }
629
630 static inline bool writes_addr(struct ir3_instruction *instr)
631 {
632 if (instr->regs_count > 0) {
633 struct ir3_register *dst = instr->regs[0];
634 return reg_num(dst) == REG_A0;
635 }
636 return false;
637 }
638
639 static inline bool writes_pred(struct ir3_instruction *instr)
640 {
641 if (instr->regs_count > 0) {
642 struct ir3_register *dst = instr->regs[0];
643 return reg_num(dst) == REG_P0;
644 }
645 return false;
646 }
647
648 /* returns defining instruction for reg */
649 /* TODO better name */
650 static inline struct ir3_instruction *ssa(struct ir3_register *reg)
651 {
652 if (reg->flags & (IR3_REG_SSA | IR3_REG_ARRAY)) {
653 debug_assert(!(reg->instr && (reg->instr->flags & IR3_INSTR_UNUSED)));
654 return reg->instr;
655 }
656 return NULL;
657 }
658
659 static inline bool conflicts(struct ir3_instruction *a,
660 struct ir3_instruction *b)
661 {
662 return (a && b) && (a != b);
663 }
664
665 static inline bool reg_gpr(struct ir3_register *r)
666 {
667 if (r->flags & (IR3_REG_CONST | IR3_REG_IMMED))
668 return false;
669 if ((reg_num(r) == REG_A0) || (reg_num(r) == REG_P0))
670 return false;
671 return true;
672 }
673
674 static inline type_t half_type(type_t type)
675 {
676 switch (type) {
677 case TYPE_F32: return TYPE_F16;
678 case TYPE_U32: return TYPE_U16;
679 case TYPE_S32: return TYPE_S16;
680 case TYPE_F16:
681 case TYPE_U16:
682 case TYPE_S16:
683 return type;
684 default:
685 assert(0);
686 return ~0;
687 }
688 }
689
690 /* some cat2 instructions (ie. those which are not float) can embed an
691 * immediate:
692 */
693 static inline bool ir3_cat2_int(opc_t opc)
694 {
695 switch (opc) {
696 case OPC_ADD_U:
697 case OPC_ADD_S:
698 case OPC_SUB_U:
699 case OPC_SUB_S:
700 case OPC_CMPS_U:
701 case OPC_CMPS_S:
702 case OPC_MIN_U:
703 case OPC_MIN_S:
704 case OPC_MAX_U:
705 case OPC_MAX_S:
706 case OPC_CMPV_U:
707 case OPC_CMPV_S:
708 case OPC_MUL_U:
709 case OPC_MUL_S:
710 case OPC_MULL_U:
711 case OPC_CLZ_S:
712 case OPC_ABSNEG_S:
713 case OPC_AND_B:
714 case OPC_OR_B:
715 case OPC_NOT_B:
716 case OPC_XOR_B:
717 case OPC_BFREV_B:
718 case OPC_CLZ_B:
719 case OPC_SHL_B:
720 case OPC_SHR_B:
721 case OPC_ASHR_B:
722 case OPC_MGEN_B:
723 case OPC_GETBIT_B:
724 case OPC_CBITS_B:
725 case OPC_BARY_F:
726 return true;
727
728 default:
729 return false;
730 }
731 }
732
733
734 /* map cat2 instruction to valid abs/neg flags: */
735 static inline unsigned ir3_cat2_absneg(opc_t opc)
736 {
737 switch (opc) {
738 case OPC_ADD_F:
739 case OPC_MIN_F:
740 case OPC_MAX_F:
741 case OPC_MUL_F:
742 case OPC_SIGN_F:
743 case OPC_CMPS_F:
744 case OPC_ABSNEG_F:
745 case OPC_CMPV_F:
746 case OPC_FLOOR_F:
747 case OPC_CEIL_F:
748 case OPC_RNDNE_F:
749 case OPC_RNDAZ_F:
750 case OPC_TRUNC_F:
751 case OPC_BARY_F:
752 return IR3_REG_FABS | IR3_REG_FNEG;
753
754 case OPC_ADD_U:
755 case OPC_ADD_S:
756 case OPC_SUB_U:
757 case OPC_SUB_S:
758 case OPC_CMPS_U:
759 case OPC_CMPS_S:
760 case OPC_MIN_U:
761 case OPC_MIN_S:
762 case OPC_MAX_U:
763 case OPC_MAX_S:
764 case OPC_CMPV_U:
765 case OPC_CMPV_S:
766 case OPC_MUL_U:
767 case OPC_MUL_S:
768 case OPC_MULL_U:
769 case OPC_CLZ_S:
770 return 0;
771
772 case OPC_ABSNEG_S:
773 return IR3_REG_SABS | IR3_REG_SNEG;
774
775 case OPC_AND_B:
776 case OPC_OR_B:
777 case OPC_NOT_B:
778 case OPC_XOR_B:
779 case OPC_BFREV_B:
780 case OPC_CLZ_B:
781 case OPC_SHL_B:
782 case OPC_SHR_B:
783 case OPC_ASHR_B:
784 case OPC_MGEN_B:
785 case OPC_GETBIT_B:
786 case OPC_CBITS_B:
787 return IR3_REG_BNOT;
788
789 default:
790 return 0;
791 }
792 }
793
794 /* map cat3 instructions to valid abs/neg flags: */
795 static inline unsigned ir3_cat3_absneg(opc_t opc)
796 {
797 switch (opc) {
798 case OPC_MAD_F16:
799 case OPC_MAD_F32:
800 case OPC_SEL_F16:
801 case OPC_SEL_F32:
802 return IR3_REG_FNEG;
803
804 case OPC_MAD_U16:
805 case OPC_MADSH_U16:
806 case OPC_MAD_S16:
807 case OPC_MADSH_M16:
808 case OPC_MAD_U24:
809 case OPC_MAD_S24:
810 case OPC_SEL_S16:
811 case OPC_SEL_S32:
812 case OPC_SAD_S16:
813 case OPC_SAD_S32:
814 /* neg *may* work on 3rd src.. */
815
816 case OPC_SEL_B16:
817 case OPC_SEL_B32:
818
819 default:
820 return 0;
821 }
822 }
823
824 #define array_insert(arr, val) do { \
825 if (arr ## _count == arr ## _sz) { \
826 arr ## _sz = MAX2(2 * arr ## _sz, 16); \
827 arr = realloc(arr, arr ## _sz * sizeof(arr[0])); \
828 } \
829 arr[arr ##_count++] = val; \
830 } while (0)
831
832 /* iterator for an instructions's sources (reg), also returns src #: */
833 #define foreach_src_n(__srcreg, __n, __instr) \
834 if ((__instr)->regs_count) \
835 for (unsigned __cnt = (__instr)->regs_count - 1, __n = 0; __n < __cnt; __n++) \
836 if ((__srcreg = (__instr)->regs[__n + 1]))
837
838 /* iterator for an instructions's sources (reg): */
839 #define foreach_src(__srcreg, __instr) \
840 foreach_src_n(__srcreg, __i, __instr)
841
842 static inline unsigned __ssa_src_cnt(struct ir3_instruction *instr)
843 {
844 if (instr->address)
845 return instr->regs_count + 1;
846 return instr->regs_count;
847 }
848
849 static inline struct ir3_instruction * __ssa_src_n(struct ir3_instruction *instr, unsigned n)
850 {
851 if (n == (instr->regs_count + 0))
852 return instr->address;
853 return ssa(instr->regs[n]);
854 }
855
856 #define __src_cnt(__instr) ((__instr)->address ? (__instr)->regs_count : (__instr)->regs_count - 1)
857
858 /* iterator for an instruction's SSA sources (instr), also returns src #: */
859 #define foreach_ssa_src_n(__srcinst, __n, __instr) \
860 if ((__instr)->regs_count) \
861 for (unsigned __cnt = __ssa_src_cnt(__instr), __n = 0; __n < __cnt; __n++) \
862 if ((__srcinst = __ssa_src_n(__instr, __n)))
863
864 /* iterator for an instruction's SSA sources (instr): */
865 #define foreach_ssa_src(__srcinst, __instr) \
866 foreach_ssa_src_n(__srcinst, __i, __instr)
867
868
869 /* dump: */
870 void ir3_print(struct ir3 *ir);
871 void ir3_print_instr(struct ir3_instruction *instr);
872
873 /* depth calculation: */
874 int ir3_delayslots(struct ir3_instruction *assigner,
875 struct ir3_instruction *consumer, unsigned n);
876 void ir3_insert_by_depth(struct ir3_instruction *instr, struct list_head *list);
877 void ir3_depth(struct ir3 *ir);
878
879 /* copy-propagate: */
880 void ir3_cp(struct ir3 *ir);
881
882 /* group neighbors and insert mov's to resolve conflicts: */
883 void ir3_group(struct ir3 *ir);
884
885 /* scheduling: */
886 int ir3_sched(struct ir3 *ir);
887
888 /* register assignment: */
889 struct ir3_ra_reg_set * ir3_ra_alloc_reg_set(void *memctx);
890 int ir3_ra(struct ir3 *ir3, enum shader_t type,
891 bool frag_coord, bool frag_face);
892
893 /* legalize: */
894 void ir3_legalize(struct ir3 *ir, bool *has_samp, int *max_bary);
895
896 /* ************************************************************************* */
897 /* instruction helpers */
898
899 static inline struct ir3_instruction *
900 ir3_MOV(struct ir3_block *block, struct ir3_instruction *src, type_t type)
901 {
902 struct ir3_instruction *instr = ir3_instr_create(block, OPC_MOV);
903 ir3_reg_create(instr, 0, 0); /* dst */
904 if (src->regs[0]->flags & IR3_REG_ARRAY) {
905 struct ir3_register *src_reg =
906 ir3_reg_create(instr, 0, IR3_REG_ARRAY);
907 src_reg->array = src->regs[0]->array;
908 src_reg->instr = src;
909 } else {
910 ir3_reg_create(instr, 0, IR3_REG_SSA)->instr = src;
911 }
912 debug_assert(!(src->regs[0]->flags & IR3_REG_RELATIV));
913 instr->cat1.src_type = type;
914 instr->cat1.dst_type = type;
915 return instr;
916 }
917
918 static inline struct ir3_instruction *
919 ir3_COV(struct ir3_block *block, struct ir3_instruction *src,
920 type_t src_type, type_t dst_type)
921 {
922 struct ir3_instruction *instr = ir3_instr_create(block, OPC_MOV);
923 ir3_reg_create(instr, 0, 0); /* dst */
924 ir3_reg_create(instr, 0, IR3_REG_SSA)->instr = src;
925 instr->cat1.src_type = src_type;
926 instr->cat1.dst_type = dst_type;
927 debug_assert(!(src->regs[0]->flags & IR3_REG_ARRAY));
928 return instr;
929 }
930
931 static inline struct ir3_instruction *
932 ir3_NOP(struct ir3_block *block)
933 {
934 return ir3_instr_create(block, OPC_NOP);
935 }
936
937 #define INSTR0(name) \
938 static inline struct ir3_instruction * \
939 ir3_##name(struct ir3_block *block) \
940 { \
941 struct ir3_instruction *instr = \
942 ir3_instr_create(block, OPC_##name); \
943 return instr; \
944 }
945
946 #define INSTR1(name) \
947 static inline struct ir3_instruction * \
948 ir3_##name(struct ir3_block *block, \
949 struct ir3_instruction *a, unsigned aflags) \
950 { \
951 struct ir3_instruction *instr = \
952 ir3_instr_create(block, OPC_##name); \
953 ir3_reg_create(instr, 0, 0); /* dst */ \
954 ir3_reg_create(instr, 0, IR3_REG_SSA | aflags)->instr = a; \
955 return instr; \
956 }
957
958 #define INSTR2(name) \
959 static inline struct ir3_instruction * \
960 ir3_##name(struct ir3_block *block, \
961 struct ir3_instruction *a, unsigned aflags, \
962 struct ir3_instruction *b, unsigned bflags) \
963 { \
964 struct ir3_instruction *instr = \
965 ir3_instr_create(block, OPC_##name); \
966 ir3_reg_create(instr, 0, 0); /* dst */ \
967 ir3_reg_create(instr, 0, IR3_REG_SSA | aflags)->instr = a; \
968 ir3_reg_create(instr, 0, IR3_REG_SSA | bflags)->instr = b; \
969 return instr; \
970 }
971
972 #define INSTR3(name) \
973 static inline struct ir3_instruction * \
974 ir3_##name(struct ir3_block *block, \
975 struct ir3_instruction *a, unsigned aflags, \
976 struct ir3_instruction *b, unsigned bflags, \
977 struct ir3_instruction *c, unsigned cflags) \
978 { \
979 struct ir3_instruction *instr = \
980 ir3_instr_create(block, OPC_##name); \
981 ir3_reg_create(instr, 0, 0); /* dst */ \
982 ir3_reg_create(instr, 0, IR3_REG_SSA | aflags)->instr = a; \
983 ir3_reg_create(instr, 0, IR3_REG_SSA | bflags)->instr = b; \
984 ir3_reg_create(instr, 0, IR3_REG_SSA | cflags)->instr = c; \
985 return instr; \
986 }
987
988 /* cat0 instructions: */
989 INSTR0(BR);
990 INSTR0(JUMP);
991 INSTR1(KILL);
992 INSTR0(END);
993
994 /* cat2 instructions, most 2 src but some 1 src: */
995 INSTR2(ADD_F)
996 INSTR2(MIN_F)
997 INSTR2(MAX_F)
998 INSTR2(MUL_F)
999 INSTR1(SIGN_F)
1000 INSTR2(CMPS_F)
1001 INSTR1(ABSNEG_F)
1002 INSTR2(CMPV_F)
1003 INSTR1(FLOOR_F)
1004 INSTR1(CEIL_F)
1005 INSTR1(RNDNE_F)
1006 INSTR1(RNDAZ_F)
1007 INSTR1(TRUNC_F)
1008 INSTR2(ADD_U)
1009 INSTR2(ADD_S)
1010 INSTR2(SUB_U)
1011 INSTR2(SUB_S)
1012 INSTR2(CMPS_U)
1013 INSTR2(CMPS_S)
1014 INSTR2(MIN_U)
1015 INSTR2(MIN_S)
1016 INSTR2(MAX_U)
1017 INSTR2(MAX_S)
1018 INSTR1(ABSNEG_S)
1019 INSTR2(AND_B)
1020 INSTR2(OR_B)
1021 INSTR1(NOT_B)
1022 INSTR2(XOR_B)
1023 INSTR2(CMPV_U)
1024 INSTR2(CMPV_S)
1025 INSTR2(MUL_U)
1026 INSTR2(MUL_S)
1027 INSTR2(MULL_U)
1028 INSTR1(BFREV_B)
1029 INSTR1(CLZ_S)
1030 INSTR1(CLZ_B)
1031 INSTR2(SHL_B)
1032 INSTR2(SHR_B)
1033 INSTR2(ASHR_B)
1034 INSTR2(BARY_F)
1035 INSTR2(MGEN_B)
1036 INSTR2(GETBIT_B)
1037 INSTR1(SETRM)
1038 INSTR1(CBITS_B)
1039 INSTR2(SHB)
1040 INSTR2(MSAD)
1041
1042 /* cat3 instructions: */
1043 INSTR3(MAD_U16)
1044 INSTR3(MADSH_U16)
1045 INSTR3(MAD_S16)
1046 INSTR3(MADSH_M16)
1047 INSTR3(MAD_U24)
1048 INSTR3(MAD_S24)
1049 INSTR3(MAD_F16)
1050 INSTR3(MAD_F32)
1051 INSTR3(SEL_B16)
1052 INSTR3(SEL_B32)
1053 INSTR3(SEL_S16)
1054 INSTR3(SEL_S32)
1055 INSTR3(SEL_F16)
1056 INSTR3(SEL_F32)
1057 INSTR3(SAD_S16)
1058 INSTR3(SAD_S32)
1059
1060 /* cat4 instructions: */
1061 INSTR1(RCP)
1062 INSTR1(RSQ)
1063 INSTR1(LOG2)
1064 INSTR1(EXP2)
1065 INSTR1(SIN)
1066 INSTR1(COS)
1067 INSTR1(SQRT)
1068
1069 /* cat5 instructions: */
1070 INSTR1(DSX)
1071 INSTR1(DSY)
1072
1073 static inline struct ir3_instruction *
1074 ir3_SAM(struct ir3_block *block, opc_t opc, type_t type,
1075 unsigned wrmask, unsigned flags, unsigned samp, unsigned tex,
1076 struct ir3_instruction *src0, struct ir3_instruction *src1)
1077 {
1078 struct ir3_instruction *sam;
1079 struct ir3_register *reg;
1080
1081 sam = ir3_instr_create(block, opc);
1082 sam->flags |= flags;
1083 ir3_reg_create(sam, 0, 0)->wrmask = wrmask;
1084 if (src0) {
1085 reg = ir3_reg_create(sam, 0, IR3_REG_SSA);
1086 reg->wrmask = (1 << (src0->regs_count - 1)) - 1;
1087 reg->instr = src0;
1088 }
1089 if (src1) {
1090 reg = ir3_reg_create(sam, 0, IR3_REG_SSA);
1091 reg->instr = src1;
1092 reg->wrmask = (1 << (src1->regs_count - 1)) - 1;
1093 }
1094 sam->cat5.samp = samp;
1095 sam->cat5.tex = tex;
1096 sam->cat5.type = type;
1097
1098 return sam;
1099 }
1100
1101 /* cat6 instructions: */
1102 INSTR2(LDLV)
1103 INSTR2(LDG)
1104 INSTR3(STG)
1105
1106 /* ************************************************************************* */
1107 /* split this out or find some helper to use.. like main/bitset.h.. */
1108
1109 #include <string.h>
1110
1111 #define MAX_REG 256
1112
1113 typedef uint8_t regmask_t[2 * MAX_REG / 8];
1114
1115 static inline unsigned regmask_idx(struct ir3_register *reg)
1116 {
1117 unsigned num = (reg->flags & IR3_REG_RELATIV) ? reg->array.offset : reg->num;
1118 debug_assert(num < MAX_REG);
1119 if (reg->flags & IR3_REG_HALF)
1120 num += MAX_REG;
1121 return num;
1122 }
1123
1124 static inline void regmask_init(regmask_t *regmask)
1125 {
1126 memset(regmask, 0, sizeof(*regmask));
1127 }
1128
1129 static inline void regmask_set(regmask_t *regmask, struct ir3_register *reg)
1130 {
1131 unsigned idx = regmask_idx(reg);
1132 if (reg->flags & IR3_REG_RELATIV) {
1133 unsigned i;
1134 for (i = 0; i < reg->size; i++, idx++)
1135 (*regmask)[idx / 8] |= 1 << (idx % 8);
1136 } else {
1137 unsigned mask;
1138 for (mask = reg->wrmask; mask; mask >>= 1, idx++)
1139 if (mask & 1)
1140 (*regmask)[idx / 8] |= 1 << (idx % 8);
1141 }
1142 }
1143
1144 static inline void regmask_or(regmask_t *dst, regmask_t *a, regmask_t *b)
1145 {
1146 unsigned i;
1147 for (i = 0; i < ARRAY_SIZE(*dst); i++)
1148 (*dst)[i] = (*a)[i] | (*b)[i];
1149 }
1150
1151 /* set bits in a if not set in b, conceptually:
1152 * a |= (reg & ~b)
1153 */
1154 static inline void regmask_set_if_not(regmask_t *a,
1155 struct ir3_register *reg, regmask_t *b)
1156 {
1157 unsigned idx = regmask_idx(reg);
1158 if (reg->flags & IR3_REG_RELATIV) {
1159 unsigned i;
1160 for (i = 0; i < reg->size; i++, idx++)
1161 if (!((*b)[idx / 8] & (1 << (idx % 8))))
1162 (*a)[idx / 8] |= 1 << (idx % 8);
1163 } else {
1164 unsigned mask;
1165 for (mask = reg->wrmask; mask; mask >>= 1, idx++)
1166 if (mask & 1)
1167 if (!((*b)[idx / 8] & (1 << (idx % 8))))
1168 (*a)[idx / 8] |= 1 << (idx % 8);
1169 }
1170 }
1171
1172 static inline bool regmask_get(regmask_t *regmask,
1173 struct ir3_register *reg)
1174 {
1175 unsigned idx = regmask_idx(reg);
1176 if (reg->flags & IR3_REG_RELATIV) {
1177 unsigned i;
1178 for (i = 0; i < reg->size; i++, idx++)
1179 if ((*regmask)[idx / 8] & (1 << (idx % 8)))
1180 return true;
1181 } else {
1182 unsigned mask;
1183 for (mask = reg->wrmask; mask; mask >>= 1, idx++)
1184 if (mask & 1)
1185 if ((*regmask)[idx / 8] & (1 << (idx % 8)))
1186 return true;
1187 }
1188 return false;
1189 }
1190
1191 /* ************************************************************************* */
1192
1193 #endif /* IR3_H_ */