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 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
33 #include "nv50_ir_util.h"
34 #include "nv50_ir_graph.h"
36 #include "nv50_ir_driver.h"
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
, // simple copy, no modifiers allowed
58 OP_SAD
, // abs(src0 - src1) + src2
69 OP_SAT
, // CLAMP(f32, 0.0, 1.0)
74 OP_SET_AND
, // dst = (src0 CMP src1) & src2
78 OP_SELP
, // dst = src2 ? src0 : src1
79 OP_SLCT
, // dst = (src2 CMP 0) ? src0 : src1
86 OP_EXP
, // exponential (base M_E)
87 OP_LOG
, // natural logarithm
100 OP_BRKPT
, // breakpoint (not related to loops)
101 OP_JOINAT
, // push control flow convergence point
106 OP_VFETCH
, // indirection 0 in attribute space, indirection 1 is vertex base
107 OP_PFETCH
, // fetch base address of vertex src0 (immediate) [+ src1]
111 OP_EMIT
, // emit vertex
112 OP_RESTART
, // restart primitive
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
121 OP_SULD
, // surface load
122 OP_SUST
, // surface store
125 OP_RDSV
, // read system value
126 OP_WRSV
, // write system value
131 OP_POPCNT
, // bitcount(src0 & src1)
132 OP_INSBF
, // insert first src1[8:15] bits of src0 into src2 at src1[0:7]
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
153 TYPE_U64
, // 64 bit operations are only lowered after register allocation
165 CC_NEVER
= CC_FL
, // when used with FILE_FLAGS
168 CC_NOT_P
= CC_EQ
, // when used with FILE_PREDICATE
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
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
219 FILE_PREDICATE
, // boolean predicate
220 FILE_FLAGS
, // zero/sign/carry/overflow bits
222 LAST_REGISTER_FILE
= FILE_ADDRESS
,
241 TEX_TARGET_1D_SHADOW
,
242 TEX_TARGET_2D_SHADOW
,
243 TEX_TARGET_CUBE_SHADOW
,
246 TEX_TARGET_2D_MS_ARRAY
,
247 TEX_TARGET_CUBE_ARRAY
,
248 TEX_TARGET_1D_ARRAY_SHADOW
,
249 TEX_TARGET_2D_ARRAY_SHADOW
,
251 TEX_TARGET_RECT_SHADOW
,
252 TEX_TARGET_CUBE_ARRAY_SHADOW
,
264 SV_VERTEX_COUNT
, // gl_PatchVerticesIn
297 class CmpInstruction
;
298 class TexInstruction
;
299 class FlowInstruction
;
304 class ImmediateValue
;
309 int8_t fileIndex
; // signed, may be indirect for CONST[]
310 uint8_t size
; // this should match the Instruction type's size
311 DataType type
; // mainly for pretty printing
313 uint64_t u64
; // immediate values
323 int32_t offset
; // offset from 0 (base of address space)
324 int32_t id
; // register id (< 0 if virtual/unassigned, in units <= 4)
332 // precedence: NOT after SAT after NEG after ABS
333 #define NV50_IR_MOD_ABS (1 << 0)
334 #define NV50_IR_MOD_NEG (1 << 1)
335 #define NV50_IR_MOD_SAT (1 << 2)
336 #define NV50_IR_MOD_NOT (1 << 3)
337 #define NV50_IR_MOD_NEG_ABS (NV50_IR_MOD_NEG | NV50_IR_MOD_ABS)
339 #define NV50_IR_INTERP_MODE_MASK 0x3
340 #define NV50_IR_INTERP_LINEAR (0 << 0)
341 #define NV50_IR_INTERP_PERSPECTIVE (1 << 0)
342 #define NV50_IR_INTERP_FLAT (2 << 0)
343 #define NV50_IR_INTERP_SC (3 << 0) // what exactly is that ?
344 #define NV50_IR_INTERP_SAMPLE_MASK 0xc
345 #define NV50_IR_INTERP_DEFAULT (0 << 2)
346 #define NV50_IR_INTERP_CENTROID (1 << 2)
347 #define NV50_IR_INTERP_OFFSET (2 << 2)
348 #define NV50_IR_INTERP_SAMPLEID (3 << 2)
350 // do we really want this to be a class ?
354 Modifier() : bits(0) { }
355 Modifier(unsigned int m
) : bits(m
) { }
356 Modifier(operation op
);
358 // @return new Modifier applying a after b (asserts if unrepresentable)
359 Modifier
operator*(const Modifier
) const;
360 Modifier
operator*=(const Modifier m
) { *this = *this * m
; return *this; }
361 Modifier
operator==(const Modifier m
) const { return m
.bits
== bits
; }
362 Modifier
operator!=(const Modifier m
) const { return m
.bits
!= bits
; }
364 inline Modifier
operator&(const Modifier m
) const { return bits
& m
.bits
; }
365 inline Modifier
operator|(const Modifier m
) const { return bits
| m
.bits
; }
366 inline Modifier
operator^(const Modifier m
) const { return bits
^ m
.bits
; }
368 operation
getOp() const;
370 inline int neg() const { return (bits
& NV50_IR_MOD_NEG
) ? 1 : 0; }
371 inline int abs() const { return (bits
& NV50_IR_MOD_ABS
) ? 1 : 0; }
373 inline operator bool() const { return bits
? true : false; }
375 void applyTo(ImmediateValue
&imm
) const;
377 int print(char *buf
, size_t size
) const;
386 ValueRef(Value
* = NULL
);
387 ValueRef(const ValueRef
&);
390 inline bool exists() const { return value
!= NULL
; }
393 void set(const ValueRef
&);
394 inline Value
*get() const { return value
; }
395 inline Value
*rep() const;
397 inline Instruction
*getInsn() const { return insn
; }
398 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
400 inline bool isIndirect(int dim
) const { return indirect
[dim
] >= 0; }
401 inline const ValueRef
*getIndirect(int dim
) const;
403 inline DataFile
getFile() const;
404 inline unsigned getSize() const;
406 // SSA: return eventual (traverse MOVs) literal value, if it exists
407 bool getImmediate(ImmediateValue
&) const;
411 int8_t indirect
[2]; // >= 0 if relative to lvalue in insn->src(indirect[i])
414 bool usedAsPtr
; // for printing
424 ValueDef(Value
* = NULL
);
425 ValueDef(const ValueDef
&);
428 inline bool exists() const { return value
!= NULL
; }
430 inline Value
*get() const { return value
; }
431 inline Value
*rep() const;
433 bool mayReplace(const ValueRef
&);
434 void replace(const ValueRef
&, bool doSet
); // replace all uses of the old value
436 inline Instruction
*getInsn() const { return insn
; }
437 inline void setInsn(Instruction
*inst
) { insn
= inst
; }
439 inline DataFile
getFile() const;
440 inline unsigned getSize() const;
442 inline void setSSA(LValue
*);
443 inline const LValue
*preSSA() const;
446 Value
*value
; // should make this LValue * ...
447 LValue
*origin
; // pre SSA value
457 virtual Value
*clone(ClonePolicy
<Function
>&) const = 0;
459 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const = 0;
461 virtual bool equals(const Value
*, bool strict
= false) const;
462 virtual bool interfers(const Value
*) const;
463 virtual bool isUniform() const { return true; }
465 inline Value
*rep() const { return join
; }
467 inline Instruction
*getUniqueInsn() const;
468 inline Instruction
*getInsn() const; // use when uniqueness is certain
470 inline int refCount() { return uses
.size(); }
472 inline LValue
*asLValue();
473 inline Symbol
*asSym();
474 inline ImmediateValue
*asImm();
475 inline const Symbol
*asSym() const;
476 inline const ImmediateValue
*asImm() const;
478 inline bool inFile(DataFile f
) { return reg
.file
== f
; }
480 static inline Value
*get(Iterator
&);
482 std::list
<ValueRef
*> uses
;
483 std::list
<ValueDef
*> defs
;
484 typedef std::list
<ValueRef
*>::iterator UseIterator
;
485 typedef std::list
<ValueRef
*>::const_iterator UseCIterator
;
486 typedef std::list
<ValueDef
*>::iterator DefIterator
;
487 typedef std::list
<ValueDef
*>::const_iterator DefCIterator
;
492 // TODO: these should be in LValue:
497 class LValue
: public Value
500 LValue(Function
*, DataFile file
);
501 LValue(Function
*, LValue
*);
504 virtual bool isUniform() const;
506 virtual LValue
*clone(ClonePolicy
<Function
>&) const;
508 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
511 unsigned compMask
: 8; // compound/component mask
512 unsigned compound
: 1; // used by RA, value involved in split/merge
514 unsigned fixedReg
: 1; // set & used by RA, earlier just use (id < 0)
515 unsigned noSpill
: 1; // do not spill (e.g. if spill temporary already)
518 class Symbol
: public Value
521 Symbol(Program
*, DataFile file
= FILE_MEMORY_CONST
, ubyte fileIdx
= 0);
524 virtual Symbol
*clone(ClonePolicy
<Function
>&) const;
526 virtual bool equals(const Value
*that
, bool strict
) const;
528 virtual bool isUniform() const;
530 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
532 // print with indirect values
533 int print(char *, size_t, Value
*, Value
*, DataType ty
= TYPE_NONE
) const;
535 inline void setFile(DataFile file
, ubyte fileIndex
= 0)
538 reg
.fileIndex
= fileIndex
;
541 inline void setOffset(int32_t offset
);
542 inline void setAddress(Symbol
*base
, int32_t offset
);
543 inline void setSV(SVSemantic sv
, uint32_t idx
= 0);
545 inline const Symbol
*getBase() const { return baseSym
; }
548 Symbol
*baseSym
; // array base for Symbols representing array elements
551 class ImmediateValue
: public Value
555 ImmediateValue(Program
*, uint32_t);
556 ImmediateValue(Program
*, float);
557 ImmediateValue(Program
*, double);
558 // NOTE: not added to program with
559 ImmediateValue(const ImmediateValue
*, DataType ty
);
560 ~ImmediateValue() { };
562 virtual ImmediateValue
*clone(ClonePolicy
<Function
>&) const;
564 virtual bool equals(const Value
*that
, bool strict
) const;
566 // these only work if 'type' is valid (we mostly use untyped literals):
567 bool isInteger(const int ival
) const; // ival is cast to this' type
568 bool isNegative() const;
573 // for constant folding:
574 ImmediateValue
operator+(const ImmediateValue
&) const;
575 ImmediateValue
operator-(const ImmediateValue
&) const;
576 ImmediateValue
operator*(const ImmediateValue
&) const;
577 ImmediateValue
operator/(const ImmediateValue
&) const;
579 ImmediateValue
& operator=(const ImmediateValue
&); // only sets value !
581 bool compare(CondCode cc
, float fval
) const;
583 virtual int print(char *, size_t, DataType ty
= TYPE_NONE
) const;
590 Instruction(Function
*, operation
, DataType
);
591 virtual ~Instruction();
593 virtual Instruction
*clone(ClonePolicy
<Function
>&,
594 Instruction
* = NULL
) const;
596 void setDef(int i
, Value
*);
597 void setSrc(int s
, Value
*);
598 void setSrc(int s
, const ValueRef
&);
599 void swapSources(int a
, int b
);
600 bool setIndirect(int s
, int dim
, Value
*);
602 inline ValueRef
& src(int s
) { return srcs
[s
]; }
603 inline ValueDef
& def(int s
) { return defs
[s
]; }
604 inline const ValueRef
& src(int s
) const { return srcs
[s
]; }
605 inline const ValueDef
& def(int s
) const { return defs
[s
]; }
607 inline Value
*getDef(int d
) const { return defs
[d
].get(); }
608 inline Value
*getSrc(int s
) const { return srcs
[s
].get(); }
609 inline Value
*getIndirect(int s
, int dim
) const;
611 inline bool defExists(unsigned d
) const
613 return d
< defs
.size() && defs
[d
].exists();
615 inline bool srcExists(unsigned s
) const
617 return s
< srcs
.size() && srcs
[s
].exists();
620 inline bool constrainedDefs() const;
622 bool setPredicate(CondCode ccode
, Value
*);
623 inline Value
*getPredicate() const;
624 bool writesPredicate() const;
625 inline bool isPredicated() const { return predSrc
>= 0; }
627 inline void setFlagsSrc(int s
, Value
*);
628 inline void setFlagsDef(int d
, Value
*);
630 unsigned int defCount() const { return defs
.size(); };
631 unsigned int defCount(unsigned int mask
, bool singleFile
= false) const;
632 unsigned int srcCount() const { return srcs
.size(); };
633 unsigned int srcCount(unsigned int mask
, bool singleFile
= false) const;
635 // save & remove / set indirect[0,1] and predicate source
636 void takeExtraSources(int s
, Value
*[3]);
637 void putExtraSources(int s
, Value
*[3]);
639 inline void setType(DataType type
) { dType
= sType
= type
; }
641 inline void setType(DataType dtype
, DataType stype
)
647 inline bool isPseudo() const { return op
< OP_MOV
; }
650 bool isCommutationLegal(const Instruction
*) const; // must be adjacent !
651 bool isActionEqual(const Instruction
*) const;
652 bool isResultEqual(const Instruction
*) const;
656 inline CmpInstruction
*asCmp();
657 inline TexInstruction
*asTex();
658 inline FlowInstruction
*asFlow();
659 inline const TexInstruction
*asTex() const;
660 inline const CmpInstruction
*asCmp() const;
661 inline const FlowInstruction
*asFlow() const;
667 int serial
; // CFG order
670 DataType dType
; // destination or defining type
671 DataType sType
; // source or secondary type
676 uint8_t subOp
; // quadop, 1 for mul-high, etc.
678 unsigned encSize
: 4; // encoding size in bytes
679 unsigned saturate
: 1; // to [0.0f, 1.0f]
680 unsigned join
: 1; // converge control flow (use OP_JOIN until end)
681 unsigned fixed
: 1; // prevent dead code elimination
682 unsigned terminator
: 1; // end of basic block
684 unsigned ftz
: 1; // flush denormal to zero
685 unsigned dnz
: 1; // denormals, NaN are zero
686 unsigned ipa
: 4; // interpolation mode
688 unsigned perPatch
: 1;
689 unsigned exit
: 1; // terminate program after insn
691 int8_t postFactor
; // MUL/DIV(if < 0) by 1 << postFactor
700 std::deque
<ValueDef
> defs
; // no gaps !
701 std::deque
<ValueRef
> srcs
; // no gaps !
703 // instruction specific methods:
704 // (don't want to subclass, would need more constructors and memory pools)
706 inline void setInterpolate(unsigned int mode
) { ipa
= mode
; }
708 unsigned int getInterpMode() const { return ipa
& 0x3; }
709 unsigned int getSampleMode() const { return ipa
& 0xc; }
726 class TexInstruction
: public Instruction
732 Target(TexTarget targ
= TEX_TARGET_2D
) : target(targ
) { }
734 const char *getName() const { return descTable
[target
].name
; }
735 unsigned int getArgCount() const { return descTable
[target
].argc
; }
736 unsigned int getDim() const { return descTable
[target
].dim
; }
737 int isArray() const { return descTable
[target
].array
? 1 : 0; }
738 int isCube() const { return descTable
[target
].cube
? 1 : 0; }
739 int isShadow() const { return descTable
[target
].shadow
? 1 : 0; }
741 Target
& operator=(TexTarget targ
)
743 assert(targ
< TEX_TARGET_COUNT
);
747 inline bool operator==(TexTarget targ
) const { return target
== targ
; }
760 static const struct Desc descTable
[TEX_TARGET_COUNT
];
763 enum TexTarget target
;
767 TexInstruction(Function
*, operation
);
768 virtual ~TexInstruction();
770 virtual TexInstruction
*clone(ClonePolicy
<Function
>&,
771 Instruction
* = NULL
) const;
773 inline void setTexture(Target targ
, uint8_t r
, uint8_t s
)
780 inline Value
*getIndirectR() const;
781 inline Value
*getIndirectS() const;
795 bool liveOnly
; // only execute on live pixels of a quad (optimization)
799 int8_t useOffsets
; // 0, 1, or 4 for textureGatherOffsets
809 class CmpInstruction
: public Instruction
812 CmpInstruction(Function
*, operation
);
814 virtual CmpInstruction
*clone(ClonePolicy
<Function
>&,
815 Instruction
* = NULL
) const;
817 void setCondition(CondCode cond
) { setCond
= cond
; }
818 CondCode
getCondition() const { return setCond
; }
824 class FlowInstruction
: public Instruction
827 FlowInstruction(Function
*, operation
, void *target
);
829 virtual FlowInstruction
*clone(ClonePolicy
<Function
>&,
830 Instruction
* = NULL
) const;
833 unsigned allWarp
: 1;
834 unsigned absolute
: 1;
836 unsigned builtin
: 1; // true for calls to emulation code
848 BasicBlock(Function
*);
851 BasicBlock
*clone(ClonePolicy
<Function
>&) const;
853 inline int getId() const { return id
; }
854 inline unsigned int getInsnCount() const { return numInsns
; }
855 inline bool isTerminated() const { return exit
&& exit
->terminator
; }
857 bool dominatedBy(BasicBlock
*bb
);
858 inline bool reachableBy(BasicBlock
*by
, BasicBlock
*term
);
860 // returns mask of conditional out blocks
861 // e.g. 3 for IF { .. } ELSE { .. } ENDIF, 1 for IF { .. } ENDIF
862 unsigned int initiatesSimpleConditional() const;
865 Function
*getFunction() const { return func
; }
866 Program
*getProgram() const { return program
; }
868 Instruction
*getEntry() const { return entry
; } // first non-phi instruction
869 Instruction
*getPhi() const { return phi
; }
870 Instruction
*getFirst() const { return phi
? phi
: entry
; }
871 Instruction
*getExit() const { return exit
; }
873 void insertHead(Instruction
*);
874 void insertTail(Instruction
*);
875 void insertBefore(Instruction
*, Instruction
*);
876 void insertAfter(Instruction
*, Instruction
*);
877 void remove(Instruction
*);
878 void permuteAdjacent(Instruction
*, Instruction
*);
880 BasicBlock
*idom() const;
882 // NOTE: currently does not rebuild the dominator tree
883 BasicBlock
*splitBefore(Instruction
*, bool attach
= true);
884 BasicBlock
*splitAfter(Instruction
*, bool attach
= true);
886 DLList
& getDF() { return df
; }
887 DLList::Iterator
iterDF() { return df
.iterator(); }
889 static inline BasicBlock
*get(Iterator
&);
890 static inline BasicBlock
*get(Graph::Node
*);
893 Graph::Node cfg
; // first edge is branch *taken* (the ELSE branch)
902 Instruction
*joinAt
; // for quick reference
904 bool explicitCont
; // loop headers: true if loop contains continue stmts
914 unsigned int numInsns
;
920 void splitCommon(Instruction
*, BasicBlock
*, bool attach
);
926 Function(Program
*, const char *name
, uint32_t label
);
929 static inline Function
*get(Graph::Node
*node
);
931 inline Program
*getProgram() const { return prog
; }
932 inline const char *getName() const { return name
; }
933 inline int getId() const { return id
; }
934 inline uint32_t getLabel() const { return label
; }
937 void printLiveIntervals() const;
938 void printCFGraph(const char *filePath
);
940 bool setEntry(BasicBlock
*);
941 bool setExit(BasicBlock
*);
943 unsigned int orderInstructions(ArrayList
&);
945 inline void add(BasicBlock
*bb
, int& id
) { allBBlocks
.insert(bb
, id
); }
946 inline void add(Instruction
*insn
, int& id
) { allInsns
.insert(insn
, id
); }
947 inline void add(LValue
*lval
, int& id
) { allLValues
.insert(lval
, id
); }
949 inline LValue
*getLValue(int id
);
951 void buildLiveSets();
956 std::deque
<ValueDef
> ins
;
957 std::deque
<ValueRef
> outs
;
958 std::deque
<Value
*> clobbers
;
961 Graph::Node
*cfgExit
;
963 Graph::Node call
; // node in the call graph
965 BasicBlock
**bbArray
; // BBs in emission order
968 unsigned int loopNestingBound
;
976 uint32_t tlsBase
; // base address for l[] space (if no stack pointer is used)
979 ArrayList allBBlocks
;
981 ArrayList allLValues
;
984 void buildLiveSetsPreSSA(BasicBlock
*, const int sequence
);
985 void buildDefSetsPreSSA(BasicBlock
*bb
, const int seq
);
990 const char *const name
;
997 CG_STAGE_SSA
, // expected directly before register allocation
1007 TYPE_TESSELLATION_CONTROL
,
1008 TYPE_TESSELLATION_EVAL
,
1014 Program(Type type
, Target
*targ
);
1019 Type
getType() const { return progType
; }
1021 inline void add(Function
*fn
, int& id
) { allFuncs
.insert(fn
, id
); }
1022 inline void del(Function
*fn
, int& id
) { allFuncs
.remove(id
); }
1023 inline void add(Value
*rval
, int& id
) { allRValues
.insert(rval
, id
); }
1025 bool makeFromTGSI(struct nv50_ir_prog_info
*);
1026 bool makeFromSM4(struct nv50_ir_prog_info
*);
1027 bool convertToSSA();
1028 bool optimizeSSA(int level
);
1029 bool optimizePostRA(int level
);
1030 bool registerAllocation();
1031 bool emitBinary(struct nv50_ir_prog_info
*);
1033 const Target
*getTarget() const { return target
; }
1036 void emitSymbolTable(struct nv50_ir_prog_info
*);
1046 ArrayList allRValues
;
1050 uint32_t tlsSize
; // size required for FILE_MEMORY_LOCAL
1054 MemoryPool mem_Instruction
;
1055 MemoryPool mem_CmpInstruction
;
1056 MemoryPool mem_TexInstruction
;
1057 MemoryPool mem_FlowInstruction
;
1058 MemoryPool mem_LValue
;
1059 MemoryPool mem_Symbol
;
1060 MemoryPool mem_ImmediateValue
;
1064 void releaseInstruction(Instruction
*);
1065 void releaseValue(Value
*);
1068 // TODO: add const version
1072 bool run(Program
*, bool ordered
= false, bool skipPhi
= false);
1073 bool run(Function
*, bool ordered
= false, bool skipPhi
= false);
1076 // return false to continue with next entity on next higher level
1077 virtual bool visit(Function
*) { return true; }
1078 virtual bool visit(BasicBlock
*) { return true; }
1079 virtual bool visit(Instruction
*) { return false; }
1081 bool doRun(Program
*, bool ordered
, bool skipPhi
);
1082 bool doRun(Function
*, bool ordered
, bool skipPhi
);
1090 // =============================================================================
1092 #include "nv50_ir_inlines.h"
1094 } // namespace nv50_ir
1096 #endif // __NV50_IR_H__