1 ///////////////////////////////////////////////////////////////////////////////
2 // BSD 3-Clause License
3 //
4 // Copyright (c) 2019, Nefelus Inc
5 // All rights reserved.
6 //
7 // Redistribution and use in source and binary forms, with or without
8 // modification, are permitted provided that the following conditions are met:
9 //
10 // * Redistributions of source code must retain the above copyright notice, this
11 //   list of conditions and the following disclaimer.
12 //
13 // * Redistributions in binary form must reproduce the above copyright notice,
14 //   this list of conditions and the following disclaimer in the documentation
15 //   and/or other materials provided with the distribution.
16 //
17 // * Neither the name of the copyright holder nor the names of its
18 //   contributors may be used to endorse or promote products derived from
19 //   this software without specific prior written permission.
20 //
21 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
25 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 // POSSIBILITY OF SUCH DAMAGE.
32 
33 #include "dbTechLayerItr.h"
34 
35 #include "dbTable.h"
36 #include "dbTech.h"
37 #include "dbTechLayer.h"
38 
39 namespace odb {
40 
reversible()41 bool dbTechLayerItr::reversible()
42 {
43   return false;
44 }
45 
orderReversed()46 bool dbTechLayerItr::orderReversed()
47 {
48   return false;
49 }
50 
reverse(dbObject *)51 void dbTechLayerItr::reverse(dbObject* /* unused: parent */)
52 {
53 }
54 
sequential()55 uint dbTechLayerItr::sequential()
56 {
57   return 0;
58 }
59 
size(dbObject * parent)60 uint dbTechLayerItr::size(dbObject* parent)
61 {
62   uint id;
63   uint cnt = 0;
64 
65   for (id = dbTechLayerItr::begin(parent); id != dbTechLayerItr::end(parent);
66        id = dbTechLayerItr::next(id))
67     ++cnt;
68 
69   return cnt;
70 }
71 
begin(dbObject * parent)72 uint dbTechLayerItr::begin(dbObject* parent)
73 {
74   _dbTech* tech = (_dbTech*) parent;
75   return (uint) tech->_bottom;
76 }
77 
end(dbObject *)78 uint dbTechLayerItr::end(dbObject* /* unused: parent */)
79 {
80   return 0;
81 }
82 
next(uint id,...)83 uint dbTechLayerItr::next(uint id, ...)
84 {
85   _dbTechLayer* layer = _layer_tbl->getPtr(id);
86   return layer->_upper;
87 }
88 
getObject(uint id,...)89 dbObject* dbTechLayerItr::getObject(uint id, ...)
90 {
91   return _layer_tbl->getPtr(id);
92 }
93 
94 }  // namespace odb
95