18855 struct LoadedSlice {  struct
18871     Cost(const LoadedSlice &LS, bool ForCodeSize)  in Cost()
18884     void addSliceGain(const LoadedSlice &LS) {  in addSliceGain()
18948   LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr,  in LoadedSlice()  function
19170 static bool areSlicesNextToEachOther(const LoadedSlice &First,  in areSlicesNextToEachOther()
19171                                      const LoadedSlice &Second) {  in areSlicesNextToEachOther()
19185 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in adjustCostForPairing()
19186                                  LoadedSlice::Cost &GlobalLSCost) {  in adjustCostForPairing()
19194   llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) {  in adjustCostForPairing()
19201   const LoadedSlice *First = nullptr;  in adjustCostForPairing()
19202   const LoadedSlice *Second = nullptr;  in adjustCostForPairing()
19251 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in isSlicingProfitable()
19266   LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize);  in isSlicingProfitable()
19270     const LoadedSlice &LS = LoadedSlices[CurrSlice];  in isSlicingProfitable()
19272     LoadedSlice::Cost SliceCost(LS, ForCodeSize);  in isSlicingProfitable()
19310   SmallVector<LoadedSlice, 4> LoadedSlices;  in SliceUpLoad()
19345     LoadedSlice LS(User, LD, Shift, &DAG);  in SliceUpLoad()
19373   for (const LoadedSlice &LS : LoadedSlices) {  in SliceUpLoad()