blob: efffc5849112709f2cd42994324914f1764feef5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
* Copyright (c) 2018 Samsung Electronics Co., Ltd. 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 "Dumper.h"
#include <string>
#include "util/logging.h"
namespace neurun
{
namespace graph
{
namespace dumper
{
using namespace neurun::model::operation;
void Dumper::visit(const Conv2DNode &node)
{
VERBOSE(LIR) << "* Conv2D(Implicit)" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ") Kernel("
<< node.getInputs().at(1).value() << ") Bias(" << node.getInputs().at(2).value()
<< ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const MaxPool2DNode &node)
{
VERBOSE(LIR) << "* MaxPool2D(Implicit)" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const AvgPool2DNode &node)
{
VERBOSE(LIR) << "* AvgPool2D(Implicit)" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const ConcatNode &node)
{
VERBOSE(LIR) << "* Concat" << std::endl;
std::string inputs;
for (auto i : node.getInputs())
{
inputs += std::to_string(i.value()) + ",";
}
VERBOSE(LIR) << " - Inputs : IFM(" << inputs << ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const FullyConnectedNode &node)
{
VERBOSE(LIR) << "* FullyConnected" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ") Weight("
<< node.getInputs().at(1).value() << ") Bias(" << node.getInputs().at(2).value()
<< ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const ReshapeNode &node)
{
VERBOSE(LIR) << "* Reshape" << std::endl;
// TODO The shape index should be "node.getInputs().at(1).value()" but not valid for now
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ") Shape("
<< "?"
<< ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const SoftmaxNode &node)
{
VERBOSE(LIR) << "* Softmax" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const PermuteNode &node)
{
VERBOSE(LIR) << "* Permute" << std::endl;
VERBOSE(LIR) << " - Inputs : IFM(" << node.getInputs().at(0).value() << ")" << std::endl;
VERBOSE(LIR) << " - Output : OFM(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
void Dumper::visit(const AddNode &node)
{
VERBOSE(LIR) << "* Add" << std::endl;
VERBOSE(LIR) << " - Inputs : Input(" << node.getInputs().at(0).value() << ", "
<< node.getInputs().at(1).value() << ")" << std::endl;
VERBOSE(LIR) << " - Output : Output(" << node.getOutputs().at(0).value() << ")" << std::endl;
}
} // namespace dumper
} // namespace graph
} // namespace neurun
|
