data_flow_graph_tester.cc

/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

   http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License. */

#include "paddle/fluid/inference/analysis/data_flow_graph.h"
#include "paddle/fluid/inference/analysis/ut_helper.h"

namespace paddle {
namespace inference {
namespace analysis {

TEST(DataFlowGraph, BFS) {
  auto desc = LoadProgramDesc();
  auto dfg = ProgramDescToDFG(desc);
  dfg.Build();

  for (auto* in : dfg.inputs) {
    LOG(INFO) << "inputs: " << in->name() << " "
              << static_cast<int>(in->type());
  }
  for (auto* out : dfg.outputs) {
    LOG(INFO) << "outputs: " << out->name() << " "
              << static_cast<int>(out->type());
  }

  GraphTraits<DataFlowGraph> trait(&dfg);
  auto nodes = trait.nodes();
  int count = 0;
  for (auto it = nodes.begin(); it != nodes.end(); ++it) {
    LOG(INFO) << "visiting " << it->name();
    ++count;
  }
  ASSERT_EQ(count, dfg.nodes.size());
}

TEST(DataFlowGraph, DFS) {
  auto desc = LoadProgramDesc();
  auto dfg = ProgramDescToDFG(desc);
  dfg.Build();
  GraphTraits<DataFlowGraph> trait(&dfg);
  auto nodes = trait.nodes_in_DFS();
  int count = 0;
  for (auto it = nodes.begin(); it != nodes.end(); ++it) {
    LOG(INFO) << "visiting " << it->name();
    ++count;
  }
  ASSERT_EQ(count, dfg.nodes.size());
}

}  // namespace analysis
}  // namespace inference
}  // namespace paddle