mirror of https://github.com/KLayout/klayout.git
418 lines
14 KiB
C++
418 lines
14 KiB
C++
|
|
/*
|
|
|
|
KLayout Layout Viewer
|
|
Copyright (C) 2006-2016 Matthias Koefferlein
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
#include "dbRecursiveShapeIterator.h"
|
|
#include "tlString.h"
|
|
#include "utHead.h"
|
|
|
|
std::string collect(db::RecursiveShapeIterator &s, const db::Layout &layout, bool with_layer = false)
|
|
{
|
|
std::string res;
|
|
while (! s.at_end ()) {
|
|
if (! res.empty ()) {
|
|
res += "/";
|
|
}
|
|
if (s.cell ()) {
|
|
res += std::string ("[") + layout.cell_name (s.cell ()->cell_index ()) + "]";
|
|
} else {
|
|
res += "[]";
|
|
}
|
|
if (s->is_box ()) {
|
|
db::Box box;
|
|
s->box (box);
|
|
res += (s.trans () * box).to_string ();
|
|
} else {
|
|
res += "X";
|
|
}
|
|
if (with_layer) {
|
|
res += "*";
|
|
res += tl::to_string (s.layer ());
|
|
}
|
|
++s;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
TEST(1)
|
|
{
|
|
db::Manager m;
|
|
db::Layout g (&m);
|
|
g.insert_layer (0);
|
|
g.insert_layer (1);
|
|
g.insert_layer (2);
|
|
|
|
db::Cell &c0 (g.cell (g.add_cell ()));
|
|
|
|
db::RecursiveShapeIterator i00 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
EXPECT_EQ (collect (i00, g), "");
|
|
|
|
db::Cell &c1 (g.cell (g.add_cell ()));
|
|
db::Cell &c2 (g.cell (g.add_cell ()));
|
|
db::Cell &c3 (g.cell (g.add_cell ()));
|
|
|
|
db::RecursiveShapeIterator i0 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
EXPECT_EQ (collect (i0, g), "");
|
|
|
|
db::Box b (0, 100, 1000, 1200);
|
|
c0.shapes (0).insert (b);
|
|
c1.shapes (0).insert (b);
|
|
c2.shapes (0).insert (b);
|
|
c3.shapes (0).insert (b);
|
|
|
|
c0.shapes (2).insert (b);
|
|
c0.shapes (2).insert (b.moved (db::Vector (50, 50)));
|
|
|
|
db::Trans tt;
|
|
c0.insert (db::CellInstArray (db::CellInst (c1.cell_index ()), tt));
|
|
c0.insert (db::CellInstArray (db::CellInst (c2.cell_index ()), db::Trans (db::Vector (100, -100))));
|
|
c0.insert (db::CellInstArray (db::CellInst (c3.cell_index ()), db::Trans (1)));
|
|
c2.insert (db::CellInstArray (db::CellInst (c3.cell_index ()), db::Trans (db::Vector (1100, 0))));
|
|
|
|
std::string x;
|
|
|
|
db::RecursiveShapeIterator i1 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
x = collect(i1, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i1_1inf (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
i1_1inf.min_depth(1);
|
|
x = collect(i1_1inf, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i1_11 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
i1_11.min_depth(1);
|
|
i1_11.max_depth(1);
|
|
x = collect(i1_11, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i1_12 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
i1_12.min_depth(1);
|
|
i1_12.max_depth(2);
|
|
x = collect(i1_12, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i1_22 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
i1_22.min_depth(2);
|
|
i1_22.max_depth(2);
|
|
x = collect(i1_22, g);
|
|
EXPECT_EQ (x, "");
|
|
|
|
db::RecursiveShapeIterator i1o (g, c0, 0, db::Box (0, 0, 100, 100), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "");
|
|
i1o = db::RecursiveShapeIterator (g, c0, 0, db::Box (0, 0, 100, 101), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)");
|
|
i1o = db::RecursiveShapeIterator (g, c0, 0, db::Box (0, 0, 101, 101), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i2 (g, c0, 0, db::Box (-100, 0, 100, 100));
|
|
db::RecursiveShapeIterator i2c = i2;
|
|
x = collect(i2, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
x = collect(i2c, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
db::RecursiveShapeIterator i2o (g, c0, 0, db::Box (-100, 0, 100, 100), true);
|
|
x = collect(i2o, g);
|
|
EXPECT_EQ (x, "");
|
|
i2o = db::RecursiveShapeIterator (g, c0, 0, db::Box (-101, 0, 101, 101), true);
|
|
x = collect(i2o, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
db::RecursiveShapeIterator i4 (g, c0, 0, db::Box (-100, 0, 2000, 100));
|
|
db::RecursiveShapeIterator i4_copy (g, c0, 0, db::Box (-100, 0, 2000, 100));
|
|
i4.max_depth (0);
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)");
|
|
|
|
EXPECT_EQ (i4 == i4, true);
|
|
EXPECT_EQ (i4 != i4, false);
|
|
EXPECT_EQ (i4 == i4_copy, false);
|
|
EXPECT_EQ (i4 != i4_copy, true);
|
|
i4 = i4_copy;
|
|
EXPECT_EQ (i4 == i4_copy, true);
|
|
EXPECT_EQ (i4 != i4_copy, false);
|
|
i4.max_depth (1);
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
i4 = i4_copy;
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
db::RecursiveShapeIterator i5 (g, c0, 0, db::Box::world ());
|
|
x = collect(i5, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
std::set<db::cell_index_type> cc;
|
|
db::RecursiveShapeIterator ii;
|
|
|
|
ii = db::RecursiveShapeIterator (g, c0, 0, db::Box::world ());
|
|
cc.clear ();
|
|
cc.insert (c3.cell_index ());
|
|
ii.unselect_all_cells ();
|
|
ii.select_cells (cc);
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
ii.reset ();
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
ii.reset_selection ();
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
ii.reset_selection ();
|
|
cc.clear ();
|
|
cc.insert (c0.cell_index ());
|
|
cc.insert (c2.cell_index ());
|
|
ii.unselect_cells (cc);
|
|
cc.clear ();
|
|
cc.insert (c2.cell_index ());
|
|
ii.select_cells (cc);
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)");
|
|
|
|
ii = db::RecursiveShapeIterator (g, c0, 0, db::Box::world ());
|
|
ii.unselect_all_cells ();
|
|
cc.clear ();
|
|
cc.insert (c3.cell_index ());
|
|
cc.insert (c0.cell_index ());
|
|
ii.select_cells (cc);
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
ii = db::RecursiveShapeIterator (g, c0, 0, db::Box::world ());
|
|
ii.unselect_all_cells ();
|
|
cc.clear ();
|
|
cc.insert (c0.cell_index ());
|
|
cc.insert (c1.cell_index ());
|
|
ii.select_cells (cc);
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[$1](0,100;1000,1200)/[$2](0,100;1000,1200)");
|
|
|
|
// Shapes iterators
|
|
|
|
ii = db::RecursiveShapeIterator (c0.shapes (0));
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[](0,100;1000,1200)");
|
|
|
|
ii = db::RecursiveShapeIterator (c0.shapes (0), db::Box (0, 0, 10, 10));
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "");
|
|
|
|
ii.set_region (db::Box (0, 100, 0, 110));
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[](0,100;1000,1200)");
|
|
|
|
ii = db::RecursiveShapeIterator (c0.shapes (1), db::Box::world ());
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "");
|
|
|
|
ii = db::RecursiveShapeIterator (c0.shapes (2), db::Box::world ());
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[](0,100;1000,1200)/[](50,150;1050,1250)");
|
|
|
|
ii = db::RecursiveShapeIterator (c0.shapes (2), db::Box (0, 0, 100, 100));
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[](0,100;1000,1200)");
|
|
|
|
ii.set_overlapping (true);
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "");
|
|
|
|
ii.set_region (db::Box (0, 0, 101, 101));
|
|
x = collect(ii, g);
|
|
EXPECT_EQ (x, "[](0,100;1000,1200)");
|
|
}
|
|
|
|
TEST(1a)
|
|
{
|
|
db::Manager m;
|
|
db::Layout g (&m);
|
|
g.insert_layer (0);
|
|
g.insert_layer (1);
|
|
db::Cell &c0 (g.cell (g.add_cell ()));
|
|
db::Cell &c1 (g.cell (g.add_cell ()));
|
|
db::Cell &c2 (g.cell (g.add_cell ()));
|
|
db::Cell &c3 (g.cell (g.add_cell ()));
|
|
|
|
db::Box b (0, 100, 1000, 1200);
|
|
c1.shapes (0).insert (b);
|
|
c2.shapes (0).insert (b);
|
|
c3.shapes (0).insert (b);
|
|
|
|
db::Box bb (1, 101, 1001, 1201);
|
|
c2.shapes (1).insert (bb);
|
|
|
|
db::Trans tt;
|
|
c0.insert (db::CellInstArray (db::CellInst (c1.cell_index ()), tt));
|
|
c0.insert (db::CellInstArray (db::CellInst (c2.cell_index ()), db::Trans (db::Vector (100, -100))));
|
|
c0.insert (db::CellInstArray (db::CellInst (c3.cell_index ()), db::Trans (1)));
|
|
c2.insert (db::CellInstArray (db::CellInst (c3.cell_index ()), db::Trans (db::Vector (1100, 0))));
|
|
|
|
std::string x;
|
|
|
|
db::RecursiveShapeIterator i1 (g, c0, 0, db::Box (0, 0, 100, 100));
|
|
x = collect(i1, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i1o (g, c0, 0, db::Box (0, 0, 100, 100), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "");
|
|
i1o = db::RecursiveShapeIterator (g, c0, 0, db::Box (0, 0, 100, 101), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)");
|
|
i1o = db::RecursiveShapeIterator (g, c0, 0, db::Box (0, 0, 101, 101), true);
|
|
x = collect(i1o, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)");
|
|
|
|
db::RecursiveShapeIterator i2 (g, c0, 0, db::Box (-100, 0, 100, 100));
|
|
x = collect(i2, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
db::RecursiveShapeIterator i2o (g, c0, 0, db::Box (-100, 0, 100, 100), true);
|
|
x = collect(i2o, g);
|
|
EXPECT_EQ (x, "");
|
|
i2o = db::RecursiveShapeIterator (g, c0, 0, db::Box (-101, 0, 101, 101), true);
|
|
x = collect(i2o, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
db::RecursiveShapeIterator i4 (g, c0, 0, db::Box (-100, 0, 2000, 100));
|
|
db::RecursiveShapeIterator i4_copy (g, c0, 0, db::Box (-100, 0, 2000, 100));
|
|
i4.max_depth (0);
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "");
|
|
|
|
EXPECT_EQ (i4 == i4, true);
|
|
EXPECT_EQ (i4 != i4, false);
|
|
EXPECT_EQ (i4 == i4_copy, false);
|
|
EXPECT_EQ (i4 != i4_copy, true);
|
|
i4 = i4_copy;
|
|
EXPECT_EQ (i4 == i4_copy, true);
|
|
EXPECT_EQ (i4 != i4_copy, false);
|
|
i4.max_depth (1);
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
i4 = i4_copy;
|
|
x = collect(i4, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
db::RecursiveShapeIterator i5 (g, c0, 0, db::Box::world ());
|
|
x = collect(i5, g);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)/[$3](100,0;1100,1100)/[$4](1200,0;2200,1100)/[$4](-1200,0;-100,1000)");
|
|
|
|
std::set<unsigned int> ll;
|
|
|
|
db::RecursiveShapeIterator i5a (g, c0, ll, db::Box::world ());
|
|
x = collect(i5a, g, true);
|
|
EXPECT_EQ (x, "");
|
|
|
|
ll.insert (0);
|
|
db::RecursiveShapeIterator i5b (g, c0, ll, db::Box::world ());
|
|
x = collect(i5b, g, true);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)*0/[$3](100,0;1100,1100)*0/[$4](1200,0;2200,1100)*0/[$4](-1200,0;-100,1000)*0");
|
|
|
|
ll.insert (1);
|
|
db::RecursiveShapeIterator i5c (g, c0, ll, db::Box::world ());
|
|
db::RecursiveShapeIterator i5cc = i5c;
|
|
x = collect(i5c, g, true);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)*0/[$3](100,0;1100,1100)*0/[$3](101,1;1101,1101)*1/[$4](1200,0;2200,1100)*0/[$4](-1200,0;-100,1000)*0");
|
|
x = collect(i5cc, g, true);
|
|
EXPECT_EQ (x, "[$2](0,100;1000,1200)*0/[$3](100,0;1100,1100)*0/[$3](101,1;1101,1101)*1/[$4](1200,0;2200,1100)*0/[$4](-1200,0;-100,1000)*0");
|
|
}
|
|
|
|
TEST(1b)
|
|
{
|
|
db::Manager m;
|
|
db::Layout g (&m);
|
|
g.insert_layer (0);
|
|
db::Cell &c0 (g.cell (g.add_cell ()));
|
|
db::Cell &c1 (g.cell (g.add_cell ()));
|
|
|
|
db::Box b;
|
|
b = db::Box (0, 0, 2000, 2000000);
|
|
c1.shapes (0).insert (b);
|
|
b = db::Box (1998000, 0, 2000000, 2000000);
|
|
c1.shapes (0).insert (b);
|
|
b = db::Box (0, 0, 2000000, 2000);
|
|
c1.shapes (0).insert (b);
|
|
b = db::Box (0, 1998000, 2000000, 2000000);
|
|
c1.shapes (0).insert (b);
|
|
|
|
db::Trans tt;
|
|
c0.insert (db::CellInstArray (db::CellInst (c1.cell_index ()), tt));
|
|
c0.insert (db::CellInstArray (db::CellInst (c1.cell_index ()), tt));
|
|
|
|
db::RecursiveShapeIterator i (g, c0, 0, db::Box (1000000, 1000000, 10001000, 10001000));
|
|
std::string x = collect(i, g);
|
|
EXPECT_EQ (x, "[$2](1998000,0;2000000,2000000)/[$2](0,1998000;2000000,2000000)/[$2](1998000,0;2000000,2000000)/[$2](0,1998000;2000000,2000000)");
|
|
|
|
db::RecursiveShapeIterator i2 (g, c0, 0, db::Box (1000000, 1000000, 1001000, 1001000));
|
|
x = collect(i2, g);
|
|
EXPECT_EQ (x, "");
|
|
}
|
|
|
|
TEST(2)
|
|
{
|
|
db::Manager m;
|
|
db::Layout g (&m);
|
|
g.insert_layer(0);
|
|
|
|
db::Cell &c0 (g.cell (g.add_cell ()));
|
|
db::Cell &c1 (g.cell (g.add_cell ()));
|
|
db::Cell &c2 (g.cell (g.add_cell ()));
|
|
|
|
db::Box b (1000, -500, 2000, 500);
|
|
c2.shapes (0).insert (b);
|
|
|
|
db::Trans tt;
|
|
c0.insert (db::CellInstArray (db::CellInst (c1.cell_index ()), tt, db::Vector (0, 6000), db::Vector (6000, 0), 2, 2));
|
|
c1.insert (db::CellInstArray (db::CellInst (c2.cell_index ()), tt, db::Vector (0, 2000), db::Vector (3000, 1000), 2, 2));
|
|
|
|
std::string x;
|
|
|
|
db::RecursiveShapeIterator i (g, c0, 0, db::Box::world ());
|
|
x = collect(i, g);
|
|
EXPECT_EQ (x, "[$3](1000,-500;2000,500)/[$3](1000,1500;2000,2500)/[$3](4000,500;5000,1500)/[$3](4000,2500;5000,3500)/[$3](1000,5500;2000,6500)/[$3](1000,7500;2000,8500)/[$3](4000,6500;5000,7500)/[$3](4000,8500;5000,9500)/[$3](7000,-500;8000,500)/[$3](7000,1500;8000,2500)/[$3](10000,500;11000,1500)/[$3](10000,2500;11000,3500)/[$3](7000,5500;8000,6500)/[$3](7000,7500;8000,8500)/[$3](10000,6500;11000,7500)/[$3](10000,8500;11000,9500)");
|
|
|
|
db::RecursiveShapeIterator i2 (g, c0, 0, db::Box (3400, 3450, 5600, 6500));
|
|
x = collect(i2, g);
|
|
EXPECT_EQ (x, "[$3](4000,2500;5000,3500)/[$3](4000,6500;5000,7500)");
|
|
|
|
db::RecursiveShapeIterator i3 (g, c0, 0, db::Box (6650, 5300, 10000, 7850));
|
|
x = collect(i3, g);
|
|
EXPECT_EQ (x, "[$3](7000,5500;8000,6500)/[$3](7000,7500;8000,8500)/[$3](10000,6500;11000,7500)");
|
|
|
|
db::RecursiveShapeIterator i2o (g, c0, 0, db::Box (3400, 3450, 5600, 6500), true);
|
|
x = collect(i2o, g);
|
|
EXPECT_EQ (x, "[$3](4000,2500;5000,3500)");
|
|
|
|
db::RecursiveShapeIterator i3o (g, c0, 0, db::Box (6650, 5300, 10000, 7850), true);
|
|
x = collect(i3o, g);
|
|
EXPECT_EQ (x, "[$3](7000,5500;8000,6500)/[$3](7000,7500;8000,8500)");
|
|
}
|
|
|
|
|