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_build_util.h"
26 #include "codegen/nv50_ir_target_nvc0.h"
27 #include "codegen/nv50_ir_lowering_nvc0.h"
39 #define QUADOP(q, r, s, t) \
40 ((QOP_##q << 6) | (QOP_##r << 4) | \
41 (QOP_##s << 2) | (QOP_##t << 0))
44 NVC0LegalizeSSA::handleDIV(Instruction
*i
)
46 FlowInstruction
*call
;
50 bld
.setPosition(i
, false);
51 def
[0] = bld
.mkMovToReg(0, i
->getSrc(0))->getDef(0);
52 def
[1] = bld
.mkMovToReg(1, i
->getSrc(1))->getDef(0);
54 case TYPE_U32
: builtin
= NVC0_BUILTIN_DIV_U32
; break;
55 case TYPE_S32
: builtin
= NVC0_BUILTIN_DIV_S32
; break;
59 call
= bld
.mkFlow(OP_CALL
, NULL
, CC_ALWAYS
, NULL
);
60 bld
.mkMov(i
->getDef(0), def
[(i
->op
== OP_DIV
) ? 0 : 1]);
61 bld
.mkClobber(FILE_GPR
, (i
->op
== OP_DIV
) ? 0xe : 0xd, 2);
62 bld
.mkClobber(FILE_PREDICATE
, (i
->dType
== TYPE_S32
) ? 0xf : 0x3, 0);
65 call
->absolute
= call
->builtin
= 1;
66 call
->target
.builtin
= builtin
;
67 delete_Instruction(prog
, i
);
71 NVC0LegalizeSSA::handleRCPRSQ(Instruction
*i
)
73 assert(i
->dType
== TYPE_F64
);
74 // There are instructions that will compute the high 32 bits of the 64-bit
75 // float. We will just stick 0 in the bottom 32 bits.
77 bld
.setPosition(i
, false);
79 // 1. Take the source and it up.
80 Value
*src
[2], *dst
[2], *def
= i
->getDef(0);
81 bld
.mkSplit(src
, 4, i
->getSrc(0));
83 // 2. We don't care about the low 32 bits of the destination. Stick a 0 in.
84 dst
[0] = bld
.loadImm(NULL
, 0);
85 dst
[1] = bld
.getSSA();
87 // 3. The new version of the instruction takes the high 32 bits of the
88 // source and outputs the high 32 bits of the destination.
92 i
->subOp
= NV50_IR_SUBOP_RCPRSQ_64H
;
94 // 4. Recombine the two dst pieces back into the original destination.
95 bld
.setPosition(i
, true);
96 bld
.mkOp2(OP_MERGE
, TYPE_U64
, def
, dst
[0], dst
[1]);
100 NVC0LegalizeSSA::handleFTZ(Instruction
*i
)
102 // Only want to flush float inputs
103 assert(i
->sType
== TYPE_F32
);
105 // If we're already flushing denorms (and NaN's) to zero, no need for this.
109 // Only certain classes of operations can flush
110 OpClass cls
= prog
->getTarget()->getOpClass(i
->op
);
111 if (cls
!= OPCLASS_ARITH
&& cls
!= OPCLASS_COMPARE
&&
112 cls
!= OPCLASS_CONVERT
)
119 NVC0LegalizeSSA::visit(Function
*fn
)
121 bld
.setProgram(fn
->getProgram());
126 NVC0LegalizeSSA::visit(BasicBlock
*bb
)
129 for (Instruction
*i
= bb
->getEntry(); i
; i
= next
) {
131 if (i
->sType
== TYPE_F32
) {
132 if (prog
->getType() != Program::TYPE_COMPUTE
)
143 if (i
->dType
== TYPE_F64
)
153 NVC0LegalizePostRA::NVC0LegalizePostRA(const Program
*prog
)
156 needTexBar(prog
->getTarget()->getChipset() >= 0xe0)
161 NVC0LegalizePostRA::insnDominatedBy(const Instruction
*later
,
162 const Instruction
*early
) const
164 if (early
->bb
== later
->bb
)
165 return early
->serial
< later
->serial
;
166 return later
->bb
->dominatedBy(early
->bb
);
170 NVC0LegalizePostRA::addTexUse(std::list
<TexUse
> &uses
,
171 Instruction
*usei
, const Instruction
*texi
)
174 for (std::list
<TexUse
>::iterator it
= uses
.begin();
176 if (insnDominatedBy(usei
, it
->insn
)) {
180 if (insnDominatedBy(it
->insn
, usei
))
186 uses
.push_back(TexUse(usei
, texi
));
189 // While it might be tempting to use the an algorithm that just looks at tex
190 // uses, not all texture results are guaranteed to be used on all paths. In
191 // the case where along some control flow path a texture result is never used,
192 // we might reuse that register for something else, creating a
193 // write-after-write hazard. So we have to manually look through all
194 // instructions looking for ones that reference the registers in question.
196 NVC0LegalizePostRA::findFirstUses(
197 Instruction
*texi
, std::list
<TexUse
> &uses
)
199 int minGPR
= texi
->def(0).rep()->reg
.data
.id
;
200 int maxGPR
= minGPR
+ texi
->def(0).rep()->reg
.size
/ 4 - 1;
202 unordered_set
<const BasicBlock
*> visited
;
203 findFirstUsesBB(minGPR
, maxGPR
, texi
->next
, texi
, uses
, visited
);
207 NVC0LegalizePostRA::findFirstUsesBB(
208 int minGPR
, int maxGPR
, Instruction
*start
,
209 const Instruction
*texi
, std::list
<TexUse
> &uses
,
210 unordered_set
<const BasicBlock
*> &visited
)
212 const BasicBlock
*bb
= start
->bb
;
214 // We don't process the whole bb the first time around. This is correct,
215 // however we might be in a loop and hit this BB again, and need to process
216 // the full thing. So only mark a bb as visited if we processed it from the
218 if (start
== bb
->getEntry()) {
219 if (visited
.find(bb
) != visited
.end())
224 for (Instruction
*insn
= start
; insn
!= bb
->getExit(); insn
= insn
->next
) {
228 for (int d
= 0; insn
->defExists(d
); ++d
) {
229 if (insn
->def(d
).getFile() != FILE_GPR
||
230 insn
->def(d
).rep()->reg
.data
.id
< minGPR
||
231 insn
->def(d
).rep()->reg
.data
.id
> maxGPR
)
233 addTexUse(uses
, insn
, texi
);
237 for (int s
= 0; insn
->srcExists(s
); ++s
) {
238 if (insn
->src(s
).getFile() != FILE_GPR
||
239 insn
->src(s
).rep()->reg
.data
.id
< minGPR
||
240 insn
->src(s
).rep()->reg
.data
.id
> maxGPR
)
242 addTexUse(uses
, insn
, texi
);
247 for (Graph::EdgeIterator ei
= bb
->cfg
.outgoing(); !ei
.end(); ei
.next()) {
248 findFirstUsesBB(minGPR
, maxGPR
, BasicBlock::get(ei
.getNode())->getEntry(),
249 texi
, uses
, visited
);
254 // This pass is a bit long and ugly and can probably be optimized.
256 // 1. obtain a list of TEXes and their outputs' first use(s)
257 // 2. calculate the barrier level of each first use (minimal number of TEXes,
258 // over all paths, between the TEX and the use in question)
259 // 3. for each barrier, if all paths from the source TEX to that barrier
260 // contain a barrier of lesser level, it can be culled
262 NVC0LegalizePostRA::insertTextureBarriers(Function
*fn
)
264 std::list
<TexUse
> *uses
;
265 std::vector
<Instruction
*> texes
;
266 std::vector
<int> bbFirstTex
;
267 std::vector
<int> bbFirstUse
;
268 std::vector
<int> texCounts
;
269 std::vector
<TexUse
> useVec
;
272 fn
->orderInstructions(insns
);
274 texCounts
.resize(fn
->allBBlocks
.getSize(), 0);
275 bbFirstTex
.resize(fn
->allBBlocks
.getSize(), insns
.getSize());
276 bbFirstUse
.resize(fn
->allBBlocks
.getSize(), insns
.getSize());
278 // tag BB CFG nodes by their id for later
279 for (ArrayList::Iterator i
= fn
->allBBlocks
.iterator(); !i
.end(); i
.next()) {
280 BasicBlock
*bb
= reinterpret_cast<BasicBlock
*>(i
.get());
282 bb
->cfg
.tag
= bb
->getId();
285 // gather the first uses for each TEX
286 for (int i
= 0; i
< insns
.getSize(); ++i
) {
287 Instruction
*tex
= reinterpret_cast<Instruction
*>(insns
.get(i
));
288 if (isTextureOp(tex
->op
)) {
289 texes
.push_back(tex
);
290 if (!texCounts
.at(tex
->bb
->getId()))
291 bbFirstTex
[tex
->bb
->getId()] = texes
.size() - 1;
292 texCounts
[tex
->bb
->getId()]++;
298 uses
= new std::list
<TexUse
>[texes
.size()];
301 for (size_t i
= 0; i
< texes
.size(); ++i
) {
302 findFirstUses(texes
[i
], uses
[i
]);
305 // determine the barrier level at each use
306 for (size_t i
= 0; i
< texes
.size(); ++i
) {
307 for (std::list
<TexUse
>::iterator u
= uses
[i
].begin(); u
!= uses
[i
].end();
309 BasicBlock
*tb
= texes
[i
]->bb
;
310 BasicBlock
*ub
= u
->insn
->bb
;
313 for (size_t j
= i
+ 1; j
< texes
.size() &&
314 texes
[j
]->bb
== tb
&& texes
[j
]->serial
< u
->insn
->serial
;
318 u
->level
= fn
->cfg
.findLightestPathWeight(&tb
->cfg
,
319 &ub
->cfg
, texCounts
);
321 WARN("Failed to find path TEX -> TEXBAR\n");
325 // this counted all TEXes in the origin block, correct that
326 u
->level
-= i
- bbFirstTex
.at(tb
->getId()) + 1 /* this TEX */;
327 // and did not count the TEXes in the destination block, add those
328 for (size_t j
= bbFirstTex
.at(ub
->getId()); j
< texes
.size() &&
329 texes
[j
]->bb
== ub
&& texes
[j
]->serial
< u
->insn
->serial
;
333 assert(u
->level
>= 0);
334 useVec
.push_back(*u
);
339 // insert the barriers
340 for (size_t i
= 0; i
< useVec
.size(); ++i
) {
341 Instruction
*prev
= useVec
[i
].insn
->prev
;
342 if (useVec
[i
].level
< 0)
344 if (prev
&& prev
->op
== OP_TEXBAR
) {
345 if (prev
->subOp
> useVec
[i
].level
)
346 prev
->subOp
= useVec
[i
].level
;
347 prev
->setSrc(prev
->srcCount(), useVec
[i
].tex
->getDef(0));
349 Instruction
*bar
= new_Instruction(func
, OP_TEXBAR
, TYPE_NONE
);
351 bar
->subOp
= useVec
[i
].level
;
352 // make use explicit to ease latency calculation
353 bar
->setSrc(bar
->srcCount(), useVec
[i
].tex
->getDef(0));
354 useVec
[i
].insn
->bb
->insertBefore(useVec
[i
].insn
, bar
);
358 if (fn
->getProgram()->optLevel
< 3)
361 std::vector
<Limits
> limitT
, limitB
, limitS
; // entry, exit, single
363 limitT
.resize(fn
->allBBlocks
.getSize(), Limits(0, 0));
364 limitB
.resize(fn
->allBBlocks
.getSize(), Limits(0, 0));
365 limitS
.resize(fn
->allBBlocks
.getSize());
367 // cull unneeded barriers (should do that earlier, but for simplicity)
368 IteratorRef bi
= fn
->cfg
.iteratorCFG();
369 // first calculate min/max outstanding TEXes for each BB
370 for (bi
->reset(); !bi
->end(); bi
->next()) {
371 Graph::Node
*n
= reinterpret_cast<Graph::Node
*>(bi
->get());
372 BasicBlock
*bb
= BasicBlock::get(n
);
374 int max
= std::numeric_limits
<int>::max();
375 for (Instruction
*i
= bb
->getFirst(); i
; i
= i
->next
) {
376 if (isTextureOp(i
->op
)) {
378 if (max
< std::numeric_limits
<int>::max())
381 if (i
->op
== OP_TEXBAR
) {
382 min
= MIN2(min
, i
->subOp
);
383 max
= MIN2(max
, i
->subOp
);
386 // limits when looking at an isolated block
387 limitS
[bb
->getId()].min
= min
;
388 limitS
[bb
->getId()].max
= max
;
390 // propagate the min/max values
391 for (unsigned int l
= 0; l
<= fn
->loopNestingBound
; ++l
) {
392 for (bi
->reset(); !bi
->end(); bi
->next()) {
393 Graph::Node
*n
= reinterpret_cast<Graph::Node
*>(bi
->get());
394 BasicBlock
*bb
= BasicBlock::get(n
);
395 const int bbId
= bb
->getId();
396 for (Graph::EdgeIterator ei
= n
->incident(); !ei
.end(); ei
.next()) {
397 BasicBlock
*in
= BasicBlock::get(ei
.getNode());
398 const int inId
= in
->getId();
399 limitT
[bbId
].min
= MAX2(limitT
[bbId
].min
, limitB
[inId
].min
);
400 limitT
[bbId
].max
= MAX2(limitT
[bbId
].max
, limitB
[inId
].max
);
402 // I just hope this is correct ...
403 if (limitS
[bbId
].max
== std::numeric_limits
<int>::max()) {
405 limitB
[bbId
].min
= limitT
[bbId
].min
+ limitS
[bbId
].min
;
406 limitB
[bbId
].max
= limitT
[bbId
].max
+ limitS
[bbId
].min
;
408 // block contained a barrier
409 limitB
[bbId
].min
= MIN2(limitS
[bbId
].max
,
410 limitT
[bbId
].min
+ limitS
[bbId
].min
);
411 limitB
[bbId
].max
= MIN2(limitS
[bbId
].max
,
412 limitT
[bbId
].max
+ limitS
[bbId
].min
);
416 // finally delete unnecessary barriers
417 for (bi
->reset(); !bi
->end(); bi
->next()) {
418 Graph::Node
*n
= reinterpret_cast<Graph::Node
*>(bi
->get());
419 BasicBlock
*bb
= BasicBlock::get(n
);
420 Instruction
*prev
= NULL
;
422 int max
= limitT
[bb
->getId()].max
;
423 for (Instruction
*i
= bb
->getFirst(); i
; i
= next
) {
425 if (i
->op
== OP_TEXBAR
) {
426 if (i
->subOp
>= max
) {
427 delete_Instruction(prog
, i
);
431 if (prev
&& prev
->op
== OP_TEXBAR
&& prev
->subOp
>= max
) {
432 delete_Instruction(prog
, prev
);
437 if (isTextureOp(i
->op
)) {
440 if (i
&& !i
->isNop())
448 NVC0LegalizePostRA::visit(Function
*fn
)
451 insertTextureBarriers(fn
);
453 rZero
= new_LValue(fn
, FILE_GPR
);
454 carry
= new_LValue(fn
, FILE_FLAGS
);
456 rZero
->reg
.data
.id
= prog
->getTarget()->getFileSize(FILE_GPR
);
457 carry
->reg
.data
.id
= 0;
463 NVC0LegalizePostRA::replaceZero(Instruction
*i
)
465 for (int s
= 0; i
->srcExists(s
); ++s
) {
466 if (s
== 2 && i
->op
== OP_SUCLAMP
)
468 ImmediateValue
*imm
= i
->getSrc(s
)->asImm();
469 if (imm
&& imm
->reg
.data
.u64
== 0)
474 // replace CONT with BRA for single unconditional continue
476 NVC0LegalizePostRA::tryReplaceContWithBra(BasicBlock
*bb
)
478 if (bb
->cfg
.incidentCount() != 2 || bb
->getEntry()->op
!= OP_PRECONT
)
480 Graph::EdgeIterator ei
= bb
->cfg
.incident();
481 if (ei
.getType() != Graph::Edge::BACK
)
483 if (ei
.getType() != Graph::Edge::BACK
)
485 BasicBlock
*contBB
= BasicBlock::get(ei
.getNode());
487 if (!contBB
->getExit() || contBB
->getExit()->op
!= OP_CONT
||
488 contBB
->getExit()->getPredicate())
490 contBB
->getExit()->op
= OP_BRA
;
491 bb
->remove(bb
->getEntry()); // delete PRECONT
494 assert(ei
.end() || ei
.getType() != Graph::Edge::BACK
);
498 // replace branches to join blocks with join ops
500 NVC0LegalizePostRA::propagateJoin(BasicBlock
*bb
)
502 if (bb
->getEntry()->op
!= OP_JOIN
|| bb
->getEntry()->asFlow()->limit
)
504 for (Graph::EdgeIterator ei
= bb
->cfg
.incident(); !ei
.end(); ei
.next()) {
505 BasicBlock
*in
= BasicBlock::get(ei
.getNode());
506 Instruction
*exit
= in
->getExit();
508 in
->insertTail(new FlowInstruction(func
, OP_JOIN
, bb
));
509 // there should always be a terminator instruction
510 WARN("inserted missing terminator in BB:%i\n", in
->getId());
512 if (exit
->op
== OP_BRA
) {
514 exit
->asFlow()->limit
= 1; // must-not-propagate marker
517 bb
->remove(bb
->getEntry());
521 NVC0LegalizePostRA::visit(BasicBlock
*bb
)
523 Instruction
*i
, *next
;
525 // remove pseudo operations and non-fixed no-ops, split 64 bit operations
526 for (i
= bb
->getFirst(); i
; i
= next
) {
528 if (i
->op
== OP_EMIT
|| i
->op
== OP_RESTART
) {
529 if (!i
->getDef(0)->refCount())
531 if (i
->src(0).getFile() == FILE_IMMEDIATE
)
532 i
->setSrc(0, rZero
); // initial value must be 0
538 if (i
->op
== OP_BAR
&& i
->subOp
== NV50_IR_SUBOP_BAR_SYNC
&&
539 prog
->getType() != Program::TYPE_COMPUTE
) {
540 // It seems like barriers are never required for tessellation since
541 // the warp size is 32, and there are always at most 32 tcs threads.
544 if (i
->op
== OP_LOAD
&& i
->subOp
== NV50_IR_SUBOP_LDC_IS
) {
545 int offset
= i
->src(0).get()->reg
.data
.offset
;
546 if (abs(offset
) > 0x10000)
547 i
->src(0).get()->reg
.fileIndex
+= offset
>> 16;
548 i
->src(0).get()->reg
.data
.offset
= (int)(short)offset
;
550 // TODO: Move this to before register allocation for operations that
551 // need the $c register !
552 if (typeSizeof(i
->dType
) == 8) {
554 hi
= BuildUtil::split64BitOpPostRA(func
, i
, rZero
, carry
);
559 if (i
->op
!= OP_MOV
&& i
->op
!= OP_PFETCH
)
566 if (!tryReplaceContWithBra(bb
))
572 NVC0LoweringPass::NVC0LoweringPass(Program
*prog
) : targ(prog
->getTarget())
574 bld
.setProgram(prog
);
579 NVC0LoweringPass::visit(Function
*fn
)
581 if (prog
->getType() == Program::TYPE_GEOMETRY
) {
582 assert(!strncmp(fn
->getName(), "MAIN", 4));
583 // TODO: when we generate actual functions pass this value along somehow
584 bld
.setPosition(BasicBlock::get(fn
->cfg
.getRoot()), false);
585 gpEmitAddress
= bld
.loadImm(NULL
, 0)->asLValue();
587 bld
.setPosition(BasicBlock::get(fn
->cfgExit
)->getExit(), false);
588 bld
.mkMovToReg(0, gpEmitAddress
);
595 NVC0LoweringPass::visit(BasicBlock
*bb
)
601 NVC0LoweringPass::loadTexHandle(Value
*ptr
, unsigned int slot
)
603 uint8_t b
= prog
->driver
->io
.auxCBSlot
;
604 uint32_t off
= prog
->driver
->io
.texBindBase
+ slot
* 4;
606 mkLoadv(TYPE_U32
, bld
.mkSymbol(FILE_MEMORY_CONST
, b
, TYPE_U32
, off
), ptr
);
609 // move array source to first slot, convert to u16, add indirections
611 NVC0LoweringPass::handleTEX(TexInstruction
*i
)
613 const int dim
= i
->tex
.target
.getDim() + i
->tex
.target
.isCube();
614 const int arg
= i
->tex
.target
.getArgCount();
615 const int lyr
= arg
- (i
->tex
.target
.isMS() ? 2 : 1);
616 const int chipset
= prog
->getTarget()->getChipset();
618 /* Only normalize in the non-explicit derivatives case. For explicit
619 * derivatives, this is handled in handleManualTXD.
621 if (i
->tex
.target
.isCube() && i
->dPdx
[0].get() == NULL
) {
624 for (c
= 0; c
< 3; ++c
)
625 src
[c
] = bld
.mkOp1v(OP_ABS
, TYPE_F32
, bld
.getSSA(), i
->getSrc(c
));
626 val
= bld
.getScratch();
627 bld
.mkOp2(OP_MAX
, TYPE_F32
, val
, src
[0], src
[1]);
628 bld
.mkOp2(OP_MAX
, TYPE_F32
, val
, src
[2], val
);
629 bld
.mkOp1(OP_RCP
, TYPE_F32
, val
, val
);
630 for (c
= 0; c
< 3; ++c
) {
631 i
->setSrc(c
, bld
.mkOp2v(OP_MUL
, TYPE_F32
, bld
.getSSA(),
636 // Arguments to the TEX instruction are a little insane. Even though the
637 // encoding is identical between SM20 and SM30, the arguments mean
638 // different things between Fermi and Kepler+. A lot of arguments are
639 // optional based on flags passed to the instruction. This summarizes the
649 // - tg4: 8 bits each, either 2 (1 offset reg) or 8 (2 offset reg)
650 // - other: 4 bits each, single reg
654 // array (+ offsets for txd in upper 16 bits)
659 // offsets (same as fermi, except txd which takes it with array)
676 if (chipset
>= NVISA_GK104_CHIPSET
) {
677 if (i
->tex
.rIndirectSrc
>= 0 || i
->tex
.sIndirectSrc
>= 0) {
678 // XXX this ignores tsc, and assumes a 1:1 mapping
679 assert(i
->tex
.rIndirectSrc
>= 0);
680 Value
*hnd
= loadTexHandle(
681 bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getSSA(),
682 i
->getIndirectR(), bld
.mkImm(2)),
686 i
->setIndirectR(hnd
);
687 i
->setIndirectS(NULL
);
688 } else if (i
->tex
.r
== i
->tex
.s
|| i
->op
== OP_TXF
) {
689 i
->tex
.r
+= prog
->driver
->io
.texBindBase
/ 4;
690 i
->tex
.s
= 0; // only a single cX[] value possible here
692 Value
*hnd
= bld
.getScratch();
693 Value
*rHnd
= loadTexHandle(NULL
, i
->tex
.r
);
694 Value
*sHnd
= loadTexHandle(NULL
, i
->tex
.s
);
696 bld
.mkOp3(OP_INSBF
, TYPE_U32
, hnd
, rHnd
, bld
.mkImm(0x1400), sHnd
);
698 i
->tex
.r
= 0; // not used for indirect tex
700 i
->setIndirectR(hnd
);
702 if (i
->tex
.target
.isArray()) {
703 LValue
*layer
= new_LValue(func
, FILE_GPR
);
704 Value
*src
= i
->getSrc(lyr
);
705 const int sat
= (i
->op
== OP_TXF
) ? 1 : 0;
706 DataType sTy
= (i
->op
== OP_TXF
) ? TYPE_U32
: TYPE_F32
;
707 bld
.mkCvt(OP_CVT
, TYPE_U16
, layer
, sTy
, src
)->saturate
= sat
;
708 if (i
->op
!= OP_TXD
|| chipset
< NVISA_GM107_CHIPSET
) {
709 for (int s
= dim
; s
>= 1; --s
)
710 i
->setSrc(s
, i
->getSrc(s
- 1));
713 i
->setSrc(dim
, layer
);
716 // Move the indirect reference to the first place
717 if (i
->tex
.rIndirectSrc
>= 0 && (
718 i
->op
== OP_TXD
|| chipset
< NVISA_GM107_CHIPSET
)) {
719 Value
*hnd
= i
->getIndirectR();
721 i
->setIndirectR(NULL
);
722 i
->moveSources(0, 1);
724 i
->tex
.rIndirectSrc
= 0;
725 i
->tex
.sIndirectSrc
= -1;
728 // (nvc0) generate and move the tsc/tic/array source to the front
729 if (i
->tex
.target
.isArray() || i
->tex
.rIndirectSrc
>= 0 || i
->tex
.sIndirectSrc
>= 0) {
730 LValue
*src
= new_LValue(func
, FILE_GPR
); // 0xttxsaaaa
732 Value
*ticRel
= i
->getIndirectR();
733 Value
*tscRel
= i
->getIndirectS();
736 i
->setSrc(i
->tex
.rIndirectSrc
, NULL
);
738 ticRel
= bld
.mkOp2v(OP_ADD
, TYPE_U32
, bld
.getScratch(),
739 ticRel
, bld
.mkImm(i
->tex
.r
));
742 i
->setSrc(i
->tex
.sIndirectSrc
, NULL
);
744 tscRel
= bld
.mkOp2v(OP_ADD
, TYPE_U32
, bld
.getScratch(),
745 tscRel
, bld
.mkImm(i
->tex
.s
));
748 Value
*arrayIndex
= i
->tex
.target
.isArray() ? i
->getSrc(lyr
) : NULL
;
749 for (int s
= dim
; s
>= 1; --s
)
750 i
->setSrc(s
, i
->getSrc(s
- 1));
751 i
->setSrc(0, arrayIndex
);
754 int sat
= (i
->op
== OP_TXF
) ? 1 : 0;
755 DataType sTy
= (i
->op
== OP_TXF
) ? TYPE_U32
: TYPE_F32
;
756 bld
.mkCvt(OP_CVT
, TYPE_U16
, src
, sTy
, arrayIndex
)->saturate
= sat
;
762 bld
.mkOp3(OP_INSBF
, TYPE_U32
, src
, ticRel
, bld
.mkImm(0x0917), src
);
764 bld
.mkOp3(OP_INSBF
, TYPE_U32
, src
, tscRel
, bld
.mkImm(0x0710), src
);
769 // For nvc0, the sample id has to be in the second operand, as the offset
770 // does. Right now we don't know how to pass both in, and this case can't
771 // happen with OpenGL. On nve0, the sample id is part of the texture
772 // coordinate argument.
773 assert(chipset
>= NVISA_GK104_CHIPSET
||
774 !i
->tex
.useOffsets
|| !i
->tex
.target
.isMS());
776 // offset is between lod and dc
777 if (i
->tex
.useOffsets
) {
779 int s
= i
->srcCount(0xff, true);
780 if (i
->op
!= OP_TXD
|| chipset
< NVISA_GK104_CHIPSET
) {
781 if (i
->tex
.target
.isShadow())
783 if (i
->srcExists(s
)) // move potential predicate out of the way
784 i
->moveSources(s
, 1);
785 if (i
->tex
.useOffsets
== 4 && i
->srcExists(s
+ 1))
786 i
->moveSources(s
+ 1, 1);
788 if (i
->op
== OP_TXG
) {
789 // Either there is 1 offset, which goes into the 2 low bytes of the
790 // first source, or there are 4 offsets, which go into 2 sources (8
791 // values, 1 byte each).
792 Value
*offs
[2] = {NULL
, NULL
};
793 for (n
= 0; n
< i
->tex
.useOffsets
; n
++) {
794 for (c
= 0; c
< 2; ++c
) {
795 if ((n
% 2) == 0 && c
== 0)
796 offs
[n
/ 2] = i
->offset
[n
][c
].get();
798 bld
.mkOp3(OP_INSBF
, TYPE_U32
,
800 i
->offset
[n
][c
].get(),
801 bld
.mkImm(0x800 | ((n
* 16 + c
* 8) % 32)),
805 i
->setSrc(s
, offs
[0]);
807 i
->setSrc(s
+ 1, offs
[1]);
810 assert(i
->tex
.useOffsets
== 1);
811 for (c
= 0; c
< 3; ++c
) {
813 if (!i
->offset
[0][c
].getImmediate(val
))
814 assert(!"non-immediate offset passed to non-TXG");
815 imm
|= (val
.reg
.data
.u32
& 0xf) << (c
* 4);
817 if (i
->op
== OP_TXD
&& chipset
>= NVISA_GK104_CHIPSET
) {
818 // The offset goes into the upper 16 bits of the array index. So
819 // create it if it's not already there, and INSBF it if it already
821 s
= (i
->tex
.rIndirectSrc
>= 0) ? 1 : 0;
822 if (chipset
>= NVISA_GM107_CHIPSET
)
824 if (i
->tex
.target
.isArray()) {
825 bld
.mkOp3(OP_INSBF
, TYPE_U32
, i
->getSrc(s
),
826 bld
.loadImm(NULL
, imm
), bld
.mkImm(0xc10),
829 i
->moveSources(s
, 1);
830 i
->setSrc(s
, bld
.loadImm(NULL
, imm
<< 16));
833 i
->setSrc(s
, bld
.loadImm(NULL
, imm
));
838 if (chipset
>= NVISA_GK104_CHIPSET
) {
840 // If TEX requires more than 4 sources, the 2nd register tuple must be
841 // aligned to 4, even if it consists of just a single 4-byte register.
843 // XXX HACK: We insert 0 sources to avoid the 5 or 6 regs case.
845 int s
= i
->srcCount(0xff, true);
846 if (s
> 4 && s
< 7) {
847 if (i
->srcExists(s
)) // move potential predicate out of the way
848 i
->moveSources(s
, 7 - s
);
850 i
->setSrc(s
++, bld
.loadImm(NULL
, 0));
858 NVC0LoweringPass::handleManualTXD(TexInstruction
*i
)
860 static const uint8_t qOps
[4][2] =
862 { QUADOP(MOV2
, ADD
, MOV2
, ADD
), QUADOP(MOV2
, MOV2
, ADD
, ADD
) }, // l0
863 { QUADOP(SUBR
, MOV2
, SUBR
, MOV2
), QUADOP(MOV2
, MOV2
, ADD
, ADD
) }, // l1
864 { QUADOP(MOV2
, ADD
, MOV2
, ADD
), QUADOP(SUBR
, SUBR
, MOV2
, MOV2
) }, // l2
865 { QUADOP(SUBR
, MOV2
, SUBR
, MOV2
), QUADOP(SUBR
, SUBR
, MOV2
, MOV2
) }, // l3
870 Value
*zero
= bld
.loadImm(bld
.getSSA(), 0);
872 const int dim
= i
->tex
.target
.getDim() + i
->tex
.target
.isCube();
873 const int array
= i
->tex
.target
.isArray();
875 i
->op
= OP_TEX
; // no need to clone dPdx/dPdy later
877 for (c
= 0; c
< dim
; ++c
)
878 crd
[c
] = bld
.getScratch();
880 bld
.mkOp(OP_QUADON
, TYPE_NONE
, NULL
);
881 for (l
= 0; l
< 4; ++l
) {
883 // mov coordinates from lane l to all lanes
884 for (c
= 0; c
< dim
; ++c
)
885 bld
.mkQuadop(0x00, crd
[c
], l
, i
->getSrc(c
+ array
), zero
);
886 // add dPdx from lane l to lanes dx
887 for (c
= 0; c
< dim
; ++c
)
888 bld
.mkQuadop(qOps
[l
][0], crd
[c
], l
, i
->dPdx
[c
].get(), crd
[c
]);
889 // add dPdy from lane l to lanes dy
890 for (c
= 0; c
< dim
; ++c
)
891 bld
.mkQuadop(qOps
[l
][1], crd
[c
], l
, i
->dPdy
[c
].get(), crd
[c
]);
892 // normalize cube coordinates
893 if (i
->tex
.target
.isCube()) {
894 for (c
= 0; c
< 3; ++c
)
895 src
[c
] = bld
.mkOp1v(OP_ABS
, TYPE_F32
, bld
.getSSA(), crd
[c
]);
896 val
= bld
.getScratch();
897 bld
.mkOp2(OP_MAX
, TYPE_F32
, val
, src
[0], src
[1]);
898 bld
.mkOp2(OP_MAX
, TYPE_F32
, val
, src
[2], val
);
899 bld
.mkOp1(OP_RCP
, TYPE_F32
, val
, val
);
900 for (c
= 0; c
< 3; ++c
)
901 src
[c
] = bld
.mkOp2v(OP_MUL
, TYPE_F32
, bld
.getSSA(), crd
[c
], val
);
903 for (c
= 0; c
< dim
; ++c
)
907 bld
.insert(tex
= cloneForward(func
, i
));
908 for (c
= 0; c
< dim
; ++c
)
909 tex
->setSrc(c
+ array
, src
[c
]);
911 for (c
= 0; i
->defExists(c
); ++c
) {
913 def
[c
][l
] = bld
.getSSA();
914 mov
= bld
.mkMov(def
[c
][l
], tex
->getDef(c
));
919 bld
.mkOp(OP_QUADPOP
, TYPE_NONE
, NULL
);
921 for (c
= 0; i
->defExists(c
); ++c
) {
922 Instruction
*u
= bld
.mkOp(OP_UNION
, TYPE_U32
, i
->getDef(c
));
923 for (l
= 0; l
< 4; ++l
)
924 u
->setSrc(l
, def
[c
][l
]);
932 NVC0LoweringPass::handleTXD(TexInstruction
*txd
)
934 int dim
= txd
->tex
.target
.getDim() + txd
->tex
.target
.isCube();
935 unsigned arg
= txd
->tex
.target
.getArgCount();
936 unsigned expected_args
= arg
;
937 const int chipset
= prog
->getTarget()->getChipset();
939 if (chipset
>= NVISA_GK104_CHIPSET
) {
940 if (!txd
->tex
.target
.isArray() && txd
->tex
.useOffsets
)
942 if (txd
->tex
.rIndirectSrc
>= 0 || txd
->tex
.sIndirectSrc
>= 0)
945 if (txd
->tex
.useOffsets
)
947 if (!txd
->tex
.target
.isArray() && (
948 txd
->tex
.rIndirectSrc
>= 0 || txd
->tex
.sIndirectSrc
>= 0))
952 if (expected_args
> 4 ||
954 txd
->tex
.target
.isShadow())
958 while (txd
->srcExists(arg
))
961 txd
->tex
.derivAll
= true;
962 if (txd
->op
== OP_TEX
)
963 return handleManualTXD(txd
);
965 assert(arg
== expected_args
);
966 for (int c
= 0; c
< dim
; ++c
) {
967 txd
->setSrc(arg
+ c
* 2 + 0, txd
->dPdx
[c
]);
968 txd
->setSrc(arg
+ c
* 2 + 1, txd
->dPdy
[c
]);
969 txd
->dPdx
[c
].set(NULL
);
970 txd
->dPdy
[c
].set(NULL
);
976 NVC0LoweringPass::handleTXQ(TexInstruction
*txq
)
978 const int chipset
= prog
->getTarget()->getChipset();
979 if (chipset
>= NVISA_GK104_CHIPSET
&& txq
->tex
.rIndirectSrc
< 0)
980 txq
->tex
.r
+= prog
->driver
->io
.texBindBase
/ 4;
982 if (txq
->tex
.rIndirectSrc
< 0)
985 Value
*ticRel
= txq
->getIndirectR();
987 txq
->setIndirectS(NULL
);
988 txq
->tex
.sIndirectSrc
= -1;
992 if (chipset
< NVISA_GK104_CHIPSET
) {
993 LValue
*src
= new_LValue(func
, FILE_GPR
); // 0xttxsaaaa
995 txq
->setSrc(txq
->tex
.rIndirectSrc
, NULL
);
997 ticRel
= bld
.mkOp2v(OP_ADD
, TYPE_U32
, bld
.getScratch(),
998 ticRel
, bld
.mkImm(txq
->tex
.r
));
1000 bld
.mkOp2(OP_SHL
, TYPE_U32
, src
, ticRel
, bld
.mkImm(0x17));
1002 txq
->moveSources(0, 1);
1003 txq
->setSrc(0, src
);
1005 Value
*hnd
= loadTexHandle(
1006 bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getSSA(),
1007 txq
->getIndirectR(), bld
.mkImm(2)),
1012 txq
->setIndirectR(NULL
);
1013 txq
->moveSources(0, 1);
1014 txq
->setSrc(0, hnd
);
1015 txq
->tex
.rIndirectSrc
= 0;
1022 NVC0LoweringPass::handleTXLQ(TexInstruction
*i
)
1024 /* The outputs are inverted compared to what the TGSI instruction
1025 * expects. Take that into account in the mask.
1027 assert((i
->tex
.mask
& ~3) == 0);
1028 if (i
->tex
.mask
== 1)
1030 else if (i
->tex
.mask
== 2)
1033 bld
.setPosition(i
, true);
1035 /* The returned values are not quite what we want:
1036 * (a) convert from s16/u16 to f32
1037 * (b) multiply by 1/256
1039 for (int def
= 0; def
< 2; ++def
) {
1040 if (!i
->defExists(def
))
1042 enum DataType type
= TYPE_S16
;
1043 if (i
->tex
.mask
== 2 || def
> 0)
1045 bld
.mkCvt(OP_CVT
, TYPE_F32
, i
->getDef(def
), type
, i
->getDef(def
));
1046 bld
.mkOp2(OP_MUL
, TYPE_F32
, i
->getDef(def
),
1047 i
->getDef(def
), bld
.loadImm(NULL
, 1.0f
/ 256));
1049 if (i
->tex
.mask
== 3) {
1050 LValue
*t
= new_LValue(func
, FILE_GPR
);
1051 bld
.mkMov(t
, i
->getDef(0));
1052 bld
.mkMov(i
->getDef(0), i
->getDef(1));
1053 bld
.mkMov(i
->getDef(1), t
);
1059 NVC0LoweringPass::handleSUQ(Instruction
*suq
)
1062 suq
->setSrc(0, loadResLength32(suq
->getIndirect(0, 1),
1063 suq
->getSrc(0)->reg
.fileIndex
* 16));
1064 suq
->setIndirect(0, 0, NULL
);
1065 suq
->setIndirect(0, 1, NULL
);
1070 NVC0LoweringPass::handleSharedATOM(Instruction
*atom
)
1072 assert(atom
->src(0).getFile() == FILE_MEMORY_SHARED
);
1074 BasicBlock
*currBB
= atom
->bb
;
1075 BasicBlock
*tryLockAndSetBB
= atom
->bb
->splitBefore(atom
, false);
1076 BasicBlock
*joinBB
= atom
->bb
->splitAfter(atom
);
1078 bld
.setPosition(currBB
, true);
1079 assert(!currBB
->joinAt
);
1080 currBB
->joinAt
= bld
.mkFlow(OP_JOINAT
, joinBB
, CC_ALWAYS
, NULL
);
1082 bld
.mkFlow(OP_BRA
, tryLockAndSetBB
, CC_ALWAYS
, NULL
);
1083 currBB
->cfg
.attach(&tryLockAndSetBB
->cfg
, Graph::Edge::TREE
);
1085 bld
.setPosition(tryLockAndSetBB
, true);
1088 bld
.mkLoad(TYPE_U32
, atom
->getDef(0),
1089 bld
.mkSymbol(FILE_MEMORY_SHARED
, 0, TYPE_U32
, 0), NULL
);
1090 ld
->setDef(1, bld
.getSSA(1, FILE_PREDICATE
));
1091 ld
->subOp
= NV50_IR_SUBOP_LOAD_LOCKED
;
1094 if (atom
->subOp
== NV50_IR_SUBOP_ATOM_EXCH
) {
1095 // Read the old value, and write the new one.
1096 stVal
= atom
->getSrc(1);
1097 } else if (atom
->subOp
== NV50_IR_SUBOP_ATOM_CAS
) {
1098 CmpInstruction
*set
=
1099 bld
.mkCmp(OP_SET
, CC_EQ
, TYPE_U32
, bld
.getSSA(1, FILE_PREDICATE
),
1100 TYPE_U32
, ld
->getDef(0), atom
->getSrc(1));
1101 set
->setPredicate(CC_P
, ld
->getDef(1));
1104 bld
.mkOp3(OP_SELP
, TYPE_U32
, bld
.getSSA(), ld
->getDef(0),
1105 atom
->getSrc(2), set
->getDef(0));
1106 selp
->src(2).mod
= Modifier(NV50_IR_MOD_NOT
);
1107 selp
->setPredicate(CC_P
, ld
->getDef(1));
1109 stVal
= selp
->getDef(0);
1113 switch (atom
->subOp
) {
1114 case NV50_IR_SUBOP_ATOM_ADD
:
1117 case NV50_IR_SUBOP_ATOM_AND
:
1120 case NV50_IR_SUBOP_ATOM_OR
:
1123 case NV50_IR_SUBOP_ATOM_XOR
:
1126 case NV50_IR_SUBOP_ATOM_MIN
:
1129 case NV50_IR_SUBOP_ATOM_MAX
:
1138 bld
.mkOp2(op
, atom
->dType
, bld
.getSSA(), ld
->getDef(0),
1140 i
->setPredicate(CC_P
, ld
->getDef(1));
1142 stVal
= i
->getDef(0);
1146 bld
.mkStore(OP_STORE
, TYPE_U32
,
1147 bld
.mkSymbol(FILE_MEMORY_SHARED
, 0, TYPE_U32
, 0),
1149 st
->setPredicate(CC_P
, ld
->getDef(1));
1150 st
->subOp
= NV50_IR_SUBOP_STORE_UNLOCKED
;
1152 // Loop until the lock is acquired.
1153 bld
.mkFlow(OP_BRA
, tryLockAndSetBB
, CC_NOT_P
, ld
->getDef(1));
1154 tryLockAndSetBB
->cfg
.attach(&tryLockAndSetBB
->cfg
, Graph::Edge::BACK
);
1155 tryLockAndSetBB
->cfg
.attach(&joinBB
->cfg
, Graph::Edge::CROSS
);
1156 bld
.mkFlow(OP_BRA
, joinBB
, CC_ALWAYS
, NULL
);
1160 bld
.setPosition(joinBB
, false);
1161 bld
.mkFlow(OP_JOIN
, NULL
, CC_ALWAYS
, NULL
)->fixed
= 1;
1165 NVC0LoweringPass::handleATOM(Instruction
*atom
)
1168 Value
*ptr
= atom
->getIndirect(0, 0), *ind
= atom
->getIndirect(0, 1), *base
;
1170 switch (atom
->src(0).getFile()) {
1171 case FILE_MEMORY_LOCAL
:
1174 case FILE_MEMORY_SHARED
:
1175 handleSharedATOM(atom
);
1178 assert(atom
->src(0).getFile() == FILE_MEMORY_GLOBAL
);
1179 base
= loadResInfo64(ind
, atom
->getSrc(0)->reg
.fileIndex
* 16);
1180 assert(base
->reg
.size
== 8);
1182 base
= bld
.mkOp2v(OP_ADD
, TYPE_U64
, base
, base
, ptr
);
1183 assert(base
->reg
.size
== 8);
1184 atom
->setIndirect(0, 0, base
);
1188 bld
.mkOp1v(OP_RDSV
, TYPE_U32
, bld
.getScratch(), bld
.mkSysVal(sv
, 0));
1190 atom
->setSrc(0, cloneShallow(func
, atom
->getSrc(0)));
1191 atom
->getSrc(0)->reg
.file
= FILE_MEMORY_GLOBAL
;
1193 base
= bld
.mkOp2v(OP_ADD
, TYPE_U32
, base
, base
, ptr
);
1194 atom
->setIndirect(0, 1, NULL
);
1195 atom
->setIndirect(0, 0, base
);
1201 NVC0LoweringPass::handleCasExch(Instruction
*cas
, bool needCctl
)
1203 if (cas
->src(0).getFile() == FILE_MEMORY_SHARED
) {
1204 // ATOM_CAS and ATOM_EXCH are handled in handleSharedATOM().
1208 if (cas
->subOp
!= NV50_IR_SUBOP_ATOM_CAS
&&
1209 cas
->subOp
!= NV50_IR_SUBOP_ATOM_EXCH
)
1211 bld
.setPosition(cas
, true);
1214 Instruction
*cctl
= bld
.mkOp1(OP_CCTL
, TYPE_NONE
, NULL
, cas
->getSrc(0));
1215 cctl
->setIndirect(0, 0, cas
->getIndirect(0, 0));
1217 cctl
->subOp
= NV50_IR_SUBOP_CCTL_IV
;
1218 if (cas
->isPredicated())
1219 cctl
->setPredicate(cas
->cc
, cas
->getPredicate());
1222 if (cas
->subOp
== NV50_IR_SUBOP_ATOM_CAS
) {
1223 // CAS is crazy. It's 2nd source is a double reg, and the 3rd source
1224 // should be set to the high part of the double reg or bad things will
1225 // happen elsewhere in the universe.
1226 // Also, it sometimes returns the new value instead of the old one
1227 // under mysterious circumstances.
1228 Value
*dreg
= bld
.getSSA(8);
1229 bld
.setPosition(cas
, false);
1230 bld
.mkOp2(OP_MERGE
, TYPE_U64
, dreg
, cas
->getSrc(1), cas
->getSrc(2));
1231 cas
->setSrc(1, dreg
);
1232 cas
->setSrc(2, dreg
);
1239 NVC0LoweringPass::loadResInfo32(Value
*ptr
, uint32_t off
)
1241 uint8_t b
= prog
->driver
->io
.auxCBSlot
;
1242 off
+= prog
->driver
->io
.suInfoBase
;
1244 mkLoadv(TYPE_U32
, bld
.mkSymbol(FILE_MEMORY_CONST
, b
, TYPE_U32
, off
), ptr
);
1248 NVC0LoweringPass::loadResInfo64(Value
*ptr
, uint32_t off
)
1250 uint8_t b
= prog
->driver
->io
.auxCBSlot
;
1251 off
+= prog
->driver
->io
.suInfoBase
;
1254 ptr
= bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getScratch(), ptr
, bld
.mkImm(4));
1257 mkLoadv(TYPE_U64
, bld
.mkSymbol(FILE_MEMORY_CONST
, b
, TYPE_U64
, off
), ptr
);
1261 NVC0LoweringPass::loadResLength32(Value
*ptr
, uint32_t off
)
1263 uint8_t b
= prog
->driver
->io
.auxCBSlot
;
1264 off
+= prog
->driver
->io
.suInfoBase
;
1267 ptr
= bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getScratch(), ptr
, bld
.mkImm(4));
1270 mkLoadv(TYPE_U32
, bld
.mkSymbol(FILE_MEMORY_CONST
, b
, TYPE_U64
, off
+ 8), ptr
);
1274 NVC0LoweringPass::loadMsInfo32(Value
*ptr
, uint32_t off
)
1276 uint8_t b
= prog
->driver
->io
.msInfoCBSlot
;
1277 off
+= prog
->driver
->io
.msInfoBase
;
1279 mkLoadv(TYPE_U32
, bld
.mkSymbol(FILE_MEMORY_CONST
, b
, TYPE_U32
, off
), ptr
);
1282 /* On nvc0, surface info is obtained via the surface binding points passed
1283 * to the SULD/SUST instructions.
1284 * On nve4, surface info is stored in c[] and is used by various special
1285 * instructions, e.g. for clamping coordiantes or generating an address.
1286 * They couldn't just have added an equivalent to TIC now, couldn't they ?
1288 #define NVE4_SU_INFO_ADDR 0x00
1289 #define NVE4_SU_INFO_FMT 0x04
1290 #define NVE4_SU_INFO_DIM_X 0x08
1291 #define NVE4_SU_INFO_PITCH 0x0c
1292 #define NVE4_SU_INFO_DIM_Y 0x10
1293 #define NVE4_SU_INFO_ARRAY 0x14
1294 #define NVE4_SU_INFO_DIM_Z 0x18
1295 #define NVE4_SU_INFO_UNK1C 0x1c
1296 #define NVE4_SU_INFO_WIDTH 0x20
1297 #define NVE4_SU_INFO_HEIGHT 0x24
1298 #define NVE4_SU_INFO_DEPTH 0x28
1299 #define NVE4_SU_INFO_TARGET 0x2c
1300 #define NVE4_SU_INFO_CALL 0x30
1301 #define NVE4_SU_INFO_RAW_X 0x34
1302 #define NVE4_SU_INFO_MS_X 0x38
1303 #define NVE4_SU_INFO_MS_Y 0x3c
1305 #define NVE4_SU_INFO__STRIDE 0x40
1307 #define NVE4_SU_INFO_DIM(i) (0x08 + (i) * 8)
1308 #define NVE4_SU_INFO_SIZE(i) (0x20 + (i) * 4)
1309 #define NVE4_SU_INFO_MS(i) (0x38 + (i) * 4)
1311 static inline uint16_t getSuClampSubOp(const TexInstruction
*su
, int c
)
1313 switch (su
->tex
.target
.getEnum()) {
1314 case TEX_TARGET_BUFFER
: return NV50_IR_SUBOP_SUCLAMP_PL(0, 1);
1315 case TEX_TARGET_RECT
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1316 case TEX_TARGET_1D
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1317 case TEX_TARGET_1D_ARRAY
: return (c
== 1) ?
1318 NV50_IR_SUBOP_SUCLAMP_PL(0, 2) :
1319 NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1320 case TEX_TARGET_2D
: return NV50_IR_SUBOP_SUCLAMP_BL(0, 2);
1321 case TEX_TARGET_2D_MS
: return NV50_IR_SUBOP_SUCLAMP_BL(0, 2);
1322 case TEX_TARGET_2D_ARRAY
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1323 case TEX_TARGET_2D_MS_ARRAY
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1324 case TEX_TARGET_3D
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1325 case TEX_TARGET_CUBE
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1326 case TEX_TARGET_CUBE_ARRAY
: return NV50_IR_SUBOP_SUCLAMP_SD(0, 2);
1334 NVC0LoweringPass::adjustCoordinatesMS(TexInstruction
*tex
)
1336 const uint16_t base
= tex
->tex
.r
* NVE4_SU_INFO__STRIDE
;
1337 const int arg
= tex
->tex
.target
.getArgCount();
1339 if (tex
->tex
.target
== TEX_TARGET_2D_MS
)
1340 tex
->tex
.target
= TEX_TARGET_2D
;
1342 if (tex
->tex
.target
== TEX_TARGET_2D_MS_ARRAY
)
1343 tex
->tex
.target
= TEX_TARGET_2D_ARRAY
;
1347 Value
*x
= tex
->getSrc(0);
1348 Value
*y
= tex
->getSrc(1);
1349 Value
*s
= tex
->getSrc(arg
- 1);
1351 Value
*tx
= bld
.getSSA(), *ty
= bld
.getSSA(), *ts
= bld
.getSSA();
1353 Value
*ms_x
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_MS(0));
1354 Value
*ms_y
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_MS(1));
1356 bld
.mkOp2(OP_SHL
, TYPE_U32
, tx
, x
, ms_x
);
1357 bld
.mkOp2(OP_SHL
, TYPE_U32
, ty
, y
, ms_y
);
1359 s
= bld
.mkOp2v(OP_AND
, TYPE_U32
, ts
, s
, bld
.loadImm(NULL
, 0x7));
1360 s
= bld
.mkOp2v(OP_SHL
, TYPE_U32
, ts
, ts
, bld
.mkImm(3));
1362 Value
*dx
= loadMsInfo32(ts
, 0x0);
1363 Value
*dy
= loadMsInfo32(ts
, 0x4);
1365 bld
.mkOp2(OP_ADD
, TYPE_U32
, tx
, tx
, dx
);
1366 bld
.mkOp2(OP_ADD
, TYPE_U32
, ty
, ty
, dy
);
1370 tex
->moveSources(arg
, -1);
1373 // Sets 64-bit "generic address", predicate and format sources for SULD/SUST.
1374 // They're computed from the coordinates using the surface info in c[] space.
1376 NVC0LoweringPass::processSurfaceCoordsNVE4(TexInstruction
*su
)
1379 const bool atom
= su
->op
== OP_SUREDB
|| su
->op
== OP_SUREDP
;
1381 su
->op
== OP_SULDB
|| su
->op
== OP_SUSTB
|| su
->op
== OP_SUREDB
;
1382 const int idx
= su
->tex
.r
;
1383 const int dim
= su
->tex
.target
.getDim();
1384 const int arg
= dim
+ (su
->tex
.target
.isArray() ? 1 : 0);
1385 const uint16_t base
= idx
* NVE4_SU_INFO__STRIDE
;
1387 Value
*zero
= bld
.mkImm(0);
1391 Value
*bf
, *eau
, *off
;
1394 off
= bld
.getScratch(4);
1395 bf
= bld
.getScratch(4);
1396 addr
= bld
.getSSA(8);
1397 pred
= bld
.getScratch(1, FILE_PREDICATE
);
1399 bld
.setPosition(su
, false);
1401 adjustCoordinatesMS(su
);
1403 // calculate clamped coordinates
1404 for (c
= 0; c
< arg
; ++c
) {
1405 src
[c
] = bld
.getScratch();
1407 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_RAW_X
);
1409 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_DIM(c
));
1410 bld
.mkOp3(OP_SUCLAMP
, TYPE_S32
, src
[c
], su
->getSrc(c
), v
, zero
)
1411 ->subOp
= getSuClampSubOp(su
, c
);
1416 // set predicate output
1417 if (su
->tex
.target
== TEX_TARGET_BUFFER
) {
1418 src
[0]->getInsn()->setFlagsDef(1, pred
);
1420 if (su
->tex
.target
.isArray()) {
1421 p1
= bld
.getSSA(1, FILE_PREDICATE
);
1422 src
[dim
]->getInsn()->setFlagsDef(1, p1
);
1425 // calculate pixel offset
1427 if (su
->tex
.target
!= TEX_TARGET_BUFFER
)
1428 bld
.mkOp2(OP_AND
, TYPE_U32
, off
, src
[0], bld
.loadImm(NULL
, 0xffff));
1431 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_UNK1C
);
1432 bld
.mkOp3(OP_MADSP
, TYPE_U32
, off
, src
[2], v
, src
[1])
1433 ->subOp
= NV50_IR_SUBOP_MADSP(4,2,8); // u16l u16l u16l
1435 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_PITCH
);
1436 bld
.mkOp3(OP_MADSP
, TYPE_U32
, off
, off
, v
, src
[0])
1437 ->subOp
= NV50_IR_SUBOP_MADSP(0,2,8); // u32 u16l u16l
1440 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_PITCH
);
1441 bld
.mkOp3(OP_MADSP
, TYPE_U32
, off
, src
[1], v
, src
[0])
1442 ->subOp
= su
->tex
.target
.isArray() ?
1443 NV50_IR_SUBOP_MADSP_SD
: NV50_IR_SUBOP_MADSP(4,2,8); // u16l u16l u16l
1446 // calculate effective address part 1
1447 if (su
->tex
.target
== TEX_TARGET_BUFFER
) {
1451 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_FMT
);
1452 bld
.mkOp3(OP_VSHL
, TYPE_U32
, bf
, src
[0], v
, zero
)
1453 ->subOp
= NV50_IR_SUBOP_V1(7,6,8|2);
1467 if (!su
->tex
.target
.isArray()) {
1468 z
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_UNK1C
);
1469 subOp
= NV50_IR_SUBOP_SUBFM_3D
;
1473 subOp
= NV50_IR_SUBOP_SUBFM_3D
;
1477 insn
= bld
.mkOp3(OP_SUBFM
, TYPE_U32
, bf
, src
[0], y
, z
);
1478 insn
->subOp
= subOp
;
1479 insn
->setFlagsDef(1, pred
);
1483 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_ADDR
);
1485 if (su
->tex
.target
== TEX_TARGET_BUFFER
) {
1488 eau
= bld
.mkOp3v(OP_SUEAU
, TYPE_U32
, bld
.getScratch(4), off
, bf
, v
);
1490 // add array layer offset
1491 if (su
->tex
.target
.isArray()) {
1492 v
= loadResInfo32(NULL
, base
+ NVE4_SU_INFO_ARRAY
);
1494 bld
.mkOp3(OP_MADSP
, TYPE_U32
, eau
, src
[1], v
, eau
)
1495 ->subOp
= NV50_IR_SUBOP_MADSP(4,0,0); // u16 u24 u32
1497 bld
.mkOp3(OP_MADSP
, TYPE_U32
, eau
, v
, src
[2], eau
)
1498 ->subOp
= NV50_IR_SUBOP_MADSP(0,0,0); // u32 u24 u32
1499 // combine predicates
1501 bld
.mkOp2(OP_OR
, TYPE_U8
, pred
, pred
, p1
);
1506 if (su
->tex
.target
== TEX_TARGET_BUFFER
) {
1510 // bf == g[] address & 0xff
1511 // eau == g[] address >> 8
1512 bld
.mkOp3(OP_PERMT
, TYPE_U32
, bf
, lo
, bld
.loadImm(NULL
, 0x6540), eau
);
1513 bld
.mkOp3(OP_PERMT
, TYPE_U32
, eau
, zero
, bld
.loadImm(NULL
, 0x0007), eau
);
1515 if (su
->op
== OP_SULDP
&& su
->tex
.target
== TEX_TARGET_BUFFER
) {
1516 // Convert from u32 to u8 address format, which is what the library code
1517 // doing SULDP currently uses.
1518 // XXX: can SUEAU do this ?
1519 // XXX: does it matter that we don't mask high bytes in bf ?
1521 bld
.mkOp2(OP_SHR
, TYPE_U32
, off
, bf
, bld
.mkImm(8));
1522 bld
.mkOp2(OP_ADD
, TYPE_U32
, eau
, eau
, off
);
1525 bld
.mkOp2(OP_MERGE
, TYPE_U64
, addr
, bf
, eau
);
1527 if (atom
&& su
->tex
.target
== TEX_TARGET_BUFFER
)
1528 bld
.mkOp2(OP_ADD
, TYPE_U64
, addr
, addr
, off
);
1530 // let's just set it 0 for raw access and hope it works
1532 bld
.mkImm(0) : loadResInfo32(NULL
, base
+ NVE4_SU_INFO_FMT
);
1534 // get rid of old coordinate sources, make space for fmt info and predicate
1535 su
->moveSources(arg
, 3 - arg
);
1536 // set 64 bit address and 32-bit format sources
1537 su
->setSrc(0, addr
);
1539 su
->setSrc(2, pred
);
1543 NVC0LoweringPass::handleSurfaceOpNVE4(TexInstruction
*su
)
1545 processSurfaceCoordsNVE4(su
);
1547 // Who do we hate more ? The person who decided that nvc0's SULD doesn't
1548 // have to support conversion or the person who decided that, in OpenCL,
1549 // you don't have to specify the format here like you do in OpenGL ?
1551 if (su
->op
== OP_SULDP
) {
1552 // We don't patch shaders. Ever.
1553 // You get an indirect call to our library blob here.
1554 // But at least it's uniform.
1555 FlowInstruction
*call
;
1558 uint16_t base
= su
->tex
.r
* NVE4_SU_INFO__STRIDE
+ NVE4_SU_INFO_CALL
;
1560 for (int i
= 0; i
< 4; ++i
)
1561 (r
[i
] = bld
.getScratch(4, FILE_GPR
))->reg
.data
.id
= i
;
1562 for (int i
= 0; i
< 3; ++i
)
1563 (p
[i
] = bld
.getScratch(1, FILE_PREDICATE
))->reg
.data
.id
= i
;
1564 (r
[4] = bld
.getScratch(8, FILE_GPR
))->reg
.data
.id
= 4;
1566 bld
.mkMov(p
[1], bld
.mkImm((su
->cache
== CACHE_CA
) ? 1 : 0), TYPE_U8
);
1567 bld
.mkMov(p
[2], bld
.mkImm((su
->cache
== CACHE_CG
) ? 1 : 0), TYPE_U8
);
1568 bld
.mkMov(p
[0], su
->getSrc(2), TYPE_U8
);
1569 bld
.mkMov(r
[4], su
->getSrc(0), TYPE_U64
);
1570 bld
.mkMov(r
[2], su
->getSrc(1), TYPE_U32
);
1572 call
= bld
.mkFlow(OP_CALL
, NULL
, su
->cc
, su
->getPredicate());
1576 call
->setSrc(0, bld
.mkSymbol(FILE_MEMORY_CONST
,
1577 prog
->driver
->io
.auxCBSlot
, TYPE_U32
,
1578 prog
->driver
->io
.suInfoBase
+ base
));
1579 call
->setSrc(1, r
[2]);
1580 call
->setSrc(2, r
[4]);
1581 for (int i
= 0; i
< 3; ++i
)
1582 call
->setSrc(3 + i
, p
[i
]);
1583 for (int i
= 0; i
< 4; ++i
) {
1584 call
->setDef(i
, r
[i
]);
1585 bld
.mkMov(su
->getDef(i
), r
[i
]);
1587 call
->setDef(4, p
[1]);
1588 delete_Instruction(bld
.getProgram(), su
);
1591 if (su
->op
== OP_SUREDB
|| su
->op
== OP_SUREDP
) {
1592 // FIXME: for out of bounds access, destination value will be undefined !
1593 Value
*pred
= su
->getSrc(2);
1594 CondCode cc
= CC_NOT_P
;
1595 if (su
->getPredicate()) {
1596 pred
= bld
.getScratch(1, FILE_PREDICATE
);
1598 if (cc
== CC_NOT_P
) {
1599 bld
.mkOp2(OP_OR
, TYPE_U8
, pred
, su
->getPredicate(), su
->getSrc(2));
1601 bld
.mkOp2(OP_AND
, TYPE_U8
, pred
, su
->getPredicate(), su
->getSrc(2));
1602 pred
->getInsn()->src(1).mod
= Modifier(NV50_IR_MOD_NOT
);
1605 Instruction
*red
= bld
.mkOp(OP_ATOM
, su
->dType
, su
->getDef(0));
1606 red
->subOp
= su
->subOp
;
1608 gMemBase
= bld
.mkSymbol(FILE_MEMORY_GLOBAL
, 0, TYPE_U32
, 0);
1609 red
->setSrc(0, gMemBase
);
1610 red
->setSrc(1, su
->getSrc(3));
1611 if (su
->subOp
== NV50_IR_SUBOP_ATOM_CAS
)
1612 red
->setSrc(2, su
->getSrc(4));
1613 red
->setIndirect(0, 0, su
->getSrc(0));
1614 red
->setPredicate(cc
, pred
);
1615 delete_Instruction(bld
.getProgram(), su
);
1616 handleCasExch(red
, true);
1618 su
->sType
= (su
->tex
.target
== TEX_TARGET_BUFFER
) ? TYPE_U32
: TYPE_U8
;
1623 NVC0LoweringPass::handleWRSV(Instruction
*i
)
1629 // must replace, $sreg are not writeable
1630 addr
= targ
->getSVAddress(FILE_SHADER_OUTPUT
, i
->getSrc(0)->asSym());
1633 sym
= bld
.mkSymbol(FILE_SHADER_OUTPUT
, 0, i
->sType
, addr
);
1635 st
= bld
.mkStore(OP_EXPORT
, i
->dType
, sym
, i
->getIndirect(0, 0),
1637 st
->perPatch
= i
->perPatch
;
1639 bld
.getBB()->remove(i
);
1644 NVC0LoweringPass::readTessCoord(LValue
*dst
, int c
)
1646 Value
*laneid
= bld
.getSSA();
1649 bld
.mkOp1(OP_RDSV
, TYPE_U32
, laneid
, bld
.mkSysVal(SV_LANEID
, 0));
1664 bld
.mkFetch(x
, TYPE_F32
, FILE_SHADER_OUTPUT
, 0x2f0, NULL
, laneid
);
1666 bld
.mkFetch(y
, TYPE_F32
, FILE_SHADER_OUTPUT
, 0x2f4, NULL
, laneid
);
1669 bld
.mkOp2(OP_ADD
, TYPE_F32
, dst
, x
, y
);
1670 bld
.mkOp2(OP_SUB
, TYPE_F32
, dst
, bld
.loadImm(NULL
, 1.0f
), dst
);
1675 NVC0LoweringPass::handleRDSV(Instruction
*i
)
1677 Symbol
*sym
= i
->getSrc(0)->asSym();
1678 const SVSemantic sv
= sym
->reg
.data
.sv
.sv
;
1681 uint32_t addr
= targ
->getSVAddress(FILE_SHADER_INPUT
, sym
);
1683 if (addr
>= 0x400) {
1685 if (sym
->reg
.data
.sv
.index
== 3) {
1686 // TGSI backend may use 4th component of TID,NTID,CTAID,NCTAID
1688 i
->setSrc(0, bld
.mkImm((sv
== SV_NTID
|| sv
== SV_NCTAID
) ? 1 : 0));
1690 if (sv
== SV_VERTEX_COUNT
) {
1691 bld
.setPosition(i
, true);
1692 bld
.mkOp2(OP_EXTBF
, TYPE_U32
, i
->getDef(0), i
->getDef(0), bld
.mkImm(0x808));
1699 assert(prog
->getType() == Program::TYPE_FRAGMENT
);
1700 if (i
->srcExists(1)) {
1701 // Pass offset through to the interpolation logic
1702 ld
= bld
.mkInterp(NV50_IR_INTERP_LINEAR
| NV50_IR_INTERP_OFFSET
,
1703 i
->getDef(0), addr
, NULL
);
1704 ld
->setSrc(1, i
->getSrc(1));
1706 bld
.mkInterp(NV50_IR_INTERP_LINEAR
, i
->getDef(0), addr
, NULL
);
1711 Value
*face
= i
->getDef(0);
1712 bld
.mkInterp(NV50_IR_INTERP_FLAT
, face
, addr
, NULL
);
1713 if (i
->dType
== TYPE_F32
) {
1714 bld
.mkOp2(OP_OR
, TYPE_U32
, face
, face
, bld
.mkImm(0x00000001));
1715 bld
.mkOp1(OP_NEG
, TYPE_S32
, face
, face
);
1716 bld
.mkCvt(OP_CVT
, TYPE_F32
, face
, TYPE_S32
, face
);
1721 assert(prog
->getType() == Program::TYPE_TESSELLATION_EVAL
);
1722 readTessCoord(i
->getDef(0)->asLValue(), i
->getSrc(0)->reg
.data
.sv
.index
);
1727 assert(targ
->getChipset() >= NVISA_GK104_CHIPSET
); // mov $sreg otherwise
1728 if (sym
->reg
.data
.sv
.index
== 3) {
1730 i
->setSrc(0, bld
.mkImm(sv
== SV_GRIDID
? 0 : 1));
1733 addr
+= prog
->driver
->prop
.cp
.gridInfoBase
;
1734 bld
.mkLoad(TYPE_U32
, i
->getDef(0),
1735 bld
.mkSymbol(FILE_MEMORY_CONST
, prog
->driver
->io
.auxCBSlot
,
1736 TYPE_U32
, addr
), NULL
);
1738 case SV_SAMPLE_INDEX
:
1739 // TODO: Properly pass source as an address in the PIX address space
1740 // (which can be of the form [r0+offset]). But this is currently
1742 ld
= bld
.mkOp1(OP_PIXLD
, TYPE_U32
, i
->getDef(0), bld
.mkImm(0));
1743 ld
->subOp
= NV50_IR_SUBOP_PIXLD_SAMPLEID
;
1745 case SV_SAMPLE_POS
: {
1746 Value
*off
= new_LValue(func
, FILE_GPR
);
1747 ld
= bld
.mkOp1(OP_PIXLD
, TYPE_U32
, i
->getDef(0), bld
.mkImm(0));
1748 ld
->subOp
= NV50_IR_SUBOP_PIXLD_SAMPLEID
;
1749 bld
.mkOp2(OP_SHL
, TYPE_U32
, off
, i
->getDef(0), bld
.mkImm(3));
1750 bld
.mkLoad(TYPE_F32
,
1753 FILE_MEMORY_CONST
, prog
->driver
->io
.auxCBSlot
,
1754 TYPE_U32
, prog
->driver
->io
.sampleInfoBase
+
1755 4 * sym
->reg
.data
.sv
.index
),
1759 case SV_SAMPLE_MASK
:
1760 ld
= bld
.mkOp1(OP_PIXLD
, TYPE_U32
, i
->getDef(0), bld
.mkImm(0));
1761 ld
->subOp
= NV50_IR_SUBOP_PIXLD_COVMASK
;
1764 case SV_BASEINSTANCE
:
1766 ld
= bld
.mkLoad(TYPE_U32
, i
->getDef(0),
1767 bld
.mkSymbol(FILE_MEMORY_CONST
,
1768 prog
->driver
->io
.auxCBSlot
,
1770 prog
->driver
->io
.drawInfoBase
+
1771 4 * (sv
- SV_BASEVERTEX
)),
1775 if (prog
->getType() == Program::TYPE_TESSELLATION_EVAL
&& !i
->perPatch
)
1776 vtx
= bld
.mkOp1v(OP_PFETCH
, TYPE_U32
, bld
.getSSA(), bld
.mkImm(0));
1777 ld
= bld
.mkFetch(i
->getDef(0), i
->dType
,
1778 FILE_SHADER_INPUT
, addr
, i
->getIndirect(0, 0), vtx
);
1779 ld
->perPatch
= i
->perPatch
;
1782 bld
.getBB()->remove(i
);
1787 NVC0LoweringPass::handleDIV(Instruction
*i
)
1789 if (!isFloatType(i
->dType
))
1791 bld
.setPosition(i
, false);
1792 Instruction
*rcp
= bld
.mkOp1(OP_RCP
, i
->dType
, bld
.getSSA(typeSizeof(i
->dType
)), i
->getSrc(1));
1794 i
->setSrc(1, rcp
->getDef(0));
1799 NVC0LoweringPass::handleMOD(Instruction
*i
)
1801 if (!isFloatType(i
->dType
))
1803 LValue
*value
= bld
.getScratch(typeSizeof(i
->dType
));
1804 bld
.mkOp1(OP_RCP
, i
->dType
, value
, i
->getSrc(1));
1805 bld
.mkOp2(OP_MUL
, i
->dType
, value
, i
->getSrc(0), value
);
1806 bld
.mkOp1(OP_TRUNC
, i
->dType
, value
, value
);
1807 bld
.mkOp2(OP_MUL
, i
->dType
, value
, i
->getSrc(1), value
);
1809 i
->setSrc(1, value
);
1814 NVC0LoweringPass::handleSQRT(Instruction
*i
)
1816 if (i
->dType
== TYPE_F64
) {
1817 Value
*pred
= bld
.getSSA(1, FILE_PREDICATE
);
1818 Value
*zero
= bld
.loadImm(NULL
, 0.0);
1819 Value
*dst
= bld
.getSSA(8);
1820 bld
.mkOp1(OP_RSQ
, i
->dType
, dst
, i
->getSrc(0));
1821 bld
.mkCmp(OP_SET
, CC_LE
, i
->dType
, pred
, i
->dType
, i
->getSrc(0), zero
);
1822 bld
.mkOp3(OP_SELP
, TYPE_U64
, dst
, zero
, dst
, pred
);
1825 // TODO: Handle this properly with a library function
1827 bld
.setPosition(i
, true);
1829 bld
.mkOp1(OP_RCP
, i
->dType
, i
->getDef(0), i
->getDef(0));
1836 NVC0LoweringPass::handlePOW(Instruction
*i
)
1838 LValue
*val
= bld
.getScratch();
1840 bld
.mkOp1(OP_LG2
, TYPE_F32
, val
, i
->getSrc(0));
1841 bld
.mkOp2(OP_MUL
, TYPE_F32
, val
, i
->getSrc(1), val
)->dnz
= 1;
1842 bld
.mkOp1(OP_PREEX2
, TYPE_F32
, val
, val
);
1852 NVC0LoweringPass::handleEXPORT(Instruction
*i
)
1854 if (prog
->getType() == Program::TYPE_FRAGMENT
) {
1855 int id
= i
->getSrc(0)->reg
.data
.offset
/ 4;
1857 if (i
->src(0).isIndirect(0)) // TODO, ugly
1860 i
->subOp
= NV50_IR_SUBOP_MOV_FINAL
;
1861 i
->src(0).set(i
->src(1));
1863 i
->setDef(0, new_LValue(func
, FILE_GPR
));
1864 i
->getDef(0)->reg
.data
.id
= id
;
1866 prog
->maxGPR
= MAX2(prog
->maxGPR
, id
);
1868 if (prog
->getType() == Program::TYPE_GEOMETRY
) {
1869 i
->setIndirect(0, 1, gpEmitAddress
);
1875 NVC0LoweringPass::handleOUT(Instruction
*i
)
1877 Instruction
*prev
= i
->prev
;
1878 ImmediateValue stream
, prevStream
;
1880 // Only merge if the stream ids match. Also, note that the previous
1881 // instruction would have already been lowered, so we take arg1 from it.
1882 if (i
->op
== OP_RESTART
&& prev
&& prev
->op
== OP_EMIT
&&
1883 i
->src(0).getImmediate(stream
) &&
1884 prev
->src(1).getImmediate(prevStream
) &&
1885 stream
.reg
.data
.u32
== prevStream
.reg
.data
.u32
) {
1886 i
->prev
->subOp
= NV50_IR_SUBOP_EMIT_RESTART
;
1887 delete_Instruction(prog
, i
);
1889 assert(gpEmitAddress
);
1890 i
->setDef(0, gpEmitAddress
);
1891 i
->setSrc(1, i
->getSrc(0));
1892 i
->setSrc(0, gpEmitAddress
);
1897 // Generate a binary predicate if an instruction is predicated by
1898 // e.g. an f32 value.
1900 NVC0LoweringPass::checkPredicate(Instruction
*insn
)
1902 Value
*pred
= insn
->getPredicate();
1905 if (!pred
|| pred
->reg
.file
== FILE_PREDICATE
)
1907 pdst
= new_LValue(func
, FILE_PREDICATE
);
1909 // CAUTION: don't use pdst->getInsn, the definition might not be unique,
1910 // delay turning PSET(FSET(x,y),0) into PSET(x,y) to a later pass
1912 bld
.mkCmp(OP_SET
, CC_NEU
, insn
->dType
, pdst
, insn
->dType
, bld
.mkImm(0), pred
);
1914 insn
->setPredicate(insn
->cc
, pdst
);
1918 // - add quadop dance for texturing
1919 // - put FP outputs in GPRs
1920 // - convert instruction sequences
1923 NVC0LoweringPass::visit(Instruction
*i
)
1926 bld
.setPosition(i
, false);
1928 if (i
->cc
!= CC_ALWAYS
)
1937 return handleTEX(i
->asTex());
1939 return handleTXD(i
->asTex());
1941 return handleTXLQ(i
->asTex());
1943 return handleTXQ(i
->asTex());
1945 bld
.mkOp1(OP_PREEX2
, TYPE_F32
, i
->getDef(0), i
->getSrc(0));
1946 i
->setSrc(0, i
->getDef(0));
1949 return handlePOW(i
);
1951 return handleDIV(i
);
1953 return handleMOD(i
);
1955 return handleSQRT(i
);
1957 ret
= handleEXPORT(i
);
1961 return handleOUT(i
);
1963 return handleRDSV(i
);
1965 return handleWRSV(i
);
1968 if (i
->src(0).getFile() == FILE_SHADER_INPUT
) {
1969 if (prog
->getType() == Program::TYPE_COMPUTE
) {
1970 i
->getSrc(0)->reg
.file
= FILE_MEMORY_CONST
;
1971 i
->getSrc(0)->reg
.fileIndex
= 0;
1973 if (prog
->getType() == Program::TYPE_GEOMETRY
&&
1974 i
->src(0).isIndirect(0)) {
1975 // XXX: this assumes vec4 units
1976 Value
*ptr
= bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getSSA(),
1977 i
->getIndirect(0, 0), bld
.mkImm(4));
1978 i
->setIndirect(0, 0, ptr
);
1982 assert(prog
->getType() != Program::TYPE_FRAGMENT
); // INTERP
1984 } else if (i
->src(0).getFile() == FILE_MEMORY_CONST
) {
1985 if (i
->src(0).isIndirect(1)) {
1987 if (i
->src(0).isIndirect(0))
1988 ptr
= bld
.mkOp3v(OP_INSBF
, TYPE_U32
, bld
.getSSA(),
1989 i
->getIndirect(0, 1), bld
.mkImm(0x1010),
1990 i
->getIndirect(0, 0));
1992 ptr
= bld
.mkOp2v(OP_SHL
, TYPE_U32
, bld
.getSSA(),
1993 i
->getIndirect(0, 1), bld
.mkImm(16));
1994 i
->setIndirect(0, 1, NULL
);
1995 i
->setIndirect(0, 0, ptr
);
1996 i
->subOp
= NV50_IR_SUBOP_LDC_IS
;
1998 } else if (i
->src(0).getFile() == FILE_SHADER_OUTPUT
) {
1999 assert(prog
->getType() == Program::TYPE_TESSELLATION_CONTROL
);
2001 } else if (i
->src(0).getFile() == FILE_MEMORY_GLOBAL
) {
2002 Value
*ind
= i
->getIndirect(0, 1);
2003 Value
*ptr
= loadResInfo64(ind
, i
->getSrc(0)->reg
.fileIndex
* 16);
2004 // XXX come up with a way not to do this for EVERY little access but
2005 // rather to batch these up somehow. Unfortunately we've lost the
2006 // information about the field width by the time we get here.
2007 Value
*offset
= bld
.loadImm(NULL
, i
->getSrc(0)->reg
.data
.offset
+ typeSizeof(i
->sType
));
2008 Value
*length
= loadResLength32(ind
, i
->getSrc(0)->reg
.fileIndex
* 16);
2009 Value
*pred
= new_LValue(func
, FILE_PREDICATE
);
2010 if (i
->src(0).isIndirect(0)) {
2011 bld
.mkOp2(OP_ADD
, TYPE_U64
, ptr
, ptr
, i
->getIndirect(0, 0));
2012 bld
.mkOp2(OP_ADD
, TYPE_U32
, offset
, offset
, i
->getIndirect(0, 0));
2014 i
->setIndirect(0, 1, NULL
);
2015 i
->setIndirect(0, 0, ptr
);
2016 bld
.mkCmp(OP_SET
, CC_GT
, TYPE_U32
, pred
, TYPE_U32
, offset
, length
);
2017 i
->setPredicate(CC_NOT_P
, pred
);
2018 if (i
->defExists(0)) {
2019 bld
.mkMov(i
->getDef(0), bld
.mkImm(0));
2025 const bool cctl
= i
->src(0).getFile() == FILE_MEMORY_GLOBAL
;
2027 handleCasExch(i
, cctl
);
2036 if (targ
->getChipset() >= NVISA_GK104_CHIPSET
)
2037 handleSurfaceOpNVE4(i
->asTex());
2046 /* Kepler+ has a special opcode to compute a new base address to be used
2047 * for indirect loads.
2049 if (targ
->getChipset() >= NVISA_GK104_CHIPSET
&& !i
->perPatch
&&
2050 (i
->op
== OP_VFETCH
|| i
->op
== OP_EXPORT
) && i
->src(0).isIndirect(0)) {
2051 Instruction
*afetch
= bld
.mkOp1(OP_AFETCH
, TYPE_U32
, bld
.getSSA(),
2052 cloneShallow(func
, i
->getSrc(0)));
2053 afetch
->setIndirect(0, 0, i
->getIndirect(0, 0));
2054 i
->src(0).get()->reg
.data
.offset
= 0;
2055 i
->setIndirect(0, 0, afetch
->getDef(0));
2062 TargetNVC0::runLegalizePass(Program
*prog
, CGStage stage
) const
2064 if (stage
== CG_STAGE_PRE_SSA
) {
2065 NVC0LoweringPass
pass(prog
);
2066 return pass
.run(prog
, false, true);
2068 if (stage
== CG_STAGE_POST_RA
) {
2069 NVC0LegalizePostRA
pass(prog
);
2070 return pass
.run(prog
, false, true);
2072 if (stage
== CG_STAGE_SSA
) {
2073 NVC0LegalizeSSA pass
;
2074 return pass
.run(prog
, false, true);
2079 } // namespace nv50_ir