19185 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in adjustCostForPairing()  argument
19187   unsigned NumberOfSlices = LoadedSlices.size();  in adjustCostForPairing()
19194   llvm::sort(LoadedSlices, [](const LoadedSlice &LHS, const LoadedSlice &RHS) {  in adjustCostForPairing()
19198   const TargetLowering &TLI = LoadedSlices[0].DAG->getTargetLoweringInfo();  in adjustCostForPairing()
19206     Second = &LoadedSlices[CurrSlice];  in adjustCostForPairing()
19251 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,  in isSlicingProfitable()  argument
19253   unsigned NumberOfSlices = LoadedSlices.size();  in isSlicingProfitable()
19270     const LoadedSlice &LS = LoadedSlices[CurrSlice];  in isSlicingProfitable()
19281   adjustCostForPairing(LoadedSlices, GlobalSlicingCost);  in isSlicingProfitable()
19310   SmallVector<LoadedSlice, 4> LoadedSlices;  in SliceUpLoad()  local
19359     LoadedSlices.push_back(LS);  in SliceUpLoad()
19363   if (!isSlicingProfitable(LoadedSlices, UsedBits, ForCodeSize))  in SliceUpLoad()
19373   for (const LoadedSlice &LS : LoadedSlices) {  in SliceUpLoad()