summaryrefslogtreecommitdiff
path: root/compiler/coco/core/src/IR/OpManager.cpp
blob: c87b704feffea358a878eb16af31ebc94847765a (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
/*
 * 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 "coco/IR/OpManager.h"

#include <stdex/Memory.h>

#include <cassert>
#include <queue>
#include <set>

using stdex::make_unique;

namespace coco
{

OpManager::~OpManager()
{
  std::set<coco::Op *> roots;

  for (uint32_t n = 0; n < size(); ++n)
  {
    auto op = at(n);

    if (op->up() != nullptr)
    {
      continue;
    }

    roots.insert(op);
  }

  for (const auto &op : roots)
  {
    destroy_all(op);
  }
}

//
// Each Op class SHOULD be default constructible
//
#define OP(Name)                                  \
  template <> Name *OpManager::create<Name>(void) \
  {                                               \
    auto op = make_unique<Name>();                \
    modulize(op.get());                           \
    return take(std::move(op));                   \
  }
#include "coco/IR/Op.lst"
#undef OP

void OpManager::destroy(Op *op)
{
  assert(op->parent() == nullptr);
  release(op);
}

void OpManager::destroy_all(Op *op)
{
  assert(op->parent() == nullptr);
  assert(op->up() == nullptr);

  std::queue<coco::Op *> q;

  q.emplace(op);

  while (q.size() > 0)
  {
    auto cur = q.front();
    q.pop();

    // Insert child op nodes
    for (uint32_t n = 0; n < cur->arity(); ++n)
    {
      if (auto child = cur->arg(n))
      {
        q.emplace(child);
      }
    }

    // Destroy the current op node
    destroy(cur);
  }
}

} // namespace coco