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
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
|
// slang-serialize-ir.cpp
#include "slang-serialize-ir.h"
#include "../core/slang-byte-encode-util.h"
#include "../core/slang-math.h"
#include "../core/slang-text-io.h"
#include "slang-ir-insts.h"
namespace Slang
{
static bool _isConstant(IROp opIn)
{
const int op = (kIROpMask_OpMask & opIn);
return op >= kIROp_FirstConstant && op <= kIROp_LastConstant;
}
// !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! IRSerialWriter !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
void IRSerialWriter::_addInstruction(IRInst* inst)
{
// It cannot already be in the map
SLANG_ASSERT(!m_instMap.containsKey(inst));
// Add to the map
m_instMap.add(inst, Ser::InstIndex(m_insts.getCount()));
m_insts.add(inst);
}
Result IRSerialWriter::_calcDebugInfo(SerialSourceLocWriter* sourceLocWriter)
{
// We need to find the unique source Locs
// We are not going to store SourceLocs directly, because there may be multiple views mapping
// down to the same underlying source file
// First find all the unique locs
struct InstLoc
{
typedef InstLoc ThisType;
SLANG_FORCE_INLINE bool operator<(const ThisType& rhs) const
{
return sourceLoc < rhs.sourceLoc ||
(sourceLoc == rhs.sourceLoc && instIndex < rhs.instIndex);
}
uint32_t instIndex;
uint32_t sourceLoc;
};
// Find all of the source locations and their associated instructions
List<InstLoc> instLocs;
const Index numInsts = m_insts.getCount();
for (Index i = 1; i < numInsts; i++)
{
IRInst* srcInst = m_insts[i];
if (!srcInst->sourceLoc.isValid())
{
continue;
}
InstLoc instLoc;
instLoc.instIndex = uint32_t(i);
instLoc.sourceLoc = uint32_t(srcInst->sourceLoc.getRaw());
instLocs.add(instLoc);
}
// Sort them
instLocs.sort();
// Look for runs
const InstLoc* startInstLoc = instLocs.begin();
const InstLoc* endInstLoc = instLocs.end();
while (startInstLoc < endInstLoc)
{
const uint32_t startSourceLoc = startInstLoc->sourceLoc;
// Find the run with the same source loc
const InstLoc* curInstLoc = startInstLoc + 1;
uint32_t curInstIndex = startInstLoc->instIndex + 1;
// Find the run size with same source loc and run of instruction indices
for (; curInstLoc < endInstLoc && curInstLoc->sourceLoc == startSourceLoc &&
curInstLoc->instIndex == curInstIndex;
++curInstLoc, ++curInstIndex)
{
}
// Add the run
IRSerialData::SourceLocRun sourceLocRun;
sourceLocRun.m_numInst = curInstIndex - startInstLoc->instIndex;
;
sourceLocRun.m_startInstIndex = IRSerialData::InstIndex(startInstLoc->instIndex);
sourceLocRun.m_sourceLoc =
sourceLocWriter->addSourceLoc(SourceLoc::fromRaw(startSourceLoc));
m_serialData->m_debugSourceLocRuns.add(sourceLocRun);
// Next
startInstLoc = curInstLoc;
}
return SLANG_OK;
}
Result IRSerialWriter::write(
IRModule* module,
SerialSourceLocWriter* sourceLocWriter,
IRSerialData* serialData)
{
typedef Ser::Inst::PayloadType PayloadType;
m_serialData = serialData;
serialData->clear();
// We reserve 0 for null
m_insts.clear();
m_insts.add(nullptr);
// Reset
m_instMap.clear();
m_decorations.clear();
// Stack for parentInst
List<IRInst*> parentInstStack;
IRModuleInst* moduleInst = module->getModuleInst();
parentInstStack.add(moduleInst);
// Add to the map
_addInstruction(moduleInst);
// Traverse all of the instructions
while (parentInstStack.getCount())
{
// If it's in the stack it is assumed it is already in the inst map
IRInst* parentInst = parentInstStack.getLast();
parentInstStack.removeLast();
SLANG_ASSERT(m_instMap.containsKey(parentInst));
// Okay we go through each of the children in order. If they are IRInstParent derived, we
// add to stack to process later cos we want breadth first so the order of children is the
// same as their index order, meaning we don't need to store explicit indices
const Ser::InstIndex startChildInstIndex = Ser::InstIndex(m_insts.getCount());
IRInstListBase childrenList = parentInst->getDecorationsAndChildren();
for (IRInst* child : childrenList)
{
// This instruction can't be in the map...
SLANG_ASSERT(!m_instMap.containsKey(child));
_addInstruction(child);
parentInstStack.add(child);
}
// If it had any children, then store the information about it
if (Ser::InstIndex(m_insts.getCount()) != startChildInstIndex)
{
Ser::InstRun run;
run.m_parentIndex = m_instMap[parentInst];
run.m_startInstIndex = startChildInstIndex;
run.m_numChildren = Ser::SizeType(m_insts.getCount() - int(startChildInstIndex));
m_serialData->m_childRuns.add(run);
}
}
#if 0
{
List<IRInst*> workInsts;
calcInstructionList(module, workInsts);
SLANG_ASSERT(workInsts.getCount() == m_insts.getCount());
for (UInt i = 0; i < workInsts.getCount(); ++i)
{
SLANG_ASSERT(workInsts[i] == m_insts[i]);
}
}
#endif
// Set to the right size
m_serialData->m_insts.setCount(m_insts.getCount());
// Clear all instructions
memset(m_serialData->m_insts.begin(), 0, sizeof(Ser::Inst) * m_serialData->m_insts.getCount());
// Need to set up the actual instructions
{
const Index numInsts = m_insts.getCount();
for (Index i = 1; i < numInsts; ++i)
{
IRInst* srcInst = m_insts[i];
Ser::Inst& dstInst = m_serialData->m_insts[i];
dstInst.m_op = uint16_t(srcInst->getOp() & kIROpMask_OpMask);
dstInst.m_payloadType = PayloadType::Empty;
dstInst.m_resultTypeIndex = getInstIndex(srcInst->getFullType());
IRConstant* irConst = as<IRConstant>(srcInst);
if (irConst)
{
switch (srcInst->getOp())
{
// Special handling for the ir const derived types
case kIROp_BlobLit:
{
// Blobs are serialized into string table like strings
auto stringLit = static_cast<IRBlobLit*>(srcInst);
dstInst.m_payloadType = PayloadType::String_1;
dstInst.m_payload.m_stringIndices[0] =
getStringIndex(stringLit->getStringSlice());
break;
}
case kIROp_StringLit:
{
auto stringLit = static_cast<IRStringLit*>(srcInst);
dstInst.m_payloadType = PayloadType::String_1;
dstInst.m_payload.m_stringIndices[0] =
getStringIndex(stringLit->getStringSlice());
break;
}
case kIROp_IntLit:
{
dstInst.m_payloadType = PayloadType::Int64;
dstInst.m_payload.m_int64 = irConst->value.intVal;
break;
}
case kIROp_PtrLit:
{
dstInst.m_payloadType = PayloadType::Int64;
dstInst.m_payload.m_int64 = (intptr_t)irConst->value.ptrVal;
break;
}
case kIROp_FloatLit:
{
dstInst.m_payloadType = PayloadType::Float64;
dstInst.m_payload.m_float64 = irConst->value.floatVal;
break;
}
case kIROp_BoolLit:
{
dstInst.m_payloadType = PayloadType::UInt32;
dstInst.m_payload.m_uint32 = irConst->value.intVal ? 1 : 0;
break;
}
case kIROp_VoidLit:
{
dstInst.m_payloadType = PayloadType::Empty;
break;
}
default:
{
SLANG_RELEASE_ASSERT(!"Unhandled constant type");
return SLANG_FAIL;
}
}
continue;
}
// ModuleInst is different, in so far as it holds a pointer to IRModule, but we don't
// need to save that off in a special way, so can just use regular path
const int numOperands = int(srcInst->operandCount);
Ser::InstIndex* dstOperands = nullptr;
if (numOperands <= Ser::Inst::kMaxOperands)
{
// Checks the compile below is valid
SLANG_COMPILE_TIME_ASSERT(
PayloadType(0) == PayloadType::Empty &&
PayloadType(1) == PayloadType::Operand_1 &&
PayloadType(2) == PayloadType::Operand_2);
dstInst.m_payloadType = PayloadType(numOperands);
dstOperands = dstInst.m_payload.m_operands;
}
else
{
dstInst.m_payloadType = PayloadType::OperandExternal;
int operandArrayBaseIndex = int(m_serialData->m_externalOperands.getCount());
m_serialData->m_externalOperands.setCount(operandArrayBaseIndex + numOperands);
dstOperands = m_serialData->m_externalOperands.begin() + operandArrayBaseIndex;
auto& externalOperands = dstInst.m_payload.m_externalOperand;
externalOperands.m_arrayIndex = Ser::ArrayIndex(operandArrayBaseIndex);
externalOperands.m_size = Ser::SizeType(numOperands);
}
for (int j = 0; j < numOperands; ++j)
{
const Ser::InstIndex dstInstIndex = getInstIndex(srcInst->getOperand(j));
dstOperands[j] = dstInstIndex;
}
}
}
// Convert strings into a string table
{
SerialStringTableUtil::encodeStringTable(m_stringSlicePool, serialData->m_stringTable);
}
if (sourceLocWriter)
{
_calcDebugInfo(sourceLocWriter);
}
m_serialData = nullptr;
return SLANG_OK;
}
Result _writeInstArrayChunk(
FourCC chunkId,
const List<IRSerialData::Inst>& array,
RIFF::BuildCursor& cursor)
{
if (array.getCount() == 0)
{
return SLANG_OK;
}
return SerialRiffUtil::writeArrayChunk(chunkId, array, cursor);
}
/* static */ Result IRSerialWriter::writeTo(const IRSerialData& data, RIFF::BuildCursor& cursor)
{
SLANG_SCOPED_RIFF_BUILDER_LIST_CHUNK(cursor, Bin::kIRModuleFourCc);
SLANG_RETURN_ON_FAIL(_writeInstArrayChunk(Bin::kInstFourCc, data.m_insts, cursor));
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::writeArrayChunk(Bin::kChildRunFourCc, data.m_childRuns, cursor));
SLANG_RETURN_ON_FAIL(SerialRiffUtil::writeArrayChunk(
Bin::kExternalOperandsFourCc,
data.m_externalOperands,
cursor));
SLANG_RETURN_ON_FAIL(SerialRiffUtil::writeArrayChunk(
SerialBinary::kStringTableFourCc,
data.m_stringTable,
cursor));
SLANG_RETURN_ON_FAIL(SerialRiffUtil::writeArrayChunk(
Bin::kUInt32RawSourceLocFourCc,
data.m_rawSourceLocs,
cursor));
if (data.m_debugSourceLocRuns.getCount())
{
SerialRiffUtil::writeArrayChunk(
Bin::kDebugSourceLocRunFourCc,
data.m_debugSourceLocRuns,
cursor);
}
return SLANG_OK;
}
/* static */ void IRSerialWriter::calcInstructionList(IRModule* module, List<IRInst*>& instsOut)
{
// We reserve 0 for null
instsOut.setCount(1);
instsOut[0] = nullptr;
// Stack for parentInst
List<IRInst*> parentInstStack;
IRModuleInst* moduleInst = module->getModuleInst();
parentInstStack.add(moduleInst);
// Add to list
instsOut.add(moduleInst);
// Traverse all of the instructions
while (parentInstStack.getCount())
{
// If it's in the stack it is assumed it is already in the inst map
IRInst* parentInst = parentInstStack.getLast();
parentInstStack.removeLast();
IRInstListBase childrenList = parentInst->getDecorationsAndChildren();
for (IRInst* child : childrenList)
{
instsOut.add(child);
parentInstStack.add(child);
}
}
}
// !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! IRSerialReader !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
static Result _readInstArrayChunk(RIFF::DataChunk const* chunk, List<IRSerialData::Inst>& arrayOut)
{
SerialRiffUtil::ListResizerForType<IRSerialData::Inst> resizer(arrayOut);
return SerialRiffUtil::readArrayChunk(chunk, resizer);
}
/* static */ Result IRSerialReader::readFrom(
IRModuleChunk const* irModuleChunk,
IRSerialData* outData)
{
typedef IRSerialBinary Bin;
outData->clear();
for (auto chunk : irModuleChunk->getChildren())
{
auto dataChunk = as<RIFF::DataChunk>(chunk);
if (!dataChunk)
{
continue;
}
switch (dataChunk->getType())
{
case Bin::kInstFourCc:
{
SLANG_RETURN_ON_FAIL(_readInstArrayChunk(dataChunk, outData->m_insts));
break;
}
case Bin::kChildRunFourCc:
{
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::readArrayChunk(dataChunk, outData->m_childRuns));
break;
}
case Bin::kExternalOperandsFourCc:
{
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::readArrayChunk(dataChunk, outData->m_externalOperands));
break;
}
case SerialBinary::kStringTableFourCc:
{
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::readArrayChunk(dataChunk, outData->m_stringTable));
break;
}
case Bin::kUInt32RawSourceLocFourCc:
{
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::readArrayChunk(dataChunk, outData->m_rawSourceLocs));
break;
}
case Bin::kDebugSourceLocRunFourCc:
{
SLANG_RETURN_ON_FAIL(
SerialRiffUtil::readArrayChunk(dataChunk, outData->m_debugSourceLocRuns));
break;
}
default:
{
break;
}
}
}
return SLANG_OK;
}
Result IRSerialReader::read(
const IRSerialData& data,
Session* session,
SerialSourceLocReader* sourceLocReader,
RefPtr<IRModule>& outModule)
{
// Only used in debug builds
[[maybe_unused]] typedef Ser::Inst::PayloadType PayloadType;
m_serialData = &data;
auto module = IRModule::create(session);
outModule = module;
m_module = module;
// Convert m_stringTable into StringSlicePool.
SerialStringTableUtil::decodeStringTable(
data.m_stringTable.getBuffer(),
data.m_stringTable.getCount(),
m_stringTable);
// Each IR instruction has:
//
// * An opcode
// * Zero or more operands
// * Zero or more children
//
// Most instructions are entirely defined by those properties.
//
// The instructions that represent simple constants (integers, strings, etc.) are
// unique in that they have "payload" data that holds their value, instead of having
// any operands.
//
// The deserialization logic here is set up to handle an arbitrary configuration
// of IR instructions, which means it can handle cases where:
//
// * An instruction earlier in the serialized stream might refer to an instruction
// later in the stream, as one of its operands or (transitive) children.
//
// * An instruction in the stream transitively depends on itself via operand
// and/or child relationships.
//
// In order to handle these cases, deserialization proceeds in multiple passes.
// In the first pass, `IRInst`s are allocated for each instruction in the stream,
// based on their memory requirements (number of operands in the ordinary case
// and payload size in the case of simple constants). Subsequent passes then
// fill in the operands and/or children.
//
// Note that as a result of the strategy used here, it is not possible for the
// deserialization logic to interact with any systems for deduplication or
// simplification of instructions. An alternative version of the deserializer that
// uses the `IRBuilder` interface instead might be possible, but would need a
// plan for how to handle forward and/or circular references in the IR module.
// Add all the instructions
List<IRInst*> insts;
const Index numInsts = data.m_insts.getCount();
SLANG_ASSERT(numInsts > 0);
insts.setCount(numInsts);
insts[0] = nullptr;
// 0 holds null
// 1 holds the IRModuleInst
{
// Check that insts[1] is the module inst
const Ser::Inst& srcInst = data.m_insts[1];
SLANG_RELEASE_ASSERT(srcInst.m_op == kIROp_ModuleInst);
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::Empty);
// The root IR instruction for the module will already have
// been created as part of creating `module` above.
//
auto moduleInst = module->getModuleInst();
// Set the IRModuleInst
insts[1] = moduleInst;
}
for (Index i = 2; i < numInsts; ++i)
{
const Ser::Inst& srcInst = data.m_insts[i];
const IROp op((IROp)srcInst.m_op);
if (_isConstant(op))
{
// Handling of constants
// Calculate the minimum object size (ie not including the payload of value)
const size_t prefixSize = SLANG_OFFSET_OF(IRConstant, value);
// All IR constants have zero operands.
Int operandCount = 0;
IRConstant* irConst = nullptr;
switch (op)
{
case kIROp_BoolLit:
{
// TODO: Most of these cases could use the templated `_allocateInst<T>`
// *if* we had distinct `IRConstant` subtypes to represent these
// cases and their subtype-specific payloads.
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::UInt32);
irConst = static_cast<IRConstant*>(module->_allocateInst(
op,
operandCount,
prefixSize + sizeof(IRIntegerValue)));
irConst->value.intVal = srcInst.m_payload.m_uint32 != 0;
break;
}
case kIROp_IntLit:
{
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::Int64);
irConst = static_cast<IRConstant*>(module->_allocateInst(
op,
operandCount,
prefixSize + sizeof(IRIntegerValue)));
irConst->value.intVal = srcInst.m_payload.m_int64;
break;
}
case kIROp_PtrLit:
{
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::Int64);
irConst = static_cast<IRConstant*>(
module->_allocateInst(op, operandCount, prefixSize + sizeof(void*)));
irConst->value.ptrVal = (void*)(intptr_t)srcInst.m_payload.m_int64;
break;
}
case kIROp_FloatLit:
{
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::Float64);
irConst = static_cast<IRConstant*>(module->_allocateInst(
op,
operandCount,
prefixSize + sizeof(IRFloatingPointValue)));
irConst->value.floatVal = srcInst.m_payload.m_float64;
break;
}
case kIROp_VoidLit:
{
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::Empty);
irConst = static_cast<IRConstant*>(
module->_allocateInst(op, operandCount, prefixSize));
break;
}
case kIROp_BlobLit:
case kIROp_StringLit:
{
SLANG_ASSERT(srcInst.m_payloadType == PayloadType::String_1);
const UnownedStringSlice slice = m_stringTable.getSlice(
StringSlicePool::Handle(srcInst.m_payload.m_stringIndices[0]));
const size_t sliceSize = slice.getLength();
const size_t instSize =
prefixSize + SLANG_OFFSET_OF(IRConstant::StringValue, chars) + sliceSize;
irConst =
static_cast<IRConstant*>(module->_allocateInst(op, operandCount, instSize));
IRConstant::StringValue& dstString = irConst->value.stringVal;
dstString.numChars = uint32_t(sliceSize);
// Turn into pointer to avoid warning of array overrun
char* dstChars = dstString.chars;
// Copy the chars
memcpy(dstChars, slice.begin(), sliceSize);
break;
}
default:
{
SLANG_ASSERT(!"Unknown constant type");
return SLANG_FAIL;
}
}
insts[i] = irConst;
}
else
{
int numOperands = srcInst.getNumOperands();
insts[i] = module->_allocateInst(op, numOperands);
}
}
// Patch up the operands
for (Index i = 1; i < numInsts; ++i)
{
const Ser::Inst& srcInst = data.m_insts[i];
const IROp op((IROp)srcInst.m_op);
SLANG_UNUSED(op);
IRInst* dstInst = insts[i];
// Set the result type
if (srcInst.m_resultTypeIndex != Ser::InstIndex(0))
{
IRInst* resultInst = insts[int(srcInst.m_resultTypeIndex)];
// NOTE! Counter intuitively the IRType* paramter may not be IRType* derived for example
// IRGlobalGenericParam is valid, but isn't IRType* derived
// SLANG_RELEASE_ASSERT(as<IRType>(resultInst));
dstInst->setFullType(static_cast<IRType*>(resultInst));
}
// if (!isParentDerived(op))
{
const Ser::InstIndex* srcOperandIndices;
const int numOperands = data.getOperands(srcInst, &srcOperandIndices);
auto dstOperands = dstInst->getOperands();
for (int j = 0; j < numOperands; j++)
{
dstOperands[j].init(dstInst, insts[int(srcOperandIndices[j])]);
}
}
}
// Patch up the children
{
const Index numChildRuns = data.m_childRuns.getCount();
for (Index i = 0; i < numChildRuns; i++)
{
const auto& run = data.m_childRuns[i];
IRInst* inst = insts[int(run.m_parentIndex)];
for (int j = 0; j < int(run.m_numChildren); ++j)
{
IRInst* child = insts[j + int(run.m_startInstIndex)];
SLANG_ASSERT(child->parent == nullptr);
child->insertAtEnd(inst);
}
}
}
// Re-add source locations, if they are defined
if (m_serialData->m_rawSourceLocs.getCount() == numInsts)
{
const Ser::RawSourceLoc* srcLocs = m_serialData->m_rawSourceLocs.begin();
for (Index i = 1; i < numInsts; ++i)
{
IRInst* dstInst = insts[i];
dstInst->sourceLoc.setRaw(Slang::SourceLoc::RawValue(srcLocs[i]));
}
}
// We now need to apply the runs
if (sourceLocReader && m_serialData->m_debugSourceLocRuns.getCount())
{
List<IRSerialData::SourceLocRun> sourceRuns(m_serialData->m_debugSourceLocRuns);
// They are now in source location order
sourceRuns.sort();
// Just guess initially 0 for the source file that contains the initial run
SerialSourceLocData::SourceRange range = SerialSourceLocData::SourceRange::getInvalid();
int fix = 0;
const Index numRuns = sourceRuns.getCount();
for (Index i = 0; i < numRuns; ++i)
{
const auto& run = sourceRuns[i];
// Work out the fixed source location
SourceLoc sourceLoc;
if (run.m_sourceLoc)
{
if (!range.contains(run.m_sourceLoc))
{
fix = sourceLocReader->calcFixSourceLoc(run.m_sourceLoc, range);
}
sourceLoc = sourceLocReader->calcFixedLoc(run.m_sourceLoc, fix, range);
}
// Write to all the instructions
SLANG_ASSERT(Index(uint32_t(run.m_startInstIndex) + run.m_numInst) <= insts.getCount());
IRInst** dstInsts = insts.getBuffer() + int(run.m_startInstIndex);
const int runSize = int(run.m_numInst);
for (int j = 0; j < runSize; ++j)
{
dstInsts[j]->sourceLoc = sourceLoc;
}
}
}
outModule->buildMangledNameToGlobalInstMap();
return SLANG_OK;
}
} // namespace Slang
|