13245 struct LoadedSlice {  struct
13261     Cost(const LoadedSlice &LS, bool ForCodeSize = false)  in Cost()
13274     void addSliceGain(const LoadedSlice &LS) {  in addSliceGain()
13339   LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr,  in LoadedSlice()  function
13558 static bool areSlicesNextToEachOther(const LoadedSlice &First,  in areSlicesNextToEachOther()
13559                                      const LoadedSlice &Second) {  in areSlicesNextToEachOther()
13573 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in adjustCostForPairing()
13574                                  LoadedSlice::Cost &GlobalLSCost) {  in adjustCostForPairing()
13582   llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) {  in adjustCostForPairing()
13589   const LoadedSlice *First = nullptr;  in adjustCostForPairing()
13590   const LoadedSlice *Second = nullptr;  in adjustCostForPairing()
13639 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in isSlicingProfitable()
13654   LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize);  in isSlicingProfitable()
13658     const LoadedSlice &LS = LoadedSlices[CurrSlice];  in isSlicingProfitable()
13660     LoadedSlice::Cost SliceCost(LS, ForCodeSize);  in isSlicingProfitable()
13692   SmallVector<LoadedSlice, 4> LoadedSlices;  in SliceUpLoad()
13727     LoadedSlice LS(User, LD, Shift, &DAG);  in SliceUpLoad()
13755   for (SmallVectorImpl<LoadedSlice>::const_iterator  in SliceUpLoad()