Lines Matching defs:Use
2 // Use of this source code is governed by a BSD-style license that can be
83 Use* use = GetUsePtr(index);
161 struct Use;
162 using ZoneUsePtr = GraphZoneTraits::Ptr<Use>;
175 void ExtractFrom(Use* use_ptr, ZoneNodePtr* input_ptr, int count);
180 // associated {Use} which is linked into the use chain of the {i} node.
181 struct Use {
190 Use* start = this + 1 + index;
198 Use* start = this + 1 + input_index();
211 // be able to map {Node} objects to {Use} objects and vice-versa in a
214 // {Use} links are laid out in memory directly before a {Node}, followed by
218 // |Use #N |Use #N-1|...|Use #1 |Use #0 |Node xxxx |I#0|I#1|...|I#N-1|I#N|
220 // + Use + Node + Input
222 // Since every {Use} instance records its {input_index}, pointer arithmetic
231 // |Use #N |Use #N-1|...|Use #1 |Use #0 |OOL xxxxx |I#0|I#1|...|I#N-1|I#N|
233 // + Use + Input
262 Use* GetUsePtr(int input_index) {
263 Use* ptr = has_inline_inputs() ? reinterpret_cast<Use*>(this)
264 : reinterpret_cast<Use*>(outline_inputs());
268 void AppendUse(Use* use);
269 void RemoveUse(Use* use);
389 InputEdges(ZoneNodePtr* input_root, Use* use_root, int count)
394 Use* use_root_;
449 Edge(Node::Use* use, ZoneNodePtr* input_ptr)
456 Node::Use* use_;
468 return InputEdges(inline_inputs(), reinterpret_cast<Use*>(this) - 1,
472 reinterpret_cast<Use*>(outline_inputs()) - 1,
524 explicit iterator(Use* use, ZoneNodePtr* input_ptr)
527 Use* use_;
613 next_ = current_ ? static_cast<Node::Use*>(current_->next) : nullptr;
624 next_(current_ ? static_cast<Node::Use*>(current_->next) : nullptr) {}
626 Node::Use* current_;
627 Node::Use* next_;
683 Node::Use* current_;
685 Node::Use* next_;