pass_manager.cpp 1.36 KB
Newer Older
1
//*****************************************************************************
2
// Copyright 2017-2019 Intel Corporation
3 4 5 6 7 8 9 10 11 12 13 14 15
//
// 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.
//*****************************************************************************
Robert Kimball's avatar
Robert Kimball committed
16 17 18 19 20 21 22 23

#include <memory>
#include <sstream>
#include <string>
#include <vector>

#include "gtest/gtest.h"

varun-intel's avatar
varun-intel committed
24
#include "ngraph/graph_util.hpp"
25 26
#include "ngraph/ngraph.hpp"
#include "ngraph/pass/manager.hpp"
27
#include "util/test_tools.hpp"
Robert Kimball's avatar
Robert Kimball committed
28 29 30 31

using namespace ngraph;
using namespace std;

32 33 34 35
TEST(pass_manager, add)
{
    pass::Manager pass_manager;

36
    auto graph = make_test_graph();
37 38
    size_t node_count = 0;
    traverse_nodes(graph, [&](shared_ptr<Node> node) { node_count++; });
39
    pass_manager.run_passes(graph);
Robert Kimball's avatar
Robert Kimball committed
40
    auto sorted = graph->get_ordered_ops();
41 42 43
    EXPECT_EQ(node_count, sorted.size());
    EXPECT_TRUE(validate_list(sorted));
}