Lines Matching defs:use
2 // Use of this source code is governed by a BSD-style license that can be
400 // rewritten to use a pre-order traversal from the start instead.
451 // If the edge is from an unscheduled node, then tally it in the use count
453 // for decrementing use counts.
457 Trace(" Use count of #%d:%s (used by #%d:%s)++ = %d\n", to->id(),
547 Node* use = edge.from();
548 IrOpcode::Value opcode = use->opcode();
550 // If the use is from a fixed (i.e. non-floating) phi, use the block
553 if (scheduler_->GetPlacement(use) == Scheduler::kFixed) {
554 Trace(" input@%d into a fixed phi #%d:%s\n", index, use->id(),
555 use->op()->mnemonic());
556 Node* merge = NodeProperties::GetControlInput(use, 0);
559 use = NodeProperties::GetControlInput(merge, index);
562 BasicBlock* result = schedule_->block(use);
564 Trace(" must dominate use #%d:%s in B%d\n", use->id(),
565 use->op()->mnemonic(), result->id());
573 // Reduce the use count of the node's inputs to potentially make them
580 Trace(" Use count for #%d:%s (used by #%d:%s)-- = %d\n", (*i)->id(),
1020 // Use the next outgoing edge if there are any.