Lines Matching refs:use
26 // Extract the inputs from the old use and input pointers and copy them
122 Use* use = use_ptr - 1 - current;
123 use->bit_field_ = Use::InputIndexField::encode(current) |
125 to->AppendUse(use);
164 Use* use = GetUsePtr(inline_count);
166 use->bit_field_ = Use::InputIndexField::encode(inline_count) |
168 new_to->AppendUse(use);
181 // use current out of line inputs.
193 Use* use = GetUsePtr(input_count);
195 use->bit_field_ = Use::InputIndexField::encode(input_count) |
197 new_to->AppendUse(use);
290 for (const Use* use = first_use_; use; use = use->next) {
303 for (Use* use = this->first_use_; use; use = use->next) {
304 *use->input_ptr() = that;
305 last_use = use;
308 // Concat the use list of {this} and {that}.
317 for (Use* use = first_use_; use; use = use->next) {
318 if (use->from() != owner) {
327 for (Use* use = first_use_; use; use = use->next) {
328 Node* from = use->from();
401 void Node::AppendUse(Use* use) {
403 DCHECK_EQ(this, *use->input_ptr());
404 use->next = first_use_;
405 use->prev = nullptr;
406 if (first_use_) first_use_->prev = use;
407 first_use_ = use;
411 void Node::RemoveUse(Use* use) {
413 if (use->prev) {
414 DCHECK_NE(first_use_, use);
415 use->prev->next = use->next;
417 DCHECK_EQ(first_use_, use);
418 first_use_ = use->next;
420 if (use->next) {
421 use->next->prev = use->prev;