luke
/
klayout
mirror of https://github.com/KLayout/klayout.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
klayout/src/db/unit_tests/dbDeepRegionTests.cc

1436 lines
56 KiB
C++
Raw Normal View History

WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
/*
KLayout Layout Viewer
Updated copyright.
2019-01-08 01:09:25 +01:00
Copyright (C) 2006-2019 Matthias Koefferlein
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
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 "dbHierarchyBuilder.h"
#include "dbReader.h"
#include "dbTestSupport.h"
#include "dbRegion.h"
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
#include "dbEdges.h"
Refactoring: new concept for edge/polygon filters
2019-02-19 20:19:10 +01:00
#include "dbRegionUtils.h"
Added tests for region processors.
2019-02-20 21:40:43 +01:00
#include "dbRegionProcessors.h"
Refactoring: new concept for edge/polygon filters
2019-02-19 20:19:10 +01:00
#include "dbEdgesUtils.h"
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
#include "dbDeepShapeStore.h"
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
#include "dbOriginalLayerRegion.h"
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
#include "tlUnitTest.h"
#include "tlStream.h"
TEST(1)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::DeepShapeStore dss;
db::Layout target;
// deliberately using vector to force reallocation ...
std::vector<db::Region> regions;
std::vector<unsigned int> target_layers;
for (db::Layout::layer_iterator li = ly.begin_layers (); li != ly.end_layers (); ++li) {
unsigned int li1 = (*li).first;
db::RecursiveShapeIterator iter (ly, ly.cell (top_cell_index), li1);
target_layers.push_back (target.insert_layer (*(*li).second));
regions.push_back (db::Region (iter, dss));
WIP: more on deep edge collections.
2019-02-10 15:33:14 +01:00
EXPECT_EQ (regions.back ().size (), db::Region (iter).size ());
EXPECT_EQ (regions.back ().bbox (), db::Region (iter).bbox ());
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (regions.back ().is_merged (), false);
WIP: more on deep edge collections.
2019-02-10 15:33:14 +01:00
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
}
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
for (std::vector<db::Region>::const_iterator r = regions.begin (); r != regions.end (); ++r) {
target.insert (target_top_cell_index, target_layers [r - regions.begin ()], *r);
}
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au1.gds");
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
// some operations
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, ly.cell (top_cell_index), l2), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, ly.cell (top_cell_index), l3), dss);
EXPECT_EQ (r2.is_merged (), false);
r2.merge ();
EXPECT_EQ (r2.is_merged (), true);
r2 += r3;
EXPECT_EQ (r2.is_merged (), false);
EXPECT_EQ (r2.merged ().is_merged (), true);
EXPECT_EQ (r2.is_merged (), false);
r2.merge ();
EXPECT_EQ (r2.is_merged (), true);
r2.flatten ();
EXPECT_EQ (r2.is_merged (), true);
r2.insert (db::Box (0, 0, 1000, 2000));
EXPECT_EQ (r2.is_merged (), false);
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
}
TEST(2)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::DeepShapeStore dss;
db::Layout target;
// deliberately using vector to force reallocation ...
std::vector<std::pair<db::Region, unsigned int> > regions;
for (db::Layout::layer_iterator li = ly.begin_layers (); li != ly.end_layers (); ++li) {
unsigned int li1 = (*li).first;
unsigned int tl = target.insert_layer (*(*li).second);
db::RecursiveShapeIterator iter1 (ly, ly.cell (top_cell_index), li1, db::Box (2000, -1000, 6000, 4000));
regions.push_back (std::make_pair (db::Region (iter1, dss), tl));
db::RecursiveShapeIterator iter2 (ly, ly.cell (top_cell_index), li1, db::Box (14000, 0, 20000, 3000));
regions.push_back (std::make_pair (db::Region (iter2, dss), tl));
}
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
for (std::vector<std::pair<db::Region, unsigned int> >::const_iterator r = regions.begin (); r != regions.end (); ++r) {
target.insert (target_top_cell_index, r->second, r->first);
}
CHECKPOINT();
WIP: implemented AND/NOT in deep region, added tests.
2018-11-17 01:33:58 +01:00
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au2.gds");
}
TEST(3_BoolAndNot)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l42 = ly.get_layer (db::LayerProperties (42, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r42 (db::RecursiveShapeIterator (ly, top_cell, l42), dss);
db::Region box (db::Box (2000, -1000, 6000, 4000));
db::Region r2minus3 = r2 - r3;
db::Region r2minusbox = r2 - box;
db::Region r2minus42 = r2 - r42;
db::Region rboxminus3 = box - r3;
db::Region r42minus3 = r42 - r3;
db::Region r42minus42 = r42 - r42;
db::Region r2and3 = r2 & r3;
db::Region r2andbox = r2 & box;
db::Region r2and42 = r2 & r42;
db::Region rboxand3 = box & r3;
db::Region r42and3 = r42 & r3;
db::Region r42and42 = r42 & r42;
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r2and3.is_merged (), false);
WIP: implemented AND/NOT in deep region, added tests.
2018-11-17 01:33:58 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2minus3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2minusbox);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2minus42);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), rboxminus3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r42minus3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (15, 0)), r42minus42);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r2and3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r2andbox);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), r2and42);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (23, 0)), rboxand3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (24, 0)), r42and3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (25, 0)), r42and42);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au3.gds");
WIP: deep region debugged, GSI binding, tests.
2018-11-17 00:16:13 +01:00
}
WIP: DeepRegion::add implemented.
2018-11-18 09:58:10 +01:00
TEST(4_Add)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l42 = ly.get_layer (db::LayerProperties (42, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r42 (db::RecursiveShapeIterator (ly, top_cell, l42), dss);
db::Region box (db::Box (2000, -1000, 6000, 4000));
db::Region r2box (db::RecursiveShapeIterator (ly, top_cell, l2, box), dss);
db::Region r3box (db::RecursiveShapeIterator (ly, top_cell, l3, box), dss);
// intra-layout
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2 + r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r42 + r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2 + r42);
db::Region rnew2 = r2;
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), rnew2);
rnew2 += r3;
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), rnew2);
rnew2 += r42;
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), rnew2);
db::Region rnew42 = r42;
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (30, 0)), rnew42);
rnew42 += r2;
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (31, 0)), rnew42);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au4a.gds");
}
// inter-layout
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2box + r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2 + r3box);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2box + r3box);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), box + r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r2 + box);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au4b.gds");
}
}
WIP: Deep region XOR implemented.
2018-11-21 00:32:14 +01:00
TEST(5_BoolXOR)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l42 = ly.get_layer (db::LayerProperties (42, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r42 (db::RecursiveShapeIterator (ly, top_cell, l42), dss);
db::Region box (db::Box (2000, -1000, 6000, 4000));
db::Region r2xor3 = r2 ^ r3;
db::Region r2xorbox = r2 ^ box;
db::Region r2xor42 = r2 ^ r42;
db::Region rboxxor3 = box ^ r3;
db::Region r42xor3 = r42 ^ r3;
db::Region r42xor42 = r42 ^ r42;
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r2xor3.is_merged (), false);
WIP: Deep region XOR implemented.
2018-11-21 00:32:14 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2xor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2xorbox);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2xor42);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), rboxxor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r42xor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (15, 0)), r42xor42);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au5.gds");
}
WIP: More on deep regions & hier processor - Splitting of shapes on output of booleans - A bugfix: error happened when pulling intruders from second-next hier level - Tests added - Some TODO comments added
2018-11-22 01:26:03 +01:00
TEST(6_Reduction)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l42 = ly.get_layer (db::LayerProperties (42, 0));
unsigned int lbox = ly.insert_layer ();
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r42 (db::RecursiveShapeIterator (ly, top_cell, l42), dss);
top_cell.shapes (lbox).insert (db::Box (2000, -1000, 6000, 4000));
db::Region box (db::RecursiveShapeIterator (ly, top_cell, lbox), dss);
db::Region r2xor3 = r2 ^ r3;
db::Region r2xorbox = r2 ^ box;
db::Region r2xor42 = r2 ^ r42;
db::Region rboxxor3 = box ^ r3;
db::Region r42xor3 = r42 ^ r3;
db::Region r42xor42 = r42 ^ r42;
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2xor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2xorbox);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2xor42);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), rboxxor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r42xor3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (15, 0)), r42xor42);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au6.gds");
}
Robustification of Region - Tests for merge - Locking the layout when writing back the data for performance improvement
2019-02-05 23:39:31 +01:00
TEST(7_Merge)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
db::Region r6_merged = r6.merged ();
db::Region r6_merged_minwc = r6.merged (false, 1);
db::Region r6_minwc = r6;
r6_minwc.merge (false, 1);
r6.merge ();
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r6_minwc);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r6_merged);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), r6_merged_minwc);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au7.gds");
}
Hierarchical area and perimeter and sizing Area and perimeter computation happens hierarchically now. Magnified instances are supported. Sizing is implemented hierarchically. For anisotropic sizing, orientation variants may be generated. For both isotropic and anisotropic magnification variants will be created.
2019-02-09 19:13:54 +01:00
TEST(8_AreaAndPerimeter)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
EXPECT_EQ (r1.area (), db::coord_traits<db::Coord>::area_type (9722000000));
EXPECT_EQ (r1.perimeter (), db::coord_traits<db::Coord>::perimeter_type (1360000));
EXPECT_EQ (r1.area (r1.bbox ()), db::coord_traits<db::Coord>::area_type (9722000000));
EXPECT_EQ (r1.perimeter (r1.bbox ()), db::coord_traits<db::Coord>::perimeter_type (1360000));
EXPECT_EQ (r1.area (db::Box (40000, -90000, 50000, -80000)), db::coord_traits<db::Coord>::area_type (100000000));
EXPECT_EQ (r1.perimeter (db::Box (40000, -90000, 50000, -80000)), db::coord_traits<db::Coord>::perimeter_type (0));
EXPECT_EQ (r1.area (db::Box (-40000, -90000, -50000, -80000)), db::coord_traits<db::Coord>::area_type (0));
}
TEST(9_SizingSimple)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
db::Region r6_sized = r6.sized (-50);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r6_sized.is_merged (), true);
Removed ambiguity for 64bit coordinate builds.
2019-03-12 00:09:52 +01:00
db::Region r6_sized_aniso = r6.sized (-20, -100, 2);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r6_sized_aniso.is_merged (), true);
db::Region r6_sized_plus = r6.sized (50);
EXPECT_EQ (r6_sized_plus.is_merged (), false);
Removed ambiguity for 64bit coordinate builds.
2019-03-12 00:09:52 +01:00
db::Region r6_sized_aniso_plus = r6.sized (20, 100, 2);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r6_sized_aniso_plus.is_merged (), false);
Hierarchical area and perimeter and sizing Area and perimeter computation happens hierarchically now. Magnified instances are supported. Sizing is implemented hierarchically. For anisotropic sizing, orientation variants may be generated. For both isotropic and anisotropic magnification variants will be created.
2019-02-09 19:13:54 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r6_sized);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r6_sized_aniso);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), r6_sized_plus);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r6_sized_aniso_plus);
Hierarchical area and perimeter and sizing Area and perimeter computation happens hierarchically now. Magnified instances are supported. Sizing is implemented hierarchically. For anisotropic sizing, orientation variants may be generated. For both isotropic and anisotropic magnification variants will be created.
2019-02-09 19:13:54 +01:00
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au9a.gds");
}
TEST(9_SizingWithScaleVariants)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_sized = r1.sized (-2000);
Robustification of Region - Tests for merge - Locking the layout when writing back the data for performance improvement
2019-02-05 23:39:31 +01:00
Hierarchical area and perimeter and sizing Area and perimeter computation happens hierarchically now. Magnified instances are supported. Sizing is implemented hierarchically. For anisotropic sizing, orientation variants may be generated. For both isotropic and anisotropic magnification variants will be created.
2019-02-09 19:13:54 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1_sized);
// copy another layer - this challenges the ability to map to multiple variants
unsigned int l1b = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1b (db::RecursiveShapeIterator (ly, top_cell, l1b), dss);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1b.merged ());
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au9b.gds");
}
TEST(9_SizingWithScaleAndXYVariants)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_sized = r1.sized (-2000);
Removed ambiguity for 64bit coordinate builds.
2019-03-12 00:09:52 +01:00
db::Region r1_sized_aniso = r1.sized (-1000, -2000, 2);
Hierarchical area and perimeter and sizing Area and perimeter computation happens hierarchically now. Magnified instances are supported. Sizing is implemented hierarchically. For anisotropic sizing, orientation variants may be generated. For both isotropic and anisotropic magnification variants will be created.
2019-02-09 19:13:54 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1_sized);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r1_sized_aniso);
// copy another layer - this challenges the ability to map to multiple variants
unsigned int l1b = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1b (db::RecursiveShapeIterator (ly, top_cell, l1b), dss);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1b.merged ());
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au9c.gds");
// merge back to original - this challenges the ability to map back the variants
ly.insert (top_cell_index, ly.get_layer (db::LayerProperties (11, 0)), r1_sized);
ly.insert (top_cell_index, ly.get_layer (db::LayerProperties (12, 0)), r1_sized_aniso);
CHECKPOINT();
db::compare_layouts (_this, ly, tl::testsrc () + "/testdata/algo/deep_region_au9d.gds");
}
Robustification of Region - Tests for merge - Locking the layout when writing back the data for performance improvement
2019-02-05 23:39:31 +01:00
Bugfix: size method needs to produce polygon refs so the output is usable as input for booleans too.
2019-02-09 22:55:34 +01:00
TEST(9_SizingWithBoolean)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_sized = r1.sized (2000);
r1_sized -= r1;
Removed ambiguity for 64bit coordinate builds.
2019-03-12 00:09:52 +01:00
db::Region r1_sized_aniso = r1.sized (1000, 2000, 2);
Bugfix: size method needs to produce polygon refs so the output is usable as input for booleans too.
2019-02-09 22:55:34 +01:00
r1_sized_aniso -= r1;
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r1_sized_aniso.is_merged (), false);
Bugfix: size method needs to produce polygon refs so the output is usable as input for booleans too.
2019-02-09 22:55:34 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1_sized);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r1_sized_aniso);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au9e.gds");
}
Some tests, smooth and round method of deep region
2019-02-09 23:51:35 +01:00
TEST(10_HullsAndHoles)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_sized = r1.sized (2000);
r1_sized -= r1;
db::Region hulls = r1_sized.hulls ();
db::Region holes = r1_sized.holes ();
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (hulls.is_merged (), true);
EXPECT_EQ (holes.is_merged (), true);
Some tests, smooth and round method of deep region
2019-02-09 23:51:35 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1_sized);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), hulls);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), holes);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au10.gds");
}
TEST(11_RoundAndSmoothed)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_sized = r1.sized (2000);
r1_sized -= r1;
db::Region rounded = r1_sized.rounded_corners (3000, 5000, 100);
db::Region smoothed = rounded.smoothed (100);
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1_sized);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), rounded);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), smoothed);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au11.gds");
}
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
TEST(12_GridSnap)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r3snapped = r3.snapped (50, 50);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r3snapped.is_merged (), false);
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r3snapped);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au12.gds");
}
TEST(13_Edges)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Edges r3edges = r3.edges ();
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (r3edges.is_merged (), true);
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
db::EdgeLengthFilter f (0, 500, true);
db::Edges r3edges_filtered = r3.edges (f);
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r3edges);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r3edges_filtered);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au13.gds");
}
TEST(14_Interacting)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
Hierarchical implementation of polygon vs. edge interact
2019-02-15 23:43:45 +01:00
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
Hierarchical implementation of polygon vs. edge interact
2019-02-15 23:43:45 +01:00
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2.selected_interacting (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2.selected_not_interacting (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2.selected_inside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), r2.selected_not_inside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r2.selected_outside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (15, 0)), r2.selected_not_outside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (16, 0)), r2.selected_overlapping (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (17, 0)), r2.selected_not_overlapping (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r6.selected_interacting (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r6.selected_not_interacting (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), r6.selected_inside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (23, 0)), r6.selected_not_inside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (24, 0)), r6.selected_outside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (25, 0)), r6.selected_not_outside (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (26, 0)), r6.selected_overlapping (r1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (27, 0)), r6.selected_not_overlapping (r1));
EXPECT_EQ (r2.selected_interacting (r1).is_merged (), true);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
Hierarchical implementation of polygon vs. edge interact
2019-02-15 23:43:45 +01:00
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au14a.gds");
}
db::Edges r1e = r1.edges ();
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1e);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r6.selected_interacting (r1e));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), r6.selected_not_interacting (r1e));
EXPECT_EQ (r6.selected_interacting (r1e).is_merged (), true);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au14b.gds");
}
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
}
TEST(15_Filtered)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::RegionAreaFilter af1 (0, 1000000000, false);
db::Region af1_filtered = r1.filtered (af1);
db::RegionAreaFilter af1inv (0, 1000000000, true);
db::Region af1_else = r1.filtered (af1inv);
Some optimization: keep merged state in deep region.
2019-02-13 17:17:03 +01:00
EXPECT_EQ (af1_filtered.is_merged (), true);
EXPECT_EQ (af1_else.is_merged (), true);
Deep regions: some more operations implemented hierarchically - snap (!) - but only for gx == gy - filtering - interact/inside/outside/overlap + not_... variants - edges
2019-02-13 01:07:32 +01:00
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), af1_filtered);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), af1_else);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au15a.gds");
}
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::RegionBBoxFilter bwf (0, 50000, false, db::RegionBBoxFilter::BoxWidth);
db::RegionBBoxFilter bhf (0, 50000, false, db::RegionBBoxFilter::BoxHeight);
db::Region r2_bwf = r2.filtered (bwf);
db::Region r2_bhf = r2.filtered (bhf);
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2_bwf);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r2_bhf);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au15b.gds");
}
}
Hierarchical implementation of self-overlap merge.
2019-02-13 22:41:12 +01:00
TEST(16_MergeWithMinWC)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r1_merged_wc0 = r1.merged (true, 0);
db::Region r1_merged_wc1 = r1.merged (true, 1);
db::Region r1_merged_wc2 = r1.merged (true, 2);
EXPECT_EQ (r1_merged_wc0.is_merged (), true);
EXPECT_EQ (r1_merged_wc1.is_merged (), true);
EXPECT_EQ (r1_merged_wc2.is_merged (), true);
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1_merged_wc0);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1_merged_wc1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r1_merged_wc2);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au16.gds");
}
}
Hierarchical implementation DRC functions (measurements)
2019-02-16 22:34:36 +01:00
TEST(17_SinglePolygonChecks)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
unsigned int l4 = ly.get_layer (db::LayerProperties (4, 0));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
db::Region r4 (db::RecursiveShapeIterator (ly, top_cell, l4), dss);
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (3, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (4, 0)), r4);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (6, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r3.width_check (260, false, db::Euclidian, 90, 0));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r3.width_check (260, true, db::Projection, 90, 2000));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r6.notch_check (1300, false, db::Euclidian, 90, 0));
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au17.gds");
}
}
Cell variant resolution by propagation, grid check now implementation hierarchically (with propagation)
2019-02-17 10:59:04 +01:00
TEST(18_MultiPolygonChecks)
Hierarchical implementation DRC functions (measurements)
2019-02-16 22:34:36 +01:00
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
unsigned int l4 = ly.get_layer (db::LayerProperties (4, 0));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
db::Region r4 (db::RecursiveShapeIterator (ly, top_cell, l4), dss);
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (3, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (4, 0)), r4);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (6, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r3.space_check (500, false, db::Projection, 90, 0));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r3.space_check (500, true, db::Projection, 90, 300));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r3.separation_check (r4, 200, false, db::Projection, 90, 0));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (30, 0)), r6.enclosing_check (r4, 100, true, db::Projection, 90, 0));
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au18.gds");
}
}
Cell variant resolution by propagation, grid check now implementation hierarchically (with propagation)
2019-02-17 10:59:04 +01:00
TEST(19_GridCheck)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r3_gc1;
r3.grid_check (25, 25).polygons (r3_gc1, 100);
db::Region r3_gc2;
r3.grid_check (40, 40).polygons (r3_gc2, 100);
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r3_gc1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), r3_gc2);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au19.gds");
}
Added tests for region processors.
2019-02-20 21:40:43 +01:00
TEST(20_AngleCheck)
Hierarchical angle check.
2019-02-17 11:42:30 +01:00
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/angle_check_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::EdgePairs ep1_ac1 = r1.angle_check (0, 91, true);
db::EdgePairs ep1_ac2 = r1.angle_check (0, 45, false);
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (2, 0)), ep1_ac1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (3, 0)), ep1_ac2);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au20.gds");
}
Added tests for region processors.
2019-02-20 21:40:43 +01:00
TEST(21_Processors)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r1.processed (db::CornersAsDots (-180.0, 180.0)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r1.processed (db::CornersAsDots (0.0, 180.0)));
db::Region ext;
r1.processed (db::CornersAsDots (0.0, 180.0)).extended (ext, 1000, 1000, 2000, 2000);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), ext);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), r1.processed (db::CornersAsRectangles (-180.0, 180.0, 2000)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r1.processed (db::CornersAsRectangles (0.0, 180.0, 2000)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r1.processed (db::Extents (0, 0)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r1.processed (db::Extents (1000, 2000)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), r1.processed (db::RelativeExtents (0, 0, 1.0, 1.0, 0, 0)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (23, 0)), r1.processed (db::RelativeExtents (0.25, 0.4, 0.75, 0.6, 1000, 2000)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (24, 0)), r1.processed (db::RelativeExtentsAsEdges (0, 0, 1.0, 1.0)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (25, 0)), r1.processed (db::RelativeExtentsAsEdges (0.5, 0.5, 0.5, 0.5)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (26, 0)), r1.processed (db::RelativeExtentsAsEdges (0.25, 0.4, 0.75, 0.6)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (30, 0)), r1.processed (db::minkowsky_sum_computation<db::Box> (db::Box (-1000, -2000, 3000, 4000))));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (31, 0)), r1.processed (db::minkowsky_sum_computation<db::Edge> (db::Edge (-1000, 0, 3000, 0))));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (40, 0)), r1.processed (db::TrapezoidDecomposition (db::TD_htrapezoids)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (41, 0)), r1.processed (db::ConvexDecomposition (db::PO_vertical)));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (42, 0)), r1.processed (db::ConvexDecomposition (db::PO_horizontal)));
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au21.gds");
}
Enabled transformations for deep regions/edges/edge pairs - important for handling layouts with different DBUs in DRC
2019-02-22 01:02:48 +01:00
TEST(22_TwoLayoutsWithDifferentDBU)
{
db::Layout ly1;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly1);
}
db::cell_index_type top_cell_index1 = *ly1.begin_top_down ();
db::Cell &top_cell1 = ly1.cell (top_cell_index1);
db::Layout ly2;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_area_peri_l1_dbu2.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly2);
}
db::cell_index_type top_cell_index2 = *ly2.begin_top_down ();
db::Cell &top_cell2 = ly2.cell (top_cell_index2);
db::DeepShapeStore dss;
unsigned int l11 = ly1.get_layer (db::LayerProperties (1, 0));
db::Region r11 (db::RecursiveShapeIterator (ly1, top_cell1, l11), dss);
unsigned int l12 = ly2.get_layer (db::LayerProperties (2, 0));
db::Region r12 (db::RecursiveShapeIterator (ly2, top_cell2, l12), dss, db::ICplxTrans (ly2.dbu () / ly1.dbu ()));
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly1.cell_name (top_cell_index1));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r11.sized (1000) ^ r12);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au22.gds");
}
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
TEST(23_Texts)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 1));
unsigned int l8 = ly.get_layer (db::LayerProperties (8, 1));
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Region r6boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6)).texts_as_boxes ("*", true, 100, dss));
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
db::Region r6dots;
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6)).texts_as_dots ("*", true, dss)).extended (r6dots, 20, 20, 20, 20);
db::Region r8boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8)).texts_as_boxes ("VDD", false, 100, dss));
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
db::Region r8dots;
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8)).texts_as_dots ("V*", true, dss)).extended (r8dots, 20, 20, 20, 20);
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Region rf6boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6)).texts_as_boxes ("*", true, 100));
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
db::Region rf6dots;
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6)).texts_as_dots ("*", true)).extended (rf6dots, 20, 20, 20, 20);
db::Region rf8boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8)).texts_as_boxes ("VDD", false, 100));
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
db::Region rf8dots;
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8)).texts_as_dots ("V*", true)).extended (rf8dots, 20, 20, 20, 20);
Region: hierarchical text object detection implementated.
2019-02-23 00:56:55 +01:00
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r6boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r6dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), rf6boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), rf6dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r8boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r8dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), rf8boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (23, 0)), rf8dots);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au23.gds");
}
}
WIP: more consistent text handling Texts are not only kept inside original layers, but also inside deep layers. This enables using texts from DRC. However, texts in deep layers are kept as markers. Mostly they are converted back to texts, but the orientation will be lost. The change eliminates the need to using Iterators in DRC instead of original layers and use of label layers in deep mode. A drawback is the presence of marker shapes in deep mode (unless polygon layers are created). Also, text output to RDB is not supported from deep layers currently.
2019-03-06 00:32:29 +01:00
TEST(24_TextsFromDeep)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_text_enlargement (1);
dss.set_text_property_name (tl::Variant ("textstring"));
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 1));
unsigned int l8 = ly.get_layer (db::LayerProperties (8, 1));
db::Region r6boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6), dss).texts_as_boxes ("*", true, 100, dss));
db::Region r6dots;
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6), dss).texts_as_dots ("*", true, dss)).extended (r6dots, 20, 20, 20, 20);
db::Region r8boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8), dss).texts_as_boxes ("VDD", false, 100, dss));
db::Region r8dots;
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8), dss).texts_as_dots ("V*", true, dss)).extended (r8dots, 20, 20, 20, 20);
db::Region rf6boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6), dss).texts_as_boxes ("*", true, 100));
db::Region rf6dots;
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l6), dss).texts_as_dots ("*", true)).extended (rf6dots, 20, 20, 20, 20);
db::Region rf8boxes (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8), dss).texts_as_boxes ("VDD", false, 100));
db::Region rf8dots;
db::Edges (db::Region (db::RecursiveShapeIterator (ly, top_cell, l8), dss).texts_as_dots ("V*", true)).extended (rf8dots, 20, 20, 20, 20);
{
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r6boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r6dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (12, 0)), rf6boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (13, 0)), rf6dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (20, 0)), r8boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (21, 0)), r8dots);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (22, 0)), rf8boxes);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (23, 0)), rf8dots);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au24.gds");
}
}
Robustification of Region - Tests for merge - Locking the layout when writing back the data for performance improvement
2019-02-05 23:39:31 +01:00
TEST(100_Integration)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/vexriscv_clocked_r.oas.gz";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
dss.set_max_vertex_count (4);
dss.set_threads (0);
unsigned int l1 = ly.get_layer (db::LayerProperties (1, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
unsigned int l4 = ly.get_layer (db::LayerProperties (4, 0));
unsigned int l5 = ly.get_layer (db::LayerProperties (5, 0));
unsigned int l6 = ly.get_layer (db::LayerProperties (6, 0));
unsigned int l7 = ly.get_layer (db::LayerProperties (7, 0));
unsigned int l10 = ly.get_layer (db::LayerProperties (10, 0));
unsigned int l11 = ly.get_layer (db::LayerProperties (11, 0));
unsigned int l14 = ly.get_layer (db::LayerProperties (14, 0));
unsigned int l16 = ly.get_layer (db::LayerProperties (16, 0));
unsigned int l18 = ly.get_layer (db::LayerProperties (18, 0));
db::Region r1 (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r4 (db::RecursiveShapeIterator (ly, top_cell, l4), dss);
db::Region r5 (db::RecursiveShapeIterator (ly, top_cell, l5), dss);
db::Region r6 (db::RecursiveShapeIterator (ly, top_cell, l6), dss);
db::Region r7 (db::RecursiveShapeIterator (ly, top_cell, l7), dss);
db::Region r10 (db::RecursiveShapeIterator (ly, top_cell, l10), dss);
db::Region r11 (db::RecursiveShapeIterator (ly, top_cell, l11), dss);
db::Region r14 (db::RecursiveShapeIterator (ly, top_cell, l14), dss);
db::Region r16 (db::RecursiveShapeIterator (ly, top_cell, l16), dss);
db::Region r18 (db::RecursiveShapeIterator (ly, top_cell, l18), dss);
db::Region psd = r4 - r7;
db::Region nsd = r3 - r7;
db::Region pgate = r4 & r7;
db::Region ngate = r3 & r7;
db::Region poly_cont = r10 & r7;
db::Region diff_cont = r10 - r7;
r1.merge ();
r3.merge ();
r4.merge ();
r5.merge ();
r6.merge ();
r7.merge ();
r10.merge ();
r11.merge ();
r14.merge ();
r16.merge ();
r18.merge ();
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (1, 0)), r1);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (3, 0)), r3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (4, 0)), r4);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (5, 0)), r5);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (6, 0)), r6);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (7, 0)), r7);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r10);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r11);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (14, 0)), r14);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (16, 0)), r16);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (18, 0)), r18);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (100, 0)), psd);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (101, 0)), nsd);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (102, 0)), pgate);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (103, 0)), ngate);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (104, 0)), poly_cont);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (105, 0)), diff_cont);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au100.gds");
}
Test for deep/flat collaboration
2019-02-10 08:28:48 +01:00
TEST(101_DeepFlatCollaboration)
{
db::Layout ly;
{
std::string fn (tl::testsrc ());
fn += "/testdata/algo/deep_region_l1.gds";
tl::InputStream stream (fn);
db::Reader reader (stream);
reader.read (ly);
}
db::cell_index_type top_cell_index = *ly.begin_top_down ();
db::Cell &top_cell = ly.cell (top_cell_index);
db::DeepShapeStore dss;
unsigned int l2 = ly.get_layer (db::LayerProperties (2, 0));
unsigned int l3 = ly.get_layer (db::LayerProperties (3, 0));
db::Region r2 (db::RecursiveShapeIterator (ly, top_cell, l2), dss);
db::Region r2_flat (db::RecursiveShapeIterator (ly, top_cell, l2));
db::Region r3 (db::RecursiveShapeIterator (ly, top_cell, l3), dss);
db::Region r3_flat (db::RecursiveShapeIterator (ly, top_cell, l3));
db::Region r2fminus3 = r2_flat - r3;
db::Region r2minus3f = r2 - r3_flat;
db::Layout target;
unsigned int target_top_cell_index = target.add_cell (ly.cell_name (top_cell_index));
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (10, 0)), r2fminus3);
target.insert (target_top_cell_index, target.get_layer (db::LayerProperties (11, 0)), r2minus3f);
CHECKPOINT();
db::compare_layouts (_this, target, tl::testsrc () + "/testdata/algo/deep_region_au101.gds");
}
Fixed #277 (min_coherence not recognized by region size)
2019-06-17 21:40:37 +02:00
TEST(issue_277)
{
db::Layout ly;
db::cell_index_type top_cell_index = ly.add_cell ("TOP");
db::Cell &top_cell = ly.cell (top_cell_index);
unsigned int l1 = ly.insert_layer ();
db::Shapes &s = top_cell.shapes (l1);
s.insert (db::Box (0, 0, 400, 400));
s.insert (db::Box (400, 400, 800, 800));
db::DeepShapeStore dss;
db::Region r (db::RecursiveShapeIterator (ly, top_cell, l1), dss);
EXPECT_EQ (r.sized (1).merged (false, 1).to_string (), "");
r.set_min_coherence (true);
EXPECT_EQ (r.sized (1).merged (false, 1).to_string (), "(399,399;399,401;401,401;401,399)");
r.merge ();
EXPECT_EQ (r.sized (1).merged (false, 1).to_string (), "(399,399;399,401;401,401;401,399)");
r.set_min_coherence (false); // needs to merge again
EXPECT_EQ (r.sized (1).merged (false, 1).to_string (), "");
}