Lines Matching defs:Uses
304 SmallVector<ArgumentGraphNode*, 4> Uses;
318 // uses every node. Because the graph is directed and nothing points into
327 iterator begin() { return SyntheticRoot.Uses.begin(); }
328 iterator end() { return SyntheticRoot.Uses.end(); }
334 SyntheticRoot.Uses.push_back(&Node);
340 // consider that a capture, instead adding it to the "Uses" list and
365 Uses.push_back(AI);
376 SmallVector<Argument*, 4> Uses; // Uses within our SCC.
389 return N->Uses.begin();
392 return N->Uses.end();
425 for (Use &U : A->uses()) {
445 for (Use &UU : I->uses())
459 for (Use &UU : I->uses())
574 if (Tracker.Uses.empty()) {
584 for (SmallVectorImpl<Argument*>::iterator UI = Tracker.Uses.begin(),
585 UE = Tracker.Uses.end(); UI != UE; ++UI) {
586 Node->Uses.push_back(AG[*UI]);
614 // argument uses once we solved the argument trivially. These partial nodes
615 // show up as ArgumentGraphNode objects with an empty Uses list, and for
626 if (ArgumentSCC[0]->Uses.size() == 1 &&
627 ArgumentSCC[0]->Uses[0] == ArgumentSCC[0]) {
640 if (Node->Uses.empty()) {
657 for (SmallVectorImpl<ArgumentGraphNode*>::iterator UI = N->Uses.begin(),
658 UE = N->Uses.end(); UI != UE; ++UI) {
678 // analyze all uses of a captured pointer.
