Lines Matching refs:LoadedSlice
16913 struct LoadedSlice { struct
16929 Cost(const LoadedSlice &LS, bool ForCodeSize) in Cost()
16942 void addSliceGain(const LoadedSlice &LS) { in addSliceGain()
17007 LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr, in LoadedSlice() function
17229 static bool areSlicesNextToEachOther(const LoadedSlice &First, in areSlicesNextToEachOther()
17230 const LoadedSlice &Second) { in areSlicesNextToEachOther()
17244 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices, in adjustCostForPairing()
17245 LoadedSlice::Cost &GlobalLSCost) { in adjustCostForPairing()
17253 llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) { in adjustCostForPairing()
17260 const LoadedSlice *First = nullptr; in adjustCostForPairing()
17261 const LoadedSlice *Second = nullptr; in adjustCostForPairing()
17310 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices, in isSlicingProfitable()
17325 LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize); in isSlicingProfitable()
17329 const LoadedSlice &LS = LoadedSlices[CurrSlice]; in isSlicingProfitable()
17331 LoadedSlice::Cost SliceCost(LS, ForCodeSize); in isSlicingProfitable()
17369 SmallVector<LoadedSlice, 4> LoadedSlices; in SliceUpLoad()
17404 LoadedSlice LS(User, LD, Shift, &DAG); in SliceUpLoad()
17432 for (const LoadedSlice &LS : LoadedSlices) { in SliceUpLoad()