15454 struct LoadedSlice {  struct
15470     Cost(const LoadedSlice &LS, bool ForCodeSize)  in Cost()
15483     void addSliceGain(const LoadedSlice &LS) {  in addSliceGain()
15548   LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr,  in LoadedSlice()  function
15769 static bool areSlicesNextToEachOther(const LoadedSlice &First,  in areSlicesNextToEachOther()
15770                                      const LoadedSlice &Second) {  in areSlicesNextToEachOther()
15784 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in adjustCostForPairing()
15785                                  LoadedSlice::Cost &GlobalLSCost) {  in adjustCostForPairing()
15793   llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) {  in adjustCostForPairing()
15800   const LoadedSlice *First = nullptr;  in adjustCostForPairing()
15801   const LoadedSlice *Second = nullptr;  in adjustCostForPairing()
15850 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in isSlicingProfitable()
15865   LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize);  in isSlicingProfitable()
15869     const LoadedSlice &LS = LoadedSlices[CurrSlice];  in isSlicingProfitable()
15871     LoadedSlice::Cost SliceCost(LS, ForCodeSize);  in isSlicingProfitable()
15909   SmallVector<LoadedSlice, 4> LoadedSlices;  in SliceUpLoad()
15944     LoadedSlice LS(User, LD, Shift, &DAG);  in SliceUpLoad()
15972   for (SmallVectorImpl<LoadedSlice>::const_iterator  in SliceUpLoad()