-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathbst_sub1.cxx
executable file
·4611 lines (4016 loc) · 148 KB
/
bst_sub1.cxx
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
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
///////////////////////////////////////////////////////////////////////////////
// BSD 3-Clause License
//
// Copyright (c) 2018, The Regents of the University of California
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// * Neither the name of the copyright holder nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
///////////////////////////////////////////////////////////////////////////////
/*
#**************************************************************************
#** Please read README to see how to run this program
*** Created by Chung-Wen Albert Tsao on May 2, 2000*
#**
#**
#**************************************************************************
*/
#include <fstream.h>
#include <iostream.h>
#include <cmath>
#include <vector>
#include <strings.h>
#include "bst_header.h"
#include "Global_var.h"
#include "bst.h"
#include "bst_sub1.h"
#include "bst_sub3.h"
#include "facility.h"
extern double path_finder(PointType p1, PointType p2, PointType path[], int *n);
extern double calc_pathlength(PointType path[], int n, int mode);
extern void print_obstacles_sub(FILE *f);
void print_node_info(NodeType *node);
void print_node(NodeType *node);
double area_minskew(AreaType *area);
void print_node_informatio(NodeType *node,NodeType *node_L, NodeType *node_R);
void check_trr(TrrType *t);
int area_Manhattan_arc_JS(AreaType *area);
double calc_edge_delay(int v, int par, int mode);
/********************************************************************/
// split string into tokens
/********************************************************************/
static void
tSplit ( char *buf, vector< char * > tokv, const char *sep = 0 )
{
if( sep == 0 ) {
sep = "\t ";
}
tokv.clear();
char *temp ;
char *s = buf ;
while( ( temp = strtok( s, sep )) != 0 ) {
tokv.push_back ( temp ) ;
// cerr << temp << " " ;
s = 0 ;
}
// cerr << endl ;
}
/********************************************************************/
/* */
/********************************************************************/
int calc_n_buffer_level() {
int i, n;
i = 0;
n = 0;
while (N_Clusters[i] > 1) {
i++;
n++;
}
return(n);
}
/********************************************************************/
/* */
/********************************************************************/
int level(int v) {
int n=0;
assert(Buffered[v] > 0 );
NodeType *from = gBoundedSkewTree->TreeNode (v ) ;
NodeType *to1 = gBoundedSkewTree->SuperRootNode () ;
NodeType *to2 = gBoundedSkewTree->RootNode () ;
while (from != to1 && from != to2 ) {
if (Buffered[v] > 0 ) n++;
v = Node[v].parent;
}
return(n);
}
/******************************************************************/
/* */
/******************************************************************/
int calc_line_type(PointType pt1,PointType pt2) {
double a,b;
a = ABS(pt1.x-pt2.x);
b = ABS(pt1.y-pt2.y);
if (equal(a,b)) {
return(MANHATTAN_ARC);
} else if (equal(a,0)) {
return(VERTICAL);
} else if (equal(b,0)) {
return(HORIZONTAL);
} else if (a > b) {
return(FLAT);
} else if (a < b) {
return(TILT);
}
assert ( 0 ) ;
return ( MANHATTAN_ARC ) ;
}
/*****************************************************************/
/* */
/******************************************************************/
double calc_buffered_node_delay(int v) {
AreaType *area;
double t;
area = &(Node[v].area[Node[v].ca]);
PointType &pt = Node[v].m_stnPt ;
t = pt .max + area->unbuf_capac*area->R_buffer + Delay_buffer;
return(t);
}
/********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/********************************************************************/
int JR_corner_exist(int i) {
double x0,x1,y0,y1;
x0 = JS[0][i].x;
y0 = JS[0][i].y;
x1 = JS[1][i].x;
y1 = JS[1][i].y;
if (equal(x0,x1) || equal(y0,y1)) {
return(NO);
} else {
return(YES);
}
}
/********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/********************************************************************/
int empty_trr(TrrType *t) {
double a,b;
a=t->xlow;
b=t->xhi;
if (equal(a,b) ){
t->xlow = t->xhi = (a+b)/2;
}
a=t->ylow;
b=t->yhi;
if (equal(a,b) ){
t->ylow = t->yhi = (a+b)/2;
}
if (t->xlow > t->xhi || t->ylow > t->yhi) {
return(YES);
} else {
return(NO);
}
}
/********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/********************************************************************/
void check_trr(TrrType *t) {
empty_trr(t);
assert(t->xlow <= t->xhi);
assert(t->ylow <= t->yhi);
}
/***********************************************************************/
/* */
/***********************************************************************/
void check_Point_delay(PointType *pt) {
assert(pt->min > -FUZZ);
assert(pt->max > pt->min - FUZZ);
if (pt->min < 0) {
pt->min = 0;
}
if (pt->max < pt->min) {
pt->max = pt->min;
}
}
/***********************************************************************/
/* */
/***********************************************************************/
static
void check_Point_skew(PointType *pt) {
assert(pt->max - pt->min < Skew_B + FUZZ);
pt->max = tMIN(pt->max, pt->min + Skew_B);
}
/***********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/***********************************************************************/
void check_Point(PointType *pt) {
check_Point_delay(pt);
check_Point_skew(pt);
}
/************************************************************************/
/* Copyright (C) 1994/2000 by Andrew Kahng, Chung-Wen Albert Tsao */
/************************************************************************/
int equal(double x,double y) {
if (ABS(x-y) <= FUZZ) {
return(YES);
}
return(NO);
}
/************************************************************************/
/* Copyright (C) 1994/2000 by Andrew Kahng, Chung-Wen Albert Tsao */
/************************************************************************/
int equivalent(double x,double y, double fuzz) {
if (ABS(x-y) <= fuzz) {
return(YES);
}
return(NO);
}
/********************************************************************/
/* merge_cost = dist + detour wirien = |e_a| + |e_b| */
/********************************************************************/
double area_merge_cost(AreaType *area) {
double t;
t = area->L_EdgeLen + area->R_EdgeLen;
if (t >= 0 ) {
assert( equal(t, area->dist) || t >= area->dist);
return(t);
} else {
return(area->dist);
}
}
/********************************************************************/
/* merge_cost = dist + detour wirien = |e_a| + |e_b| */
/********************************************************************/
double merge_cost(NodeType *node) {
return(area_merge_cost(&(node->area[node->ca])));
}
/***********************************************************************/
/* */
/***********************************************************************/
static
void print_area_sub(FILE *f, AreaType *area) {
int n = area->n_mr;
assert( n <= MAX_mr_PTS);
if (n==0) {
fprintf(f, "move 0 0 Empty Region \n");
} else {
PointType pt = area->mr[0];
fprintf(f, "move %.8f %.8f (JS_type=%d)(n_mr=%d)(cap=%.1f)\n",
pt.x, pt.y, areaJS_line_type(area), n, area->capac);
for (int i=1; i<=n; i++) {
pt = area->mr[i%n];
fprintf(f, " %.8f %.8f skew:%.2f, max:%.2f, min:%.2f\n",
pt.x, pt.y, pt.max-pt.min,pt.max,pt.min);
}
}
fflush(f);
}
/***********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/***********************************************************************/
void print_area(AreaType *area) {
print_area_sub(stdout,area);
}
/***********************************************************************/
/* */
/***********************************************************************/
static
void print_node_sub(FILE *f, NodeType *node) {
fprintf(f, "\"node[%d]%d:%d\n", node->id, node->ca, node->n_area);
fprintf(f, "\"mr\n");
for (int i=0;i<node->n_area;++i) {
print_area_sub(f, &(node->area[i]));
}
}
/***********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/***********************************************************************/
void print_node(NodeType *node) {
print_node_sub(stdout,node);
}
/***********************************************************************/
/* */
/***********************************************************************/
void set_K() {
bool linear = gBoundedSkewTree->LinearDelayModel () ;
if ( linear ) {
PURES[V_] = PURES[H_] = 0;
PUCAP[V_] = PUCAP[H_] = 0;
K[H_] = K[V_] = 0;
} else {
PUCAP[H_] *= PUCAP_SCALE;
PURES[V_] = PURES[H_]*PURES_V_SCALE ;
PUCAP[V_] = PUCAP[H_]*PUCAP_V_SCALE ;
K[H_] = 0.5*PURES[H_]*PUCAP[H_];
K[V_] = 0.5*PURES[V_]*PUCAP[V_];
}
}
/****************************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/****************************************************************************/
void alloca_NodeType_with_n_areas(NodeType *node, int n) {
node->ca = 0;
node->n_area = 1;
assert(n <= N_Area_Per_Node);
/* Nate: purify */
assert(node->area == 0);
node->area = new AreaType[n];
memset(node->area,0,n*sizeof(AreaType));
assert(node->area !=NULL );
assert(node->ms == 0);
node->ms = new TrrType;
assert(node->ms !=NULL );
}
/****************************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/****************************************************************************/
void alloca_NodeType(NodeType *node) {
alloca_NodeType_with_n_areas(node, N_Area_Per_Node);
}
/****************************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/****************************************************************************/
void free_NodeType(NodeType *node) {
free(node->area);
free(node->ms);
}
/************************************************************************/
/* Copyright (C) 1994/2000 by Andrew Kahng, Chung-Wen Albert Tsao */
/************************************************************************/
void assign_NodeType(NodeType *node1, NodeType *node2) {
int i, n;
node1->ca = node2->ca;
n = node1->n_area = node2->n_area;
assert(node2->ca <= n);
assert(n <= N_Area_Per_Node);
for (i=0;i<n; ++i) {
node1->area[i] = node2->area[i];
}
if (node1->ms!= NULL && node2->ms != NULL) {
*(node1->ms) = *(node2->ms);
}
node1->parent = node2->parent;
node1->L = node2->L;
node1->R = node2->R;
node1->id = node2->id;
node1->root_id = node2->root_id;
node1->pattern = node2->pattern;
node1->buffered = node2->buffered;
}
/****************************************************************************/
/* tell if Node[v] uses detour wirelength. */
/****************************************************************************/
int detour_Node(int v) {
int ans, i;
i = Node[v].ca;
if (Node[v].area[i].L_EdgeLen + Node[v].area[i].R_EdgeLen >
Node[v].area[i].dist) {
ans = YES;
} else {
ans = NO;
}
return(NO);
}
/*******************************************************************/
/* Return the skew of a given point */
/*******************************************************************/
double pt_skew(PointType pt) {
return(pt.max-pt.min);
}
/********************************************************************/
/* find the mid-point of the core of trr */
/********************************************************************/
void core_mid_point(TrrType *trr, PointType *p) {
double tx,ty;
tx = (trr->xlow + trr->xhi) / 2;
ty = (trr->ylow + trr->yhi) / 2;
p->x = (tx+ty)/2;
p->y = (ty-tx)/2;
} /* core_mid_point */
/********************************************************************/
/* */
/********************************************************************/
void make_intersect_sub( TrrType *trr1, TrrType *trr2, TrrType *t ) {
t->xlow = tMAX(trr1->xlow,trr2->xlow);
t->xhi = tMIN(trr1->xhi, trr2->xhi );
t->ylow = tMAX(trr1->ylow,trr2->ylow);
t->yhi = tMIN(trr1->yhi, trr2->yhi );
}
/********************************************************************/
/* */
/********************************************************************/
void make_intersect( TrrType *trr1, TrrType *trr2, TrrType *t ) {
make_intersect_sub(trr1, trr2, t);
/* check if intersection is non-empty */
check_trr(t);
} /* make_intersect */
/********************************************************************/
/* find the radius of a TRR */
/********************************************************************/
double radius(TrrType *trr) {
double t1,t2;
t1 = (trr->xhi - trr->xlow) / 2;
t2 = (trr->yhi - trr->ylow) / 2;
return( min(t1,t2) );
}
/********************************************************************/
/* return the core of trr in core */
/********************************************************************/
void make_core(TrrType *trr,TrrType *core) {
double r;
r = radius(trr);
core->xlow = trr->xlow + r;
core->xhi = trr->xhi - r;
core->ylow = trr->ylow + r;
core->yhi = trr->yhi - r;
} /* make_core */
/********************************************************************/
/* return the core of trr in core */
/********************************************************************/
void make_1D_TRR(TrrType *trr,TrrType *core) {
if (trr->xhi - trr->xlow >= trr->yhi - trr->ylow) {
core->xlow = trr->xlow ;
core->xhi = trr->xhi ;
core->ylow = core->yhi = (trr->yhi + trr->ylow)/2.0 ;
} else {
core->ylow = trr->ylow ;
core->yhi = trr->yhi ;
core->xlow = core->xhi = (trr->xhi + trr->xlow)/2.0 ;
}
}
/********************************************************************/
/* */
/********************************************************************/
int a_segment_TRR(TrrType *trr) {
/* check if *trr is a valid merging segment */
if (equal(trr->xlow,trr->xhi) || equal(trr->ylow,trr->yhi)) {
return(YES);
} else {
return(NO);
}
}
/********************************************************************/
/* check if *ms is a valid merging segment */
/********************************************************************/
void check_ms(TrrType *ms) {
/* *ms must be a valid trr */
check_trr(ms);
/* check if *ms is a valid merging segment */
assert(a_segment_TRR(ms));
/* remove the epsilon error */
if (equal(ms->xlow,ms->xhi)) {
ms->xlow = ms->xhi = (ms->xlow+ms->xhi)/2.0;
}
if (equal(ms->ylow,ms->yhi)) {
ms->ylow = ms->yhi = (ms->ylow+ms->yhi)/2.0;
}
}
/********************************************************************/
/* */
/********************************************************************/
int ms_type(TrrType *trr) {
double a,b;
check_trr(trr);
a = trr->xhi - trr->xlow;
b = trr->yhi - trr->ylow;
assert(equal(a,0) || equal(b,0) ); /* must be a segment */
if (equal(a,0) && equal(b,0) ) { /* a point TRR */
return(0);
} else if (equal(a,0)) { /* segment with slope +1 */
return(1);
} else if (equal(b,0)) { /* segment with slope -1 */
return(-1);
}
assert(0);
return(0);
}
/********************************************************************/
/* */
/********************************************************************/
void build_trr(TrrType *ms,double d,TrrType *trr) {
trr->xlow = ms->xlow - d;
trr->xhi = ms->xhi + d;
trr->ylow = ms->ylow - d;
trr->yhi = ms->yhi + d;
} /* build_trr */
/****************************************************************************/
/* */
/****************************************************************************/
int Manhattan_arc(PointType p1,PointType p2) {
double a,b;
char ans;
a = ABS(p2.y-p1.y);
b = ABS(p2.x-p1.x);
ans = equal(a, b)? YES:NO;
return( ans );
}
/****************************************************************************/
/* */
/****************************************************************************/
int Manhattan_arc_area(AreaType *area) {
int n;
n= area->n_mr;
if (n==1) return(YES);
if (n==2 && Manhattan_arc(area->mr[0],area->mr[1])) return(YES);
return(NO);
}
/****************************************************************************/
/* */
/****************************************************************************/
int Manhattan_arc_node(NodeType *node) {
return(Manhattan_arc_area(&(node->area[node->ca])));
}
/****************************************************************************/
/* */
/****************************************************************************/
int merging_segment_area(AreaType *area) {
if (Manhattan_arc_area(area) && equal(pt_skew(area->mr[0]), Skew_B)) {
return(YES);
} else {
return(NO);
}
}
/********************************************************************/
/* */
/********************************************************************/
int TRR_area(AreaType *area) {
int i, j, n, count = 0;
double t0,t1;
if (Manhattan_arc_area(area)) return(YES);
n = area->n_mr;
if ( n != 4) return(NO);
for (i=0;i<n;++i) {
j = (i+1)%n;
if (Manhattan_arc(area->mr[i], area->mr[j])==YES) count++;
t0 = ABS(area->mr[i].max - area->mr[j].max);
t1 = ABS(area->mr[i].min - area->mr[j].min);
if (t0 > 1E-10 || t1 > 1E-10 ) return(NO);
}
if (count!=2) return(NO);
return(YES);
}
/****************************************************************************/
/* */
/****************************************************************************/
int Manhattan_Arc_Node(int v) {
return(Manhattan_arc_node(&(Node[v])));
}
/****************************************************************************/
/* */
/****************************************************************************/
int case_Manhattan_arc() {
int ans;
ans = NO;
if (Skew_B==0) {
ans = YES;
} else if (equal(pt_skew(JS[0][0]), Skew_B)) {
if (equal(pt_skew(JS[1][0]), Skew_B) ) {
if (Manhattan_arc(JS[0][0], JS[0][1]) ) {
assert(Manhattan_arc(JS[1][0], JS[1][1]) );
ans = YES;
}
}
}
return(ans);
}
/***********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/***********************************************************************/
void print_Point(FILE *f, const PointType& pt) {
fprintf(f,"move %.9f %.9f skew = %.9f\n", pt.x,pt.y, pt.max-pt.min);
fprintf(f," %.9f %.9f max=%.9f, min=%.9f\n",pt.x,pt.y,pt.max,pt.min);
}
/***********************************************************************/
/* */
/***********************************************************************/
int count_trees() {
int count = 0;
unsigned npoints = gBoundedSkewTree->Npoints() ;
for (unsigned i=0;i < npoints ;++i) {
if (Node[i].parent <0 && !Marked[i] )
count++;
}
return count ;
}
/****************************************************************************/
/* the merging area of node1 = node2->area[n]. */
/****************************************************************************/
void get_an_area(NodeType *node, int i) {
node->ca = i;
assert(i < node->n_area);
assert(node->n_area <= N_Area_Per_Node);
assert(node->area[i].npts >0);
assert(node->area[i].n_mr >0);
/*
JS[0][0] = node->area[i].line[0][0] ;
JS[0][1] = node->area[i].line[0][1] ;
JS[1][0] = node->area[i].line[1][0];
JS[1][1] = node->area[i].line[1][1] ;
*/
}
/****************************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/****************************************************************************/
void get_area_for_Node(int v, int i) {
get_an_area(&(Node[v]), i);
}
/*************************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/*************************************************************************/
void get_all_areas(int v, int i) {
int j;
unsigned nterms = gBoundedSkewTree->Nterms() ;
if ((unsigned) v< nterms ) return;
get_area_for_Node(v, i);
j = Node[v].ca;
get_all_areas(Node[v].L, Node[v].area[j].L_area);
get_all_areas(Node[v].R, Node[v].area[j].R_area);
}
/****************************************************************************/
/* store merging area of node1 to node2->area[n] */
/****************************************************************************/
void store_an_area(NodeType *node1, NodeType *node2, int n) {
int i, k;
k = node1->ca;
assert(k < node1->n_area);
assert(n < N_Area_Per_Node);
node2->area[n].n_mr = node1->area[k].n_mr;
node2->area[n].npts = node1->area[k].npts;
node2->area[n].L_area = node1->area[k].L_area ;
node2->area[n].R_area = node1->area[k].R_area ;
node2->area[n].L_EdgeLen = node1->area[k].L_EdgeLen;
node2->area[n].R_EdgeLen = node1->area[k].R_EdgeLen;
node2->area[n].subtree_cost = node1->area[k].subtree_cost;
node2->area[n].dist = node1->area[k].dist;
node2->area[n].capac = node1->area[k].capac;
for (i=0;i<node1->area[k].npts;++i) {
node2->area[n].vertex[i] = node1->area[k].vertex[i];
}
for (i=0;i<node1->area[k].n_mr;++i) {
node2->area[n].mr[i] = node1->area[k].mr[i];
}
node2->area[n].line[0][0] = node1->area[k].line[0][0];
node2->area[n].line[0][1] = node1->area[k].line[0][1];
node2->area[n].line[1][0] = node1->area[k].line[1][0];
node2->area[n].line[1][1] = node1->area[k].line[1][1];
}
/****************************************************************************/
/* store area_array tmpnode[n] to node */
/****************************************************************************/
void store_n_areas(AreaType tmparea[], int n, NodeType *node) {
int i;
node->n_area = n;
for (i=0;i<n;++i) {
node->area[i] = tmparea[i];
}
}
/******************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/******************************************************************/
void store_n_areas_IME(NodeType *node,AreaSetType *result) {
int i;
node->n_area = result->npoly;
for (i=0;i<result->npoly;++i) {
node->area[i] = result->freg[i];
}
}
/******************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/******************************************************************/
void store_last_n_areas_IME(NodeType *node,AreaSetType *stair) {
int i, n;
node->n_area = n = min (stair->npoly, N_Area_Per_Node);
for (i=0;i<n;++i) {
node->area[i] = stair->freg[stair->npoly-1-i];
}
}
/*****************************************************************************/
/* */
/*****************************************************************************/
void build_NodeTRR_sub1(NodeType *node) {
int i, j;
double x,y;
node->ms->MakeDiamond (node->area[node->ca].mr[0], 0 );
for (i=1;i<node->area[node->ca].npts;++i) {
j = node->area[node->ca].vertex[i];
x = node->area[node->ca].mr[j].x;
y = node->area[node->ca].mr[j].y;
node->ms->xlow = tMIN(node->ms->xlow, x-y);
node->ms->xhi = tMAX(node->ms->xhi , x-y);
node->ms->ylow = tMIN(node->ms->ylow, x+y);
node->ms->yhi = tMAX(node->ms->yhi , x+y);
}
}
/*************************************************************************** */
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/*************************************************************************** */
void build_NodeTRR_sub2(NodeType *node) {
int i,j,k, n;
double x,y;
node->ms->xlow = node->ms->ylow = DBL_MAX;
node->ms->xhi = node->ms->yhi = -DBL_MAX;
for (i=0;i<node->n_area;++i) {
n = node->area[i].npts;
for (j=0;j<n;++j) {
k = node->area[i].vertex[j];
x = node->area[i].mr[k].x;
y = node->area[i].mr[k].y;
node->ms->xlow = tMIN(node->ms->xlow, x-y);
node->ms->xhi = tMAX(node->ms->xhi , x-y);
node->ms->ylow = tMIN(node->ms->ylow, x+y);
node->ms->yhi = tMAX(node->ms->yhi , x+y);
}
}
}
/****************************************************************************/
/* make a smallest TRR containing the merging Node */
/* for the inplementation of the bucket decomposition */
/****************************************************************************/
void build_NodeTRR(NodeType *node) {
if ( BST_Mode != BME_MODE ) {
build_NodeTRR_sub2(node);
} else {
build_NodeTRR_sub1(node);
}
}
/*******************************************************************/
/* */
/*******************************************************************/
double minskew_IME_sub(NodeType *node, int i) {
double min_skew;
int j;
min_skew=DBL_MAX;
for (j=0;j<node->area[i].n_mr;++j) {
min_skew = tMIN(pt_skew(node->area[i].mr[j]), min_skew);
}
return(min_skew);
}
/*******************************************************************/
/* */
/*******************************************************************/
double minskew_IME(NodeType *node) {
double min_skew, x;
int i;
min_skew=DBL_MAX;
for (i=0; i<node->n_area; i++) {
x = minskew_IME_sub(node, i);
min_skew = min (x, min_skew);
}
return(min_skew);
}
/*******************************************************************/
/* */
/*******************************************************************/
double area_minskew(AreaType *area) {
double min_skew;
int i;
min_skew=DBL_MAX;
for (i=0; i<area->n_mr; i++) {
min_skew = min (pt_skew(area->mr[i]), min_skew);
}
return(min_skew);
}
/*******************************************************************/
/* */
/*******************************************************************/
double minskew_BME(NodeType *node) {
return(area_minskew(&(node->area[node->ca])));
}
/*******************************************************************/
/* Return the minimum skew of the given merging region */
/*******************************************************************/
double minskew(NodeType *node, int mode) {
double min_skew=DBL_MAX;
if (mode == BME_MODE) {
min_skew = minskew_BME(node);
} else {
min_skew = minskew_IME(node);
}
return(min_skew);
}
/*******************************************************************/
/* */
/*******************************************************************/
double maxskew_sub1(NodeType *node) {
double max_skew = 0 ;
int i, j;
for (i=0; i<node->n_area; i++) {
for (j=0;j<node->area[i].n_mr;++j) {
max_skew = tMAX(pt_skew(node->area[i].mr[j]), max_skew);
}
}
return(max_skew);
}
/*******************************************************************/
/* */
/*******************************************************************/
double maxskew_sub2(NodeType *node) {
double max_skew = 0;
int i;
for (i=0; i<node->area[node->ca].n_mr; i++) {
max_skew = tMAX(pt_skew(node->area[node->ca].mr[i]), max_skew);
}
return(max_skew);
}
/*******************************************************************/
/* Return the max skew of the given merging region */
/*******************************************************************/
double maxskew(NodeType *node, int mode) {
double max_skew=0;
if (mode != BME_MODE) {
max_skew = maxskew_sub1(node);
} else {
max_skew = maxskew_sub2(node);
}
return(max_skew);
}
/***********************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/***********************************************************************/
void trace() {
printf("******* # trees = %d*********", count_trees());
iShowTime();
fflush(stdout);
}
/****************************************************************************/
/* check if three points p1, p2, p3 Node colinear */
/****************************************************************************/
int colinear(PointType p1, PointType p2, PointType p3) {
if ((p1.x==p2.x) && (p2.x==p3.x))
return(YES);
if ((p1.y==p2.y) && (p2.y==p3.y))
return(YES);
if ((p1.y-p2.y)/(p1.x-p2.x) == (p1.y-p3.y)/(p1.x-p3.x))
return (YES);
return(NO);
}
/******************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/******************************************************************/
void print_a_trr(TrrType *trr) {
printf("xl=%f,xh=%f,yl=%f,yh=%f\n",trr->xlow, trr->xhi,
trr->ylow,trr->yhi);
}
/******************************************************************/
/* Copyright (C) 1994/2000 by Andrew B. Kahng, C.-W. Albert Tsao */
/******************************************************************/
void print_IME_areas(NodeType *node,NodeType *node_L, NodeType *node_R,int n, int m) {
int i, L,R,n1,n2, L_area, R_area;
double cap, minskew;
L = node_L->id;
R = node_R->id;
n1 = node_L->n_area;
n2 = node_R->n_area;
printf("\nnode %d(%d,%d)(n1=%d,n2=%d) has %d areas out of %d(total:%d): \n",
node->id, L,R, n1,n2, node->n_area, n,m);
for (i=0;i<n1;++i) { printf("%d ",node_L->area[i].n_mr); }
printf("\n");
for (i=0;i<n2;++i) { printf("%d ",node_R->area[i].n_mr); }
printf("\n");
for (i=0;i<node->n_area;++i) {
cap = node->area[i].capac;
minskew = minskew_IME_sub(node, i);
L_area = node->area[i].L_area;
R_area = node->area[i].R_area;
printf(" cap=%f, minskew=%f (%d,%d)\n", cap, minskew, L_area,R_area);
}