-
Notifications
You must be signed in to change notification settings - Fork 10.4k
/
Copy pathSILGenPack.cpp
1125 lines (984 loc) · 46 KB
/
SILGenPack.cpp
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
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//===--- SILGenPack.cpp - Helper routines for lowering variadic packs -----===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#include "Initialization.h"
#include "Scope.h"
#include "SILGenFunction.h"
#include "swift/AST/ASTWalker.h"
#include "swift/AST/GenericEnvironment.h"
using namespace swift;
using namespace Lowering;
namespace {
/// Cleanup to deallocate a now-uninitialized pack.
class DeallocPackCleanup : public Cleanup {
SILValue Addr;
public:
DeallocPackCleanup(SILValue addr) : Addr(addr) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.B.createDeallocPack(l, Addr);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "DeallocPackCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "\n";
#endif
}
};
/// Cleanup to destroy all the values in a pack.
class DestroyPackCleanup : public Cleanup {
SILValue Addr;
CanPackType FormalPackType;
unsigned FirstComponentIndex;
public:
DestroyPackCleanup(SILValue addr, CanPackType formalPackType,
unsigned firstComponentIndex = 0)
: Addr(addr), FormalPackType(formalPackType),
FirstComponentIndex(firstComponentIndex) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitDestroyPack(l, Addr, FormalPackType, FirstComponentIndex);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "DestroyPackCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "FormalPackType: " << FormalPackType
<< "FirstComponentIndex:" << FirstComponentIndex << "\n";
#endif
}
};
/// Cleanup to destroy the preceding values in a pack-expansion
/// component of a pack.
class PartialDestroyPackCleanup : public Cleanup {
SILValue Addr;
unsigned PackComponentIndex;
/// NOTE: It is expected that LimitWithinComponent maybe an empty SILValue.
SILValue LimitWithinComponent;
CanPackType FormalPackType;
public:
PartialDestroyPackCleanup(SILValue addr, CanPackType formalPackType,
unsigned packComponentIndex,
SILValue limitWithinComponent)
: Addr(addr), PackComponentIndex(packComponentIndex),
LimitWithinComponent(limitWithinComponent),
FormalPackType(formalPackType) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitPartialDestroyPack(l, Addr, FormalPackType, PackComponentIndex,
LimitWithinComponent);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "PartialDestroyPackCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "FormalPackType: " << FormalPackType
<< "\n"
<< "ComponentIndex: " << PackComponentIndex << "\n"
<< "LimitWithinComponent: ";
if (LimitWithinComponent)
llvm::errs() << LimitWithinComponent;
else
llvm::errs() << "None\n";
#endif
}
};
/// Cleanup to destroy the remaining values in a pack-expansion
/// component of a pack.
class PartialDestroyRemainingPackCleanup : public Cleanup {
SILValue Addr;
unsigned ComponentIndex;
SILValue CurrentIndexWithinComponent;
CanPackType FormalPackType;
public:
PartialDestroyRemainingPackCleanup(SILValue packAddr,
CanPackType formalPackType,
unsigned componentIndex,
SILValue currentIndexWithinComponent)
: Addr(packAddr), ComponentIndex(componentIndex),
CurrentIndexWithinComponent(currentIndexWithinComponent),
FormalPackType(formalPackType) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitPartialDestroyRemainingPack(l, Addr, FormalPackType,
ComponentIndex,
CurrentIndexWithinComponent);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "PartialDestroyRemainingPackCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "FormalPackType: " << FormalPackType
<< "\n"
<< "ComponentIndex: " << ComponentIndex << "\n"
<< "CurrentIndexWithinComponent: "
<< CurrentIndexWithinComponent << "\n";
#endif
}
};
/// Cleanup to destroy the preceding values in a pack-expansion
/// component of a tuple.
class PartialDestroyTupleCleanup : public Cleanup {
SILValue Addr;
unsigned ComponentIndex;
SILValue LimitWithinComponent;
CanPackType InducedPackType;
public:
PartialDestroyTupleCleanup(SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue limitWithinComponent)
: Addr(tupleAddr), ComponentIndex(componentIndex),
LimitWithinComponent(limitWithinComponent),
InducedPackType(inducedPackType) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitPartialDestroyTuple(l, Addr, InducedPackType, ComponentIndex,
LimitWithinComponent);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "PartialDestroyTupleCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "InducedPackType: " << InducedPackType
<< "\n"
<< "ComponentIndex: " << ComponentIndex << '\n'
<< "LimitWithinComponent: " << LimitWithinComponent << '\n';
#endif
}
};
/// Cleanup to destroy the remaining values in a pack-expansion
/// component of a tuple.
class PartialDestroyRemainingTupleCleanup : public Cleanup {
SILValue Addr;
unsigned ComponentIndex;
SILValue CurrentIndexWithinComponent;
CanPackType InducedPackType;
public:
PartialDestroyRemainingTupleCleanup(SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue currentIndexWithinComponent)
: Addr(tupleAddr), ComponentIndex(componentIndex),
CurrentIndexWithinComponent(currentIndexWithinComponent),
InducedPackType(inducedPackType) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitPartialDestroyRemainingTuple(l, Addr, InducedPackType,
ComponentIndex,
CurrentIndexWithinComponent);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "PartialDestroyRemainingTupleCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "InducedPackType: " << InducedPackType
<< "\n"
<< "ComponentIndex: " << ComponentIndex << "\n"
<< "CurrentIndexWithinComponent: "
<< CurrentIndexWithinComponent;
#endif
}
};
/// Cleanup to destroy the remaining elements in a tuple following a
/// particular value.
class DestroyRemainingTupleElementsCleanup : public Cleanup {
SILValue Addr;
unsigned ComponentIndex;
CanPackType InducedPackType;
public:
DestroyRemainingTupleElementsCleanup(SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex)
: Addr(tupleAddr), ComponentIndex(componentIndex),
InducedPackType(inducedPackType) {}
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override {
SGF.emitDestroyRemainingTupleElements(l, Addr, InducedPackType,
ComponentIndex);
}
void dump(SILGenFunction &) const override {
#ifndef NDEBUG
llvm::errs() << "DestroyRemainingTupleElementsCleanup\n"
<< "State: " << getState() << "\n"
<< "Addr: " << Addr << "InducedPackType: " << InducedPackType
<< "\n"
<< "ComponentIndex: " << ComponentIndex << "\n";
#endif
}
};
/// An ASTWalker to emit tuple values in `MaterializePackExpr` nodes.
///
/// Materialized packs are emitted inside a pack expansion context before
/// entering the dynamic pack loop so that the values are only evaluated
/// once, rather than at each pack element iteration.
struct MaterializePackEmitter : public ASTWalker {
SILGenFunction &SGF;
MaterializePackEmitter(SILGenFunction &SGF) : SGF(SGF) {}
ASTWalker::PreWalkResult<Expr *> walkToExprPre(Expr *expr) override {
using Action = ASTWalker::Action;
// Don't walk into nested pack expansions.
if (isa<PackExpansionExpr>(expr))
return Action::SkipChildren(expr);
if (auto *packExpr = dyn_cast<MaterializePackExpr>(expr)) {
auto *fromExpr = packExpr->getFromExpr();
assert(fromExpr->getType()->is<TupleType>());
auto &lowering = SGF.getTypeLowering(fromExpr->getType());
auto loweredTy = lowering.getLoweredType();
auto tupleAddr = SGF.emitTemporaryAllocation(fromExpr, loweredTy);
auto init = SGF.useBufferAsTemporary(tupleAddr, lowering);
SGF.emitExprInto(fromExpr, init.get());
// Write the tuple value to a side table in the active pack expansion
// to be projected later within the dynamic pack loop.
auto *activeExpansion = SGF.getInnermostPackExpansion();
activeExpansion->MaterializedPacks[packExpr] = tupleAddr;
}
return Action::Continue(expr);
}
};
} // end anonymous namespace
void
SILGenFunction::prepareToEmitPackExpansionExpr(PackExpansionExpr *E) {
MaterializePackEmitter tempPackEmission(*this);
E->getPatternExpr()->walk(tempPackEmission);
}
CleanupHandle SILGenFunction::enterDeallocPackCleanup(SILValue temp) {
assert(temp->getType().isAddress() && "dealloc must have an address type");
assert(temp->getType().is<SILPackType>());
Cleanups.pushCleanup<DeallocPackCleanup>(temp);
return Cleanups.getTopCleanup();
}
CleanupHandle SILGenFunction::enterDestroyPackCleanup(SILValue addr,
CanPackType formalPackType) {
Cleanups.pushCleanup<DestroyPackCleanup>(addr, formalPackType);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterDestroyRemainingPackComponentsCleanup(SILValue addr,
CanPackType formalPackType,
unsigned componentIndex) {
Cleanups.pushCleanup<DestroyPackCleanup>(addr, formalPackType,
componentIndex);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterPartialDestroyPackCleanup(SILValue addr,
CanPackType formalPackType,
unsigned packComponentIndex,
SILValue limitWithinComponent) {
Cleanups.pushCleanup<PartialDestroyPackCleanup>(addr, formalPackType,
packComponentIndex,
limitWithinComponent);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterPartialDestroyRemainingPackCleanup(SILValue addr,
CanPackType formalPackType,
unsigned componentIndex,
SILValue indexWithinComponent) {
Cleanups.pushCleanup<PartialDestroyRemainingPackCleanup>(addr,
formalPackType,
componentIndex,
indexWithinComponent);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterPartialDestroyTupleCleanup(SILValue addr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue limitWithinComponent) {
Cleanups.pushCleanup<PartialDestroyTupleCleanup>(addr, inducedPackType,
componentIndex,
limitWithinComponent);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterPartialDestroyRemainingTupleCleanup(SILValue addr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue indexWithinComponent) {
Cleanups.pushCleanup<PartialDestroyRemainingTupleCleanup>(addr,
inducedPackType,
componentIndex,
indexWithinComponent);
return Cleanups.getTopCleanup();
}
CleanupHandle
SILGenFunction::enterDestroyRemainingTupleElementsCleanup(SILValue addr,
CanPackType formalPackType,
unsigned componentIndex) {
Cleanups.pushCleanup<DestroyRemainingTupleElementsCleanup>(addr,
formalPackType,
componentIndex);
return Cleanups.getTopCleanup();
}
void SILGenFunction::emitDestroyPack(SILLocation loc, SILValue packAddr,
CanPackType formalPackType,
unsigned firstComponentIndex) {
auto packTy = packAddr->getType().castTo<SILPackType>();
// Destroy each of the elements of the pack.
for (auto componentIndex :
range(firstComponentIndex, packTy->getNumElements())) {
auto eltTy = packTy->getSILElementType(componentIndex);
// We can skip this if the whole thing is trivial.
auto &eltTL = getTypeLowering(eltTy);
if (eltTL.isTrivial()) continue;
// If it's an expansion component, emit a "partial"-destroy loop.
if (auto expansion = eltTy.getAs<PackExpansionType>()) {
emitPartialDestroyPack(loc, packAddr, formalPackType, componentIndex,
/*limit*/ nullptr);
// If it's a scalar component, project and destroy it.
} else {
auto packIndex =
B.createScalarPackIndex(loc, componentIndex, formalPackType);
auto eltAddr =
B.createPackElementGet(loc, packIndex, packAddr, eltTy);
B.createDestroyAddr(loc, eltAddr);
}
}
}
ManagedValue
SILGenFunction::emitManagedPackWithCleanup(SILValue addr,
CanPackType formalPackType) {
// If the pack type is trivial, we're done.
if (getTypeLowering(addr->getType()).isTrivial())
return ManagedValue::forTrivialAddressRValue(addr);
// If we weren't given a formal pack type, construct one induced from
// the lowered pack type.
auto packType = addr->getType().castTo<SILPackType>();
if (!formalPackType)
formalPackType = packType->getApproximateFormalPackType();
// Enter a cleanup for the pack.
auto cleanup = enterDestroyPackCleanup(addr, formalPackType);
return ManagedValue::forOwnedAddressRValue(addr, cleanup);
}
static bool isPatternInvariantToExpansion(CanType patternType,
CanPackArchetypeType countArchetype) {
return !patternType.findIf([&](CanType type) {
if (auto archetype = dyn_cast<PackArchetypeType>(type)) {
return archetype == countArchetype ||
archetype->getReducedShape() == countArchetype->getReducedShape();
}
return false;
});
}
std::pair<GenericEnvironment*, SILType>
SILGenFunction::createOpenedElementValueEnvironment(SILType expansionTy) {
SILType eltTy;
auto env = createOpenedElementValueEnvironment({expansionTy}, {&eltTy});
return std::make_pair(env, eltTy);
}
GenericEnvironment *
SILGenFunction::createOpenedElementValueEnvironment(
ArrayRef<SILType> expansionTys,
ArrayRef<SILType*> eltTys) {
// The element-types output array should be the same size as the
// expansion-types input array. We don't currently have a reason
// to allow them to be empty --- we never do this with a dynamic
// set of types --- but maybe it's justifiable.
assert(expansionTys.size() == eltTys.size());
assert(!expansionTys.empty());
if (expansionTys.empty()) return nullptr;
auto countArchetype = cast<PackArchetypeType>(
expansionTys[0].castTo<PackExpansionType>().getCountType());
GenericEnvironment *env = nullptr;
for (auto i : indices(expansionTys)) {
auto exp = expansionTys[i].castTo<PackExpansionType>();
assert((i == 0 ||
countArchetype->getReducedShape() ==
cast<PackArchetypeType>(exp.getCountType())->getReducedShape())
&& "expansions are over packs with different shapes");
// The lowered element type is the lowered pattern type, if that's
// invariant to expansion, or else the expansion mapping of that in
// the opened-element environment.
auto loweredPatternTy = exp.getPatternType();
auto loweredEltTy = loweredPatternTy;
if (!isPatternInvariantToExpansion(loweredPatternTy, countArchetype)) {
// Lazily create the opened-element environment if we find a
// pattern type that's not invariant to expansion.
if (!env) {
auto context = OpenedElementContext::
createForContextualExpansion(SGM.getASTContext(), exp);
env = context.environment;
}
loweredEltTy =
env->mapContextualPackTypeIntoElementContext(loweredPatternTy);
}
*eltTys[i] = SILType::getPrimitiveAddressType(loweredEltTy);
}
return env;
}
void SILGenFunction::emitPartialDestroyPack(SILLocation loc, SILValue packAddr,
CanPackType formalPackType,
unsigned componentIndex,
SILValue limitWithinComponent) {
auto packTy = packAddr->getType().castTo<SILPackType>();
auto result = createOpenedElementValueEnvironment(
packTy->getSILElementType(componentIndex));
auto elementEnv = result.first;
auto elementTy = result.second;
emitDynamicPackLoop(loc, formalPackType, componentIndex,
/*startAfter*/ SILValue(), limitWithinComponent,
elementEnv, /*reverse*/ true,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto eltAddr = B.createPackElementGet(loc, packIndex, packAddr, elementTy);
B.createDestroyAddr(loc, eltAddr);
});
}
void SILGenFunction::emitPartialDestroyRemainingPack(SILLocation loc,
SILValue packAddr,
CanPackType formalPackType,
unsigned componentIndex,
SILValue currentIndexWithinComponent) {
auto result = createOpenedElementValueEnvironment(
packAddr->getType().getPackElementType(componentIndex));
auto elementEnv = result.first;
auto elementTy = result.second;
emitDynamicPackLoop(loc, formalPackType, componentIndex,
/*startAfter*/ currentIndexWithinComponent,
/*limit*/ SILValue(), elementEnv, /*reverse*/ false,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto eltAddr =
B.createPackElementGet(loc, packIndex, packAddr, elementTy);
B.createDestroyAddr(loc, eltAddr);
});
}
void SILGenFunction::emitPartialDestroyTuple(SILLocation loc,
SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue limitWithinComponent) {
auto result = createOpenedElementValueEnvironment(
tupleAddr->getType().getTupleElementType(componentIndex));
auto elementEnv = result.first;
auto elementTy = result.second;
emitDynamicPackLoop(loc, inducedPackType, componentIndex,
/*startAfter*/ SILValue(), limitWithinComponent,
elementEnv, /*reverse*/ true,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto eltAddr =
B.createTuplePackElementAddr(loc, packIndex, tupleAddr, elementTy);
B.createDestroyAddr(loc, eltAddr);
});
}
void SILGenFunction::emitPartialDestroyRemainingTuple(SILLocation loc,
SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex,
SILValue currentIndexWithinComponent) {
auto result = createOpenedElementValueEnvironment(
tupleAddr->getType().getTupleElementType(componentIndex));
auto elementEnv = result.first;
auto elementTy = result.second;
emitDynamicPackLoop(loc, inducedPackType, componentIndex,
/*startAfter*/ currentIndexWithinComponent,
/*limit*/ SILValue(), elementEnv, /*reverse*/ false,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto eltAddr =
B.createTuplePackElementAddr(loc, packIndex, tupleAddr, elementTy);
B.createDestroyAddr(loc, eltAddr);
});
}
void SILGenFunction::emitDestroyRemainingTupleElements(
SILLocation loc, SILValue tupleAddr,
CanPackType inducedPackType, unsigned firstComponentIndex) {
auto tupleTy = tupleAddr->getType().castTo<TupleType>();
bool containsExpansions = tupleTy->containsPackExpansionType();
assert(!containsExpansions || inducedPackType);
// Destroy each of the elements of the pack.
for (auto componentIndex :
range(firstComponentIndex, tupleTy->getNumElements())) {
auto eltTy = tupleAddr->getType().getTupleElementType(componentIndex);
// We can skip this if the whole thing is trivial.
auto &eltTL = getTypeLowering(eltTy);
if (eltTL.isTrivial()) continue;
// If it's an expansion component, emit a "partial"-destroy loop.
if (auto expansion = eltTy.getAs<PackExpansionType>()) {
emitPartialDestroyRemainingTuple(loc, tupleAddr, inducedPackType,
componentIndex, /*limit*/ nullptr);
// If it's a scalar component, project and destroy it.
} else {
SILValue eltAddr;
if (containsExpansions) {
auto packIndex =
B.createScalarPackIndex(loc, componentIndex, inducedPackType);
eltAddr =
B.createTuplePackElementAddr(loc, packIndex, tupleAddr, eltTy);
} else {
eltAddr =
B.createTupleElementAddr(loc, tupleAddr, componentIndex, eltTy);
}
B.createDestroyAddr(loc, eltAddr);
}
}
}
void SILGenFunction::copyPackElementsToTuple(SILLocation loc,
SILValue tupleAddr,
SILValue pack,
CanPackType formalPackType) {
auto pair = createOpenedElementValueEnvironment(
tupleAddr->getType().getTupleElementType(/*componentIndex=*/0));
auto elementEnv = pair.first;
auto elementTy = pair.second;
emitDynamicPackLoop(
loc, formalPackType, /*componentIndex=*/0, elementEnv,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto packEltAddr = B.createPackElementGet(
loc, packIndex, pack, elementTy);
auto tupleEltAddr = B.createTuplePackElementAddr(
loc, packIndex, tupleAddr, elementTy);
B.createCopyAddr(loc, packEltAddr, tupleEltAddr,
IsNotTake, IsInitialization);
});
}
void SILGenFunction::projectTupleElementsToPack(SILLocation loc,
SILValue tupleAddr,
SILValue pack,
CanPackType formalPackType) {
auto pair = createOpenedElementValueEnvironment(
tupleAddr->getType().getTupleElementType(/*componentIndex=*/0));
auto elementEnv = pair.first;
auto elementTy = pair.second;
emitDynamicPackLoop(
loc, formalPackType, /*componentIndex=*/0, elementEnv,
[&](SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex) {
auto tupleEltAddr = B.createTuplePackElementAddr(
loc, packIndex, tupleAddr, elementTy);
B.createPackElementSet(loc, tupleEltAddr, packIndex, pack);
});
}
void SILGenFunction::emitDynamicPackLoop(SILLocation loc,
CanPackType formalPackType,
unsigned componentIndex,
GenericEnvironment *openedElementEnv,
llvm::function_ref<void(SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex)> emitBody) {
return emitDynamicPackLoop(loc, formalPackType, componentIndex,
/*startAfter*/ SILValue(), /*limit*/ SILValue(),
openedElementEnv, /*reverse*/false, emitBody);
}
void SILGenFunction::emitDynamicPackLoop(SILLocation loc,
CanPackType formalPackType,
unsigned componentIndex,
SILValue startingAfterIndexInComponent,
SILValue limitWithinComponent,
GenericEnvironment *openedElementEnv,
bool reverse,
llvm::function_ref<void(SILValue indexWithinComponent,
SILValue packExpansionIndex,
SILValue packIndex)> emitBody) {
assert(isa<PackExpansionType>(formalPackType.getElementType(componentIndex)));
assert((!startingAfterIndexInComponent || !reverse) &&
"cannot reverse with a starting index");
ASTContext &ctx = SGM.getASTContext();
// Save and restore the innermost pack expansion.
ActivePackExpansion activeExpansionRecord = {
openedElementEnv
};
llvm::SaveAndRestore<ActivePackExpansion*>
packExpansionScope(InnermostPackExpansion, &activeExpansionRecord);
if (auto *expansion = loc.getAsASTNode<PackExpansionExpr>())
prepareToEmitPackExpansionExpr(expansion);
auto wordTy = SILType::getBuiltinWordType(ctx);
auto boolTy = SILType::getBuiltinIntegerType(1, ctx);
SILValue zero;
if (!startingAfterIndexInComponent) {
zero = B.createIntegerLiteral(loc, wordTy, 0);
}
auto one = B.createIntegerLiteral(loc, wordTy, 1);
// The formal type of the component of the pack that we're iterating over.
// If this isn't the entire pack, we'll dynamically index into just the
// expansion component and then compose that into an index into the larger
// pack.
CanPackType formalDynamicPackType = formalPackType;
bool needsSlicing = formalPackType->getNumElements() != 1;
if (needsSlicing) {
formalDynamicPackType =
CanPackType::get(ctx, formalPackType.getElementType(componentIndex));
}
// If the caller didn't give us a limit, use the full length of the
// pack expansion.
if (!limitWithinComponent) {
limitWithinComponent = B.createPackLength(loc, formalDynamicPackType);
}
// The initial index value: the limit if iterating in reverse,
// otherwise the start-after index + 1 if we have one, otherwise 0.
SILValue startingIndex;
if (reverse) {
startingIndex = limitWithinComponent;
} else if (startingAfterIndexInComponent) {
startingIndex = B.createBuiltinBinaryFunction(loc, "add", wordTy, wordTy,
{ startingAfterIndexInComponent, one });
} else {
startingIndex = zero;
}
// Branch to the loop condition block, passing the initial index value.
auto condBB = createBasicBlock();
B.createBranch(loc, condBB, { startingIndex });
// Condition block:
B.emitBlock(condBB);
auto incomingIndex = condBB->createPhiArgument(wordTy, OwnershipKind::None);
// Branch to the end block if the incoming index value is equal to the
// end index (the limit if forward, 0 if reverse).
auto atEnd =
B.createBuiltinBinaryFunction(loc, "cmp_eq", wordTy, boolTy,
{ incomingIndex,
reverse ? zero : limitWithinComponent });
auto bodyBB = createBasicBlock();
auto endBB = createBasicBlockAfter(bodyBB);
B.createCondBranch(loc, atEnd, endBB, bodyBB);
// Body block:
B.emitBlock(bodyBB);
// The index to use in this iteration (the incoming index if forward,
// the incoming index - 1 if reverse)
SILValue curIndex = incomingIndex;
if (reverse) {
curIndex = B.createBuiltinBinaryFunction(loc, "sub", wordTy, wordTy,
{ incomingIndex, one });
}
// Construct the dynamic pack index into the component.
SILValue packExpansionIndex =
B.createDynamicPackIndex(loc, curIndex, formalDynamicPackType);
getInnermostPackExpansion()->ExpansionIndex = packExpansionIndex;
// If there's an opened element environment, open it here.
if (openedElementEnv) {
B.createOpenPackElement(loc, packExpansionIndex, openedElementEnv);
}
// If there are multiple pack components in the overall pack, construct
// the overall pack index.
SILValue packIndex = packExpansionIndex;
if (needsSlicing) {
packIndex = B.createPackPackIndex(loc, componentIndex, packIndex,
formalPackType);
}
// Emit the loop body in a scope as a convenience, since it's necessary
// to avoid dominance problems anyway.
{
FullExpr scope(Cleanups, CleanupLocation(loc));
emitBody(curIndex, packExpansionIndex, packIndex);
}
// The index to pass to the loop condition block (the current index + 1
// if forward, the current index if reverse)
SILValue outgoingIndex = curIndex;
if (!reverse) {
outgoingIndex = B.createBuiltinBinaryFunction(loc, "add", wordTy, wordTy,
{ curIndex, one });
}
B.createBranch(loc, condBB, {outgoingIndex});
// End block:
B.emitBlock(endBB);
}
/// Given that we're within a dynamic pack loop with the same expansion
/// shape as a pack expansion component of the given formal pack type,
/// produce a pack index for the current component within the formal pack.
///
/// Note that the *outer* pack index for the dynamic pack loop
/// isn't necessarily correct for the given pack, just the *expansion*
/// pack index.
static SILValue emitPackPackIndexForActiveExpansion(SILGenFunction &SGF,
SILLocation loc,
CanPackType formalPackType,
unsigned componentIndex) {
auto activeExpansion = SGF.getInnermostPackExpansion();
auto packIndex = activeExpansion->ExpansionIndex;
if (formalPackType->getNumElements() != 1) {
packIndex = SGF.B.createPackPackIndex(loc, componentIndex, packIndex,
formalPackType);
}
return packIndex;
}
void InPlacePackExpansionInitialization::
performPackExpansionInitialization(SILGenFunction &SGF,
SILLocation loc,
SILValue indexWithinComponent,
llvm::function_ref<void(Initialization *into)> fn) {
// Enter a cleanup to destroy elements of the expansion up to the
// current index. We only need to do this if the elements are
// non-trivial, which we've already checked in order to decide whether
// to set up the dormant full-expansion cleanup. So we can just check
// that instead of looking at type properties again.
bool needCleanups = ExpansionCleanup.isValid();
CleanupHandle packCleanup = CleanupHandle::invalid();
if (needCleanups)
packCleanup = enterPartialDestroyCleanup(SGF, indexWithinComponent);
// The pack index from the active pack expansion is just into the
// expansion component; wrap it as necessary to index into the larger
// pack/tuple element list.
auto packIndex = emitPackPackIndexForActiveExpansion(SGF, loc,
FormalPackType,
ComponentIndex);
// Translate the pattern type into the environment of the innermost
// pack expansion.
auto loweredPatternTy = getLoweredExpansionType().getPatternType();
if (auto env = SGF.getInnermostPackExpansion()->OpenedElementEnv) {
// This AST-level transformation is fine on lowered types because
// we're just replacing pack archetypes with element archetypes.
loweredPatternTy =
env->mapContextualPackTypeIntoElementContext(loweredPatternTy);
}
auto eltAddrTy = SILType::getPrimitiveAddressType(loweredPatternTy);
// Project the element address.
auto eltAddr = getElementAddress(SGF, loc, packIndex, eltAddrTy);
// Enter a dormant address for the element, under the same condition
// as above.
CleanupHandle eltCleanup = CleanupHandle::invalid();
if (needCleanups) {
eltCleanup = SGF.enterDestroyCleanup(eltAddr);
SGF.Cleanups.setCleanupState(eltCleanup, CleanupState::Dormant);
}
// Emit the initialization into the temporary.
TemporaryInitialization eltInit(eltAddr, eltCleanup);
fn(&eltInit);
// Deactivate the cleanups before continuing the loop.
if (needCleanups) {
SGF.Cleanups.forwardCleanup(packCleanup);
SGF.Cleanups.forwardCleanup(eltCleanup);
}
}
bool InPlacePackExpansionInitialization::
canPerformInPlacePackInitialization(GenericEnvironment *env,
SILType eltAddrTy) const {
auto loweredPatternTy = getLoweredExpansionType().getPatternType();
if (env) {
loweredPatternTy =
env->mapContextualPackTypeIntoElementContext(loweredPatternTy);
}
return loweredPatternTy == eltAddrTy.getASTType();
}
SILValue InPlacePackExpansionInitialization::
getAddressForInPlacePackInitialization(SILGenFunction &SGF,
SILLocation loc,
SILType eltAddrTy) {
auto packIndex = emitPackPackIndexForActiveExpansion(SGF, loc,
FormalPackType,
ComponentIndex);
return getElementAddress(SGF, loc, packIndex, eltAddrTy);
}
void InPlacePackExpansionInitialization::
finishInitialization(SILGenFunction &SGF) {
if (ExpansionCleanup.isValid())
SGF.Cleanups.setCleanupState(ExpansionCleanup, CleanupState::Active);
}
void InPlacePackExpansionInitialization::
enterDormantExpansionCleanup(SILGenFunction &SGF) {
assert(!ExpansionCleanup.isValid());
auto loweredExpansionTy = getLoweredExpansionType();
auto loweredPatternTy = loweredExpansionTy.getPatternType();
// Enter a dormant cleanup to destroy the pack expansion elements
// if they're non-trivial.
if (!SGF.getTypeLowering(loweredPatternTy).isTrivial()) {
ExpansionCleanup = enterPartialDestroyCleanup(SGF, /*limit*/SILValue());
SGF.Cleanups.setCleanupState(ExpansionCleanup, CleanupState::Dormant);
}
}
std::unique_ptr<PackExpansionInitialization>
PackExpansionInitialization::create(SILGenFunction &SGF, SILValue packAddr,
CanPackType formalPackType,
unsigned componentIndex) {
auto init =
std::make_unique<PackExpansionInitialization>(packAddr, formalPackType,
componentIndex);
init->enterDormantExpansionCleanup(SGF);
return init;
}
CanPackExpansionType
PackExpansionInitialization::getLoweredExpansionType() const {
auto loweredPackTy = PackAddr->getType().castTo<SILPackType>();
auto loweredComponentTy = loweredPackTy->getElementType(ComponentIndex);
return cast<PackExpansionType>(loweredComponentTy);
}
CleanupHandle
PackExpansionInitialization::enterPartialDestroyCleanup(SILGenFunction &SGF,
SILValue limitWithinComponent) {
return SGF.enterPartialDestroyPackCleanup(PackAddr, FormalPackType,
ComponentIndex,
limitWithinComponent);
}
SILValue PackExpansionInitialization::getElementAddress(SILGenFunction &SGF,
SILLocation loc,
SILValue packIndex,
SILType eltAddrTy) {
return SGF.B.createPackElementGet(loc, packIndex, PackAddr, eltAddrTy);
}
std::unique_ptr<TuplePackExpansionInitialization>
TuplePackExpansionInitialization::create(SILGenFunction &SGF,
SILValue tupleAddr,
CanPackType inducedPackType,
unsigned componentIndex) {
auto init = std::make_unique<TuplePackExpansionInitialization>(tupleAddr,
inducedPackType,
componentIndex);
init->enterDormantExpansionCleanup(SGF);
return init;
}
CanPackExpansionType
TuplePackExpansionInitialization::getLoweredExpansionType() const {
auto loweredTupleTy = TupleAddr->getType().castTo<TupleType>();
auto loweredComponentTy = loweredTupleTy.getElementType(ComponentIndex);
return cast<PackExpansionType>(loweredComponentTy);
}
CleanupHandle TuplePackExpansionInitialization::
enterPartialDestroyCleanup(SILGenFunction &SGF,
SILValue limitWithinComponent) {
return SGF.enterPartialDestroyTupleCleanup(TupleAddr, FormalPackType,
ComponentIndex,
limitWithinComponent);
}
SILValue
TuplePackExpansionInitialization::getElementAddress(SILGenFunction &SGF,
SILLocation loc,
SILValue packIndex,
SILType eltAddrTy) {
return SGF.B.createTuplePackElementAddr(loc, packIndex, TupleAddr, eltAddrTy);
}
ManagedValue
SILGenFunction::emitPackTransform(SILLocation loc,
ManagedValue inputPackMV,
CanPackType inputFormalPackType,
unsigned inputComponentIndex,
SILValue outputPackAddr,
CanPackType outputFormalPackType,
unsigned outputComponentIndex,
bool isSimpleProjection,
bool canForwardOutput,
llvm::function_ref<ManagedValue(ManagedValue input,
SILType outputEltTy,
SGFContext context)> emitBody) {
// This is an inherent limitation of the representation; we need pack
// coroutines to get around it.
assert((isSimpleProjection || canForwardOutput) &&
"we cannot support complex transformations that yield borrows");
CleanupCloner inputCloner(*this, inputPackMV);
bool inputHasCleanup = inputPackMV.hasCleanup();