nv50/ir: Make sure that several IR objects are destroyed on takedown.
[mesa.git] / src / gallium / drivers / nv50 / codegen / nv50_ir.h
1 /*
2 * Copyright 2011 Christoph Bumiller
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 shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
18 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
19 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
20 * SOFTWARE.
21 */
22
23 #ifndef __NV50_IR_H__
24 #define __NV50_IR_H__
25
26 #include <stdio.h>
27 #include <stdlib.h>
28 #include <stdint.h>
29 #include <deque>
30 #include <list>
31 #include <vector>
32
33 #include "nv50_ir_util.h"
34 #include "nv50_ir_graph.h"
35
36 #include "nv50_ir_driver.h"
37
38 namespace nv50_ir {
39
40 enum operation
41 {
42 OP_NOP = 0,
43 OP_PHI,
44 OP_UNION, // unify a new definition and several source values
45 OP_SPLIT, // $r0d -> { $r0, $r1 } ($r0d and $r0/$r1 will be coalesced)
46 OP_MERGE, // opposite of split, e.g. combine 2 32 bit into a 64 bit value
47 OP_CONSTRAINT, // copy values into consecutive registers
48 OP_MOV,
49 OP_LOAD,
50 OP_STORE,
51 OP_ADD,
52 OP_SUB,
53 OP_MUL,
54 OP_DIV,
55 OP_MOD,
56 OP_MAD,
57 OP_FMA,
58 OP_SAD, // abs(src0 - src1) + src2
59 OP_ABS,
60 OP_NEG,
61 OP_NOT,
62 OP_AND,
63 OP_OR,
64 OP_XOR,
65 OP_SHL,
66 OP_SHR,
67 OP_MAX,
68 OP_MIN,
69 OP_SAT, // CLAMP(f32, 0.0, 1.0)
70 OP_CEIL,
71 OP_FLOOR,
72 OP_TRUNC,
73 OP_CVT,
74 OP_SET_AND, // dst = (src0 CMP src1) & src2
75 OP_SET_OR,
76 OP_SET_XOR,
77 OP_SET,
78 OP_SELP, // dst = src2 ? src0 : src1
79 OP_SLCT, // dst = (src2 CMP 0) ? src0 : src1
80 OP_RCP,
81 OP_RSQ,
82 OP_LG2,
83 OP_SIN,
84 OP_COS,
85 OP_EX2,
86 OP_EXP, // exponential (base M_E)
87 OP_LOG, // natural logarithm
88 OP_PRESIN,
89 OP_PREEX2,
90 OP_SQRT,
91 OP_POW,
92 OP_BRA,
93 OP_CALL,
94 OP_RET,
95 OP_CONT,
96 OP_BREAK,
97 OP_PRERET,
98 OP_PRECONT,
99 OP_PREBREAK,
100 OP_BRKPT, // breakpoint (not related to loops)
101 OP_JOINAT, // push control flow convergence point
102 OP_JOIN, // converge
103 OP_DISCARD,
104 OP_EXIT,
105 OP_MEMBAR,
106 OP_VFETCH, // indirection 0 in attribute space, indirection 1 is vertex base
107 OP_PFETCH, // fetch base address of vertex src0 (immediate) [+ src1]
108 OP_EXPORT,
109 OP_LINTERP,
110 OP_PINTERP,
111 OP_EMIT, // emit vertex
112 OP_RESTART, // restart primitive
113 OP_TEX,
114 OP_TXB, // texture bias
115 OP_TXL, // texure lod
116 OP_TXF, // texel fetch
117 OP_TXQ, // texture size query
118 OP_TXD, // texture derivatives
119 OP_TXG, // texture gather
120 OP_TEXCSAA,
121 OP_SULD, // surface load
122 OP_SUST, // surface store
123 OP_DFDX,
124 OP_DFDY,
125 OP_RDSV, // read system value
126 OP_WRSV, // write system value
127 OP_PIXLD,
128 OP_QUADOP,
129 OP_QUADON,
130 OP_QUADPOP,
131 OP_POPCNT, // bitcount(src0 & src1)
132 OP_INSBF, // insert first src1[8:15] bits of src0 into src2 at src1[0:7]
133 OP_EXTBF,
134 OP_LAST
135 };
136
137 #define NV50_IR_SUBOP_MUL_HIGH 1
138 #define NV50_IR_SUBOP_EMIT_RESTART 1
139 #define NV50_IR_SUBOP_LDC_IL 1
140 #define NV50_IR_SUBOP_LDC_IS 2
141 #define NV50_IR_SUBOP_LDC_ISL 3
142 #define NV50_IR_SUBOP_SHIFT_WRAP 1
143
144 enum DataType
145 {
146 TYPE_NONE,
147 TYPE_U8,
148 TYPE_S8,
149 TYPE_U16,
150 TYPE_S16,
151 TYPE_U32,
152 TYPE_S32,
153 TYPE_U64, // 64 bit operations are only lowered after register allocation
154 TYPE_S64,
155 TYPE_F16,
156 TYPE_F32,
157 TYPE_F64,
158 TYPE_B96,
159 TYPE_B128
160 };
161
162 enum CondCode
163 {
164 CC_FL = 0,
165 CC_NEVER = CC_FL, // when used with FILE_FLAGS
166 CC_LT = 1,
167 CC_EQ = 2,
168 CC_NOT_P = CC_EQ, // when used with FILE_PREDICATE
169 CC_LE = 3,
170 CC_GT = 4,
171 CC_NE = 5,
172 CC_P = CC_NE,
173 CC_GE = 6,
174 CC_TR = 7,
175 CC_ALWAYS = CC_TR,
176 CC_U = 8,
177 CC_LTU = 9,
178 CC_EQU = 10,
179 CC_LEU = 11,
180 CC_GTU = 12,
181 CC_NEU = 13,
182 CC_GEU = 14,
183 CC_NO = 0x10,
184 CC_NC = 0x11,
185 CC_NS = 0x12,
186 CC_NA = 0x13,
187 CC_A = 0x14,
188 CC_S = 0x15,
189 CC_C = 0x16,
190 CC_O = 0x17
191 };
192
193 enum RoundMode
194 {
195 ROUND_N, // nearest
196 ROUND_M, // towards -inf
197 ROUND_Z, // towards 0
198 ROUND_P, // towards +inf
199 ROUND_NI, // nearest integer
200 ROUND_MI, // to integer towards -inf
201 ROUND_ZI, // to integer towards 0
202 ROUND_PI, // to integer towards +inf
203 };
204
205 enum CacheMode
206 {
207 CACHE_CA, // cache at all levels
208 CACHE_WB = CACHE_CA, // cache write back
209 CACHE_CG, // cache at global level
210 CACHE_CS, // cache streaming
211 CACHE_CV, // cache as volatile
212 CACHE_WT = CACHE_CV // cache write-through
213 };
214
215 enum DataFile
216 {
217 FILE_NULL = 0,
218 FILE_GPR,
219 FILE_PREDICATE, // boolean predicate
220 FILE_FLAGS, // zero/sign/carry/overflow bits
221 FILE_ADDRESS,
222 FILE_IMMEDIATE,
223 FILE_MEMORY_CONST,
224 FILE_SHADER_INPUT,
225 FILE_SHADER_OUTPUT,
226 FILE_MEMORY_GLOBAL,
227 FILE_MEMORY_SHARED,
228 FILE_MEMORY_LOCAL,
229 FILE_SYSTEM_VALUE,
230 DATA_FILE_COUNT
231 };
232
233 enum TexTarget
234 {
235 TEX_TARGET_1D,
236 TEX_TARGET_2D,
237 TEX_TARGET_2D_MS,
238 TEX_TARGET_3D,
239 TEX_TARGET_CUBE,
240 TEX_TARGET_1D_SHADOW,
241 TEX_TARGET_2D_SHADOW,
242 TEX_TARGET_CUBE_SHADOW,
243 TEX_TARGET_1D_ARRAY,
244 TEX_TARGET_2D_ARRAY,
245 TEX_TARGET_2D_MS_ARRAY,
246 TEX_TARGET_CUBE_ARRAY,
247 TEX_TARGET_1D_ARRAY_SHADOW,
248 TEX_TARGET_2D_ARRAY_SHADOW,
249 TEX_TARGET_RECT,
250 TEX_TARGET_RECT_SHADOW,
251 TEX_TARGET_CUBE_ARRAY_SHADOW,
252 TEX_TARGET_BUFFER,
253 TEX_TARGET_COUNT
254 };
255
256 enum SVSemantic
257 {
258 SV_POSITION, // WPOS
259 SV_VERTEX_ID,
260 SV_INSTANCE_ID,
261 SV_INVOCATION_ID,
262 SV_PRIMITIVE_ID,
263 SV_VERTEX_COUNT, // gl_PatchVerticesIn
264 SV_LAYER,
265 SV_VIEWPORT_INDEX,
266 SV_YDIR,
267 SV_FACE,
268 SV_POINT_SIZE,
269 SV_POINT_COORD,
270 SV_CLIP_DISTANCE,
271 SV_SAMPLE_INDEX,
272 SV_TESS_FACTOR,
273 SV_TESS_COORD,
274 SV_TID,
275 SV_CTAID,
276 SV_NTID,
277 SV_GRIDID,
278 SV_NCTAID,
279 SV_LANEID,
280 SV_PHYSID,
281 SV_NPHYSID,
282 SV_CLOCK,
283 SV_LBASE,
284 SV_SBASE,
285 SV_UNDEFINED,
286 SV_LAST
287 };
288
289 class Program;
290 class Function;
291 class BasicBlock;
292
293 class Target;
294
295 class Instruction;
296 class CmpInstruction;
297 class TexInstruction;
298 class FlowInstruction;
299
300 class Value;
301 class LValue;
302 class Symbol;
303 class ImmediateValue;
304
305 struct Storage
306 {
307 DataFile file;
308 int8_t fileIndex; // signed, may be indirect for CONST[]
309 uint8_t size; // this should match the Instruction type's size
310 DataType type; // mainly for pretty printing
311 union {
312 uint64_t u64; // immediate values
313 uint32_t u32;
314 uint16_t u16;
315 uint8_t u8;
316 int64_t s64;
317 int32_t s32;
318 int16_t s16;
319 int8_t s8;
320 float f32;
321 double f64;
322 int32_t offset; // offset from 0 (base of address space)
323 int32_t id; // register id (< 0 if virtual/unassigned)
324 struct {
325 SVSemantic sv;
326 int index;
327 } sv;
328 } data;
329 };
330
331 // precedence: NOT after SAT after NEG after ABS
332 #define NV50_IR_MOD_ABS (1 << 0)
333 #define NV50_IR_MOD_NEG (1 << 1)
334 #define NV50_IR_MOD_SAT (1 << 2)
335 #define NV50_IR_MOD_NOT (1 << 3)
336 #define NV50_IR_MOD_NEG_ABS (NV50_IR_MOD_NEG | NV50_IR_MOD_ABS)
337
338 #define NV50_IR_INTERP_MODE_MASK 0x3
339 #define NV50_IR_INTERP_LINEAR (0 << 0)
340 #define NV50_IR_INTERP_PERSPECTIVE (1 << 0)
341 #define NV50_IR_INTERP_FLAT (2 << 0)
342 #define NV50_IR_INTERP_SC (3 << 0) // what exactly is that ?
343 #define NV50_IR_INTERP_SAMPLE_MASK 0xc
344 #define NV50_IR_INTERP_DEFAULT (0 << 2)
345 #define NV50_IR_INTERP_CENTROID (1 << 2)
346 #define NV50_IR_INTERP_OFFSET (2 << 2)
347 #define NV50_IR_INTERP_SAMPLEID (3 << 2)
348
349 // do we really want this to be a class ?
350 class Modifier
351 {
352 public:
353 Modifier() : bits(0) { }
354 Modifier(unsigned int m) : bits(m) { }
355 Modifier(operation op);
356
357 // @return new Modifier applying a after b (asserts if unrepresentable)
358 Modifier operator*(const Modifier) const;
359 Modifier operator==(const Modifier m) const { return m.bits == bits; }
360 Modifier operator!=(const Modifier m) const { return m.bits != bits; }
361
362 inline Modifier operator&(const Modifier m) const { return bits & m.bits; }
363 inline Modifier operator|(const Modifier m) const { return bits | m.bits; }
364 inline Modifier operator^(const Modifier m) const { return bits ^ m.bits; }
365
366 operation getOp() const;
367
368 inline int neg() const { return (bits & NV50_IR_MOD_NEG) ? 1 : 0; }
369 inline int abs() const { return (bits & NV50_IR_MOD_ABS) ? 1 : 0; }
370
371 inline operator bool() { return bits ? true : false; }
372
373 void applyTo(ImmediateValue &imm) const;
374
375 int print(char *buf, size_t size) const;
376
377 private:
378 uint8_t bits;
379 };
380
381 class ValueRef
382 {
383 public:
384 ValueRef();
385 ValueRef(const ValueRef&);
386 ~ValueRef();
387
388 inline bool exists() const { return value != NULL; }
389
390 void set(Value *);
391 void set(const ValueRef&);
392 inline Value *get() const { return value; }
393 inline Value *rep() const;
394
395 inline Instruction *getInsn() const { return insn; }
396 inline void setInsn(Instruction *inst) { insn = inst; }
397
398 inline bool isIndirect(int dim) const { return indirect[dim] >= 0; }
399 inline const ValueRef *getIndirect(int dim) const;
400
401 inline DataFile getFile() const;
402 inline unsigned getSize() const;
403
404 // SSA: return eventual (traverse MOVs) literal value, if it exists
405 ImmediateValue *getImmediate() const;
406
407 public:
408 Modifier mod;
409 int8_t indirect[2]; // >= 0 if relative to lvalue in insn->src(indirect[i])
410 uint8_t swizzle;
411
412 bool usedAsPtr; // for printing
413
414 private:
415 Value *value;
416 Instruction *insn;
417 };
418
419 class ValueDef
420 {
421 public:
422 ValueDef();
423 ValueDef(const ValueDef&);
424 ~ValueDef();
425
426 inline bool exists() const { return value != NULL; }
427
428 inline Value *get() const { return value; }
429 inline Value *rep() const;
430 void set(Value *);
431 void replace(Value *, bool doSet); // replace all uses of the old value
432
433 inline Instruction *getInsn() const { return insn; }
434 inline void setInsn(Instruction *inst) { insn = inst; }
435
436 inline DataFile getFile() const;
437 inline unsigned getSize() const;
438
439 inline void setSSA(LValue *);
440 inline const LValue *preSSA() const;
441
442 private:
443 Value *value; // should make this LValue * ...
444 LValue *origin; // pre SSA value
445 Instruction *insn;
446 };
447
448 class Value
449 {
450 public:
451 Value();
452 virtual ~Value() { }
453
454 virtual Value *clone(Function *) const { return NULL; }
455
456 virtual int print(char *, size_t, DataType ty = TYPE_NONE) const = 0;
457
458 virtual bool equals(const Value *, bool strict = false) const;
459 virtual bool interfers(const Value *) const;
460
461 inline Value *rep() const { return join; }
462
463 inline Instruction *getUniqueInsn() const;
464 inline Instruction *getInsn() const; // use when uniqueness is certain
465
466 inline int refCount() { return uses.size(); }
467
468 inline LValue *asLValue();
469 inline Symbol *asSym();
470 inline ImmediateValue *asImm();
471 inline const Symbol *asSym() const;
472 inline const ImmediateValue *asImm() const;
473
474 bool coalesce(Value *, bool force = false);
475
476 inline bool inFile(DataFile f) { return reg.file == f; }
477
478 static inline Value *get(Iterator&);
479
480 std::list<ValueRef *> uses;
481 std::list<ValueDef *> defs;
482 typedef std::list<ValueRef *>::iterator UseIterator;
483 typedef std::list<ValueRef *>::const_iterator UseCIterator;
484 typedef std::list<ValueDef *>::iterator DefIterator;
485 typedef std::list<ValueDef *>::const_iterator DefCIterator;
486
487 int id;
488 Storage reg;
489
490 // TODO: these should be in LValue:
491 Interval livei;
492 Value *join;
493 };
494
495 class LValue : public Value
496 {
497 public:
498 LValue(Function *, DataFile file);
499 LValue(Function *, LValue *);
500 ~LValue() { }
501
502 virtual Value *clone(Function *) const;
503
504 virtual int print(char *, size_t, DataType ty = TYPE_NONE) const;
505
506 public:
507 unsigned ssa : 1;
508
509 int affinity;
510 };
511
512 class Symbol : public Value
513 {
514 public:
515 Symbol(Program *, DataFile file = FILE_MEMORY_CONST, ubyte fileIdx = 0);
516 ~Symbol() { }
517
518 virtual Value *clone(Function *) const;
519
520 virtual bool equals(const Value *that, bool strict) const;
521
522 virtual int print(char *, size_t, DataType ty = TYPE_NONE) const;
523
524 // print with indirect values
525 int print(char *, size_t, Value *, Value *, DataType ty = TYPE_NONE) const;
526
527 inline void setFile(DataFile file, ubyte fileIndex = 0)
528 {
529 reg.file = file;
530 reg.fileIndex = fileIndex;
531 }
532
533 inline void setOffset(int32_t offset);
534 inline void setAddress(Symbol *base, int32_t offset);
535 inline void setSV(SVSemantic sv, uint32_t idx = 0);
536
537 inline const Symbol *getBase() const { return baseSym; }
538
539 private:
540 Symbol *baseSym; // array base for Symbols representing array elements
541 };
542
543 class ImmediateValue : public Value
544 {
545 public:
546 ImmediateValue(Program *, uint32_t);
547 ImmediateValue(Program *, float);
548 ImmediateValue(Program *, double);
549 // NOTE: not added to program with
550 ImmediateValue(const ImmediateValue *, DataType ty);
551 ~ImmediateValue() { };
552
553 virtual bool equals(const Value *that, bool strict) const;
554
555 // these only work if 'type' is valid (we mostly use untyped literals):
556 bool isInteger(const int ival) const; // ival is cast to this' type
557 bool isNegative() const;
558 bool isPow2() const;
559
560 void applyLog2();
561
562 // for constant folding:
563 ImmediateValue operator+(const ImmediateValue&) const;
564 ImmediateValue operator-(const ImmediateValue&) const;
565 ImmediateValue operator*(const ImmediateValue&) const;
566 ImmediateValue operator/(const ImmediateValue&) const;
567
568 bool compare(CondCode cc, float fval) const;
569
570 virtual int print(char *, size_t, DataType ty = TYPE_NONE) const;
571 };
572
573 class Instruction
574 {
575 public:
576 Instruction();
577 Instruction(Function *, operation, DataType);
578 virtual ~Instruction();
579
580 virtual Instruction *clone(bool deep) const;
581
582 void setDef(int i, Value *);
583 void setSrc(int s, Value *);
584 void setSrc(int s, const ValueRef&);
585 void swapSources(int a, int b);
586 bool setIndirect(int s, int dim, Value *);
587
588 inline ValueRef& src(int s) { return srcs[s]; }
589 inline ValueDef& def(int s) { return defs[s]; }
590 inline const ValueRef& src(int s) const { return srcs[s]; }
591 inline const ValueDef& def(int s) const { return defs[s]; }
592
593 inline Value *getDef(int d) const { return defs[d].get(); }
594 inline Value *getSrc(int s) const { return srcs[s].get(); }
595 inline Value *getIndirect(int s, int dim) const;
596
597 inline bool defExists(unsigned d) const
598 {
599 return d < defs.size() && defs[d].exists();
600 }
601 inline bool srcExists(unsigned s) const
602 {
603 return s < srcs.size() && srcs[s].exists();
604 }
605
606 inline bool constrainedDefs() const { return defExists(1); }
607
608 bool setPredicate(CondCode ccode, Value *);
609 inline Value *getPredicate() const;
610 bool writesPredicate() const;
611
612 inline void setFlagsSrc(int s, Value *);
613 inline void setFlagsDef(int d, Value *);
614
615 unsigned int defCount() const { return defs.size(); };
616 unsigned int defCount(unsigned int mask) const;
617 unsigned int srcCount() const { return srcs.size(); };
618 unsigned int srcCount(unsigned int mask) const;
619
620 // save & remove / set indirect[0,1] and predicate source
621 void takeExtraSources(int s, Value *[3]);
622 void putExtraSources(int s, Value *[3]);
623
624 inline void setType(DataType type) { dType = sType = type; }
625
626 inline void setType(DataType dtype, DataType stype)
627 {
628 dType = dtype;
629 sType = stype;
630 }
631
632 inline bool isPseudo() const { return op < OP_MOV; }
633 bool isDead() const;
634 bool isNop() const;
635 bool isCommutationLegal(const Instruction *) const; // must be adjacent !
636 bool isActionEqual(const Instruction *) const;
637 bool isResultEqual(const Instruction *) const;
638
639 void print() const;
640
641 inline CmpInstruction *asCmp();
642 inline TexInstruction *asTex();
643 inline FlowInstruction *asFlow();
644 inline const TexInstruction *asTex() const;
645 inline const CmpInstruction *asCmp() const;
646 inline const FlowInstruction *asFlow() const;
647
648 public:
649 Instruction *next;
650 Instruction *prev;
651 int id;
652 int serial; // CFG order
653
654 operation op;
655 DataType dType; // destination or defining type
656 DataType sType; // source or secondary type
657 CondCode cc;
658 RoundMode rnd;
659 CacheMode cache;
660
661 uint8_t subOp; // quadop, 1 for mul-high, etc.
662
663 unsigned encSize : 4; // encoding size in bytes
664 unsigned saturate : 1; // to [0.0f, 1.0f]
665 unsigned join : 1; // converge control flow (use OP_JOIN until end)
666 unsigned fixed : 1; // prevent dead code elimination
667 unsigned terminator : 1; // end of basic block
668 unsigned atomic : 1;
669 unsigned ftz : 1; // flush denormal to zero
670 unsigned dnz : 1; // denormals, NaN are zero
671 unsigned ipa : 4; // interpolation mode
672 unsigned lanes : 4;
673 unsigned perPatch : 1;
674 unsigned exit : 1; // terminate program after insn
675
676 int8_t postFactor; // MUL/DIV(if < 0) by 1 << postFactor
677
678 int8_t predSrc;
679 int8_t flagsDef;
680 int8_t flagsSrc;
681
682 BasicBlock *bb;
683
684 protected:
685 std::deque<ValueDef> defs; // no gaps !
686 std::deque<ValueRef> srcs; // no gaps !
687
688 // instruction specific methods:
689 // (don't want to subclass, would need more constructors and memory pools)
690 public:
691 inline void setInterpolate(unsigned int mode) { ipa = mode; }
692
693 unsigned int getInterpMode() const { return ipa & 0x3; }
694 unsigned int getSampleMode() const { return ipa & 0xc; }
695
696 private:
697 void init();
698 protected:
699 void cloneBase(Instruction *clone, bool deep) const;
700 };
701
702 enum TexQuery
703 {
704 TXQ_DIMS,
705 TXQ_TYPE,
706 TXQ_SAMPLE_POSITION,
707 TXQ_FILTER,
708 TXQ_LOD,
709 TXQ_WRAP,
710 TXQ_BORDER_COLOUR
711 };
712
713 class TexInstruction : public Instruction
714 {
715 public:
716 class Target
717 {
718 public:
719 Target(TexTarget targ = TEX_TARGET_2D) : target(targ) { }
720
721 const char *getName() const { return descTable[target].name; }
722 unsigned int getArgCount() const { return descTable[target].argc; }
723 unsigned int getDim() const { return descTable[target].dim; }
724 int isArray() const { return descTable[target].array ? 1 : 0; }
725 int isCube() const { return descTable[target].cube ? 1 : 0; }
726 int isShadow() const { return descTable[target].shadow ? 1 : 0; }
727
728 Target& operator=(TexTarget targ)
729 {
730 assert(targ < TEX_TARGET_COUNT);
731 return *this;
732 }
733
734 inline bool operator==(TexTarget targ) const { return target == targ; }
735
736 private:
737 struct Desc
738 {
739 char name[19];
740 uint8_t dim;
741 uint8_t argc;
742 bool array;
743 bool cube;
744 bool shadow;
745 };
746
747 static const struct Desc descTable[TEX_TARGET_COUNT];
748
749 private:
750 enum TexTarget target;
751 };
752
753 public:
754 TexInstruction(Function *, operation);
755 virtual ~TexInstruction();
756
757 virtual Instruction *clone(bool deep) const;
758
759 inline void setTexture(Target targ, uint8_t r, uint8_t s)
760 {
761 tex.r = r;
762 tex.s = s;
763 tex.target = targ;
764 }
765
766 inline Value *getIndirectR() const;
767 inline Value *getIndirectS() const;
768
769 public:
770 struct {
771 Target target;
772
773 uint8_t r;
774 int8_t rIndirectSrc;
775 uint8_t s;
776 int8_t sIndirectSrc;
777
778 uint8_t mask;
779 uint8_t gatherComp;
780
781 bool liveOnly; // only execute on live pixels of a quad (optimization)
782 bool levelZero;
783 bool derivAll;
784
785 int8_t useOffsets; // 0, 1, or 4 for textureGatherOffsets
786 int8_t offset[4][3];
787
788 enum TexQuery query;
789 } tex;
790
791 ValueRef dPdx[3];
792 ValueRef dPdy[3];
793 };
794
795 class CmpInstruction : public Instruction
796 {
797 public:
798 CmpInstruction(Function *, operation);
799
800 virtual Instruction *clone(bool deep) const;
801
802 void setCondition(CondCode cond) { setCond = cond; }
803 CondCode getCondition() const { return setCond; }
804
805 public:
806 CondCode setCond;
807 };
808
809 class FlowInstruction : public Instruction
810 {
811 public:
812 FlowInstruction(Function *, operation, BasicBlock *target);
813
814 public:
815 unsigned allWarp : 1;
816 unsigned absolute : 1;
817 unsigned limit : 1;
818 unsigned builtin : 1; // true for calls to emulation code
819
820 union {
821 BasicBlock *bb;
822 int builtin;
823 Function *fn;
824 } target;
825 };
826
827 class BasicBlock
828 {
829 public:
830 BasicBlock(Function *);
831 ~BasicBlock();
832
833 inline int getId() const { return id; }
834 inline unsigned int getInsnCount() const { return numInsns; }
835 inline bool isTerminated() const { return exit && exit->terminator; }
836
837 bool dominatedBy(BasicBlock *bb);
838 inline bool reachableBy(BasicBlock *by, BasicBlock *term);
839
840 // returns mask of conditional out blocks
841 // e.g. 3 for IF { .. } ELSE { .. } ENDIF, 1 for IF { .. } ENDIF
842 unsigned int initiatesSimpleConditional() const;
843
844 public:
845 Function *getFunction() const { return func; }
846 Program *getProgram() const { return program; }
847
848 Instruction *getEntry() const { return entry; } // first non-phi instruction
849 Instruction *getPhi() const { return phi; }
850 Instruction *getFirst() const { return phi ? phi : entry; }
851 Instruction *getExit() const { return exit; }
852
853 void insertHead(Instruction *);
854 void insertTail(Instruction *);
855 void insertBefore(Instruction *, Instruction *);
856 void insertAfter(Instruction *, Instruction *);
857 void remove(Instruction *);
858 void permuteAdjacent(Instruction *, Instruction *);
859
860 BasicBlock *idom() const;
861
862 // NOTE: currently does not rebuild the dominator tree
863 BasicBlock *splitBefore(Instruction *, bool attach = true);
864 BasicBlock *splitAfter(Instruction *, bool attach = true);
865
866 DLList& getDF() { return df; }
867 DLList::Iterator iterDF() { return df.iterator(); }
868
869 static inline BasicBlock *get(Iterator&);
870 static inline BasicBlock *get(Graph::Node *);
871
872 public:
873 Graph::Node cfg; // first edge is branch *taken* (the ELSE branch)
874 Graph::Node dom;
875
876 BitSet liveSet;
877
878 uint32_t binPos;
879 uint32_t binSize;
880
881 Instruction *joinAt; // for quick reference
882
883 bool explicitCont; // loop headers: true if loop contains continue stmts
884
885 private:
886 int id;
887 DLList df;
888
889 Instruction *phi;
890 Instruction *entry;
891 Instruction *exit;
892
893 unsigned int numInsns;
894
895 private:
896 Function *func;
897 Program *program;
898
899 void splitCommon(Instruction *, BasicBlock *, bool attach);
900 };
901
902 class Function
903 {
904 public:
905 Function(Program *, const char *name);
906 ~Function();
907
908 inline Program *getProgram() const { return prog; }
909 inline const char *getName() const { return name; }
910 inline int getId() const { return id; }
911
912 void print();
913 void printLiveIntervals() const;
914 void printCFGraph(const char *filePath);
915
916 bool setEntry(BasicBlock *);
917 bool setExit(BasicBlock *);
918
919 unsigned int orderInstructions(ArrayList&);
920
921 inline void add(BasicBlock *bb, int& id) { allBBlocks.insert(bb, id); }
922 inline void add(Instruction *insn, int& id) { allInsns.insert(insn, id); }
923 inline void add(LValue *lval, int& id) { allLValues.insert(lval, id); }
924
925 inline LValue *getLValue(int id);
926
927 bool convertToSSA();
928
929 public:
930 Graph cfg;
931 Graph::Node *cfgExit;
932 Graph *domTree;
933 Graph::Node call; // node in the call graph
934
935 BasicBlock **bbArray; // BBs in emission order
936 int bbCount;
937
938 unsigned int loopNestingBound;
939 int regClobberMax;
940
941 uint32_t binPos;
942 uint32_t binSize;
943
944 ArrayList allBBlocks;
945 ArrayList allInsns;
946 ArrayList allLValues;
947
948 private:
949 void buildLiveSetsPreSSA(BasicBlock *, const int sequence);
950
951 private:
952 int id;
953 const char *const name;
954 Program *prog;
955 };
956
957 enum CGStage
958 {
959 CG_STAGE_PRE_SSA,
960 CG_STAGE_SSA, // expected directly before register allocation
961 CG_STAGE_POST_RA
962 };
963
964 class Program
965 {
966 public:
967 enum Type
968 {
969 TYPE_VERTEX,
970 TYPE_TESSELLATION_CONTROL,
971 TYPE_TESSELLATION_EVAL,
972 TYPE_GEOMETRY,
973 TYPE_FRAGMENT,
974 TYPE_COMPUTE
975 };
976
977 Program(Type type, Target *targ);
978 ~Program();
979
980 void print();
981
982 Type getType() const { return progType; }
983
984 inline void add(Function *fn, int& id) { allFuncs.insert(fn, id); }
985 inline void add(Value *rval, int& id) { allRValues.insert(rval, id); }
986
987 bool makeFromTGSI(struct nv50_ir_prog_info *);
988 bool makeFromSM4(struct nv50_ir_prog_info *);
989 bool convertToSSA();
990 bool optimizeSSA(int level);
991 bool optimizePostRA(int level);
992 bool registerAllocation();
993 bool emitBinary(struct nv50_ir_prog_info *);
994
995 const Target *getTarget() const { return target; }
996
997 private:
998 Type progType;
999 Target *target;
1000
1001 public:
1002 Function *main;
1003 Graph calls;
1004
1005 ArrayList allFuncs;
1006 ArrayList allRValues;
1007
1008 uint32_t *code;
1009 uint32_t binSize;
1010
1011 int maxGPR;
1012
1013 MemoryPool mem_Instruction;
1014 MemoryPool mem_CmpInstruction;
1015 MemoryPool mem_TexInstruction;
1016 MemoryPool mem_FlowInstruction;
1017 MemoryPool mem_LValue;
1018 MemoryPool mem_Symbol;
1019 MemoryPool mem_ImmediateValue;
1020
1021 uint32_t dbgFlags;
1022
1023 void releaseInstruction(Instruction *);
1024 void releaseValue(Value *);
1025 };
1026
1027 // TODO: add const version
1028 class Pass
1029 {
1030 public:
1031 bool run(Program *, bool ordered = false, bool skipPhi = false);
1032 bool run(Function *, bool ordered = false, bool skipPhi = false);
1033
1034 private:
1035 // return false to continue with next entity on next higher level
1036 virtual bool visit(Function *) { return true; }
1037 virtual bool visit(BasicBlock *) { return true; }
1038 virtual bool visit(Instruction *) { return false; }
1039
1040 bool doRun(Program *, bool ordered, bool skipPhi);
1041 bool doRun(Function *, bool ordered, bool skipPhi);
1042
1043 protected:
1044 bool err;
1045 Function *func;
1046 Program *prog;
1047 };
1048
1049 // =============================================================================
1050
1051 #include "nv50_ir_inlines.h"
1052
1053 } // namespace nv50_ir
1054
1055 #endif // __NV50_IR_H__