| /external/v8/src/compiler/ |
| instruction-scheduler.h | 33 void StartBlock(RpoNumber rpo);
34 void EndBlock(RpoNumber rpo);
|
| instruction-scheduler.cc | 92 void InstructionScheduler::StartBlock(RpoNumber rpo) {
99 sequence()->StartBlock(rpo);
103 void InstructionScheduler::EndBlock(RpoNumber rpo) {
109 sequence()->EndBlock(rpo);
|
| jump-threading.cc | 189 // Patch RPO immediates.
194 RpoNumber rpo = constant.ToRpoNumber(); local
195 RpoNumber fw = result[rpo.ToInt()];
196 if (!(fw == rpo)) immediates[i] = Constant(fw);
|
| instruction.cc | 611 return os << "RPO" << constant.ToRpoNumber().ToInt();
854 Instruction* InstructionSequence::GetBlockStart(RpoNumber rpo) const {
855 const InstructionBlock* block = InstructionBlockAt(rpo);
860 void InstructionSequence::StartBlock(RpoNumber rpo) {
862 current_block_ = InstructionBlockAt(rpo);
868 void InstructionSequence::EndBlock(RpoNumber rpo) {
870 DCHECK_EQ(current_block_->rpo_number(), rpo);
998 RpoNumber rpo = RpoNumber::FromInt(block_id); local
[all...] |
| code-generator.h | 106 Label* GetLabel(RpoNumber rpo) { return &labels_[rpo.ToSize()]; }
177 // Compute branch info from given instruction. Returns a valid rpo number
178 // if the branch is redundant, the returned rpo number point to the target
|
| graph-visualizer.cc | 569 const BasicBlockVector* rpo = schedule->rpo_order(); local
570 for (size_t i = 0; i < rpo->size(); i++) {
571 BasicBlock* current = (*rpo)[i];
822 // Do a post-order depth-first search on the RPO graph. For every node,
898 const BasicBlockVector* rpo = schedule->rpo_order(); local
899 for (size_t i = 0; i < rpo->size(); i++) {
900 BasicBlock* current = (*rpo)[i];
|
| instruction-selector.h | 283 void StartBlock(RpoNumber rpo);
284 void EndBlock(RpoNumber rpo);
|
| instruction.h | [all...] |
| instruction-selector.cc | 120 void InstructionSelector::StartBlock(RpoNumber rpo) {
123 scheduler_->StartBlock(rpo);
125 sequence()->StartBlock(rpo);
130 void InstructionSelector::EndBlock(RpoNumber rpo) {
133 scheduler_->EndBlock(rpo);
135 sequence()->EndBlock(rpo);
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| partially_decluster_pass.cc | 294 std::vector<Node*> rpo; local
295 GetReversePostOrder(*graph, &rpo, /*stable_comparator=*/NodeComparatorName(),
297 for (Node* n : rpo) {
328 // Since we iterate in RPO, we'll first encounter F0, decluster it, then
|
| resource_operation_safety_analysis.cc | 272 std::vector<Node*> rpo; local
273 GetReversePostOrder(g, &rpo, /*stable_comparator=*/NodeComparatorName(),
283 for (Node* n : rpo) {
|
| deadness_analysis.cc | 46 // straightforward. We traverse the graph in RPO, mapping each node to a
88 // The general algorithm that deals with cycles does two RPO (reverse post
700 Status PopulateWithReversePostOrder(absl::Span<Node* const> rpo);
1040 std::vector<Node*> rpo; local
[all...] |
| deadness_analysis_test.cc | 573 // To make deadness analysis think that dependent_iv is a loop we need an RPO
574 // that visits the merge before the backedge. This is a legal RPO for
575 // deadness analysis since it ignores NextIteration->Merge edges during RPO.
577 // RPO with this edge in place. Then remove this edge to get our test case.
578 std::vector<Node*> rpo; local
579 GetReversePostOrder(*root.graph(), &rpo, /*stable_comparator=*/{},
590 TF_ASSERT_OK(ComputePredicates(*root.graph(), rpo, &predicate_map));
[all...] |
