1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
|
#include "slang-ir-simplify-for-emit.h"
#include "slang-ir-inst-pass-base.h"
#include "slang-ir-util.h"
namespace Slang
{
bool isCPUTarget(TargetRequest* targetReq);
bool isCUDATarget(TargetRequest* targetReq);
struct SimplifyForEmitContext : public InstPassBase
{
SimplifyForEmitContext(IRModule* inModule, TargetRequest* inTargetReq)
: InstPassBase(inModule)
, targetReq(inTargetReq)
, followUpWorkList(inModule)
, followUpWorkListSet(inModule)
{
}
TargetRequest* targetReq;
InstWorkList followUpWorkList;
InstHashSet followUpWorkListSet;
void addToFollowUpWorkList(IRInst* inst)
{
if (followUpWorkListSet.add(inst))
followUpWorkList.add(inst);
}
void processMakeStruct(IRInst* makeStruct)
{
auto structType = as<IRStructType>(makeStruct->getDataType());
if (!structType)
return;
for (auto use = makeStruct->firstUse; use;)
{
auto nextUse = use->nextUse;
auto user = use->getUser();
if (auto store = as<IRStore>(user))
{
IRBuilder builder(module);
builder.setInsertBefore(user);
UInt i = 0;
for (auto field : structType->getFields())
{
auto fieldAddr = builder.emitFieldAddress(
builder.getPtrType(field->getFieldType()),
store->getPtr(),
field->getKey());
builder.emitStore(fieldAddr, makeStruct->getOperand(i));
addToFollowUpWorkList(makeStruct->getOperand(i));
i++;
}
store->removeAndDeallocate();
}
use = nextUse;
}
if (!makeStruct->hasUses())
makeStruct->removeAndDeallocate();
}
void processMakeArray(IRInst* makeArray)
{
auto arrayType = as<IRArrayType>(makeArray->getDataType());
if (!arrayType)
return;
for (auto use = makeArray->firstUse; use;)
{
auto nextUse = use->nextUse;
auto user = use->getUser();
if (auto store = as<IRStore>(user))
{
IRBuilder builder(module);
builder.setInsertBefore(user);
for (UInt i = 0; i < makeArray->getOperandCount(); i++)
{
auto elementAddr = builder.emitElementAddress(
store->getPtr(),
builder.getIntValue(builder.getIntType(), (IRIntegerValue)i));
builder.emitStore(elementAddr, makeArray->getOperand(i));
addToFollowUpWorkList(makeArray->getOperand(i));
}
store->removeAndDeallocate();
}
use = nextUse;
}
if (!makeArray->hasUses())
makeArray->removeAndDeallocate();
}
void processMakeArrayFromElement(IRInst* makeArray)
{
auto arrayType = as<IRArrayType>(makeArray->getDataType());
if (!arrayType)
return;
auto arraySize = as<IRIntLit>(arrayType->getElementCount());
if (!arraySize)
return;
for (auto use = makeArray->firstUse; use;)
{
auto nextUse = use->nextUse;
auto user = use->getUser();
if (auto store = as<IRStore>(user))
{
IRBuilder builder(module);
builder.setInsertBefore(user);
for (IRIntegerValue i = 0; i < arraySize->getValue(); i++)
{
auto elementAddr = builder.emitElementAddress(
store->getPtr(),
builder.getIntValue(builder.getIntType(), i));
builder.emitStore(elementAddr, makeArray->getOperand(0));
addToFollowUpWorkList(makeArray->getOperand(0));
}
store->removeAndDeallocate();
}
use = nextUse;
}
if (!makeArray->hasUses())
makeArray->removeAndDeallocate();
}
void processLoadUse(IRGlobalValueWithCode* func, IRLoad* load, IRUse* use)
{
auto user = use->getUser();
if (user->getParent() != load->getParent())
return;
for (auto inst = load->getNextInst(); inst; inst = inst->getNextInst())
{
if (inst == user)
break;
if (canInstHaveSideEffectAtAddress(func, inst, load->getPtr()))
return;
}
// If we reach here, it is OK to defer the load at use site.
IRBuilder builder(module);
builder.setInsertBefore(user);
auto newLoad = builder.emitLoad(load->getFullType(), load->getPtr());
builder.replaceOperand(use, newLoad);
}
void processLoad(IRLoad* inst)
{
auto func = getParentFunc(inst);
if (!func)
return;
for (auto use = inst->firstUse; use;)
{
auto nextUse = use->nextUse;
processLoadUse(func, inst, use);
use = nextUse;
}
if (!inst->hasUses())
inst->removeAndDeallocate();
}
void processElementExtract(IRInst* inst)
{
// Create a duplicate for each use site.
// This is safe because the result value of this inst should never
// change regardless of where the inst is defined.
// By creating the duplicates right before use sites, we will enable
// the emit logic to always fold these insts.
for (auto use = inst->firstUse; use;)
{
auto nextUse = use->nextUse;
auto user = use->getUser();
if (user->getPrevInst() == inst)
{
use = nextUse;
continue;
}
IRBuilder builder(module);
builder.setInsertBefore(user);
List<IRInst*> args;
for (UInt i = 0; i < inst->getOperandCount(); i++)
args.add(inst->getOperand(i));
auto newInst = builder.emitIntrinsicInst(
inst->getFullType(),
inst->getOp(),
inst->getOperandCount(),
args.getBuffer());
use->set(newInst);
use = nextUse;
}
if (!inst->hasUses())
inst->removeAndDeallocate();
}
void processVar(IRInst* var)
{
// Defer var to its first use, if the use is in the same basic block as the var.
HashSet<IRInst*> userInSameBlock;
for (auto use = var->firstUse; use; use = use->nextUse)
if (use->getUser()->getParent() == var->getParent())
{
userInSameBlock.add(use->getUser());
}
IRInst* firstUser = nullptr;
for (auto inst = var->getNextInst(); inst; inst = inst->getNextInst())
{
if (userInSameBlock.contains(inst))
{
firstUser = inst;
break;
}
}
if (!firstUser)
return;
var->insertBefore(firstUser);
}
void processInst(IRInst* inst)
{
// We inspect each inst and see if the following simplifications
// can be applied:
// 1. If we see `store(addr, MakeArray/Struct)`, we should turn them
// into direct stores into each element/field and remove the need
// to create a temporary for the `MakeArray/Struct` inst.
// 2. If we see `load(addr)`, we duplicate the load right at each
// use site if it can be determined safe to do so. This allows
// emit logic to skip producing a temp var for the loaded result.
switch (inst->getOp())
{
case kIROp_MakeStruct: processMakeStruct(inst); break;
case kIROp_MakeArray: processMakeArray(inst); break;
case kIROp_MakeArrayFromElement: processMakeArrayFromElement(inst); break;
case kIROp_Load: processLoad(as<IRLoad>(inst)); break;
case kIROp_GetElement:
case kIROp_FieldExtract: processElementExtract(inst); break;
case kIROp_Var: processVar(inst); break;
}
}
void eliminateCompositeConstruct(IRGlobalValueWithCode* func)
{
followUpWorkList.clear();
followUpWorkListSet.clear();
for (auto block : func->getBlocks())
{
for (auto inst = block->getFirstInst(); inst; inst = inst->getNextInst())
{
switch (inst->getOp())
{
case kIROp_MakeStruct:
case kIROp_MakeArray:
case kIROp_MakeArrayFromElement: addToFollowUpWorkList(inst); break;
}
}
}
for (Index i = 0; i < followUpWorkList.getCount(); i++)
processInst(followUpWorkList[i]);
}
void deferAndDuplicateLoad(IRGlobalValueWithCode* func)
{
followUpWorkList.clear();
followUpWorkListSet.clear();
for (auto block : func->getBlocks())
{
for (auto inst = block->getFirstInst(); inst; inst = inst->getNextInst())
{
switch (inst->getOp())
{
case kIROp_Load: addToFollowUpWorkList(inst); break;
}
}
}
for (Index i = 0; i < followUpWorkList.getCount(); i++)
processInst(followUpWorkList[i]);
}
void deferVarDecl(IRGlobalValueWithCode* func)
{
followUpWorkList.clear();
followUpWorkListSet.clear();
for (auto block : func->getBlocks())
{
for (auto inst = block->getFirstInst(); inst; inst = inst->getNextInst())
{
switch (inst->getOp())
{
case kIROp_Var: addToFollowUpWorkList(inst); break;
}
}
}
for (Index i = 0; i < followUpWorkList.getCount(); i++)
processInst(followUpWorkList[i]);
}
void deferAndDuplicateElementExtract(IRGlobalValueWithCode* func)
{
followUpWorkList.clear();
followUpWorkListSet.clear();
for (auto block = func->getLastBlock(); block; block = block->getPrevBlock())
{
for (auto inst = block->getLastChild(); inst; inst = inst->getPrevInst())
{
switch (inst->getOp())
{
case kIROp_GetElement:
case kIROp_FieldExtract: addToFollowUpWorkList(inst); break;
}
}
}
for (Index i = 0; i < followUpWorkList.getCount(); i++)
processInst(followUpWorkList[i]);
}
void unifyBinaryExprOperands(IRGlobalValueWithCode* func)
{
IRBuilder builder(func->getModule());
for (auto block : func->getBlocks())
{
for (auto inst = block->getFirstInst(); inst; inst = inst->getNextInst())
{
switch (inst->getOp())
{
case kIROp_Add:
case kIROp_Sub:
case kIROp_Mul:
case kIROp_Div:
case kIROp_IRem:
case kIROp_FRem:
case kIROp_And:
case kIROp_Or:
case kIROp_BitAnd:
case kIROp_BitOr:
case kIROp_BitXor:
case kIROp_Leq:
case kIROp_Less:
case kIROp_Geq:
case kIROp_Greater:
case kIROp_Eql:
case kIROp_Neq:
case kIROp_Lsh:
case kIROp_Rsh:
builder.setInsertBefore(inst);
SLANG_ASSERT(inst->getOperandCount() == 2);
if (as<IRVectorType>(inst->getDataType()))
{
for (UInt a = 0; a < 2; a++)
{
if (as<IRBasicType>(inst->getOperand(a)->getDataType()))
{
auto v = builder.emitMakeVectorFromScalar(
inst->getOperand(1 - a)->getDataType(),
inst->getOperand(a));
inst->setOperand(a, v);
}
}
}
else if (as<IRMatrixType>(inst->getDataType()))
{
for (UInt a = 0; a < 2; a++)
{
if (as<IRBasicType>(inst->getOperand(a)->getDataType()))
{
auto v = builder.emitMakeMatrixFromScalar(
inst->getOperand(1 - a)->getDataType(),
inst->getOperand(a));
inst->setOperand(a, v);
}
}
}
break;
}
}
}
}
// Turn single element vector values into scalars before using it to call an intrinsic func.
void lowerTrivialVector(IRGlobalValueWithCode* func)
{
IRBuilder builder(func->getModule());
List<IRInst*> instsToProcess;
for (auto block : func->getBlocks())
{
for (auto inst = block->getFirstInst(); inst; inst = inst->getNextInst())
{
switch (inst->getOp())
{
case kIROp_Call:
{
// If we are calling an intrinsic with any vector<T,1> argument, replace it
// with T.
auto callInst = as<IRCall>(inst);
if (getResolvedInstForDecorations(callInst->getCallee())
->findDecoration<IRTargetIntrinsicDecoration>())
{
for (UInt a = 0; a < callInst->getArgCount(); a++)
{
auto arg = callInst->getArg(a);
if (auto argVectorType = as<IRVectorType>(arg->getDataType()))
{
if (cast<IRIntLit>(argVectorType->getElementCount())
->getValue() == 1)
{
builder.setInsertBefore(callInst);
UInt idx = 0;
auto newArg = builder.emitSwizzle(
argVectorType->getElementType(),
arg,
1,
&idx);
callInst->setOperand(a + 1, newArg);
}
}
}
}
}
break;
}
}
}
}
void processFunc(IRGlobalValueWithCode* func)
{
if (isCPUTarget(targetReq) || isCUDATarget(targetReq))
{
unifyBinaryExprOperands(func);
lowerTrivialVector(func);
}
eliminateCompositeConstruct(func);
deferAndDuplicateElementExtract(func);
deferAndDuplicateLoad(func);
deferVarDecl(func);
}
void processModule()
{
processInstsOfType<IRFunc>(kIROp_Func, [this](IRFunc* f) { processFunc(f); });
}
};
void simplifyForEmit(IRModule* module, TargetRequest* targetRequest)
{
SimplifyForEmitContext context(module, targetRequest);
context.processModule();
}
} // namespace Slang
|