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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>polylib: polyparam.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.1 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>polyparam.c</h1><a href="polyparam_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> This file is part of PolyLib.</span>
<a name="l00003"></a>00003 <span class="comment"></span>
<a name="l00004"></a>00004 <span class="comment"> PolyLib is free software: you can redistribute it and/or modify</span>
<a name="l00005"></a>00005 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00006"></a>00006 <span class="comment"> the Free Software Foundation, either version 3 of the License, or</span>
<a name="l00007"></a>00007 <span class="comment"> (at your option) any later version.</span>
<a name="l00008"></a>00008 <span class="comment"></span>
<a name="l00009"></a>00009 <span class="comment"> PolyLib is distributed in the hope that it will be useful,</span>
<a name="l00010"></a>00010 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00011"></a>00011 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00012"></a>00012 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00015"></a>00015 <span class="comment"> along with PolyLib. If not, see <http://www.gnu.org/licenses/>.</span>
<a name="l00016"></a>00016 <span class="comment">*/</span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="comment">/***********************************************************************/</span>
<a name="l00019"></a>00019 <span class="comment">/* Parametrized polyhedra V4.20 */</span>
<a name="l00020"></a>00020 <span class="comment">/* copyright 1995-2000 Vincent Loechner */</span>
<a name="l00021"></a>00021 <span class="comment">/* copyright 1996-1997, Doran Wilde */</span>
<a name="l00022"></a>00022 <span class="comment">/* Permission is granted to copy, use, and distribute */</span>
<a name="l00023"></a>00023 <span class="comment">/* for any commercial or noncommercial purpose under the terms */</span>
<a name="l00024"></a>00024 <span class="comment">/* of the GNU General Public license, version 2, June 1991 */</span>
<a name="l00025"></a>00025 <span class="comment">/* (see file : LICENSING). */</span>
<a name="l00026"></a>00026 <span class="comment">/***********************************************************************/</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="comment">/********************* -----------USER #DEFS-------- ***********************/</span>
<a name="l00029"></a>00029 <span class="comment">/* These are mainly for debug purposes. You shouldn't need to change */</span>
<a name="l00030"></a>00030 <span class="comment">/* anything for daily usage... */</span>
<a name="l00031"></a>00031 <span class="comment">/***************************************************************************/</span>
<a name="l00032"></a>00032
<a name="l00033"></a>00033 <span class="comment">/* you may define each macro independently */</span>
<a name="l00034"></a>00034 <span class="comment">/* #define DEBUGPP */</span>
<a name="l00035"></a>00035 <span class="comment">/* #define DEBUGPP3 */</span> <span class="comment">/* initialization of domain, context, ... */</span>
<a name="l00036"></a>00036 <span class="comment">/* #define DEBUGPP31 */</span> <span class="comment">/* even more init-domains */</span>
<a name="l00037"></a>00037 <span class="comment">/* #define DEBUGPP32 */</span> <span class="comment">/* even even more... (Elim_Columns) */</span>
<a name="l00038"></a>00038 <span class="comment">/* #define DEBUGPP4 */</span> <span class="comment">/* m-faces scan */</span>
<a name="l00039"></a>00039 <span class="comment">/* #define DEBUGPP41 */</span> <span class="comment">/* inverse Di in scan */</span>
<a name="l00040"></a>00040 <span class="comment">/* #define DEBUGPP5 */</span> <span class="comment">/* Compute_PDomains */</span>
<a name="l00041"></a>00041 <span class="comment">/********************* ---------END USER #DEFS------ ***********************/</span>
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="preprocessor">#include <stdio.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <string.h></span>
<a name="l00046"></a>00046 <span class="preprocessor">#include <<a class="code" href="assert_8h.html">assert.h</a>></span>
<a name="l00047"></a>00047 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l00048"></a>00048 <span class="preprocessor"></span><span class="preprocessor">#include <time.h></span>
<a name="l00049"></a>00049 <span class="preprocessor">#endif</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span>
<a name="l00051"></a>00051 <span class="preprocessor">#include <<a class="code" href="polylib_8h.html">polylib/polylib.h</a>></span>
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a271323dd73589f835a5b4deac911a0af">traite_m_face</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *);
<a name="l00054"></a>00054 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>,<a class="code" href="structpolyhedron.html">Polyhedron</a> *,<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *);
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="comment">/*</span>
<a name="l00057"></a>00057 <span class="comment"> * Return the intersection of two polyhedral domains 'Pol1' and 'Pol2' such </span>
<a name="l00058"></a>00058 <span class="comment"> * that if the intersection is a polyhedron of lower dimension (a degenerate</span>
<a name="l00059"></a>00059 <span class="comment"> * polyhedron) than the operands, it is discarded from the resulting polyhedra</span>
<a name="l00060"></a>00060 <span class="comment"> * list. </span>
<a name="l00061"></a>00061 <span class="comment"> */</span>
<a name="l00062"></a><a class="code" href="polyparam_8h.html#a6b9861272d427f2ed7767ce9dcf783c7">00062</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#a6b9861272d427f2ed7767ce9dcf783c7">PDomainIntersection</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol1,<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol2,<span class="keywordtype">unsigned</span> NbMaxRays) {
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <a class="code" href="structpolyhedron.html">Polyhedron</a> *p1, *p2, *p3, *d;
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <span class="keywordflow">if</span> (!Pol1 || !Pol2) <span class="keywordflow">return</span> (<a class="code" href="structpolyhedron.html">Polyhedron</a>*) 0;
<a name="l00067"></a>00067 <span class="keywordflow">if</span>((Pol1-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> != Pol2-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>) || (Pol1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a> != Pol2-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>)) {
<a name="l00068"></a>00068 fprintf(stderr,
<a name="l00069"></a>00069 <span class="stringliteral">"? PDomainIntersection: operation on different dimensions\n"</span>);
<a name="l00070"></a>00070 <span class="keywordflow">return</span> (<a class="code" href="structpolyhedron.html">Polyhedron</a>*) 0;
<a name="l00071"></a>00071 }
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Pol1);
<a name="l00074"></a>00074 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Pol1);
<a name="l00075"></a>00075 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Pol2);
<a name="l00076"></a>00076 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Pol2);
<a name="l00077"></a>00077
<a name="l00078"></a>00078 d = (<a class="code" href="structpolyhedron.html">Polyhedron</a> *)0;
<a name="l00079"></a>00079 <span class="keywordflow">for</span> (p1=Pol1; p1; p1=p1-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00080"></a>00080 <span class="keywordflow">for</span> (p2=Pol2; p2; p2=p2-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00081"></a>00081 p3 = <a class="code" href="polyhedron_8c.html#a9690baafb863abbd2e8d5c4da2995416">AddConstraints</a>(p2-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[0],
<a name="l00082"></a>00082 p2-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>,p1,NbMaxRays);
<a name="l00083"></a>00083 <span class="keywordflow">if</span> (!p3) <span class="keywordflow">continue</span>;
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="comment">/* If the new polyhedron 'p3' has lower dimension, discard it */</span>
<a name="l00086"></a>00086 <span class="keywordflow">if</span> (p3-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>!=Pol1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>)
<a name="l00087"></a>00087 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(p3) ;
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="comment">/* Otherwise add it to the new polyhderal domain 'd'. */</span>
<a name="l00090"></a>00090 <span class="keywordflow">else</span>
<a name="l00091"></a>00091 d = <a class="code" href="polyhedron_8c.html#a965fd466bed4b1dd143c426e51ac16c5">AddPolyToDomain</a>(p3,d);
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093 }
<a name="l00094"></a>00094 <span class="keywordflow">return</span> d;
<a name="l00095"></a>00095 } <span class="comment">/* PDomainIntersection */</span>
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="comment">/* </span>
<a name="l00098"></a>00098 <span class="comment"> * Given polyhderal domains 'Pol1' and 'Pol2', return the difference of the </span>
<a name="l00099"></a>00099 <span class="comment"> * two domains with a modification that the resulting polyhedra in the new </span>
<a name="l00100"></a>00100 <span class="comment"> * domain don't have a 1 unit space around cut and the degenerate results</span>
<a name="l00101"></a>00101 <span class="comment"> * (of smaller dimension) are discarded. </span>
<a name="l00102"></a>00102 <span class="comment"> */</span>
<a name="l00103"></a><a class="code" href="polyparam_8h.html#ac234c76f3561c8799ddf6ff8de425e1f">00103</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#ac234c76f3561c8799ddf6ff8de425e1f">PDomainDifference</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol1,<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol2,<span class="keywordtype">unsigned</span> NbMaxRays) {
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <a class="code" href="structpolyhedron.html">Polyhedron</a> *p1, *p2, *p3, *d;
<a name="l00106"></a>00106 <span class="keywordtype">int</span> i;
<a name="l00107"></a>00107
<a name="l00108"></a>00108 <span class="keywordflow">if</span> (!Pol1 || !Pol2)
<a name="l00109"></a>00109 <span class="keywordflow">return</span> (<a class="code" href="structpolyhedron.html">Polyhedron</a>*) 0;
<a name="l00110"></a>00110 <span class="keywordflow">if</span>((Pol1-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> != Pol2-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>) || (Pol1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a> != Pol2-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>)) {
<a name="l00111"></a>00111 fprintf(stderr,
<a name="l00112"></a>00112 <span class="stringliteral">"? PDomainDifference: operation on different dimensions\n"</span>);
<a name="l00113"></a>00113 <span class="keywordflow">return</span> (<a class="code" href="structpolyhedron.html">Polyhedron</a>*) 0;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Pol1);
<a name="l00117"></a>00117 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Pol1);
<a name="l00118"></a>00118 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Pol2);
<a name="l00119"></a>00119 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Pol2);
<a name="l00120"></a>00120
<a name="l00121"></a>00121 d = (<a class="code" href="structpolyhedron.html">Polyhedron</a> *)0;
<a name="l00122"></a>00122 <span class="keywordflow">for</span> (p2=Pol2; p2; p2=p2-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00123"></a>00123 <span class="keywordflow">for</span> (p1=Pol1; p1; p1=p1-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00124"></a>00124 <span class="keywordflow">for</span> (i=0; i<p2-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; i++) {
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="comment">/* Add the constraint (-p2->Constraint[i]) >= 0 in 'p1' */</span>
<a name="l00127"></a>00127 p3 = <a class="code" href="polyhedron_8c.html#a1a9b9a572ee65d1c15aea3f9885dde7a">SubConstraint</a>(p2-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i],p1,NbMaxRays,2);
<a name="l00128"></a>00128 <span class="keywordflow">if</span> (!p3) <span class="keywordflow">continue</span>;
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="comment">/* If the new polyhedron 'p3' is empty or is a polyhedron of lower */</span>
<a name="l00131"></a>00131 <span class="comment">/* dimension, discard it. */</span>
<a name="l00132"></a>00132 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(p3) || p3-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>!=Pol1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>)
<a name="l00133"></a>00133 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(p3);
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <span class="comment">/* Otherwise add 'p3' to the new polyhderal domain 'd' */</span>
<a name="l00136"></a>00136 <span class="keywordflow">else</span>
<a name="l00137"></a>00137 d = <a class="code" href="polyhedron_8c.html#a965fd466bed4b1dd143c426e51ac16c5">AddPolyToDomain</a>(p3,d);
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139 }
<a name="l00140"></a>00140 <span class="keywordflow">if</span> (p2 != Pol2)
<a name="l00141"></a>00141 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(Pol1);
<a name="l00142"></a>00142 Pol1 = d;
<a name="l00143"></a>00143 d = (<a class="code" href="structpolyhedron.html">Polyhedron</a> *)0;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145 <span class="keywordflow">return</span> Pol1;
<a name="l00146"></a>00146 } <span class="comment">/* PDomainDifference */</span>
<a name="l00147"></a>00147
<a name="l00148"></a>00148 <span class="comment">/* </span>
<a name="l00149"></a>00149 <span class="comment"> * Return 1 if matrix 'Mat' is full column ranked, otherwise return 0. </span>
<a name="l00150"></a>00150 <span class="comment"> */</span>
<a name="l00151"></a><a class="code" href="polyparam_8c.html#a7fc6e29fa82ab421aaedeb032328737b">00151</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a7fc6e29fa82ab421aaedeb032328737b">TestRank</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat) {
<a name="l00152"></a>00152
<a name="l00153"></a>00153 <span class="keywordtype">int</span> i,j,k;
<a name="l00154"></a>00154 Value m1,m2,m3,gcd,tmp;
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00157"></a>00157 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00158"></a>00158 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m3); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l00159"></a>00159
<a name="l00160"></a>00160 <span class="keywordflow">for</span>(k=0;k<Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;++k) {
<a name="l00161"></a>00161
<a name="l00162"></a>00162 <span class="comment">/* If the digonal entry (k,k) is zero, search down the column(k) */</span>
<a name="l00163"></a>00163 <span class="comment">/* starting from row(k) to find a non-zero entry */</span>
<a name="l00164"></a>00164 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][k])) {
<a name="l00165"></a>00165 <span class="keywordflow">for</span>(j=k+1;j<Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++j) {
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="comment">/* If a non-zero entry (j,k) is found */</span>
<a name="l00168"></a>00168 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][k])) {
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="comment">/* Exchange row(k) and row(j) */</span>
<a name="l00171"></a>00171 <span class="keywordflow">for</span>(i=k;i<Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;++i) {
<a name="l00172"></a>00172 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(tmp,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]);
<a name="l00173"></a>00173 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][i]);
<a name="l00174"></a>00174 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][i],tmp);
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176 <span class="keywordflow">break</span>;
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="comment">/* If no non-zero entry is found then the matrix 'Mat' is not full */</span>
<a name="l00181"></a>00181 <span class="comment">/* ranked. Return zero. */</span>
<a name="l00182"></a>00182 <span class="keywordflow">if</span>(j>=Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>) {
<a name="l00183"></a>00183
<a name="l00184"></a>00184 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00185"></a>00185 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00186"></a>00186 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m3); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00187"></a>00187 <span class="keywordflow">return</span> 0;
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189 }
<a name="l00190"></a>00190
<a name="l00191"></a>00191 <span class="comment">/* Now Mat[k][k] is the pivot element */</span>
<a name="l00192"></a>00192 <span class="keywordflow">for</span>(j=k+1;j<Mat-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++j) {
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="comment">/* Make every other entry (below row(k)) in column(k) zero */</span>
<a name="l00195"></a>00195 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][k], Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][k]);
<a name="l00196"></a>00196 <span class="keywordflow">for</span>(i=k+1;i<Mat-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;++i) {
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="comment">/* pour tous les indices i > k */</span>
<a name="l00199"></a>00199 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m1,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][k]);
<a name="l00200"></a>00200 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(m2,Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][k],Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][i]);
<a name="l00201"></a>00201 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(m3,m1,m2);
<a name="l00202"></a>00202 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(Mat-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],m3,gcd);
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 }
<a name="l00205"></a>00205 }
<a name="l00206"></a>00206
<a name="l00207"></a>00207 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00208"></a>00208 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00209"></a>00209 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(m3); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00210"></a>00210
<a name="l00211"></a>00211 <span class="comment">/* The matrix 'Mat' is full ranked, return 1 */</span>
<a name="l00212"></a>00212 <span class="keywordflow">return</span> 1;
<a name="l00213"></a>00213 } <span class="comment">/* TestRank */</span>
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="comment">/*</span>
<a name="l00216"></a>00216 <span class="comment"> * The Saturation matrix is defined to be an integer (int type) matrix. It is</span>
<a name="l00217"></a>00217 <span class="comment"> * a boolean matrix which has a row for every constraint and a column for </span>
<a name="l00218"></a>00218 <span class="comment"> * every line or ray. The bits in the binary format of each integer in the </span>
<a name="l00219"></a>00219 <span class="comment"> * saturation matrix stores the information whether the corresponding constr-</span>
<a name="l00220"></a>00220 <span class="comment"> * aint is saturated by ray(line) or not. </span>
<a name="l00221"></a>00221 <span class="comment"> */</span>
<a name="l00222"></a>00222 <span class="keyword">typedef</span> <span class="keyword">struct </span>{
<a name="l00223"></a>00223 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> NbRows;
<a name="l00224"></a>00224 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> NbColumns;
<a name="l00225"></a><a class="code" href="structSatMatrix.html#aa86302fc014dad53a8f176f4d0cee80c">00225</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> **<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00226"></a><a class="code" href="structSatMatrix.html#a99b2766234263935af2f8a5f8cab118c">00226</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *p_init;
<a name="l00227"></a>00227 } <a class="code" href="structSatMatrix.html">SatMatrix</a>;
<a name="l00228"></a>00228
<a name="l00229"></a><a class="code" href="polyparam_8c.html#a010deaa3d3f81aaa979f67bb0012d109">00229</a> <span class="keyword">static</span> <a class="code" href="structSatMatrix.html">SatMatrix</a> *<a class="code" href="polyparam_8c.html#a010deaa3d3f81aaa979f67bb0012d109">SMAlloc</a>(<span class="keywordtype">int</span> rows,<span class="keywordtype">int</span> cols) {
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> **q, *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00232"></a>00232 <span class="keywordtype">int</span> i;
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <a class="code" href="structSatMatrix.html">SatMatrix</a> *result = (<a class="code" href="structSatMatrix.html">SatMatrix</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structSatMatrix.html">SatMatrix</a>));
<a name="l00235"></a>00235 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a> (result != NULL);
<a name="l00236"></a>00236
<a name="l00237"></a>00237 result-><a class="code" href="structSatMatrix.html#a08d0db0d2eda3b8bdcc316eabadaca09">NbRows</a> = rows;
<a name="l00238"></a>00238 result-><a class="code" href="structSatMatrix.html#a20a0299b3d86f4c26a22faed4aaea6fd">NbColumns</a> = cols;
<a name="l00239"></a>00239 result-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a> = q = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> **)malloc(rows * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *));
<a name="l00240"></a>00240 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a> (result-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a> != NULL);
<a name="l00241"></a>00241 result-><a class="code" href="structSatMatrix.html#ade050f206fbbc64a84bcaaec6f8c260e">p_init</a> = p = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc(rows * cols * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>));
<a name="l00242"></a>00242 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a> (result-><a class="code" href="structSatMatrix.html#ade050f206fbbc64a84bcaaec6f8c260e">p_init</a> != NULL);
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keywordflow">for</span> (i=0;i<rows;i++) {
<a name="l00245"></a>00245 *q++ = p;
<a name="l00246"></a>00246 p += cols;
<a name="l00247"></a>00247 }
<a name="l00248"></a>00248
<a name="l00249"></a>00249 <span class="keywordflow">return</span> result;
<a name="l00250"></a>00250 } <span class="comment">/* SMAlloc */</span>
<a name="l00251"></a>00251
<a name="l00252"></a><a class="code" href="polyparam_8c.html#ae7ab7efd2892ac6c61e2acc8f1142f1c">00252</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#ae7ab7efd2892ac6c61e2acc8f1142f1c">SMPrint</a> (<a class="code" href="structSatMatrix.html">SatMatrix</a> *<a class="code" href="structmatrix.html">matrix</a>) {
<a name="l00253"></a>00253
<a name="l00254"></a>00254 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00255"></a>00255 <span class="keywordtype">int</span> i, j;
<a name="l00256"></a>00256 <span class="keywordtype">unsigned</span> NbRows, NbColumns;
<a name="l00257"></a>00257
<a name="l00258"></a>00258 fprintf(stderr,<span class="stringliteral">"%d %d\n"</span>,NbRows=matrix-><a class="code" href="structSatMatrix.html#a08d0db0d2eda3b8bdcc316eabadaca09">NbRows</a>, NbColumns=matrix-><a class="code" href="structSatMatrix.html#a20a0299b3d86f4c26a22faed4aaea6fd">NbColumns</a>);
<a name="l00259"></a>00259 <span class="keywordflow">for</span> (i=0;i<NbRows;i++) {
<a name="l00260"></a>00260 p = *(matrix-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>+i);
<a name="l00261"></a>00261 <span class="keywordflow">for</span> (j=0;j<NbColumns;j++)
<a name="l00262"></a>00262 fprintf(stderr, <span class="stringliteral">" %10X "</span>, *p++);
<a name="l00263"></a>00263 fprintf(stderr, <span class="stringliteral">"\n"</span>);
<a name="l00264"></a>00264 }
<a name="l00265"></a>00265 } <span class="comment">/* SMPrint */</span>
<a name="l00266"></a>00266
<a name="l00267"></a>00267
<a name="l00268"></a><a class="code" href="polyparam_8c.html#ae775e630ac521bfe434fdf25d937d975">00268</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#ae775e630ac521bfe434fdf25d937d975">SMFree</a> (<a class="code" href="structSatMatrix.html">SatMatrix</a> *<a class="code" href="structmatrix.html">matrix</a>) {
<a name="l00269"></a>00269
<a name="l00270"></a>00270 free ((<span class="keywordtype">char</span> *) matrix-><a class="code" href="structSatMatrix.html#ade050f206fbbc64a84bcaaec6f8c260e">p_init</a>);
<a name="l00271"></a>00271 free ((<span class="keywordtype">char</span> *) matrix-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>);
<a name="l00272"></a>00272 free ((<span class="keywordtype">char</span> *) matrix);
<a name="l00273"></a>00273 <span class="keywordflow">return</span>;
<a name="l00274"></a>00274 } <span class="comment">/* SMFree */</span>
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="comment">/* -------------------------------------------------------------------------</span>
<a name="l00277"></a>00277 <span class="comment"> * Shared Global Variables:</span>
<a name="l00278"></a>00278 <span class="comment"> * Used by procedures: Find_m_face, scan_m_face, Poly2Sat, traite_m_face,</span>
<a name="l00279"></a>00279 <span class="comment"> * count_sat </span>
<a name="l00280"></a>00280 <span class="comment"> * -------------------------------------------------------------------------</span>
<a name="l00281"></a>00281 <span class="comment"> */</span>
<a name="l00282"></a><a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">00282</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>; <span class="comment">/* number of parameters */</span>
<a name="l00283"></a><a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">00283</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a>; <span class="comment">/* dimension of m-face */</span>
<a name="l00284"></a><a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">00284</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>; <span class="comment">/* dimension (not including parameters) */</span>
<a name="l00285"></a><a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">00285</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>; <span class="comment">/* Working Space size */</span>
<a name="l00286"></a><a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">00286</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>; <span class="comment">/* (NbRays-1)/32 + 1 */</span>
<a name="l00287"></a>00287
<a name="l00288"></a><a class="code" href="polyparam_8c.html#affef9630eb1606e7b4705882682ae7a5">00288</a> <span class="keyword">static</span> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#affef9630eb1606e7b4705882682ae7a5">CEqualities</a>;<span class="comment">/* Equalities in the context */</span>
<a name="l00289"></a><a class="code" href="polyparam_8c.html#a41ad9a1ceff17c92987e3d80dfbaccf4">00289</a> <span class="keyword">static</span> <a class="code" href="structSatMatrix.html">SatMatrix</a> *<a class="code" href="polyparam_8c.html#a41ad9a1ceff17c92987e3d80dfbaccf4">Sat</a>; <span class="comment">/* Saturation Matrix (row=constraint, col=ray)*/</span>
<a name="l00290"></a><a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">00290</a> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>; <span class="comment">/* Bool vector marking constraints in m-face */</span>
<a name="l00291"></a><a class="code" href="polyparam_8c.html#a40f314ebd702a14b3c97254e4c11de55">00291</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#a40f314ebd702a14b3c97254e4c11de55">Xi</a>, *<a class="code" href="polyparam_8c.html#a27503fb09c401518184a9f59d55bbf61">Pi</a>; <span class="comment">/* Xi and Pi */</span>
<a name="l00292"></a><a class="code" href="polyparam_8c.html#a24a230e9c65ee973cc69f0b9896ff00c">00292</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#a24a230e9c65ee973cc69f0b9896ff00c">PiTest</a>; <span class="comment">/* Matrix used to test if Pi is full ranked? */</span>
<a name="l00293"></a><a class="code" href="polyparam_8c.html#a7c31d5fd5bff6dd08a1a053244c9e723">00293</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#a7c31d5fd5bff6dd08a1a053244c9e723">CTest</a>;
<a name="l00294"></a><a class="code" href="polyparam_8c.html#ad1185a2aa83d581ec9c88f4eac4240d2">00294</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#ad1185a2aa83d581ec9c88f4eac4240d2">PiInv</a>; <span class="comment">/* Matrix inverse Pi, with the last col of */</span>
<a name="l00295"></a>00295 <span class="comment">/* each line = denominator of the line */</span>
<a name="l00296"></a><a class="code" href="polyparam_8c.html#af15f95ab1c82a4e1565f975b3b934c7b">00296</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#af15f95ab1c82a4e1565f975b3b934c7b">RaysDi</a>; <span class="comment">/* Constraint matrix for computing Di */</span>
<a name="l00297"></a>00297
<a name="l00298"></a><a class="code" href="polyparam_8c.html#afeb763676895f49e165f3b279c9aa946">00298</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#afeb763676895f49e165f3b279c9aa946">KD</a>; <span class="comment">/* Flag : keep the full domains in memory ? */</span>
<a name="l00299"></a>00299 <span class="comment">/* 1 = yes; 0 = no, keep constraints only */</span>
<a name="l00300"></a>00300
<a name="l00301"></a><a class="code" href="polyparam_8c.html#a135433bf69beff8673f093340cbe29be">00301</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a135433bf69beff8673f093340cbe29be">nbPV</a>; <span class="comment">/* The number of parameterized vertices */</span>
<a name="l00302"></a><a class="code" href="polyparam_8c.html#a4f1b4b8771be178935fe09394720cfdf">00302</a> <span class="keyword">static</span> <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *<a class="code" href="polyparam_8c.html#a4f1b4b8771be178935fe09394720cfdf">PV_Result</a>; <span class="comment">/* List of parameterized vertices */</span>
<a name="l00303"></a><a class="code" href="polyparam_8c.html#a1e624849e799ef830292537dd9d6da4b">00303</a> <span class="keyword">static</span> <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *<a class="code" href="polyparam_8c.html#a1e624849e799ef830292537dd9d6da4b">PDomains</a>; <span class="comment">/* List of domains. */</span>
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l00306"></a>00306 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">int</span> nbfaces;
<a name="l00307"></a>00307 <span class="preprocessor">#endif</span>
<a name="l00308"></a>00308 <span class="preprocessor"></span>
<a name="l00309"></a>00309 <span class="comment">/*</span>
<a name="l00310"></a>00310 <span class="comment"> * Add the constraints from the context polyhedron 'CEqualities' to the </span>
<a name="l00311"></a>00311 <span class="comment"> * constraints of polyhedra in the polyhedral domain 'D' and return the new</span>
<a name="l00312"></a>00312 <span class="comment"> * polyhedral domain. Polyhedral domain 'D' is subsequently deleted from memory</span>
<a name="l00313"></a>00313 <span class="comment"> */</span>
<a name="l00314"></a><a class="code" href="polyparam_8c.html#a268d6a0bae15f9232bcd138212aa1ea5">00314</a> <span class="keyword">static</span> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#a268d6a0bae15f9232bcd138212aa1ea5">Add_CEqualities</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D) {
<a name="l00315"></a>00315
<a name="l00316"></a>00316 <a class="code" href="structpolyhedron.html">Polyhedron</a> *d,*r,*tmp;
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <span class="keywordflow">if</span>(!CEqualities)
<a name="l00319"></a>00319 <span class="keywordflow">return</span> D;
<a name="l00320"></a>00320 <span class="keywordflow">else</span> {
<a name="l00321"></a>00321 <span class="keywordflow">if</span>(!D || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(D)) {
<a name="l00322"></a>00322 <span class="keywordflow">if</span>(D)
<a name="l00323"></a>00323 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(D);
<a name="l00324"></a>00324 <span class="keywordflow">return</span>(<a class="code" href="polyhedron_8c.html#ab0f89a51f01cea6b93b8fb3ab43feca3">Polyhedron_Copy</a>(CEqualities));
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 r = <a class="code" href="polyhedron_8c.html#a9690baafb863abbd2e8d5c4da2995416">AddConstraints</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[0],D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>,
<a name="l00327"></a>00327 CEqualities,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l00328"></a>00328 tmp = r;
<a name="l00329"></a>00329 <span class="keywordflow">for</span>(d=D-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>;d;d=d-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00330"></a>00330 tmp-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a> = <a class="code" href="polyhedron_8c.html#a9690baafb863abbd2e8d5c4da2995416">AddConstraints</a>(d-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[0],d-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>,
<a name="l00331"></a>00331 CEqualities,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l00332"></a>00332 tmp = tmp-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>;
<a name="l00333"></a>00333 }
<a name="l00334"></a>00334 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(D);
<a name="l00335"></a>00335 <span class="keywordflow">return</span>(r);
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337 } <span class="comment">/* Add_CEqualities */</span>
<a name="l00338"></a>00338
<a name="l00339"></a><a class="code" href="polyparam_8c.html#aa5622509f213f84fa22674f8f6aed801">00339</a> <span class="preprocessor">#define INT_BITS (sizeof(unsigned) * 8)</span>
<a name="l00340"></a>00340 <span class="preprocessor"></span>
<a name="l00341"></a><a class="code" href="polyparam_8c.html#abf2e0f0225324d7f7b15e7b94efb8041">00341</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *<a class="code" href="polyparam_8c.html#abf2e0f0225324d7f7b15e7b94efb8041">int_array2bit_vector</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *array, <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>)
<a name="l00342"></a>00342 {
<a name="l00343"></a>00343 <span class="keywordtype">int</span> i, ix;
<a name="l00344"></a>00344 <span class="keywordtype">unsigned</span> bx;
<a name="l00345"></a>00345 <span class="keywordtype">int</span> words = (n+<a class="code" href="polyparam_8c.html#aa5622509f213f84fa22674f8f6aed801">INT_BITS</a>-1)/<a class="code" href="polyparam_8c.html#aa5622509f213f84fa22674f8f6aed801">INT_BITS</a>;
<a name="l00346"></a>00346 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *bv = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)calloc(words, <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>));
<a name="l00347"></a>00347 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(bv);
<a name="l00348"></a>00348 <span class="keywordflow">for</span> (i = 0, ix = 0, bx = <a class="code" href="types_8h.html#a11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>; i < n; ++i) {
<a name="l00349"></a>00349 <span class="keywordflow">if</span> (array[i])
<a name="l00350"></a>00350 bv[ix] |= bx;
<a name="l00351"></a>00351 <a class="code" href="types_8h.html#a3dd66db5db700555d4e24314974a2ea1">NEXT</a>(ix, bx);
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353 <span class="keywordflow">return</span> bv;
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00357"></a>00357 <span class="comment">/* traite_m_face */</span>
<a name="l00358"></a>00358 <span class="comment">/* Given an m-face, compute the parameterized vertex */</span>
<a name="l00359"></a>00359 <span class="comment">/* D - The entire domain */</span>
<a name="l00360"></a>00360 <span class="comment">/* mf - Bit vector marking the lines/rays in the m-face */</span>
<a name="l00361"></a>00361 <span class="comment">/* egalite - boolean vector marking saturated constraints in m-face */</span>
<a name="l00362"></a>00362 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00363"></a><a class="code" href="polyparam_8c.html#a271323dd73589f835a5b4deac911a0af">00363</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a271323dd73589f835a5b4deac911a0af">traite_m_face</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mf,
<a name="l00364"></a>00364 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>)
<a name="l00365"></a>00365 {
<a name="l00366"></a>00366 <a class="code" href="structmatrix.html">Matrix</a> *Si; <span class="comment">/* Solution */</span>
<a name="l00367"></a>00367 <a class="code" href="structpolyhedron.html">Polyhedron</a> *PDi; <span class="comment">/* polyhedron Di */</span>
<a name="l00368"></a>00368 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *PV;
<a name="l00369"></a>00369 <span class="keywordtype">int</span> j,k,c,r;
<a name="l00370"></a>00370 <span class="keywordtype">unsigned</span> kx, bx;
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l00373"></a>00373 <span class="preprocessor"></span> ++nbfaces;
<a name="l00374"></a>00374 <span class="preprocessor">#endif</span>
<a name="l00375"></a>00375 <span class="preprocessor"></span>
<a name="l00376"></a>00376 <span class="comment">/* Extract Xi, Pi, and RaysDi from D */</span>
<a name="l00377"></a>00377 RaysDi-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a> = 0;
<a name="l00378"></a>00378 <span class="keywordflow">for</span>(k=0,c=0,kx=0,bx=<a class="code" href="types_8h.html#a11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>;k<D-><a class="code" href="structpolyhedron.html#a74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;++k) {
<a name="l00379"></a>00379 <span class="keywordflow">if</span>(mf[kx]&bx) { <span class="comment">/* this ray is in the current m-face */</span>
<a name="l00380"></a>00380 <span class="keywordflow">if</span>(c<<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1) {
<a name="l00381"></a>00381 <span class="keywordtype">int</span> i;
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="comment">/* tester si cette nouvelle colonne est lin. indep. des autres */</span>
<a name="l00384"></a>00384 <span class="comment">/* i.e. si gauss ne donne pas de '0' sur la colonne Pi */</span>
<a name="l00385"></a>00385 <span class="comment">/* jusqu'a l'indice 'c' */</span>
<a name="l00386"></a>00386
<a name="l00387"></a>00387 <span class="comment">/* construit PiTest */</span>
<a name="l00388"></a>00388 <span class="keywordflow">for</span>(j=0;j<<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1;++j) {
<a name="l00389"></a>00389 <span class="keywordflow">for</span>(i=0;i<c;++i)
<a name="l00390"></a>00390
<a name="l00391"></a>00391 <span class="comment">/* les c premieres colonnes */</span>
<a name="l00392"></a>00392 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(PiTest-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],Pi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i]);
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="comment">/* la nouvelle */</span>
<a name="l00395"></a>00395 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(PiTest-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][j+1+<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>]);
<a name="l00396"></a>00396 }
<a name="l00397"></a>00397 PiTest-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a> = c+1;
<a name="l00398"></a>00398 r = <a class="code" href="polyparam_8c.html#a7fc6e29fa82ab421aaedeb032328737b">TestRank</a>(PiTest);
<a name="l00399"></a>00399 <span class="keywordflow">if</span>(r <span class="comment">/* TestRank(PiTest) */</span>) {
<a name="l00400"></a>00400
<a name="l00401"></a>00401 <span class="comment">/* Ok, c'est lin. indep. */</span>
<a name="l00402"></a>00402 <span class="keywordflow">for</span> (j=0;j<<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>;j++)
<a name="l00403"></a>00403 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Xi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][j+1]); <span class="comment">/* Xi */</span>
<a name="l00404"></a>00404 <span class="keywordflow">for</span> (j=0;j<m;j++)
<a name="l00405"></a>00405 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Pi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][j+1+n]); <span class="comment">/* Pi */</span>
<a name="l00406"></a>00406 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Xi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[n][c],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][n+m+1]); <span class="comment">/* const */</span>
<a name="l00407"></a>00407 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Pi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[m][c],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][n+m+1]); <span class="comment">/* const */</span>
<a name="l00408"></a>00408 c++;
<a name="l00409"></a>00409 }
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00412"></a>00412 <span class="comment">/* Status bit */</span>
<a name="l00413"></a>00413 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(RaysDi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[RaysDi-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>][0],D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][0]);
<a name="l00414"></a>00414 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(&D-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>+1],&RaysDi-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[RaysDi-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>][1],(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1));
<a name="l00415"></a>00415 ++RaysDi-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l00416"></a>00416 }
<a name="l00417"></a>00417 <a class="code" href="types_8h.html#a3dd66db5db700555d4e24314974a2ea1">NEXT</a>(kx,bx);
<a name="l00418"></a>00418 }
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="preprocessor">#ifdef DEBUGPP41</span>
<a name="l00421"></a>00421 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"\nRaysDi=\n"</span>);
<a name="l00422"></a>00422 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,RaysDi);
<a name="l00423"></a>00423 <span class="keywordflow">if</span>(c < <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1)
<a name="l00424"></a>00424 fprintf(stderr, <span class="stringliteral">"Invalid "</span>);
<a name="l00425"></a>00425 fprintf(stderr, <span class="stringliteral">"Pi=\n"</span>);
<a name="l00426"></a>00426 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,Pi);
<a name="l00427"></a>00427 <span class="preprocessor">#endif</span>
<a name="l00428"></a>00428 <span class="preprocessor"></span>
<a name="l00429"></a>00429 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00430"></a>00430 <span class="preprocessor"></span> <span class="keywordflow">if</span>(c < <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1)
<a name="l00431"></a>00431 fprintf(stderr,<span class="stringliteral">"Eliminated because of no vertex\n"</span>);
<a name="l00432"></a>00432 <span class="preprocessor">#endif</span>
<a name="l00433"></a>00433 <span class="preprocessor"></span>
<a name="l00434"></a>00434 <span class="keywordflow">if</span>(c < <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1)
<a name="l00435"></a>00435 <span class="keywordflow">return</span>;
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="comment">/* RaysDi->numColumns = m+2; */</span> <span class="comment">/* stays the same */</span>
<a name="l00438"></a>00438
<a name="l00439"></a>00439 <span class="comment">/* Xi->NbColumns = m+1;*/</span> <span class="comment">/* VIN100: stays the same. was 'c'! */</span>
<a name="l00440"></a>00440 <span class="comment">/* Xi->NbRows = n+1; */</span> <span class="comment">/* stays the same */</span>
<a name="l00441"></a>00441 <span class="comment">/* Pi->NbColumns = m+1;*/</span> <span class="comment">/* VIN100: stays the same. was 'c'! */</span>
<a name="l00442"></a>00442 <span class="comment">/* Pi->NbRows = m+1; */</span> <span class="comment">/* stays the same */</span>
<a name="l00443"></a>00443
<a name="l00444"></a>00444 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00445"></a>00445 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Xi = "</span>);
<a name="l00446"></a>00446 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,Xi);
<a name="l00447"></a>00447 fprintf(stderr,<span class="stringliteral">"Pi = "</span>);
<a name="l00448"></a>00448 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,Pi);
<a name="l00449"></a>00449 <span class="preprocessor">#endif</span>
<a name="l00450"></a>00450 <span class="preprocessor"></span>
<a name="l00451"></a>00451 <span class="comment">/* (Right) invert Pi if POSSIBLE, if not then next m-face */</span>
<a name="l00452"></a>00452 <span class="comment">/* Pi is destroyed */</span>
<a name="l00453"></a>00453 <span class="keywordflow">if</span>(!<a class="code" href="matrix_8c.html#ae2b2f031eb75c5011091536d7ef4befc">MatInverse</a>(Pi,PiInv)) {
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00456"></a>00456 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"Eliminated because of no inverse Pi\n"</span>);
<a name="l00457"></a>00457 <span class="preprocessor">#endif</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span>
<a name="l00459"></a>00459 <span class="keywordflow">return</span>;
<a name="l00460"></a>00460 }
<a name="l00461"></a>00461
<a name="l00462"></a>00462 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00463"></a>00463 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"FACE GENERATED!\n"</span>);
<a name="l00464"></a>00464 fprintf(stderr,<span class="stringliteral">"PiInv = "</span>);
<a name="l00465"></a>00465 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,PiInv);
<a name="l00466"></a>00466 <span class="preprocessor">#endif</span>
<a name="l00467"></a>00467 <span class="preprocessor"></span>
<a name="l00468"></a>00468 <span class="comment">/* Compute Si (now called Ti in the paper) */</span>
<a name="l00469"></a>00469 Si = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(Xi-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>,PiInv-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00470"></a>00470 <a class="code" href="matrix_8c.html#adb8526f2ba863572c60b255c8b27c186">rat_prodmat</a>(Si,Xi,PiInv);
<a name="l00471"></a>00471
<a name="l00472"></a>00472 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00473"></a>00473 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Si = "</span>);
<a name="l00474"></a>00474 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,Si);
<a name="l00475"></a>00475 <span class="preprocessor">#endif</span>
<a name="l00476"></a>00476 <span class="preprocessor"></span>
<a name="l00477"></a>00477 Si-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>--; <span class="comment">/* throw out the last row = 0 ... 0 1 */</span>
<a name="l00478"></a>00478
<a name="l00479"></a>00479 <span class="comment">/* Copy all of that into the PV structure */</span>
<a name="l00480"></a>00480 PV = (<a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *) malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Vertex.html">Param_Vertices</a>));
<a name="l00481"></a>00481 PV-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a> = PV_Result;
<a name="l00482"></a>00482 PV-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a> = Si;
<a name="l00483"></a>00483 PV-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a> = NULL;
<a name="l00484"></a>00484 PV-><a class="code" href="struct__Param__Vertex.html#af7ff9a4be6a5202a9bcf741a8b233c9e">Facets</a> = <a class="code" href="polyparam_8c.html#abf2e0f0225324d7f7b15e7b94efb8041">int_array2bit_vector</a>(egalite, D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>);
<a name="l00485"></a>00485 PV_Result = PV;
<a name="l00486"></a>00486 <a class="code" href="polyparam_8c.html#a135433bf69beff8673f093340cbe29be">nbPV</a>++; <span class="comment">/* increment vertex count */</span>
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="comment">/* Ok... now compute the parameter domain */</span>
<a name="l00489"></a>00489 PDi = <a class="code" href="polyhedron_8c.html#a3d5b12b71133d329c88db195b56d9feb" title="Given a matrix of rays &#39;Ray&#39;, create and return a polyhedron.">Rays2Polyhedron</a>(RaysDi,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l00490"></a>00490
<a name="l00491"></a>00491 <span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l00492"></a>00492 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"RaysDi = "</span>);
<a name="l00493"></a>00493 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,RaysDi);
<a name="l00494"></a>00494 fprintf(stderr,<span class="stringliteral">"PDi = "</span>);
<a name="l00495"></a>00495 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,PDi);
<a name="l00496"></a>00496 <span class="preprocessor">#endif</span>
<a name="l00497"></a>00497 <span class="preprocessor"></span>
<a name="l00498"></a>00498 <span class="keywordflow">if</span>(<a class="code" href="polyparam_8c.html#afeb763676895f49e165f3b279c9aa946">KD</a>==0) {
<a name="l00499"></a>00499
<a name="l00500"></a>00500 <span class="comment">/* Add the equalities again to the domain */</span>
<a name="l00501"></a>00501 PDi = <a class="code" href="polyparam_8c.html#a268d6a0bae15f9232bcd138212aa1ea5">Add_CEqualities</a>(PDi);
<a name="l00502"></a>00502 PV-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a> = <a class="code" href="polyhedron_8c.html#a69417a994cd682d0c391ecff6d223cd2">Polyhedron2Constraints</a>(PDi);
<a name="l00503"></a>00503 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(PDi);
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505 <span class="keywordflow">else</span> {
<a name="l00506"></a>00506 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *PD;
<a name="l00507"></a>00507 PD = (<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *) malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Domain.html">Param_Domain</a>));
<a name="l00508"></a>00508 PD-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = PDi;
<a name="l00509"></a>00509 PD-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a> = NULL;
<a name="l00510"></a>00510 PD-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a> = PDomains;
<a name="l00511"></a>00511 PDomains = PD;
<a name="l00512"></a>00512 }
<a name="l00513"></a>00513 <span class="keywordflow">return</span>;
<a name="l00514"></a>00514 } <span class="comment">/* traite_m_face */</span>
<a name="l00515"></a>00515
<a name="l00516"></a>00516 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00517"></a>00517 <span class="comment">/* count_sat */</span>
<a name="l00518"></a>00518 <span class="comment">/* count the number of saturated rays in the bit vector mf */</span>
<a name="l00519"></a>00519 <span class="comment">/* Uses nr from global area */</span>
<a name="l00520"></a>00520 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00521"></a><a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">00521</a> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">cntbit</a>[256] = { <span class="comment">/* counts for 8 bits */</span>
<a name="l00522"></a>00522 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
<a name="l00523"></a>00523 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
<a name="l00524"></a>00524 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
<a name="l00525"></a>00525 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00526"></a>00526
<a name="l00527"></a>00527 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
<a name="l00528"></a>00528 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00529"></a>00529 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00530"></a>00530 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
<a name="l00531"></a>00531
<a name="l00532"></a>00532 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
<a name="l00533"></a>00533 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00534"></a>00534 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00535"></a>00535 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
<a name="l00536"></a>00536
<a name="l00537"></a>00537 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
<a name="l00538"></a>00538 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
<a name="l00539"></a>00539 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
<a name="l00540"></a>00540 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8 };
<a name="l00541"></a>00541
<a name="l00542"></a><a class="code" href="polyparam_8c.html#a7a11b9613a22c77bc0a4db25e0f24805">00542</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a7a11b9613a22c77bc0a4db25e0f24805">count_sat</a> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mf) {
<a name="l00543"></a>00543
<a name="l00544"></a>00544 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, tmp, cnt=0;
<a name="l00545"></a>00545
<a name="l00546"></a>00546 <span class="keywordflow">for</span> (i=0; i<<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>; i++) {
<a name="l00547"></a>00547 tmp = mf[i];
<a name="l00548"></a>00548 cnt = cnt
<a name="l00549"></a>00549 + <a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">cntbit</a>[ tmp & 0xff ]
<a name="l00550"></a>00550 + <a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">cntbit</a>[ (tmp>>8) & 0xff ]
<a name="l00551"></a>00551 + <a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">cntbit</a>[ (tmp>>16) & 0xff ]
<a name="l00552"></a>00552 + <a class="code" href="polyparam_8c.html#a1ee4d84c221c11dee606da4ea6826b06">cntbit</a>[ (tmp>>24) & 0xff ]
<a name="l00553"></a>00553 ;
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555 <span class="keywordflow">return</span> cnt;
<a name="l00556"></a>00556 } <span class="comment">/* count_sat */</span>
<a name="l00557"></a>00557
<a name="l00558"></a>00558 <span class="comment">/* Returns true if all bits in part are also set in bv */</span>
<a name="l00559"></a><a class="code" href="polyparam_8c.html#adb16f454d7b32a99bb7bcbf11a850d0c">00559</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#adb16f454d7b32a99bb7bcbf11a850d0c">bit_vector_includes</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *bv, <span class="keywordtype">int</span> len, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *part)
<a name="l00560"></a>00560 {
<a name="l00561"></a>00561 <span class="keywordtype">int</span> j;
<a name="l00562"></a>00562
<a name="l00563"></a>00563 <span class="keywordflow">for</span> (j = 0; j < len; j++) {
<a name="l00564"></a>00564 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00565"></a>00565 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"mf=%08X Sat=%08X &=%08X\n"</span>,
<a name="l00566"></a>00566 part[j],bv[j], (part[j] & bv[j]));
<a name="l00567"></a>00567 <span class="preprocessor">#endif</span>
<a name="l00568"></a>00568 <span class="preprocessor"></span> <span class="keywordflow">if</span> ((part[j] & bv[j]) != part[j])
<a name="l00569"></a>00569 <span class="keywordflow">return</span> 0;
<a name="l00570"></a>00570 }
<a name="l00571"></a>00571 <span class="keywordflow">return</span> 1;
<a name="l00572"></a>00572 }
<a name="l00573"></a>00573
<a name="l00574"></a>00574 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00575"></a>00575 <span class="comment">/* let D + E + L be the dimension of the polyhedron */</span>
<a name="l00576"></a>00576 <span class="comment">/* D = Dimension of polytope (ray space) */</span>
<a name="l00577"></a>00577 <span class="comment">/* L = Dimension of Lineality space (number of lines, bid) */</span>
<a name="l00578"></a>00578 <span class="comment">/* E = Dimension of Affine hull (number of equations) */</span>
<a name="l00579"></a>00579 <span class="comment">/* n = number of data indices */</span>
<a name="l00580"></a>00580 <span class="comment">/* m = number of parameters */</span>
<a name="l00581"></a>00581 <span class="comment">/* full domain: */</span>
<a name="l00582"></a>00582 <span class="comment">/* n + m = D + E + L */</span>
<a name="l00583"></a>00583 <span class="comment">/* projected domains: */</span>
<a name="l00584"></a>00584 <span class="comment">/* m = D_m + E_m + L_m */</span>
<a name="l00585"></a>00585 <span class="comment">/* n = D_n + E_n + L_n */</span>
<a name="l00586"></a>00586 <span class="comment">/* What dimension M-face, when projected onto parameter space, */</span>
<a name="l00587"></a>00587 <span class="comment">/* will give an L_m-face? */</span>
<a name="l00588"></a>00588 <span class="comment">/* What are the conditions? */</span>
<a name="l00589"></a>00589 <span class="comment">/* - at least one vertex */</span>
<a name="l00590"></a>00590 <span class="comment">/* - number of rays >= D_m+1 after removal of redundants */</span>
<a name="l00591"></a>00591 <span class="comment">/* */</span>
<a name="l00592"></a>00592 <span class="comment">/* dim of face nb saturated constraints nb saturated lines,rays */</span>
<a name="l00593"></a>00593 <span class="comment">/* ----------- ------------------------ ----------------------- */</span>
<a name="l00594"></a>00594 <span class="comment">/* (0+L)-face all E eqns + >=D ineq all L lines + 1 ray */</span>
<a name="l00595"></a>00595 <span class="comment">/* (M+L)-face all E eqns + >=(D-M) ineq all L lines + >=(M+1) rays */</span>
<a name="l00596"></a>00596 <span class="comment">/* (D+L)-face all E eqns + 0 ineq all L lines + >=(D+1) rays */</span>
<a name="l00597"></a>00597 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00598"></a>00598 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00599"></a>00599 <span class="comment">/* scan_m_face */</span>
<a name="l00600"></a>00600 <span class="comment">/* pos : the next candidate constraint position */</span>
<a name="l00601"></a>00601 <span class="comment">/* nb_un : number of saturated constraints needed to finish a face */</span>
<a name="l00602"></a>00602 <span class="comment">/* D : the source polyhedron (context included ) */</span>
<a name="l00603"></a>00603 <span class="comment">/* mf : bit-array marking rays which are saturated so far */</span>
<a name="l00604"></a>00604 <span class="comment">/* From Global area: */</span>
<a name="l00605"></a>00605 <span class="comment">/* ---------------- */</span>
<a name="l00606"></a>00606 <span class="comment">/* n : number of data indices */</span>
<a name="l00607"></a>00607 <span class="comment">/* m : number of parameters */</span>
<a name="l00608"></a>00608 <span class="comment">/* egalite : boolean vector marking saturated constraints in m-face */</span>
<a name="l00609"></a>00609 <span class="comment">/* Sat : Saturation Matrix (row=constraints, col=rays) */</span>
<a name="l00610"></a>00610 <span class="comment">/* ws : working space size */</span>
<a name="l00611"></a>00611 <span class="comment">/* nr : (NbRays-1)/32 + 1 */</span>
<a name="l00612"></a>00612 <span class="comment">/* */</span>
<a name="l00613"></a>00613 <span class="comment">/* Recursive function to find the rays and vertices of each m-face */</span>
<a name="l00614"></a>00614 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00615"></a><a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">00615</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(<span class="keywordtype">int</span> pos,<span class="keywordtype">int</span> nb_un,<a class="code" href="structpolyhedron.html">Polyhedron</a> *D,<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mf) {
<a name="l00616"></a>00616 <span class="comment">/* pos - the next candidate constraint position */</span>
<a name="l00617"></a>00617 <span class="comment">/* nb_un - the number of constraints needed to finish a face */</span>
<a name="l00618"></a>00618 <span class="comment">/* D - the source polyhedron */</span>
<a name="l00619"></a>00619 <span class="comment">/* mf - (bit vector) marks rays that are saturated so far */</span>
<a name="l00620"></a>00620
<a name="l00621"></a>00621 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *new_mf;
<a name="l00622"></a>00622
<a name="l00623"></a>00623 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00624"></a>00624 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Start scan_m_face(pos=%d, nb_un=%d, n=%d, m=%d\n"</span>,
<a name="l00625"></a>00625 pos,nb_un,<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>);
<a name="l00626"></a>00626 fprintf(stderr,<span class="stringliteral">"mf = "</span>);
<a name="l00627"></a>00627 {
<a name="l00628"></a>00628 <span class="keywordtype">int</span> i;
<a name="l00629"></a>00629 <span class="keywordflow">for</span>(i=0;i<<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>;i++)
<a name="l00630"></a>00630 fprintf(stderr,<span class="stringliteral">"%08X"</span>, mf[i]);
<a name="l00631"></a>00631 fprintf(stderr,<span class="stringliteral">"\nequality = ["</span>);
<a name="l00632"></a>00632 <span class="keywordflow">for</span>(i=0;i<D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;i++)
<a name="l00633"></a>00633 fprintf(stderr,<span class="stringliteral">" %1d"</span>,<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i]);
<a name="l00634"></a>00634 fprintf(stderr,<span class="stringliteral">"]\n"</span>);
<a name="l00635"></a>00635 }
<a name="l00636"></a>00636 <span class="preprocessor">#endif</span>
<a name="l00637"></a>00637 <span class="preprocessor"></span>
<a name="l00638"></a>00638 <span class="keywordflow">if</span>(nb_un == 0) { <span class="comment">/* Base case */</span>
<a name="l00639"></a>00639 <span class="keywordtype">int</span> i;
<a name="l00640"></a>00640
<a name="l00641"></a>00641 <span class="comment">/*********** ELIMINATION OF REDUNDANT FACES ***********/</span>
<a name="l00642"></a>00642 <span class="comment">/* if all these vertices also verify a previous constraint */</span>
<a name="l00643"></a>00643 <span class="comment">/* which is NOT already selected, we eliminate this face */</span>
<a name="l00644"></a>00644 <span class="comment">/* This keeps the lexicographically greatest selection */</span>
<a name="l00645"></a>00645 <span class="keywordflow">for</span>(i=0;i<pos-1;i++)
<a name="l00646"></a>00646 {
<a name="l00647"></a>00647 <span class="keywordflow">if</span>(<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i])
<a name="l00648"></a>00648 <span class="keywordflow">continue</span>; <span class="comment">/* already selected */</span>
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="comment">/* if Sat[i] & mf == mf then it's redundant */</span>
<a name="l00651"></a>00651 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00652"></a>00652 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"Sat[%d]\n"</span>, i);
<a name="l00653"></a>00653 <span class="preprocessor">#endif</span>
<a name="l00654"></a>00654 <span class="preprocessor"></span> <span class="keywordflow">if</span> (<a class="code" href="polyparam_8c.html#adb16f454d7b32a99bb7bcbf11a850d0c">bit_vector_includes</a>(Sat-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>[i], <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>, mf)) {
<a name="l00655"></a>00655 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00656"></a>00656 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"Redundant with constraint %d\n"</span>, i);
<a name="l00657"></a>00657 <span class="preprocessor">#endif</span>
<a name="l00658"></a>00658 <span class="preprocessor"></span> <span class="keywordflow">return</span>; <span class="comment">/* it is redundant */</span>
<a name="l00659"></a>00659 }
<a name="l00660"></a>00660 }
<a name="l00661"></a>00661 <span class="comment">/********* END OF ELIMINATION OF DEGENERATE FACES *********/</span>
<a name="l00662"></a>00662 <span class="comment">/* Now check for other constraints that are verified */</span>
<a name="l00663"></a>00663 <span class="keywordflow">for</span> (i = pos; i < D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; ++i) {
<a name="l00664"></a>00664 <span class="keywordflow">if</span> (<a class="code" href="polyparam_8c.html#adb16f454d7b32a99bb7bcbf11a850d0c">bit_vector_includes</a>(Sat-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>[i], <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>, mf))
<a name="l00665"></a>00665 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i] = 1;
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 <span class="comment">/* if we haven't found a constraint verified by all */</span>
<a name="l00668"></a>00668 <span class="comment">/* the rays, its OK, it's a new face. */</span>
<a name="l00669"></a>00669 <a class="code" href="polyparam_8c.html#a271323dd73589f835a5b4deac911a0af">traite_m_face</a>(D, mf, <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>);
<a name="l00670"></a>00670 <span class="keywordflow">for</span> (i = pos; i < D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; ++i)
<a name="l00671"></a>00671 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i] = 0;
<a name="l00672"></a>00672 <span class="keywordflow">return</span>;
<a name="l00673"></a>00673 }
<a name="l00674"></a>00674
<a name="l00675"></a>00675 <span class="comment">/* See if there are enough constraints left to finish */</span>
<a name="l00676"></a>00676 <span class="keywordflow">if</span>((pos+nb_un)>D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>) <span class="keywordflow">return</span>;
<a name="l00677"></a>00677
<a name="l00678"></a>00678 <span class="comment">/* Recurring part of the procedure */</span>
<a name="l00679"></a>00679 <span class="comment">/* Add the pos'th constraint, compute new saturation vector */</span>
<a name="l00680"></a>00680 {
<a name="l00681"></a>00681 <span class="keywordtype">int</span> k;
<a name="l00682"></a>00682 new_mf = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc(<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>*<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>));
<a name="l00683"></a>00683 <span class="keywordflow">for</span> (k=0; k<<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>; k++)
<a name="l00684"></a>00684 new_mf[k] = mf[k] & Sat-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>[pos][k];
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l00687"></a>00687 <span class="preprocessor"></span>fprintf(stderr,<span class="stringliteral">"new_mf = "</span>);
<a name="l00688"></a>00688 {
<a name="l00689"></a>00689 <span class="keywordtype">int</span> i;
<a name="l00690"></a>00690 <span class="keywordflow">for</span>(i=0;i<<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>;i++) {
<a name="l00691"></a>00691 fprintf(stderr,<span class="stringliteral">"%08X"</span>, new_mf[i]);
<a name="l00692"></a>00692 }
<a name="l00693"></a>00693 fprintf(stderr,<span class="stringliteral">"\ncount(new_mf) = %d\n"</span>,<a class="code" href="polyparam_8c.html#a7a11b9613a22c77bc0a4db25e0f24805">count_sat</a>(new_mf));
<a name="l00694"></a>00694 }
<a name="l00695"></a>00695 <span class="preprocessor">#endif</span>
<a name="l00696"></a>00696 <span class="preprocessor"></span>
<a name="l00697"></a>00697 {
<a name="l00698"></a>00698 <span class="keywordtype">int</span> c;
<a name="l00699"></a>00699 c = <a class="code" href="polyparam_8c.html#a7a11b9613a22c77bc0a4db25e0f24805">count_sat</a>(new_mf);
<a name="l00700"></a>00700 <span class="comment">/* optimization : at least m_dim+1 rays must be saturated to add this constraint */</span>
<a name="l00701"></a>00701 <span class="keywordflow">if</span> (c><a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a> )
<a name="l00702"></a>00702 {
<a name="l00703"></a>00703 <span class="keywordtype">int</span> redundant = 0;
<a name="l00704"></a>00704
<a name="l00705"></a>00705 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[pos]=1; <span class="comment">/* Try it with the pos-th constraint */</span>
<a name="l00706"></a>00706
<a name="l00707"></a>00707 <span class="comment">/* If this constraint does not change anything,</span>
<a name="l00708"></a>00708 <span class="comment"> * it is redundant with respect to the selected</span>
<a name="l00709"></a>00709 <span class="comment"> * equalities and the remaining inequalities.</span>
<a name="l00710"></a>00710 <span class="comment"> * Check whether it is redundant with respect</span>
<a name="l00711"></a>00711 <span class="comment"> * to just the selected equalities.</span>
<a name="l00712"></a>00712 <span class="comment"> */</span>
<a name="l00713"></a>00713 <span class="keywordflow">if</span>( c==<a class="code" href="polyparam_8c.html#a7a11b9613a22c77bc0a4db25e0f24805">count_sat</a>(mf) ) {
<a name="l00714"></a>00714 <span class="keywordtype">int</span> i, c, j;
<a name="l00715"></a>00715
<a name="l00716"></a>00716 <span class="keywordflow">for</span> (i = 0, c = 0; i < D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; ++i) {
<a name="l00717"></a>00717 <span class="keywordflow">if</span> (<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i] == 0 || <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i] == -1)
<a name="l00718"></a>00718 <span class="keywordflow">continue</span>;
<a name="l00719"></a>00719 <span class="keywordflow">for</span> (j = 0; j < D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1; ++j)
<a name="l00720"></a>00720 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(CTest-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c],
<a name="l00721"></a>00721 D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][j+1]);
<a name="l00722"></a>00722 ++c;
<a name="l00723"></a>00723 }
<a name="l00724"></a>00724 CTest-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a> = c;
<a name="l00725"></a>00725 <span class="preprocessor">#ifdef DEBUGPP41</span>
<a name="l00726"></a>00726 <span class="preprocessor"></span> <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CTest);
<a name="l00727"></a>00727 <span class="preprocessor">#endif</span>
<a name="l00728"></a>00728 <span class="preprocessor"></span> redundant = !<a class="code" href="polyparam_8c.html#a7fc6e29fa82ab421aaedeb032328737b">TestRank</a>(CTest);
<a name="l00729"></a>00729 }
<a name="l00730"></a>00730
<a name="l00731"></a>00731 <span class="comment">/* Do not decrement nb_un if equality is redundant. */</span>
<a name="l00732"></a>00732 <span class="keywordflow">if</span>( redundant )
<a name="l00733"></a>00733 {
<a name="l00734"></a>00734 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[pos]=-1; <span class="comment">/* Don't use in further redundance test</span>
<a name="l00735"></a>00735 <span class="comment"> */</span>
<a name="l00736"></a>00736 <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(pos+1,nb_un,D,new_mf);
<a name="l00737"></a>00737 }
<a name="l00738"></a>00738 <span class="keywordflow">else</span>
<a name="l00739"></a>00739 {
<a name="l00740"></a>00740 <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(pos+1,nb_un-1,D,new_mf);
<a name="l00741"></a>00741 }
<a name="l00742"></a>00742 }
<a name="l00743"></a>00743 }
<a name="l00744"></a>00744 free(new_mf);
<a name="l00745"></a>00745 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[pos]=0; <span class="comment">/* Try it without the pos-th constraint */</span>
<a name="l00746"></a>00746 <span class="keywordflow">if</span> ((pos+nb_un)>=D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>) <span class="keywordflow">return</span>;
<a name="l00747"></a>00747 <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(pos+1,nb_un,D,mf);
<a name="l00748"></a>00748 <span class="keywordflow">return</span>;
<a name="l00749"></a>00749 } <span class="comment">/* scan_m_face */</span>
<a name="l00750"></a>00750
<a name="l00751"></a>00751 <span class="comment">/*</span>
<a name="l00752"></a>00752 <span class="comment"> * Create a saturation matrix with rows correspond to the constraints and </span>
<a name="l00753"></a>00753 <span class="comment"> * columns correspond to the rays of the polyhedron 'Pol'. Global variable </span>
<a name="l00754"></a>00754 <span class="comment"> * 'nr' is set in the function. </span>
<a name="l00755"></a>00755 <span class="comment"> */</span>
<a name="l00756"></a><a class="code" href="polyparam_8c.html#abe53dff202dab1fd41e7dcc035d12562">00756</a> <span class="keyword">static</span> <a class="code" href="structSatMatrix.html">SatMatrix</a> *<a class="code" href="polyparam_8c.html#abe53dff202dab1fd41e7dcc035d12562">Poly2Sat</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol,<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> **L) {
<a name="l00757"></a>00757
<a name="l00758"></a>00758 <a class="code" href="structSatMatrix.html">SatMatrix</a> *Sat;
<a name="l00759"></a>00759 <span class="keywordtype">int</span> i, j, k, kx;
<a name="l00760"></a>00760 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *Temp;
<a name="l00761"></a>00761 Value *p1, *p2, p3,tmp;
<a name="l00762"></a>00762 <span class="keywordtype">unsigned</span> Dimension, NbRay, NbCon, bx;
<a name="l00763"></a>00763
<a name="l00764"></a>00764 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00765"></a>00765 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(p3); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l00766"></a>00766
<a name="l00767"></a>00767 NbRay = Pol-><a class="code" href="structpolyhedron.html#a74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;
<a name="l00768"></a>00768 NbCon = Pol-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;
<a name="l00769"></a>00769 Dimension = Pol-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1; <span class="comment">/* Homogeneous Dimension */</span>
<a name="l00770"></a>00770
<a name="l00771"></a>00771 <span class="comment">/* Build the Sat matrix */</span>
<a name="l00772"></a>00772 <a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a> = (NbRay - 1)/(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*8) + 1; <span class="comment">/* Set globally */</span>
<a name="l00773"></a>00773 Sat = <a class="code" href="polyparam_8c.html#a010deaa3d3f81aaa979f67bb0012d109">SMAlloc</a>(NbCon,<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>);
<a name="l00774"></a>00774 Temp = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc(<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>*<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>));
<a name="l00775"></a>00775 memset(Sat-><a class="code" href="structSatMatrix.html#ade050f206fbbc64a84bcaaec6f8c260e">p_init</a>,0,<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>*NbCon*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00776"></a>00776 memset(Temp,0,<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>*<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>));
<a name="l00777"></a>00777 kx=0; bx=<a class="code" href="types_8h.html#a11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>;
<a name="l00778"></a>00778 <span class="keywordflow">for</span> (k=0; k<NbRay; k++) {
<a name="l00779"></a>00779 <span class="keywordflow">for</span> (i=0; i<NbCon; i++) {
<a name="l00780"></a>00780 p1 = &Pol-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][1];
<a name="l00781"></a>00781 p2 = &Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[k][1];
<a name="l00782"></a>00782 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(p3,0);
<a name="l00783"></a>00783 <span class="keywordflow">for</span> (j=0;j<Dimension;j++) {
<a name="l00784"></a>00784 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(tmp,*p1,*p2);
<a name="l00785"></a>00785 <a class="code" href="source_2arith_2arithmetique_8h.html#aea216a0e750144f0e6eb9b0a82583739">value_addto</a>(p3,p3,tmp);
<a name="l00786"></a>00786 p1++; p2++;
<a name="l00787"></a>00787 }
<a name="l00788"></a>00788 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(p3))
<a name="l00789"></a>00789 Sat-><a class="code" href="structSatMatrix.html#a1035c79878e19d97de2ba62fc38456aa">p</a>[i][kx]|=bx;
<a name="l00790"></a>00790 }
<a name="l00791"></a>00791 Temp[kx] |= bx;
<a name="l00792"></a>00792 <a class="code" href="types_8h.html#a3dd66db5db700555d4e24314974a2ea1">NEXT</a>(kx, bx);
<a name="l00793"></a>00793 }
<a name="l00794"></a>00794
<a name="l00795"></a>00795 <span class="comment">/* Set 'L' to an array containing ones in every bit position of its */</span>
<a name="l00796"></a>00796 <span class="comment">/* elements. */</span>
<a name="l00797"></a>00797 *L = Temp;
<a name="l00798"></a>00798
<a name="l00799"></a>00799 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l00800"></a>00800 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(p3); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00801"></a>00801
<a name="l00802"></a>00802 <span class="keywordflow">return</span> Sat;
<a name="l00803"></a>00803 } <span class="comment">/* Poly2Sat */</span>
<a name="l00804"></a>00804
<a name="l00805"></a>00805 <span class="comment">/*</span>
<a name="l00806"></a>00806 <span class="comment"> * Create a parametrized polyhedron with zero parameters. This function was </span>
<a name="l00807"></a>00807 <span class="comment"> * first written by Xavier Redon, and was later modified by others.</span>
<a name="l00808"></a>00808 <span class="comment"> */</span>
<a name="l00809"></a><a class="code" href="polyparam_8h.html#ad694b78f831d141b6126e858d7b8b11a">00809</a> <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *<a class="code" href="polyparam_8c.html#ad694b78f831d141b6126e858d7b8b11a">GenParamPolyhedron</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Pol, <a class="code" href="structmatrix.html">Matrix</a> *Rays)
<a name="l00810"></a>00810 {
<a name="l00811"></a>00811 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *result;
<a name="l00812"></a>00812 <span class="keywordtype">int</span> nbRows, nbColumns;
<a name="l00813"></a>00813 <span class="keywordtype">int</span> i, <a class="code" href="vector_8c.html#a439227feff9d7f55384e8780cfc2eb82">size</a>, rays;
<a name="l00814"></a>00814
<a name="l00815"></a>00815 nbRows=Pol-><a class="code" href="structpolyhedron.html#a74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;
<a name="l00816"></a>00816 nbColumns=Pol-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2;
<a name="l00817"></a>00817
<a name="l00818"></a>00818 <span class="comment">/* Count the number of rays */</span>
<a name="l00819"></a>00819 <span class="keywordflow">for</span>(i=0, rays=0; i<nbRows; i++)
<a name="l00820"></a>00820 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][0]) ||
<a name="l00821"></a>00821 <a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][nbColumns-1]))
<a name="l00822"></a>00822 ++rays;
<a name="l00823"></a>00823
<a name="l00824"></a>00824 <span class="comment">/* Initialize the result */</span>
<a name="l00825"></a>00825 result=(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a>));
<a name="l00826"></a>00826 result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>=nbRows-rays;
<a name="l00827"></a>00827 result-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>=NULL;
<a name="l00828"></a>00828 result-><a class="code" href="struct__Param__Polyhedron.html#ac89157421ffc9312f82b11cb89a05dfe">Constraints</a> = <a class="code" href="polyhedron_8c.html#a69417a994cd682d0c391ecff6d223cd2">Polyhedron2Constraints</a>(Pol);
<a name="l00829"></a>00829 result-><a class="code" href="struct__Param__Polyhedron.html#a3daced8ddb352cfa5ed1eeb949f102c5">Rays</a> = Rays;
<a name="l00830"></a>00830
<a name="l00831"></a>00831 <span class="comment">/* Build the parametric vertices */</span>
<a name="l00832"></a>00832 <span class="keywordflow">for</span>(i=0;i<nbRows;i++) {
<a name="l00833"></a>00833 <a class="code" href="structmatrix.html">Matrix</a> *vertex;
<a name="l00834"></a>00834 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *paramVertex;
<a name="l00835"></a>00835 <span class="keywordtype">int</span> j;
<a name="l00836"></a>00836
<a name="l00837"></a>00837 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][0]) ||
<a name="l00838"></a>00838 <a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][nbColumns-1]))
<a name="l00839"></a>00839 <span class="keywordflow">continue</span>;
<a name="l00840"></a>00840
<a name="l00841"></a>00841 vertex=<a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nbColumns-2,2);
<a name="l00842"></a>00842 <span class="keywordflow">for</span>(j=1;j<nbColumns-1;j++) {
<a name="l00843"></a>00843 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(vertex-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j-1][0],Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][j]);
<a name="l00844"></a>00844 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(vertex-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j-1][1],Pol-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][nbColumns-1]);
<a name="l00845"></a>00845 }
<a name="l00846"></a>00846 paramVertex=(<a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Vertex.html">Param_Vertices</a>));
<a name="l00847"></a>00847 paramVertex-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>=vertex;
<a name="l00848"></a>00848
<a name="l00849"></a>00849 <span class="comment">/* There is one validity domain : universe of dimension 0 */</span>
<a name="l00850"></a>00850 paramVertex-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>=<a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(1,2);
<a name="l00851"></a>00851 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(paramVertex-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][0],1);
<a name="l00852"></a>00852 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(paramVertex-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][1],1);
<a name="l00853"></a>00853 paramVertex-><a class="code" href="struct__Param__Vertex.html#af7ff9a4be6a5202a9bcf741a8b233c9e">Facets</a> = NULL;
<a name="l00854"></a>00854 paramVertex-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a>=result-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>;
<a name="l00855"></a>00855 result-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>=paramVertex;
<a name="l00856"></a>00856 }
<a name="l00857"></a>00857
<a name="l00858"></a>00858 <span class="comment">/* Build the parametric domains (only one here) */</span>
<a name="l00859"></a>00859 <span class="keywordflow">if</span> (nbRows > 1)
<a name="l00860"></a>00860 size=(nbRows-1)/(8*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>))+1;
<a name="l00861"></a>00861 <span class="keywordflow">else</span>
<a name="l00862"></a>00862 size = 1;
<a name="l00863"></a>00863 result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>=(<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Domain.html">Param_Domain</a>));
<a name="l00864"></a>00864 result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>=NULL;
<a name="l00865"></a>00865 result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>=<a class="code" href="polyhedron_8c.html#a832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(0);
<a name="l00866"></a>00866 result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc(size*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00867"></a>00867 memset(&result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[0],0xFF,size*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00868"></a>00868
<a name="l00869"></a>00869 <span class="keywordflow">return</span> result;
<a name="l00870"></a>00870 } <span class="comment">/* GenParamPolyhedron */</span>
<a name="l00871"></a>00871
<a name="l00872"></a>00872
<a name="l00873"></a>00873 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00874"></a>00874 <span class="comment">/* PreElim_Columns */</span>
<a name="l00875"></a>00875 <span class="comment">/* function being called before Elim_Columns */</span>
<a name="l00876"></a>00876 <span class="comment">/* Equalities in E are analysed to initialize ref and p. */</span>
<a name="l00877"></a>00877 <span class="comment">/* These two vectors are used to construct the new constraint matrix */</span>
<a name="l00878"></a>00878 <span class="comment">/* PreElim_Columns returns the transformation matrix to re-convert the */</span>
<a name="l00879"></a>00879 <span class="comment">/* resulting domains in the same format (by adding empty columns) */</span>
<a name="l00880"></a>00880 <span class="comment">/* in the parameter space */</span>
<a name="l00881"></a>00881 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00882"></a><a class="code" href="polyparam_8c.html#ae97949d9cf65b5371d6e5867d07ff679">00882</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#ae97949d9cf65b5371d6e5867d07ff679">PreElim_Columns</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *E,<span class="keywordtype">int</span> *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>,<span class="keywordtype">int</span> *ref,<span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>) {
<a name="l00883"></a>00883
<a name="l00884"></a>00884 <span class="keywordtype">int</span> i,j,l;
<a name="l00885"></a>00885 <a class="code" href="structmatrix.html">Matrix</a> *T;
<a name="l00886"></a>00886
<a name="l00887"></a>00887 <span class="comment">/* find which columns to eliminate */</span>
<a name="l00888"></a>00888 <span class="comment">/* p contains, for each line in E, the column to eliminate */</span>
<a name="l00889"></a>00889 <span class="comment">/* (i.e. the corresponding parameter index to eliminate) */</span>
<a name="l00890"></a>00890 <span class="comment">/* 0 <= i <= E->NbEq, and 1 <= p[i] <= E->Dimension */</span>
<a name="l00891"></a>00891 memset(p,0,<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*(E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>));
<a name="l00892"></a>00892
<a name="l00893"></a>00893 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00894"></a>00894 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\n\nPreElim_Columns starting\n"</span>);
<a name="l00895"></a>00895 fprintf(stderr,<span class="stringliteral">"E =\n"</span>);
<a name="l00896"></a>00896 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,E);
<a name="l00897"></a>00897 <span class="preprocessor">#endif</span>
<a name="l00898"></a>00898 <span class="preprocessor"></span>
<a name="l00899"></a>00899 <span class="keywordflow">for</span>(l=0;l<E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>;++l) {
<a name="l00900"></a>00900 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(E-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][0])) {
<a name="l00901"></a>00901 fprintf(stderr,<span class="stringliteral">"Internal error: Elim_Columns (polyparam.c), expecting equalities first in E.\n"</span>);
<a name="l00902"></a>00902 free(p);
<a name="l00903"></a>00903 <span class="keywordflow">return</span>(NULL);
<a name="l00904"></a>00904 }
<a name="l00905"></a>00905 <span class="keywordflow">for</span>(i=1;<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(E-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][i]);++i) {
<a name="l00906"></a>00906 <span class="keywordflow">if</span>(i==E-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1) {
<a name="l00907"></a>00907 fprintf(stderr,<span class="stringliteral">"Internal error: Elim_Columns (polyparam.c), expecting non-empty constraint in E.\n"</span>);
<a name="l00908"></a>00908 free(p);
<a name="l00909"></a>00909 <span class="keywordflow">return</span>( NULL );
<a name="l00910"></a>00910 }
<a name="l00911"></a>00911 }
<a name="l00912"></a>00912 p[l] = i;
<a name="l00913"></a>00913
<a name="l00914"></a>00914 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00915"></a>00915 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"p[%d] = %d,"</span>,l,p[l]);
<a name="l00916"></a>00916 <span class="preprocessor">#endif</span>
<a name="l00917"></a>00917 <span class="preprocessor"></span> }
<a name="l00918"></a>00918
<a name="l00919"></a>00919 <span class="comment">/* Reference vector: column ref[i] in A corresponds to column i in M */</span>
<a name="l00920"></a>00920 <span class="keywordflow">for</span>(i=0;i<E-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2-E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>;++i) {
<a name="l00921"></a>00921 ref[i]=i;
<a name="l00922"></a>00922 <span class="keywordflow">for</span>(j=0;j<E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>;++j)
<a name="l00923"></a>00923 <span class="keywordflow">if</span>(p[j]<=ref[i])
<a name="l00924"></a>00924 ref[i]++;
<a name="l00925"></a>00925
<a name="l00926"></a>00926 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00927"></a>00927 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"ref[%d] = %d,"</span>,i,ref[i]);
<a name="l00928"></a>00928 <span class="preprocessor">#endif</span>
<a name="l00929"></a>00929 <span class="preprocessor"></span> }
<a name="l00930"></a>00930
<a name="l00931"></a>00931 <span class="comment">/* Size of T : phdim-nbEq * phdim */</span>
<a name="l00932"></a>00932 T = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(m+1-E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>,m+1);
<a name="l00933"></a>00933 <span class="keywordflow">for</span>(i=0;i<T-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;i++)
<a name="l00934"></a>00934 <span class="keywordflow">for</span>(j=0;j<T-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;j++)
<a name="l00935"></a>00935 <span class="keywordflow">if</span>(ref[E-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-m+j+1] == E-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-m+i+1)
<a name="l00936"></a>00936 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(T-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],1);
<a name="l00937"></a>00937 <span class="keywordflow">else</span>
<a name="l00938"></a>00938 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(T-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],0);
<a name="l00939"></a>00939
<a name="l00940"></a>00940 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00941"></a>00941 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\nTransMatrix =\n"</span>);
<a name="l00942"></a>00942 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,T);
<a name="l00943"></a>00943 <span class="preprocessor">#endif</span>
<a name="l00944"></a>00944 <span class="preprocessor"></span>
<a name="l00945"></a>00945 <span class="keywordflow">return</span>(T);
<a name="l00946"></a>00946
<a name="l00947"></a>00947 } <span class="comment">/* PreElim_Columns */</span>
<a name="l00948"></a>00948
<a name="l00949"></a>00949 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00950"></a>00950 <span class="comment">/* Elim_Columns */</span>
<a name="l00951"></a>00951 <span class="comment">/* Eliminate columns from A, using the equalities in E. */</span>
<a name="l00952"></a>00952 <span class="comment">/* ref and p are precalculated by PreElim_Columns, using E; */</span>
<a name="l00953"></a>00953 <span class="comment">/* these two vectors are used to construct the new constraint matrix */</span>
<a name="l00954"></a>00954 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l00955"></a><a class="code" href="polyparam_8c.html#a9fcc2f1ba720686b96fea8e1a6b25278">00955</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#a9fcc2f1ba720686b96fea8e1a6b25278">Elim_Columns</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *A,<a class="code" href="structpolyhedron.html">Polyhedron</a> *E,<span class="keywordtype">int</span> *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>,<span class="keywordtype">int</span> *ref) {
<a name="l00956"></a>00956
<a name="l00957"></a>00957 <span class="keywordtype">int</span> i,l,c;
<a name="l00958"></a>00958 <a class="code" href="structmatrix.html">Matrix</a> *M, *C;
<a name="l00959"></a>00959 <a class="code" href="structpolyhedron.html">Polyhedron</a> *R;
<a name="l00960"></a>00960 Value tmp1,tmp2;
<a name="l00961"></a>00961
<a name="l00962"></a>00962 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l00963"></a>00963 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp1); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp2);
<a name="l00964"></a>00964
<a name="l00965"></a>00965 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00966"></a>00966 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\nElim_Columns starting\n"</span>);
<a name="l00967"></a>00967 fprintf(stderr,<span class="stringliteral">"A =\n"</span> );
<a name="l00968"></a>00968 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,A);
<a name="l00969"></a>00969 <span class="preprocessor">#endif</span>
<a name="l00970"></a>00970 <span class="preprocessor"></span>
<a name="l00971"></a>00971 <span class="comment">/* Builds M = constraint matrix of A, useless columns zeroed */</span>
<a name="l00972"></a>00972 M = <a class="code" href="polyhedron_8c.html#a69417a994cd682d0c391ecff6d223cd2">Polyhedron2Constraints</a>(A);
<a name="l00973"></a>00973 <span class="keywordflow">for</span>(l=0;l<E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>;++l) {
<a name="l00974"></a>00974 <span class="keywordflow">for</span>(c=0;c<M-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++c) {
<a name="l00975"></a>00975 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[c][p[l]])) {
<a name="l00976"></a>00976
<a name="l00977"></a>00977 <span class="comment">/* A parameter to eliminate here ! */</span>
<a name="l00978"></a>00978 <span class="keywordflow">for</span>(i=1;i<M-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;++i) {
<a name="l00979"></a>00979 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(tmp1,M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[c][i],E-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][p[l]]);
<a name="l00980"></a>00980 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(tmp2,E-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][i],M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[c][p[l]]);
<a name="l00981"></a>00981 <a class="code" href="source_2arith_2arithmetique_8h.html#ae92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[c][i],tmp1,tmp2);
<a name="l00982"></a>00982 }
<a name="l00983"></a>00983 }
<a name="l00984"></a>00984 }
<a name="l00985"></a>00985 }
<a name="l00986"></a>00986
<a name="l00987"></a>00987 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l00988"></a>00988 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\nElim_Columns after zeroing columns of A.\n"</span>);
<a name="l00989"></a>00989 fprintf(stderr,<span class="stringliteral">"M =\n"</span>);
<a name="l00990"></a>00990 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,M);
<a name="l00991"></a>00991 <span class="preprocessor">#endif</span>
<a name="l00992"></a>00992 <span class="preprocessor"></span>
<a name="l00993"></a>00993 <span class="comment">/* Builds C = constraint matrix, useless columns eliminated */</span>
<a name="l00994"></a>00994 C = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(M-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>,M-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a> - E-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>);
<a name="l00995"></a>00995 <span class="keywordflow">for</span>(l=0;l<C-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++l)
<a name="l00996"></a>00996 <span class="keywordflow">for</span>(c=0;c<C-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;++c) {
<a name="l00997"></a>00997 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(C-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][c],M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][ref[c]]);
<a name="l00998"></a>00998 }
<a name="l00999"></a>00999
<a name="l01000"></a>01000 <span class="preprocessor">#ifdef DEBUGPP32</span>
<a name="l01001"></a>01001 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\nElim_Columns after eliminating columns of A.\n"</span>);
<a name="l01002"></a>01002 fprintf(stderr,<span class="stringliteral">"C =\n"</span>);
<a name="l01003"></a>01003 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,C);
<a name="l01004"></a>01004 <span class="preprocessor">#endif</span>
<a name="l01005"></a>01005 <span class="preprocessor"></span>
<a name="l01006"></a>01006 R = <a class="code" href="polyhedron_8c.html#aefb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(C,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01007"></a>01007 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(C);
<a name="l01008"></a>01008 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01009"></a>01009 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp1); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp2);
<a name="l01010"></a>01010 <span class="keywordflow">return</span>(R);
<a name="l01011"></a>01011 } <span class="comment">/* Elim_Columns */</span>
<a name="l01012"></a>01012
<a name="l01013"></a>01013
<a name="l01014"></a><a class="code" href="polyparam_8c.html#a93dc57288d6c3b4166bc0b52b6b374e2">01014</a> <span class="keyword">static</span> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#a93dc57288d6c3b4166bc0b52b6b374e2">Recession_Cone</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *P, <span class="keywordtype">unsigned</span> nvar, <span class="keywordtype">unsigned</span> MaxRays)
<a name="l01015"></a>01015 {
<a name="l01016"></a>01016 <span class="keywordtype">int</span> i;
<a name="l01017"></a>01017 <a class="code" href="structmatrix.html">Matrix</a> *M = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(P-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>, 1 + nvar + 1);
<a name="l01018"></a>01018 <a class="code" href="structpolyhedron.html">Polyhedron</a> *R;
<a name="l01019"></a>01019 <span class="keywordflow">for</span> (i = 0; i < P-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; ++i)
<a name="l01020"></a>01020 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(P-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i], M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i], 1+nvar);
<a name="l01021"></a>01021 R = <a class="code" href="polyhedron_8c.html#aefb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(M, MaxRays);
<a name="l01022"></a>01022 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01023"></a>01023 <span class="keywordflow">return</span> R;
<a name="l01024"></a>01024 }
<a name="l01025"></a>01025
<a name="l01026"></a>01026 <span class="comment">/* Compute lines/unidirectional rays of the (non parametric) polyhedron */</span>
<a name="l01027"></a>01027 <span class="comment">/* Input :</span>
<a name="l01028"></a>01028 <span class="comment"> * D1 : combined polyhedron,</span>
<a name="l01029"></a>01029 <span class="comment"> * Output :</span>
<a name="l01030"></a>01030 <span class="comment"> * Rays : non parametric ray matrix</span>
<a name="l01031"></a>01031 <span class="comment"> * return value : number of lines</span>
<a name="l01032"></a>01032 <span class="comment"> */</span>
<a name="l01033"></a><a class="code" href="polyparam_8c.html#a42014041fd15492ef6ea79f493e7ec30">01033</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a42014041fd15492ef6ea79f493e7ec30">ComputeNPLinesRays</a>(<span class="keywordtype">int</span> <a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>, <a class="code" href="structpolyhedron.html">Polyhedron</a> *D1, <a class="code" href="structmatrix.html">Matrix</a> **Rays)
<a name="l01034"></a>01034 {
<a name="l01035"></a>01035 <span class="keywordtype">int</span> i, j, nbr, dimfaces;
<a name="l01036"></a>01036 <a class="code" href="structpolyhedron.html">Polyhedron</a> *RC; <span class="comment">/* Recession Cone */</span>
<a name="l01037"></a>01037
<a name="l01038"></a>01038 RC = <a class="code" href="polyparam_8c.html#a93dc57288d6c3b4166bc0b52b6b374e2">Recession_Cone</a>(D1, n, <a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01039"></a>01039
<a name="l01040"></a>01040 <span class="comment">/* get the rays/lines from RC */</span>
<a name="l01041"></a>01041 nbr = 0;
<a name="l01042"></a>01042 <span class="keywordflow">for</span> (i = 0; i < RC-><a class="code" href="structpolyhedron.html#a74cba037f5ac1c7182bf960d79d3f124">NbRays</a> ;i++)
<a name="l01043"></a>01043 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(RC-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][n+1]))
<a name="l01044"></a>01044 nbr++;
<a name="l01045"></a>01045 *Rays=<a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nbr, n+2);
<a name="l01046"></a>01046 <span class="keywordflow">for</span> (i = 0, j = 0; j < nbr ;i++)
<a name="l01047"></a>01047 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#a827532f2140ae2aa96e46baebae09723">value_zero_p</a>(RC-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i][n+1]))
<a name="l01048"></a>01048 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(RC-><a class="code" href="structpolyhedron.html#a1332db86327e189effc8798ab230f36a">Ray</a>[i], (*Rays)->p[j++], n+2);
<a name="l01049"></a>01049
<a name="l01050"></a>01050 dimfaces = RC-><a class="code" href="structpolyhedron.html#a9e7c80deeddf472a57bd54217f75c717">NbBid</a>;
<a name="l01051"></a>01051 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(RC);
<a name="l01052"></a>01052
<a name="l01053"></a>01053 <span class="preprocessor">#ifdef DEBUGPP31</span>
<a name="l01054"></a>01054 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"Rays = "</span>);
<a name="l01055"></a>01055 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr, <a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, *Rays);
<a name="l01056"></a>01056 fprintf(stderr, <span class="stringliteral">"dimfaces = %d\n"</span>, dimfaces);
<a name="l01057"></a>01057 <span class="preprocessor">#endif</span>
<a name="l01058"></a>01058 <span class="preprocessor"></span>
<a name="l01059"></a>01059 <span class="keywordflow">return</span> dimfaces;
<a name="l01060"></a>01060 }
<a name="l01061"></a>01061
<a name="l01062"></a>01062 <span class="comment">/* </span>
<a name="l01063"></a>01063 <span class="comment"> * Given a polyhedron 'Di' in combined data and parameter space and a context </span>
<a name="l01064"></a>01064 <span class="comment"> * polyhedron 'C' representing the constraints on the parameter space, create</span>
<a name="l01065"></a>01065 <span class="comment"> * a list of parameterized vertices and assign values to global variables: </span>
<a name="l01066"></a>01066 <span class="comment"> * m,n,ws,Sat,egalite,mf,Xi,Pi,PiInv,RaysDi,CEqualities. </span>
<a name="l01067"></a>01067 <span class="comment"> */</span>
<a name="l01068"></a><a class="code" href="polyparam_8c.html#a2058929b5ad7772d9e28faae3069bf04">01068</a> <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *<a class="code" href="polyparam_8c.html#a2058929b5ad7772d9e28faae3069bf04">Find_m_faces</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> **Di,<a class="code" href="structpolyhedron.html">Polyhedron</a> *C,<span class="keywordtype">int</span> keep_dom,<span class="keywordtype">int</span> working_space,<a class="code" href="structpolyhedron.html">Polyhedron</a> **CEq,<a class="code" href="structmatrix.html">Matrix</a> **CT) {
<a name="l01069"></a>01069
<a name="l01070"></a>01070 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *mf;
<a name="l01071"></a>01071 <span class="keywordtype">int</span> i, j, dimfaces;
<a name="l01072"></a>01072 <a class="code" href="structpolyhedron.html">Polyhedron</a> *D=*Di,
<a name="l01073"></a>01073 *C1, <span class="comment">/* true context */</span>
<a name="l01074"></a>01074 *D1; <span class="comment">/* the combined polyhedron, including context C */</span>
<a name="l01075"></a>01075 <a class="code" href="structmatrix.html">Matrix</a> *Rays, <span class="comment">/* lines/rays (non parametric) */</span>
<a name="l01076"></a>01076 *M;
<a name="l01077"></a>01077 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *res;
<a name="l01078"></a>01078 <span class="keywordtype">int</span> *<a class="code" href="vector_8c.html#aa45b2e3dcf291527c5aedc420819adfc">p</a>, *ref;
<a name="l01079"></a>01079
<a name="l01080"></a>01080 CEqualities = NULL;
<a name="l01081"></a>01081
<a name="l01082"></a>01082 <span class="keywordflow">if</span>(CT) {
<a name="l01083"></a>01083 *CEq = NULL;
<a name="l01084"></a>01084 *CT = NULL;
<a name="l01085"></a>01085 }
<a name="l01086"></a>01086
<a name="l01087"></a>01087 <span class="keywordflow">if</span>(!D || !C)
<a name="l01088"></a>01088 <span class="keywordflow">return</span> (<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *) 0;
<a name="l01089"></a>01089
<a name="l01090"></a>01090 <a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a> = working_space;
<a name="l01091"></a>01091 <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a> = C-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l01092"></a>01092 <a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a> = D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> - <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>;
<a name="l01093"></a>01093 <span class="keywordflow">if</span>(<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a><0) {
<a name="l01094"></a>01094 fprintf(stderr,
<a name="l01095"></a>01095 <span class="stringliteral">"Find_m_faces: ?%d parameters of a %d-polyhedron !\n"</span>,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>,<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>);
<a name="l01096"></a>01096 <span class="keywordflow">return</span> (<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *) 0;
<a name="l01097"></a>01097 }
<a name="l01098"></a>01098 <span class="keywordflow">if</span> (<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>==0)
<a name="l01099"></a>01099 <span class="keywordflow">return</span> <a class="code" href="polyparam_8c.html#ad694b78f831d141b6126e858d7b8b11a">GenParamPolyhedron</a>(D,<a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(0,2));
<a name="l01100"></a>01100
<a name="l01101"></a>01101 <span class="comment">/* Add constraints from Context to D -> result in D1 */</span>
<a name="l01102"></a>01102 C1 = <a class="code" href="polyhedron_8c.html#affd77db2a2f748d557ab6be0fcede209">align_context</a>(C,D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01103"></a>01103
<a name="l01104"></a>01104 <span class="preprocessor">#ifdef DEBUGPP31</span>
<a name="l01105"></a>01105 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"m = %d\n"</span>,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>);
<a name="l01106"></a>01106 fprintf(stderr, <span class="stringliteral">"D = "</span>);
<a name="l01107"></a>01107 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,D);
<a name="l01108"></a>01108 fprintf(stderr,<span class="stringliteral">"C1 = "</span>);
<a name="l01109"></a>01109 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,C1);
<a name="l01110"></a>01110 <span class="preprocessor">#endif</span>
<a name="l01111"></a>01111 <span class="preprocessor"></span>
<a name="l01112"></a>01112 D1 = <a class="code" href="polyhedron_8c.html#ac5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(D,C1,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01113"></a>01113
<a name="l01114"></a>01114 <span class="preprocessor">#ifdef DEBUGPP31</span>
<a name="l01115"></a>01115 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"D1 = "</span>);
<a name="l01116"></a>01116 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,D1);
<a name="l01117"></a>01117 <span class="preprocessor">#endif</span>
<a name="l01118"></a>01118 <span class="preprocessor"></span>
<a name="l01119"></a>01119 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(C1);
<a name="l01120"></a>01120
<a name="l01121"></a>01121 <span class="keywordflow">if</span> (!D1)
<a name="l01122"></a>01122 <span class="keywordflow">return</span>(NULL);
<a name="l01123"></a>01123 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(D1)) {
<a name="l01124"></a>01124 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(D1);
<a name="l01125"></a>01125 <span class="keywordflow">return</span>(NULL);
<a name="l01126"></a>01126 }
<a name="l01127"></a>01127
<a name="l01128"></a>01128 <span class="comment">/* Compute the true context C1 */</span>
<a name="l01129"></a>01129 <span class="comment">/* M : lines in the direction of the first n indices (index space) */</span>
<a name="l01130"></a>01130 M = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>, D1->Dimension+2);
<a name="l01131"></a>01131 <span class="keywordflow">for</span> (i=0; i<<a class="code" href="polyparam_8c.html#a76f11d9a0a47b94f72c2d0e77fb32240">n</a>; i++)
<a name="l01132"></a>01132 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i+1],1);
<a name="l01133"></a>01133 C1 = <a class="code" href="polyhedron_8c.html#a5ac0337f8a955ee77d5414761f3d41bb">DomainAddRays</a>(D1,M,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01134"></a>01134 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01135"></a>01135
<a name="l01136"></a>01136 <span class="preprocessor">#ifdef DEBUGPP31</span>
<a name="l01137"></a>01137 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"True context C1 = "</span>);
<a name="l01138"></a>01138 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,C1);
<a name="l01139"></a>01139 <span class="preprocessor">#endif</span>
<a name="l01140"></a>01140 <span class="preprocessor"></span>
<a name="l01141"></a>01141 dimfaces = <a class="code" href="polyparam_8c.html#a42014041fd15492ef6ea79f493e7ec30">ComputeNPLinesRays</a>(n, D1, &Rays);
<a name="l01142"></a>01142
<a name="l01143"></a>01143 <span class="comment">/* CEqualities contains the constraints (to be added again later) */</span>
<a name="l01144"></a>01144 <span class="comment">/* *CT is the transformation matrix to add the removed parameters */</span>
<a name="l01145"></a>01145 <span class="keywordflow">if</span>(!CT) {
<a name="l01146"></a>01146 <span class="keywordflow">if</span> (C1->NbEq == 0) {
<a name="l01147"></a>01147 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(C1);
<a name="l01148"></a>01148 C1 = NULL;
<a name="l01149"></a>01149 } <span class="keywordflow">else</span> {
<a name="l01150"></a>01150 <a class="code" href="structpolyhedron.html">Polyhedron</a> *CEq1, <span class="comment">/* CEqualities, in homogeneous dim */</span>
<a name="l01151"></a>01151 *D2; <span class="comment">/* D1, (temporary) simplified */</span>
<a name="l01152"></a>01152
<a name="l01153"></a>01153 <span class="comment">/* Remove equalities from true context C1 and from D1 */</span>
<a name="l01154"></a>01154 <span class="comment">/* Compute CEqualities = matrix of equalities in C1, projected in */</span>
<a name="l01155"></a>01155 <span class="comment">/* the parameter space */</span>
<a name="l01156"></a>01156 M = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(C1->NbEq,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+2);
<a name="l01157"></a>01157 <span class="keywordflow">for</span>(j=0,i=0;i<C1->NbEq;++i,++j) {
<a name="l01158"></a>01158 <span class="keywordflow">while</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(C1->Constraint[j][0]))
<a name="l01159"></a>01159 ++j;
<a name="l01160"></a>01160 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][0],C1->Constraint[j][0]);
<a name="l01161"></a>01161 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(&C1->Constraint[j][D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1],&M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][1],(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1));
<a name="l01162"></a>01162 }
<a name="l01163"></a>01163 CEqualities = <a class="code" href="polyhedron_8c.html#aefb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(M,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01164"></a>01164 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01165"></a>01165 CEq1 = <a class="code" href="polyhedron_8c.html#affd77db2a2f748d557ab6be0fcede209">align_context</a>(CEqualities,D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01166"></a>01166
<a name="l01167"></a>01167 <span class="comment">/* Simplify D1 and C1 (remove the equalities) */</span>
<a name="l01168"></a>01168 D2 = <a class="code" href="polyhedron_8c.html#a5fe8c61eb1dddc73783aad88c76ce758">DomainSimplify</a>(D1,CEq1,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01169"></a>01169 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(D1);
<a name="l01170"></a>01170 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(C1);
<a name="l01171"></a>01171 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(CEq1);
<a name="l01172"></a>01172 D1 = D2;
<a name="l01173"></a>01173 C1 = NULL;
<a name="l01174"></a>01174 }
<a name="l01175"></a>01175 }
<a name="l01176"></a>01176 <span class="keywordflow">else</span> { <span class="comment">/* if( CT ) */</span>
<a name="l01177"></a>01177 <a class="code" href="structpolyhedron.html">Polyhedron</a> *CEq1, <span class="comment">/* CEqualities */</span>
<a name="l01178"></a>01178 *D2; <span class="comment">/* D1, (temporary) simplified */</span>
<a name="l01179"></a>01179
<a name="l01180"></a>01180 <span class="comment">/* Suppress all useless constraints in parameter domain */</span>
<a name="l01181"></a>01181 <span class="comment">/* when CT is not NULL (ehrhart) */</span>
<a name="l01182"></a>01182 <span class="comment">/* Vin100, march 01 */</span>
<a name="l01183"></a>01183 CEq1 = C1;
<a name="l01184"></a>01184 M = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(C1->NbConstraints,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+2);
<a name="l01185"></a>01185 <span class="keywordflow">for</span>(i=0;i<C1->NbConstraints;++i) {
<a name="l01186"></a>01186 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][0],C1->Constraint[i][0]);
<a name="l01187"></a>01187 <a class="code" href="vector_8c.html#ab6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(&C1->Constraint[i][D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1],&M-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][1],(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1));
<a name="l01188"></a>01188 }
<a name="l01189"></a>01189 CEqualities = <a class="code" href="polyhedron_8c.html#aefb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>( M, <a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a> );
<a name="l01190"></a>01190 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01191"></a>01191
<a name="l01192"></a>01192 D2 = <a class="code" href="polyhedron_8c.html#a5fe8c61eb1dddc73783aad88c76ce758">DomainSimplify</a>(D1,CEq1,<a class="code" href="polyparam_8c.html#a4ce1d90e1286c970cb521bd2c85a42be">ws</a>);
<a name="l01193"></a>01193 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(D1);
<a name="l01194"></a>01194 D1 = D2;
<a name="l01195"></a>01195 C1 = <a class="code" href="polyhedron_8c.html#a832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(D2-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>);
<a name="l01196"></a>01196
<a name="l01197"></a>01197 <span class="comment">/* if CT is not NULL, the constraints are eliminated */</span>
<a name="l01198"></a>01198 <span class="comment">/* *CT will contain the transformation matrix to come back to the */</span>
<a name="l01199"></a>01199 <span class="comment">/* original dimension (for a polyhedron, in the parameter space) */</span>
<a name="l01200"></a>01200 <span class="keywordflow">if</span>( CEq1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a> )
<a name="l01201"></a>01201 {
<a name="l01202"></a>01202 <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a> -= CEq1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>;
<a name="l01203"></a>01203 p = (<span class="keywordtype">int</span> *)malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*(CEq1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>));
<a name="l01204"></a>01204 }
<a name="l01205"></a>01205 <span class="keywordflow">else</span>
<a name="l01206"></a>01206 p = NULL;
<a name="l01207"></a>01207 ref = (<span class="keywordtype">int</span>*) malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*
<a name="l01208"></a>01208 (CEq1-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2-CEq1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>));
<a name="l01209"></a>01209 *CT = <a class="code" href="polyparam_8c.html#ae97949d9cf65b5371d6e5867d07ff679">PreElim_Columns</a>(CEq1,p,ref,CEqualities-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>);
<a name="l01210"></a>01210 D2 = <a class="code" href="polyparam_8c.html#a9fcc2f1ba720686b96fea8e1a6b25278">Elim_Columns</a>(D1,CEq1,p,ref);
<a name="l01211"></a>01211 <span class="keywordflow">if</span> (p)
<a name="l01212"></a>01212 free(p);
<a name="l01213"></a>01213 free(ref);
<a name="l01214"></a>01214
<a name="l01215"></a>01215 <span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l01216"></a>01216 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"D2\t Dim = %3d\tNbEq = %3d\tLines = %3d\n"</span>,
<a name="l01217"></a>01217 D2-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>,D2-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>,D2-><a class="code" href="structpolyhedron.html#a9e7c80deeddf472a57bd54217f75c717">NbBid</a>);
<a name="l01218"></a>01218 C2 = <a class="code" href="polyparam_8c.html#a9fcc2f1ba720686b96fea8e1a6b25278">Elim_Columns</a>(C1,CEq1,p,ref);
<a name="l01219"></a>01219 fprintf(stderr,<span class="stringliteral">"C2\t Dim = %3d\tNbEq = %3d\tLines = %3d\n"</span>,
<a name="l01220"></a>01220 C2->Dimension,C2->NbEq,C2->NbBid);
<a name="l01221"></a>01221 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(C2);
<a name="l01222"></a>01222 <span class="preprocessor">#endif</span>
<a name="l01223"></a>01223 <span class="preprocessor"></span>
<a name="l01224"></a>01224 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(D1);
<a name="l01225"></a>01225 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(C1);
<a name="l01226"></a>01226 D1 = D2;
<a name="l01227"></a>01227 C1 = NULL;
<a name="l01228"></a>01228 *CEq = CEqualities;
<a name="l01229"></a>01229
<a name="l01230"></a>01230 <span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l01231"></a>01231 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Polyhedron CEq = "</span>);
<a name="l01232"></a>01232 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,*CEq);
<a name="l01233"></a>01233 fprintf(stderr,<span class="stringliteral">"Matrix CT = "</span>);
<a name="l01234"></a>01234 <a class="code" href="matrix_8c.html#ad4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,*CT);
<a name="l01235"></a>01235 <span class="preprocessor">#endif</span>
<a name="l01236"></a>01236 <span class="preprocessor"></span>
<a name="l01237"></a>01237 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(CEq1);
<a name="l01238"></a>01238 CEqualities = NULL; <span class="comment">/* don't simplify ! */</span>
<a name="l01239"></a>01239
<a name="l01240"></a>01240 <span class="comment">/* m changed !!! */</span>
<a name="l01241"></a>01241 <span class="keywordflow">if</span>(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>==0) {
<a name="l01242"></a>01242 <span class="comment">/* return the new D1 too */</span>
<a name="l01243"></a>01243 *Di = D1;
<a name="l01244"></a>01244
<a name="l01245"></a>01245 <span class="keywordflow">return</span> <a class="code" href="polyparam_8c.html#ad694b78f831d141b6126e858d7b8b11a">GenParamPolyhedron</a>(D1, Rays);
<a name="l01246"></a>01246 }
<a name="l01247"></a>01247 }
<a name="l01248"></a>01248
<a name="l01249"></a>01249 <span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l01250"></a>01250 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Polyhedron D1 (D AND C) = "</span>);
<a name="l01251"></a>01251 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, D1);
<a name="l01252"></a>01252 fprintf(stderr,<span class="stringliteral">"Polyhedron CEqualities = "</span>);
<a name="l01253"></a>01253 <span class="keywordflow">if</span>(CEqualities) <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, CEqualities);
<a name="l01254"></a>01254 <span class="keywordflow">else</span> fprintf(stderr,<span class="stringliteral">"NULL\n"</span>);
<a name="l01255"></a>01255 <span class="preprocessor">#endif</span>
<a name="l01256"></a>01256 <span class="preprocessor"></span>
<a name="l01257"></a>01257 <a class="code" href="polyparam_8c.html#afeb763676895f49e165f3b279c9aa946">KD</a> = keep_dom;
<a name="l01258"></a>01258 PDomains = NULL;
<a name="l01259"></a>01259 PV_Result = NULL;
<a name="l01260"></a>01260 <a class="code" href="polyparam_8c.html#a135433bf69beff8673f093340cbe29be">nbPV</a> = 0;
<a name="l01261"></a>01261
<a name="l01262"></a>01262 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(D1)) {
<a name="l01263"></a>01263 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(D1);
<a name="l01264"></a>01264 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Rays);
<a name="l01265"></a>01265 <span class="keywordflow">return</span> NULL;
<a name="l01266"></a>01266 }
<a name="l01267"></a>01267
<a name="l01268"></a>01268 <span class="comment">/* mf : a bit array indicating which rays are part of the m-face */</span>
<a name="l01269"></a>01269 <span class="comment">/* Poly2Sat initializes mf to all ones */</span>
<a name="l01270"></a>01270 <span class="comment">/* set global variable nr to size (number of words) of mf */</span>
<a name="l01271"></a>01271 Sat = <a class="code" href="polyparam_8c.html#abe53dff202dab1fd41e7dcc035d12562">Poly2Sat</a>(D1,&mf);
<a name="l01272"></a>01272
<a name="l01273"></a>01273 <span class="preprocessor">#ifdef DEBUGPP4</span>
<a name="l01274"></a>01274 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Sat = "</span>);
<a name="l01275"></a>01275 <a class="code" href="polyparam_8c.html#ae7ab7efd2892ac6c61e2acc8f1142f1c">SMPrint</a>(Sat);
<a name="l01276"></a>01276
<a name="l01277"></a>01277 fprintf(stderr,<span class="stringliteral">"mf = "</span>);
<a name="l01278"></a>01278 <span class="keywordflow">for</span> (i=0; i<<a class="code" href="polyparam_8c.html#a2833bf188e6bf292fa7d61e2dd54d622">nr</a>; i++)
<a name="l01279"></a>01279 fprintf(stderr,<span class="stringliteral">"%08X"</span>, mf[i]);
<a name="l01280"></a>01280 fprintf(stderr, <span class="stringliteral">"\n"</span>);
<a name="l01281"></a>01281 <span class="preprocessor">#endif</span>
<a name="l01282"></a>01282 <span class="preprocessor"></span>
<a name="l01283"></a>01283 <span class="comment">/* A boolean array saying which constraints are part of the m-face */</span>
<a name="l01284"></a>01284 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a> = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*D1->NbConstraints);
<a name="l01285"></a>01285 memset(<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>,0, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*D1->NbConstraints);
<a name="l01286"></a>01286
<a name="l01287"></a>01287 <span class="keywordflow">for</span> (i=0; i<D1->NbEq; i++)
<a name="l01288"></a>01288 <a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>[i] = 1;
<a name="l01289"></a>01289
<a name="l01290"></a>01290 Xi = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(n+1,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1);
<a name="l01291"></a>01291 Pi = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1);
<a name="l01292"></a>01292 PiTest = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1);
<a name="l01293"></a>01293 CTest = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1,D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>);
<a name="l01294"></a>01294 PiInv = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+1,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+2);
<a name="l01295"></a>01295 RaysDi = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(D1->NbRays,<a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>+2);
<a name="l01296"></a>01296 <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a> = <a class="code" href="polyparam_8c.html#a742204794ea328ba293fe59cec79b990">m</a>;
<a name="l01297"></a>01297
<a name="l01298"></a>01298 <span class="comment">/* m_dim has to be increased by the dimension of the smallest faces</span>
<a name="l01299"></a>01299 <span class="comment"> * of the (non parametric) polyhedron</span>
<a name="l01300"></a>01300 <span class="comment"> */</span>
<a name="l01301"></a>01301 <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a> += dimfaces;
<a name="l01302"></a>01302
<a name="l01303"></a>01303 <span class="comment">/* if the smallest face is of smaller dimension than m_dim,</span>
<a name="l01304"></a>01304 <span class="comment"> * then increase m_dim (I think this should never happen --Vincent)</span>
<a name="l01305"></a>01305 <span class="comment"> */</span>
<a name="l01306"></a>01306 <span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l01307"></a>01307 <span class="preprocessor"></span> <span class="keywordflow">if</span> (m_dim < D1->NbBid)
<a name="l01308"></a>01308 fprintf(stderr, <span class="stringliteral">"m_dim (%d) < D1->NbBid (%d)\n"</span>, <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a>, D1->NbBid );
<a name="l01309"></a>01309 <span class="preprocessor">#endif</span>
<a name="l01310"></a>01310 <span class="preprocessor"></span> <span class="keywordflow">if</span> (m_dim < D1->NbBid)
<a name="l01311"></a>01311 <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a> = D1->NbBid;
<a name="l01312"></a>01312
<a name="l01313"></a>01313 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01314"></a>01314 <span class="preprocessor"></span> nbfaces=0;
<a name="l01315"></a>01315 <span class="preprocessor">#endif</span>
<a name="l01316"></a>01316 <span class="preprocessor"></span><span class="preprocessor">#ifdef DEBUGPP3</span>
<a name="l01317"></a>01317 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"m_dim = %d\n"</span>, <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a>);
<a name="l01318"></a>01318 fprintf(stderr,
<a name="l01319"></a>01319 <span class="stringliteral">"Target: find faces that saturate %d constraints and %d rays/lines\n"</span>,
<a name="l01320"></a>01320 D1->Dimension - <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a>,<a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a>+1);
<a name="l01321"></a>01321 <span class="preprocessor">#endif</span>
<a name="l01322"></a>01322 <span class="preprocessor"></span>
<a name="l01323"></a>01323 <span class="comment">/* D1->NbEq constraints already saturated ! */</span>
<a name="l01324"></a>01324 <a class="code" href="polyparam_8c.html#ada73886adcb8cc6d3e6f42555ed64689">scan_m_face</a>(D1->NbEq,(D1->Dimension - <a class="code" href="polyparam_8c.html#a2cddab0fbe7ba3462be7da14b8cd8817">m_dim</a> - D1->NbEq),D1,mf);
<a name="l01325"></a>01325
<a name="l01326"></a>01326 <span class="comment">/* pos, number of constraints needed */</span>
<a name="l01327"></a>01327
<a name="l01328"></a>01328 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01329"></a>01329 <span class="preprocessor"></span> fprintf( stderr, <span class="stringliteral">"Number of m-faces: %d\n"</span>, nbfaces );
<a name="l01330"></a>01330 <span class="preprocessor">#endif</span>
<a name="l01331"></a>01331 <span class="preprocessor"></span>
<a name="l01332"></a>01332 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(RaysDi);
<a name="l01333"></a>01333 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(PiInv);
<a name="l01334"></a>01334 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(PiTest);
<a name="l01335"></a>01335 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(CTest);
<a name="l01336"></a>01336 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Pi);
<a name="l01337"></a>01337 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Xi);
<a name="l01338"></a>01338 free(<a class="code" href="polyparam_8c.html#a783e4d6a48a9aae78a8379ea558d714d">egalite</a>);
<a name="l01339"></a>01339 free(mf);
<a name="l01340"></a>01340 <a class="code" href="polyparam_8c.html#ae775e630ac521bfe434fdf25d937d975">SMFree</a>(Sat);
<a name="l01341"></a>01341
<a name="l01342"></a>01342 <span class="comment">/* if(CEqualities && keep_dom==0) {</span>
<a name="l01343"></a>01343 <span class="comment"> Domain_Free(CEqualities);</span>
<a name="l01344"></a>01344 <span class="comment"> }</span>
<a name="l01345"></a>01345 <span class="comment"> */</span>
<a name="l01346"></a>01346
<a name="l01347"></a>01347 res = (<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *) malloc (<span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a>));
<a name="l01348"></a>01348 res-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a> = <a class="code" href="polyparam_8c.html#a135433bf69beff8673f093340cbe29be">nbPV</a>;
<a name="l01349"></a>01349 res-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a> = PV_Result;
<a name="l01350"></a>01350 res-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a> = PDomains;
<a name="l01351"></a>01351 res-><a class="code" href="struct__Param__Polyhedron.html#ac89157421ffc9312f82b11cb89a05dfe">Constraints</a> = <a class="code" href="polyhedron_8c.html#a69417a994cd682d0c391ecff6d223cd2">Polyhedron2Constraints</a>(D1);
<a name="l01352"></a>01352 res-><a class="code" href="struct__Param__Polyhedron.html#a3daced8ddb352cfa5ed1eeb949f102c5">Rays</a> = Rays;
<a name="l01353"></a>01353
<a name="l01354"></a>01354 <span class="keywordflow">if</span>(CT) <span class="comment">/* return the new D1 too ! */</span>
<a name="l01355"></a>01355 *Di = D1;
<a name="l01356"></a>01356 <span class="keywordflow">else</span>
<a name="l01357"></a>01357 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(D1);
<a name="l01358"></a>01358
<a name="l01359"></a>01359 <span class="keywordflow">return</span>(res);
<a name="l01360"></a>01360 } <span class="comment">/* Find_m_faces */</span>
<a name="l01361"></a>01361
<a name="l01362"></a>01362 <span class="comment">/*</span>
<a name="l01363"></a>01363 <span class="comment"> * Given parametric domain 'PD' and number of parametric vertices 'nb_domains',</span>
<a name="l01364"></a>01364 <span class="comment"> * find the vertices that belong to distinct sub-domains. </span>
<a name="l01365"></a>01365 <span class="comment"> */</span>
<a name="l01366"></a><a class="code" href="polyparam_8h.html#a5b103fb2f86581eaaeba2eb3f567c84c">01366</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a5b103fb2f86581eaaeba2eb3f567c84c">Compute_PDomains</a>(<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *PD,<span class="keywordtype">int</span> nb_domains,<span class="keywordtype">int</span> working_space) {
<a name="l01367"></a>01367
<a name="l01368"></a>01368 <span class="keywordtype">unsigned</span> bx;
<a name="l01369"></a>01369 <span class="keywordtype">int</span> i, ix, nv;
<a name="l01370"></a>01370 <a class="code" href="structpolyhedron.html">Polyhedron</a> *dx, *d1, *d2;
<a name="l01371"></a>01371 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *p1, *p2, *p2prev, *PDNew;
<a name="l01372"></a>01372
<a name="l01373"></a>01373 <span class="keywordflow">if</span> (nb_domains==0) {
<a name="l01374"></a>01374
<a name="l01375"></a>01375 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01376"></a>01376 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"No domains\n"</span>);
<a name="l01377"></a>01377 <span class="preprocessor">#endif</span>
<a name="l01378"></a>01378 <span class="preprocessor"></span>
<a name="l01379"></a>01379 <span class="keywordflow">return</span>;
<a name="l01380"></a>01380 }
<a name="l01381"></a>01381
<a name="l01382"></a>01382 <span class="comment">/* Already filled out by GenParamPolyhedron */</span>
<a name="l01383"></a>01383 <span class="keywordflow">if</span> (!PD-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a> && PD-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>)
<a name="l01384"></a>01384 <span class="keywordflow">return</span>;
<a name="l01385"></a>01385
<a name="l01386"></a>01386 <span class="comment">/* Initialization */</span>
<a name="l01387"></a>01387 nv = (nb_domains - 1)/(8*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)) + 1;
<a name="l01388"></a>01388
<a name="l01389"></a>01389 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01390"></a>01390 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"nv = %d\n"</span>,nv);
<a name="l01391"></a>01391 <span class="preprocessor">#endif</span>
<a name="l01392"></a>01392 <span class="preprocessor"></span>
<a name="l01393"></a>01393 <span class="keywordflow">for</span>(p1=PD,i=0,ix=0,bx=<a class="code" href="types_8h.html#a11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>;p1;p1=p1-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>,i++) {
<a name="l01394"></a>01394
<a name="l01395"></a>01395 <span class="comment">/* Assign a bit array 'p1->F' of suitable size to include the vertices */</span>
<a name="l01396"></a>01396 p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a> = (<span class="keywordtype">unsigned</span> *) malloc (nv * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>));
<a name="l01397"></a>01397
<a name="l01398"></a>01398 <span class="comment">/* Set the bit array to zeros */</span>
<a name="l01399"></a>01399 memset(p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>,0,nv * <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span>));
<a name="l01400"></a>01400 p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[ix] |= bx; <span class="comment">/* Set i'th bit to one */</span>
<a name="l01401"></a>01401 <a class="code" href="types_8h.html#a3dd66db5db700555d4e24314974a2ea1">NEXT</a>(ix, bx);
<a name="l01402"></a>01402 }
<a name="l01403"></a>01403
<a name="l01404"></a>01404 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01405"></a>01405 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"nb of vertices=%d\n"</span>,i);
<a name="l01406"></a>01406 <span class="preprocessor">#endif</span>
<a name="l01407"></a>01407 <span class="preprocessor"></span>
<a name="l01408"></a>01408 <span class="comment">/* Walk the PD list with two pointers */</span>
<a name="l01409"></a>01409 ix = 0; bx=<a class="code" href="types_8h.html#a11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>;
<a name="l01410"></a>01410 <span class="keywordflow">for</span> (p1=PD;p1;p1=p1-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>) {
<a name="l01411"></a>01411 <span class="keywordflow">for</span> (p2prev=p1,p2=p1-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>;p2;p2prev=p2,p2=p2-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>) {
<a name="l01412"></a>01412
<a name="l01413"></a>01413 <span class="comment">/* Find intersection */</span>
<a name="l01414"></a>01414 dx = <a class="code" href="polyparam_8c.html#a6b9861272d427f2ed7767ce9dcf783c7">PDomainIntersection</a>(p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,working_space);
<a name="l01415"></a>01415
<a name="l01416"></a>01416 <span class="keywordflow">if</span> (!dx || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(dx)) {
<a name="l01417"></a>01417
<a name="l01418"></a>01418 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01419"></a>01419 <span class="preprocessor"></span> fprintf( stderr, <span class="stringliteral">"Empty dx (p1 inter p2). Continuing\n"</span>);
<a name="l01420"></a>01420 <span class="preprocessor">#endif</span>
<a name="l01421"></a>01421 <span class="preprocessor"></span> <span class="keywordflow">if</span>(dx)
<a name="l01422"></a>01422 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(dx);
<a name="l01423"></a>01423 <span class="keywordflow">continue</span>;
<a name="l01424"></a>01424 }
<a name="l01425"></a>01425
<a name="l01426"></a>01426 <span class="preprocessor">#ifdef DEBUGPP5 </span>
<a name="l01427"></a>01427 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Begin PDomainDifference\n"</span>);
<a name="l01428"></a>01428 fprintf(stderr, <span class="stringliteral">"p1="</span>);
<a name="l01429"></a>01429 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01430"></a>01430 fprintf(stderr,<span class="stringliteral">"p2="</span>);
<a name="l01431"></a>01431 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01432"></a>01432 <span class="preprocessor">#endif</span>
<a name="l01433"></a>01433 <span class="preprocessor"></span> d1 = <a class="code" href="polyparam_8c.html#ac234c76f3561c8799ddf6ff8de425e1f">PDomainDifference</a>(p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,working_space);
<a name="l01434"></a>01434 d2 = <a class="code" href="polyparam_8c.html#ac234c76f3561c8799ddf6ff8de425e1f">PDomainDifference</a>(p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>,working_space);
<a name="l01435"></a>01435
<a name="l01436"></a>01436 <span class="preprocessor">#ifdef DEBUGPP5 </span>
<a name="l01437"></a>01437 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"p1\\p2="</span>);
<a name="l01438"></a>01438 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,d1);
<a name="l01439"></a>01439 fprintf(stderr,<span class="stringliteral">"p2\\p1="</span>);
<a name="l01440"></a>01440 <a class="code" href="polyhedron_8c.html#ad87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#ae6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,d2);
<a name="l01441"></a>01441 fprintf(stderr,<span class="stringliteral">"END PDomainDifference\n\n"</span>);
<a name="l01442"></a>01442 <span class="preprocessor">#endif</span>
<a name="l01443"></a>01443 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!d1 || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d1) || d1-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>!=0) {
<a name="l01444"></a>01444
<a name="l01445"></a>01445 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01446"></a>01446 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Empty d1\n"</span>);
<a name="l01447"></a>01447 <span class="preprocessor">#endif</span>
<a name="l01448"></a>01448 <span class="preprocessor"></span> <span class="keywordflow">if</span> (d1)
<a name="l01449"></a>01449 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(d1);
<a name="l01450"></a>01450 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(dx);
<a name="l01451"></a>01451
<a name="l01452"></a>01452 <span class="keywordflow">if</span> (!d2 || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d2) || d2-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>!=0) {
<a name="l01453"></a>01453
<a name="l01454"></a>01454 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01455"></a>01455 <span class="preprocessor"></span> fprintf( stderr, <span class="stringliteral">"Empty d2 (deleting)\n"</span>);
<a name="l01456"></a>01456 <span class="preprocessor">#endif</span>
<a name="l01457"></a>01457 <span class="preprocessor"></span> <span class="comment">/* dx = p1->Domain = p2->Domain */</span>
<a name="l01458"></a>01458 <span class="keywordflow">if</span> (d2) <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(d2);
<a name="l01459"></a>01459
<a name="l01460"></a>01460 <span class="comment">/* Update p1 */</span>
<a name="l01461"></a>01461 <span class="keywordflow">for</span> (i=0;i<nv;i++)
<a name="l01462"></a>01462 p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i] |= p2-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i];
<a name="l01463"></a>01463
<a name="l01464"></a>01464 <span class="comment">/* Delete p2 */</span>
<a name="l01465"></a>01465 p2prev-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a> = p2-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>;
<a name="l01466"></a>01466 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01467"></a>01467 free(p2-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>);
<a name="l01468"></a>01468 free(p2);
<a name="l01469"></a>01469 p2 = p2prev;
<a name="l01470"></a>01470 }
<a name="l01471"></a>01471 <span class="keywordflow">else</span> { <span class="comment">/* d2 is not empty --> dx==p1->domain */</span>
<a name="l01472"></a>01472
<a name="l01473"></a>01473 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01474"></a>01474 <span class="preprocessor"></span> fprintf( stderr, <span class="stringliteral">"p2 replaced by d2\n"</span>);
<a name="l01475"></a>01475 <span class="preprocessor">#endif</span>
<a name="l01476"></a>01476 <span class="preprocessor"></span> <span class="comment">/* Update p1 */</span>
<a name="l01477"></a>01477 <span class="keywordflow">for</span>(i=0;i<nv;i++)
<a name="l01478"></a>01478 p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i] |= p2-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i];
<a name="l01479"></a>01479
<a name="l01480"></a>01480 <span class="comment">/* Replace p2 with d2 */</span>
<a name="l01481"></a>01481 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>( p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> );
<a name="l01482"></a>01482 p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = d2;
<a name="l01483"></a>01483 }
<a name="l01484"></a>01484 }
<a name="l01485"></a>01485 <span class="keywordflow">else</span> { <span class="comment">/* d1 is not empty */</span>
<a name="l01486"></a>01486 <span class="keywordflow">if</span> (!d2 || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d2) || d2-><a class="code" href="structpolyhedron.html#af316f6440017b2e02fa3a387b2818cc9">NbEq</a>!=0) {
<a name="l01487"></a>01487
<a name="l01488"></a>01488 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01489"></a>01489 <span class="preprocessor"></span> fprintf( stderr, <span class="stringliteral">"p1 replaced by d1\n"</span>);
<a name="l01490"></a>01490 <span class="preprocessor">#endif</span>
<a name="l01491"></a>01491 <span class="preprocessor"></span> <span class="keywordflow">if</span> (d2) <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(d2);
<a name="l01492"></a>01492
<a name="l01493"></a>01493 <span class="comment">/* dx = p2->domain */</span>
<a name="l01494"></a>01494 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(dx);
<a name="l01495"></a>01495
<a name="l01496"></a>01496 <span class="comment">/* Update p2 */</span>
<a name="l01497"></a>01497 <span class="keywordflow">for</span>(i=0;i<nv;i++)
<a name="l01498"></a>01498 p2-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i] |= p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i];
<a name="l01499"></a>01499
<a name="l01500"></a>01500 <span class="comment">/* Replace p1 with d1 */</span>
<a name="l01501"></a>01501 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01502"></a>01502 p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = d1;
<a name="l01503"></a>01503 }
<a name="l01504"></a>01504 <span class="keywordflow">else</span> { <span class="comment">/*d2 is not empty-->d1,d2,dx are distinct */</span>
<a name="l01505"></a>01505
<a name="l01506"></a>01506 <span class="preprocessor">#ifdef DEBUGPP5</span>
<a name="l01507"></a>01507 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Non-empty d1 and d2\nNew node created\n"</span>);
<a name="l01508"></a>01508 <span class="preprocessor">#endif</span>
<a name="l01509"></a>01509 <span class="preprocessor"></span> <span class="comment">/* Create a new node for dx */</span>
<a name="l01510"></a>01510 PDNew = (<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *) malloc( <span class="keyword">sizeof</span>(<a class="code" href="struct__Param__Domain.html">Param_Domain</a>) );
<a name="l01511"></a>01511 PDNew-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a> = (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> *)malloc( nv*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) );
<a name="l01512"></a>01512 memset(PDNew-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>,0,nv*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l01513"></a>01513 PDNew-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = dx;
<a name="l01514"></a>01514
<a name="l01515"></a>01515 <span class="keywordflow">for</span> (i=0;i<nv;i++)
<a name="l01516"></a>01516 PDNew-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i] = p1-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i] | p2-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>[i];
<a name="l01517"></a>01517
<a name="l01518"></a>01518 <span class="comment">/* Replace p1 with d1 */</span>
<a name="l01519"></a>01519 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>( p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> );
<a name="l01520"></a>01520 p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = d1;
<a name="l01521"></a>01521
<a name="l01522"></a>01522 <span class="comment">/* Replace p2 with d2 */</span>
<a name="l01523"></a>01523 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>( p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> );
<a name="l01524"></a>01524 p2-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = d2;
<a name="l01525"></a>01525
<a name="l01526"></a>01526 <span class="comment">/* Insert new node after p1 */</span>
<a name="l01527"></a>01527 PDNew-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a> = p1-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>;
<a name="l01528"></a>01528 p1-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a> = PDNew;
<a name="l01529"></a>01529 }
<a name="l01530"></a>01530 }
<a name="l01531"></a>01531 } <span class="comment">/* end of p2 scan */</span>
<a name="l01532"></a>01532 <span class="keywordflow">if</span> (p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l01533"></a>01533 <a class="code" href="structpolyhedron.html">Polyhedron</a> *C = <a class="code" href="polyhedron_8c.html#a53b04dfca9570691fbe42574118215ab">DomainConvex</a>(p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>, working_space);
<a name="l01534"></a>01534 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01535"></a>01535 p1-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = C;
<a name="l01536"></a>01536 }
<a name="l01537"></a>01537 } <span class="comment">/* end of p1 scan */</span>
<a name="l01538"></a>01538 } <span class="comment">/* Compute_PDomains */</span>
<a name="l01539"></a>01539
<a name="l01540"></a>01540 <span class="comment">/* </span>
<a name="l01541"></a>01541 <span class="comment"> * Given a polyhedron 'Din' in combined data and parametre space, a context</span>
<a name="l01542"></a>01542 <span class="comment"> * polyhedron 'Cin' representing the constraints on the parameter space and </span>
<a name="l01543"></a>01543 <span class="comment"> * a working space size 'working_space', return a parametric polyhedron with</span>
<a name="l01544"></a>01544 <span class="comment"> * a list of parametric vertices and their defining domains. </span>
<a name="l01545"></a>01545 <span class="comment"> */</span>
<a name="l01546"></a><a class="code" href="polyparam_8h.html#a337084d0cc59e1fda9998c81f8c68919">01546</a> <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *<a class="code" href="polyparam_8c.html#a337084d0cc59e1fda9998c81f8c68919">Polyhedron2Param_Vertices</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Din,<a class="code" href="structpolyhedron.html">Polyhedron</a> *Cin,<span class="keywordtype">int</span> working_space) {
<a name="l01547"></a>01547
<a name="l01548"></a>01548 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *result;
<a name="l01549"></a>01549
<a name="l01550"></a>01550 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Din);
<a name="l01551"></a>01551 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Din);
<a name="l01552"></a>01552 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Cin);
<a name="l01553"></a>01553 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Cin);
<a name="l01554"></a>01554
<a name="l01555"></a>01555 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01556"></a>01556 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Polyhedron2Param_Vertices algorithm starting at : %.2fs\n"</span>,
<a name="l01557"></a>01557 (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01558"></a>01558 <span class="preprocessor">#endif</span>
<a name="l01559"></a>01559 <span class="preprocessor"></span>
<a name="l01560"></a>01560 <span class="comment">/***************** Scan the m-faces ****************/</span>
<a name="l01561"></a>01561 result = <a class="code" href="polyparam_8c.html#a2058929b5ad7772d9e28faae3069bf04">Find_m_faces</a>(&Din,Cin,0,working_space,NULL,NULL);
<a name="l01562"></a>01562
<a name="l01563"></a>01563 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01564"></a>01564 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"nb of points : %d\n"</span>,result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>);
<a name="l01565"></a>01565 <span class="preprocessor">#endif</span>
<a name="l01566"></a>01566 <span class="preprocessor"></span>
<a name="l01567"></a>01567 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01568"></a>01568 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"end main loop : %.2fs\n"</span>, (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01569"></a>01569 <span class="preprocessor">#endif</span>
<a name="l01570"></a>01570 <span class="preprocessor"></span>
<a name="l01571"></a>01571 <span class="keywordflow">return</span>(result);
<a name="l01572"></a>01572 } <span class="comment">/* Polyhedron2Param_Vertices */</span>
<a name="l01573"></a>01573
<a name="l01574"></a>01574 <span class="comment">/*</span>
<a name="l01575"></a>01575 <span class="comment"> * Free the memory allocated to a list of parametrized vertices </span>
<a name="l01576"></a>01576 <span class="comment"> */</span>
<a name="l01577"></a><a class="code" href="polyparam_8h.html#a130a2772c56c28b74a5c0ab42717c267">01577</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a130a2772c56c28b74a5c0ab42717c267">Param_Vertices_Free</a>(<a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *PV) {
<a name="l01578"></a>01578
<a name="l01579"></a>01579 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *next_pv;
<a name="l01580"></a>01580
<a name="l01581"></a>01581 <span class="keywordflow">while</span>(PV) {
<a name="l01582"></a>01582 next_pv = PV-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a>;
<a name="l01583"></a>01583 <span class="keywordflow">if</span> (PV-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>) <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(PV-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>);
<a name="l01584"></a>01584 <span class="keywordflow">if</span> (PV-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>) <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(PV-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>);
<a name="l01585"></a>01585 <span class="keywordflow">if</span> (PV-><a class="code" href="struct__Param__Vertex.html#af7ff9a4be6a5202a9bcf741a8b233c9e">Facets</a>) free(PV-><a class="code" href="struct__Param__Vertex.html#af7ff9a4be6a5202a9bcf741a8b233c9e">Facets</a>);
<a name="l01586"></a>01586 free(PV);
<a name="l01587"></a>01587 PV = next_pv;
<a name="l01588"></a>01588 }
<a name="l01589"></a>01589 } <span class="comment">/* Param_Vertices_Free */</span>
<a name="l01590"></a>01590
<a name="l01591"></a>01591 <span class="comment">/*</span>
<a name="l01592"></a>01592 <span class="comment"> * Print a list of parametrized vertices *</span>
<a name="l01593"></a>01593 <span class="comment"> */</span>
<a name="l01594"></a><a class="code" href="polyparam_8h.html#aed63fd8f223a4776c442b144edb03fae">01594</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#aed63fd8f223a4776c442b144edb03fae">Print_Vertex</a>(FILE *DST, <a class="code" href="structmatrix.html">Matrix</a> *V, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_names)
<a name="l01595"></a>01595 {
<a name="l01596"></a>01596 <span class="keywordtype">int</span> l, v;
<a name="l01597"></a>01597 <span class="keywordtype">int</span> first;
<a name="l01598"></a>01598 Value gcd,tmp;
<a name="l01599"></a>01599
<a name="l01600"></a>01600 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l01601"></a>01601
<a name="l01602"></a>01602 fprintf(DST, <span class="stringliteral">"["</span> );
<a name="l01603"></a>01603 <span class="keywordflow">for</span>(l=0;l<V-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++l){
<a name="l01604"></a>01604
<a name="l01605"></a>01605 <span class="comment">/* Variables */</span>
<a name="l01606"></a>01606 first=1;
<a name="l01607"></a>01607 fprintf(DST, <span class="stringliteral">" "</span> );
<a name="l01608"></a>01608 <span class="keywordflow">for</span>(v=0;v < V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-2;++v) {
<a name="l01609"></a>01609 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v])) {
<a name="l01610"></a>01610 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v], V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01611"></a>01611 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(tmp, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v], gcd);
<a name="l01612"></a>01612 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#afef45b8b369740e71140484a097b6ab4">value_posz_p</a>(tmp)) {
<a name="l01613"></a>01613 <span class="keywordflow">if</span>(!first)
<a name="l01614"></a>01614 fprintf(DST, <span class="stringliteral">"+"</span>);
<a name="l01615"></a>01615 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(tmp)) {
<a name="l01616"></a>01616 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,tmp);
<a name="l01617"></a>01617 }
<a name="l01618"></a>01618 }
<a name="l01619"></a>01619 <span class="keywordflow">else</span> { <span class="comment">/* V->p[l][v]/gcd<0 */</span>
<a name="l01620"></a>01620 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a0a56519397244e2bc48e480bcd2f2a63">value_mone_p</a>(tmp))
<a name="l01621"></a>01621 fprintf(DST, <span class="stringliteral">"-"</span> );
<a name="l01622"></a>01622 <span class="keywordflow">else</span> {
<a name="l01623"></a>01623 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,tmp);
<a name="l01624"></a>01624 }
<a name="l01625"></a>01625 }
<a name="l01626"></a>01626 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(tmp, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1], gcd);
<a name="l01627"></a>01627 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(tmp)) {
<a name="l01628"></a>01628 fprintf(DST, <span class="stringliteral">"%s/"</span>, param_names[v]);
<a name="l01629"></a>01629 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,tmp);
<a name="l01630"></a>01630 }
<a name="l01631"></a>01631 <span class="keywordflow">else</span>
<a name="l01632"></a>01632 fprintf(DST, <span class="stringliteral">"%s"</span>, param_names[v]);
<a name="l01633"></a>01633 first=0;
<a name="l01634"></a>01634 }
<a name="l01635"></a>01635 }
<a name="l01636"></a>01636
<a name="l01637"></a>01637 <span class="comment">/* Constant */</span>
<a name="l01638"></a>01638 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v]) || first) {
<a name="l01639"></a>01639 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#afef45b8b369740e71140484a097b6ab4">value_posz_p</a>(V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v]) && !first)
<a name="l01640"></a>01640 fprintf(DST,<span class="stringliteral">"+"</span>);
<a name="l01641"></a>01641 <a class="code" href="source_2arith_2arithmetique_8h.html#a50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gcd, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v], V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01642"></a>01642 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(tmp, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][v], gcd);
<a name="l01643"></a>01643 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,tmp);
<a name="l01644"></a>01644 <a class="code" href="source_2arith_2arithmetique_8h.html#a4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(tmp, V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1], gcd);
<a name="l01645"></a>01645 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(tmp)) {
<a name="l01646"></a>01646 fprintf(DST,<span class="stringliteral">"/"</span>);
<a name="l01647"></a>01647 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,tmp);
<a name="l01648"></a>01648 fprintf(DST,<span class="stringliteral">" "</span>);
<a name="l01649"></a>01649 }
<a name="l01650"></a>01650 }
<a name="l01651"></a>01651 <span class="keywordflow">if</span> (l<V->NbRows-1)
<a name="l01652"></a>01652 fprintf(DST, <span class="stringliteral">", "</span>);
<a name="l01653"></a>01653 }
<a name="l01654"></a>01654 fprintf(DST, <span class="stringliteral">" ]"</span>);
<a name="l01655"></a>01655 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(gcd); <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01656"></a>01656 <span class="keywordflow">return</span>;
<a name="l01657"></a>01657 } <span class="comment">/* Print_Vertex */</span>
<a name="l01658"></a>01658
<a name="l01659"></a>01659 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l01660"></a>01660 <span class="comment">/* VertexCT */</span>
<a name="l01661"></a>01661 <span class="comment">/* convert a paramvertex from reduced space to normal m-space */</span>
<a name="l01662"></a>01662 <span class="comment">/*----------------------------------------------------------------------*/</span>
<a name="l01663"></a><a class="code" href="polyparam_8h.html#a6d1dac6dcd959d6489cdd4933f75fc7e">01663</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#a6d1dac6dcd959d6489cdd4933f75fc7e">VertexCT</a>(<a class="code" href="structmatrix.html">Matrix</a> *V,<a class="code" href="structmatrix.html">Matrix</a> *CT) {
<a name="l01664"></a>01664
<a name="l01665"></a>01665 <a class="code" href="structmatrix.html">Matrix</a> *Vt;
<a name="l01666"></a>01666 <span class="keywordtype">int</span> i,j,k;
<a name="l01667"></a>01667
<a name="l01668"></a>01668 <span class="keywordflow">if</span>(CT) {
<a name="l01669"></a>01669
<a name="l01670"></a>01670 <span class="comment">/* Have to transform the vertices to original dimension */</span>
<a name="l01671"></a>01671 Vt = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(V-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>,CT-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>+1);
<a name="l01672"></a>01672 <span class="keywordflow">for</span>(i=0;i<V-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;++i) {
<a name="l01673"></a>01673 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Vt-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][CT-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>],V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][V-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01674"></a>01674 <span class="keywordflow">for</span>(j=0;j<CT-><a class="code" href="structmatrix.html#a68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;j++) {
<a name="l01675"></a>01675 <span class="keywordflow">for</span>(k=0;k<CT-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;k++)
<a name="l01676"></a>01676 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(CT-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][j]))
<a name="l01677"></a>01677 <span class="keywordflow">break</span>;
<a name="l01678"></a>01678 <span class="keywordflow">if</span>(k<CT->NbRows)
<a name="l01679"></a>01679 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(Vt-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],V-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l01680"></a>01680 <span class="keywordflow">else</span>
<a name="l01681"></a>01681 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Vt-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],0);
<a name="l01682"></a>01682 }
<a name="l01683"></a>01683 }
<a name="l01684"></a>01684 <span class="keywordflow">return</span>(Vt);
<a name="l01685"></a>01685 }
<a name="l01686"></a>01686 <span class="keywordflow">else</span>
<a name="l01687"></a>01687 <span class="keywordflow">return</span>(NULL);
<a name="l01688"></a>01688 } <span class="comment">/* VertexCT */</span>
<a name="l01689"></a>01689
<a name="l01690"></a>01690 <span class="comment">/*</span>
<a name="l01691"></a>01691 <span class="comment"> * Print the validity Domain 'D' of a parametric polyhedron </span>
<a name="l01692"></a>01692 <span class="comment"> */</span>
<a name="l01693"></a><a class="code" href="polyparam_8h.html#a2576e3e750b8e633de2d6d859b54f029">01693</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#afa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(FILE *DST, <a class="code" href="structpolyhedron.html">Polyhedron</a> *D, <span class="keyword">const</span> <span class="keywordtype">char</span> **pname)
<a name="l01694"></a>01694 {
<a name="l01695"></a>01695 <span class="keywordtype">int</span> l, v;
<a name="l01696"></a>01696 <span class="keywordtype">int</span> first;
<a name="l01697"></a>01697
<a name="l01698"></a>01698 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(D);
<a name="l01699"></a>01699 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(D);
<a name="l01700"></a>01700
<a name="l01701"></a>01701 <span class="keywordflow">for</span>(l=0;l<D-><a class="code" href="structpolyhedron.html#a2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;++l) {
<a name="l01702"></a>01702 fprintf(DST, <span class="stringliteral">" "</span>);
<a name="l01703"></a>01703 first = 1;
<a name="l01704"></a>01704 <span class="keywordflow">for</span>(v=1;v<=D-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;++v) {
<a name="l01705"></a>01705 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v])) {
<a name="l01706"></a>01706 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a61db0ba9ba925615ec70eb92e40b9ef4">value_one_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v])) {
<a name="l01707"></a>01707 <span class="keywordflow">if</span>(first)
<a name="l01708"></a>01708 fprintf(DST, <span class="stringliteral">"%s "</span>, pname[v-1]);
<a name="l01709"></a>01709 <span class="keywordflow">else</span>
<a name="l01710"></a>01710 fprintf(DST, <span class="stringliteral">"+ %s "</span>, pname[v-1] );
<a name="l01711"></a>01711 }
<a name="l01712"></a>01712 <span class="keywordflow">else</span> <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a0a56519397244e2bc48e480bcd2f2a63">value_mone_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v]))
<a name="l01713"></a>01713 fprintf(DST, <span class="stringliteral">"- %s "</span>, pname[v-1] );
<a name="l01714"></a>01714 <span class="keywordflow">else</span> {
<a name="l01715"></a>01715 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a01904c8c75c10d407a24c55f16ec27c7">value_pos_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v]) && !first )
<a name="l01716"></a>01716 fprintf(DST, <span class="stringliteral">"+ "</span> );
<a name="l01717"></a>01717 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v]);
<a name="l01718"></a>01718 fprintf(DST,<span class="stringliteral">"%s "</span>,pname[v-1]);
<a name="l01719"></a>01719 }
<a name="l01720"></a>01720 first = 0;
<a name="l01721"></a>01721 }
<a name="l01722"></a>01722 }
<a name="l01723"></a>01723 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v])) {
<a name="l01724"></a>01724 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#a01904c8c75c10d407a24c55f16ec27c7">value_pos_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v]) && !first)
<a name="l01725"></a>01725 fprintf(DST,<span class="stringliteral">"+"</span>);
<a name="l01726"></a>01726 fprintf(DST,<span class="stringliteral">" "</span>);
<a name="l01727"></a>01727 <a class="code" href="source_2arith_2arithmetique_8h.html#ad34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][v]);
<a name="l01728"></a>01728 }
<a name="l01729"></a>01729 fprintf(DST,(<a class="code" href="source_2arith_2arithmetique_8h.html#a47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(D-><a class="code" href="structpolyhedron.html#ab2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[l][0])) ?<span class="stringliteral">" >= 0"</span>:<span class="stringliteral">" = 0"</span>);
<a name="l01730"></a>01730 fprintf(DST, <span class="stringliteral">"\n"</span> );
<a name="l01731"></a>01731 }
<a name="l01732"></a>01732 fprintf(DST, <span class="stringliteral">"\n"</span>);
<a name="l01733"></a>01733
<a name="l01734"></a>01734 <span class="keywordflow">if</span>( D-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a> )
<a name="l01735"></a>01735 {
<a name="l01736"></a>01736 fprintf( DST, <span class="stringliteral">"UNION\n"</span> );
<a name="l01737"></a>01737 <a class="code" href="polyparam_8c.html#afa315bc856959f9a781359f69b74d7a4">Print_Domain</a>( DST, D-><a class="code" href="structpolyhedron.html#aab97126cb9e56431d40eaf4e68b3953d">next</a>, pname );
<a name="l01738"></a>01738 }
<a name="l01739"></a>01739 <span class="keywordflow">return</span>;
<a name="l01740"></a>01740 } <span class="comment">/* Print_Domain */</span>
<a name="l01741"></a>01741
<a name="l01742"></a>01742 <span class="comment">/* </span>
<a name="l01743"></a>01743 <span class="comment"> * Given a list of parametrized vertices and an array of parameter names, Print</span>
<a name="l01744"></a>01744 <span class="comment"> * a list of parametrized vertices in a comprehensible format. </span>
<a name="l01745"></a>01745 <span class="comment"> */</span>
<a name="l01746"></a><a class="code" href="polyparam_8h.html#ac28d8499be5ff29e4ff8149bbe53c5df">01746</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#ac28d8499be5ff29e4ff8149bbe53c5df">Param_Vertices_Print</a>(FILE *DST, <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *PV, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_names)
<a name="l01747"></a>01747 {
<a name="l01748"></a>01748 <a class="code" href="structpolyhedron.html">Polyhedron</a> *poly;
<a name="l01749"></a>01749
<a name="l01750"></a>01750 <span class="keywordflow">while</span>(PV) {
<a name="l01751"></a>01751 fprintf(DST, <span class="stringliteral">"Vertex :\n"</span> );
<a name="l01752"></a>01752 <a class="code" href="polyparam_8c.html#aed63fd8f223a4776c442b144edb03fae">Print_Vertex</a>(DST,PV-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>,param_names);
<a name="l01753"></a>01753
<a name="l01754"></a>01754 <span class="comment">/* Pour le domaine : */</span>
<a name="l01755"></a>01755 fprintf(DST, <span class="stringliteral">" If :\n"</span> );
<a name="l01756"></a>01756 poly = <a class="code" href="polyhedron_8c.html#aefb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(PV-><a class="code" href="struct__Param__Vertex.html#a09d8d34daf37b7cbcff6761b80761f26">Domain</a>,200);
<a name="l01757"></a>01757 <a class="code" href="polyparam_8c.html#afa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(DST,poly,param_names);
<a name="l01758"></a>01758 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(poly);
<a name="l01759"></a>01759 PV = PV-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a>;
<a name="l01760"></a>01760 }
<a name="l01761"></a>01761 <span class="keywordflow">return</span>;
<a name="l01762"></a>01762 } <span class="comment">/* Param_Vertices_Print */</span>
<a name="l01763"></a>01763
<a name="l01764"></a>01764 <span class="comment">/* </span>
<a name="l01765"></a>01765 <span class="comment"> * Given a polyhedron 'Din' in combined data and parametre space, a context</span>
<a name="l01766"></a>01766 <span class="comment"> * polyhedron 'Cin' representing the constraints on the parameter space and </span>
<a name="l01767"></a>01767 <span class="comment"> * a working space size 'working_space', return a parametric polyhedron with</span>
<a name="l01768"></a>01768 <span class="comment"> * a list of distinct validity domains and a complete list of valid vertices </span>
<a name="l01769"></a>01769 <span class="comment"> * associated to each validity domain. </span>
<a name="l01770"></a>01770 <span class="comment"> */</span>
<a name="l01771"></a><a class="code" href="polyparam_8h.html#a57cedd532b6fbd7a8d7549758eabaf94">01771</a> <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *<a class="code" href="polyparam_8c.html#a57cedd532b6fbd7a8d7549758eabaf94">Polyhedron2Param_Domain</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Din,<a class="code" href="structpolyhedron.html">Polyhedron</a> *Cin,<span class="keywordtype">int</span> working_space) {
<a name="l01772"></a>01772
<a name="l01773"></a>01773 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *result;
<a name="l01774"></a>01774 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *D;
<a name="l01775"></a>01775
<a name="l01776"></a>01776 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Din);
<a name="l01777"></a>01777 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Din);
<a name="l01778"></a>01778 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Cin);
<a name="l01779"></a>01779 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Cin);
<a name="l01780"></a>01780
<a name="l01781"></a>01781 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(Din) || <a class="code" href="types_8h.html#a156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(Cin))
<a name="l01782"></a>01782 <span class="keywordflow">return</span> NULL;
<a name="l01783"></a>01783
<a name="l01784"></a>01784 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01785"></a>01785 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Polyhedron2Param_Polyhedron algorithm starting at : %.2fs\n"</span>,
<a name="l01786"></a>01786 (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01787"></a>01787 <span class="preprocessor">#endif</span>
<a name="l01788"></a>01788 <span class="preprocessor"></span>
<a name="l01789"></a>01789 <span class="comment">/* Find the m-faces, keeping the corresponding domains */</span>
<a name="l01790"></a>01790 <span class="comment">/* in the linked list PDomains */</span>
<a name="l01791"></a>01791 result = <a class="code" href="polyparam_8c.html#a2058929b5ad7772d9e28faae3069bf04">Find_m_faces</a>(&Din,Cin,1,working_space,NULL,NULL);
<a name="l01792"></a>01792
<a name="l01793"></a>01793 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01794"></a>01794 <span class="preprocessor"></span> <span class="keywordflow">if</span>(result) fprintf(stderr, <span class="stringliteral">"Number of vertices : %d\n"</span>,result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>);
<a name="l01795"></a>01795 fprintf(stderr,<span class="stringliteral">"Vertices found at : %.2fs\n"</span>,(<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01796"></a>01796 <span class="preprocessor">#endif</span>
<a name="l01797"></a>01797 <span class="preprocessor"></span>
<a name="l01798"></a>01798 <span class="comment">/* Processing of PVResult and PDomains */</span>
<a name="l01799"></a>01799 <span class="keywordflow">if</span>(result && Cin-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>>0) <span class="comment">/* at least 1 parameter */</span>
<a name="l01800"></a>01800 <a class="code" href="polyparam_8c.html#a5b103fb2f86581eaaeba2eb3f567c84c">Compute_PDomains</a>(result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>,result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>,working_space);
<a name="l01801"></a>01801 <span class="keywordflow">if</span>(result && CEqualities)
<a name="l01802"></a>01802 <span class="keywordflow">for</span>(D=result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>;D;D=D-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>)
<a name="l01803"></a>01803 D-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a> = <a class="code" href="polyparam_8c.html#a268d6a0bae15f9232bcd138212aa1ea5">Add_CEqualities</a>(D-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01804"></a>01804 <a class="code" href="polyhedron_8c.html#a4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(CEqualities);
<a name="l01805"></a>01805
<a name="l01806"></a>01806 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01807"></a>01807 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"domains found at : %.2fs\n"</span>, (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01808"></a>01808 <span class="preprocessor">#endif</span>
<a name="l01809"></a>01809 <span class="preprocessor"></span>
<a name="l01810"></a>01810 <span class="keywordflow">return</span>(result);
<a name="l01811"></a>01811 } <span class="comment">/* Polyhedon2Param_Domain */</span>
<a name="l01812"></a>01812
<a name="l01813"></a>01813 <span class="comment">/*</span>
<a name="l01814"></a>01814 <span class="comment"> *</span>
<a name="l01815"></a>01815 <span class="comment"> */</span>
<a name="l01816"></a><a class="code" href="polyparam_8h.html#acc7b93726280a24b37b268e90a2e25ca">01816</a> <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *<a class="code" href="polyparam_8c.html#acc7b93726280a24b37b268e90a2e25ca">Polyhedron2Param_SimplifiedDomain</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> **Din,<a class="code" href="structpolyhedron.html">Polyhedron</a> *Cin,<span class="keywordtype">int</span> working_space,<a class="code" href="structpolyhedron.html">Polyhedron</a> **CEq,<a class="code" href="structmatrix.html">Matrix</a> **CT) {
<a name="l01817"></a>01817
<a name="l01818"></a>01818 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *result;
<a name="l01819"></a>01819
<a name="l01820"></a>01820 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(CEq != NULL);
<a name="l01821"></a>01821 <a class="code" href="assert_8h.html#a07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(CT != NULL);
<a name="l01822"></a>01822
<a name="l01823"></a>01823 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(*Din);
<a name="l01824"></a>01824 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(*Din);
<a name="l01825"></a>01825 <a class="code" href="polyhedron_8h.html#a729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Cin);
<a name="l01826"></a>01826 <a class="code" href="polyhedron_8h.html#a317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Cin);
<a name="l01827"></a>01827
<a name="l01828"></a>01828 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01829"></a>01829 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Polyhedron2Param_Polyhedron algorithm starting at : %.2fs\n"</span>,
<a name="l01830"></a>01830 (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01831"></a>01831 <span class="preprocessor">#endif</span>
<a name="l01832"></a>01832 <span class="preprocessor"></span>
<a name="l01833"></a>01833 <span class="comment">/* Find the m-faces, keeping the corresponding domains */</span>
<a name="l01834"></a>01834 <span class="comment">/* in the linked list PDomains */</span>
<a name="l01835"></a>01835 result = <a class="code" href="polyparam_8c.html#a2058929b5ad7772d9e28faae3069bf04">Find_m_faces</a>(Din,Cin,1,working_space,CEq,CT);
<a name="l01836"></a>01836
<a name="l01837"></a>01837 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01838"></a>01838 <span class="preprocessor"></span> <span class="keywordflow">if</span>(result) fprintf(stderr, <span class="stringliteral">"Number of vertices : %d\n"</span>,result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>);
<a name="l01839"></a>01839 fprintf(stderr,<span class="stringliteral">"Vertices found at : %.2fs\n"</span>,(<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01840"></a>01840 <span class="preprocessor">#endif</span>
<a name="l01841"></a>01841 <span class="preprocessor"></span>
<a name="l01842"></a>01842 <span class="comment">/* Processing of PVResult and PDomains */</span>
<a name="l01843"></a>01843 <span class="keywordflow">if</span>(result && Cin-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>>0) <span class="comment">/* at least 1 parameter */</span>
<a name="l01844"></a>01844 <a class="code" href="polyparam_8c.html#a5b103fb2f86581eaaeba2eb3f567c84c">Compute_PDomains</a>(result-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>,result-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>,working_space);
<a name="l01845"></a>01845
<a name="l01846"></a>01846 <span class="comment">/* Removed this, Vin100, March 01 */</span>
<a name="l01847"></a>01847 <span class="comment">/* if(result && CEqualities )</span>
<a name="l01848"></a>01848 <span class="comment"> for(D=result->D;D;D=D->next)</span>
<a name="l01849"></a>01849 <span class="comment"> D->Domain = Add_CEqualities(D->Domain);</span>
<a name="l01850"></a>01850 <span class="comment"> */</span>
<a name="l01851"></a>01851
<a name="l01852"></a>01852 <span class="preprocessor">#ifdef DEBUGPP</span>
<a name="l01853"></a>01853 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"domains found at : %.2fs\n"</span>, (<span class="keywordtype">float</span>)clock()/CLOCKS_PER_SEC);
<a name="l01854"></a>01854 <span class="preprocessor">#endif</span>
<a name="l01855"></a>01855 <span class="preprocessor"></span>
<a name="l01856"></a>01856 <span class="keywordflow">return</span>(result);
<a name="l01857"></a>01857 } <span class="comment">/* Polyhedron2Param_SimplifiedDomain */</span>
<a name="l01858"></a>01858
<a name="l01859"></a>01859 <span class="comment">/*</span>
<a name="l01860"></a>01860 <span class="comment"> * Free the memory allocated to a list of validity domain of a parametrized </span>
<a name="l01861"></a>01861 <span class="comment"> * polyhedron.</span>
<a name="l01862"></a>01862 <span class="comment"> */</span>
<a name="l01863"></a><a class="code" href="polyparam_8h.html#a50f554419ba832936792c06683caac31">01863</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a50f554419ba832936792c06683caac31">Param_Domain_Free</a>(<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *PD) {
<a name="l01864"></a>01864
<a name="l01865"></a>01865 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *next_pd;
<a name="l01866"></a>01866
<a name="l01867"></a>01867 <span class="keywordflow">while</span>(PD) {
<a name="l01868"></a>01868 free(PD-><a class="code" href="struct__Param__Domain.html#ac87a60cf654cb9b80ddcac469d6ee81a">F</a>);
<a name="l01869"></a>01869 <a class="code" href="polyhedron_8c.html#ae6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(PD-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>);
<a name="l01870"></a>01870 next_pd = PD-><a class="code" href="struct__Param__Domain.html#a5e0de697b290be8c04aeb01af780c557">next</a>;
<a name="l01871"></a>01871 free(PD);
<a name="l01872"></a>01872 PD = next_pd;
<a name="l01873"></a>01873 }
<a name="l01874"></a>01874 <span class="keywordflow">return</span>;
<a name="l01875"></a>01875 } <span class="comment">/* Param_Domain_Free */</span>
<a name="l01876"></a>01876
<a name="l01877"></a>01877 <span class="comment">/*</span>
<a name="l01878"></a>01878 <span class="comment"> * Free the memory allocated to a parametric polyhedron 'P' </span>
<a name="l01879"></a>01879 <span class="comment"> */</span>
<a name="l01880"></a><a class="code" href="polyparam_8h.html#a499deb4842822ae8ae58ed1fdf079c88">01880</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a499deb4842822ae8ae58ed1fdf079c88">Param_Polyhedron_Free</a>(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *P) {
<a name="l01881"></a>01881
<a name="l01882"></a>01882 <span class="keywordflow">if</span> (!P) <span class="keywordflow">return</span>;
<a name="l01883"></a>01883 <a class="code" href="polyparam_8c.html#a130a2772c56c28b74a5c0ab42717c267">Param_Vertices_Free</a>(P-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>);
<a name="l01884"></a>01884 <a class="code" href="polyparam_8c.html#a50f554419ba832936792c06683caac31">Param_Domain_Free</a>(P-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>);
<a name="l01885"></a>01885 <span class="keywordflow">if</span> (P-><a class="code" href="struct__Param__Polyhedron.html#ac89157421ffc9312f82b11cb89a05dfe">Constraints</a>)
<a name="l01886"></a>01886 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(P-><a class="code" href="struct__Param__Polyhedron.html#ac89157421ffc9312f82b11cb89a05dfe">Constraints</a>);
<a name="l01887"></a>01887 <span class="keywordflow">if</span> (P-><a class="code" href="struct__Param__Polyhedron.html#a3daced8ddb352cfa5ed1eeb949f102c5">Rays</a>)
<a name="l01888"></a>01888 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(P-><a class="code" href="struct__Param__Polyhedron.html#a3daced8ddb352cfa5ed1eeb949f102c5">Rays</a>);
<a name="l01889"></a>01889 free(P);
<a name="l01890"></a>01890 <span class="keywordflow">return</span>;
<a name="l01891"></a>01891 } <span class="comment">/* Param_Polyhedron_Free */</span>
<a name="l01892"></a>01892
<a name="l01893"></a>01893 <span class="comment">/*</span>
<a name="l01894"></a>01894 <span class="comment"> * Scales the parametric polyhedron such that all vertices are integer.</span>
<a name="l01895"></a>01895 <span class="comment"> */</span>
<a name="l01896"></a><a class="code" href="polyparam_8h.html#a5c62eaa235c8e77a994387f27b67ad3f">01896</a> <span class="keywordtype">void</span> <a class="code" href="polyparam_8c.html#a5c62eaa235c8e77a994387f27b67ad3f">Param_Polyhedron_Scale_Integer</a>(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *PP, <a class="code" href="structpolyhedron.html">Polyhedron</a> **P,
<a name="l01897"></a>01897 Value *det, <span class="keywordtype">unsigned</span> MaxRays)
<a name="l01898"></a>01898 {
<a name="l01899"></a>01899 <span class="keywordtype">int</span> i;
<a name="l01900"></a>01900 <span class="keywordtype">int</span> nb_param, nb_vars;
<a name="l01901"></a>01901 <a class="code" href="structVector.html">Vector</a> *denoms;
<a name="l01902"></a>01902 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *V;
<a name="l01903"></a>01903 Value global_var_lcm;
<a name="l01904"></a>01904 <a class="code" href="structmatrix.html">Matrix</a> *expansion;
<a name="l01905"></a>01905
<a name="l01906"></a>01906 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*det, 1);
<a name="l01907"></a>01907 <span class="keywordflow">if</span> (!PP-><a class="code" href="struct__Param__Polyhedron.html#abaa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>)
<a name="l01908"></a>01908 <span class="keywordflow">return</span>;
<a name="l01909"></a>01909
<a name="l01910"></a>01910 nb_param = PP-><a class="code" href="struct__Param__Polyhedron.html#a23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#aac7b708b50ebee4352fddebed2eaba7c">Domain</a>-><a class="code" href="structpolyhedron.html#a2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l01911"></a>01911 nb_vars = PP-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#a16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l01912"></a>01912
<a name="l01913"></a>01913 <span class="comment">/* Scan the vertices and make an orthogonal expansion of the variable</span>
<a name="l01914"></a>01914 <span class="comment"> space */</span>
<a name="l01915"></a>01915 <span class="comment">/* a- prepare the array of common denominators */</span>
<a name="l01916"></a>01916 denoms = <a class="code" href="vector_8c.html#a358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(nb_vars);
<a name="l01917"></a>01917 <a class="code" href="source_2arith_2arithmetique_8h.html#af71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(global_var_lcm);
<a name="l01918"></a>01918
<a name="l01919"></a>01919 <span class="comment">/* b- scan the vertices and compute the variables' global lcms */</span>
<a name="l01920"></a>01920 <span class="keywordflow">for</span> (V = PP-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>; V; V = V-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a>)
<a name="l01921"></a>01921 <span class="keywordflow">for</span> (i = 0; i < nb_vars; i++)
<a name="l01922"></a>01922 <a class="code" href="source_2arith_2arithmetique_8h.html#a6da13dbfdd065b7609591ff6b3aee310">value_lcm</a>(denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i], denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i], V-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][nb_param+1]);
<a name="l01923"></a>01923
<a name="l01924"></a>01924 <a class="code" href="source_2arith_2arithmetique_8h.html#a8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(global_var_lcm, 1);
<a name="l01925"></a>01925 <span class="keywordflow">for</span> (i = 0; i < nb_vars; i++) {
<a name="l01926"></a>01926 <a class="code" href="source_2arith_2arithmetique_8h.html#ac9986d34264874727344f666079e2294">value_multiply</a>(*det, *det, denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l01927"></a>01927 <a class="code" href="source_2arith_2arithmetique_8h.html#a6da13dbfdd065b7609591ff6b3aee310">value_lcm</a>(global_var_lcm, global_var_lcm, denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l01928"></a>01928 }
<a name="l01929"></a>01929
<a name="l01930"></a>01930 <span class="comment">/* scale vertices */</span>
<a name="l01931"></a>01931 <span class="keywordflow">for</span> (V = PP-><a class="code" href="struct__Param__Polyhedron.html#a183b47f3f8b8c27079a840c934e7b972">V</a>; V; V = V-><a class="code" href="struct__Param__Vertex.html#a1115989a70826c590a1c71923cdeee68">next</a>)
<a name="l01932"></a>01932 <span class="keywordflow">for</span> (i = 0; i < nb_vars; i++) {
<a name="l01933"></a>01933 <a class="code" href="vector_8c.html#a14c75456dab7e1b9296fb4ec7b6ad3a5">Vector_Scale</a>(V-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i], V-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i], denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i], nb_param+1);
<a name="l01934"></a>01934 <a class="code" href="vector_8c.html#a9e3e9df020a7c7b0ad95baffed7ed5c9">Vector_Normalize</a>(V-><a class="code" href="struct__Param__Vertex.html#ad61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i], nb_param+2);
<a name="l01935"></a>01935 }
<a name="l01936"></a>01936
<a name="l01937"></a>01937 <span class="comment">/* the expansion can be actually writen as global_var_lcm.L^{-1} */</span>
<a name="l01938"></a>01938 <span class="comment">/* this is equivalent to multiply the rows of P by denoms_det */</span>
<a name="l01939"></a>01939 <span class="keywordflow">for</span> (i = 0; i < nb_vars; i++)
<a name="l01940"></a>01940 <a class="code" href="source_2arith_2arithmetique_8h.html#ac633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i], global_var_lcm, denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l01941"></a>01941
<a name="l01942"></a>01942 <span class="comment">/* OPT : we could use a vector instead of a diagonal matrix here (c- and d-).*/</span>
<a name="l01943"></a>01943 <span class="comment">/* c- make the quick expansion matrix */</span>
<a name="l01944"></a>01944 expansion = <a class="code" href="matrix_8c.html#ac0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(nb_vars+nb_param+1, nb_vars+nb_param+1);
<a name="l01945"></a>01945 <span class="keywordflow">for</span> (i = 0; i < nb_vars; i++)
<a name="l01946"></a>01946 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(expansion-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i], denoms-><a class="code" href="structVector.html#aecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l01947"></a>01947 <span class="keywordflow">for</span> (i = nb_vars; i < nb_vars+nb_param+1; i++)
<a name="l01948"></a>01948 <a class="code" href="source_2arith_2arithmetique_8h.html#a864613888dc46f15679aa4f63e468f89">value_assign</a>(expansion-><a class="code" href="structmatrix.html#a2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i], global_var_lcm);
<a name="l01949"></a>01949
<a name="l01950"></a>01950 <span class="comment">/* d- apply the variable expansion to the polyhedron */</span>
<a name="l01951"></a>01951 <span class="keywordflow">if</span> (P)
<a name="l01952"></a>01952 *P = <a class="code" href="polyhedron_8c.html#a53d52d5d1befc1d1446e0920556c3d24">Polyhedron_Preimage</a>(*P, expansion, MaxRays);
<a name="l01953"></a>01953
<a name="l01954"></a>01954 <a class="code" href="matrix_8c.html#afcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(expansion);
<a name="l01955"></a>01955 <a class="code" href="source_2arith_2arithmetique_8h.html#ab9b282921e85a0527d462d331533d619">value_clear</a>(global_var_lcm);
<a name="l01956"></a>01956 <a class="code" href="vector_8c.html#a055608d1a3726b7cb26e3e8074764ba0">Vector_Free</a>(denoms);
<a name="l01957"></a>01957 }
</pre></div></div>
<hr size="1"/><address style="text-align: right;"><small>Generated on Wed Nov 25 17:45:26 2009 for polylib by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
</body>
</html>
|
