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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
#![allow(unused_variables)]
use fnv::FnvHashMap;
use num_traits::{PrimInt, Signed};
use rstar::{RTree, RTreeObject};
use crate::decorator::hierarchy::*;
use crate::decorator::l2n::*;
use crate::decorator::layout::*;
use crate::decorator::netlist::*;
use crate::decorator::{Decorator, MutDecorator};
use crate::prelude::*;
pub struct RegionSearchAdapter<'a, T>
where
T: LayoutBase,
T::Coord: PrimInt + Signed + std::fmt::Debug,
{
chip: &'a mut T,
shape_rtrees:
FnvHashMap<T::CellId, FnvHashMap<T::LayerId, RTree<ShapeEntry<T::ShapeId, T::Coord>>>>,
instance_rtree: FnvHashMap<T::CellId, RTree<CellInstanceEntry<T>>>,
cell_bounding_boxes: FnvHashMap<T::CellId, Rect<T::Coord>>,
}
#[derive(Debug, Clone, PartialEq)]
pub struct ShapeEntry<ShapeId, Coord> {
bounding_box: Rect<Coord>,
shape_id: ShapeId,
}
#[derive(Debug, Clone, PartialEq)]
pub struct CellInstanceEntry<L: LayoutBase> {
bounding_box: Rect<L::Coord>,
cell_inst_id: L::CellInstId,
}
impl<ShapeId, Coord> BoundingBox<Coord> for ShapeEntry<ShapeId, Coord>
where
Coord: PrimInt,
{
fn bounding_box(&self) -> Rect<Coord> {
self.bounding_box
}
}
impl<ShapeId, Coord> RTreeObject for ShapeEntry<ShapeId, Coord>
where
Coord: PrimInt + Signed + std::fmt::Debug,
{
type Envelope = rstar::AABB<[Coord; 2]>;
fn envelope(&self) -> Self::Envelope {
let bbox = self.bounding_box();
rstar::AABB::from_corners(bbox.lower_left().into(), bbox.upper_right().into())
}
}
impl<L> BoundingBox<L::Coord> for CellInstanceEntry<L>
where
L: LayoutBase,
L::Coord: PrimInt,
{
fn bounding_box(&self) -> Rect<L::Coord> {
self.bounding_box
}
}
impl<L> RTreeObject for CellInstanceEntry<L>
where
L: LayoutBase,
L::Coord: PrimInt + Signed + std::fmt::Debug,
{
type Envelope = rstar::AABB<[L::Coord; 2]>;
fn envelope(&self) -> Self::Envelope {
let bbox = self.bounding_box();
rstar::AABB::from_corners(bbox.lower_left().into(), bbox.upper_right().into())
}
}
impl<'a, T> RegionSearchAdapter<'a, T>
where
T: LayoutBase,
T::Coord: PrimInt + Signed + std::fmt::Debug,
{
pub fn new(chip: &'a mut T) -> Self {
let mut region_search = Self {
chip,
shape_rtrees: Default::default(),
instance_rtree: Default::default(),
cell_bounding_boxes: Default::default(),
};
region_search.create_shape_trees();
region_search.create_cell_instance_trees();
region_search
}
fn create_shape_trees(&mut self) {
let mut cell_rtrees: FnvHashMap<_, _> = Default::default();
for cell in self.chip.each_cell_bottom_to_top() {
let mut rtrees: FnvHashMap<_, RTree<_>> = Default::default();
for layer in self.chip.each_layer() {
let mut all_shapes = vec![];
self.chip
.for_each_shape(&cell, &layer, |shape_id, geometry| {
if let Some(bounding_box) = geometry.try_bounding_box() {
let rtree_entry = ShapeEntry {
bounding_box,
shape_id: shape_id.clone(),
};
all_shapes.push(rtree_entry)
}
});
let rtree = RTree::bulk_load(all_shapes);
rtrees.insert(layer, rtree);
}
cell_rtrees.insert(cell, rtrees);
}
self.shape_rtrees = cell_rtrees;
}
fn create_cell_instance_trees(&mut self) {
for cell in self.chip.each_cell_bottom_to_top() {
let shape_bbox = self.compute_shape_bbox(&cell);
let instance_entries: Vec<_> = self
.chip
.each_cell_instance(&cell)
.filter_map(|inst| {
self.cell_bounding_boxes
.get(&self.chip.template_cell(&inst))
.map(|bbox| (inst, bbox))
})
.map(|(inst, bbox)| {
let tf = self.chip.get_transform(&inst);
let bbox_transformed = bbox.transform(|p| tf.transform_point(p));
CellInstanceEntry {
bounding_box: bbox_transformed,
cell_inst_id: inst,
}
})
.collect();
let rtree = RTree::bulk_load(instance_entries);
let cell_inst_bbox = if rtree.size() > 0 {
let envelope = rtree.root().envelope();
let bbox = Rect::new(envelope.lower(), envelope.upper());
Some(bbox)
} else {
None
};
let bbox = cell_inst_bbox
.into_iter()
.chain(shape_bbox)
.reduce(|acc, b| acc.add_rect(&b));
if let Some(bbox) = bbox {
self.cell_bounding_boxes.insert(cell.clone(), bbox);
}
self.instance_rtree.insert(cell, rtree);
}
}
fn compute_shape_bbox(&self, cell_id: &T::CellId) -> Option<Rect<T::Coord>> {
self.shape_rtrees
.get(cell_id)
.into_iter()
.flat_map(|layer_trees| layer_trees.values())
.map(|rtree| rtree.root().envelope())
.map(|envelope| Rect::new(envelope.lower(), envelope.upper()))
.reduce(|acc, b| acc.add_rect(&b))
}
#[allow(unused)]
fn compute_subcell_bboxes(&self, cell_id: &T::CellId) -> Option<Rect<T::Coord>> {
if let Some(instance_rtree) = self.instance_rtree.get(cell_id) {
if instance_rtree.size() > 0 {
let envelope = instance_rtree.root().envelope();
Some(Rect::new(envelope.lower(), envelope.upper()))
} else {
None
}
} else {
None
}
}
}
impl<'a, T> Decorator for RegionSearchAdapter<'a, T>
where
T: LayoutBase,
T::Coord: PrimInt + Signed + std::fmt::Debug,
{
type D = T;
fn base(&self) -> &Self::D {
&self.chip
}
}
impl<'a, T> MutDecorator for RegionSearchAdapter<'a, T>
where
T: LayoutBase,
T::Coord: PrimInt + Signed + std::fmt::Debug,
{
fn mut_base(&mut self) -> &mut Self::D {
&mut self.chip
}
}
impl<'a, H> HierarchyBaseDecorator for RegionSearchAdapter<'a, H>
where
H: LayoutBase + 'static,
H::Coord: PrimInt + Signed + std::fmt::Debug,
{
type NameType = H::NameType;
type CellId = H::CellId;
type CellInstId = H::CellInstId;
}
impl<'a, L> LayoutBaseDecorator for RegionSearchAdapter<'a, L>
where
L: LayoutBase + 'static,
L::Coord: PrimInt + Signed + std::fmt::Debug,
{
}
impl<'a, L> RegionSearch for RegionSearchAdapter<'a, L>
where
L: LayoutBase + 'static,
L::Coord: PrimInt + Signed + std::fmt::Debug,
{
fn each_shape_in_region_per_layer(
&self,
cell: &Self::CellId,
layer_id: &Self::LayerId,
search_region: &Rect<Self::Coord>,
) -> Box<dyn Iterator<Item = Self::ShapeId> + '_> {
let aabb = rect2aabb(search_region);
let intersecting_instances = self
.shape_rtrees
.get(cell)
.expect("cell not found")
.get(layer_id)
.into_iter()
.flat_map(move |rtree| rtree.locate_in_envelope_intersecting(&aabb))
.map(|shape_entry| shape_entry.shape_id.clone());
Box::new(intersecting_instances)
}
fn each_cell_instance_in_region(
&self,
cell: &Self::CellId,
search_region: &Rect<Self::Coord>,
) -> Box<dyn Iterator<Item = Self::CellInstId> + '_> {
let intersecting_instances = self
.instance_rtree
.get(cell)
.expect("cell not found")
.locate_in_envelope_intersecting(&rect2aabb(search_region))
.map(|instance_entry| instance_entry.cell_inst_id.clone());
Box::new(intersecting_instances)
}
}
fn rect2aabb<Crd>(r: &Rect<Crd>) -> rstar::AABB<[Crd; 2]>
where
Crd: PrimInt + Signed + std::fmt::Debug,
{
rstar::AABB::from_corners(r.lower_left().into(), r.upper_right().into())
}
impl<'a, N> NetlistBaseDecorator for RegionSearchAdapter<'a, N>
where
N: LayoutBase + NetlistBase + 'static,
N::Coord: PrimInt + Signed + std::fmt::Debug,
{
}
impl<'a, LN> L2NBaseDecorator for RegionSearchAdapter<'a, LN>
where
LN: L2NBase + 'static,
LN::Coord: PrimInt + Signed + std::fmt::Debug,
{
}
impl<'a, H> HierarchyEditDecorator for RegionSearchAdapter<'a, H>
where
H: HierarchyEdit + LayoutBase + 'static,
H::Coord: PrimInt + Signed + std::fmt::Debug,
{
fn d_new() -> Self {
unimplemented!()
}
fn d_create_cell(&mut self, name: H::NameType) -> H::CellId {
todo!()
}
fn d_remove_cell(&mut self, cell_id: &H::CellId) {
todo!()
}
fn d_create_cell_instance(
&mut self,
parent_cell: &H::CellId,
template_cell: &H::CellId,
name: Option<H::NameType>,
) -> H::CellInstId {
todo!()
}
fn d_remove_cell_instance(&mut self, inst: &H::CellInstId) {
todo!()
}
}
impl<'a, L> LayoutEditDecorator for RegionSearchAdapter<'a, L>
where
L: LayoutEdit + 'static,
L::Coord: PrimInt + Signed + std::fmt::Debug,
{
fn d_insert_shape(
&mut self,
parent_cell: &L::CellId,
layer: &L::LayerId,
geometry: Geometry<L::Coord>,
) -> L::ShapeId {
todo!("update RTree");
}
fn d_remove_shape(&mut self, shape_id: &L::ShapeId) -> Option<Geometry<L::Coord>> {
let _geo = self.chip.remove_shape(shape_id);
todo!("update RTree")
}
fn d_replace_shape(
&mut self,
shape_id: &L::ShapeId,
geometry: Geometry<L::Coord>,
) -> Geometry<L::Coord> {
let _geo = self.chip.replace_shape(shape_id, geometry);
todo!("update RTree")
}
fn d_set_transform(&mut self, cell_inst: &L::CellInstId, tf: SimpleTransform<L::Coord>) {
self.chip.set_transform(cell_inst, tf);
todo!("update RTree")
}
}
impl<'a, N: NetlistEdit + 'static> NetlistEditDecorator for RegionSearchAdapter<'a, N>
where
N: LayoutBase + NetlistEdit + 'static,
N::Coord: PrimInt + Signed + std::fmt::Debug,
{
}
impl<'a, LN> L2NEditDecorator for RegionSearchAdapter<'a, LN>
where
LN: L2NEdit + 'static,
LN::Coord: PrimInt + Signed + std::fmt::Debug,
{
}
#[test]
fn test_create_region_search() {
let mut chip = Chip::new();
let top = chip.create_cell("TOP".to_string().into());
let layer1 = chip.create_layer(1, 0);
chip.insert_shape(&top, &layer1, Rect::new((0, 0), (10, 10)).into());
let region_search = RegionSearchAdapter::new(&mut chip);
assert_eq!(
region_search.cell_bounding_boxes[&top],
Rect::new((0, 0), (10, 10))
);
}