Lines Matching defs:uses

1010   // Process the worklist, deleting the nodes and adding their uses to the
1033       // Now that we removed this operand, see if there are no uses of it left.
1057   // Finally, remove uses due to operands of this node, remove from the
1396       // different places. Do not propagate one location to all uses as it
4657       // answer. Now proceed to the generic code that uses
6214     // FIXME: Hexagon uses i32 scalar for a floating point zero vector so allow
7073     // i8, which is easy to fall into in generic code that uses
7629   for (SDNode *U : getEntryNode().getNode()->uses())
10765   // Delete any nodes that are still dead after adding the uses for the
11326   assert(From != To.getNode() && "Cannot replace uses of with self");
11333   // Iterate over all the existing uses of From. New uses will be added
11335   // This specifically avoids visiting uses of From that arise while the
11336   // replacement is happening, because any such uses would be the result
11349     // happens the uses are usually next to each other in the list.
11351     // the uses of this user that we can find this way.
11407     // happens the uses are usually next to each other in the list.
11409     // the uses of this user that we can find this way.
11455     // uses are usually next to each other in the list.  To help reduce the
11456     // number of CSE and divergence recomputations, process all the uses of this
11480 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
11481 /// uses of other values produced by From.getNode() alone.  The Deleted
11507     // happens the uses are usually next to each other in the list.
11509     // the uses of this user that we can find this way.
11513       // Skip uses of different values from the same node.
11531     // We are iterating over all uses of the From node, so if a use
11574   RAUOVWUpdateListener(SelectionDAG &d, SmallVector<UseMemo, 4> &uses)
11575       : SelectionDAG::DAGUpdateListener(d), Uses(uses) {}
11602       llvm::append_range(Worklist, N->uses());
11618     for (auto *U : N->uses()) {
11637 /// ReplaceAllUsesOfValuesWith - Replace any uses of From with To, leaving
11638 /// uses of other values produced by From.getNode() alone.  The same value
11651   // Read up all the uses and make records of them. This helps
11652   // processing new uses that are introduced during the
11668   // Sort the uses, so that all the uses from a given User are together.
11674     // We know that this user uses some value of From.  If it is the right
11687     // The Uses array is sorted, so all the uses for a given User
11690     // the uses of this user that we can find this way.
11727       // A node with no uses, add it to the result array immediately.
11745     // N is in sorted position, so all its uses have one less operand
11747     for (SDNode *P : N->uses()) {
11812   // memory operation and update uses of the old load's output chain to use that
12137 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
12138 /// indicated value.  This method ignores uses of other values defined by this
12143   // TODO: Only iterate over uses of a given value of the node
12152   // Found exactly the right number of uses?
12157 /// value. This method ignores uses of other values defined by this operation.
12171   for (const SDNode *User : N->uses()) {
12184   for (const SDNode *User : N->uses()) {