Freddie Liardet | dd23f2a | 2021-06-17 13:30:11 +0100 | [diff] [blame] | 1 | /* |
Jakub Sujak | 0d27b2e | 2023-08-24 14:01:20 +0100 | [diff] [blame] | 2 | * Copyright (c) 2021, 2023 Arm Limited. |
Freddie Liardet | dd23f2a | 2021-06-17 13:30:11 +0100 | [diff] [blame] | 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" |
Felix Thomasmathibalan | afd38f0 | 2023-09-27 17:46:17 +0100 | [diff] [blame] | 25 | |
Freddie Liardet | dd23f2a | 2021-06-17 13:30:11 +0100 | [diff] [blame] | 26 | #include "arm_compute/graph/nodes/Nodes.h" |
| 27 | |
| 28 | namespace arm_compute |
| 29 | { |
| 30 | namespace graph |
| 31 | { |
| 32 | #ifndef DOXYGEN_SKIP_THIS |
| 33 | void DefaultNodeVisitor::visit(INode &n) |
| 34 | { |
| 35 | default_visit(n); |
| 36 | } |
| 37 | void DefaultNodeVisitor::visit(ActivationLayerNode &n) |
| 38 | { |
| 39 | default_visit(n); |
| 40 | } |
| 41 | void DefaultNodeVisitor::visit(BatchNormalizationLayerNode &n) |
| 42 | { |
| 43 | default_visit(n); |
| 44 | } |
| 45 | void DefaultNodeVisitor::visit(ConcatenateLayerNode &n) |
| 46 | { |
| 47 | default_visit(n); |
| 48 | } |
| 49 | void DefaultNodeVisitor::visit(ConstNode &n) |
| 50 | { |
| 51 | default_visit(n); |
| 52 | } |
| 53 | void DefaultNodeVisitor::visit(ConvolutionLayerNode &n) |
| 54 | { |
| 55 | default_visit(n); |
| 56 | } |
| 57 | void DefaultNodeVisitor::visit(DequantizationLayerNode &n) |
| 58 | { |
| 59 | default_visit(n); |
| 60 | } |
| 61 | void DefaultNodeVisitor::visit(DetectionOutputLayerNode &n) |
| 62 | { |
| 63 | default_visit(n); |
| 64 | } |
| 65 | void DefaultNodeVisitor::visit(DetectionPostProcessLayerNode &n) |
| 66 | { |
| 67 | default_visit(n); |
| 68 | } |
| 69 | void DefaultNodeVisitor::visit(DepthwiseConvolutionLayerNode &n) |
| 70 | { |
| 71 | default_visit(n); |
| 72 | } |
| 73 | void DefaultNodeVisitor::visit(EltwiseLayerNode &n) |
| 74 | { |
| 75 | default_visit(n); |
| 76 | } |
| 77 | void DefaultNodeVisitor::visit(FlattenLayerNode &n) |
| 78 | { |
| 79 | default_visit(n); |
| 80 | } |
| 81 | void DefaultNodeVisitor::visit(FullyConnectedLayerNode &n) |
| 82 | { |
| 83 | default_visit(n); |
| 84 | } |
| 85 | void DefaultNodeVisitor::visit(FusedConvolutionBatchNormalizationNode &n) |
| 86 | { |
| 87 | default_visit(n); |
| 88 | } |
Freddie Liardet | dd23f2a | 2021-06-17 13:30:11 +0100 | [diff] [blame] | 89 | void DefaultNodeVisitor::visit(FusedDepthwiseConvolutionBatchNormalizationNode &n) |
| 90 | { |
| 91 | default_visit(n); |
| 92 | } |
| 93 | void DefaultNodeVisitor::visit(InputNode &n) |
| 94 | { |
| 95 | default_visit(n); |
| 96 | } |
| 97 | void DefaultNodeVisitor::visit(NormalizationLayerNode &n) |
| 98 | { |
| 99 | default_visit(n); |
| 100 | } |
| 101 | void DefaultNodeVisitor::visit(OutputNode &n) |
| 102 | { |
| 103 | default_visit(n); |
| 104 | } |
| 105 | void DefaultNodeVisitor::visit(PermuteLayerNode &n) |
| 106 | { |
| 107 | default_visit(n); |
| 108 | } |
| 109 | void DefaultNodeVisitor::visit(PoolingLayerNode &n) |
| 110 | { |
| 111 | default_visit(n); |
| 112 | } |
| 113 | void DefaultNodeVisitor::visit(PReluLayerNode &n) |
| 114 | { |
| 115 | default_visit(n); |
| 116 | } |
| 117 | void DefaultNodeVisitor::visit(PrintLayerNode &n) |
| 118 | { |
| 119 | default_visit(n); |
| 120 | } |
| 121 | void DefaultNodeVisitor::visit(PriorBoxLayerNode &n) |
| 122 | { |
| 123 | default_visit(n); |
| 124 | } |
| 125 | void DefaultNodeVisitor::visit(QuantizationLayerNode &n) |
| 126 | { |
| 127 | default_visit(n); |
| 128 | } |
| 129 | void DefaultNodeVisitor::visit(ReshapeLayerNode &n) |
| 130 | { |
| 131 | default_visit(n); |
| 132 | } |
| 133 | void DefaultNodeVisitor::visit(SoftmaxLayerNode &n) |
| 134 | { |
| 135 | default_visit(n); |
| 136 | } |
| 137 | void DefaultNodeVisitor::visit(SplitLayerNode &n) |
| 138 | { |
| 139 | default_visit(n); |
| 140 | } |
| 141 | void DefaultNodeVisitor::visit(StackLayerNode &n) |
| 142 | { |
| 143 | default_visit(n); |
| 144 | } |
| 145 | #endif /* DOXYGEN_SKIP_THIS */ |
| 146 | } // namespace graph |
ramelg01 | b75d624 | 2021-11-26 19:12:40 +0000 | [diff] [blame] | 147 | } // namespace arm_compute |