| /art/compiler/optimizing/ |
| linear_order.h | 45 linear_order->resize(graph->GetReversePostOrder().size());
|
| linear_order.cc | 87 DCHECK_EQ(linear_order.size(), graph->GetReversePostOrder().size());
100 for (HBasicBlock* block : graph->GetReversePostOrder()) {
|
| side_effects_analysis.cc | 29 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| dead_code_elimination.cc | 242 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
325 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
429 for (size_t i = 1u, size = graph_->GetReversePostOrder().size(); i != size; ++i) {
430 HBasicBlock* block = graph_->GetReversePostOrder()[i];
437 DCHECK_LT(i, IndexOfElement(graph_->GetReversePostOrder(), successor));
440 DCHECK_EQ(size, graph_->GetReversePostOrder().size());
441 DCHECK_EQ(block, graph_->GetReversePostOrder()[i]);
|
| ssa_phi_elimination.cc | 46 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
136 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| cha_guard_optimization.cc | 249 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| load_store_analysis.cc | 156 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| ssa_builder.cc | 34 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
67 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
89 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
241 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| prepare_for_register_allocation.cc | 29 for (HBasicBlock* block : GetGraph()->GetReversePostOrder()) {
|
| bounds_check_elimination.cc | [all...] |
| gvn.cc | 403 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
|
| nodes.cc | 225 for (HBasicBlock* block : GetReversePostOrder()) {
233 for (HBasicBlock* block : GetReversePostOrder()) {
323 for (HBasicBlock* block : GetReversePostOrder()) {
334 for (HBasicBlock* block : GetReversePostOrder()) {
343 for (HBasicBlock* block : GetReversePostOrder()) {
538 for (HBasicBlock* block : GetReversePostOrder()) {
[all...] |
| scheduler.cc | 584 for (HBasicBlock* block : graph->GetReversePostOrder()) {
[all...] |
| reference_type_propagation.cc | 170 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
368 for (HBasicBlock* block : graph_->GetReversePostOrder()) {
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/gpu/ |
| gpu_stream_util.cc | 52 GetReversePostOrder(*graph, &order);
|
| /external/tensorflow/tensorflow/core/graph/ |
| algorithm.h | 119 void GetReversePostOrder(const Graph& g, std::vector<Node*>* order,
|
| algorithm_test.cc | 94 GetReversePostOrder(g, &order);
152 GetReversePostOrder(g, &order, /*stable_comparator=*/NodeComparatorName());
192 GetReversePostOrder(g, &reverse_post_order, /*stable_comparator=*/{},
|
| optimizer_cse.cc | 176 GetReversePostOrder(*g_, &order);
|
| algorithm.cc | 202 void GetReversePostOrder(const Graph& g, std::vector<Node*>* order,
|
| mkl_tfconversion_pass.cc | 373 GetReversePostOrder(**g, &order); // This will give us topological sort.
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| partially_decluster_pass.cc | 295 GetReversePostOrder(*graph, &rpo, /*stable_comparator=*/NodeComparatorName(),
|
| resource_operation_safety_analysis.cc | 273 GetReversePostOrder(g, &rpo, /*stable_comparator=*/NodeComparatorName(),
|
| shape_inference.cc | 49 GetReversePostOrder(graph, &order);
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| graph_compiler.cc | 123 GetReversePostOrder(*graph_, &topo_sorted_nodes,
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| single_threaded_executor.cc | 47 GetReversePostOrder(graph, &ordered_nodes);
|
