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.
32 #include <tr1/unordered_set>
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
70 OP_SAT
, // CLAMP(f32, 0.0, 1.0)
75 OP_SET_AND
, // dst = (src0 CMP src1) & src2
79 OP_SELP
, // dst = src2 ? src0 : src1
80 OP_SLCT
, // dst = (src2 CMP 0) ? src0 : src1
87 OP_EXP
, // exponential (base M_E)
88 OP_LOG
, // natural logarithm
101 OP_BRKPT
, // breakpoint (not related to loops)
102 OP_JOINAT
, // push control flow convergence point
106 OP_MEMBAR
, // memory barrier (mfence, lfence, sfence)
107 OP_VFETCH
, // indirection 0 in attribute space, indirection 1 is vertex base
108 OP_PFETCH
, // fetch base address of vertex src0 (immediate) [+ src1]
112 OP_EMIT
, // emit vertex
113 OP_RESTART
, // restart primitive
115 OP_TXB
, // texture bias
116 OP_TXL
, // texure lod
117 OP_TXF
, // texel fetch
118 OP_TXQ
, // texture size query
119 OP_TXD
, // texture derivatives
120 OP_TXG
, // texture gather
121 OP_TXLQ
, // texture query lod
122 OP_TEXCSAA
, // texture op for coverage sampling
123 OP_TEXPREP
, // turn cube map array into 2d array coordinates
124 OP_SULDB
, // surface load (raw)
125 OP_SULDP
, // surface load (formatted)
126 OP_SUSTB
, // surface store (raw)
127 OP_SUSTP
, // surface store (formatted)
129 OP_SUREDP
, // surface reduction (atomic op)
130 OP_SULEA
, // surface load effective address
131 OP_SUBFM
, // surface bitfield manipulation
132 OP_SUCLAMP
, // clamp surface coordinates
133 OP_SUEAU
, // surface effective address
134 OP_MADSP
, // special integer multiply-add
135 OP_TEXBAR
, // texture dependency barrier
138 OP_RDSV
, // read system value
139 OP_WRSV
, // write system value
140 OP_PIXLD
, // get info about raster object or surfaces
144 OP_POPCNT
, // bitcount(src0 & src1)
145 OP_INSBF
, // insert first src1[8:15] bits of src0 into src2 at src1[0:7]
146 OP_EXTBF
, // place bits [K,K+N) of src0 into dst, src1 = 0xNNKK
147 OP_BFIND
, // find highest/lowest set bit
148 OP_PERMT
, // dst = bytes from src2,src0 selected by src1 (nvc0's src order)
150 OP_BAR
, // execution barrier, sources = { id, thread count, predicate }
151 OP_VADD
, // byte/word vector operations
160 OP_CCTL
, // cache control
161 OP_SHFL
, // warp shuffle
165 // various instruction-specific modifier definitions Instruction::subOp
166 // MOV_FINAL marks a MOV originating from an EXPORT (used for placing TEXBARs)
167 #define NV50_IR_SUBOP_MUL_HIGH 1
168 #define NV50_IR_SUBOP_EMIT_RESTART 1
169 #define NV50_IR_SUBOP_LDC_IL 1
170 #define NV50_IR_SUBOP_LDC_IS 2
171 #define NV50_IR_SUBOP_LDC_ISL 3
172 #define NV50_IR_SUBOP_SHIFT_WRAP 1
173 #define NV50_IR_SUBOP_EMU_PRERET 1
174 #define NV50_IR_SUBOP_TEXBAR(n) n
175 #define NV50_IR_SUBOP_MOV_FINAL 1
176 #define NV50_IR_SUBOP_EXTBF_REV 1
177 #define NV50_IR_SUBOP_BFIND_SAMT 1
178 #define NV50_IR_SUBOP_RCPRSQ_64H 1
179 #define NV50_IR_SUBOP_PERMT_F4E 1
180 #define NV50_IR_SUBOP_PERMT_B4E 2
181 #define NV50_IR_SUBOP_PERMT_RC8 3
182 #define NV50_IR_SUBOP_PERMT_ECL 4
183 #define NV50_IR_SUBOP_PERMT_ECR 5
184 #define NV50_IR_SUBOP_PERMT_RC16 6
185 #define NV50_IR_SUBOP_BAR_SYNC 0
186 #define NV50_IR_SUBOP_BAR_ARRIVE 1
187 #define NV50_IR_SUBOP_BAR_RED_AND 2
188 #define NV50_IR_SUBOP_BAR_RED_OR 3
189 #define NV50_IR_SUBOP_BAR_RED_POPC 4
190 #define NV50_IR_SUBOP_MEMBAR_L 1
191 #define NV50_IR_SUBOP_MEMBAR_S 2
192 #define NV50_IR_SUBOP_MEMBAR_M 3
193 #define NV50_IR_SUBOP_MEMBAR_CTA (0 << 2)
194 #define NV50_IR_SUBOP_MEMBAR_GL (1 << 2)
195 #define NV50_IR_SUBOP_MEMBAR_SYS (2 << 2)
196 #define NV50_IR_SUBOP_MEMBAR_DIR(m) ((m) & 0x3)
197 #define NV50_IR_SUBOP_MEMBAR_SCOPE(m) ((m) & ~0x3)
198 #define NV50_IR_SUBOP_MEMBAR(d,s) \
199 (NV50_IR_SUBOP_MEMBAR_##d | NV50_IR_SUBOP_MEMBAR_##s)
200 #define NV50_IR_SUBOP_ATOM_ADD 0
201 #define NV50_IR_SUBOP_ATOM_MIN 1
202 #define NV50_IR_SUBOP_ATOM_MAX 2
203 #define NV50_IR_SUBOP_ATOM_INC 3
204 #define NV50_IR_SUBOP_ATOM_DEC 4
205 #define NV50_IR_SUBOP_ATOM_AND 5
206 #define NV50_IR_SUBOP_ATOM_OR 6
207 #define NV50_IR_SUBOP_ATOM_XOR 7
208 #define NV50_IR_SUBOP_ATOM_CAS 8
209 #define NV50_IR_SUBOP_ATOM_EXCH 9
210 #define NV50_IR_SUBOP_CCTL_IV 5
211 #define NV50_IR_SUBOP_CCTL_IVALL 6
212 #define NV50_IR_SUBOP_SUST_IGN 0
213 #define NV50_IR_SUBOP_SUST_TRAP 1
214 #define NV50_IR_SUBOP_SUST_SDCL 3
215 #define NV50_IR_SUBOP_SULD_ZERO 0
216 #define NV50_IR_SUBOP_SULD_TRAP 1
217 #define NV50_IR_SUBOP_SULD_SDCL 3
218 #define NV50_IR_SUBOP_SUBFM_3D 1
219 #define NV50_IR_SUBOP_SUCLAMP_2D 0x10
220 #define NV50_IR_SUBOP_SUCLAMP_SD(r, d) (( 0 + (r)) | ((d == 2) ? 0x10 : 0))
221 #define NV50_IR_SUBOP_SUCLAMP_PL(r, d) (( 5 + (r)) | ((d == 2) ? 0x10 : 0))
222 #define NV50_IR_SUBOP_SUCLAMP_BL(r, d) ((10 + (r)) | ((d == 2) ? 0x10 : 0))
223 #define NV50_IR_SUBOP_PIXLD_COUNT 0
224 #define NV50_IR_SUBOP_PIXLD_COVMASK 1
225 #define NV50_IR_SUBOP_PIXLD_COVERED 2
226 #define NV50_IR_SUBOP_PIXLD_OFFSET 3
227 #define NV50_IR_SUBOP_PIXLD_CENT_OFFSET 4
228 #define NV50_IR_SUBOP_PIXLD_SAMPLEID 5
229 #define NV50_IR_SUBOP_SHFL_IDX 0
230 #define NV50_IR_SUBOP_SHFL_UP 1
231 #define NV50_IR_SUBOP_SHFL_DOWN 2
232 #define NV50_IR_SUBOP_SHFL_BFLY 3
233 #define NV50_IR_SUBOP_MADSP_SD 0xffff
234 // Yes, we could represent those with DataType.
235 // Or put the type into operation and have a couple 1000 values in that enum.
236 // This will have to do for now.
237 // The bitfields are supposed to correspond to nve4 ISA.
238 #define NV50_IR_SUBOP_MADSP(a,b,c) (((c) << 8) | ((b) << 4) | (a))
239 #define NV50_IR_SUBOP_V1(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x0000)
240 #define NV50_IR_SUBOP_V2(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x4000)
241 #define NV50_IR_SUBOP_V4(d,a,b) (((d) << 10) | ((b) << 5) | (a) | 0x8000)
242 #define NV50_IR_SUBOP_Vn(n) ((n) >> 14)
253 TYPE_U64
, // 64 bit operations are only lowered after register allocation
265 CC_NEVER
= CC_FL
, // when used with FILE_FLAGS
268 CC_NOT_P
= CC_EQ
, // when used with FILE_PREDICATE
296 ROUND_M
, // towards -inf
297 ROUND_Z
, // towards 0
298 ROUND_P
, // towards +inf
299 ROUND_NI
, // nearest integer
300 ROUND_MI
, // to integer towards -inf
301 ROUND_ZI
, // to integer towards 0
302 ROUND_PI
, // to integer towards +inf
307 CACHE_CA
, // cache at all levels
308 CACHE_WB
= CACHE_CA
, // cache write back
309 CACHE_CG
, // cache at global level
310 CACHE_CS
, // cache streaming
311 CACHE_CV
, // cache as volatile
312 CACHE_WT
= CACHE_CV
// cache write-through
319 FILE_PREDICATE
, // boolean predicate
320 FILE_FLAGS
, // zero/sign/carry/overflow bits
322 LAST_REGISTER_FILE
= FILE_ADDRESS
,
341 TEX_TARGET_1D_SHADOW
,
342 TEX_TARGET_2D_SHADOW
,
343 TEX_TARGET_CUBE_SHADOW
,
346 TEX_TARGET_2D_MS_ARRAY
,
347 TEX_TARGET_CUBE_ARRAY
,
348 TEX_TARGET_1D_ARRAY_SHADOW
,
349 TEX_TARGET_2D_ARRAY_SHADOW
,
351 TEX_TARGET_RECT_SHADOW
,
352 TEX_TARGET_CUBE_ARRAY_SHADOW
,
364 SV_VERTEX_COUNT
, // gl_PatchVerticesIn
401 class CmpInstruction
;
402 class TexInstruction
;
403 class FlowInstruction
;
408 class ImmediateValue
;
413 int8_t fileIndex
; // signed, may be indirect for CONST[]
414 uint8_t size
; // this should match the Instruction type's size
415 DataType type
; // mainly for pretty printing
417 uint64_t u64
; // immediate values
427 int32_t offset
; // offset from 0 (base of address space)
428 int32_t id
; // register id (< 0 if virtual/unassigned, in units <= 4)
436 // precedence: NOT after SAT after NEG after ABS
437 #define NV50_IR_MOD_ABS (1 << 0)
438 #define NV50_IR_MOD_NEG (1 << 1)
439 #define NV50_IR_MOD_SAT (1 << 2)
440 #define NV50_IR_MOD_NOT (1 << 3)
441 #define NV50_IR_MOD_NEG_ABS (NV50_IR_MOD_NEG | NV50_IR_MOD_ABS)
443 #define NV50_IR_INTERP_MODE_MASK 0x3
444 #define NV50_IR_INTERP_LINEAR (0 << 0)
445 #define NV50_IR_INTERP_PERSPECTIVE (1 << 0)
446 #define NV50_IR_INTERP_FLAT (2 << 0)
447 #define NV50_IR_INTERP_SC (3 << 0) // what exactly is that ?
448 #define NV50_IR_INTERP_SAMPLE_MASK 0xc
449 #define NV50_IR_INTERP_DEFAULT (0 << 2)
450 #define NV50_IR_INTERP_CENTROID (1 << 2)
451 #define NV50_IR_INTERP_OFFSET (2 << 2)
452 #define NV50_IR_INTERP_SAMPLEID (3 << 2)
454 // do we really want this to be a class ?
458 Modifier() : bits(0) { }
459 Modifier(unsigned int m
) : bits(m
) { }
460 Modifier(operation op
);
462 // @return new Modifier applying a after b (asserts if unrepresentable)
463 Modifier
operator*(const Modifier
) const;
464 Modifier
operator*=(const Modifier m
) { *this = *this * m
; return *this; }
465 Modifier
operator==(const Modifier m
) const { return m
.bits
== bits
; }
466 Modifier
operator!=(const Modifier m
) const { return m
.bits
!= bits
; }
468 inline Modifier
operator&(const Modifier m
) const { return bits
& m
.bits
; }
469 inline Modifier
operator|(const Modifier m
) const { return bits
| m
.bits
; }
470 inline Modifier
operator^(const Modifier m
) const { return bits
^ m
.bits
; }
472 operation
getOp() const;
474 inline int neg() const { return (bits
& NV50_IR_MOD_NEG
) ? 1 : 0; }
475 inline int abs() const { return (bits
& NV50_IR_MOD_ABS
) ? 1 : 0; }
477 inline operator bool() const { return bits
? true : false; }
479 void applyTo(ImmediateValue
&imm
) const;
481 int print(char *buf
, size_t size
) const;
490 ValueRef(Value
* = NULL
);
491 ValueRef(const ValueRef
&);
494 inline bool exists() const { return value
!= NULL
; }
497 void set(const ValueRef
&);
498 inline Value
*get() const { return value
; }
499 inline Value
*rep() const;
501 inline Instruction
*getInsn() const { return insn
; }
502 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
504 inline bool isIndirect(int dim
) const { return indirect
[dim
] >= 0; }
505 inline const ValueRef
*getIndirect(int dim
) const;
507 inline DataFile
getFile() const;
508 inline unsigned getSize() const;
510 // SSA: return eventual (traverse MOVs) literal value, if it exists
511 bool getImmediate(ImmediateValue
&) const;
515 int8_t indirect
[2]; // >= 0 if relative to lvalue in insn->src(indirect[i])
518 bool usedAsPtr
; // for printing
528 ValueDef(Value
* = NULL
);
529 ValueDef(const ValueDef
&);
532 inline bool exists() const { return value
!= NULL
; }
534 inline Value
*get() const { return value
; }
535 inline Value
*rep() const;
537 bool mayReplace(const ValueRef
&);
538 void replace(const ValueRef
&, bool doSet
); // replace all uses of the old value
540 inline Instruction
*getInsn() const { return insn
; }
541 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
543 inline DataFile
getFile() const;
544 inline unsigned getSize() const;
546 inline void setSSA(LValue
*);
547 inline const LValue
*preSSA() const;
550 Value
*value
; // should make this LValue * ...
551 LValue
*origin
; // pre SSA value
561 virtual Value
*clone(ClonePolicy
<Function
>&) const = 0;
563 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const = 0;
565 virtual bool equals(const Value
*, bool strict
= false) const;
566 virtual bool interfers(const Value
*) const;
567 virtual bool isUniform() const { return true; }
569 inline Value
*rep() const { return join
; }
571 inline Instruction
*getUniqueInsn() const;
572 inline Instruction
*getInsn() const; // use when uniqueness is certain
574 inline int refCount() { return uses
.size(); }
576 inline LValue
*asLValue();
577 inline Symbol
*asSym();
578 inline ImmediateValue
*asImm();
579 inline const Symbol
*asSym() const;
580 inline const ImmediateValue
*asImm() const;
582 inline bool inFile(DataFile f
) { return reg
.file
== f
; }
584 static inline Value
*get(Iterator
&);
586 std::tr1::unordered_set
<ValueRef
*> uses
;
587 std::list
<ValueDef
*> defs
;
588 typedef std::tr1::unordered_set
<ValueRef
*>::iterator UseIterator
;
589 typedef std::tr1::unordered_set
<ValueRef
*>::const_iterator UseCIterator
;
590 typedef std::list
<ValueDef
*>::iterator DefIterator
;
591 typedef std::list
<ValueDef
*>::const_iterator DefCIterator
;
596 // TODO: these should be in LValue:
601 class LValue
: public Value
604 LValue(Function
*, DataFile file
);
605 LValue(Function
*, LValue
*);
608 virtual bool isUniform() const;
610 virtual LValue
*clone(ClonePolicy
<Function
>&) const;
612 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
615 unsigned compMask
: 8; // compound/component mask
616 unsigned compound
: 1; // used by RA, value involved in split/merge
618 unsigned fixedReg
: 1; // set & used by RA, earlier just use (id < 0)
619 unsigned noSpill
: 1; // do not spill (e.g. if spill temporary already)
622 class Symbol
: public Value
625 Symbol(Program
*, DataFile file
= FILE_MEMORY_CONST
, ubyte fileIdx
= 0);
628 virtual Symbol
*clone(ClonePolicy
<Function
>&) const;
630 virtual bool equals(const Value
*that
, bool strict
) const;
632 virtual bool isUniform() const;
634 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
636 // print with indirect values
637 int print(char *, size_t, Value
*, Value
*, DataType ty
= TYPE_NONE
) const;
639 inline void setFile(DataFile file
, ubyte fileIndex
= 0)
642 reg
.fileIndex
= fileIndex
;
645 inline void setOffset(int32_t offset
);
646 inline void setAddress(Symbol
*base
, int32_t offset
);
647 inline void setSV(SVSemantic sv
, uint32_t idx
= 0);
649 inline const Symbol
*getBase() const { return baseSym
; }
652 Symbol
*baseSym
; // array base for Symbols representing array elements
655 class ImmediateValue
: public Value
659 ImmediateValue(Program
*, uint32_t);
660 ImmediateValue(Program
*, float);
661 ImmediateValue(Program
*, double);
662 // NOTE: not added to program with
663 ImmediateValue(const ImmediateValue
*, DataType ty
);
664 ~ImmediateValue() { };
666 virtual ImmediateValue
*clone(ClonePolicy
<Function
>&) const;
668 virtual bool equals(const Value
*that
, bool strict
) const;
670 // these only work if 'type' is valid (we mostly use untyped literals):
671 bool isInteger(const int ival
) const; // ival is cast to this' type
672 bool isNegative() const;
677 // for constant folding:
678 ImmediateValue
operator+(const ImmediateValue
&) const;
679 ImmediateValue
operator-(const ImmediateValue
&) const;
680 ImmediateValue
operator*(const ImmediateValue
&) const;
681 ImmediateValue
operator/(const ImmediateValue
&) const;
683 ImmediateValue
& operator=(const ImmediateValue
&); // only sets value !
685 bool compare(CondCode cc
, float fval
) const;
687 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
694 Instruction(Function
*, operation
, DataType
);
695 virtual ~Instruction();
697 virtual Instruction
*clone(ClonePolicy
<Function
>&,
698 Instruction
* = NULL
) const;
700 void setDef(int i
, Value
*);
701 void setSrc(int s
, Value
*);
702 void setSrc(int s
, const ValueRef
&);
703 void swapSources(int a
, int b
);
704 void moveSources(int s
, int delta
);
705 bool setIndirect(int s
, int dim
, Value
*);
707 inline ValueRef
& src(int s
) { return srcs
[s
]; }
708 inline ValueDef
& def(int s
) { return defs
[s
]; }
709 inline const ValueRef
& src(int s
) const { return srcs
[s
]; }
710 inline const ValueDef
& def(int s
) const { return defs
[s
]; }
712 inline Value
*getDef(int d
) const { return defs
[d
].get(); }
713 inline Value
*getSrc(int s
) const { return srcs
[s
].get(); }
714 inline Value
*getIndirect(int s
, int dim
) const;
716 inline bool defExists(unsigned d
) const
718 return d
< defs
.size() && defs
[d
].exists();
720 inline bool srcExists(unsigned s
) const
722 return s
< srcs
.size() && srcs
[s
].exists();
725 inline bool constrainedDefs() const;
727 bool setPredicate(CondCode ccode
, Value
*);
728 inline Value
*getPredicate() const;
729 bool writesPredicate() const;
730 inline bool isPredicated() const { return predSrc
>= 0; }
732 inline void setFlagsSrc(int s
, Value
*);
733 inline void setFlagsDef(int d
, Value
*);
734 inline bool usesFlags() const { return flagsSrc
>= 0; }
736 unsigned int defCount() const { return defs
.size(); };
737 unsigned int defCount(unsigned int mask
, bool singleFile
= false) const;
738 unsigned int srcCount() const { return srcs
.size(); };
739 unsigned int srcCount(unsigned int mask
, bool singleFile
= false) const;
741 // save & remove / set indirect[0,1] and predicate source
742 void takeExtraSources(int s
, Value
*[3]);
743 void putExtraSources(int s
, Value
*[3]);
745 inline void setType(DataType type
) { dType
= sType
= type
; }
747 inline void setType(DataType dtype
, DataType stype
)
753 inline bool isPseudo() const { return op
< OP_MOV
; }
756 bool isCommutationLegal(const Instruction
*) const; // must be adjacent !
757 bool isActionEqual(const Instruction
*) const;
758 bool isResultEqual(const Instruction
*) const;
762 inline CmpInstruction
*asCmp();
763 inline TexInstruction
*asTex();
764 inline FlowInstruction
*asFlow();
765 inline const TexInstruction
*asTex() const;
766 inline const CmpInstruction
*asCmp() const;
767 inline const FlowInstruction
*asFlow() const;
773 int serial
; // CFG order
776 DataType dType
; // destination or defining type
777 DataType sType
; // source or secondary type
782 uint16_t subOp
; // quadop, 1 for mul-high, etc.
784 unsigned encSize
: 4; // encoding size in bytes
785 unsigned saturate
: 1; // to [0.0f, 1.0f]
786 unsigned join
: 1; // converge control flow (use OP_JOIN until end)
787 unsigned fixed
: 1; // prevent dead code elimination
788 unsigned terminator
: 1; // end of basic block
789 unsigned ftz
: 1; // flush denormal to zero
790 unsigned dnz
: 1; // denormals, NaN are zero
791 unsigned ipa
: 4; // interpolation mode
793 unsigned perPatch
: 1;
794 unsigned exit
: 1; // terminate program after insn
795 unsigned mask
: 4; // for vector ops
797 int8_t postFactor
; // MUL/DIV(if < 0) by 1 << postFactor
803 uint32_t sched
; // scheduling data (NOTE: maybe move to separate storage)
808 std::deque
<ValueDef
> defs
; // no gaps !
809 std::deque
<ValueRef
> srcs
; // no gaps !
811 // instruction specific methods:
812 // (don't want to subclass, would need more constructors and memory pools)
814 inline void setInterpolate(unsigned int mode
) { ipa
= mode
; }
816 unsigned int getInterpMode() const { return ipa
& 0x3; }
817 unsigned int getSampleMode() const { return ipa
& 0xc; }
834 class TexInstruction
: public Instruction
840 Target(TexTarget targ
= TEX_TARGET_2D
) : target(targ
) { }
842 const char *getName() const { return descTable
[target
].name
; }
843 unsigned int getArgCount() const { return descTable
[target
].argc
; }
844 unsigned int getDim() const { return descTable
[target
].dim
; }
845 int isArray() const { return descTable
[target
].array
? 1 : 0; }
846 int isCube() const { return descTable
[target
].cube
? 1 : 0; }
847 int isShadow() const { return descTable
[target
].shadow
? 1 : 0; }
849 return target
== TEX_TARGET_2D_MS
|| target
== TEX_TARGET_2D_MS_ARRAY
; }
853 target
= TEX_TARGET_2D_ARRAY
;
855 target
= TEX_TARGET_2D
;
859 Target
& operator=(TexTarget targ
)
861 assert(targ
< TEX_TARGET_COUNT
);
866 inline bool operator==(TexTarget targ
) const { return target
== targ
; }
867 inline bool operator!=(TexTarget targ
) const { return target
!= targ
; }
869 enum TexTarget
getEnum() const { return target
; }
882 static const struct Desc descTable
[TEX_TARGET_COUNT
];
885 enum TexTarget target
;
889 TexInstruction(Function
*, operation
);
890 virtual ~TexInstruction();
892 virtual TexInstruction
*clone(ClonePolicy
<Function
>&,
893 Instruction
* = NULL
) const;
895 inline void setTexture(Target targ
, uint8_t r
, uint8_t s
)
902 void setIndirectR(Value
*);
903 void setIndirectS(Value
*);
904 inline Value
*getIndirectR() const;
905 inline Value
*getIndirectS() const;
919 bool liveOnly
; // only execute on live pixels of a quad (optimization)
923 int8_t useOffsets
; // 0, 1, or 4 for textureGatherOffsets
924 int8_t offset
[3]; // only used on nv50
931 ValueRef offset
[4][3];
934 class CmpInstruction
: public Instruction
937 CmpInstruction(Function
*, operation
);
939 virtual CmpInstruction
*clone(ClonePolicy
<Function
>&,
940 Instruction
* = NULL
) const;
942 void setCondition(CondCode cond
) { setCond
= cond
; }
943 CondCode
getCondition() const { return setCond
; }
949 class FlowInstruction
: public Instruction
952 FlowInstruction(Function
*, operation
, void *target
);
954 virtual FlowInstruction
*clone(ClonePolicy
<Function
>&,
955 Instruction
* = NULL
) const;
958 unsigned allWarp
: 1;
959 unsigned absolute
: 1;
961 unsigned builtin
: 1; // true for calls to emulation code
962 unsigned indirect
: 1; // target in src(0)
974 BasicBlock(Function
*);
977 BasicBlock
*clone(ClonePolicy
<Function
>&) const;
979 inline int getId() const { return id
; }
980 inline unsigned int getInsnCount() const { return numInsns
; }
981 inline bool isTerminated() const { return exit
&& exit
->terminator
; }
983 bool dominatedBy(BasicBlock
*bb
);
984 inline bool reachableBy(const BasicBlock
*by
, const BasicBlock
*term
);
986 // returns mask of conditional out blocks
987 // e.g. 3 for IF { .. } ELSE { .. } ENDIF, 1 for IF { .. } ENDIF
988 unsigned int initiatesSimpleConditional() const;
991 Function
*getFunction() const { return func
; }
992 Program
*getProgram() const { return program
; }
994 Instruction
*getEntry() const { return entry
; } // first non-phi instruction
995 Instruction
*getPhi() const { return phi
; }
996 Instruction
*getFirst() const { return phi
? phi
: entry
; }
997 Instruction
*getExit() const { return exit
; }
999 void insertHead(Instruction
*);
1000 void insertTail(Instruction
*);
1001 void insertBefore(Instruction
*, Instruction
*);
1002 void insertAfter(Instruction
*, Instruction
*);
1003 void remove(Instruction
*);
1004 void permuteAdjacent(Instruction
*, Instruction
*);
1006 BasicBlock
*idom() const;
1008 // NOTE: currently does not rebuild the dominator tree
1009 BasicBlock
*splitBefore(Instruction
*, bool attach
= true);
1010 BasicBlock
*splitAfter(Instruction
*, bool attach
= true);
1012 DLList
& getDF() { return df
; }
1013 DLList::Iterator
iterDF() { return df
.iterator(); }
1015 static inline BasicBlock
*get(Iterator
&);
1016 static inline BasicBlock
*get(Graph::Node
*);
1019 Graph::Node cfg
; // first edge is branch *taken* (the ELSE branch)
1028 Instruction
*joinAt
; // for quick reference
1030 bool explicitCont
; // loop headers: true if loop contains continue stmts
1040 unsigned int numInsns
;
1046 void splitCommon(Instruction
*, BasicBlock
*, bool attach
);
1052 Function(Program
*, const char *name
, uint32_t label
);
1055 static inline Function
*get(Graph::Node
*node
);
1057 inline Program
*getProgram() const { return prog
; }
1058 inline const char *getName() const { return name
; }
1059 inline int getId() const { return id
; }
1060 inline uint32_t getLabel() const { return label
; }
1063 void printLiveIntervals() const;
1064 void printCFGraph(const char *filePath
);
1066 bool setEntry(BasicBlock
*);
1067 bool setExit(BasicBlock
*);
1069 unsigned int orderInstructions(ArrayList
&);
1071 inline void add(BasicBlock
*bb
, int& id
) { allBBlocks
.insert(bb
, id
); }
1072 inline void add(Instruction
*insn
, int& id
) { allInsns
.insert(insn
, id
); }
1073 inline void add(LValue
*lval
, int& id
) { allLValues
.insert(lval
, id
); }
1075 inline LValue
*getLValue(int id
);
1077 void buildLiveSets();
1078 void buildDefSets();
1079 bool convertToSSA();
1082 std::deque
<ValueDef
> ins
;
1083 std::deque
<ValueRef
> outs
;
1084 std::deque
<Value
*> clobbers
;
1087 Graph::Node
*cfgExit
;
1089 Graph::Node call
; // node in the call graph
1091 BasicBlock
**bbArray
; // BBs in emission order
1094 unsigned int loopNestingBound
;
1102 uint32_t tlsBase
; // base address for l[] space (if no stack pointer is used)
1105 ArrayList allBBlocks
;
1107 ArrayList allLValues
;
1110 void buildLiveSetsPreSSA(BasicBlock
*, const int sequence
);
1111 void buildDefSetsPreSSA(BasicBlock
*bb
, const int seq
);
1116 const char *const name
;
1123 CG_STAGE_SSA
, // expected directly before register allocation
1133 TYPE_TESSELLATION_CONTROL
,
1134 TYPE_TESSELLATION_EVAL
,
1140 Program(Type type
, Target
*targ
);
1145 Type
getType() const { return progType
; }
1147 inline void add(Function
*fn
, int& id
) { allFuncs
.insert(fn
, id
); }
1148 inline void del(Function
*fn
, int& id
) { allFuncs
.remove(id
); }
1149 inline void add(Value
*rval
, int& id
) { allRValues
.insert(rval
, id
); }
1151 bool makeFromTGSI(struct nv50_ir_prog_info
*);
1152 bool makeFromSM4(struct nv50_ir_prog_info
*);
1153 bool convertToSSA();
1154 bool optimizeSSA(int level
);
1155 bool optimizePostRA(int level
);
1156 bool registerAllocation();
1157 bool emitBinary(struct nv50_ir_prog_info
*);
1159 const Target
*getTarget() const { return target
; }
1162 void emitSymbolTable(struct nv50_ir_prog_info
*);
1172 ArrayList allRValues
;
1176 uint32_t tlsSize
; // size required for FILE_MEMORY_LOCAL
1180 MemoryPool mem_Instruction
;
1181 MemoryPool mem_CmpInstruction
;
1182 MemoryPool mem_TexInstruction
;
1183 MemoryPool mem_FlowInstruction
;
1184 MemoryPool mem_LValue
;
1185 MemoryPool mem_Symbol
;
1186 MemoryPool mem_ImmediateValue
;
1191 void *targetPriv
; // e.g. to carry information between passes
1193 const struct nv50_ir_prog_info
*driver
; // for driver configuration
1195 void releaseInstruction(Instruction
*);
1196 void releaseValue(Value
*);
1199 // TODO: add const version
1203 bool run(Program
*, bool ordered
= false, bool skipPhi
= false);
1204 bool run(Function
*, bool ordered
= false, bool skipPhi
= false);
1207 // return false to continue with next entity on next higher level
1208 virtual bool visit(Function
*) { return true; }
1209 virtual bool visit(BasicBlock
*) { return true; }
1210 virtual bool visit(Instruction
*) { return false; }
1212 bool doRun(Program
*, bool ordered
, bool skipPhi
);
1213 bool doRun(Function
*, bool ordered
, bool skipPhi
);
1221 // =============================================================================
1223 #include "codegen/nv50_ir_inlines.h"
1225 } // namespace nv50_ir
1227 #endif // __NV50_IR_H__