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.
23 #include "codegen/nv50_ir.h"
24 #include "codegen/nv50_ir_target.h"
25 #include "codegen/nv50_ir_driver.h"
28 #include "nouveau_debug.h"
29 #include "nv50/nv50_program.h"
34 Modifier::Modifier(operation op
)
37 case OP_NEG
: bits
= NV50_IR_MOD_NEG
; break;
38 case OP_ABS
: bits
= NV50_IR_MOD_ABS
; break;
39 case OP_SAT
: bits
= NV50_IR_MOD_SAT
; break;
40 case OP_NOT
: bits
= NV50_IR_MOD_NOT
; break;
47 Modifier
Modifier::operator*(const Modifier m
) const
52 if (this->bits
& NV50_IR_MOD_ABS
)
53 b
&= ~NV50_IR_MOD_NEG
;
55 a
= (this->bits
^ b
) & (NV50_IR_MOD_NOT
| NV50_IR_MOD_NEG
);
56 c
= (this->bits
| m
.bits
) & (NV50_IR_MOD_ABS
| NV50_IR_MOD_SAT
);
58 return Modifier(a
| c
);
61 ValueRef::ValueRef(Value
*v
) : value(NULL
), insn(NULL
)
69 ValueRef::ValueRef(const ValueRef
& ref
) : value(NULL
), insn(ref
.insn
)
72 usedAsPtr
= ref
.usedAsPtr
;
80 bool ValueRef::getImmediate(ImmediateValue
&imm
) const
82 const ValueRef
*src
= this;
84 DataType type
= src
->insn
->sType
;
88 if (src
->insn
->sType
!= type
)
92 if (src
->getFile() == FILE_IMMEDIATE
) {
93 imm
= *(src
->value
->asImm());
94 // The immediate's type isn't required to match its use, it's
95 // more of a hint; applying a modifier makes use of that hint.
101 Instruction
*insn
= src
->value
->getUniqueInsn();
103 if (insn
&& insn
->op
== OP_MOV
) {
106 WARN("OP_MOV with modifier encountered !\n");
114 ValueDef::ValueDef(Value
*v
) : value(NULL
), insn(NULL
)
119 ValueDef::ValueDef(const ValueDef
& def
) : value(NULL
), insn(NULL
)
124 ValueDef::~ValueDef()
130 ValueRef::set(const ValueRef
&ref
)
132 this->set(ref
.get());
134 indirect
[0] = ref
.indirect
[0];
135 indirect
[1] = ref
.indirect
[1];
139 ValueRef::set(Value
*refVal
)
144 value
->uses
.remove(this);
146 refVal
->uses
.push_back(this);
152 ValueDef::set(Value
*defVal
)
157 value
->defs
.remove(this);
159 defVal
->defs
.push_back(this);
164 // Check if we can replace this definition's value by the value in @rep,
165 // including the source modifiers, i.e. make sure that all uses support
168 ValueDef::mayReplace(const ValueRef
&rep
)
173 if (!insn
|| !insn
->bb
) // Unbound instruction ?
176 const Target
*target
= insn
->bb
->getProgram()->getTarget();
178 for (Value::UseIterator it
= value
->uses
.begin(); it
!= value
->uses
.end();
180 Instruction
*insn
= (*it
)->getInsn();
183 for (int i
= 0; insn
->srcExists(i
); ++i
) {
184 if (insn
->src(i
).get() == value
) {
185 // If there are multiple references to us we'd have to check if the
186 // combination of mods is still supported, but just bail for now.
187 if (&insn
->src(i
) != (*it
))
192 assert(s
>= 0); // integrity of uses list
194 if (!target
->isModSupported(insn
, s
, rep
.mod
))
201 ValueDef::replace(const ValueRef
&repVal
, bool doSet
)
203 assert(mayReplace(repVal
));
205 if (value
== repVal
.get())
208 while (!value
->uses
.empty()) {
209 ValueRef
*ref
= value
->uses
.front();
210 ref
->set(repVal
.get());
211 ref
->mod
*= repVal
.mod
;
221 memset(®
, 0, sizeof(reg
));
225 LValue::LValue(Function
*fn
, DataFile file
)
228 reg
.size
= (file
!= FILE_PREDICATE
) ? 4 : 1;
237 fn
->add(this, this->id
);
240 LValue::LValue(Function
*fn
, LValue
*lval
)
244 reg
.file
= lval
->reg
.file
;
245 reg
.size
= lval
->reg
.size
;
254 fn
->add(this, this->id
);
258 LValue::clone(ClonePolicy
<Function
>& pol
) const
260 LValue
*that
= new_LValue(pol
.context(), reg
.file
);
262 pol
.set
<Value
>(this, that
);
264 that
->reg
.size
= this->reg
.size
;
265 that
->reg
.type
= this->reg
.type
;
266 that
->reg
.data
= this->reg
.data
;
272 LValue::isUniform() const
276 Instruction
*insn
= getInsn();
277 // let's not try too hard here for now ...
278 return !insn
->srcExists(1) && insn
->getSrc(0)->isUniform();
281 Symbol::Symbol(Program
*prog
, DataFile f
, ubyte fidx
)
286 reg
.fileIndex
= fidx
;
289 prog
->add(this, this->id
);
293 Symbol::clone(ClonePolicy
<Function
>& pol
) const
295 Program
*prog
= pol
.context()->getProgram();
297 Symbol
*that
= new_Symbol(prog
, reg
.file
, reg
.fileIndex
);
299 pol
.set
<Value
>(this, that
);
301 that
->reg
.size
= this->reg
.size
;
302 that
->reg
.type
= this->reg
.type
;
303 that
->reg
.data
= this->reg
.data
;
305 that
->baseSym
= this->baseSym
;
311 Symbol::isUniform() const
314 reg
.file
!= FILE_SYSTEM_VALUE
&&
315 reg
.file
!= FILE_MEMORY_LOCAL
&&
316 reg
.file
!= FILE_SHADER_INPUT
;
319 ImmediateValue::ImmediateValue(Program
*prog
, uint32_t uval
)
321 memset(®
, 0, sizeof(reg
));
323 reg
.file
= FILE_IMMEDIATE
;
329 prog
->add(this, this->id
);
332 ImmediateValue::ImmediateValue(Program
*prog
, float fval
)
334 memset(®
, 0, sizeof(reg
));
336 reg
.file
= FILE_IMMEDIATE
;
342 prog
->add(this, this->id
);
345 ImmediateValue::ImmediateValue(Program
*prog
, double dval
)
347 memset(®
, 0, sizeof(reg
));
349 reg
.file
= FILE_IMMEDIATE
;
355 prog
->add(this, this->id
);
358 ImmediateValue::ImmediateValue(const ImmediateValue
*proto
, DataType ty
)
363 reg
.size
= typeSizeof(ty
);
367 ImmediateValue::clone(ClonePolicy
<Function
>& pol
) const
369 Program
*prog
= pol
.context()->getProgram();
370 ImmediateValue
*that
= new_ImmediateValue(prog
, 0u);
372 pol
.set
<Value
>(this, that
);
374 that
->reg
.size
= this->reg
.size
;
375 that
->reg
.type
= this->reg
.type
;
376 that
->reg
.data
= this->reg
.data
;
382 ImmediateValue::isInteger(const int i
) const
386 return reg
.data
.s8
== i
;
388 return reg
.data
.u8
== i
;
390 return reg
.data
.s16
== i
;
392 return reg
.data
.u16
== i
;
395 return reg
.data
.s32
== i
; // as if ...
397 return reg
.data
.f32
== static_cast<float>(i
);
399 return reg
.data
.f64
== static_cast<double>(i
);
406 ImmediateValue::isNegative() const
409 case TYPE_S8
: return reg
.data
.s8
< 0;
410 case TYPE_S16
: return reg
.data
.s16
< 0;
412 case TYPE_U32
: return reg
.data
.s32
< 0;
413 case TYPE_F32
: return reg
.data
.u32
& (1 << 31);
414 case TYPE_F64
: return reg
.data
.u64
& (1ULL << 63);
421 ImmediateValue::isPow2() const
426 case TYPE_U32
: return util_is_power_of_two(reg
.data
.u32
);
433 ImmediateValue::applyLog2()
439 assert(!this->isNegative());
444 reg
.data
.u32
= util_logbase2(reg
.data
.u32
);
447 reg
.data
.f32
= log2f(reg
.data
.f32
);
450 reg
.data
.f64
= log2(reg
.data
.f64
);
459 ImmediateValue::compare(CondCode cc
, float fval
) const
461 if (reg
.type
!= TYPE_F32
)
462 ERROR("immediate value is not of type f32");
464 switch (static_cast<CondCode
>(cc
& 7)) {
465 case CC_TR
: return true;
466 case CC_FL
: return false;
467 case CC_LT
: return reg
.data
.f32
< fval
;
468 case CC_LE
: return reg
.data
.f32
<= fval
;
469 case CC_GT
: return reg
.data
.f32
> fval
;
470 case CC_GE
: return reg
.data
.f32
>= fval
;
471 case CC_EQ
: return reg
.data
.f32
== fval
;
472 case CC_NE
: return reg
.data
.f32
!= fval
;
480 ImmediateValue::operator=(const ImmediateValue
&that
)
482 this->reg
= that
.reg
;
487 Value::interfers(const Value
*that
) const
491 if (that
->reg
.file
!= reg
.file
|| that
->reg
.fileIndex
!= reg
.fileIndex
)
497 idA
= this->join
->reg
.data
.offset
;
498 idB
= that
->join
->reg
.data
.offset
;
500 idA
= this->join
->reg
.data
.id
* MIN2(this->reg
.size
, 4);
501 idB
= that
->join
->reg
.data
.id
* MIN2(that
->reg
.size
, 4);
505 return (idA
+ this->reg
.size
> idB
);
508 return (idB
+ that
->reg
.size
> idA
);
514 Value::equals(const Value
*that
, bool strict
) const
519 if (that
->reg
.file
!= reg
.file
|| that
->reg
.fileIndex
!= reg
.fileIndex
)
521 if (that
->reg
.size
!= this->reg
.size
)
524 if (that
->reg
.data
.id
!= this->reg
.data
.id
)
531 ImmediateValue::equals(const Value
*that
, bool strict
) const
533 const ImmediateValue
*imm
= that
->asImm();
536 return reg
.data
.u64
== imm
->reg
.data
.u64
;
540 Symbol::equals(const Value
*that
, bool strict
) const
542 if (reg
.file
!= that
->reg
.file
|| reg
.fileIndex
!= that
->reg
.fileIndex
)
544 assert(that
->asSym());
546 if (this->baseSym
!= that
->asSym()->baseSym
)
549 if (reg
.file
== FILE_SYSTEM_VALUE
)
550 return (this->reg
.data
.sv
.sv
== that
->reg
.data
.sv
.sv
&&
551 this->reg
.data
.sv
.index
== that
->reg
.data
.sv
.index
);
552 return this->reg
.data
.offset
== that
->reg
.data
.offset
;
555 void Instruction::init()
585 Instruction::Instruction()
590 dType
= sType
= TYPE_F32
;
596 Instruction::Instruction(Function
*fn
, operation opr
, DataType ty
)
606 Instruction::~Instruction()
609 Function
*fn
= bb
->getFunction();
611 fn
->allInsns
.remove(id
);
614 for (int s
= 0; srcExists(s
); ++s
)
616 // must unlink defs too since the list pointers will get deallocated
617 for (int d
= 0; defExists(d
); ++d
)
622 Instruction::setDef(int i
, Value
*val
)
624 int size
= defs
.size();
628 defs
[size
++].setInsn(this);
634 Instruction::setSrc(int s
, Value
*val
)
636 int size
= srcs
.size();
640 srcs
[size
++].setInsn(this);
646 Instruction::setSrc(int s
, const ValueRef
& ref
)
648 setSrc(s
, ref
.get());
649 srcs
[s
].mod
= ref
.mod
;
653 Instruction::swapSources(int a
, int b
)
655 Value
*value
= srcs
[a
].get();
656 Modifier m
= srcs
[a
].mod
;
664 static inline void moveSourcesAdjustIndex(int8_t &index
, int s
, int delta
)
669 if ((delta
< 0) && (index
>= (s
+ delta
)))
673 // Moves sources [@s,last_source] by @delta.
674 // If @delta < 0, sources [@s - abs(@delta), @s) are erased.
676 Instruction::moveSources(const int s
, const int delta
)
680 assert(s
+ delta
>= 0);
684 for (k
= 0; srcExists(k
); ++k
) {
685 for (int i
= 0; i
< 2; ++i
)
686 moveSourcesAdjustIndex(src(k
).indirect
[i
], s
, delta
);
688 moveSourcesAdjustIndex(predSrc
, s
, delta
);
689 moveSourcesAdjustIndex(flagsSrc
, s
, delta
);
691 TexInstruction
*tex
= asTex();
692 moveSourcesAdjustIndex(tex
->tex
.rIndirectSrc
, s
, delta
);
693 moveSourcesAdjustIndex(tex
->tex
.sIndirectSrc
, s
, delta
);
698 for (int p
= k
+ delta
; k
>= s
; --k
, --p
)
702 for (p
= s
; p
< k
; ++p
)
703 setSrc(p
+ delta
, src(p
));
704 for (; (p
+ delta
) < k
; ++p
)
705 setSrc(p
+ delta
, NULL
);
710 Instruction::takeExtraSources(int s
, Value
*values
[3])
712 values
[0] = getIndirect(s
, 0);
714 setIndirect(s
, 0, NULL
);
716 values
[1] = getIndirect(s
, 1);
718 setIndirect(s
, 1, NULL
);
720 values
[2] = getPredicate();
722 setPredicate(cc
, NULL
);
726 Instruction::putExtraSources(int s
, Value
*values
[3])
729 setIndirect(s
, 0, values
[0]);
731 setIndirect(s
, 1, values
[1]);
733 setPredicate(cc
, values
[2]);
737 Instruction::clone(ClonePolicy
<Function
>& pol
, Instruction
*i
) const
740 i
= new_Instruction(pol
.context(), op
, dType
);
741 #ifndef NDEBUG // non-conformant assert, so this is required
742 assert(typeid(*i
) == typeid(*this));
745 pol
.set
<Instruction
>(this, i
);
753 i
->saturate
= saturate
;
761 i
->perPatch
= perPatch
;
763 i
->postFactor
= postFactor
;
765 for (int d
= 0; defExists(d
); ++d
)
766 i
->setDef(d
, pol
.get(getDef(d
)));
768 for (int s
= 0; srcExists(s
); ++s
) {
769 i
->setSrc(s
, pol
.get(getSrc(s
)));
770 i
->src(s
).mod
= src(s
).mod
;
774 i
->predSrc
= predSrc
;
775 i
->flagsDef
= flagsDef
;
776 i
->flagsSrc
= flagsSrc
;
782 Instruction::defCount(unsigned int mask
, bool singleFile
) const
787 unsigned int d
= ffs(mask
);
790 for (i
= d
--; defExists(i
); ++i
)
791 if (getDef(i
)->reg
.file
!= getDef(d
)->reg
.file
)
795 for (n
= 0, i
= 0; this->defExists(i
); ++i
, mask
>>= 1)
801 Instruction::srcCount(unsigned int mask
, bool singleFile
) const
806 unsigned int s
= ffs(mask
);
809 for (i
= s
--; srcExists(i
); ++i
)
810 if (getSrc(i
)->reg
.file
!= getSrc(s
)->reg
.file
)
814 for (n
= 0, i
= 0; this->srcExists(i
); ++i
, mask
>>= 1)
820 Instruction::setIndirect(int s
, int dim
, Value
*value
)
822 assert(this->srcExists(s
));
824 int p
= srcs
[s
].indirect
[dim
];
829 while (p
> 0 && !srcExists(p
- 1))
833 srcs
[p
].usedAsPtr
= (value
!= 0);
834 srcs
[s
].indirect
[dim
] = value
? p
: -1;
839 Instruction::setPredicate(CondCode ccode
, Value
*value
)
845 srcs
[predSrc
].set(NULL
);
852 predSrc
= srcs
.size();
853 while (predSrc
> 0 && !srcExists(predSrc
- 1))
857 setSrc(predSrc
, value
);
862 Instruction::writesPredicate() const
864 for (int d
= 0; defExists(d
); ++d
)
865 if (getDef(d
)->inFile(FILE_PREDICATE
) || getDef(d
)->inFile(FILE_FLAGS
))
871 insnCheckCommutationDefSrc(const Instruction
*a
, const Instruction
*b
)
873 for (int d
= 0; a
->defExists(d
); ++d
)
874 for (int s
= 0; b
->srcExists(s
); ++s
)
875 if (a
->getDef(d
)->interfers(b
->getSrc(s
)))
881 insnCheckCommutationDefDef(const Instruction
*a
, const Instruction
*b
)
883 for (int d
= 0; a
->defExists(d
); ++d
)
884 for (int c
= 0; b
->defExists(c
); ++c
)
885 if (a
->getDef(d
)->interfers(b
->getDef(c
)))
891 Instruction::isCommutationLegal(const Instruction
*i
) const
893 bool ret
= insnCheckCommutationDefDef(this, i
);
894 ret
= ret
&& insnCheckCommutationDefSrc(this, i
);
895 ret
= ret
&& insnCheckCommutationDefSrc(i
, this);
899 TexInstruction::TexInstruction(Function
*fn
, operation op
)
900 : Instruction(fn
, op
, TYPE_F32
)
902 memset(&tex
, 0, sizeof(tex
));
904 tex
.rIndirectSrc
= -1;
905 tex
.sIndirectSrc
= -1;
908 TexInstruction::~TexInstruction()
910 for (int c
= 0; c
< 3; ++c
) {
917 TexInstruction::clone(ClonePolicy
<Function
>& pol
, Instruction
*i
) const
919 TexInstruction
*tex
= (i
? static_cast<TexInstruction
*>(i
) :
920 new_TexInstruction(pol
.context(), op
));
922 Instruction::clone(pol
, tex
);
924 tex
->tex
= this->tex
;
927 for (unsigned int c
= 0; c
< tex
->tex
.target
.getDim(); ++c
) {
928 tex
->dPdx
[c
].set(dPdx
[c
]);
929 tex
->dPdy
[c
].set(dPdy
[c
]);
936 const struct TexInstruction::Target::Desc
TexInstruction::Target::descTable
[] =
938 { "1D", 1, 1, false, false, false },
939 { "2D", 2, 2, false, false, false },
940 { "2D_MS", 2, 3, false, false, false },
941 { "3D", 3, 3, false, false, false },
942 { "CUBE", 2, 3, false, true, false },
943 { "1D_SHADOW", 1, 1, false, false, true },
944 { "2D_SHADOW", 2, 2, false, false, true },
945 { "CUBE_SHADOW", 2, 3, false, true, true },
946 { "1D_ARRAY", 1, 2, true, false, false },
947 { "2D_ARRAY", 2, 3, true, false, false },
948 { "2D_MS_ARRAY", 2, 4, true, false, false },
949 { "CUBE_ARRAY", 2, 4, true, true, false },
950 { "1D_ARRAY_SHADOW", 1, 2, true, false, true },
951 { "2D_ARRAY_SHADOW", 2, 3, true, false, true },
952 { "RECT", 2, 2, false, false, false },
953 { "RECT_SHADOW", 2, 2, false, false, true },
954 { "CUBE_ARRAY_SHADOW", 2, 4, true, true, true },
955 { "BUFFER", 1, 1, false, false, false },
959 TexInstruction::setIndirectR(Value
*v
)
961 int p
= ((tex
.rIndirectSrc
< 0) && v
) ? srcs
.size() : tex
.rIndirectSrc
;
963 tex
.rIndirectSrc
= p
;
965 srcs
[p
].usedAsPtr
= !!v
;
970 TexInstruction::setIndirectS(Value
*v
)
972 int p
= ((tex
.sIndirectSrc
< 0) && v
) ? srcs
.size() : tex
.sIndirectSrc
;
974 tex
.sIndirectSrc
= p
;
976 srcs
[p
].usedAsPtr
= !!v
;
980 CmpInstruction::CmpInstruction(Function
*fn
, operation op
)
981 : Instruction(fn
, op
, TYPE_F32
)
987 CmpInstruction::clone(ClonePolicy
<Function
>& pol
, Instruction
*i
) const
989 CmpInstruction
*cmp
= (i
? static_cast<CmpInstruction
*>(i
) :
990 new_CmpInstruction(pol
.context(), op
));
992 Instruction::clone(pol
, cmp
);
993 cmp
->setCond
= setCond
;
997 FlowInstruction::FlowInstruction(Function
*fn
, operation op
, void *targ
)
998 : Instruction(fn
, op
, TYPE_NONE
)
1001 target
.fn
= reinterpret_cast<Function
*>(targ
);
1003 target
.bb
= reinterpret_cast<BasicBlock
*>(targ
);
1006 op
== OP_CONT
|| op
== OP_BREAK
||
1007 op
== OP_RET
|| op
== OP_EXIT
)
1011 terminator
= targ
? 1 : 0;
1013 allWarp
= absolute
= limit
= builtin
= indirect
= 0;
1017 FlowInstruction::clone(ClonePolicy
<Function
>& pol
, Instruction
*i
) const
1019 FlowInstruction
*flow
= (i
? static_cast<FlowInstruction
*>(i
) :
1020 new_FlowInstruction(pol
.context(), op
, NULL
));
1022 Instruction::clone(pol
, flow
);
1023 flow
->allWarp
= allWarp
;
1024 flow
->absolute
= absolute
;
1025 flow
->limit
= limit
;
1026 flow
->builtin
= builtin
;
1029 flow
->target
.builtin
= target
.builtin
;
1032 flow
->target
.fn
= target
.fn
;
1035 flow
->target
.bb
= pol
.get
<BasicBlock
>(target
.bb
);
1040 Program::Program(Type type
, Target
*arch
)
1043 mem_Instruction(sizeof(Instruction
), 6),
1044 mem_CmpInstruction(sizeof(CmpInstruction
), 4),
1045 mem_TexInstruction(sizeof(TexInstruction
), 4),
1046 mem_FlowInstruction(sizeof(FlowInstruction
), 4),
1047 mem_LValue(sizeof(LValue
), 8),
1048 mem_Symbol(sizeof(Symbol
), 7),
1049 mem_ImmediateValue(sizeof(ImmediateValue
), 7)
1056 main
= new Function(this, "MAIN", ~0);
1057 calls
.insert(&main
->call
);
1067 for (ArrayList::Iterator it
= allFuncs
.iterator(); !it
.end(); it
.next())
1068 delete reinterpret_cast<Function
*>(it
.get());
1070 for (ArrayList::Iterator it
= allRValues
.iterator(); !it
.end(); it
.next())
1071 releaseValue(reinterpret_cast<Value
*>(it
.get()));
1074 void Program::releaseInstruction(Instruction
*insn
)
1076 // TODO: make this not suck so much
1078 insn
->~Instruction();
1081 mem_CmpInstruction
.release(insn
);
1084 mem_TexInstruction
.release(insn
);
1087 mem_FlowInstruction
.release(insn
);
1089 mem_Instruction
.release(insn
);
1092 void Program::releaseValue(Value
*value
)
1096 if (value
->asLValue())
1097 mem_LValue
.release(value
);
1100 mem_ImmediateValue
.release(value
);
1103 mem_Symbol
.release(value
);
1107 } // namespace nv50_ir
1112 nv50_ir_init_prog_info(struct nv50_ir_prog_info
*info
)
1114 #if defined(PIPE_SHADER_HULL) && defined(PIPE_SHADER_DOMAIN)
1115 if (info
->type
== PIPE_SHADER_HULL
|| info
->type
== PIPE_SHADER_DOMAIN
) {
1116 info
->prop
.tp
.domain
= PIPE_PRIM_MAX
;
1117 info
->prop
.tp
.outputPrim
= PIPE_PRIM_MAX
;
1120 if (info
->type
== PIPE_SHADER_GEOMETRY
) {
1121 info
->prop
.gp
.instanceCount
= 1;
1122 info
->prop
.gp
.maxVertices
= 1;
1124 info
->io
.clipDistance
= 0xff;
1125 info
->io
.pointSize
= 0xff;
1126 info
->io
.instanceId
= 0xff;
1127 info
->io
.vertexId
= 0xff;
1128 info
->io
.edgeFlagIn
= 0xff;
1129 info
->io
.edgeFlagOut
= 0xff;
1130 info
->io
.fragDepth
= 0xff;
1131 info
->io
.sampleMask
= 0xff;
1132 info
->io
.backFaceColor
[0] = info
->io
.backFaceColor
[1] = 0xff;
1136 nv50_ir_generate_code(struct nv50_ir_prog_info
*info
)
1140 nv50_ir::Program::Type type
;
1142 nv50_ir_init_prog_info(info
);
1144 #define PROG_TYPE_CASE(a, b) \
1145 case PIPE_SHADER_##a: type = nv50_ir::Program::TYPE_##b; break
1147 switch (info
->type
) {
1148 PROG_TYPE_CASE(VERTEX
, VERTEX
);
1149 // PROG_TYPE_CASE(HULL, TESSELLATION_CONTROL);
1150 // PROG_TYPE_CASE(DOMAIN, TESSELLATION_EVAL);
1151 PROG_TYPE_CASE(GEOMETRY
, GEOMETRY
);
1152 PROG_TYPE_CASE(FRAGMENT
, FRAGMENT
);
1153 PROG_TYPE_CASE(COMPUTE
, COMPUTE
);
1155 type
= nv50_ir::Program::TYPE_COMPUTE
;
1158 INFO_DBG(info
->dbgFlags
, VERBOSE
, "translating program of type %u\n", type
);
1160 nv50_ir::Target
*targ
= nv50_ir::Target::create(info
->target
);
1164 nv50_ir::Program
*prog
= new nv50_ir::Program(type
, targ
);
1167 prog
->driver
= info
;
1168 prog
->dbgFlags
= info
->dbgFlags
;
1169 prog
->optLevel
= info
->optLevel
;
1171 switch (info
->bin
.sourceRep
) {
1177 ret
= prog
->makeFromSM4(info
) ? 0 : -2;
1182 ret
= prog
->makeFromTGSI(info
) ? 0 : -2;
1187 if (prog
->dbgFlags
& NV50_IR_DEBUG_VERBOSE
)
1190 targ
->parseDriverInfo(info
);
1191 prog
->getTarget()->runLegalizePass(prog
, nv50_ir::CG_STAGE_PRE_SSA
);
1193 prog
->convertToSSA();
1195 if (prog
->dbgFlags
& NV50_IR_DEBUG_VERBOSE
)
1198 prog
->optimizeSSA(info
->optLevel
);
1199 prog
->getTarget()->runLegalizePass(prog
, nv50_ir::CG_STAGE_SSA
);
1201 if (prog
->dbgFlags
& NV50_IR_DEBUG_BASIC
)
1204 if (!prog
->registerAllocation()) {
1208 prog
->getTarget()->runLegalizePass(prog
, nv50_ir::CG_STAGE_POST_RA
);
1210 prog
->optimizePostRA(info
->optLevel
);
1212 if (!prog
->emitBinary(info
)) {
1218 INFO_DBG(prog
->dbgFlags
, VERBOSE
, "nv50_ir_generate_code: ret = %i\n", ret
);
1220 info
->bin
.maxGPR
= prog
->maxGPR
;
1221 info
->bin
.code
= prog
->code
;
1222 info
->bin
.codeSize
= prog
->binSize
;
1223 info
->bin
.tlsSpace
= prog
->tlsSize
;
1226 nv50_ir::Target::destroy(targ
);