1 /*
2 * Copyright (c) 2021 Arm Limited.
3 *
4 * SPDX-License-Identifier: MIT
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
24 #include "arm_compute/graph/INodeVisitor.h"
25 #include "arm_compute/graph/nodes/Nodes.h"
26
27 namespace arm_compute
28 {
29 namespace graph
30 {
31 #ifndef DOXYGEN_SKIP_THIS
visit(INode & n)32 void DefaultNodeVisitor::visit(INode &n)
33 {
34 default_visit(n);
35 }
visit(ActivationLayerNode & n)36 void DefaultNodeVisitor::visit(ActivationLayerNode &n)
37 {
38 default_visit(n);
39 }
visit(BatchNormalizationLayerNode & n)40 void DefaultNodeVisitor::visit(BatchNormalizationLayerNode &n)
41 {
42 default_visit(n);
43 }
visit(ConcatenateLayerNode & n)44 void DefaultNodeVisitor::visit(ConcatenateLayerNode &n)
45 {
46 default_visit(n);
47 }
visit(ConstNode & n)48 void DefaultNodeVisitor::visit(ConstNode &n)
49 {
50 default_visit(n);
51 }
visit(ConvolutionLayerNode & n)52 void DefaultNodeVisitor::visit(ConvolutionLayerNode &n)
53 {
54 default_visit(n);
55 }
visit(DequantizationLayerNode & n)56 void DefaultNodeVisitor::visit(DequantizationLayerNode &n)
57 {
58 default_visit(n);
59 }
visit(DetectionOutputLayerNode & n)60 void DefaultNodeVisitor::visit(DetectionOutputLayerNode &n)
61 {
62 default_visit(n);
63 }
visit(DetectionPostProcessLayerNode & n)64 void DefaultNodeVisitor::visit(DetectionPostProcessLayerNode &n)
65 {
66 default_visit(n);
67 }
visit(DepthwiseConvolutionLayerNode & n)68 void DefaultNodeVisitor::visit(DepthwiseConvolutionLayerNode &n)
69 {
70 default_visit(n);
71 }
visit(EltwiseLayerNode & n)72 void DefaultNodeVisitor::visit(EltwiseLayerNode &n)
73 {
74 default_visit(n);
75 }
visit(FlattenLayerNode & n)76 void DefaultNodeVisitor::visit(FlattenLayerNode &n)
77 {
78 default_visit(n);
79 }
visit(FullyConnectedLayerNode & n)80 void DefaultNodeVisitor::visit(FullyConnectedLayerNode &n)
81 {
82 default_visit(n);
83 }
visit(FusedConvolutionBatchNormalizationNode & n)84 void DefaultNodeVisitor::visit(FusedConvolutionBatchNormalizationNode &n)
85 {
86 default_visit(n);
87 }
visit(FusedConvolutionBatchNormalizationWithPostOpsNode & n)88 void DefaultNodeVisitor::visit(FusedConvolutionBatchNormalizationWithPostOpsNode &n)
89 {
90 default_visit(n);
91 }
visit(FusedConvolutionWithPostOpNode & n)92 void DefaultNodeVisitor::visit(FusedConvolutionWithPostOpNode &n)
93 {
94 default_visit(n);
95 }
visit(FusedDepthwiseConvolutionBatchNormalizationNode & n)96 void DefaultNodeVisitor::visit(FusedDepthwiseConvolutionBatchNormalizationNode &n)
97 {
98 default_visit(n);
99 }
visit(InputNode & n)100 void DefaultNodeVisitor::visit(InputNode &n)
101 {
102 default_visit(n);
103 }
visit(NormalizationLayerNode & n)104 void DefaultNodeVisitor::visit(NormalizationLayerNode &n)
105 {
106 default_visit(n);
107 }
visit(OutputNode & n)108 void DefaultNodeVisitor::visit(OutputNode &n)
109 {
110 default_visit(n);
111 }
visit(PermuteLayerNode & n)112 void DefaultNodeVisitor::visit(PermuteLayerNode &n)
113 {
114 default_visit(n);
115 }
visit(PoolingLayerNode & n)116 void DefaultNodeVisitor::visit(PoolingLayerNode &n)
117 {
118 default_visit(n);
119 }
visit(PReluLayerNode & n)120 void DefaultNodeVisitor::visit(PReluLayerNode &n)
121 {
122 default_visit(n);
123 }
visit(PrintLayerNode & n)124 void DefaultNodeVisitor::visit(PrintLayerNode &n)
125 {
126 default_visit(n);
127 }
visit(PriorBoxLayerNode & n)128 void DefaultNodeVisitor::visit(PriorBoxLayerNode &n)
129 {
130 default_visit(n);
131 }
visit(QuantizationLayerNode & n)132 void DefaultNodeVisitor::visit(QuantizationLayerNode &n)
133 {
134 default_visit(n);
135 }
visit(ReshapeLayerNode & n)136 void DefaultNodeVisitor::visit(ReshapeLayerNode &n)
137 {
138 default_visit(n);
139 }
visit(SoftmaxLayerNode & n)140 void DefaultNodeVisitor::visit(SoftmaxLayerNode &n)
141 {
142 default_visit(n);
143 }
visit(SplitLayerNode & n)144 void DefaultNodeVisitor::visit(SplitLayerNode &n)
145 {
146 default_visit(n);
147 }
visit(StackLayerNode & n)148 void DefaultNodeVisitor::visit(StackLayerNode &n)
149 {
150 default_visit(n);
151 }
152 #endif /* DOXYGEN_SKIP_THIS */
153 } // namespace graph
154 } // namespace arm_compute
155