Lines Matching defs:use
34 // input/use chains but by default otherwise contain only an identifying number
35 // which specific applications of graphs and nodes can use to index auxiliary
83 Use* use = GetUsePtr(index);
84 if (old_to) old_to->RemoveUse(use);
86 if (new_to) new_to->AppendUse(use);
179 // A link in the use chain for a node. Every input {i} to a node {n} has an
180 // associated {Use} which is linked into the use chain of the {i} node.
210 // Saving space for big graphs is important. We use a memory layout trick to
268 void AppendUse(Use* use);
269 void RemoveUse(Use* use);
419 // An encapsulation for information associated with a single use of node as a
449 Edge(Node::Use* use, ZoneNodePtr* input_ptr)
450 : use_(use), input_ptr_(input_ptr) {
451 DCHECK_NOT_NULL(use);
453 DCHECK_EQ(input_ptr, use->input_ptr());
524 explicit iterator(Use* use, ZoneNodePtr* input_ptr)
525 : use_(use), input_ptr_(input_ptr) {}
659 // Checking no use gets mutated while iterating through them, a potential