2 * Copyright 2011 Christoph Bumiller
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:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
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 OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
33 #include "codegen/unordered_set.h"
34 #include "codegen/nv50_ir_util.h"
35 #include "codegen/nv50_ir_graph.h"
37 #include "codegen/nv50_ir_driver.h"
45 OP_UNION
, // unify a new definition and several source values
46 OP_SPLIT
, // $r0d -> { $r0, $r1 } ($r0d and $r0/$r1 will be coalesced)
47 OP_MERGE
, // opposite of split, e.g. combine 2 32 bit into a 64 bit value
48 OP_CONSTRAINT
, // copy values into consecutive registers
49 OP_MOV
, // simple copy, no modifiers allowed
52 OP_ADD
, // NOTE: add u64 + u32 is legal for targets w/o 64-bit integer adds
59 OP_SAD
, // abs(src0 - src1) + src2
71 OP_SAT
, // CLAMP(f32, 0.0, 1.0)
76 OP_SET_AND
, // dst = (src0 CMP src1) & src2
80 OP_SELP
, // dst = src2 ? src0 : src1
81 OP_SLCT
, // dst = (src2 CMP 0) ? src0 : src1
88 OP_EXP
, // exponential (base M_E)
89 OP_LOG
, // natural logarithm
102 OP_BRKPT
, // breakpoint (not related to loops)
103 OP_JOINAT
, // push control flow convergence point
107 OP_MEMBAR
, // memory barrier (mfence, lfence, sfence)
108 OP_VFETCH
, // indirection 0 in attribute space, indirection 1 is vertex base
109 OP_PFETCH
, // fetch base address of vertex src0 (immediate) [+ src1]
110 OP_AFETCH
, // fetch base address of shader input (a[%r1+0x10])
114 OP_EMIT
, // emit vertex
115 OP_RESTART
, // restart primitive
117 OP_TXB
, // texture bias
118 OP_TXL
, // texure lod
119 OP_TXF
, // texel fetch
120 OP_TXQ
, // texture size query
121 OP_TXD
, // texture derivatives
122 OP_TXG
, // texture gather
123 OP_TXLQ
, // texture query lod
124 OP_TEXCSAA
, // texture op for coverage sampling
125 OP_TEXPREP
, // turn cube map array into 2d array coordinates
126 OP_SULDB
, // surface load (raw)
127 OP_SULDP
, // surface load (formatted)
128 OP_SUSTB
, // surface store (raw)
129 OP_SUSTP
, // surface store (formatted)
131 OP_SUREDP
, // surface reduction (atomic op)
132 OP_SULEA
, // surface load effective address
133 OP_SUBFM
, // surface bitfield manipulation
134 OP_SUCLAMP
, // clamp surface coordinates
135 OP_SUEAU
, // surface effective address
136 OP_SUQ
, // surface query
137 OP_MADSP
, // special integer multiply-add
138 OP_TEXBAR
, // texture dependency barrier
141 OP_RDSV
, // read system value
142 OP_WRSV
, // write system value
143 OP_PIXLD
, // get info about raster object or surfaces
147 OP_POPCNT
, // bitcount(src0 & src1)
148 OP_INSBF
, // insert first src1[8:15] bits of src0 into src2 at src1[0:7]
149 OP_EXTBF
, // place bits [K,K+N) of src0 into dst, src1 = 0xNNKK
150 OP_BFIND
, // find highest/lowest set bit
151 OP_PERMT
, // dst = bytes from src2,src0 selected by src1 (nvc0's src order)
153 OP_BAR
, // execution barrier, sources = { id, thread count, predicate }
154 OP_VADD
, // byte/word vector operations
163 OP_CCTL
, // cache control
164 OP_SHFL
, // warp shuffle
166 OP_BUFQ
, // buffer query
170 // various instruction-specific modifier definitions Instruction::subOp
171 // MOV_FINAL marks a MOV originating from an EXPORT (used for placing TEXBARs)
172 #define NV50_IR_SUBOP_MUL_HIGH 1
173 #define NV50_IR_SUBOP_EMIT_RESTART 1
174 #define NV50_IR_SUBOP_LDC_IL 1
175 #define NV50_IR_SUBOP_LDC_IS 2
176 #define NV50_IR_SUBOP_LDC_ISL 3
177 #define NV50_IR_SUBOP_SHIFT_WRAP 1
178 #define NV50_IR_SUBOP_SHIFT_HIGH 2
179 #define NV50_IR_SUBOP_EMU_PRERET 1
180 #define NV50_IR_SUBOP_TEXBAR(n) n
181 #define NV50_IR_SUBOP_MOV_FINAL 1
182 #define NV50_IR_SUBOP_EXTBF_REV 1
183 #define NV50_IR_SUBOP_BFIND_SAMT 1
184 #define NV50_IR_SUBOP_RCPRSQ_64H 1
185 #define NV50_IR_SUBOP_PERMT_F4E 1
186 #define NV50_IR_SUBOP_PERMT_B4E 2
187 #define NV50_IR_SUBOP_PERMT_RC8 3
188 #define NV50_IR_SUBOP_PERMT_ECL 4
189 #define NV50_IR_SUBOP_PERMT_ECR 5
190 #define NV50_IR_SUBOP_PERMT_RC16 6
191 #define NV50_IR_SUBOP_BAR_SYNC 0
192 #define NV50_IR_SUBOP_BAR_ARRIVE 1
193 #define NV50_IR_SUBOP_BAR_RED_AND 2
194 #define NV50_IR_SUBOP_BAR_RED_OR 3
195 #define NV50_IR_SUBOP_BAR_RED_POPC 4
196 #define NV50_IR_SUBOP_MEMBAR_L 1
197 #define NV50_IR_SUBOP_MEMBAR_S 2
198 #define NV50_IR_SUBOP_MEMBAR_M 3
199 #define NV50_IR_SUBOP_MEMBAR_CTA (0 << 2)
200 #define NV50_IR_SUBOP_MEMBAR_GL (1 << 2)
201 #define NV50_IR_SUBOP_MEMBAR_SYS (2 << 2)
202 #define NV50_IR_SUBOP_MEMBAR_DIR(m) ((m) & 0x3)
203 #define NV50_IR_SUBOP_MEMBAR_SCOPE(m) ((m) & ~0x3)
204 #define NV50_IR_SUBOP_MEMBAR(d,s) \
205 (NV50_IR_SUBOP_MEMBAR_##d | NV50_IR_SUBOP_MEMBAR_##s)
206 #define NV50_IR_SUBOP_ATOM_ADD 0
207 #define NV50_IR_SUBOP_ATOM_MIN 1
208 #define NV50_IR_SUBOP_ATOM_MAX 2
209 #define NV50_IR_SUBOP_ATOM_INC 3
210 #define NV50_IR_SUBOP_ATOM_DEC 4
211 #define NV50_IR_SUBOP_ATOM_AND 5
212 #define NV50_IR_SUBOP_ATOM_OR 6
213 #define NV50_IR_SUBOP_ATOM_XOR 7
214 #define NV50_IR_SUBOP_ATOM_CAS 8
215 #define NV50_IR_SUBOP_ATOM_EXCH 9
216 #define NV50_IR_SUBOP_CCTL_IV 5
217 #define NV50_IR_SUBOP_CCTL_IVALL 6
218 #define NV50_IR_SUBOP_SUST_IGN 0
219 #define NV50_IR_SUBOP_SUST_TRAP 1
220 #define NV50_IR_SUBOP_SUST_SDCL 3
221 #define NV50_IR_SUBOP_SULD_ZERO 0
222 #define NV50_IR_SUBOP_SULD_TRAP 1
223 #define NV50_IR_SUBOP_SULD_SDCL 3
224 #define NV50_IR_SUBOP_SUBFM_3D 1
225 #define NV50_IR_SUBOP_SUCLAMP_2D 0x10
226 #define NV50_IR_SUBOP_SUCLAMP_SD(r, d) (( 0 + (r)) | ((d == 2) ? 0x10 : 0))
227 #define NV50_IR_SUBOP_SUCLAMP_PL(r, d) (( 5 + (r)) | ((d == 2) ? 0x10 : 0))
228 #define NV50_IR_SUBOP_SUCLAMP_BL(r, d) ((10 + (r)) | ((d == 2) ? 0x10 : 0))
229 #define NV50_IR_SUBOP_PIXLD_COUNT 0
230 #define NV50_IR_SUBOP_PIXLD_COVMASK 1
231 #define NV50_IR_SUBOP_PIXLD_COVERED 2
232 #define NV50_IR_SUBOP_PIXLD_OFFSET 3
233 #define NV50_IR_SUBOP_PIXLD_CENT_OFFSET 4
234 #define NV50_IR_SUBOP_PIXLD_SAMPLEID 5
235 #define NV50_IR_SUBOP_SHFL_IDX 0
236 #define NV50_IR_SUBOP_SHFL_UP 1
237 #define NV50_IR_SUBOP_SHFL_DOWN 2
238 #define NV50_IR_SUBOP_SHFL_BFLY 3
239 #define NV50_IR_SUBOP_LOAD_LOCKED 1
240 #define NV50_IR_SUBOP_STORE_UNLOCKED 2
241 #define NV50_IR_SUBOP_MADSP_SD 0xffff
242 // Yes, we could represent those with DataType.
243 // Or put the type into operation and have a couple 1000 values in that enum.
244 // This will have to do for now.
245 // The bitfields are supposed to correspond to nve4 ISA.
246 #define NV50_IR_SUBOP_MADSP(a,b,c) (((c) << 8) | ((b) << 4) | (a))
247 #define NV50_IR_SUBOP_V1(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x0000)
248 #define NV50_IR_SUBOP_V2(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x4000)
249 #define NV50_IR_SUBOP_V4(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x8000)
250 #define NV50_IR_SUBOP_Vn(n) ((n) >> 14)
251 #define NV50_IR_SUBOP_VOTE_ALL 0
252 #define NV50_IR_SUBOP_VOTE_ANY 1
253 #define NV50_IR_SUBOP_VOTE_UNI 2
255 #define NV50_IR_SUBOP_MINMAX_LOW 1
256 #define NV50_IR_SUBOP_MINMAX_MED 2
257 #define NV50_IR_SUBOP_MINMAX_HIGH 3
268 TYPE_U64
, // 64 bit operations are only lowered after register allocation
280 CC_NEVER
= CC_FL
, // when used with FILE_FLAGS
283 CC_NOT_P
= CC_EQ
, // when used with FILE_PREDICATE
311 ROUND_M
, // towards -inf
312 ROUND_Z
, // towards 0
313 ROUND_P
, // towards +inf
314 ROUND_NI
, // nearest integer
315 ROUND_MI
, // to integer towards -inf
316 ROUND_ZI
, // to integer towards 0
317 ROUND_PI
, // to integer towards +inf
322 CACHE_CA
, // cache at all levels
323 CACHE_WB
= CACHE_CA
, // cache write back
324 CACHE_CG
, // cache at global level
325 CACHE_CS
, // cache streaming
326 CACHE_CV
, // cache as volatile
327 CACHE_WT
= CACHE_CV
// cache write-through
334 FILE_PREDICATE
, // boolean predicate
335 FILE_FLAGS
, // zero/sign/carry/overflow bits
337 LAST_REGISTER_FILE
= FILE_ADDRESS
,
357 TEX_TARGET_1D_SHADOW
,
358 TEX_TARGET_2D_SHADOW
,
359 TEX_TARGET_CUBE_SHADOW
,
362 TEX_TARGET_2D_MS_ARRAY
,
363 TEX_TARGET_CUBE_ARRAY
,
364 TEX_TARGET_1D_ARRAY_SHADOW
,
365 TEX_TARGET_2D_ARRAY_SHADOW
,
367 TEX_TARGET_RECT_SHADOW
,
368 TEX_TARGET_CUBE_ARRAY_SHADOW
,
441 SV_VERTEX_COUNT
, // gl_PatchVerticesIn
489 class CmpInstruction
;
490 class TexInstruction
;
491 class FlowInstruction
;
496 class ImmediateValue
;
501 int8_t fileIndex
; // signed, may be indirect for CONST[]
502 uint8_t size
; // this should match the Instruction type's size
503 DataType type
; // mainly for pretty printing
505 uint64_t u64
; // immediate values
515 int32_t offset
; // offset from 0 (base of address space)
516 int32_t id
; // register id (< 0 if virtual/unassigned, in units <= 4)
524 // precedence: NOT after SAT after NEG after ABS
525 #define NV50_IR_MOD_ABS (1 << 0)
526 #define NV50_IR_MOD_NEG (1 << 1)
527 #define NV50_IR_MOD_SAT (1 << 2)
528 #define NV50_IR_MOD_NOT (1 << 3)
529 #define NV50_IR_MOD_NEG_ABS (NV50_IR_MOD_NEG | NV50_IR_MOD_ABS)
531 #define NV50_IR_INTERP_MODE_MASK 0x3
532 #define NV50_IR_INTERP_LINEAR (0 << 0)
533 #define NV50_IR_INTERP_PERSPECTIVE (1 << 0)
534 #define NV50_IR_INTERP_FLAT (2 << 0)
535 #define NV50_IR_INTERP_SC (3 << 0) // what exactly is that ?
536 #define NV50_IR_INTERP_SAMPLE_MASK 0xc
537 #define NV50_IR_INTERP_DEFAULT (0 << 2)
538 #define NV50_IR_INTERP_CENTROID (1 << 2)
539 #define NV50_IR_INTERP_OFFSET (2 << 2)
540 #define NV50_IR_INTERP_SAMPLEID (3 << 2)
542 // do we really want this to be a class ?
546 Modifier() : bits(0) { }
547 Modifier(unsigned int m
) : bits(m
) { }
548 Modifier(operation op
);
550 // @return new Modifier applying a after b (asserts if unrepresentable)
551 Modifier
operator*(const Modifier
) const;
552 Modifier
operator*=(const Modifier m
) { *this = *this * m
; return *this; }
553 Modifier
operator==(const Modifier m
) const { return m
.bits
== bits
; }
554 Modifier
operator!=(const Modifier m
) const { return m
.bits
!= bits
; }
556 inline Modifier
operator&(const Modifier m
) const { return bits
& m
.bits
; }
557 inline Modifier
operator|(const Modifier m
) const { return bits
| m
.bits
; }
558 inline Modifier
operator^(const Modifier m
) const { return bits
^ m
.bits
; }
560 operation
getOp() const;
562 inline int neg() const { return (bits
& NV50_IR_MOD_NEG
) ? 1 : 0; }
563 inline int abs() const { return (bits
& NV50_IR_MOD_ABS
) ? 1 : 0; }
565 inline operator bool() const { return bits
? true : false; }
567 void applyTo(ImmediateValue
&imm
) const;
569 int print(char *buf
, size_t size
) const;
578 ValueRef(Value
* = NULL
);
579 ValueRef(const ValueRef
&);
582 inline bool exists() const { return value
!= NULL
; }
585 void set(const ValueRef
&);
586 inline Value
*get() const { return value
; }
587 inline Value
*rep() const;
589 inline Instruction
*getInsn() const { return insn
; }
590 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
592 inline bool isIndirect(int dim
) const { return indirect
[dim
] >= 0; }
593 inline const ValueRef
*getIndirect(int dim
) const;
595 inline DataFile
getFile() const;
596 inline unsigned getSize() const;
598 // SSA: return eventual (traverse MOVs) literal value, if it exists
599 bool getImmediate(ImmediateValue
&) const;
603 int8_t indirect
[2]; // >= 0 if relative to lvalue in insn->src(indirect[i])
605 bool usedAsPtr
; // for printing
615 ValueDef(Value
* = NULL
);
616 ValueDef(const ValueDef
&);
619 inline bool exists() const { return value
!= NULL
; }
621 inline Value
*get() const { return value
; }
622 inline Value
*rep() const;
624 bool mayReplace(const ValueRef
&);
625 void replace(const ValueRef
&, bool doSet
); // replace all uses of the old value
627 inline Instruction
*getInsn() const { return insn
; }
628 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
630 inline DataFile
getFile() const;
631 inline unsigned getSize() const;
633 inline void setSSA(LValue
*);
634 inline const LValue
*preSSA() const;
637 Value
*value
; // should make this LValue * ...
638 LValue
*origin
; // pre SSA value
648 virtual Value
*clone(ClonePolicy
<Function
>&) const = 0;
650 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const = 0;
652 virtual bool equals(const Value
*, bool strict
= false) const;
653 virtual bool interfers(const Value
*) const;
654 virtual bool isUniform() const { return true; }
656 inline Value
*rep() const { return join
; }
658 inline Instruction
*getUniqueInsn() const;
659 inline Instruction
*getInsn() const; // use when uniqueness is certain
661 inline int refCount() { return uses
.size(); }
663 inline LValue
*asLValue();
664 inline Symbol
*asSym();
665 inline ImmediateValue
*asImm();
666 inline const Symbol
*asSym() const;
667 inline const ImmediateValue
*asImm() const;
669 inline bool inFile(DataFile f
) const { return reg
.file
== f
; }
671 static inline Value
*get(Iterator
&);
673 unordered_set
<ValueRef
*> uses
;
674 std::list
<ValueDef
*> defs
;
675 typedef unordered_set
<ValueRef
*>::iterator UseIterator
;
676 typedef unordered_set
<ValueRef
*>::const_iterator UseCIterator
;
677 typedef std::list
<ValueDef
*>::iterator DefIterator
;
678 typedef std::list
<ValueDef
*>::const_iterator DefCIterator
;
683 // TODO: these should be in LValue:
688 class LValue
: public Value
691 LValue(Function
*, DataFile file
);
692 LValue(Function
*, LValue
*);
695 virtual bool isUniform() const;
697 virtual LValue
*clone(ClonePolicy
<Function
>&) const;
699 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
702 unsigned compMask
: 8; // compound/component mask
703 unsigned compound
: 1; // used by RA, value involved in split/merge
705 unsigned fixedReg
: 1; // set & used by RA, earlier just use (id < 0)
706 unsigned noSpill
: 1; // do not spill (e.g. if spill temporary already)
709 class Symbol
: public Value
712 Symbol(Program
*, DataFile file
= FILE_MEMORY_CONST
, ubyte fileIdx
= 0);
715 virtual Symbol
*clone(ClonePolicy
<Function
>&) const;
717 virtual bool equals(const Value
*that
, bool strict
) const;
719 virtual bool isUniform() const;
721 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
723 // print with indirect values
724 int print(char *, size_t, Value
*, Value
*, DataType ty
= TYPE_NONE
) const;
726 inline void setFile(DataFile file
, ubyte fileIndex
= 0)
729 reg
.fileIndex
= fileIndex
;
732 inline void setOffset(int32_t offset
);
733 inline void setAddress(Symbol
*base
, int32_t offset
);
734 inline void setSV(SVSemantic sv
, uint32_t idx
= 0);
736 inline const Symbol
*getBase() const { return baseSym
; }
739 Symbol
*baseSym
; // array base for Symbols representing array elements
742 class ImmediateValue
: public Value
746 ImmediateValue(Program
*, uint32_t);
747 ImmediateValue(Program
*, float);
748 ImmediateValue(Program
*, double);
749 // NOTE: not added to program with
750 ImmediateValue(const ImmediateValue
*, DataType ty
);
751 ~ImmediateValue() { };
753 virtual ImmediateValue
*clone(ClonePolicy
<Function
>&) const;
755 virtual bool equals(const Value
*that
, bool strict
) const;
757 // these only work if 'type' is valid (we mostly use untyped literals):
758 bool isInteger(const int ival
) const; // ival is cast to this' type
759 bool isNegative() const;
764 // for constant folding:
765 ImmediateValue
operator+(const ImmediateValue
&) const;
766 ImmediateValue
operator-(const ImmediateValue
&) const;
767 ImmediateValue
operator*(const ImmediateValue
&) const;
768 ImmediateValue
operator/(const ImmediateValue
&) const;
770 ImmediateValue
& operator=(const ImmediateValue
&); // only sets value !
772 bool compare(CondCode cc
, float fval
) const;
774 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
781 Instruction(Function
*, operation
, DataType
);
782 virtual ~Instruction();
784 virtual Instruction
*clone(ClonePolicy
<Function
>&,
785 Instruction
* = NULL
) const;
787 void setDef(int i
, Value
*);
788 void setSrc(int s
, Value
*);
789 void setSrc(int s
, const ValueRef
&);
790 void swapSources(int a
, int b
);
791 void moveSources(int s
, int delta
);
792 bool setIndirect(int s
, int dim
, Value
*);
794 inline ValueRef
& src(int s
) { return srcs
[s
]; }
795 inline ValueDef
& def(int s
) { return defs
[s
]; }
796 inline const ValueRef
& src(int s
) const { return srcs
[s
]; }
797 inline const ValueDef
& def(int s
) const { return defs
[s
]; }
799 inline Value
*getDef(int d
) const { return defs
[d
].get(); }
800 inline Value
*getSrc(int s
) const { return srcs
[s
].get(); }
801 inline Value
*getIndirect(int s
, int dim
) const;
803 inline bool defExists(unsigned d
) const
805 return d
< defs
.size() && defs
[d
].exists();
807 inline bool srcExists(unsigned s
) const
809 return s
< srcs
.size() && srcs
[s
].exists();
812 inline bool constrainedDefs() const;
814 bool setPredicate(CondCode ccode
, Value
*);
815 inline Value
*getPredicate() const;
816 bool writesPredicate() const;
817 inline bool isPredicated() const { return predSrc
>= 0; }
819 inline void setFlagsSrc(int s
, Value
*);
820 inline void setFlagsDef(int d
, Value
*);
821 inline bool usesFlags() const { return flagsSrc
>= 0; }
823 unsigned int defCount() const { return defs
.size(); };
824 unsigned int defCount(unsigned int mask
, bool singleFile
= false) const;
825 unsigned int srcCount() const { return srcs
.size(); };
826 unsigned int srcCount(unsigned int mask
, bool singleFile
= false) const;
828 // save & remove / set indirect[0,1] and predicate source
829 void takeExtraSources(int s
, Value
*[3]);
830 void putExtraSources(int s
, Value
*[3]);
832 inline void setType(DataType type
) { dType
= sType
= type
; }
834 inline void setType(DataType dtype
, DataType stype
)
840 inline bool isPseudo() const { return op
< OP_MOV
; }
843 bool isCommutationLegal(const Instruction
*) const; // must be adjacent !
844 bool isActionEqual(const Instruction
*) const;
845 bool isResultEqual(const Instruction
*) const;
847 // check whether the defs interfere with srcs and defs of another instruction
848 bool canCommuteDefDef(const Instruction
*) const;
849 bool canCommuteDefSrc(const Instruction
*) const;
853 inline CmpInstruction
*asCmp();
854 inline TexInstruction
*asTex();
855 inline FlowInstruction
*asFlow();
856 inline const TexInstruction
*asTex() const;
857 inline const CmpInstruction
*asCmp() const;
858 inline const FlowInstruction
*asFlow() const;
864 int serial
; // CFG order
867 DataType dType
; // destination or defining type
868 DataType sType
; // source or secondary type
873 uint16_t subOp
; // quadop, 1 for mul-high, etc.
875 unsigned encSize
: 4; // encoding size in bytes
876 unsigned saturate
: 1; // to [0.0f, 1.0f]
877 unsigned join
: 1; // converge control flow (use OP_JOIN until end)
878 unsigned fixed
: 1; // prevent dead code elimination
879 unsigned terminator
: 1; // end of basic block
880 unsigned ftz
: 1; // flush denormal to zero
881 unsigned dnz
: 1; // denormals, NaN are zero
882 unsigned ipa
: 4; // interpolation mode
884 unsigned perPatch
: 1;
885 unsigned exit
: 1; // terminate program after insn
886 unsigned mask
: 4; // for vector ops
888 int8_t postFactor
; // MUL/DIV(if < 0) by 1 << postFactor
894 uint32_t sched
; // scheduling data (NOTE: maybe move to separate storage)
899 std::deque
<ValueDef
> defs
; // no gaps !
900 std::deque
<ValueRef
> srcs
; // no gaps !
902 // instruction specific methods:
903 // (don't want to subclass, would need more constructors and memory pools)
905 inline void setInterpolate(unsigned int mode
) { ipa
= mode
; }
907 unsigned int getInterpMode() const { return ipa
& 0x3; }
908 unsigned int getSampleMode() const { return ipa
& 0xc; }
916 TXQ_DIMS
, /* x, y, z, levels */
917 TXQ_TYPE
, /* ?, ?, samples, ? */
925 class TexInstruction
: public Instruction
931 Target(TexTarget targ
= TEX_TARGET_2D
) : target(targ
) { }
933 const char *getName() const { return descTable
[target
].name
; }
934 unsigned int getArgCount() const { return descTable
[target
].argc
; }
935 unsigned int getDim() const { return descTable
[target
].dim
; }
936 int isArray() const { return descTable
[target
].array
? 1 : 0; }
937 int isCube() const { return descTable
[target
].cube
? 1 : 0; }
938 int isShadow() const { return descTable
[target
].shadow
? 1 : 0; }
940 return target
== TEX_TARGET_2D_MS
|| target
== TEX_TARGET_2D_MS_ARRAY
; }
944 target
= TEX_TARGET_2D_ARRAY
;
946 target
= TEX_TARGET_2D
;
950 Target
& operator=(TexTarget targ
)
952 assert(targ
< TEX_TARGET_COUNT
);
957 inline bool operator==(TexTarget targ
) const { return target
== targ
; }
958 inline bool operator!=(TexTarget targ
) const { return target
!= targ
; }
960 enum TexTarget
getEnum() const { return target
; }
973 static const struct Desc descTable
[TEX_TARGET_COUNT
];
976 enum TexTarget target
;
989 static const struct ImgFormatDesc formatTable
[IMG_FORMAT_COUNT
];
992 TexInstruction(Function
*, operation
);
993 virtual ~TexInstruction();
995 virtual TexInstruction
*clone(ClonePolicy
<Function
>&,
996 Instruction
* = NULL
) const;
998 inline void setTexture(Target targ
, uint8_t r
, uint8_t s
)
1005 void setIndirectR(Value
*);
1006 void setIndirectS(Value
*);
1007 inline Value
*getIndirectR() const;
1008 inline Value
*getIndirectS() const;
1016 int8_t rIndirectSrc
;
1017 int8_t sIndirectSrc
;
1022 bool liveOnly
; // only execute on live pixels of a quad (optimization)
1026 int8_t useOffsets
; // 0, 1, or 4 for textureGatherOffsets
1027 int8_t offset
[3]; // only used on nv50
1029 enum TexQuery query
;
1030 const struct ImgFormatDesc
*format
;
1035 ValueRef offset
[4][3];
1038 class CmpInstruction
: public Instruction
1041 CmpInstruction(Function
*, operation
);
1043 virtual CmpInstruction
*clone(ClonePolicy
<Function
>&,
1044 Instruction
* = NULL
) const;
1046 void setCondition(CondCode cond
) { setCond
= cond
; }
1047 CondCode
getCondition() const { return setCond
; }
1053 class FlowInstruction
: public Instruction
1056 FlowInstruction(Function
*, operation
, void *target
);
1058 virtual FlowInstruction
*clone(ClonePolicy
<Function
>&,
1059 Instruction
* = NULL
) const;
1062 unsigned allWarp
: 1;
1063 unsigned absolute
: 1;
1065 unsigned builtin
: 1; // true for calls to emulation code
1066 unsigned indirect
: 1; // target in src(0)
1078 BasicBlock(Function
*);
1081 BasicBlock
*clone(ClonePolicy
<Function
>&) const;
1083 inline int getId() const { return id
; }
1084 inline unsigned int getInsnCount() const { return numInsns
; }
1085 inline bool isTerminated() const { return exit
&& exit
->terminator
; }
1087 bool dominatedBy(BasicBlock
*bb
);
1088 inline bool reachableBy(const BasicBlock
*by
, const BasicBlock
*term
);
1090 // returns mask of conditional out blocks
1091 // e.g. 3 for IF { .. } ELSE { .. } ENDIF, 1 for IF { .. } ENDIF
1092 unsigned int initiatesSimpleConditional() const;
1095 Function
*getFunction() const { return func
; }
1096 Program
*getProgram() const { return program
; }
1098 Instruction
*getEntry() const { return entry
; } // first non-phi instruction
1099 Instruction
*getPhi() const { return phi
; }
1100 Instruction
*getFirst() const { return phi
? phi
: entry
; }
1101 Instruction
*getExit() const { return exit
; }
1103 void insertHead(Instruction
*);
1104 void insertTail(Instruction
*);
1105 void insertBefore(Instruction
*, Instruction
*);
1106 void insertAfter(Instruction
*, Instruction
*);
1107 void remove(Instruction
*);
1108 void permuteAdjacent(Instruction
*, Instruction
*);
1110 BasicBlock
*idom() const;
1112 // NOTE: currently does not rebuild the dominator tree
1113 BasicBlock
*splitBefore(Instruction
*, bool attach
= true);
1114 BasicBlock
*splitAfter(Instruction
*, bool attach
= true);
1116 DLList
& getDF() { return df
; }
1117 DLList::Iterator
iterDF() { return df
.iterator(); }
1119 static inline BasicBlock
*get(Iterator
&);
1120 static inline BasicBlock
*get(Graph::Node
*);
1123 Graph::Node cfg
; // first edge is branch *taken* (the ELSE branch)
1132 Instruction
*joinAt
; // for quick reference
1134 bool explicitCont
; // loop headers: true if loop contains continue stmts
1144 unsigned int numInsns
;
1150 void splitCommon(Instruction
*, BasicBlock
*, bool attach
);
1156 Function(Program
*, const char *name
, uint32_t label
);
1159 static inline Function
*get(Graph::Node
*node
);
1161 inline Program
*getProgram() const { return prog
; }
1162 inline const char *getName() const { return name
; }
1163 inline int getId() const { return id
; }
1164 inline uint32_t getLabel() const { return label
; }
1167 void printLiveIntervals() const;
1168 void printCFGraph(const char *filePath
);
1170 bool setEntry(BasicBlock
*);
1171 bool setExit(BasicBlock
*);
1173 unsigned int orderInstructions(ArrayList
&);
1175 inline void add(BasicBlock
*bb
, int& id
) { allBBlocks
.insert(bb
, id
); }
1176 inline void add(Instruction
*insn
, int& id
) { allInsns
.insert(insn
, id
); }
1177 inline void add(LValue
*lval
, int& id
) { allLValues
.insert(lval
, id
); }
1179 inline LValue
*getLValue(int id
);
1181 void buildLiveSets();
1182 void buildDefSets();
1183 bool convertToSSA();
1186 std::deque
<ValueDef
> ins
;
1187 std::deque
<ValueRef
> outs
;
1188 std::deque
<Value
*> clobbers
;
1191 Graph::Node
*cfgExit
;
1193 Graph::Node call
; // node in the call graph
1195 BasicBlock
**bbArray
; // BBs in emission order
1198 unsigned int loopNestingBound
;
1206 uint32_t tlsBase
; // base address for l[] space (if no stack pointer is used)
1209 ArrayList allBBlocks
;
1211 ArrayList allLValues
;
1214 void buildLiveSetsPreSSA(BasicBlock
*, const int sequence
);
1215 void buildDefSetsPreSSA(BasicBlock
*bb
, const int seq
);
1220 const char *const name
;
1227 CG_STAGE_SSA
, // expected directly before register allocation
1237 TYPE_TESSELLATION_CONTROL
,
1238 TYPE_TESSELLATION_EVAL
,
1244 Program(Type type
, Target
*targ
);
1249 Type
getType() const { return progType
; }
1251 inline void add(Function
*fn
, int& id
) { allFuncs
.insert(fn
, id
); }
1252 inline void del(Function
*fn
, int& id
) { allFuncs
.remove(id
); }
1253 inline void add(Value
*rval
, int& id
) { allRValues
.insert(rval
, id
); }
1255 bool makeFromTGSI(struct nv50_ir_prog_info
*);
1256 bool convertToSSA();
1257 bool optimizeSSA(int level
);
1258 bool optimizePostRA(int level
);
1259 bool registerAllocation();
1260 bool emitBinary(struct nv50_ir_prog_info
*);
1262 const Target
*getTarget() const { return target
; }
1265 void emitSymbolTable(struct nv50_ir_prog_info
*);
1275 ArrayList allRValues
;
1279 uint32_t tlsSize
; // size required for FILE_MEMORY_LOCAL
1283 MemoryPool mem_Instruction
;
1284 MemoryPool mem_CmpInstruction
;
1285 MemoryPool mem_TexInstruction
;
1286 MemoryPool mem_FlowInstruction
;
1287 MemoryPool mem_LValue
;
1288 MemoryPool mem_Symbol
;
1289 MemoryPool mem_ImmediateValue
;
1294 void *targetPriv
; // e.g. to carry information between passes
1296 const struct nv50_ir_prog_info
*driver
; // for driver configuration
1298 void releaseInstruction(Instruction
*);
1299 void releaseValue(Value
*);
1302 // TODO: add const version
1306 bool run(Program
*, bool ordered
= false, bool skipPhi
= false);
1307 bool run(Function
*, bool ordered
= false, bool skipPhi
= false);
1310 // return false to continue with next entity on next higher level
1311 virtual bool visit(Function
*) { return true; }
1312 virtual bool visit(BasicBlock
*) { return true; }
1313 virtual bool visit(Instruction
*) { return false; }
1315 bool doRun(Program
*, bool ordered
, bool skipPhi
);
1316 bool doRun(Function
*, bool ordered
, bool skipPhi
);
1324 // =============================================================================
1326 #include "codegen/nv50_ir_inlines.h"
1328 } // namespace nv50_ir
1330 #endif // __NV50_IR_H__