aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/llvm12/lib/Transforms/Scalar/ScalarizeMaskedMemIntrin.cpp
blob: c8da464a3b7f6592fb44103493f68ee1d3a71fec (plain) (blame)
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
//===- ScalarizeMaskedMemIntrin.cpp - Scalarize unsupported masked mem ----===// 
//                                    instrinsics 
// 
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 
// See https://llvm.org/LICENSE.txt for license information. 
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 
// 
//===----------------------------------------------------------------------===// 
// 
// This pass replaces masked memory intrinsics - when unsupported by the target 
// - with a chain of basic blocks, that deal with the elements one-by-one if the 
// appropriate mask bit is set. 
// 
//===----------------------------------------------------------------------===// 
 
#include "llvm/Transforms/Scalar/ScalarizeMaskedMemIntrin.h" 
#include "llvm/ADT/Twine.h" 
#include "llvm/Analysis/TargetTransformInfo.h" 
#include "llvm/IR/BasicBlock.h" 
#include "llvm/IR/Constant.h" 
#include "llvm/IR/Constants.h" 
#include "llvm/IR/DerivedTypes.h" 
#include "llvm/IR/Function.h" 
#include "llvm/IR/IRBuilder.h" 
#include "llvm/IR/InstrTypes.h" 
#include "llvm/IR/Instruction.h" 
#include "llvm/IR/Instructions.h" 
#include "llvm/IR/IntrinsicInst.h" 
#include "llvm/IR/Intrinsics.h" 
#include "llvm/IR/Type.h" 
#include "llvm/IR/Value.h" 
#include "llvm/InitializePasses.h" 
#include "llvm/Pass.h" 
#include "llvm/Support/Casting.h" 
#include "llvm/Transforms/Scalar.h" 
#include <algorithm> 
#include <cassert> 
 
using namespace llvm; 
 
#define DEBUG_TYPE "scalarize-masked-mem-intrin" 
 
namespace { 
 
class ScalarizeMaskedMemIntrinLegacyPass : public FunctionPass { 
public: 
  static char ID; // Pass identification, replacement for typeid 
 
  explicit ScalarizeMaskedMemIntrinLegacyPass() : FunctionPass(ID) { 
    initializeScalarizeMaskedMemIntrinLegacyPassPass( 
        *PassRegistry::getPassRegistry()); 
  } 
 
  bool runOnFunction(Function &F) override; 
 
  StringRef getPassName() const override { 
    return "Scalarize Masked Memory Intrinsics"; 
  } 
 
  void getAnalysisUsage(AnalysisUsage &AU) const override { 
    AU.addRequired<TargetTransformInfoWrapperPass>(); 
  } 
}; 
 
} // end anonymous namespace 
 
static bool optimizeBlock(BasicBlock &BB, bool &ModifiedDT, 
                          const TargetTransformInfo &TTI, const DataLayout &DL); 
static bool optimizeCallInst(CallInst *CI, bool &ModifiedDT, 
                             const TargetTransformInfo &TTI, 
                             const DataLayout &DL); 
 
char ScalarizeMaskedMemIntrinLegacyPass::ID = 0; 
 
INITIALIZE_PASS_BEGIN(ScalarizeMaskedMemIntrinLegacyPass, DEBUG_TYPE, 
                      "Scalarize unsupported masked memory intrinsics", false, 
                      false) 
INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass) 
INITIALIZE_PASS_END(ScalarizeMaskedMemIntrinLegacyPass, DEBUG_TYPE, 
                    "Scalarize unsupported masked memory intrinsics", false, 
                    false) 
 
FunctionPass *llvm::createScalarizeMaskedMemIntrinLegacyPass() { 
  return new ScalarizeMaskedMemIntrinLegacyPass(); 
} 
 
static bool isConstantIntVector(Value *Mask) { 
  Constant *C = dyn_cast<Constant>(Mask); 
  if (!C) 
    return false; 
 
  unsigned NumElts = cast<FixedVectorType>(Mask->getType())->getNumElements(); 
  for (unsigned i = 0; i != NumElts; ++i) { 
    Constant *CElt = C->getAggregateElement(i); 
    if (!CElt || !isa<ConstantInt>(CElt)) 
      return false; 
  } 
 
  return true; 
} 
 
// Translate a masked load intrinsic like 
// <16 x i32 > @llvm.masked.load( <16 x i32>* %addr, i32 align, 
//                               <16 x i1> %mask, <16 x i32> %passthru) 
// to a chain of basic blocks, with loading element one-by-one if 
// the appropriate mask bit is set 
// 
//  %1 = bitcast i8* %addr to i32* 
//  %2 = extractelement <16 x i1> %mask, i32 0 
//  br i1 %2, label %cond.load, label %else 
// 
// cond.load:                                        ; preds = %0 
//  %3 = getelementptr i32* %1, i32 0 
//  %4 = load i32* %3 
//  %5 = insertelement <16 x i32> %passthru, i32 %4, i32 0 
//  br label %else 
// 
// else:                                             ; preds = %0, %cond.load 
//  %res.phi.else = phi <16 x i32> [ %5, %cond.load ], [ undef, %0 ] 
//  %6 = extractelement <16 x i1> %mask, i32 1 
//  br i1 %6, label %cond.load1, label %else2 
// 
// cond.load1:                                       ; preds = %else 
//  %7 = getelementptr i32* %1, i32 1 
//  %8 = load i32* %7 
//  %9 = insertelement <16 x i32> %res.phi.else, i32 %8, i32 1 
//  br label %else2 
// 
// else2:                                          ; preds = %else, %cond.load1 
//  %res.phi.else3 = phi <16 x i32> [ %9, %cond.load1 ], [ %res.phi.else, %else ] 
//  %10 = extractelement <16 x i1> %mask, i32 2 
//  br i1 %10, label %cond.load4, label %else5 
// 
static void scalarizeMaskedLoad(CallInst *CI, bool &ModifiedDT) { 
  Value *Ptr = CI->getArgOperand(0); 
  Value *Alignment = CI->getArgOperand(1); 
  Value *Mask = CI->getArgOperand(2); 
  Value *Src0 = CI->getArgOperand(3); 
 
  const Align AlignVal = cast<ConstantInt>(Alignment)->getAlignValue(); 
  VectorType *VecType = cast<FixedVectorType>(CI->getType()); 
 
  Type *EltTy = VecType->getElementType(); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
 
  Builder.SetInsertPoint(InsertPt); 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  // Short-cut if the mask is all-true. 
  if (isa<Constant>(Mask) && cast<Constant>(Mask)->isAllOnesValue()) { 
    Value *NewI = Builder.CreateAlignedLoad(VecType, Ptr, AlignVal); 
    CI->replaceAllUsesWith(NewI); 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // Adjust alignment for the scalar instruction. 
  const Align AdjustedAlignVal = 
      commonAlignment(AlignVal, EltTy->getPrimitiveSizeInBits() / 8); 
  // Bitcast %addr from i8* to EltTy* 
  Type *NewPtrType = 
      EltTy->getPointerTo(Ptr->getType()->getPointerAddressSpace()); 
  Value *FirstEltPtr = Builder.CreateBitCast(Ptr, NewPtrType); 
  unsigned VectorWidth = cast<FixedVectorType>(VecType)->getNumElements(); 
 
  // The result vector 
  Value *VResult = Src0; 
 
  if (isConstantIntVector(Mask)) { 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) 
        continue; 
      Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); 
      LoadInst *Load = Builder.CreateAlignedLoad(EltTy, Gep, AdjustedAlignVal); 
      VResult = Builder.CreateInsertElement(VResult, Load, Idx); 
    } 
    CI->replaceAllUsesWith(VResult); 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %res.phi.else3 = phi <16 x i32> [ %11, %cond.load1 ], [ %res.phi.else, %else ] 
    //  %mask_1 = and i16 %scalar_mask, i32 1 << Idx 
    //  %cond = icmp ne i16 %mask_1, 0 
    //  br i1 %mask_1, label %cond.load, label %else 
    // 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx); 
    } 
 
    // Create "cond" block 
    // 
    //  %EltAddr = getelementptr i32* %1, i32 0 
    //  %Elt = load i32* %EltAddr 
    //  VResult = insertelement <16 x i32> VResult, i32 %Elt, i32 Idx 
    // 
    BasicBlock *CondBlock = IfBlock->splitBasicBlock(InsertPt->getIterator(), 
                                                     "cond.load"); 
    Builder.SetInsertPoint(InsertPt); 
 
    Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); 
    LoadInst *Load = Builder.CreateAlignedLoad(EltTy, Gep, AdjustedAlignVal); 
    Value *NewVResult = Builder.CreateInsertElement(VResult, Load, Idx); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = 
        CondBlock->splitBasicBlock(InsertPt->getIterator(), "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    BasicBlock *PrevIfBlock = IfBlock; 
    IfBlock = NewIfBlock; 
 
    // Create the phi to join the new and previous value. 
    PHINode *Phi = Builder.CreatePHI(VecType, 2, "res.phi.else"); 
    Phi->addIncoming(NewVResult, CondBlock); 
    Phi->addIncoming(VResult, PrevIfBlock); 
    VResult = Phi; 
  } 
 
  CI->replaceAllUsesWith(VResult); 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
// Translate a masked store intrinsic, like 
// void @llvm.masked.store(<16 x i32> %src, <16 x i32>* %addr, i32 align, 
//                               <16 x i1> %mask) 
// to a chain of basic blocks, that stores element one-by-one if 
// the appropriate mask bit is set 
// 
//   %1 = bitcast i8* %addr to i32* 
//   %2 = extractelement <16 x i1> %mask, i32 0 
//   br i1 %2, label %cond.store, label %else 
// 
// cond.store:                                       ; preds = %0 
//   %3 = extractelement <16 x i32> %val, i32 0 
//   %4 = getelementptr i32* %1, i32 0 
//   store i32 %3, i32* %4 
//   br label %else 
// 
// else:                                             ; preds = %0, %cond.store 
//   %5 = extractelement <16 x i1> %mask, i32 1 
//   br i1 %5, label %cond.store1, label %else2 
// 
// cond.store1:                                      ; preds = %else 
//   %6 = extractelement <16 x i32> %val, i32 1 
//   %7 = getelementptr i32* %1, i32 1 
//   store i32 %6, i32* %7 
//   br label %else2 
//   . . . 
static void scalarizeMaskedStore(CallInst *CI, bool &ModifiedDT) { 
  Value *Src = CI->getArgOperand(0); 
  Value *Ptr = CI->getArgOperand(1); 
  Value *Alignment = CI->getArgOperand(2); 
  Value *Mask = CI->getArgOperand(3); 
 
  const Align AlignVal = cast<ConstantInt>(Alignment)->getAlignValue(); 
  auto *VecType = cast<VectorType>(Src->getType()); 
 
  Type *EltTy = VecType->getElementType(); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
  Builder.SetInsertPoint(InsertPt); 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  // Short-cut if the mask is all-true. 
  if (isa<Constant>(Mask) && cast<Constant>(Mask)->isAllOnesValue()) { 
    Builder.CreateAlignedStore(Src, Ptr, AlignVal); 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // Adjust alignment for the scalar instruction. 
  const Align AdjustedAlignVal = 
      commonAlignment(AlignVal, EltTy->getPrimitiveSizeInBits() / 8); 
  // Bitcast %addr from i8* to EltTy* 
  Type *NewPtrType = 
      EltTy->getPointerTo(Ptr->getType()->getPointerAddressSpace()); 
  Value *FirstEltPtr = Builder.CreateBitCast(Ptr, NewPtrType); 
  unsigned VectorWidth = cast<FixedVectorType>(VecType)->getNumElements(); 
 
  if (isConstantIntVector(Mask)) { 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) 
        continue; 
      Value *OneElt = Builder.CreateExtractElement(Src, Idx); 
      Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); 
      Builder.CreateAlignedStore(OneElt, Gep, AdjustedAlignVal); 
    } 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %mask_1 = and i16 %scalar_mask, i32 1 << Idx 
    //  %cond = icmp ne i16 %mask_1, 0 
    //  br i1 %mask_1, label %cond.store, label %else 
    // 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx); 
    } 
 
    // Create "cond" block 
    // 
    //  %OneElt = extractelement <16 x i32> %Src, i32 Idx 
    //  %EltAddr = getelementptr i32* %1, i32 0 
    //  %store i32 %OneElt, i32* %EltAddr 
    // 
    BasicBlock *CondBlock = 
        IfBlock->splitBasicBlock(InsertPt->getIterator(), "cond.store"); 
    Builder.SetInsertPoint(InsertPt); 
 
    Value *OneElt = Builder.CreateExtractElement(Src, Idx); 
    Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); 
    Builder.CreateAlignedStore(OneElt, Gep, AdjustedAlignVal); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = 
        CondBlock->splitBasicBlock(InsertPt->getIterator(), "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    IfBlock = NewIfBlock; 
  } 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
// Translate a masked gather intrinsic like 
// <16 x i32 > @llvm.masked.gather.v16i32( <16 x i32*> %Ptrs, i32 4, 
//                               <16 x i1> %Mask, <16 x i32> %Src) 
// to a chain of basic blocks, with loading element one-by-one if 
// the appropriate mask bit is set 
// 
// %Ptrs = getelementptr i32, i32* %base, <16 x i64> %ind 
// %Mask0 = extractelement <16 x i1> %Mask, i32 0 
// br i1 %Mask0, label %cond.load, label %else 
// 
// cond.load: 
// %Ptr0 = extractelement <16 x i32*> %Ptrs, i32 0 
// %Load0 = load i32, i32* %Ptr0, align 4 
// %Res0 = insertelement <16 x i32> undef, i32 %Load0, i32 0 
// br label %else 
// 
// else: 
// %res.phi.else = phi <16 x i32>[%Res0, %cond.load], [undef, %0] 
// %Mask1 = extractelement <16 x i1> %Mask, i32 1 
// br i1 %Mask1, label %cond.load1, label %else2 
// 
// cond.load1: 
// %Ptr1 = extractelement <16 x i32*> %Ptrs, i32 1 
// %Load1 = load i32, i32* %Ptr1, align 4 
// %Res1 = insertelement <16 x i32> %res.phi.else, i32 %Load1, i32 1 
// br label %else2 
// . . . 
// %Result = select <16 x i1> %Mask, <16 x i32> %res.phi.select, <16 x i32> %Src 
// ret <16 x i32> %Result 
static void scalarizeMaskedGather(CallInst *CI, bool &ModifiedDT) { 
  Value *Ptrs = CI->getArgOperand(0); 
  Value *Alignment = CI->getArgOperand(1); 
  Value *Mask = CI->getArgOperand(2); 
  Value *Src0 = CI->getArgOperand(3); 
 
  auto *VecType = cast<FixedVectorType>(CI->getType()); 
  Type *EltTy = VecType->getElementType(); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
  Builder.SetInsertPoint(InsertPt); 
  MaybeAlign AlignVal = cast<ConstantInt>(Alignment)->getMaybeAlignValue(); 
 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  // The result vector 
  Value *VResult = Src0; 
  unsigned VectorWidth = VecType->getNumElements(); 
 
  // Shorten the way if the mask is a vector of constants. 
  if (isConstantIntVector(Mask)) { 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) 
        continue; 
      Value *Ptr = Builder.CreateExtractElement(Ptrs, Idx, "Ptr" + Twine(Idx)); 
      LoadInst *Load = 
          Builder.CreateAlignedLoad(EltTy, Ptr, AlignVal, "Load" + Twine(Idx)); 
      VResult = 
          Builder.CreateInsertElement(VResult, Load, Idx, "Res" + Twine(Idx)); 
    } 
    CI->replaceAllUsesWith(VResult); 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %Mask1 = and i16 %scalar_mask, i32 1 << Idx 
    //  %cond = icmp ne i16 %mask_1, 0 
    //  br i1 %Mask1, label %cond.load, label %else 
    // 
 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx, "Mask" + Twine(Idx)); 
    } 
 
    // Create "cond" block 
    // 
    //  %EltAddr = getelementptr i32* %1, i32 0 
    //  %Elt = load i32* %EltAddr 
    //  VResult = insertelement <16 x i32> VResult, i32 %Elt, i32 Idx 
    // 
    BasicBlock *CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.load"); 
    Builder.SetInsertPoint(InsertPt); 
 
    Value *Ptr = Builder.CreateExtractElement(Ptrs, Idx, "Ptr" + Twine(Idx)); 
    LoadInst *Load = 
        Builder.CreateAlignedLoad(EltTy, Ptr, AlignVal, "Load" + Twine(Idx)); 
    Value *NewVResult = 
        Builder.CreateInsertElement(VResult, Load, Idx, "Res" + Twine(Idx)); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    BasicBlock *PrevIfBlock = IfBlock; 
    IfBlock = NewIfBlock; 
 
    PHINode *Phi = Builder.CreatePHI(VecType, 2, "res.phi.else"); 
    Phi->addIncoming(NewVResult, CondBlock); 
    Phi->addIncoming(VResult, PrevIfBlock); 
    VResult = Phi; 
  } 
 
  CI->replaceAllUsesWith(VResult); 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
// Translate a masked scatter intrinsic, like 
// void @llvm.masked.scatter.v16i32(<16 x i32> %Src, <16 x i32*>* %Ptrs, i32 4, 
//                                  <16 x i1> %Mask) 
// to a chain of basic blocks, that stores element one-by-one if 
// the appropriate mask bit is set. 
// 
// %Ptrs = getelementptr i32, i32* %ptr, <16 x i64> %ind 
// %Mask0 = extractelement <16 x i1> %Mask, i32 0 
// br i1 %Mask0, label %cond.store, label %else 
// 
// cond.store: 
// %Elt0 = extractelement <16 x i32> %Src, i32 0 
// %Ptr0 = extractelement <16 x i32*> %Ptrs, i32 0 
// store i32 %Elt0, i32* %Ptr0, align 4 
// br label %else 
// 
// else: 
// %Mask1 = extractelement <16 x i1> %Mask, i32 1 
// br i1 %Mask1, label %cond.store1, label %else2 
// 
// cond.store1: 
// %Elt1 = extractelement <16 x i32> %Src, i32 1 
// %Ptr1 = extractelement <16 x i32*> %Ptrs, i32 1 
// store i32 %Elt1, i32* %Ptr1, align 4 
// br label %else2 
//   . . . 
static void scalarizeMaskedScatter(CallInst *CI, bool &ModifiedDT) { 
  Value *Src = CI->getArgOperand(0); 
  Value *Ptrs = CI->getArgOperand(1); 
  Value *Alignment = CI->getArgOperand(2); 
  Value *Mask = CI->getArgOperand(3); 
 
  auto *SrcFVTy = cast<FixedVectorType>(Src->getType()); 
 
  assert( 
      isa<VectorType>(Ptrs->getType()) && 
      isa<PointerType>(cast<VectorType>(Ptrs->getType())->getElementType()) && 
      "Vector of pointers is expected in masked scatter intrinsic"); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
  Builder.SetInsertPoint(InsertPt); 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  MaybeAlign AlignVal = cast<ConstantInt>(Alignment)->getMaybeAlignValue(); 
  unsigned VectorWidth = SrcFVTy->getNumElements(); 
 
  // Shorten the way if the mask is a vector of constants. 
  if (isConstantIntVector(Mask)) { 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) 
        continue; 
      Value *OneElt = 
          Builder.CreateExtractElement(Src, Idx, "Elt" + Twine(Idx)); 
      Value *Ptr = Builder.CreateExtractElement(Ptrs, Idx, "Ptr" + Twine(Idx)); 
      Builder.CreateAlignedStore(OneElt, Ptr, AlignVal); 
    } 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %Mask1 = and i16 %scalar_mask, i32 1 << Idx 
    //  %cond = icmp ne i16 %mask_1, 0 
    //  br i1 %Mask1, label %cond.store, label %else 
    // 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx, "Mask" + Twine(Idx)); 
    } 
 
    // Create "cond" block 
    // 
    //  %Elt1 = extractelement <16 x i32> %Src, i32 1 
    //  %Ptr1 = extractelement <16 x i32*> %Ptrs, i32 1 
    //  %store i32 %Elt1, i32* %Ptr1 
    // 
    BasicBlock *CondBlock = IfBlock->splitBasicBlock(InsertPt, "cond.store"); 
    Builder.SetInsertPoint(InsertPt); 
 
    Value *OneElt = Builder.CreateExtractElement(Src, Idx, "Elt" + Twine(Idx)); 
    Value *Ptr = Builder.CreateExtractElement(Ptrs, Idx, "Ptr" + Twine(Idx)); 
    Builder.CreateAlignedStore(OneElt, Ptr, AlignVal); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = CondBlock->splitBasicBlock(InsertPt, "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    IfBlock = NewIfBlock; 
  } 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
static void scalarizeMaskedExpandLoad(CallInst *CI, bool &ModifiedDT) { 
  Value *Ptr = CI->getArgOperand(0); 
  Value *Mask = CI->getArgOperand(1); 
  Value *PassThru = CI->getArgOperand(2); 
 
  auto *VecType = cast<FixedVectorType>(CI->getType()); 
 
  Type *EltTy = VecType->getElementType(); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
 
  Builder.SetInsertPoint(InsertPt); 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  unsigned VectorWidth = VecType->getNumElements(); 
 
  // The result vector 
  Value *VResult = PassThru; 
 
  // Shorten the way if the mask is a vector of constants. 
  // Create a build_vector pattern, with loads/undefs as necessary and then 
  // shuffle blend with the pass through value. 
  if (isConstantIntVector(Mask)) { 
    unsigned MemIndex = 0; 
    VResult = UndefValue::get(VecType); 
    SmallVector<int, 16> ShuffleMask(VectorWidth, UndefMaskElem); 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      Value *InsertElt; 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) { 
        InsertElt = UndefValue::get(EltTy); 
        ShuffleMask[Idx] = Idx + VectorWidth; 
      } else { 
        Value *NewPtr = 
            Builder.CreateConstInBoundsGEP1_32(EltTy, Ptr, MemIndex); 
        InsertElt = Builder.CreateAlignedLoad(EltTy, NewPtr, Align(1), 
                                              "Load" + Twine(Idx)); 
        ShuffleMask[Idx] = Idx; 
        ++MemIndex; 
      } 
      VResult = Builder.CreateInsertElement(VResult, InsertElt, Idx, 
                                            "Res" + Twine(Idx)); 
    } 
    VResult = Builder.CreateShuffleVector(VResult, PassThru, ShuffleMask); 
    CI->replaceAllUsesWith(VResult); 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %res.phi.else3 = phi <16 x i32> [ %11, %cond.load1 ], [ %res.phi.else, %else ] 
    //  %mask_1 = extractelement <16 x i1> %mask, i32 Idx 
    //  br i1 %mask_1, label %cond.load, label %else 
    // 
 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx, "Mask" + Twine(Idx)); 
    } 
 
    // Create "cond" block 
    // 
    //  %EltAddr = getelementptr i32* %1, i32 0 
    //  %Elt = load i32* %EltAddr 
    //  VResult = insertelement <16 x i32> VResult, i32 %Elt, i32 Idx 
    // 
    BasicBlock *CondBlock = IfBlock->splitBasicBlock(InsertPt->getIterator(), 
                                                     "cond.load"); 
    Builder.SetInsertPoint(InsertPt); 
 
    LoadInst *Load = Builder.CreateAlignedLoad(EltTy, Ptr, Align(1)); 
    Value *NewVResult = Builder.CreateInsertElement(VResult, Load, Idx); 
 
    // Move the pointer if there are more blocks to come. 
    Value *NewPtr; 
    if ((Idx + 1) != VectorWidth) 
      NewPtr = Builder.CreateConstInBoundsGEP1_32(EltTy, Ptr, 1); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = 
        CondBlock->splitBasicBlock(InsertPt->getIterator(), "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    BasicBlock *PrevIfBlock = IfBlock; 
    IfBlock = NewIfBlock; 
 
    // Create the phi to join the new and previous value. 
    PHINode *ResultPhi = Builder.CreatePHI(VecType, 2, "res.phi.else"); 
    ResultPhi->addIncoming(NewVResult, CondBlock); 
    ResultPhi->addIncoming(VResult, PrevIfBlock); 
    VResult = ResultPhi; 
 
    // Add a PHI for the pointer if this isn't the last iteration. 
    if ((Idx + 1) != VectorWidth) { 
      PHINode *PtrPhi = Builder.CreatePHI(Ptr->getType(), 2, "ptr.phi.else"); 
      PtrPhi->addIncoming(NewPtr, CondBlock); 
      PtrPhi->addIncoming(Ptr, PrevIfBlock); 
      Ptr = PtrPhi; 
    } 
  } 
 
  CI->replaceAllUsesWith(VResult); 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
static void scalarizeMaskedCompressStore(CallInst *CI, bool &ModifiedDT) { 
  Value *Src = CI->getArgOperand(0); 
  Value *Ptr = CI->getArgOperand(1); 
  Value *Mask = CI->getArgOperand(2); 
 
  auto *VecType = cast<FixedVectorType>(Src->getType()); 
 
  IRBuilder<> Builder(CI->getContext()); 
  Instruction *InsertPt = CI; 
  BasicBlock *IfBlock = CI->getParent(); 
 
  Builder.SetInsertPoint(InsertPt); 
  Builder.SetCurrentDebugLocation(CI->getDebugLoc()); 
 
  Type *EltTy = VecType->getElementType(); 
 
  unsigned VectorWidth = VecType->getNumElements(); 
 
  // Shorten the way if the mask is a vector of constants. 
  if (isConstantIntVector(Mask)) { 
    unsigned MemIndex = 0; 
    for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
      if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) 
        continue; 
      Value *OneElt = 
          Builder.CreateExtractElement(Src, Idx, "Elt" + Twine(Idx)); 
      Value *NewPtr = Builder.CreateConstInBoundsGEP1_32(EltTy, Ptr, MemIndex); 
      Builder.CreateAlignedStore(OneElt, NewPtr, Align(1)); 
      ++MemIndex; 
    } 
    CI->eraseFromParent(); 
    return; 
  } 
 
  // If the mask is not v1i1, use scalar bit test operations. This generates 
  // better results on X86 at least. 
  Value *SclrMask; 
  if (VectorWidth != 1) { 
    Type *SclrMaskTy = Builder.getIntNTy(VectorWidth); 
    SclrMask = Builder.CreateBitCast(Mask, SclrMaskTy, "scalar_mask"); 
  } 
 
  for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { 
    // Fill the "else" block, created in the previous iteration 
    // 
    //  %mask_1 = extractelement <16 x i1> %mask, i32 Idx 
    //  br i1 %mask_1, label %cond.store, label %else 
    // 
    Value *Predicate; 
    if (VectorWidth != 1) { 
      Value *Mask = Builder.getInt(APInt::getOneBitSet(VectorWidth, Idx)); 
      Predicate = Builder.CreateICmpNE(Builder.CreateAnd(SclrMask, Mask), 
                                       Builder.getIntN(VectorWidth, 0)); 
    } else { 
      Predicate = Builder.CreateExtractElement(Mask, Idx, "Mask" + Twine(Idx)); 
    } 
 
    // Create "cond" block 
    // 
    //  %OneElt = extractelement <16 x i32> %Src, i32 Idx 
    //  %EltAddr = getelementptr i32* %1, i32 0 
    //  %store i32 %OneElt, i32* %EltAddr 
    // 
    BasicBlock *CondBlock = 
        IfBlock->splitBasicBlock(InsertPt->getIterator(), "cond.store"); 
    Builder.SetInsertPoint(InsertPt); 
 
    Value *OneElt = Builder.CreateExtractElement(Src, Idx); 
    Builder.CreateAlignedStore(OneElt, Ptr, Align(1)); 
 
    // Move the pointer if there are more blocks to come. 
    Value *NewPtr; 
    if ((Idx + 1) != VectorWidth) 
      NewPtr = Builder.CreateConstInBoundsGEP1_32(EltTy, Ptr, 1); 
 
    // Create "else" block, fill it in the next iteration 
    BasicBlock *NewIfBlock = 
        CondBlock->splitBasicBlock(InsertPt->getIterator(), "else"); 
    Builder.SetInsertPoint(InsertPt); 
    Instruction *OldBr = IfBlock->getTerminator(); 
    BranchInst::Create(CondBlock, NewIfBlock, Predicate, OldBr); 
    OldBr->eraseFromParent(); 
    BasicBlock *PrevIfBlock = IfBlock; 
    IfBlock = NewIfBlock; 
 
    // Add a PHI for the pointer if this isn't the last iteration. 
    if ((Idx + 1) != VectorWidth) { 
      PHINode *PtrPhi = Builder.CreatePHI(Ptr->getType(), 2, "ptr.phi.else"); 
      PtrPhi->addIncoming(NewPtr, CondBlock); 
      PtrPhi->addIncoming(Ptr, PrevIfBlock); 
      Ptr = PtrPhi; 
    } 
  } 
  CI->eraseFromParent(); 
 
  ModifiedDT = true; 
} 
 
static bool runImpl(Function &F, const TargetTransformInfo &TTI) { 
  bool EverMadeChange = false; 
  bool MadeChange = true; 
  auto &DL = F.getParent()->getDataLayout(); 
  while (MadeChange) { 
    MadeChange = false; 
    for (Function::iterator I = F.begin(); I != F.end();) { 
      BasicBlock *BB = &*I++; 
      bool ModifiedDTOnIteration = false; 
      MadeChange |= optimizeBlock(*BB, ModifiedDTOnIteration, TTI, DL); 
 
      // Restart BB iteration if the dominator tree of the Function was changed 
      if (ModifiedDTOnIteration) 
        break; 
    } 
 
    EverMadeChange |= MadeChange; 
  } 
  return EverMadeChange; 
} 
 
bool ScalarizeMaskedMemIntrinLegacyPass::runOnFunction(Function &F) { 
  auto &TTI = getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F); 
  return runImpl(F, TTI); 
} 
 
PreservedAnalyses 
ScalarizeMaskedMemIntrinPass::run(Function &F, FunctionAnalysisManager &AM) { 
  auto &TTI = AM.getResult<TargetIRAnalysis>(F); 
  if (!runImpl(F, TTI)) 
    return PreservedAnalyses::all(); 
  PreservedAnalyses PA; 
  PA.preserve<TargetIRAnalysis>(); 
  return PA; 
} 
 
static bool optimizeBlock(BasicBlock &BB, bool &ModifiedDT, 
                          const TargetTransformInfo &TTI, 
                          const DataLayout &DL) { 
  bool MadeChange = false; 
 
  BasicBlock::iterator CurInstIterator = BB.begin(); 
  while (CurInstIterator != BB.end()) { 
    if (CallInst *CI = dyn_cast<CallInst>(&*CurInstIterator++)) 
      MadeChange |= optimizeCallInst(CI, ModifiedDT, TTI, DL); 
    if (ModifiedDT) 
      return true; 
  } 
 
  return MadeChange; 
} 
 
static bool optimizeCallInst(CallInst *CI, bool &ModifiedDT, 
                             const TargetTransformInfo &TTI, 
                             const DataLayout &DL) { 
  IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI); 
  if (II) { 
    // The scalarization code below does not work for scalable vectors. 
    if (isa<ScalableVectorType>(II->getType()) || 
        any_of(II->arg_operands(), 
               [](Value *V) { return isa<ScalableVectorType>(V->getType()); })) 
      return false; 
 
    switch (II->getIntrinsicID()) { 
    default: 
      break; 
    case Intrinsic::masked_load: 
      // Scalarize unsupported vector masked load 
      if (TTI.isLegalMaskedLoad( 
              CI->getType(), 
              cast<ConstantInt>(CI->getArgOperand(1))->getAlignValue())) 
        return false; 
      scalarizeMaskedLoad(CI, ModifiedDT); 
      return true; 
    case Intrinsic::masked_store: 
      if (TTI.isLegalMaskedStore( 
              CI->getArgOperand(0)->getType(), 
              cast<ConstantInt>(CI->getArgOperand(2))->getAlignValue())) 
        return false; 
      scalarizeMaskedStore(CI, ModifiedDT); 
      return true; 
    case Intrinsic::masked_gather: { 
      unsigned AlignmentInt = 
          cast<ConstantInt>(CI->getArgOperand(1))->getZExtValue(); 
      Type *LoadTy = CI->getType(); 
      Align Alignment = 
          DL.getValueOrABITypeAlignment(MaybeAlign(AlignmentInt), LoadTy); 
      if (TTI.isLegalMaskedGather(LoadTy, Alignment)) 
        return false; 
      scalarizeMaskedGather(CI, ModifiedDT); 
      return true; 
    } 
    case Intrinsic::masked_scatter: { 
      unsigned AlignmentInt = 
          cast<ConstantInt>(CI->getArgOperand(2))->getZExtValue(); 
      Type *StoreTy = CI->getArgOperand(0)->getType(); 
      Align Alignment = 
          DL.getValueOrABITypeAlignment(MaybeAlign(AlignmentInt), StoreTy); 
      if (TTI.isLegalMaskedScatter(StoreTy, Alignment)) 
        return false; 
      scalarizeMaskedScatter(CI, ModifiedDT); 
      return true; 
    } 
    case Intrinsic::masked_expandload: 
      if (TTI.isLegalMaskedExpandLoad(CI->getType())) 
        return false; 
      scalarizeMaskedExpandLoad(CI, ModifiedDT); 
      return true; 
    case Intrinsic::masked_compressstore: 
      if (TTI.isLegalMaskedCompressStore(CI->getArgOperand(0)->getType())) 
        return false; 
      scalarizeMaskedCompressStore(CI, ModifiedDT); 
      return true; 
    } 
  } 
 
  return false; 
}