Lines Matching defs:to
22 // Marks are used during traversal of the graph to distinguish states of nodes.
28 // NodeIds are identifying numbers for nodes that can be used to index auxiliary
35 // which specific applications of graphs and nodes can use to index auxiliary
39 // compilation, e.g. during lowering passes. Other information that needs to be
205 // A link in the use chain for a node. Every input {i} to a node {n} has an
231 // Leaving some space in the bitset in case we ever decide to record
238 // Saving space for big graphs is important. We use a memory layout trick to
239 // be able to map {Node} objects to {Use} objects and vice-versa in a
243 // direct pointers to input {Nodes}.
263 // Out-of-line storage of input lists is needed if appending an input to
333 // Typedefs to shorten commonly used Node containers.
340 // Helper to extract parameters from Operator1<*> nodes.
348 // input from another node, allowing access to both the defining node and
353 Node* to() const { return *input_ptr_; }
387 // A forward iterator to visit the edges for the input dependencies of a node.
433 // A forward iterator to visit the inputs of a node.
444 Node* operator*() const { return (*iter_).to(); }
476 // A forward iterator to visit the uses edges of a node.
518 // A forward iterator to visit the uses of a node.
