summaryrefslogtreecommitdiff
path: root/compiler/luci/import/src/Nodes/CircleLessEqual.cpp
blob: 13e99506971cf3759820d972aa19baf5ba8c70f9 (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
/*
 * Copyright (c) 2020 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 "luci/Import/Nodes/CircleLessEqual.h"

#include <luci/IR/Nodes/CircleLessEqual.h>

#include <loco.h>

namespace luci
{

bool CircleLessEqualGraphBuilder::validate(const ValidateArgs &args) const
{
  const auto &inputs = args.op.inputs;
  const auto &outputs = args.op.outputs;

  if (inputs.size() != 2)
  {
    return false;
  }

  if (outputs.size() != 1)
  {
    return false;
  }

  const auto &tensors = args.reader.tensors();

  if (tensors[inputs[0]]->type != tensors[inputs[1]]->type)
  {
    return false;
  }

  return tensors[outputs[0]]->type == circle::TensorType::TensorType_BOOL;
}

CircleNode *CircleLessEqualGraphBuilder::build_node(const circle::OperatorT &,
                                                    const std::vector<CircleNode *> &inputs,
                                                    loco::Graph *graph) const
{
  auto *node = graph->nodes()->create<CircleLessEqual>();
  node->x(inputs[0]);
  node->y(inputs[1]);

  return node;
}

} // namespace luci