15972 struct LoadedSlice {  struct
15988     Cost(const LoadedSlice &LS, bool ForCodeSize)  in Cost()
16001     void addSliceGain(const LoadedSlice &LS) {  in addSliceGain()
16066   LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr,  in LoadedSlice()  function
16287 static bool areSlicesNextToEachOther(const LoadedSlice &First,  in areSlicesNextToEachOther()
16288                                      const LoadedSlice &Second) {  in areSlicesNextToEachOther()
16302 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in adjustCostForPairing()
16303                                  LoadedSlice::Cost &GlobalLSCost) {  in adjustCostForPairing()
16311   llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) {  in adjustCostForPairing()
16318   const LoadedSlice *First = nullptr;  in adjustCostForPairing()
16319   const LoadedSlice *Second = nullptr;  in adjustCostForPairing()
16368 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in isSlicingProfitable()
16383   LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize);  in isSlicingProfitable()
16387     const LoadedSlice &LS = LoadedSlices[CurrSlice];  in isSlicingProfitable()
16389     LoadedSlice::Cost SliceCost(LS, ForCodeSize);  in isSlicingProfitable()
16427   SmallVector<LoadedSlice, 4> LoadedSlices;  in SliceUpLoad()
16462     LoadedSlice LS(User, LD, Shift, &DAG);  in SliceUpLoad()
16490   for (const LoadedSlice &LS : LoadedSlices) {  in SliceUpLoad()