538     bool SearchForAndLoads(SDNode *N, SmallVectorImpl<LoadSDNode*> &Loads,
4313                                     SmallVectorImpl<LoadSDNode*> &Loads,  in SearchForAndLoads()  argument
4350           Loads.push_back(Load);  in SearchForAndLoads()
4373       if (!SearchForAndLoads(Op.getNode(), Loads, NodesWithConsts, Mask,  in SearchForAndLoads()
4415   SmallVector<LoadSDNode*, 8> Loads;  in BackwardsPropagateMask()  local
4418   if (SearchForAndLoads(N, Loads, NodesWithConsts, Mask, FixupNode)) {  in BackwardsPropagateMask()
4419     if (Loads.size() == 0)  in BackwardsPropagateMask()
4452     for (auto *Load : Loads) {  in BackwardsPropagateMask()
5939   SmallPtrSet<LoadSDNode *, 8> Loads;  in MatchLoadCombine()  local
5981     Loads.insert(L);  in MatchLoadCombine()
5983   assert(!Loads.empty() && "All the bytes of the value must be loaded from "  in MatchLoadCombine()
6032   for (LoadSDNode *L : Loads)  in MatchLoadCombine()
8348   SmallVector<SDValue, 4> Loads;  in CombineExtLoad()  local
8364     Loads.push_back(SplitLoad.getValue(0));  in CombineExtLoad()
8369   SDValue NewValue = DAG.getNode(ISD::CONCAT_VECTORS, DL, DstVT, Loads);  in CombineExtLoad()
13252     unsigned Loads = 0;  member
13262         : ForCodeSize(ForCodeSize), Loads(1) {  in Cost()
13289       Loads += RHS.Loads;  in operator +=()
13298       return Loads == RHS.Loads && Truncates == RHS.Truncates &&  in operator ==()
13308       unsigned ExpensiveOpsLHS = Loads + CrossRegisterBanksCopies;  in operator <()
13309       unsigned ExpensiveOpsRHS = RHS.Loads + RHS.CrossRegisterBanksCopies;  in operator <()
13622     assert(GlobalLSCost.Loads > 0 && "We save more loads than we created!");  in adjustCostForPairing()
13623     --GlobalLSCost.Loads;  in adjustCostForPairing()
13656   OrigCost.Loads = 1;  in isSlicingProfitable()