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
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>polylib: ehrhart.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<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>
<h1>ehrhart.c</h1><a href="ehrhart_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">/* Ehrhart V4.20 */</span>
<a name="l00003"></a>00003 <span class="comment">/* copyright 1997, Doran Wilde */</span>
<a name="l00004"></a>00004 <span class="comment">/* copyright 1997-2000, Vincent Loechner */</span>
<a name="l00005"></a>00005 <span class="comment">/* Permission is granted to copy, use, and distribute */</span>
<a name="l00006"></a>00006 <span class="comment">/* for any commercial or noncommercial purpose under the terms */</span>
<a name="l00007"></a>00007 <span class="comment">/* of the GNU General Public license, version 2, June 1991 */</span>
<a name="l00008"></a>00008 <span class="comment">/* (see file : LICENSING). */</span>
<a name="l00009"></a>00009 <span class="comment">/***********************************************************************/</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="preprocessor">#include <stdio.h></span>
<a name="l00012"></a>00012 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00013"></a>00013 <span class="preprocessor">#include <ctype.h></span>
<a name="l00014"></a>00014 <span class="preprocessor">#include <string.h></span>
<a name="l00015"></a>00015 <span class="preprocessor">#include <unistd.h></span>
<a name="l00016"></a>00016 <span class="preprocessor">#include <<a class="code" href="assert_8h.html">assert.h</a>></span>
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="preprocessor">#include <<a class="code" href="polylib_8h.html">polylib/polylib.h</a>></span>
<a name="l00019"></a>00019 <span class="preprocessor">#include <<a class="code" href="homogenization_8h.html">polylib/homogenization.h</a>></span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="comment"></span>
<a name="l00022"></a>00022 <span class="comment">/*! \class Ehrhart</span>
<a name="l00023"></a>00023 <span class="comment"></span>
<a name="l00024"></a>00024 <span class="comment">The following are mainly for debug purposes. You shouldn't need to</span>
<a name="l00025"></a>00025 <span class="comment">change anything for daily usage...</span>
<a name="l00026"></a>00026 <span class="comment"></span>
<a name="l00027"></a>00027 <span class="comment"><p></span>
<a name="l00028"></a>00028 <span class="comment"></span>
<a name="l00029"></a>00029 <span class="comment">you may define each macro independently </span>
<a name="l00030"></a>00030 <span class="comment"><ol></span>
<a name="l00031"></a>00031 <span class="comment"><li> #define EDEBUG minimal debug </span>
<a name="l00032"></a>00032 <span class="comment"><li> #define EDEBUG1 prints enumeration points</span>
<a name="l00033"></a>00033 <span class="comment"><li> #define EDEBUG11 prints number of points</span>
<a name="l00034"></a>00034 <span class="comment"><li> #define EDEBUG2 prints domains</span>
<a name="l00035"></a>00035 <span class="comment"><li> #define EDEBUG21 prints more domains</span>
<a name="l00036"></a>00036 <span class="comment"><li> #define EDEBUG3 prints systems of equations that are solved</span>
<a name="l00037"></a>00037 <span class="comment"><li> #define EDEBUG4 prints message for degree reduction</span>
<a name="l00038"></a>00038 <span class="comment"><li> #define EDEBUG5 prints result before simplification </span>
<a name="l00039"></a>00039 <span class="comment"><li> #define EDEBUG6 prints domains in Preprocess </span>
<a name="l00040"></a>00040 <span class="comment"><li> #define EDEBUG61 prints even more in Preprocess</span>
<a name="l00041"></a>00041 <span class="comment"><li> #define EDEBUG62 prints domains in Preprocess2</span>
<a name="l00042"></a>00042 <span class="comment"></ol></span>
<a name="l00043"></a>00043 <span class="comment">*/</span>
<a name="l00044"></a>00044
<a name="l00045"></a>00045 <span class="comment"></span>
<a name="l00046"></a>00046 <span class="comment">/** </span>
<a name="l00047"></a>00047 <span class="comment"> </span>
<a name="l00048"></a>00048 <span class="comment">define this to print all constraints on the validity domains if not</span>
<a name="l00049"></a>00049 <span class="comment">defined, only new constraints (not in validity domain given by the</span>
<a name="l00050"></a>00050 <span class="comment">user) are printed</span>
<a name="l00051"></a>00051 <span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment">*/</span>
<a name="l00053"></a><a class="code" href="ehrhart_8c.html#de591ac8b3c36da1f2115f2dcaa1f75c">00053</a> <span class="preprocessor">#define EPRINT_ALL_VALIDITY_CONSTRAINTS</span>
<a name="l00054"></a>00054 <span class="preprocessor"></span>
<a name="l00055"></a>00055 <span class="comment">/* #define EDEBUG */</span> <span class="comment">/* minimal debug */</span>
<a name="l00056"></a>00056 <span class="comment">/* #define EDEBUG1 */</span> <span class="comment">/* prints enumeration points */</span>
<a name="l00057"></a>00057 <span class="comment">/* #define EDEBUG11 */</span> <span class="comment">/* prints number of points */</span>
<a name="l00058"></a>00058 <span class="comment">/* #define EDEBUG2 */</span> <span class="comment">/* prints domains */</span>
<a name="l00059"></a>00059 <span class="comment">/* #define EDEBUG21 */</span> <span class="comment">/* prints more domains */</span>
<a name="l00060"></a>00060 <span class="comment">/* #define EDEBUG3 */</span> <span class="comment">/* prints systems of equations that are solved */</span>
<a name="l00061"></a>00061 <span class="comment">/* #define EDEBUG4 */</span> <span class="comment">/* prints message for degree reduction */</span>
<a name="l00062"></a>00062 <span class="comment">/* #define EDEBUG5 */</span> <span class="comment">/* prints result before simplification */</span>
<a name="l00063"></a>00063 <span class="comment">/* #define EDEBUG6 */</span> <span class="comment">/* prints domains in Preprocess */</span>
<a name="l00064"></a>00064 <span class="comment">/* #define EDEBUG61 */</span> <span class="comment">/* prints even more in Preprocess */</span>
<a name="l00065"></a>00065 <span class="comment">/* #define EDEBUG62 */</span> <span class="comment">/* prints domains in Preprocess2 */</span>
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="comment"></span>
<a name="l00068"></a>00068 <span class="comment">/**</span>
<a name="l00069"></a>00069 <span class="comment"> Reduce the degree of resulting polynomials</span>
<a name="l00070"></a>00070 <span class="comment">*/</span>
<a name="l00071"></a><a class="code" href="ehrhart_8c.html#b33c076ab65d4d23c5a4f6a496b0aefb">00071</a> <span class="preprocessor">#define REDUCE_DEGREE</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00073"></a>00073 <span class="comment">/** </span>
<a name="l00074"></a>00074 <span class="comment">define this to print one warning message per domain overflow these</span>
<a name="l00075"></a>00075 <span class="comment">overflows should no longer happen since version 4.20</span>
<a name="l00076"></a>00076 <span class="comment">*/</span>
<a name="l00077"></a><a class="code" href="ehrhart_8c.html#b82d76b3dd0632715d69af9117f9c6ed">00077</a> <span class="preprocessor">#define ALL_OVERFLOW_WARNINGS</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span>
<a name="l00079"></a>00079 <span class="comment">/******************* -----------END USER #DEFS-------- *********************/</span>
<a name="l00080"></a>00080
<a name="l00081"></a><a class="code" href="ehrhart_8h.html#b969ed82da60f7f4fe87c5741311606b">00081</a> <span class="keywordtype">int</span> <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 1;
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="comment">/*-------------------------------------------------------------------*/</span>
<a name="l00084"></a>00084 <span class="comment">/* EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM */</span>
<a name="l00085"></a>00085 <span class="comment">/*-------------------------------------------------------------------*/</span> <span class="comment"></span>
<a name="l00086"></a>00086 <span class="comment">/** </span>
<a name="l00087"></a>00087 <span class="comment"></span>
<a name="l00088"></a>00088 <span class="comment">EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM. The newly allocated enode</span>
<a name="l00089"></a>00089 <span class="comment">can be freed with a simple free(x)</span>
<a name="l00090"></a>00090 <span class="comment"></span>
<a name="l00091"></a>00091 <span class="comment">@param type : enode type</span>
<a name="l00092"></a>00092 <span class="comment">@param size : degree+1 for polynomial, period for periodic</span>
<a name="l00093"></a>00093 <span class="comment">@param pos : 1..nb_param, position of parameter </span>
<a name="l00094"></a>00094 <span class="comment">@return a newly allocated enode </span>
<a name="l00095"></a>00095 <span class="comment"></span>
<a name="l00096"></a>00096 <span class="comment">*/</span>
<a name="l00097"></a><a class="code" href="ehrhart_8h.html#7acd3dfb7d74bf5551bce6f31f7189bc">00097</a> <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed">enode_type</a> type,<span class="keywordtype">int</span> <a class="code" href="vector_8c.html#439227feff9d7f55384e8780cfc2eb82">size</a>,<span class="keywordtype">int</span> pos) {
<a name="l00098"></a>00098
<a name="l00099"></a>00099 <a class="code" href="struct__enode.html">enode</a> *res;
<a name="l00100"></a>00100 <span class="keywordtype">int</span> i;
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keywordflow">if</span>(size == 0) {
<a name="l00103"></a>00103 fprintf(stderr, <span class="stringliteral">"Allocating enode of size 0 !\n"</span> );
<a name="l00104"></a>00104 <span class="keywordflow">return</span> NULL;
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106 res = (<a class="code" href="struct__enode.html">enode</a> *) malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enode.html">enode</a>) + (size-1)*<span class="keyword">sizeof</span>(<a class="code" href="struct__evalue.html">evalue</a>));
<a name="l00107"></a>00107 res-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> = type;
<a name="l00108"></a>00108 res-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> = size;
<a name="l00109"></a>00109 res-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a> = pos;
<a name="l00110"></a>00110 <span class="keywordflow">for</span>(i=0; i<size; i++) {
<a name="l00111"></a>00111 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00112"></a>00112 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l00113"></a>00113 res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p = 0;
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115 <span class="keywordflow">return</span> res;
<a name="l00116"></a>00116 } <span class="comment">/* new_enode */</span>
<a name="l00117"></a>00117 <span class="comment"></span>
<a name="l00118"></a>00118 <span class="comment">/**</span>
<a name="l00119"></a>00119 <span class="comment">releases all memory referenced by e. (recursive) </span>
<a name="l00120"></a>00120 <span class="comment">@param e pointer to an evalue</span>
<a name="l00121"></a>00121 <span class="comment">*/</span>
<a name="l00122"></a><a class="code" href="ehrhart_8h.html#96434ed8279f7999773fa3343cfe98b8">00122</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(<a class="code" href="struct__evalue.html">evalue</a> *e) {
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00125"></a>00125 <span class="keywordtype">int</span> i;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="comment">/* 'e' stores a constant */</span>
<a name="l00130"></a>00130 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00131"></a>00131 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(e->x.n);
<a name="l00132"></a>00132 <span class="keywordflow">return</span>;
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00135"></a>00135 p = e->x.p;
<a name="l00136"></a>00136 <span class="keywordflow">if</span> (!p) <span class="keywordflow">return</span>; <span class="comment">/* null pointer */</span>
<a name="l00137"></a>00137 <span class="keywordflow">for</span> (i=0; i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++) {
<a name="l00138"></a>00138 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&(p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]));
<a name="l00139"></a>00139 }
<a name="l00140"></a>00140 free(p);
<a name="l00141"></a>00141 <span class="keywordflow">return</span>;
<a name="l00142"></a>00142 } <span class="comment">/* free_evalue_refs */</span>
<a name="l00143"></a>00143 <span class="comment"></span>
<a name="l00144"></a>00144 <span class="comment">/**</span>
<a name="l00145"></a>00145 <span class="comment"></span>
<a name="l00146"></a>00146 <span class="comment">@param e pointer to an evalue </span>
<a name="l00147"></a>00147 <span class="comment">@return description</span>
<a name="l00148"></a>00148 <span class="comment"></span>
<a name="l00149"></a>00149 <span class="comment">*/</span>
<a name="l00150"></a><a class="code" href="ehrhart_8h.html#c94c9f3a408511c6ea5defdc47eb6563">00150</a> <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(<a class="code" href="struct__enode.html">enode</a> *e) {
<a name="l00151"></a>00151
<a name="l00152"></a>00152 <a class="code" href="struct__enode.html">enode</a> *res;
<a name="l00153"></a>00153 <span class="keywordtype">int</span> i;
<a name="l00154"></a>00154
<a name="l00155"></a>00155 res = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(e-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a>,e-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>,e-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>);
<a name="l00156"></a>00156 <span class="keywordflow">for</span>(i=0;i<e-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>;++i) {
<a name="l00157"></a>00157 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00158"></a>00158 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00159"></a>00159 res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p = <a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(e-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p);
<a name="l00160"></a>00160 <span class="keywordflow">else</span> {
<a name="l00161"></a>00161 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n);
<a name="l00162"></a>00162 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n,e-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n);
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164 }
<a name="l00165"></a>00165 <span class="keywordflow">return</span>(res);
<a name="l00166"></a>00166 } <span class="comment">/* ecopy */</span>
<a name="l00167"></a>00167 <span class="comment"></span>
<a name="l00168"></a>00168 <span class="comment">/**</span>
<a name="l00169"></a>00169 <span class="comment"></span>
<a name="l00170"></a>00170 <span class="comment">@param DST destination file</span>
<a name="l00171"></a>00171 <span class="comment">@param e pointer to evalue to be printed</span>
<a name="l00172"></a>00172 <span class="comment">@param pname array of strings, name of the parameters</span>
<a name="l00173"></a>00173 <span class="comment"></span>
<a name="l00174"></a>00174 <span class="comment">*/</span>
<a name="l00175"></a><a class="code" href="ehrhart_8h.html#99718adf05e065181f35f5ca847f94b0">00175</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(FILE *DST, <a class="code" href="struct__evalue.html">evalue</a> *e, <span class="keyword">const</span> <span class="keywordtype">char</span> **pname)
<a name="l00176"></a>00176 {
<a name="l00177"></a>00177 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00178"></a>00178 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00179"></a>00179 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,e->x.n);
<a name="l00180"></a>00180 fprintf(DST,<span class="stringliteral">"/"</span>);
<a name="l00181"></a>00181 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00182"></a>00182 }
<a name="l00183"></a>00183 <span class="keywordflow">else</span> {
<a name="l00184"></a>00184 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(DST,VALUE_FMT,e->x.n);
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186 }
<a name="l00187"></a>00187 <span class="keywordflow">else</span>
<a name="l00188"></a>00188 <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(DST,e->x.p,pname);
<a name="l00189"></a>00189 <span class="keywordflow">return</span>;
<a name="l00190"></a>00190 } <span class="comment">/* print_evalue */</span>
<a name="l00191"></a>00191 <span class="comment"></span>
<a name="l00192"></a>00192 <span class="comment">/** prints the enode to DST </span>
<a name="l00193"></a>00193 <span class="comment"></span>
<a name="l00194"></a>00194 <span class="comment">@param DST destination file </span>
<a name="l00195"></a>00195 <span class="comment">@param p pointer to enode to be printed </span>
<a name="l00196"></a>00196 <span class="comment">@param pname array of strings, name of the parameters</span>
<a name="l00197"></a>00197 <span class="comment"></span>
<a name="l00198"></a>00198 <span class="comment">*/</span>
<a name="l00199"></a><a class="code" href="ehrhart_8h.html#84dff5d1187317811e98a92ac8a37fa3">00199</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(FILE *DST, <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>, <span class="keyword">const</span> <span class="keywordtype">char</span> **pname)
<a name="l00200"></a>00200 {
<a name="l00201"></a>00201 <span class="keywordtype">int</span> i;
<a name="l00202"></a>00202
<a name="l00203"></a>00203 <span class="keywordflow">if</span> (!p) {
<a name="l00204"></a>00204 fprintf(DST, <span class="stringliteral">"NULL"</span>);
<a name="l00205"></a>00205 <span class="keywordflow">return</span>;
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207 <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fedcabe6900b0394de2166c488c664bdd6a">evector</a>) {
<a name="l00208"></a>00208 fprintf(DST, <span class="stringliteral">"{ "</span>);
<a name="l00209"></a>00209 <span class="keywordflow">for</span> (i=0; i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++) {
<a name="l00210"></a>00210 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(DST, &p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i], pname);
<a name="l00211"></a>00211 <span class="keywordflow">if</span> (i!=(p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>-1))
<a name="l00212"></a>00212 fprintf(DST, <span class="stringliteral">", "</span>);
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214 fprintf(DST, <span class="stringliteral">" }\n"</span>);
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00217"></a>00217 fprintf(DST, <span class="stringliteral">"( "</span>);
<a name="l00218"></a>00218 <span class="keywordflow">for</span> (i=p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>-1; i>=0; i--) {
<a name="l00219"></a>00219 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(DST, &p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i], pname);
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (i==1) fprintf(DST, <span class="stringliteral">" * %s + "</span>, pname[p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>-1]);
<a name="l00221"></a>00221 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i>1)
<a name="l00222"></a>00222 fprintf(DST, <span class="stringliteral">" * %s^%d + "</span>, pname[p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>-1], i);
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224 fprintf(DST, <span class="stringliteral">" )\n"</span>);
<a name="l00225"></a>00225 }
<a name="l00226"></a>00226 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00227"></a>00227 fprintf(DST, <span class="stringliteral">"[ "</span>);
<a name="l00228"></a>00228 <span class="keywordflow">for</span> (i=0; i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++) {
<a name="l00229"></a>00229 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(DST, &p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i], pname);
<a name="l00230"></a>00230 <span class="keywordflow">if</span> (i!=(p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>-1)) fprintf(DST, <span class="stringliteral">", "</span>);
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232 fprintf(DST,<span class="stringliteral">" ]_%s"</span>, pname[p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>-1]);
<a name="l00233"></a>00233 }
<a name="l00234"></a>00234 <span class="keywordflow">return</span>;
<a name="l00235"></a>00235 } <span class="comment">/* print_enode */</span>
<a name="l00236"></a>00236 <span class="comment"></span>
<a name="l00237"></a>00237 <span class="comment">/**</span>
<a name="l00238"></a>00238 <span class="comment"></span>
<a name="l00239"></a>00239 <span class="comment">@param e1 pointers to evalues</span>
<a name="l00240"></a>00240 <span class="comment">@param e2 pointers to evalues</span>
<a name="l00241"></a>00241 <span class="comment">@return 1 (true) if they are equal, 0 (false) if not </span>
<a name="l00242"></a>00242 <span class="comment"></span>
<a name="l00243"></a>00243 <span class="comment">*/</span>
<a name="l00244"></a><a class="code" href="ehrhart_8c.html#03dd4a71e96871ad08f6e139fac7876c">00244</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ehrhart_8c.html#03dd4a71e96871ad08f6e139fac7876c">eequal</a>(<a class="code" href="struct__evalue.html">evalue</a> *e1,<a class="code" href="struct__evalue.html">evalue</a> *e2) {
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="keywordtype">int</span> i;
<a name="l00247"></a>00247 <a class="code" href="struct__enode.html">enode</a> *p1, *p2;
<a name="l00248"></a>00248
<a name="l00249"></a>00249 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e2-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00250"></a>00250 <span class="keywordflow">return</span> 0;
<a name="l00251"></a>00251
<a name="l00252"></a>00252 <span class="comment">/* e1->d == e2->d */</span>
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00254"></a>00254 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(e1->x.n,e2->x.n))
<a name="l00255"></a>00255 <span class="keywordflow">return</span> 0;
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="comment">/* e1->d == e2->d != 0 AND e1->n == e2->n */</span>
<a name="l00258"></a>00258 <span class="keywordflow">return</span> 1;
<a name="l00259"></a>00259 }
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="comment">/* e1->d == e2->d == 0 */</span>
<a name="l00262"></a>00262 p1 = e1->x.p;
<a name="l00263"></a>00263 p2 = e2->x.p;
<a name="l00264"></a>00264 <span class="keywordflow">if</span> (p1-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> != p2-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a>) <span class="keywordflow">return</span> 0;
<a name="l00265"></a>00265 <span class="keywordflow">if</span> (p1-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> != p2-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>) <span class="keywordflow">return</span> 0;
<a name="l00266"></a>00266 <span class="keywordflow">if</span> (p1-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a> != p2-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>) <span class="keywordflow">return</span> 0;
<a name="l00267"></a>00267 <span class="keywordflow">for</span> (i=0; i<p1-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++)
<a name="l00268"></a>00268 <span class="keywordflow">if</span> (!<a class="code" href="ehrhart_8c.html#03dd4a71e96871ad08f6e139fac7876c">eequal</a>(&p1-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i], &p2-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]) )
<a name="l00269"></a>00269 <span class="keywordflow">return</span> 0;
<a name="l00270"></a>00270 <span class="keywordflow">return</span> 1;
<a name="l00271"></a>00271 } <span class="comment">/* eequal */</span>
<a name="l00272"></a>00272 <span class="comment"></span>
<a name="l00273"></a>00273 <span class="comment">/** </span>
<a name="l00274"></a>00274 <span class="comment"></span>
<a name="l00275"></a>00275 <span class="comment">@param e pointer to an evalue</span>
<a name="l00276"></a>00276 <span class="comment"></span>
<a name="l00277"></a>00277 <span class="comment">*/</span>
<a name="l00278"></a><a class="code" href="ehrhart_8h.html#e02ef07ca7d9de519ffe46a89e941bb8">00278</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#e02ef07ca7d9de519ffe46a89e941bb8">reduce_evalue</a> (<a class="code" href="struct__evalue.html">evalue</a> *e) {
<a name="l00279"></a>00279
<a name="l00280"></a>00280 <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00281"></a>00281 <span class="keywordtype">int</span> i, j, k;
<a name="l00282"></a>00282
<a name="l00283"></a>00283 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00284"></a>00284 <span class="keywordflow">return</span>; <span class="comment">/* a rational number, its already reduced */</span>
<a name="l00285"></a>00285 <span class="keywordflow">if</span>(!(p = e->x.p))
<a name="l00286"></a>00286 <span class="keywordflow">return</span>; <span class="comment">/* hum... an overflow probably occured */</span>
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="comment">/* First reduce the components of p */</span>
<a name="l00289"></a>00289 <span class="keywordflow">for</span> (i=0; i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++)
<a name="l00290"></a>00290 <a class="code" href="ehrhart_8c.html#e02ef07ca7d9de519ffe46a89e941bb8">reduce_evalue</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]);
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a>==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <span class="comment">/* Try to reduce the period */</span>
<a name="l00295"></a>00295 <span class="keywordflow">for</span> (i=1; i<=(p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>)/2; i++) {
<a name="l00296"></a>00296 <span class="keywordflow">if</span> ((p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> % i)==0) {
<a name="l00297"></a>00297
<a name="l00298"></a>00298 <span class="comment">/* Can we reduce the size to i ? */</span>
<a name="l00299"></a>00299 <span class="keywordflow">for</span> (j=0; j<i; j++)
<a name="l00300"></a>00300 <span class="keywordflow">for</span> (k=j+i; k<e->x.p->size; k+=i)
<a name="l00301"></a>00301 <span class="keywordflow">if</span> (!<a class="code" href="ehrhart_8c.html#03dd4a71e96871ad08f6e139fac7876c">eequal</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j], &p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[k])) <span class="keywordflow">goto</span> you_lose;
<a name="l00302"></a>00302
<a name="l00303"></a>00303 <span class="comment">/* OK, lets do it */</span>
<a name="l00304"></a>00304 <span class="keywordflow">for</span> (j=i; j<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; j++) <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j]);
<a name="l00305"></a>00305 p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> = i;
<a name="l00306"></a>00306 <span class="keywordflow">break</span>;
<a name="l00307"></a>00307
<a name="l00308"></a>00308 you_lose: <span class="comment">/* OK, lets not do it */</span>
<a name="l00309"></a>00309 <span class="keywordflow">continue</span>;
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311 }
<a name="l00312"></a>00312
<a name="l00313"></a>00313 <span class="comment">/* Try to reduce its strength */</span>
<a name="l00314"></a>00314 <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> == 1) {
<a name="l00315"></a>00315 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00316"></a>00316 memcpy(e,&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[0],<span class="keyword">sizeof</span>(<a class="code" href="struct__evalue.html">evalue</a>));
<a name="l00317"></a>00317 free(p);
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a>==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00321"></a>00321
<a name="l00322"></a>00322 <span class="comment">/* Try to reduce the degree */</span>
<a name="l00323"></a>00323 <span class="keywordflow">for</span> (i=p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>-1;i>=1;i--) {
<a name="l00324"></a>00324 <span class="keywordflow">if</span> (!(<a class="code" href="source_2arith_2arithmetique_8h.html#61db0ba9ba925615ec70eb92e40b9ef4">value_one_p</a>(p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n)))
<a name="l00325"></a>00325 <span class="keywordflow">break</span>;
<a name="l00326"></a>00326 <span class="comment">/* Zero coefficient */</span>
<a name="l00327"></a>00327 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]);
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329 <span class="keywordflow">if</span> (i+1<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>)
<a name="l00330"></a>00330 p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> = i+1;
<a name="l00331"></a>00331
<a name="l00332"></a>00332 <span class="comment">/* Try to reduce its strength */</span>
<a name="l00333"></a>00333 <span class="keywordflow">if</span> (p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> == 1) {
<a name="l00334"></a>00334 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00335"></a>00335 memcpy(e,&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[0],<span class="keyword">sizeof</span>(<a class="code" href="struct__evalue.html">evalue</a>));
<a name="l00336"></a>00336 free(p);
<a name="l00337"></a>00337 }
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339 } <span class="comment">/* reduce_evalue */</span>
<a name="l00340"></a>00340
<a name="l00341"></a>00341 <span class="comment"></span>
<a name="l00342"></a>00342 <span class="comment">/**</span>
<a name="l00343"></a>00343 <span class="comment"></span>
<a name="l00344"></a>00344 <span class="comment">multiplies two evalues and puts the result in res</span>
<a name="l00345"></a>00345 <span class="comment"></span>
<a name="l00346"></a>00346 <span class="comment">@param e1 pointer to an evalue</span>
<a name="l00347"></a>00347 <span class="comment">@param e2 pointer to a constant evalue</span>
<a name="l00348"></a>00348 <span class="comment">@param res pointer to result evalue = e1 * e2</span>
<a name="l00349"></a>00349 <span class="comment"></span>
<a name="l00350"></a>00350 <span class="comment">*/</span>
<a name="l00351"></a><a class="code" href="ehrhart_8c.html#3a8e18373734df7cbd2681aa3e19212f">00351</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#3a8e18373734df7cbd2681aa3e19212f" title="multiplies two evalues and puts the result in res">emul</a> (<a class="code" href="struct__evalue.html">evalue</a> *e1,<a class="code" href="struct__evalue.html">evalue</a> *e2,<a class="code" href="struct__evalue.html">evalue</a> *res) {
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00354"></a>00354 <span class="keywordtype">int</span> i;
<a name="l00355"></a>00355 Value g;
<a name="l00356"></a>00356
<a name="l00357"></a>00357 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(e2-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00358"></a>00358 fprintf(stderr, <span class="stringliteral">"emul: ?expecting constant value\n"</span>);
<a name="l00359"></a>00359 <span class="keywordflow">return</span>;
<a name="l00360"></a>00360 }
<a name="l00361"></a>00361 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(g);
<a name="l00362"></a>00362 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00363"></a>00363
<a name="l00364"></a>00364 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res->x.n);
<a name="l00365"></a>00365 <span class="comment">/* Product of two rational numbers */</span>
<a name="l00366"></a>00366 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e2-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00367"></a>00367 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(res->x.n,e1->x.n,e2->x.n );
<a name="l00368"></a>00368 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(g, res->x.n, res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00369"></a>00369 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(g)) {
<a name="l00370"></a>00370 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, g);
<a name="l00371"></a>00371 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res->x.n, res->x.n, g);
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373 }
<a name="l00374"></a>00374 <span class="keywordflow">else</span> { <span class="comment">/* e1 is an expression */</span>
<a name="l00375"></a>00375 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l00376"></a>00376 p = e1->x.p;
<a name="l00377"></a>00377 res->x.p = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(p-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a>, p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>, p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>);
<a name="l00378"></a>00378 <span class="keywordflow">for</span> (i=0; i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++) {
<a name="l00379"></a>00379 <a class="code" href="ehrhart_8c.html#3a8e18373734df7cbd2681aa3e19212f" title="multiplies two evalues and puts the result in res">emul</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i], e2, &(res->x.p->arr[i]) );
<a name="l00380"></a>00380 }
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g);
<a name="l00383"></a>00383 <span class="keywordflow">return</span>;
<a name="l00384"></a>00384 } <span class="comment">/* emul */</span>
<a name="l00385"></a>00385 <span class="comment"></span>
<a name="l00386"></a>00386 <span class="comment">/**</span>
<a name="l00387"></a>00387 <span class="comment">adds one evalue to evalue 'res. result = res + e1 </span>
<a name="l00388"></a>00388 <span class="comment"></span>
<a name="l00389"></a>00389 <span class="comment">@param e1 an evalue </span>
<a name="l00390"></a>00390 <span class="comment">@param res </span>
<a name="l00391"></a>00391 <span class="comment"></span>
<a name="l00392"></a>00392 <span class="comment">*/</span>
<a name="l00393"></a><a class="code" href="ehrhart_8h.html#62b0031a3ec0fb5e8c88bcf291c006a0">00393</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(<a class="code" href="struct__evalue.html">evalue</a> *e1,<a class="code" href="struct__evalue.html">evalue</a> *res) {
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="keywordtype">int</span> i;
<a name="l00396"></a>00396 Value g,m1,m2;
<a name="l00397"></a>00397
<a name="l00398"></a>00398 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(g);
<a name="l00399"></a>00399 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1);
<a name="l00400"></a>00400 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00401"></a>00401
<a name="l00402"></a>00402 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00403"></a>00403
<a name="l00404"></a>00404 <span class="comment">/* Add two rational numbers*/</span>
<a name="l00405"></a>00405 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m1,e1->x.n,res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00406"></a>00406 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m2,res->x.n,e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00407"></a>00407 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(res->x.n,m1,m2);
<a name="l00408"></a>00408 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00409"></a>00409 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(g, res->x.n, res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00410"></a>00410 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(g)) {
<a name="l00411"></a>00411 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, g);
<a name="l00412"></a>00412 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res->x.n, res->x.n, g);
<a name="l00413"></a>00413 }
<a name="l00414"></a>00414 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00415"></a>00415 <span class="keywordflow">return</span>;
<a name="l00416"></a>00416 }
<a name="l00417"></a>00417 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00418"></a>00418 <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="comment">/* Add the constant to the constant term */</span>
<a name="l00421"></a>00421 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(e1, &res->x.p->arr[0]);
<a name="l00422"></a>00422 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00423"></a>00423 <span class="keywordflow">return</span>;
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00426"></a>00426
<a name="l00427"></a>00427 <span class="comment">/* Add the constant to all elements of periodic number */</span>
<a name="l00428"></a>00428 <span class="keywordflow">for</span> (i=0; i<res->x.p->size; i++) {
<a name="l00429"></a>00429 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(e1, &res->x.p->arr[i]);
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00432"></a>00432 <span class="keywordflow">return</span>;
<a name="l00433"></a>00433 }
<a name="l00434"></a>00434 <span class="keywordflow">else</span> {
<a name="l00435"></a>00435 fprintf(stderr, <span class="stringliteral">"eadd: cannot add const with vector\n"</span>);
<a name="l00436"></a>00436 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00437"></a>00437 <span class="keywordflow">return</span>;
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439 }
<a name="l00440"></a>00440 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00441"></a>00441 fprintf(stderr,<span class="stringliteral">"eadd: cannot add evalue to const\n"</span>);
<a name="l00442"></a>00442 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00443"></a>00443 <span class="keywordflow">return</span>;
<a name="l00444"></a>00444 }
<a name="l00445"></a>00445 <span class="keywordflow">else</span> { <span class="comment">/* ((e1->d==0) && (res->d==0)) */</span>
<a name="l00446"></a>00446 <span class="keywordflow">if</span> ((e1->x.p->type != res->x.p->type) ||
<a name="l00447"></a>00447 (e1->x.p->pos != res->x.p->pos )) {
<a name="l00448"></a>00448 fprintf(stderr, <span class="stringliteral">"eadd: ?cannot add, incompatible types\n"</span>);
<a name="l00449"></a>00449 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00450"></a>00450 <span class="keywordflow">return</span>;
<a name="l00451"></a>00451 }
<a name="l00452"></a>00452 <span class="keywordflow">if</span> (e1->x.p->size == res->x.p->size) {
<a name="l00453"></a>00453 <span class="keywordflow">for</span> (i=0; i<res->x.p->size; i++) {
<a name="l00454"></a>00454 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(&e1->x.p->arr[i], &res->x.p->arr[i]);
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00457"></a>00457 <span class="keywordflow">return</span>;
<a name="l00458"></a>00458 }
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="comment">/* Sizes are different */</span>
<a name="l00461"></a>00461 <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="comment">/* VIN100: if e1-size > res-size you have to copy e1 in a */</span>
<a name="l00464"></a>00464 <span class="comment">/* new enode and add res to that new node. If you do not do */</span>
<a name="l00465"></a>00465 <span class="comment">/* that, you lose the the upper weight part of e1 ! */</span>
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <span class="keywordflow">if</span>(e1->x.p->size > res->x.p->size) {
<a name="l00468"></a>00468 <a class="code" href="struct__enode.html">enode</a> *tmp;
<a name="l00469"></a>00469 tmp = <a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(e1->x.p);
<a name="l00470"></a>00470 <span class="keywordflow">for</span>(i=0;i<res->x.p->size;++i) {
<a name="l00471"></a>00471 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(&res->x.p->arr[i], &tmp-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]);
<a name="l00472"></a>00472 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&res->x.p->arr[i]);
<a name="l00473"></a>00473 }
<a name="l00474"></a>00474 res->x.p = tmp;
<a name="l00475"></a>00475 }
<a name="l00476"></a>00476 <span class="keywordflow">else</span> {
<a name="l00477"></a>00477 <span class="keywordflow">for</span> (i=0; i<e1->x.p->size ; i++) {
<a name="l00478"></a>00478 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(&e1->x.p->arr[i], &res->x.p->arr[i]);
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00481"></a>00481 <span class="keywordflow">return</span>;
<a name="l00482"></a>00482 }
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00485"></a>00485 fprintf(stderr, <span class="stringliteral">"eadd: ?addition of different sized periodic nos\n"</span>);
<a name="l00486"></a>00486 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00487"></a>00487 <span class="keywordflow">return</span>;
<a name="l00488"></a>00488 }
<a name="l00489"></a>00489 <span class="keywordflow">else</span> { <span class="comment">/* evector */</span>
<a name="l00490"></a>00490 fprintf(stderr, <span class="stringliteral">"eadd: ?cannot add vectors of different length\n"</span>);
<a name="l00491"></a>00491 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00492"></a>00492 <span class="keywordflow">return</span>;
<a name="l00493"></a>00493 }
<a name="l00494"></a>00494 }
<a name="l00495"></a>00495 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00496"></a>00496 <span class="keywordflow">return</span>;
<a name="l00497"></a>00497 } <span class="comment">/* eadd */</span>
<a name="l00498"></a>00498 <span class="comment"></span>
<a name="l00499"></a>00499 <span class="comment">/** </span>
<a name="l00500"></a>00500 <span class="comment"></span>
<a name="l00501"></a>00501 <span class="comment">computes the inner product of two vectors. Result = result (evalue) =</span>
<a name="l00502"></a>00502 <span class="comment">v1.v2 (dot product)</span>
<a name="l00503"></a>00503 <span class="comment"></span>
<a name="l00504"></a>00504 <span class="comment">@param v1 an enode (vector)</span>
<a name="l00505"></a>00505 <span class="comment">@param v2 an enode (vector of constants)</span>
<a name="l00506"></a>00506 <span class="comment">@param res result (evalue)</span>
<a name="l00507"></a>00507 <span class="comment"></span>
<a name="l00508"></a>00508 <span class="comment">*/</span>
<a name="l00509"></a><a class="code" href="ehrhart_8h.html#197ef6aec479254f610d450de8890d02">00509</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#197ef6aec479254f610d450de8890d02" title="computes the inner product of two vectors.">edot</a>(<a class="code" href="struct__enode.html">enode</a> *v1,<a class="code" href="struct__enode.html">enode</a> *v2,<a class="code" href="struct__evalue.html">evalue</a> *res) {
<a name="l00510"></a>00510
<a name="l00511"></a>00511 <span class="keywordtype">int</span> i;
<a name="l00512"></a>00512 <a class="code" href="struct__evalue.html">evalue</a> tmp;
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="keywordflow">if</span> ((v1-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> != <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fedcabe6900b0394de2166c488c664bdd6a">evector</a>) || (v2-><a class="code" href="struct__enode.html#36787a943f0f24530a8934c48a69d282">type</a> != <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fedcabe6900b0394de2166c488c664bdd6a">evector</a>)) {
<a name="l00515"></a>00515 fprintf(stderr, <span class="stringliteral">"edot: ?expecting vectors\n"</span>);
<a name="l00516"></a>00516 <span class="keywordflow">return</span>;
<a name="l00517"></a>00517 }
<a name="l00518"></a>00518 <span class="keywordflow">if</span> (v1-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a> != v2-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>) {
<a name="l00519"></a>00519 fprintf(stderr, <span class="stringliteral">"edot: ? vector lengths do not agree\n"</span>);
<a name="l00520"></a>00520 <span class="keywordflow">return</span>;
<a name="l00521"></a>00521 }
<a name="l00522"></a>00522 <span class="keywordflow">if</span> (v1-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a><=0) {
<a name="l00523"></a>00523 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,1); <span class="comment">/* set result to 0/1 */</span>
<a name="l00524"></a>00524 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res->x.n);
<a name="l00525"></a>00525 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res->x.n,0);
<a name="l00526"></a>00526 <span class="keywordflow">return</span>;
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528
<a name="l00529"></a>00529 <span class="comment">/* vector v2 is expected to have only rational numbers in */</span>
<a name="l00530"></a>00530 <span class="comment">/* the array. No pointers. */</span>
<a name="l00531"></a>00531 <a class="code" href="ehrhart_8c.html#3a8e18373734df7cbd2681aa3e19212f" title="multiplies two evalues and puts the result in res">emul</a>(&v1-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[0],&v2-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[0],res);
<a name="l00532"></a>00532 <span class="keywordflow">for</span> (i=1; i<v1-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>; i++) {
<a name="l00533"></a>00533 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00534"></a>00534
<a name="l00535"></a>00535 <span class="comment">/* res = res + v1[i]*v2[i] */</span>
<a name="l00536"></a>00536 <a class="code" href="ehrhart_8c.html#3a8e18373734df7cbd2681aa3e19212f" title="multiplies two evalues and puts the result in res">emul</a>(&v1-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i],&v2-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i],&tmp);
<a name="l00537"></a>00537 <a class="code" href="ehrhart_8c.html#62b0031a3ec0fb5e8c88bcf291c006a0" title="adds one evalue to evalue &#39;res.">eadd</a>(&tmp,res);
<a name="l00538"></a>00538 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&tmp);
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540 <span class="keywordflow">return</span>;
<a name="l00541"></a>00541 } <span class="comment">/* edot */</span>
<a name="l00542"></a>00542 <span class="comment"></span>
<a name="l00543"></a>00543 <span class="comment">/**</span>
<a name="l00544"></a>00544 <span class="comment"></span>
<a name="l00545"></a>00545 <span class="comment">local recursive function used in the following ref contains the new</span>
<a name="l00546"></a>00546 <span class="comment">position for each old index position</span>
<a name="l00547"></a>00547 <span class="comment"></span>
<a name="l00548"></a>00548 <span class="comment">@param e pointer to an evalue</span>
<a name="l00549"></a>00549 <span class="comment">@param ref transformation Matrix</span>
<a name="l00550"></a>00550 <span class="comment"></span>
<a name="l00551"></a>00551 <span class="comment">*/</span>
<a name="l00552"></a><a class="code" href="ehrhart_8c.html#7feed9b06d4009e6a43c820f486d0d1c">00552</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#7feed9b06d4009e6a43c820f486d0d1c" title="local recursive function used in the following ref contains the new position for...">aep_evalue</a>(<a class="code" href="struct__evalue.html">evalue</a> *e, <span class="keywordtype">int</span> *ref) {
<a name="l00553"></a>00553
<a name="l00554"></a>00554 <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00555"></a>00555 <span class="keywordtype">int</span> i;
<a name="l00556"></a>00556
<a name="l00557"></a>00557 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00558"></a>00558 <span class="keywordflow">return</span>; <span class="comment">/* a rational number, its already reduced */</span>
<a name="l00559"></a>00559 <span class="keywordflow">if</span>(!(p = e->x.p))
<a name="l00560"></a>00560 <span class="keywordflow">return</span>; <span class="comment">/* hum... an overflow probably occured */</span>
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="comment">/* First check the components of p */</span>
<a name="l00563"></a>00563 <span class="keywordflow">for</span> (i=0;i<p-><a class="code" href="struct__enode.html#ba9a89a7893638f2ad9d77c9d0247797">size</a>;i++)
<a name="l00564"></a>00564 <a class="code" href="ehrhart_8c.html#7feed9b06d4009e6a43c820f486d0d1c" title="local recursive function used in the following ref contains the new position for...">aep_evalue</a>(&p-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i],ref);
<a name="l00565"></a>00565
<a name="l00566"></a>00566 <span class="comment">/* Then p itself */</span>
<a name="l00567"></a>00567 p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a> = ref[p-><a class="code" href="struct__enode.html#1230adfbd7f0ca1f8628a03be4e6ef35">pos</a>-1]+1;
<a name="l00568"></a>00568 <span class="keywordflow">return</span>;
<a name="l00569"></a>00569 } <span class="comment">/* aep_evalue */</span>
<a name="l00570"></a>00570 <span class="comment"></span>
<a name="l00571"></a>00571 <span class="comment">/** Comments */</span>
<a name="l00572"></a><a class="code" href="ehrhart_8c.html#a620fc3759fc7fe715bc6d5e891631e7">00572</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#a620fc3759fc7fe715bc6d5e891631e7" title="Comments.">addeliminatedparams_evalue</a>(<a class="code" href="struct__evalue.html">evalue</a> *e,<a class="code" href="structmatrix.html">Matrix</a> *CT) {
<a name="l00573"></a>00573
<a name="l00574"></a>00574 <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00575"></a>00575 <span class="keywordtype">int</span> i, j;
<a name="l00576"></a>00576 <span class="keywordtype">int</span> *ref;
<a name="l00577"></a>00577
<a name="l00578"></a>00578 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00579"></a>00579 <span class="keywordflow">return</span>; <span class="comment">/* a rational number, its already reduced */</span>
<a name="l00580"></a>00580 <span class="keywordflow">if</span>(!(p = e->x.p))
<a name="l00581"></a>00581 <span class="keywordflow">return</span>; <span class="comment">/* hum... an overflow probably occured */</span>
<a name="l00582"></a>00582
<a name="l00583"></a>00583 <span class="comment">/* Compute ref */</span>
<a name="l00584"></a>00584 ref = (<span class="keywordtype">int</span> *)malloc(<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>)*(CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1));
<a name="l00585"></a>00585 <span class="keywordflow">for</span>(i=0;i<CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1;i++)
<a name="l00586"></a>00586 <span class="keywordflow">for</span>(j=0;j<CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;j++)
<a name="l00587"></a>00587 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(CT-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j])) {
<a name="l00588"></a>00588 ref[i] = j;
<a name="l00589"></a>00589 <span class="keywordflow">break</span>;
<a name="l00590"></a>00590 }
<a name="l00591"></a>00591
<a name="l00592"></a>00592 <span class="comment">/* Transform the references in e, using ref */</span>
<a name="l00593"></a>00593 <a class="code" href="ehrhart_8c.html#7feed9b06d4009e6a43c820f486d0d1c" title="local recursive function used in the following ref contains the new position for...">aep_evalue</a>(e,ref);
<a name="l00594"></a>00594 free( ref );
<a name="l00595"></a>00595 <span class="keywordflow">return</span>;
<a name="l00596"></a>00596 } <span class="comment">/* addeliminatedparams_evalue */</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"></span>
<a name="l00600"></a>00600 <span class="comment">This procedure finds an integer point contained in polyhedron D /</span>
<a name="l00601"></a>00601 <span class="comment">first checks for positive values, then for negative values returns</span>
<a name="l00602"></a>00602 <span class="comment">TRUE on success. Result is in min. returns FALSE if no integer point</span>
<a name="l00603"></a>00603 <span class="comment">is found</span>
<a name="l00604"></a>00604 <span class="comment"></span>
<a name="l00605"></a>00605 <span class="comment"><p></span>
<a name="l00606"></a>00606 <span class="comment"></span>
<a name="l00607"></a>00607 <span class="comment">This is the maximum number of iterations for a given parameter to find</span>
<a name="l00608"></a>00608 <span class="comment">a integer point inside the context. Kind of weird. cherche_min should</span>
<a name="l00609"></a>00609 <span class="comment"></span>
<a name="l00610"></a>00610 <span class="comment"><p></span>
<a name="l00611"></a>00611 <span class="comment"></span>
<a name="l00612"></a>00612 <span class="comment">@param min</span>
<a name="l00613"></a>00613 <span class="comment">@param D</span>
<a name="l00614"></a>00614 <span class="comment">@param pos</span>
<a name="l00615"></a>00615 <span class="comment"></span>
<a name="l00616"></a>00616 <span class="comment">*/</span>
<a name="l00617"></a>00617 <span class="comment">/* FIXME: needs to be rewritten ! */</span>
<a name="l00618"></a><a class="code" href="ehrhart_8c.html#9e60f3e57fde2b9b1c7fe2eab7334add">00618</a> <span class="preprocessor">#define MAXITER 100</span>
<a name="l00619"></a><a class="code" href="ehrhart_8c.html#69da791e9902689f06a1dd5463a10a24">00619</a> <span class="preprocessor"></span><span class="keywordtype">int</span> <a class="code" href="ehrhart_8c.html#69da791e9902689f06a1dd5463a10a24">cherche_min</a>(Value *<a class="code" href="verif__ehrhart_8c.html#1c0ed9242a98f138b59c76f8454cfaa6">min</a>,<a class="code" href="structpolyhedron.html">Polyhedron</a> *D,<span class="keywordtype">int</span> pos) {
<a name="l00620"></a>00620
<a name="l00621"></a>00621 Value binf, bsup; <span class="comment">/* upper & lower bound */</span>
<a name="l00622"></a>00622 Value i;
<a name="l00623"></a>00623 <span class="keywordtype">int</span> flag, maxiter;
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="keywordflow">if</span>(!D)
<a name="l00626"></a>00626 <span class="keywordflow">return</span>(1);
<a name="l00627"></a>00627 <span class="keywordflow">if</span>(pos > D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>)
<a name="l00628"></a>00628 <span class="keywordflow">return</span>(1);
<a name="l00629"></a>00629
<a name="l00630"></a>00630 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(binf); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(bsup);
<a name="l00631"></a>00631 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(i);
<a name="l00632"></a>00632
<a name="l00633"></a>00633 <span class="preprocessor">#ifdef EDEBUG61</span>
<a name="l00634"></a>00634 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Entering Cherche min --> \n"</span>);
<a name="l00635"></a>00635 fprintf(stderr,<span class="stringliteral">"LowerUpperBounds :\n"</span>);
<a name="l00636"></a>00636 fprintf(stderr,<span class="stringliteral">"pos = %d\n"</span>,pos);
<a name="l00637"></a>00637 fprintf(stderr,<span class="stringliteral">"current min = ("</span>);
<a name="l00638"></a>00638 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,min[1]);
<a name="l00639"></a>00639 {<span class="keywordtype">int</span> j;
<a name="l00640"></a>00640 <span class="keywordflow">for</span>(j=2;j<=D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> ; j++) {
<a name="l00641"></a>00641 fprintf(stderr,<span class="stringliteral">", "</span>);
<a name="l00642"></a>00642 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,min[j]);
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644 }
<a name="l00645"></a>00645 fprintf(stderr,<span class="stringliteral">")\n"</span>);
<a name="l00646"></a>00646 <span class="preprocessor">#endif</span>
<a name="l00647"></a>00647 <span class="preprocessor"></span>
<a name="l00648"></a>00648 flag = <a class="code" href="polyhedron_8c.html#a8c3f429dd74c5ec2087f97d702cdc66">lower_upper_bounds</a>(pos,D,min,&binf,&bsup);
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="preprocessor">#ifdef EDEBUG61</span>
<a name="l00651"></a>00651 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"flag = %d\n"</span>, flag);
<a name="l00652"></a>00652 fprintf(stderr,<span class="stringliteral">"binf = "</span>);
<a name="l00653"></a>00653 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,binf);
<a name="l00654"></a>00654 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00655"></a>00655 fprintf(stderr,<span class="stringliteral">"bsup = "</span>);
<a name="l00656"></a>00656 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,bsup);
<a name="l00657"></a>00657 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00658"></a>00658 <span class="preprocessor">#endif</span>
<a name="l00659"></a>00659 <span class="preprocessor"></span>
<a name="l00660"></a>00660 <span class="keywordflow">if</span>(flag&<a class="code" href="types_8h.html#b3e4132829e88232125e7bf259520a18">LB_INFINITY</a>)
<a name="l00661"></a>00661 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(binf,0);
<a name="l00662"></a>00662
<a name="l00663"></a>00663 <span class="comment">/* Loop from 0 (or binf if positive) to bsup */</span>
<a name="l00664"></a>00664 <span class="keywordflow">for</span>(maxiter=0,(((flag&LB_INFINITY) || <a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(binf)) ?
<a name="l00665"></a>00665 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(i,0) : <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(i,binf));
<a name="l00666"></a>00666 ((flag&<a class="code" href="types_8h.html#629bf0301263815e35636f493380b9dd">UB_INFINITY</a>) || <a class="code" href="source_2arith_2arithmetique_8h.html#47975ace017981602e1064f98f43f8a7">value_le</a>(i,bsup)) && maxiter<<a class="code" href="ehrhart_8c.html#9e60f3e57fde2b9b1c7fe2eab7334add" title="This procedure finds an integer point contained in polyhedron D / first checks for...">MAXITER</a> ;
<a name="l00667"></a>00667 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(i,i),maxiter++) {
<a name="l00668"></a>00668
<a name="l00669"></a>00669 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(min[pos],i);
<a name="l00670"></a>00670 <span class="keywordflow">if</span>(<a class="code" href="ehrhart_8c.html#69da791e9902689f06a1dd5463a10a24">cherche_min</a>(min,D-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>,pos+1)) {
<a name="l00671"></a>00671 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(binf); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(bsup);
<a name="l00672"></a>00672 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(i);
<a name="l00673"></a>00673 <span class="keywordflow">return</span>(1);
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675 }
<a name="l00676"></a>00676
<a name="l00677"></a>00677 <span class="comment">/* Descending loop from -1 (or bsup if negative) to binf */</span>
<a name="l00678"></a>00678 <span class="keywordflow">if</span>((flag&LB_INFINITY) || <a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(binf))
<a name="l00679"></a>00679 <span class="keywordflow">for</span>(maxiter=0,(((flag&<a class="code" href="types_8h.html#629bf0301263815e35636f493380b9dd">UB_INFINITY</a>) || <a class="code" href="source_2arith_2arithmetique_8h.html#01904c8c75c10d407a24c55f16ec27c7">value_pos_p</a>(bsup))?
<a name="l00680"></a>00680 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(i,-1)
<a name="l00681"></a>00681 :<a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(i,bsup));
<a name="l00682"></a>00682 ((flag&LB_INFINITY) || <a class="code" href="source_2arith_2arithmetique_8h.html#eee525b427bd616a24b5b9feb9a9f02e">value_ge</a>(i,binf)) && maxiter<<a class="code" href="ehrhart_8c.html#9e60f3e57fde2b9b1c7fe2eab7334add" title="This procedure finds an integer point contained in polyhedron D / first checks for...">MAXITER</a> ;
<a name="l00683"></a>00683 <a class="code" href="source_2arith_2arithmetique_8h.html#7e293e9652086118cc5b660e6022767c">value_decrement</a>(i,i),maxiter++) {
<a name="l00684"></a>00684
<a name="l00685"></a>00685 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(min[pos],i);
<a name="l00686"></a>00686 <span class="keywordflow">if</span>(<a class="code" href="ehrhart_8c.html#69da791e9902689f06a1dd5463a10a24">cherche_min</a>(min,D-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>,pos+1)) {
<a name="l00687"></a>00687 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(binf); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(bsup);
<a name="l00688"></a>00688 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(i);
<a name="l00689"></a>00689 <span class="keywordflow">return</span>(1);
<a name="l00690"></a>00690 }
<a name="l00691"></a>00691 }
<a name="l00692"></a>00692 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(binf); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(bsup);
<a name="l00693"></a>00693 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(i);
<a name="l00694"></a>00694
<a name="l00695"></a>00695 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(min[pos],0);
<a name="l00696"></a>00696 <span class="keywordflow">return</span>(0); <span class="comment">/* not found :-( */</span>
<a name="l00697"></a>00697 } <span class="comment">/* cherche_min */</span>
<a name="l00698"></a>00698 <span class="comment"></span>
<a name="l00699"></a>00699 <span class="comment">/** </span>
<a name="l00700"></a>00700 <span class="comment"></span>
<a name="l00701"></a>00701 <span class="comment">This procedure finds the smallest parallelepiped of size</span>
<a name="l00702"></a>00702 <span class="comment">'<i>size[i]</i>' for every dimension i, contained in polyhedron D.</span>
<a name="l00703"></a>00703 <span class="comment">If this is not possible, NULL is returned</span>
<a name="l00704"></a>00704 <span class="comment"></span>
<a name="l00705"></a>00705 <span class="comment"><p></span>
<a name="l00706"></a>00706 <span class="comment"></span>
<a name="l00707"></a>00707 <span class="comment"><pre></span>
<a name="l00708"></a>00708 <span class="comment">written by vin100, 2000, for version 4.19</span>
<a name="l00709"></a>00709 <span class="comment">modified 2002, version 5.10</span>
<a name="l00710"></a>00710 <span class="comment"></pre></span>
<a name="l00711"></a>00711 <span class="comment"></span>
<a name="l00712"></a>00712 <span class="comment"><p></span>
<a name="l00713"></a>00713 <span class="comment"></span>
<a name="l00714"></a>00714 <span class="comment">It first finds the coordinates of the lexicographically smallest edge</span>
<a name="l00715"></a>00715 <span class="comment">of the hypercube, obtained by transforming the constraints of D (by</span>
<a name="l00716"></a>00716 <span class="comment">adding 'size' as many times as there are negative coeficients in each</span>
<a name="l00717"></a>00717 <span class="comment">constraint), and finding the lexicographical min of this</span>
<a name="l00718"></a>00718 <span class="comment">polyhedron. Then it builds the hypercube and returns it.</span>
<a name="l00719"></a>00719 <span class="comment"></span>
<a name="l00720"></a>00720 <span class="comment"><p></span>
<a name="l00721"></a>00721 <span class="comment">@param D</span>
<a name="l00722"></a>00722 <span class="comment">@param size</span>
<a name="l00723"></a>00723 <span class="comment">@param MAXRAYS</span>
<a name="l00724"></a>00724 <span class="comment"></span>
<a name="l00725"></a>00725 <span class="comment">*/</span>
<a name="l00726"></a>00726
<a name="l00727"></a><a class="code" href="ehrhart_8c.html#20d8f9c53578cb2025e9107b71165193">00727</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="ehrhart_8c.html#20d8f9c53578cb2025e9107b71165193" title="This procedure finds the smallest parallelepiped of size &#39;size[i]&#39; for every...">Polyhedron_Preprocess</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D,Value *<a class="code" href="vector_8c.html#439227feff9d7f55384e8780cfc2eb82">size</a>,<span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>)
<a name="l00728"></a>00728 {
<a name="l00729"></a>00729 <a class="code" href="structmatrix.html">Matrix</a> *M;
<a name="l00730"></a>00730 <span class="keywordtype">int</span> i, j, d;
<a name="l00731"></a>00731 <a class="code" href="structpolyhedron.html">Polyhedron</a> *T, *S, *H, *C;
<a name="l00732"></a>00732 Value *<a class="code" href="verif__ehrhart_8c.html#1c0ed9242a98f138b59c76f8454cfaa6">min</a>;
<a name="l00733"></a>00733
<a name="l00734"></a>00734 d = D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l00735"></a>00735 <span class="keywordflow">if</span> (MAXRAYS < 2*D->NbConstraints)
<a name="l00736"></a>00736 MAXRAYS = 2*D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;
<a name="l00737"></a>00737 M = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(MAXRAYS, D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2);
<a name="l00738"></a>00738 M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> = D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;
<a name="l00739"></a>00739
<a name="l00740"></a>00740 <span class="comment">/* Original constraints */</span>
<a name="l00741"></a>00741 <span class="keywordflow">for</span>(i=0;i<D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;i++)
<a name="l00742"></a>00742 <a class="code" href="vector_8c.html#b6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i],M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i],(d+2));
<a name="l00743"></a>00743
<a name="l00744"></a>00744 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00745"></a>00745 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"M for PreProcess : "</span>);
<a name="l00746"></a>00746 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,M);
<a name="l00747"></a>00747 fprintf(stderr,<span class="stringliteral">"\nsize == "</span>);
<a name="l00748"></a>00748 <span class="keywordflow">for</span>( i=0 ; i<d ; i++ )
<a name="l00749"></a>00749 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,size[i]);
<a name="l00750"></a>00750 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00751"></a>00751 <span class="preprocessor">#endif</span>
<a name="l00752"></a>00752 <span class="preprocessor"></span>
<a name="l00753"></a>00753 <span class="comment">/* Additionnal constraints */</span>
<a name="l00754"></a>00754 <span class="keywordflow">for</span>(i=0;i<D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;i++) {
<a name="l00755"></a>00755 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][0])) {
<a name="l00756"></a>00756 fprintf(stderr,<span class="stringliteral">"Polyhedron_Preprocess: "</span>);
<a name="l00757"></a>00757 fprintf(stderr,
<a name="l00758"></a>00758 <span class="stringliteral">"an equality was found where I did expect an inequality.\n"</span>);
<a name="l00759"></a>00759 fprintf(stderr,<span class="stringliteral">"Trying to continue...\n"</span>);
<a name="l00760"></a>00760 <span class="keywordflow">continue</span>;
<a name="l00761"></a>00761 }
<a name="l00762"></a>00762 <a class="code" href="vector_8c.html#b6eca9ad03a2f4a60dd79182289e0e0b">Vector_Copy</a>(D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i],M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>],(d+2));
<a name="l00763"></a>00763 <span class="keywordflow">for</span>(j=1;j<=d;j++)
<a name="l00764"></a>00764 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][j])) {
<a name="l00765"></a>00765 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>][d+1], D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][j], size[j-1]);
<a name="l00766"></a>00766 }
<a name="l00767"></a>00767
<a name="l00768"></a>00768 <span class="comment">/* If anything changed, add this new constraint */</span>
<a name="l00769"></a>00769 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>][d+1],D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][d+1]))
<a name="l00770"></a>00770 M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ++ ;
<a name="l00771"></a>00771 }
<a name="l00772"></a>00772
<a name="l00773"></a>00773 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00774"></a>00774 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"M used to find min : "</span>);
<a name="l00775"></a>00775 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,M);
<a name="l00776"></a>00776 <span class="preprocessor">#endif</span>
<a name="l00777"></a>00777 <span class="preprocessor"></span>
<a name="l00778"></a>00778 T = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(M,MAXRAYS);
<a name="l00779"></a>00779 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l00780"></a>00780 <span class="keywordflow">if</span> (!T || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(T)) {
<a name="l00781"></a>00781 <span class="keywordflow">if</span>(T)
<a name="l00782"></a>00782 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(T);
<a name="l00783"></a>00783 <span class="keywordflow">return</span>(NULL);
<a name="l00784"></a>00784 }
<a name="l00785"></a>00785
<a name="l00786"></a>00786 <span class="comment">/* Ok, now find the lexicographical min of T */</span>
<a name="l00787"></a>00787 min = (Value *) malloc(<span class="keyword">sizeof</span>(Value) * (d+2));
<a name="l00788"></a>00788 <span class="keywordflow">for</span>(i=0;i<=d;i++) {
<a name="l00789"></a>00789 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(min[i]);
<a name="l00790"></a>00790 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(min[i],0);
<a name="l00791"></a>00791 }
<a name="l00792"></a>00792 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(min[i]);
<a name="l00793"></a>00793 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(min[i],1);
<a name="l00794"></a>00794 C = <a class="code" href="polyhedron_8c.html#832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(0);
<a name="l00795"></a>00795 S = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(T,C,MAXRAYS);
<a name="l00796"></a>00796 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(C);
<a name="l00797"></a>00797 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(T);
<a name="l00798"></a>00798
<a name="l00799"></a>00799 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00800"></a>00800 <span class="preprocessor"></span> <span class="keywordflow">for</span>(i=0;i<=(d+1);i++) {
<a name="l00801"></a>00801 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,min[i]);
<a name="l00802"></a>00802 fprintf(stderr,<span class="stringliteral">" ,"</span>);
<a name="l00803"></a>00803 }
<a name="l00804"></a>00804 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00805"></a>00805 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,S);
<a name="l00806"></a>00806 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00807"></a>00807 <span class="preprocessor">#endif</span>
<a name="l00808"></a>00808 <span class="preprocessor"></span>
<a name="l00809"></a>00809 <span class="keywordflow">if</span> (!<a class="code" href="ehrhart_8c.html#69da791e9902689f06a1dd5463a10a24">cherche_min</a>(min,S,1))
<a name="l00810"></a>00810 {
<a name="l00811"></a>00811 <span class="keywordflow">for</span>(i=0;i<=(d+1);i++)
<a name="l00812"></a>00812 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(min[i]);
<a name="l00813"></a>00813 <span class="keywordflow">return</span>(NULL);
<a name="l00814"></a>00814 }
<a name="l00815"></a>00815 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(S);
<a name="l00816"></a>00816
<a name="l00817"></a>00817 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00818"></a>00818 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"min = ( "</span>);
<a name="l00819"></a>00819 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,min[1]);
<a name="l00820"></a>00820 <span class="keywordflow">for</span>(i=2;i<=d;i++) {
<a name="l00821"></a>00821 fprintf(stderr,<span class="stringliteral">", "</span>);
<a name="l00822"></a>00822 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,min[i]);
<a name="l00823"></a>00823 }
<a name="l00824"></a>00824 fprintf(stderr,<span class="stringliteral">")\n"</span>);
<a name="l00825"></a>00825 <span class="preprocessor">#endif</span>
<a name="l00826"></a>00826 <span class="preprocessor"></span>
<a name="l00827"></a>00827 <span class="comment">/* Min is the point from which we can construct the hypercube */</span>
<a name="l00828"></a>00828 M = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(d*2,d+2);
<a name="l00829"></a>00829 <span class="keywordflow">for</span>(i=0;i<d;i++) {
<a name="l00830"></a>00830
<a name="l00831"></a>00831 <span class="comment">/* Creates inequality 1 0..0 1 0..0 -min[i+1] */</span>
<a name="l00832"></a>00832 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][0],1);
<a name="l00833"></a>00833 <span class="keywordflow">for</span>(j=1;j<=d;j++)
<a name="l00834"></a>00834 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][j],0);
<a name="l00835"></a>00835 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][i+1],1);
<a name="l00836"></a>00836 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][d+1],min[i+1]);
<a name="l00837"></a>00837
<a name="l00838"></a>00838 <span class="comment">/* Creates inequality 1 0..0 -1 0..0 min[i+1]+size -1 */</span>
<a name="l00839"></a>00839 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][0],1);
<a name="l00840"></a>00840 <span class="keywordflow">for</span>(j=1;j<=d;j++)
<a name="l00841"></a>00841 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][j],0);
<a name="l00842"></a>00842 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][i+1],-1);
<a name="l00843"></a>00843 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][d+1],min[i+1],size[i]);
<a name="l00844"></a>00844 <a class="code" href="source_2arith_2arithmetique_8h.html#11f18b25f757ecabd62ef14833909101">value_sub_int</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][d+1],M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][d+1],1);
<a name="l00845"></a>00845 }
<a name="l00846"></a>00846
<a name="l00847"></a>00847 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00848"></a>00848 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"PolyhedronPreprocess: constraints H = "</span>);
<a name="l00849"></a>00849 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,M);
<a name="l00850"></a>00850 <span class="preprocessor">#endif</span>
<a name="l00851"></a>00851 <span class="preprocessor"></span>
<a name="l00852"></a>00852 H = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(M,MAXRAYS);
<a name="l00853"></a>00853
<a name="l00854"></a>00854 <span class="preprocessor">#ifdef EDEBUG6</span>
<a name="l00855"></a>00855 <span class="preprocessor"></span> <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,H);
<a name="l00856"></a>00856 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00857"></a>00857 <span class="preprocessor">#endif</span>
<a name="l00858"></a>00858 <span class="preprocessor"></span>
<a name="l00859"></a>00859 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l00860"></a>00860 <span class="keywordflow">for</span>(i=0;i<=(d+1);i++)
<a name="l00861"></a>00861 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(min[i]);
<a name="l00862"></a>00862 free(min);
<a name="l00863"></a>00863 <a class="code" href="assert_8h.html#07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(!<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(H));
<a name="l00864"></a>00864 <span class="keywordflow">return</span>(H);
<a name="l00865"></a>00865 } <span class="comment">/* Polyhedron_Preprocess */</span>
<a name="l00866"></a>00866
<a name="l00867"></a>00867 <span class="comment"></span>
<a name="l00868"></a>00868 <span class="comment">/** This procedure finds an hypercube of size 'size', containing</span>
<a name="l00869"></a>00869 <span class="comment">polyhedron D increases size and lcm if necessary (and not "too big")</span>
<a name="l00870"></a>00870 <span class="comment">If this is not possible, an empty polyhedron is returned</span>
<a name="l00871"></a>00871 <span class="comment"></span>
<a name="l00872"></a>00872 <span class="comment"><p></span>
<a name="l00873"></a>00873 <span class="comment"></span>
<a name="l00874"></a>00874 <span class="comment"><pre> written by vin100, 2001, for version 4.19</pre></span>
<a name="l00875"></a>00875 <span class="comment"></span>
<a name="l00876"></a>00876 <span class="comment">@param D</span>
<a name="l00877"></a>00877 <span class="comment">@param size</span>
<a name="l00878"></a>00878 <span class="comment">@param lcm</span>
<a name="l00879"></a>00879 <span class="comment">@param MAXRAYS</span>
<a name="l00880"></a>00880 <span class="comment"></span>
<a name="l00881"></a>00881 <span class="comment">*/</span>
<a name="l00882"></a><a class="code" href="ehrhart_8c.html#15a4cf0edb430fbf0916dee6e448b6a1">00882</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="ehrhart_8c.html#15a4cf0edb430fbf0916dee6e448b6a1" title="This procedure finds an hypercube of size &#39;size&#39;, containing polyhedron D...">Polyhedron_Preprocess2</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D,Value *<a class="code" href="vector_8c.html#439227feff9d7f55384e8780cfc2eb82">size</a>,
<a name="l00883"></a>00883 Value *lcm,<span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>) {
<a name="l00884"></a>00884
<a name="l00885"></a>00885 <a class="code" href="structmatrix.html">Matrix</a> *c;
<a name="l00886"></a>00886 <a class="code" href="structpolyhedron.html">Polyhedron</a> *H;
<a name="l00887"></a>00887 <span class="keywordtype">int</span> i,j,r;
<a name="l00888"></a>00888 Value <a class="code" href="polyparam_8c.html#76f11d9a0a47b94f72c2d0e77fb32240">n</a>; <span class="comment">/* smallest/biggest value */</span>
<a name="l00889"></a>00889 Value <a class="code" href="polytest_8c.html#27d9a0cff1341bbc004fabd1ad8a1543">s</a>; <span class="comment">/* size in this dimension */</span>
<a name="l00890"></a>00890 Value tmp1,tmp2;
<a name="l00891"></a>00891
<a name="l00892"></a>00892 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l00893"></a>00893 <span class="preprocessor"></span> <span class="keywordtype">int</span> np;
<a name="l00894"></a>00894 <span class="preprocessor">#endif</span>
<a name="l00895"></a>00895 <span class="preprocessor"></span>
<a name="l00896"></a>00896 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(n); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(s);
<a name="l00897"></a>00897 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp1); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp2);
<a name="l00898"></a>00898 c = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>*2,D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2);
<a name="l00899"></a>00899
<a name="l00900"></a>00900 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l00901"></a>00901 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"\nPreProcess2 : starting\n"</span>);
<a name="l00902"></a>00902 fprintf(stderr,<span class="stringliteral">"lcm = "</span>);
<a name="l00903"></a>00903 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00904"></a>00904 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,lcm[np]);
<a name="l00905"></a>00905 fprintf(stderr,<span class="stringliteral">", size = "</span>);
<a name="l00906"></a>00906 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00907"></a>00907 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,size[np]);
<a name="l00908"></a>00908 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00909"></a>00909 <span class="preprocessor">#endif</span>
<a name="l00910"></a>00910 <span class="preprocessor"></span>
<a name="l00911"></a>00911 <span class="keywordflow">for</span>(i=0;i<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;i++) {
<a name="l00912"></a>00912
<a name="l00913"></a>00913 <span class="comment">/* Create constraint 1 0..0 1 0..0 -min */</span>
<a name="l00914"></a>00914 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][0],1);
<a name="l00915"></a>00915 <span class="keywordflow">for</span>(j=0;j<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;j++)
<a name="l00916"></a>00916 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][1+j],0);
<a name="l00917"></a>00917 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(n,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[0][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[0][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00918"></a>00918 <span class="keywordflow">for</span>(r=1;r<D-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;r++) {
<a name="l00919"></a>00919 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00920"></a>00920 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(n,tmp1)) {
<a name="l00921"></a>00921
<a name="l00922"></a>00922 <span class="comment">/* New min */</span>
<a name="l00923"></a>00923 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(n,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00924"></a>00924 }
<a name="l00925"></a>00925 }
<a name="l00926"></a>00926 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][i+1],1);
<a name="l00927"></a>00927 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1],n);
<a name="l00928"></a>00928
<a name="l00929"></a>00929 <span class="comment">/* Create constraint 1 0..0 -1 0..0 max */</span>
<a name="l00930"></a>00930 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][0],1);
<a name="l00931"></a>00931 <span class="keywordflow">for</span>(j=0;j<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;j++)
<a name="l00932"></a>00932 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][1+j],0);
<a name="l00933"></a>00933
<a name="l00934"></a>00934 <span class="comment">/* n = (num+den-1)/den */</span>
<a name="l00935"></a>00935 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[0][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[0][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00936"></a>00936 <a class="code" href="source_2arith_2arithmetique_8h.html#11f18b25f757ecabd62ef14833909101">value_sub_int</a>(tmp1,tmp1,1);
<a name="l00937"></a>00937 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(n,tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[0][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00938"></a>00938 <span class="keywordflow">for</span>(r=1;r<D-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;r++) {
<a name="l00939"></a>00939 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00940"></a>00940 <a class="code" href="source_2arith_2arithmetique_8h.html#11f18b25f757ecabd62ef14833909101">value_sub_int</a>(tmp1,tmp1,1);
<a name="l00941"></a>00941 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(tmp1,tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00942"></a>00942 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(n,tmp1)) {
<a name="l00943"></a>00943
<a name="l00944"></a>00944 <span class="comment">/* New max */</span>
<a name="l00945"></a>00945 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][i+1],D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00946"></a>00946 <a class="code" href="source_2arith_2arithmetique_8h.html#11f18b25f757ecabd62ef14833909101">value_sub_int</a>(tmp1,tmp1,1);
<a name="l00947"></a>00947 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(n,tmp1,D-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00948"></a>00948 }
<a name="l00949"></a>00949 }
<a name="l00950"></a>00950 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][i+1],-1);
<a name="l00951"></a>00951 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1],n);
<a name="l00952"></a>00952 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(s,c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1],c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00953"></a>00953
<a name="l00954"></a>00954 <span class="comment">/* Now test if the dimension of the cube is greater than the size */</span>
<a name="l00955"></a>00955 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(s,size[i])) {
<a name="l00956"></a>00956
<a name="l00957"></a>00957 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l00958"></a>00958 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"size on dimension %d\n"</span>,i);
<a name="l00959"></a>00959 fprintf(stderr,<span class="stringliteral">"lcm = "</span>);
<a name="l00960"></a>00960 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00961"></a>00961 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,lcm[np]);
<a name="l00962"></a>00962 fprintf(stderr,<span class="stringliteral">", size = "</span>);
<a name="l00963"></a>00963 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00964"></a>00964 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,size[np]);
<a name="l00965"></a>00965 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l00966"></a>00966 fprintf(stderr,<span class="stringliteral">"required size (s) = "</span>);
<a name="l00967"></a>00967 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,s);
<a name="l00968"></a>00968 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<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">/* If the needed size is "small enough"(<=20 or less than </span>
<a name="l00972"></a>00972 <span class="comment"> twice *size),</span>
<a name="l00973"></a>00973 <span class="comment"> then increase *size, and artificially increase lcm too !*/</span>
<a name="l00974"></a>00974 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(tmp1,20);
<a name="l00975"></a>00975 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp2,size[i],size[i]);
<a name="l00976"></a>00976 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47975ace017981602e1064f98f43f8a7">value_le</a>(s,tmp1)
<a name="l00977"></a>00977 || <a class="code" href="source_2arith_2arithmetique_8h.html#47975ace017981602e1064f98f43f8a7">value_le</a>(s,tmp2)) {
<a name="l00978"></a>00978
<a name="l00979"></a>00979 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(lcm[i]) )
<a name="l00980"></a>00980 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(lcm[i],1);
<a name="l00981"></a>00981 <span class="comment">/* lcm divides size... */</span>
<a name="l00982"></a>00982 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(tmp1,size[i],lcm[i]);
<a name="l00983"></a>00983
<a name="l00984"></a>00984 <span class="comment">/* lcm = ceil(s/h) */</span>
<a name="l00985"></a>00985 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp2,s,tmp1);
<a name="l00986"></a>00986 <a class="code" href="source_2arith_2arithmetique_8h.html#73e7093353d4108ea8f63898e868ed5f">value_add_int</a>(tmp2,tmp2,1);
<a name="l00987"></a>00987 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(lcm[i],tmp2,tmp1);
<a name="l00988"></a>00988
<a name="l00989"></a>00989 <span class="comment">/* new size = lcm*h */</span>
<a name="l00990"></a>00990 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(size[i],lcm[i],tmp1);
<a name="l00991"></a>00991
<a name="l00992"></a>00992 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l00993"></a>00993 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"new size = "</span>);
<a name="l00994"></a>00994 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00995"></a>00995 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,size[np]);
<a name="l00996"></a>00996 fprintf(stderr,<span class="stringliteral">", new lcm = "</span>);
<a name="l00997"></a>00997 <span class="keywordflow">for</span>( np=0 ; np<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>; np++ )
<a name="l00998"></a>00998 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,lcm[np]);
<a name="l00999"></a>00999 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l01000"></a>01000 <span class="preprocessor">#endif</span>
<a name="l01001"></a>01001 <span class="preprocessor"></span>
<a name="l01002"></a>01002 }
<a name="l01003"></a>01003 <span class="keywordflow">else</span> {
<a name="l01004"></a>01004
<a name="l01005"></a>01005 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l01006"></a>01006 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Failed on dimension %d.\n"</span>,i);
<a name="l01007"></a>01007 <span class="preprocessor">#endif</span>
<a name="l01008"></a>01008 <span class="preprocessor"></span> <span class="keywordflow">break</span>;
<a name="l01009"></a>01009 }
<a name="l01010"></a>01010 }
<a name="l01011"></a>01011 }
<a name="l01012"></a>01012 <span class="keywordflow">if</span>(i!=D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>) {
<a name="l01013"></a>01013 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(c);
<a name="l01014"></a>01014 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(n); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(s);
<a name="l01015"></a>01015 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp2);
<a name="l01016"></a>01016 <span class="keywordflow">return</span>(NULL);
<a name="l01017"></a>01017 }
<a name="l01018"></a>01018 <span class="keywordflow">for</span>(i=0;i<D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;i++) {
<a name="l01019"></a>01019 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i+1][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1],size[i],
<a name="l01020"></a>01020 c-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[2*i][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l01021"></a>01021 }
<a name="l01022"></a>01022
<a name="l01023"></a>01023 <span class="preprocessor">#ifdef EDEBUG62</span>
<a name="l01024"></a>01024 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"PreProcess2 : c ="</span>);
<a name="l01025"></a>01025 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,c);
<a name="l01026"></a>01026 <span class="preprocessor">#endif</span>
<a name="l01027"></a>01027 <span class="preprocessor"></span>
<a name="l01028"></a>01028 H = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(c,MAXRAYS);
<a name="l01029"></a>01029 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(c);
<a name="l01030"></a>01030 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(n); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(s);
<a name="l01031"></a>01031 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp2);
<a name="l01032"></a>01032 <span class="keywordflow">return</span>(H);
<a name="l01033"></a>01033 } <span class="comment">/* Polyhedron_Preprocess2 */</span>
<a name="l01034"></a>01034 <span class="comment"></span>
<a name="l01035"></a>01035 <span class="comment">/** </span>
<a name="l01036"></a>01036 <span class="comment"></span>
<a name="l01037"></a>01037 <span class="comment">This procedure adds additional constraints to D so that as each</span>
<a name="l01038"></a>01038 <span class="comment">parameter is scanned, it will have a minimum of 'size' points If this</span>
<a name="l01039"></a>01039 <span class="comment">is not possible, an empty polyhedron is returned</span>
<a name="l01040"></a>01040 <span class="comment"></span>
<a name="l01041"></a>01041 <span class="comment">@param D</span>
<a name="l01042"></a>01042 <span class="comment">@param size</span>
<a name="l01043"></a>01043 <span class="comment">@param MAXRAYS</span>
<a name="l01044"></a>01044 <span class="comment"></span>
<a name="l01045"></a>01045 <span class="comment">*/</span>
<a name="l01046"></a><a class="code" href="ehrhart_8c.html#a80bfbb66352fdde16088e067ac24518">01046</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="ehrhart_8c.html#a80bfbb66352fdde16088e067ac24518" title="This procedure adds additional constraints to D so that as each parameter is scanned...">old_Polyhedron_Preprocess</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D,Value <a class="code" href="vector_8c.html#439227feff9d7f55384e8780cfc2eb82">size</a>,
<a name="l01047"></a>01047 <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>) {
<a name="l01048"></a>01048
<a name="l01049"></a>01049 <span class="keywordtype">int</span> <a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>, p1, ub, lb;
<a name="l01050"></a>01050 Value a, a1, b, b1, g, aa;
<a name="l01051"></a>01051 Value abs_a, abs_b, size_copy;
<a name="l01052"></a>01052 <span class="keywordtype">int</span> dim, con, newi, needed;
<a name="l01053"></a>01053 Value **C;
<a name="l01054"></a>01054 <a class="code" href="structmatrix.html">Matrix</a> *M;
<a name="l01055"></a>01055 <a class="code" href="structpolyhedron.html">Polyhedron</a> *D1;
<a name="l01056"></a>01056
<a name="l01057"></a>01057 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(a); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(a1); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(b);
<a name="l01058"></a>01058 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(b1); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(aa);
<a name="l01059"></a>01059 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(abs_a); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(abs_b); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(size_copy);
<a name="l01060"></a>01060
<a name="l01061"></a>01061 dim = D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l01062"></a>01062 con = D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;
<a name="l01063"></a>01063 M = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(MAXRAYS,dim+2);
<a name="l01064"></a>01064 newi = 0;
<a name="l01065"></a>01065 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(size_copy,size);
<a name="l01066"></a>01066 C = D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>;
<a name="l01067"></a>01067 <span class="keywordflow">for</span> (p=1; p<=dim; p++) {
<a name="l01068"></a>01068 <span class="keywordflow">for</span> (ub=0; ub<con; ub++) {
<a name="l01069"></a>01069 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(a,C[ub][p]);
<a name="l01070"></a>01070 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#fef45b8b369740e71140484a097b6ab4">value_posz_p</a>(a)) <span class="comment">/* a >= 0 */</span>
<a name="l01071"></a>01071 <span class="keywordflow">continue</span>; <span class="comment">/* not an upper bound */</span>
<a name="l01072"></a>01072 <span class="keywordflow">for</span> (lb=0;lb<con;lb++) {
<a name="l01073"></a>01073 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(b,C[lb][p]);
<a name="l01074"></a>01074 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#61e2f80c3eee5c7453a805bc1b0b501a">value_negz_p</a>(b))
<a name="l01075"></a>01075 <span class="keywordflow">continue</span>; <span class="comment">/* not a lower bound */</span>
<a name="l01076"></a>01076
<a name="l01077"></a>01077 <span class="comment">/* Check if a new constraint is needed for this (ub,lb) pair */</span>
<a name="l01078"></a>01078 <span class="comment">/* a constraint is only needed if a previously scanned */</span>
<a name="l01079"></a>01079 <span class="comment">/* parameter (1..p-1) constrains this parameter (p) */</span>
<a name="l01080"></a>01080 needed=0;
<a name="l01081"></a>01081 <span class="keywordflow">for</span> (p1=1; p1<p; p1++) {
<a name="l01082"></a>01082 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(C[ub][p1]) ||
<a name="l01083"></a>01083 <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(C[lb][p1])) {
<a name="l01084"></a>01084 needed=1;
<a name="l01085"></a>01085 <span class="keywordflow">break</span>;
<a name="l01086"></a>01086 }
<a name="l01087"></a>01087 }
<a name="l01088"></a>01088 <span class="keywordflow">if</span> (!needed) <span class="keywordflow">continue</span>;
<a name="l01089"></a>01089 <a class="code" href="source_2arith_2arithmetique_8h.html#6eee595d027bdf64a6c529b5f138720f">value_absolute</a>(abs_a,a);
<a name="l01090"></a>01090 <a class="code" href="source_2arith_2arithmetique_8h.html#6eee595d027bdf64a6c529b5f138720f">value_absolute</a>(abs_b,b);
<a name="l01091"></a>01091
<a name="l01092"></a>01092 <span class="comment">/* Create new constraint: b*UB-a*LB >= a*b*size */</span>
<a name="l01093"></a>01093 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(g, abs_a, abs_b);
<a name="l01094"></a>01094 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(a1, a, g);
<a name="l01095"></a>01095 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(b1, b, g);
<a name="l01096"></a>01096 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[newi][0],1);
<a name="l01097"></a>01097 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(abs_a,a1); <span class="comment">/* abs_a = -a1 */</span>
<a name="l01098"></a>01098 <a class="code" href="vector_8c.html#4700bd41bb9179b23deb7ab9d80a463d">Vector_Combine</a>(&(C[ub][1]),&(C[lb][1]),&(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[newi][1]),
<a name="l01099"></a>01099 b1,abs_a,dim+1);
<a name="l01100"></a>01100 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(aa,a1,b1);
<a name="l01101"></a>01101 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[newi][dim+1], aa, size_copy);
<a name="l01102"></a>01102 <a class="code" href="vector_8c.html#9e3e9df020a7c7b0ad95baffed7ed5c9">Vector_Normalize</a>(&(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[newi][1]),(dim+1));
<a name="l01103"></a>01103 newi++;
<a name="l01104"></a>01104 }
<a name="l01105"></a>01105 }
<a name="l01106"></a>01106 }
<a name="l01107"></a>01107 D1 = <a class="code" href="polyhedron_8c.html#9690baafb863abbd2e8d5c4da2995416">AddConstraints</a>(M-><a class="code" href="structmatrix.html#9c294a3fd4d273963e27a0c8cd819bd5">p_Init</a>,newi,D,MAXRAYS);
<a name="l01108"></a>01108 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M);
<a name="l01109"></a>01109
<a name="l01110"></a>01110 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(a); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(a1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(b);
<a name="l01111"></a>01111 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(b1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(aa);
<a name="l01112"></a>01112 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(abs_a); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(abs_b); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(size_copy);
<a name="l01113"></a>01113 <span class="keywordflow">return</span> D1;
<a name="l01114"></a>01114 } <span class="comment">/* old_Polyhedron_Preprocess */</span>
<a name="l01115"></a>01115 <span class="comment"></span>
<a name="l01116"></a>01116 <span class="comment">/** </span>
<a name="l01117"></a>01117 <span class="comment"></span>
<a name="l01118"></a>01118 <span class="comment">PROCEDURES TO COMPUTE ENUMERATION. recursive procedure, recurse for</span>
<a name="l01119"></a>01119 <span class="comment">each imbriquation</span>
<a name="l01120"></a>01120 <span class="comment"></span>
<a name="l01121"></a>01121 <span class="comment">@param pos index position of current loop index (1..hdim-1)</span>
<a name="l01122"></a>01122 <span class="comment">@param P loop domain</span>
<a name="l01123"></a>01123 <span class="comment">@param context context values for fixed indices </span>
<a name="l01124"></a>01124 <span class="comment">@param res the number of integer points in this</span>
<a name="l01125"></a>01125 <span class="comment">polyhedron </span>
<a name="l01126"></a>01126 <span class="comment"></span>
<a name="l01127"></a>01127 <span class="comment">*/</span>
<a name="l01128"></a><a class="code" href="ehrhart_8h.html#dfc5a48cdab1ce4848c8f03a2707dcf9">01128</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#dfc5a48cdab1ce4848c8f03a2707dcf9" title="PROCEDURES TO COMPUTE ENUMERATION.">count_points</a> (<span class="keywordtype">int</span> pos,<a class="code" href="structpolyhedron.html">Polyhedron</a> *P,Value *context, Value *res) {
<a name="l01129"></a>01129
<a name="l01130"></a>01130 Value LB, UB, k, c;
<a name="l01131"></a>01131
<a name="l01132"></a>01132 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(P);
<a name="l01133"></a>01133 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(P);
<a name="l01134"></a>01134
<a name="l01135"></a>01135 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(P)) {
<a name="l01136"></a>01136 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*res, 0);
<a name="l01137"></a>01137 <span class="keywordflow">return</span>;
<a name="l01138"></a>01138 }
<a name="l01139"></a>01139
<a name="l01140"></a>01140 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(LB); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(UB); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(k);
<a name="l01141"></a>01141 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(LB,0);
<a name="l01142"></a>01142 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(UB,0);
<a name="l01143"></a>01143
<a name="l01144"></a>01144 <span class="keywordflow">if</span> (<a class="code" href="polyhedron_8c.html#a8c3f429dd74c5ec2087f97d702cdc66">lower_upper_bounds</a>(pos,P,context,&LB,&UB) !=0) {
<a name="l01145"></a>01145
<a name="l01146"></a>01146 <span class="comment">/* Problem if UB or LB is INFINITY */</span>
<a name="l01147"></a>01147 fprintf(stderr, <span class="stringliteral">"count_points: ? infinite domain\n"</span>);
<a name="l01148"></a>01148 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(LB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(UB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k);
<a name="l01149"></a>01149 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*res, -1);
<a name="l01150"></a>01150 <span class="keywordflow">return</span>;
<a name="l01151"></a>01151 }
<a name="l01152"></a>01152
<a name="l01153"></a>01153 <span class="preprocessor">#ifdef EDEBUG1</span>
<a name="l01154"></a>01154 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!P-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l01155"></a>01155 <span class="keywordtype">int</span> i;
<a name="l01156"></a>01156 <span class="keywordflow">for</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(k,LB); <a class="code" href="source_2arith_2arithmetique_8h.html#47975ace017981602e1064f98f43f8a7">value_le</a>(k,UB); <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(k,k)) {
<a name="l01157"></a>01157 fprintf(stderr, <span class="stringliteral">"("</span>);
<a name="l01158"></a>01158 <span class="keywordflow">for</span> (i=1; i<pos; i++) {
<a name="l01159"></a>01159 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,context[i]);
<a name="l01160"></a>01160 fprintf(stderr,<span class="stringliteral">","</span>);
<a name="l01161"></a>01161 }
<a name="l01162"></a>01162 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,k);
<a name="l01163"></a>01163 fprintf(stderr,<span class="stringliteral">")\n"</span>);
<a name="l01164"></a>01164 }
<a name="l01165"></a>01165 }
<a name="l01166"></a>01166 <span class="preprocessor">#endif</span>
<a name="l01167"></a>01167 <span class="preprocessor"></span>
<a name="l01168"></a>01168 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[pos],0);
<a name="l01169"></a>01169 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(UB,LB)) {
<a name="l01170"></a>01170 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(LB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(UB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k);
<a name="l01171"></a>01171 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*res, 0);
<a name="l01172"></a>01172 <span class="keywordflow">return</span>;
<a name="l01173"></a>01173 }
<a name="l01174"></a>01174 <span class="keywordflow">if</span> (!P-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l01175"></a>01175 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(k,UB,LB);
<a name="l01176"></a>01176 <a class="code" href="source_2arith_2arithmetique_8h.html#73e7093353d4108ea8f63898e868ed5f">value_add_int</a>(k,k,1);
<a name="l01177"></a>01177 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(*res, k);
<a name="l01178"></a>01178 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(LB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(UB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k);
<a name="l01179"></a>01179 <span class="keywordflow">return</span>;
<a name="l01180"></a>01180 }
<a name="l01181"></a>01181
<a name="l01182"></a>01182 <span class="comment">/*-----------------------------------------------------------------*/</span>
<a name="l01183"></a>01183 <span class="comment">/* Optimization idea */</span>
<a name="l01184"></a>01184 <span class="comment">/* If inner loops are not a function of k (the current index) */</span>
<a name="l01185"></a>01185 <span class="comment">/* i.e. if P->Constraint[i][pos]==0 for all P following this and */</span>
<a name="l01186"></a>01186 <span class="comment">/* for all i, */</span>
<a name="l01187"></a>01187 <span class="comment">/* Then CNT = (UB-LB+1)*count_points(pos+1, P->next, context) */</span>
<a name="l01188"></a>01188 <span class="comment">/* (skip the for loop) */</span>
<a name="l01189"></a>01189 <span class="comment">/*-----------------------------------------------------------------*/</span>
<a name="l01190"></a>01190
<a name="l01191"></a>01191 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(c);
<a name="l01192"></a>01192 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*res, 0);
<a name="l01193"></a>01193 <span class="keywordflow">for</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(k,LB);<a class="code" href="source_2arith_2arithmetique_8h.html#47975ace017981602e1064f98f43f8a7">value_le</a>(k,UB);<a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(k,k)) {
<a name="l01194"></a>01194 <span class="comment">/* Insert k in context */</span>
<a name="l01195"></a>01195 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(context[pos],k);
<a name="l01196"></a>01196 <a class="code" href="ehrhart_8c.html#dfc5a48cdab1ce4848c8f03a2707dcf9" title="PROCEDURES TO COMPUTE ENUMERATION.">count_points</a>(pos+1,P-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>,context,&c);
<a name="l01197"></a>01197 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#9c79acd9dc1cf8e9cddc5fe64dc4c5c0">value_notmone_p</a>(c))
<a name="l01198"></a>01198 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(*res, *res, c);
<a name="l01199"></a>01199 <span class="keywordflow">else</span> {
<a name="l01200"></a>01200 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*res, -1);
<a name="l01201"></a>01201 <span class="keywordflow">break</span>;
<a name="l01202"></a>01202 }
<a name="l01203"></a>01203 }
<a name="l01204"></a>01204 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(c);
<a name="l01205"></a>01205
<a name="l01206"></a>01206 <span class="preprocessor">#ifdef EDEBUG11</span>
<a name="l01207"></a>01207 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"%d\n"</span>,CNT);
<a name="l01208"></a>01208 <span class="preprocessor">#endif</span>
<a name="l01209"></a>01209 <span class="preprocessor"></span>
<a name="l01210"></a>01210 <span class="comment">/* Reset context */</span>
<a name="l01211"></a>01211 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[pos],0);
<a name="l01212"></a>01212 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(LB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(UB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k);
<a name="l01213"></a>01213 <span class="keywordflow">return</span>;
<a name="l01214"></a>01214 } <span class="comment">/* count_points */</span>
<a name="l01215"></a>01215
<a name="l01216"></a>01216 <span class="comment">/*-------------------------------------------------------------------*/</span>
<a name="l01217"></a>01217 <span class="comment">/* enode *P_Enum(L, LQ, context, pos, nb_param, dim, lcm,param_name) */</span>
<a name="l01218"></a>01218 <span class="comment">/* L : list of polyhedra for the loop nest */</span>
<a name="l01219"></a>01219 <span class="comment">/* LQ : list of polyhedra for the parameter loop nest */</span>
<a name="l01220"></a>01220 <span class="comment">/* pos : 1..nb_param, position of the parameter */</span>
<a name="l01221"></a>01221 <span class="comment">/* nb_param : number of parameters total */</span>
<a name="l01222"></a>01222 <span class="comment">/* dim : total dimension of the polyhedron, param incl. */</span>
<a name="l01223"></a>01223 <span class="comment">/* lcm : denominator array [0..dim-1] of the polyhedron */</span>
<a name="l01224"></a>01224 <span class="comment">/* param_name : name of the parameters */</span>
<a name="l01225"></a>01225 <span class="comment">/* Returns an enode tree representing the pseudo polynomial */</span>
<a name="l01226"></a>01226 <span class="comment">/* expression for the enumeration of the polyhedron. */</span>
<a name="l01227"></a>01227 <span class="comment">/* A recursive procedure. */</span>
<a name="l01228"></a>01228 <span class="comment">/*-------------------------------------------------------------------*/</span>
<a name="l01229"></a><a class="code" href="ehrhart_8c.html#6f3773f94c2c24a11ae2eb07fd8673c8">01229</a> <span class="keyword">static</span> <a class="code" href="struct__enode.html">enode</a> *<a class="code" href="ehrhart_8c.html#6f3773f94c2c24a11ae2eb07fd8673c8">P_Enum</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *L,<a class="code" href="structpolyhedron.html">Polyhedron</a> *LQ,Value *context,<span class="keywordtype">int</span> pos,
<a name="l01230"></a>01230 <span class="keywordtype">int</span> nb_param,<span class="keywordtype">int</span> dim,Value *lcm, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_name)
<a name="l01231"></a>01231 {
<a name="l01232"></a>01232 <a class="code" href="struct__enode.html">enode</a> *res,*B,*C;
<a name="l01233"></a>01233 <span class="keywordtype">int</span> hdim,i,j,rank,flag;
<a name="l01234"></a>01234 Value <a class="code" href="polyparam_8c.html#76f11d9a0a47b94f72c2d0e77fb32240">n</a>,g,nLB,nUB,nlcm,noff,nexp,k1,nm,hdv,k,lcm_copy;
<a name="l01235"></a>01235 Value tmp;
<a name="l01236"></a>01236 <a class="code" href="structmatrix.html">Matrix</a> *A;
<a name="l01237"></a>01237
<a name="l01238"></a>01238 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01239"></a>01239 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"-------------------- begin P_Enum -------------------\n"</span>);
<a name="l01240"></a>01240 fprintf(stderr,<span class="stringliteral">"Calling P_Enum with pos = %d\n"</span>,pos);
<a name="l01241"></a>01241 <span class="preprocessor">#endif</span>
<a name="l01242"></a>01242 <span class="preprocessor"></span>
<a name="l01243"></a>01243 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l01244"></a>01244 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(n); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(nLB);
<a name="l01245"></a>01245 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(nUB); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(nlcm); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(noff);
<a name="l01246"></a>01246 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(nexp); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(k1); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(nm);
<a name="l01247"></a>01247 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(hdv); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(k); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l01248"></a>01248 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(lcm_copy);
<a name="l01249"></a>01249
<a name="l01250"></a>01250 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(lcm[pos-1]) )
<a name="l01251"></a>01251 {
<a name="l01252"></a>01252 hdim = 1;
<a name="l01253"></a>01253 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( lcm_copy, 1 );
<a name="l01254"></a>01254 }
<a name="l01255"></a>01255 <span class="keywordflow">else</span>
<a name="l01256"></a>01256 {
<a name="l01257"></a>01257 <span class="comment">/* hdim is the degree of the polynomial + 1 */</span>
<a name="l01258"></a>01258 hdim = dim-nb_param+1; <span class="comment">/* homogenous dim w/o parameters */</span>
<a name="l01259"></a>01259 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>( lcm_copy, lcm[pos-1] );
<a name="l01260"></a>01260 }
<a name="l01261"></a>01261
<a name="l01262"></a>01262 <span class="comment">/* code to limit generation of equations to valid parameters only */</span>
<a name="l01263"></a>01263 <span class="comment">/*----------------------------------------------------------------*/</span>
<a name="l01264"></a>01264 flag = <a class="code" href="polyhedron_8c.html#a8c3f429dd74c5ec2087f97d702cdc66">lower_upper_bounds</a>(pos,LQ,&context[dim-nb_param],&nLB,&nUB);
<a name="l01265"></a>01265 <span class="keywordflow">if</span> (flag & <a class="code" href="types_8h.html#b3e4132829e88232125e7bf259520a18">LB_INFINITY</a>) {
<a name="l01266"></a>01266 <span class="keywordflow">if</span> (!(flag & <a class="code" href="types_8h.html#629bf0301263815e35636f493380b9dd">UB_INFINITY</a>)) {
<a name="l01267"></a>01267
<a name="l01268"></a>01268 <span class="comment">/* Only an upper limit: set lower limit */</span>
<a name="l01269"></a>01269 <span class="comment">/* Compute nLB such that (nUB-nLB+1) >= (hdim*lcm) */</span>
<a name="l01270"></a>01270 <a class="code" href="source_2arith_2arithmetique_8h.html#11f18b25f757ecabd62ef14833909101">value_sub_int</a>(nLB,nUB,1);
<a name="l01271"></a>01271 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(hdv,hdim);
<a name="l01272"></a>01272 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(tmp,hdv,lcm_copy);
<a name="l01273"></a>01273 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(nLB,nLB,tmp);
<a name="l01274"></a>01274 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#01904c8c75c10d407a24c55f16ec27c7">value_pos_p</a>(nLB))
<a name="l01275"></a>01275 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(nLB,0);
<a name="l01276"></a>01276 }
<a name="l01277"></a>01277 <span class="keywordflow">else</span> {
<a name="l01278"></a>01278 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(nLB,0);
<a name="l01279"></a>01279
<a name="l01280"></a>01280 <span class="comment">/* No upper nor lower limit: set lower limit to 0 */</span>
<a name="l01281"></a>01281 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(hdv,hdim);
<a name="l01282"></a>01282 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(nUB,hdv,lcm_copy);
<a name="l01283"></a>01283 <a class="code" href="source_2arith_2arithmetique_8h.html#73e7093353d4108ea8f63898e868ed5f">value_add_int</a>(nUB,nUB,1);
<a name="l01284"></a>01284 }
<a name="l01285"></a>01285 }
<a name="l01286"></a>01286
<a name="l01287"></a>01287 <span class="comment">/* if (nUB-nLB+1) < (hdim*lcm) then we have more unknowns than equations */</span>
<a name="l01288"></a>01288 <span class="comment">/* We can: 1. Find more equations by changing the context parameters, or */</span>
<a name="l01289"></a>01289 <span class="comment">/* 2. Assign extra unknowns values in such a way as to simplify result. */</span>
<a name="l01290"></a>01290 <span class="comment">/* Think about ways to scan parameter space to get as much info out of it*/</span>
<a name="l01291"></a>01291 <span class="comment">/* as possible. */</span>
<a name="l01292"></a>01292
<a name="l01293"></a>01293 <span class="preprocessor">#ifdef REDUCE_DEGREE</span>
<a name="l01294"></a>01294 <span class="preprocessor"></span> <span class="keywordflow">if</span> (pos==1 && (flag & <a class="code" href="types_8h.html#629bf0301263815e35636f493380b9dd">UB_INFINITY</a>)==0) {
<a name="l01295"></a>01295 <span class="comment">/* only for finite upper bound on first parameter */</span>
<a name="l01296"></a>01296 <span class="comment">/* NOTE: only first parameter because subsequent parameters may</span>
<a name="l01297"></a>01297 <span class="comment"> be artificially limited by the choice of the first parameter */</span>
<a name="l01298"></a>01298
<a name="l01299"></a>01299 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01300"></a>01300 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"*************** n **********\n"</span>);
<a name="l01301"></a>01301 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,n);
<a name="l01302"></a>01302 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l01303"></a>01303 <span class="preprocessor">#endif</span>
<a name="l01304"></a>01304 <span class="preprocessor"></span>
<a name="l01305"></a>01305 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(n,nUB,nLB);
<a name="l01306"></a>01306 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(n,n);
<a name="l01307"></a>01307
<a name="l01308"></a>01308 <span class="preprocessor">#ifdef EDEBUG </span>
<a name="l01309"></a>01309 <span class="preprocessor"></span> <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,n);
<a name="l01310"></a>01310 fprintf(stderr,<span class="stringliteral">"\n*************** n ************\n"</span>);
<a name="l01311"></a>01311 <span class="preprocessor">#endif </span>
<a name="l01312"></a>01312 <span class="preprocessor"></span>
<a name="l01313"></a>01313 <span class="comment">/* Total number of samples>0 */</span>
<a name="l01314"></a>01314 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(n))
<a name="l01315"></a>01315 i=0;
<a name="l01316"></a>01316 <span class="keywordflow">else</span> {
<a name="l01317"></a>01317 <a class="code" href="source_2arith_2arithmetique_8h.html#e77f928488d756f77270649775dbdc1d">value_modulus</a>(tmp,n,lcm_copy);
<a name="l01318"></a>01318 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(tmp)) {
<a name="l01319"></a>01319 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(tmp,n,lcm_copy);
<a name="l01320"></a>01320 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(tmp,tmp);
<a name="l01321"></a>01321 i = VALUE_TO_INT(tmp);
<a name="l01322"></a>01322 }
<a name="l01323"></a>01323 <span class="keywordflow">else</span> {
<a name="l01324"></a>01324 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(tmp,n,lcm_copy);
<a name="l01325"></a>01325 i = VALUE_TO_INT(tmp); <span class="comment">/* ceiling of n/lcm */</span>
<a name="l01326"></a>01326 }
<a name="l01327"></a>01327 }
<a name="l01328"></a>01328
<a name="l01329"></a>01329 <span class="preprocessor">#ifdef EDEBUG </span>
<a name="l01330"></a>01330 <span class="preprocessor"></span> <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,n);
<a name="l01331"></a>01331 fprintf(stderr,<span class="stringliteral">"\n*************** n ************\n"</span>);
<a name="l01332"></a>01332 <span class="preprocessor">#endif </span>
<a name="l01333"></a>01333 <span class="preprocessor"></span>
<a name="l01334"></a>01334 <span class="comment">/* Reduce degree of polynomial based on number of sample points */</span>
<a name="l01335"></a>01335 <span class="keywordflow">if</span> (i < hdim){
<a name="l01336"></a>01336 hdim=i;
<a name="l01337"></a>01337
<a name="l01338"></a>01338 <span class="preprocessor">#ifdef EDEBUG4</span>
<a name="l01339"></a>01339 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"Parameter #%d: LB="</span>,pos);
<a name="l01340"></a>01340 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,nLB);
<a name="l01341"></a>01341 fprintf(stdout,<span class="stringliteral">" UB="</span>);
<a name="l01342"></a>01342 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,nUB);
<a name="l01343"></a>01343 fprintf(stdout,<span class="stringliteral">" lcm="</span>);
<a name="l01344"></a>01344 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,lcm_copy);
<a name="l01345"></a>01345 fprintf(stdout,<span class="stringliteral">" degree reduced to %d\n"</span>,hdim-1);
<a name="l01346"></a>01346 <span class="preprocessor">#endif</span>
<a name="l01347"></a>01347 <span class="preprocessor"></span>
<a name="l01348"></a>01348 }
<a name="l01349"></a>01349 }
<a name="l01350"></a>01350 <span class="preprocessor">#endif </span><span class="comment">/* REDUCE_DEGREE */</span>
<a name="l01351"></a>01351
<a name="l01352"></a>01352 <span class="comment">/* hdim is now set */</span>
<a name="l01353"></a>01353 <span class="comment">/* allocate result structure */</span>
<a name="l01354"></a>01354 res = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>,hdim,pos);
<a name="l01355"></a>01355 <span class="keywordflow">for</span> (i=0;i<hdim;i++) {
<a name="l01356"></a>01356 <span class="keywordtype">int</span> l;
<a name="l01357"></a>01357 l = VALUE_TO_INT(lcm_copy);
<a name="l01358"></a>01358 res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>,l,pos);
<a name="l01359"></a>01359 }
<a name="l01360"></a>01360
<a name="l01361"></a>01361 <span class="comment">/* Utility arrays */</span>
<a name="l01362"></a>01362 A = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(hdim, 2*hdim+1); <span class="comment">/* used for Gauss */</span>
<a name="l01363"></a>01363 B = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fedcabe6900b0394de2166c488c664bdd6a">evector</a>, hdim, 0);
<a name="l01364"></a>01364 C = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fedcabe6900b0394de2166c488c664bdd6a">evector</a>, hdim, 0);
<a name="l01365"></a>01365
<a name="l01366"></a>01366 <span class="comment">/* We'll create these again when we need them */</span>
<a name="l01367"></a>01367 <span class="keywordflow">for</span> (j = 0; j < hdim; ++j)
<a name="l01368"></a>01368 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j]);
<a name="l01369"></a>01369
<a name="l01370"></a>01370 <span class="comment">/*----------------------------------------------------------------*/</span>
<a name="l01371"></a>01371 <span class="comment">/* */</span>
<a name="l01372"></a>01372 <span class="comment">/* 0<-----+---k---------> */</span>
<a name="l01373"></a>01373 <span class="comment">/* |---------noff----------------->-nlcm->-------lcm----> */</span>
<a name="l01374"></a>01374 <span class="comment">/* |--- . . . -----|--------------|------+-------|------+-------|-*/</span>
<a name="l01375"></a>01375 <span class="comment">/* 0 (q-1)*lcm q*lcm | (q+1)*lcm | */</span>
<a name="l01376"></a>01376 <span class="comment">/* nLB nLB+lcm */</span>
<a name="l01377"></a>01377 <span class="comment">/* */</span>
<a name="l01378"></a>01378 <span class="comment">/*----------------------------------------------------------------*/</span>
<a name="l01379"></a>01379 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(nLB)) {
<a name="l01380"></a>01380 <a class="code" href="source_2arith_2arithmetique_8h.html#e77f928488d756f77270649775dbdc1d">value_modulus</a>(nlcm,nLB,lcm_copy);
<a name="l01381"></a>01381 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(nlcm,nlcm,lcm_copy);
<a name="l01382"></a>01382 }
<a name="l01383"></a>01383 <span class="keywordflow">else</span> {
<a name="l01384"></a>01384 <a class="code" href="source_2arith_2arithmetique_8h.html#e77f928488d756f77270649775dbdc1d">value_modulus</a>(nlcm,nLB,lcm_copy);
<a name="l01385"></a>01385 }
<a name="l01386"></a>01386
<a name="l01387"></a>01387 <span class="comment">/* noff is a multiple of lcm */</span>
<a name="l01388"></a>01388 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(noff,nLB,nlcm);
<a name="l01389"></a>01389 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp,lcm_copy,nlcm);
<a name="l01390"></a>01390 <span class="keywordflow">for</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(k,nlcm);<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(k,tmp);) {
<a name="l01391"></a>01391
<a name="l01392"></a>01392 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01393"></a>01393 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Finding "</span>);
<a name="l01394"></a>01394 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,k);
<a name="l01395"></a>01395 fprintf(stderr,<span class="stringliteral">"-th elements of periodic coefficients\n"</span>);
<a name="l01396"></a>01396 <span class="preprocessor">#endif</span>
<a name="l01397"></a>01397 <span class="preprocessor"></span>
<a name="l01398"></a>01398 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(hdv,hdim);
<a name="l01399"></a>01399 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(nm,hdv,lcm_copy);
<a name="l01400"></a>01400 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(nm,nm,nLB);
<a name="l01401"></a>01401 i=0;
<a name="l01402"></a>01402 <span class="keywordflow">for</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(n,k,noff); <a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(n,nm);
<a name="l01403"></a>01403 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(n,n,lcm_copy),i++) {
<a name="l01404"></a>01404
<a name="l01405"></a>01405 <span class="comment">/* n == i*lcm + k + noff; */</span>
<a name="l01406"></a>01406 <span class="comment">/* nlcm <= k < nlcm+lcm */</span>
<a name="l01407"></a>01407 <span class="comment">/* n mod lcm == k1 */</span>
<a name="l01408"></a>01408
<a name="l01409"></a>01409 <span class="preprocessor">#ifdef ALL_OVERFLOW_WARNINGS</span>
<a name="l01410"></a>01410 <span class="preprocessor"></span> <span class="keywordflow">if</span> (((flag & UB_INFINITY)==0) && <a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(n,nUB)) {
<a name="l01411"></a>01411 fprintf(stdout,<span class="stringliteral">"Domain Overflow: Parameter #%d:"</span>,pos);
<a name="l01412"></a>01412 fprintf(stdout,<span class="stringliteral">"nLB="</span>);
<a name="l01413"></a>01413 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,nLB);
<a name="l01414"></a>01414 fprintf(stdout,<span class="stringliteral">" n="</span>);
<a name="l01415"></a>01415 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,n);
<a name="l01416"></a>01416 fprintf(stdout,<span class="stringliteral">" nUB="</span>);
<a name="l01417"></a>01417 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,nUB);
<a name="l01418"></a>01418 fprintf(stdout,<span class="stringliteral">"\n"</span>);
<a name="l01419"></a>01419 }
<a name="l01420"></a>01420 <span class="preprocessor">#else</span>
<a name="l01421"></a>01421 <span class="preprocessor"></span> <span class="keywordflow">if</span> (<a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> && ((flag & UB_INFINITY)==0) &&
<a name="l01422"></a>01422 <a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(n,nUB)) {
<a name="l01423"></a>01423 fprintf(stdout,<span class="stringliteral">"\nWARNING: Parameter Domain Overflow."</span>);
<a name="l01424"></a>01424 fprintf(stdout,<span class="stringliteral">" Result may be incorrect on this domain.\n"</span>);
<a name="l01425"></a>01425 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 0;
<a name="l01426"></a>01426 }
<a name="l01427"></a>01427 <span class="preprocessor">#endif</span>
<a name="l01428"></a>01428 <span class="preprocessor"></span>
<a name="l01429"></a>01429 <span class="comment">/* Set parameter to n */</span>
<a name="l01430"></a>01430 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(context[dim-nb_param+pos],n);
<a name="l01431"></a>01431
<a name="l01432"></a>01432 <span class="preprocessor">#ifdef EDEBUG1</span>
<a name="l01433"></a>01433 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01434"></a>01434 {
<a name="l01435"></a>01435 fprintf(stderr,<span class="stringliteral">"%s = "</span>,param_name[pos-1]);
<a name="l01436"></a>01436 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,n);
<a name="l01437"></a>01437 fprintf(stderr,<span class="stringliteral">" (hdim=%d, lcm[%d]="</span>,hdim,pos-1);
<a name="l01438"></a>01438 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,lcm_copy);
<a name="l01439"></a>01439 fprintf(stderr,<span class="stringliteral">")\n"</span>);
<a name="l01440"></a>01440 }
<a name="l01441"></a>01441 <span class="keywordflow">else</span>
<a name="l01442"></a>01442 {
<a name="l01443"></a>01443 fprintf(stderr,<span class="stringliteral">"P%d = "</span>,pos);
<a name="l01444"></a>01444 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,n);
<a name="l01445"></a>01445 fprintf(stderr,<span class="stringliteral">" (hdim=%d, lcm[%d]="</span>,hdim,pos-1);
<a name="l01446"></a>01446 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,VALUE_FMT,lcm_copy);
<a name="l01447"></a>01447 fprintf(stderr,<span class="stringliteral">")\n"</span>);
<a name="l01448"></a>01448 }
<a name="l01449"></a>01449 <span class="preprocessor">#endif</span>
<a name="l01450"></a>01450 <span class="preprocessor"></span>
<a name="l01451"></a>01451 <span class="comment">/* Setup B vector */</span>
<a name="l01452"></a>01452 <span class="keywordflow">if</span> (pos==nb_param) {
<a name="l01453"></a>01453
<a name="l01454"></a>01454 <span class="preprocessor">#ifdef EDEBUG </span>
<a name="l01455"></a>01455 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Yes\n"</span>);
<a name="l01456"></a>01456 <span class="preprocessor">#endif </span>
<a name="l01457"></a>01457 <span class="preprocessor"></span>
<a name="l01458"></a>01458 <span class="comment">/* call count */</span>
<a name="l01459"></a>01459 <span class="comment">/* count can only be called when the context is fully specified */</span>
<a name="l01460"></a>01460 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,1);
<a name="l01461"></a>01461 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n);
<a name="l01462"></a>01462 <a class="code" href="ehrhart_8c.html#dfc5a48cdab1ce4848c8f03a2707dcf9" title="PROCEDURES TO COMPUTE ENUMERATION.">count_points</a>(1,L,context,&B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n);
<a name="l01463"></a>01463
<a name="l01464"></a>01464 <span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l01465"></a>01465 <span class="preprocessor"></span> <span class="keywordflow">for</span> (j=1; j<pos; j++) fputs(<span class="stringliteral">" "</span>,stdout);
<a name="l01466"></a>01466 fprintf(stdout, <span class="stringliteral">"E("</span>);
<a name="l01467"></a>01467 <span class="keywordflow">for</span> (j=1; j<nb_param; j++) {
<a name="l01468"></a>01468 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,context[dim-nb_param+j]);
<a name="l01469"></a>01469 fprintf(stdout,<span class="stringliteral">","</span>);
<a name="l01470"></a>01470 }
<a name="l01471"></a>01471 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,n);
<a name="l01472"></a>01472 fprintf(stdout,<span class="stringliteral">") = "</span>);
<a name="l01473"></a>01473 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.n);
<a name="l01474"></a>01474 fprintf(stdout,<span class="stringliteral">" ="</span>);
<a name="l01475"></a>01475 <span class="preprocessor">#endif</span>
<a name="l01476"></a>01476 <span class="preprocessor"></span>
<a name="l01477"></a>01477 }
<a name="l01478"></a>01478 <span class="keywordflow">else</span> { <span class="comment">/* count is a function of other parameters */</span>
<a name="l01479"></a>01479 <span class="comment">/* call P_Enum recursively */</span>
<a name="l01480"></a>01480 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l01481"></a>01481 B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p = <a class="code" href="ehrhart_8c.html#6f3773f94c2c24a11ae2eb07fd8673c8">P_Enum</a>(L,LQ-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>,context,pos+1,
<a name="l01482"></a>01482 nb_param,dim,lcm,param_name);
<a name="l01483"></a>01483
<a name="l01484"></a>01484 <span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l01485"></a>01485 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01486"></a>01486 {
<a name="l01487"></a>01487 <span class="keywordflow">for</span> (j=1; j<pos; j++)
<a name="l01488"></a>01488 fputs(<span class="stringliteral">" "</span>, stdout);
<a name="l01489"></a>01489 fprintf(stdout, <span class="stringliteral">"E("</span>);
<a name="l01490"></a>01490 <span class="keywordflow">for</span> (j=1; j<=pos; j++) {
<a name="l01491"></a>01491 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,context[dim-nb_param+j]);
<a name="l01492"></a>01492 fprintf(stdout,<span class="stringliteral">","</span>);
<a name="l01493"></a>01493 }
<a name="l01494"></a>01494 <span class="keywordflow">for</span> (j=pos+1; j<nb_param; j++)
<a name="l01495"></a>01495 fprintf(stdout,<span class="stringliteral">"%s,"</span>,param_name[j]);
<a name="l01496"></a>01496 fprintf(stdout,<span class="stringliteral">"%s) = "</span>,param_name[j]);
<a name="l01497"></a>01497 <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(stdout,B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p,param_name);
<a name="l01498"></a>01498 fprintf(stdout,<span class="stringliteral">" ="</span>);
<a name="l01499"></a>01499 }
<a name="l01500"></a>01500 <span class="preprocessor">#endif</span>
<a name="l01501"></a>01501 <span class="preprocessor"></span>
<a name="l01502"></a>01502 }
<a name="l01503"></a>01503
<a name="l01504"></a>01504 <span class="comment">/* Create i-th equation*/</span>
<a name="l01505"></a>01505 <span class="comment">/* K_0 + K_1 * n**1 + ... + K_dim * n**dim | Identity Matrix */</span>
<a name="l01506"></a>01506
<a name="l01507"></a>01507 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][0],0); <span class="comment">/* status bit = equality */</span>
<a name="l01508"></a>01508 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(nexp,1);
<a name="l01509"></a>01509 <span class="keywordflow">for</span> (j=1;j<=hdim;j++) {
<a name="l01510"></a>01510 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],nexp);
<a name="l01511"></a>01511 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j+hdim],0);
<a name="l01512"></a>01512
<a name="l01513"></a>01513 <span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l01514"></a>01514 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">" + "</span>);
<a name="l01515"></a>01515 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,nexp);
<a name="l01516"></a>01516 fprintf(stdout,<span class="stringliteral">" c%d"</span>,j);
<a name="l01517"></a>01517 <span class="preprocessor">#endif </span>
<a name="l01518"></a>01518 <span class="preprocessor"></span> <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(nexp,nexp,n);
<a name="l01519"></a>01519 }
<a name="l01520"></a>01520
<a name="l01521"></a>01521 <span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l01522"></a>01522 <span class="preprocessor"></span> fprintf(stdout, <span class="stringliteral">"\n"</span>);
<a name="l01523"></a>01523 <span class="preprocessor">#endif</span>
<a name="l01524"></a>01524 <span class="preprocessor"></span>
<a name="l01525"></a>01525 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i+1+hdim],1);
<a name="l01526"></a>01526 }
<a name="l01527"></a>01527
<a name="l01528"></a>01528 <span class="comment">/* Assertion check */</span>
<a name="l01529"></a>01529 <span class="keywordflow">if</span> (i!=hdim)
<a name="l01530"></a>01530 fprintf(stderr, <span class="stringliteral">"P_Enum: ?expecting i==hdim\n"</span>);
<a name="l01531"></a>01531
<a name="l01532"></a>01532 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01533"></a>01533 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01534"></a>01534 {
<a name="l01535"></a>01535 fprintf(stderr,<span class="stringliteral">"B (enode) =\n"</span>);
<a name="l01536"></a>01536 <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(stderr,B,param_name);
<a name="l01537"></a>01537 }
<a name="l01538"></a>01538 fprintf(stderr,<span class="stringliteral">"A (Before Gauss) =\n"</span>);
<a name="l01539"></a>01539 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,A);
<a name="l01540"></a>01540 <span class="preprocessor">#endif</span>
<a name="l01541"></a>01541 <span class="preprocessor"></span>
<a name="l01542"></a>01542 <span class="comment">/* Solve hdim (=dim+1) equations with hdim unknowns, result in CNT */</span>
<a name="l01543"></a>01543 rank = <a class="code" href="polyhedron_8c.html#671d2a19d0c376dec383521e78faa70a">Gauss</a>(A,hdim,2*hdim);
<a name="l01544"></a>01544
<a name="l01545"></a>01545 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01546"></a>01546 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"A (After Gauss) =\n"</span>);
<a name="l01547"></a>01547 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,A);
<a name="l01548"></a>01548 <span class="preprocessor">#endif</span>
<a name="l01549"></a>01549 <span class="preprocessor"></span>
<a name="l01550"></a>01550 <span class="comment">/* Assertion check */</span>
<a name="l01551"></a>01551 <span class="keywordflow">if</span> (rank!=hdim) {
<a name="l01552"></a>01552 fprintf(stderr, <span class="stringliteral">"P_Enum: ?expecting rank==hdim\n"</span>);
<a name="l01553"></a>01553 }
<a name="l01554"></a>01554
<a name="l01555"></a>01555 <span class="comment">/* if (rank < hdim) then set the last hdim-rank coefficients to ? */</span>
<a name="l01556"></a>01556 <span class="comment">/* if (rank == 0) then set all coefficients to 0 */</span>
<a name="l01557"></a>01557 <span class="comment">/* copy result as k1-th element of periodic numbers */</span>
<a name="l01558"></a>01558 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(k,lcm_copy))
<a name="l01559"></a>01559 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(k1,k);
<a name="l01560"></a>01560 <span class="keywordflow">else</span>
<a name="l01561"></a>01561 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(k1,k,lcm_copy);
<a name="l01562"></a>01562
<a name="l01563"></a>01563 <span class="keywordflow">for</span> (i=0; i<rank; i++) {
<a name="l01564"></a>01564
<a name="l01565"></a>01565 <span class="comment">/* Set up coefficient vector C from i-th row of inverted matrix */</span>
<a name="l01566"></a>01566 <span class="keywordflow">for</span> (j=0; j<rank; j++) {
<a name="l01567"></a>01567 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(g, A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i+1], A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j+1+hdim]);
<a name="l01568"></a>01568 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l01569"></a>01569 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i+1], g);
<a name="l01570"></a>01570 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j].x.n);
<a name="l01571"></a>01571 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j].x.n, A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j+1+hdim], g);
<a name="l01572"></a>01572 }
<a name="l01573"></a>01573
<a name="l01574"></a>01574 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01575"></a>01575 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01576"></a>01576 {
<a name="l01577"></a>01577 fprintf(stderr, <span class="stringliteral">"C (enode) =\n"</span>);
<a name="l01578"></a>01578 <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(stderr, C, param_name);
<a name="l01579"></a>01579 }
<a name="l01580"></a>01580 <span class="preprocessor">#endif</span>
<a name="l01581"></a>01581 <span class="preprocessor"></span>
<a name="l01582"></a>01582 <span class="comment">/* The i-th enode is the lcm-periodic coefficient of term n**i */</span>
<a name="l01583"></a>01583 <a class="code" href="ehrhart_8c.html#197ef6aec479254f610d450de8890d02" title="computes the inner product of two vectors.">edot</a>(B,C,&(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p->arr[VALUE_TO_INT(k1)]));
<a name="l01584"></a>01584
<a name="l01585"></a>01585 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01586"></a>01586 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01587"></a>01587 {
<a name="l01588"></a>01588 fprintf(stderr, <span class="stringliteral">"B.C (evalue)=\n"</span>);
<a name="l01589"></a>01589 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stderr,&(res-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].x.p->arr[VALUE_TO_INT(k1)]),
<a name="l01590"></a>01590 param_name);
<a name="l01591"></a>01591 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l01592"></a>01592 }
<a name="l01593"></a>01593 <span class="preprocessor">#endif</span>
<a name="l01594"></a>01594 <span class="preprocessor"></span>
<a name="l01595"></a>01595 <span class="keywordflow">for</span> (j = 0; j < rank; ++j)
<a name="l01596"></a>01596 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&C-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[j]);
<a name="l01597"></a>01597 }
<a name="l01598"></a>01598 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp,lcm_copy,nlcm);
<a name="l01599"></a>01599
<a name="l01600"></a>01600 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(k,k);
<a name="l01601"></a>01601 <span class="keywordflow">for</span> (i = 0; i < hdim; ++i) {
<a name="l01602"></a>01602 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]);
<a name="l01603"></a>01603 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(k,tmp))
<a name="l01604"></a>01604 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(B-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l01605"></a>01605 }
<a name="l01606"></a>01606 }
<a name="l01607"></a>01607
<a name="l01608"></a>01608 <span class="preprocessor">#ifdef EDEBUG</span>
<a name="l01609"></a>01609 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l01610"></a>01610 {
<a name="l01611"></a>01611 fprintf(stderr,<span class="stringliteral">"res (enode) =\n"</span>);
<a name="l01612"></a>01612 <a class="code" href="ehrhart_8c.html#84dff5d1187317811e98a92ac8a37fa3" title="prints the enode to DST">print_enode</a>(stderr,res,param_name);
<a name="l01613"></a>01613 }
<a name="l01614"></a>01614 fprintf(stderr, <span class="stringliteral">"-------------------- end P_Enum -----------------------\n"</span>);
<a name="l01615"></a>01615 <span class="preprocessor">#endif</span>
<a name="l01616"></a>01616 <span class="preprocessor"></span>
<a name="l01617"></a>01617 <span class="comment">/* Reset context */</span>
<a name="l01618"></a>01618 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[dim-nb_param+pos],0);
<a name="l01619"></a>01619
<a name="l01620"></a>01620 <span class="comment">/* Release memory */</span>
<a name="l01621"></a>01621 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(A);
<a name="l01622"></a>01622 free(B);
<a name="l01623"></a>01623 free(C);
<a name="l01624"></a>01624
<a name="l01625"></a>01625 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l01626"></a>01626 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(n); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(nLB);
<a name="l01627"></a>01627 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(nUB); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(nlcm); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(noff);
<a name="l01628"></a>01628 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(nexp); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(nm);
<a name="l01629"></a>01629 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(hdv); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01630"></a>01630 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(lcm_copy);
<a name="l01631"></a>01631 <span class="keywordflow">return</span> res;
<a name="l01632"></a>01632 } <span class="comment">/* P_Enum */</span>
<a name="l01633"></a>01633
<a name="l01634"></a>01634 <span class="comment">/*----------------------------------------------------------------*/</span>
<a name="l01635"></a>01635 <span class="comment">/* Scan_Vertices(PP, Q, CT) */</span>
<a name="l01636"></a>01636 <span class="comment">/* PP : ParamPolyhedron */</span>
<a name="l01637"></a>01637 <span class="comment">/* Q : Domain */</span>
<a name="l01638"></a>01638 <span class="comment">/* CT : Context transformation matrix */</span>
<a name="l01639"></a>01639 <span class="comment">/* lcm : lcm array (output) */</span>
<a name="l01640"></a>01640 <span class="comment">/* nbp : number of parameters */</span>
<a name="l01641"></a>01641 <span class="comment">/* param_name : name of the parameters */</span>
<a name="l01642"></a>01642 <span class="comment">/*----------------------------------------------------------------*/</span>
<a name="l01643"></a><a class="code" href="ehrhart_8c.html#ecc29a697804903fb5526f4ebdd1993a">01643</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#ecc29a697804903fb5526f4ebdd1993a">Scan_Vertices</a>(<a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *PP,<a class="code" href="struct__Param__Domain.html">Param_Domain</a> *Q,<a class="code" href="structmatrix.html">Matrix</a> *CT,
<a name="l01644"></a>01644 Value *lcm, <span class="keywordtype">int</span> nbp, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_name)
<a name="l01645"></a>01645 {
<a name="l01646"></a>01646 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> *V;
<a name="l01647"></a>01647 <span class="keywordtype">int</span> i, j, ix, l, np;
<a name="l01648"></a>01648 <span class="keywordtype">unsigned</span> bx;
<a name="l01649"></a>01649 Value k,m1;
<a name="l01650"></a>01650
<a name="l01651"></a>01651 <span class="comment">/* Compute the denominator of P */</span>
<a name="l01652"></a>01652 <span class="comment">/* lcm = Least Common Multiple of the denominators of the vertices of P */</span>
<a name="l01653"></a>01653 <span class="comment">/* and print the vertices */</span>
<a name="l01654"></a>01654
<a name="l01655"></a>01655 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(k); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1);
<a name="l01656"></a>01656 <span class="keywordflow">for</span>( np=0 ; np<nbp ; np++ )
<a name="l01657"></a>01657 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( lcm[np], 0 );
<a name="l01658"></a>01658
<a name="l01659"></a>01659 <span class="keywordflow">if</span>( param_name )
<a name="l01660"></a>01660 fprintf(stdout,<span class="stringliteral">"Vertices:\n"</span>);
<a name="l01661"></a>01661
<a name="l01662"></a>01662 <span class="keywordflow">for</span>(i=0,ix=0,bx=<a class="code" href="types_8h.html#11f27b3b63dfc15c4b4fbb665a3ce3fe">MSB</a>,V=PP-><a class="code" href="struct__Param__Polyhedron.html#183b47f3f8b8c27079a840c934e7b972">V</a>; V && i<PP->nbV; i++,V=V-><a class="code" href="struct__Param__Vertex.html#1115989a70826c590a1c71923cdeee68">next</a>) {
<a name="l01663"></a>01663 <span class="keywordflow">if</span> (Q-><a class="code" href="struct__Param__Domain.html#c87a60cf654cb9b80ddcac469d6ee81a">F</a>[ix] & bx) {
<a name="l01664"></a>01664 <span class="keywordflow">if</span>( param_name )
<a name="l01665"></a>01665 {
<a name="l01666"></a>01666 <span class="keywordflow">if</span>(CT) {
<a name="l01667"></a>01667 <a class="code" href="structmatrix.html">Matrix</a> *v;
<a name="l01668"></a>01668 v = <a class="code" href="polyparam_8c.html#6d1dac6dcd959d6489cdd4933f75fc7e">VertexCT</a>(V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>,CT);
<a name="l01669"></a>01669 <a class="code" href="polyparam_8c.html#ed63fd8f223a4776c442b144edb03fae">Print_Vertex</a>(stdout,v,param_name);
<a name="l01670"></a>01670 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(v);
<a name="l01671"></a>01671 }
<a name="l01672"></a>01672 <span class="keywordflow">else</span>
<a name="l01673"></a>01673 <a class="code" href="polyparam_8c.html#ed63fd8f223a4776c442b144edb03fae">Print_Vertex</a>(stdout,V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>,param_name);
<a name="l01674"></a>01674 fprintf(stdout,<span class="stringliteral">"\n"</span>);
<a name="l01675"></a>01675 }
<a name="l01676"></a>01676
<a name="l01677"></a>01677 <span class="keywordflow">for</span>(j=0;j<V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;j++) {
<a name="l01678"></a>01678 <span class="comment">/* A matrix */</span>
<a name="l01679"></a>01679 <span class="keywordflow">for</span>( l=0 ; l<V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1 ; l++ )
<a name="l01680"></a>01680 {
<a name="l01681"></a>01681 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]) )
<a name="l01682"></a>01682 {
<a name="l01683"></a>01683 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(m1, V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],
<a name="l01684"></a>01684 V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]);
<a name="l01685"></a>01685 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(k, V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][V-><a class="code" href="struct__Param__Vertex.html#d61ebc6810df483f7b0e25fea5c6cdf1">Vertex</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1], m1);
<a name="l01686"></a>01686 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(lcm[l]) )
<a name="l01687"></a>01687 {
<a name="l01688"></a>01688 <span class="comment">/* lcm[l] = lcm[l] * k / gcd(k,lcm[l]) */</span>
<a name="l01689"></a>01689 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(k) && <a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(k))
<a name="l01690"></a>01690 {
<a name="l01691"></a>01691 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(m1, lcm[l], k);
<a name="l01692"></a>01692 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(k, k, m1);
<a name="l01693"></a>01693 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(lcm[l],lcm[l],k);
<a name="l01694"></a>01694 }
<a name="l01695"></a>01695 }
<a name="l01696"></a>01696 <span class="keywordflow">else</span>
<a name="l01697"></a>01697 {
<a name="l01698"></a>01698 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(lcm[l],k);
<a name="l01699"></a>01699 }
<a name="l01700"></a>01700 }
<a name="l01701"></a>01701 }
<a name="l01702"></a>01702 }
<a name="l01703"></a>01703 }
<a name="l01704"></a>01704 <a class="code" href="types_8h.html#3dd66db5db700555d4e24314974a2ea1">NEXT</a>(ix,bx);
<a name="l01705"></a>01705 }
<a name="l01706"></a>01706 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1);
<a name="l01707"></a>01707 } <span class="comment">/* Scan_Vertices */</span>
<a name="l01708"></a>01708 <span class="comment"></span>
<a name="l01709"></a>01709 <span class="comment">/**</span>
<a name="l01710"></a>01710 <span class="comment"></span>
<a name="l01711"></a>01711 <span class="comment">Procedure to count points in a non-parameterized polytope.</span>
<a name="l01712"></a>01712 <span class="comment"></span>
<a name="l01713"></a>01713 <span class="comment">@param P Polyhedron to count</span>
<a name="l01714"></a>01714 <span class="comment">@param C Parameter Context domain</span>
<a name="l01715"></a>01715 <span class="comment">@param CT Matrix to transform context to original</span>
<a name="l01716"></a>01716 <span class="comment">@param CEq additionnal equalities in context</span>
<a name="l01717"></a>01717 <span class="comment">@param MAXRAYS workspace size</span>
<a name="l01718"></a>01718 <span class="comment">@param param_name parameter names</span>
<a name="l01719"></a>01719 <span class="comment"></span>
<a name="l01720"></a>01720 <span class="comment">*/</span>
<a name="l01721"></a><a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136">01721</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136" title="Procedure to count points in a non-parameterized polytope.">Enumerate_NoParameters</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *P,<a class="code" href="structpolyhedron.html">Polyhedron</a> *C,
<a name="l01722"></a>01722 <a class="code" href="structmatrix.html">Matrix</a> *CT,<a class="code" href="structpolyhedron.html">Polyhedron</a> *CEq,
<a name="l01723"></a>01723 <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_name)
<a name="l01724"></a>01724 {
<a name="l01725"></a>01725 <a class="code" href="structpolyhedron.html">Polyhedron</a> *L;
<a name="l01726"></a>01726 <a class="code" href="struct__enumeration.html">Enumeration</a> *res;
<a name="l01727"></a>01727 Value *context;
<a name="l01728"></a>01728 <span class="keywordtype">int</span> j;
<a name="l01729"></a>01729 <span class="keywordtype">int</span> hdim = P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> + 1;
<a name="l01730"></a>01730 <span class="keywordtype">int</span> r,i;
<a name="l01731"></a>01731
<a name="l01732"></a>01732 <span class="comment">/* Create a context vector size dim+2 */</span>
<a name="l01733"></a>01733 context = (Value *) malloc((hdim+1)*<span class="keyword">sizeof</span>(Value));
<a name="l01734"></a>01734 <span class="keywordflow">for</span> (j=0;j<= hdim;j++)
<a name="l01735"></a>01735 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(context[j]);
<a name="l01736"></a>01736
<a name="l01737"></a>01737 res = (<a class="code" href="struct__enumeration.html">Enumeration</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enumeration.html">Enumeration</a>));
<a name="l01738"></a>01738 res-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = NULL;
<a name="l01739"></a>01739 res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = <a class="code" href="polyhedron_8c.html#832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(0); <span class="comment">/* no parameters */</span>
<a name="l01740"></a>01740 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l01741"></a>01741 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l01742"></a>01742 L = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(P,res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,MAXRAYS);
<a name="l01743"></a>01743
<a name="l01744"></a>01744 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l01745"></a>01745 <span class="preprocessor"></span> fprintf(stderr, <span class="stringliteral">"L = \n"</span>);
<a name="l01746"></a>01746 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr, <a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, L);
<a name="l01747"></a>01747 <span class="preprocessor">#endif</span>
<a name="l01748"></a>01748 <span class="preprocessor"></span>
<a name="l01749"></a>01749 <span class="keywordflow">if</span>(CT) {
<a name="l01750"></a>01750 <a class="code" href="structpolyhedron.html">Polyhedron</a> *Dt;
<a name="l01751"></a>01751
<a name="l01752"></a>01752 <span class="comment">/* Add parameters to validity domain */</span>
<a name="l01753"></a>01753 Dt = <a class="code" href="polyhedron_8c.html#53d52d5d1befc1d1446e0920556c3d24">Polyhedron_Preimage</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,CT,MAXRAYS);
<a name="l01754"></a>01754 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>);
<a name="l01755"></a>01755 res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = <a class="code" href="polyhedron_8c.html#c5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(Dt,CEq,MAXRAYS);
<a name="l01756"></a>01756 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Dt);
<a name="l01757"></a>01757 }
<a name="l01758"></a>01758
<a name="l01759"></a>01759 <span class="keywordflow">if</span>( param_name )
<a name="l01760"></a>01760 {
<a name="l01761"></a>01761 fprintf(stdout,<span class="stringliteral">"---------------------------------------\n"</span>);
<a name="l01762"></a>01762 fprintf(stdout,<span class="stringliteral">"Domain:\n"</span>);
<a name="l01763"></a>01763 <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, param_name);
<a name="l01764"></a>01764
<a name="l01765"></a>01765 <span class="comment">/* Print the vertices */</span>
<a name="l01766"></a>01766 printf(<span class="stringliteral">"Vertices:\n"</span>);
<a name="l01767"></a>01767 <span class="keywordflow">for</span>(r=0;r<P-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;++r) {
<a name="l01768"></a>01768 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(P-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][0]))
<a name="l01769"></a>01769 printf(<span class="stringliteral">"(line) "</span>);
<a name="l01770"></a>01770 printf(<span class="stringliteral">"["</span>);
<a name="l01771"></a>01771 <span class="keywordflow">if</span> (P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> > 0)
<a name="l01772"></a>01772 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,P-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][1]);
<a name="l01773"></a>01773 <span class="keywordflow">for</span>(i=1;i<P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;i++) {
<a name="l01774"></a>01774 printf(<span class="stringliteral">", "</span>);
<a name="l01775"></a>01775 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,P-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][i+1]);
<a name="l01776"></a>01776 }
<a name="l01777"></a>01777 printf(<span class="stringliteral">"]"</span>);
<a name="l01778"></a>01778 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(P-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1])) {
<a name="l01779"></a>01779 printf(<span class="stringliteral">"/"</span>);
<a name="l01780"></a>01780 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, P-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l01781"></a>01781 }
<a name="l01782"></a>01782 printf(<span class="stringliteral">"\n"</span>);
<a name="l01783"></a>01783 }
<a name="l01784"></a>01784 }
<a name="l01785"></a>01785
<a name="l01786"></a>01786 res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p = <a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>,1,0);;
<a name="l01787"></a>01787 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p->arr[0].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, 1);
<a name="l01788"></a>01788 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p->arr[0].x.n);
<a name="l01789"></a>01789
<a name="l01790"></a>01790 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(P)) {
<a name="l01791"></a>01791 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p->arr[0].x.n, 0);
<a name="l01792"></a>01792 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!L) {
<a name="l01793"></a>01793 <span class="comment">/* Non-empty zero-dimensional domain */</span>
<a name="l01794"></a>01794 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p->arr[0].x.n, 1);
<a name="l01795"></a>01795 } <span class="keywordflow">else</span> {
<a name="l01796"></a>01796 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#221261b286628ee622df9588446d503e">CATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>) {
<a name="l01797"></a>01797 fprintf(stderr,<span class="stringliteral">"Enumerate: arithmetic overflow error.\n"</span>);
<a name="l01798"></a>01798 fprintf(stderr,<span class="stringliteral">"You should rebuild PolyLib using GNU-MP"</span>
<a name="l01799"></a>01799 <span class="stringliteral">" or increasing the size of integers.\n"</span>);
<a name="l01800"></a>01800 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 0;
<a name="l01801"></a>01801 <a class="code" href="assert_8h.html#07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(<a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a>);
<a name="l01802"></a>01802 }
<a name="l01803"></a>01803 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#d2746371528bdf15c3910b7bf217dac0">TRY</a> {
<a name="l01804"></a>01804
<a name="l01805"></a>01805 <a class="code" href="vector_8c.html#27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(context,0,(hdim+1));
<a name="l01806"></a>01806
<a name="l01807"></a>01807 <span class="comment">/* Set context[hdim] = 1 (the constant) */</span>
<a name="l01808"></a>01808 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[hdim],1);
<a name="l01809"></a>01809 <a class="code" href="ehrhart_8c.html#dfc5a48cdab1ce4848c8f03a2707dcf9" title="PROCEDURES TO COMPUTE ENUMERATION.">count_points</a>(1, L, context, &res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p->arr[0].x.n);
<a name="l01810"></a>01810 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#8211465bb59b0e6b8c374b440965dbb4">UNCATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>);
<a name="l01811"></a>01811 }
<a name="l01812"></a>01812 }
<a name="l01813"></a>01813
<a name="l01814"></a>01814 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(L);
<a name="l01815"></a>01815
<a name="l01816"></a>01816 <span class="comment">/* **USELESS, there are no references to parameters in res**</span>
<a name="l01817"></a>01817 <span class="comment"> if( CT )</span>
<a name="l01818"></a>01818 <span class="comment"> addeliminatedparams_evalue(&res->EP, CT);</span>
<a name="l01819"></a>01819 <span class="comment"> */</span>
<a name="l01820"></a>01820
<a name="l01821"></a>01821 <span class="keywordflow">if</span>( param_name )
<a name="l01822"></a>01822 {
<a name="l01823"></a>01823 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial:\n"</span>);
<a name="l01824"></a>01824 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,param_name);
<a name="l01825"></a>01825 fprintf(stdout, <span class="stringliteral">"\n"</span>);
<a name="l01826"></a>01826 }
<a name="l01827"></a>01827
<a name="l01828"></a>01828 <span class="keywordflow">for</span> (j=0;j<= hdim;j++)
<a name="l01829"></a>01829 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(context[j]);
<a name="l01830"></a>01830 free(context);
<a name="l01831"></a>01831 <span class="keywordflow">return</span>(res);
<a name="l01832"></a>01832 } <span class="comment">/* Enumerate_NoParameters */</span>
<a name="l01833"></a>01833 <span class="comment"></span>
<a name="l01834"></a>01834 <span class="comment">/** Procedure to count points in a parameterized polytope.</span>
<a name="l01835"></a>01835 <span class="comment"></span>
<a name="l01836"></a>01836 <span class="comment">@param Pi Polyhedron to enumerate</span>
<a name="l01837"></a>01837 <span class="comment">@param C Context Domain</span>
<a name="l01838"></a>01838 <span class="comment">@param MAXRAYS size of workspace</span>
<a name="l01839"></a>01839 <span class="comment">@param param_name parameter names (array of strings), may be NULL</span>
<a name="l01840"></a>01840 <span class="comment">@return a list of validity domains + evalues EP</span>
<a name="l01841"></a>01841 <span class="comment"></span>
<a name="l01842"></a>01842 <span class="comment">*/</span>
<a name="l01843"></a><a class="code" href="ehrhart_8h.html#4ec60633863169ad9342edbe0884b364">01843</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ehrhart_8c.html#3c3e442b1d2c924f03f02f9e9283141a" title="Procedure to count points in a parameterized polytope.">Polyhedron_Enumerate</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#27503fb09c401518184a9f59d55bbf61">Pi</a>,<a class="code" href="structpolyhedron.html">Polyhedron</a> *C,
<a name="l01844"></a>01844 <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_name)
<a name="l01845"></a>01845 {
<a name="l01846"></a>01846 <a class="code" href="structpolyhedron.html">Polyhedron</a> *L, *CQ, *CQ2, *LQ, *U, *CEq, *rVD, *P, *Ph = NULL;
<a name="l01847"></a>01847 <a class="code" href="structmatrix.html">Matrix</a> *CT;
<a name="l01848"></a>01848 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *PP;
<a name="l01849"></a>01849 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *Q;
<a name="l01850"></a>01850 <span class="keywordtype">int</span> i,hdim, dim, nb_param, np;
<a name="l01851"></a>01851 Value *lcm, *m1, hdv;
<a name="l01852"></a>01852 Value *context;
<a name="l01853"></a>01853 <a class="code" href="struct__enumeration.html">Enumeration</a> *en, *res;
<a name="l01854"></a>01854
<a name="l01855"></a>01855 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#223261a4719dd67ef2048c192bb34099">POL_ISSET</a>(MAXRAYS, <a class="code" href="types_8h.html#754586a0aee88f21ad4c98b1cddee1be">POL_NO_DUAL</a>))
<a name="l01856"></a>01856 MAXRAYS = 0;
<a name="l01857"></a>01857
<a name="l01858"></a>01858 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(Pi);
<a name="l01859"></a>01859 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(Pi);
<a name="l01860"></a>01860 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(C);
<a name="l01861"></a>01861 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(C);
<a name="l01862"></a>01862
<a name="l01863"></a>01863 res = NULL;
<a name="l01864"></a>01864 P = Pi;
<a name="l01865"></a>01865
<a name="l01866"></a>01866 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l01867"></a>01867 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"C = \n"</span>);
<a name="l01868"></a>01868 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,C);
<a name="l01869"></a>01869 fprintf(stderr,<span class="stringliteral">"P = \n"</span>);
<a name="l01870"></a>01870 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,P);
<a name="l01871"></a>01871 <span class="preprocessor">#endif</span>
<a name="l01872"></a>01872 <span class="preprocessor"></span>
<a name="l01873"></a>01873 hdim = P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> + 1;
<a name="l01874"></a>01874 dim = P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l01875"></a>01875 nb_param = C-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l01876"></a>01876
<a name="l01877"></a>01877 <span class="comment">/* Don't call Polyhedron2Param_Domain if there are no parameters */</span>
<a name="l01878"></a>01878 <span class="keywordflow">if</span>(nb_param == 0) {
<a name="l01879"></a>01879
<a name="l01880"></a>01880 <span class="keywordflow">return</span>(<a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136" title="Procedure to count points in a non-parameterized polytope.">Enumerate_NoParameters</a>(P,C,NULL,NULL,MAXRAYS,param_name));
<a name="l01881"></a>01881 }
<a name="l01882"></a>01882 <span class="keywordflow">if</span>(nb_param == dim) {
<a name="l01883"></a>01883 res = (<a class="code" href="struct__enumeration.html">Enumeration</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enumeration.html">Enumeration</a>));
<a name="l01884"></a>01884 res-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = 0;
<a name="l01885"></a>01885 res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = <a class="code" href="polyhedron_8c.html#c5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(P,C,MAXRAYS);
<a name="l01886"></a>01886 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l01887"></a>01887 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n);
<a name="l01888"></a>01888 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,1);
<a name="l01889"></a>01889 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n,1);
<a name="l01890"></a>01890 <span class="keywordflow">if</span>( param_name ) {
<a name="l01891"></a>01891 fprintf(stdout,<span class="stringliteral">"---------------------------------------\n"</span>);
<a name="l01892"></a>01892 fprintf(stdout,<span class="stringliteral">"Domain:\n"</span>);
<a name="l01893"></a>01893 <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, param_name);
<a name="l01894"></a>01894 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial:\n"</span>);
<a name="l01895"></a>01895 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,param_name);
<a name="l01896"></a>01896 fprintf(stdout, <span class="stringliteral">"\n"</span>);
<a name="l01897"></a>01897 }
<a name="l01898"></a>01898 <span class="keywordflow">return</span> res;
<a name="l01899"></a>01899 }
<a name="l01900"></a>01900 PP = <a class="code" href="polyparam_8c.html#cc7b93726280a24b37b268e90a2e25ca">Polyhedron2Param_SimplifiedDomain</a>(&P,C,MAXRAYS,&CEq,&CT);
<a name="l01901"></a>01901 <span class="keywordflow">if</span>(!PP) {
<a name="l01902"></a>01902 <span class="keywordflow">if</span>( param_name )
<a name="l01903"></a>01903 fprintf(stdout, <span class="stringliteral">"\nEhrhart Polynomial:\nNULL\n"</span>);
<a name="l01904"></a>01904
<a name="l01905"></a>01905 <span class="keywordflow">return</span>(NULL);
<a name="l01906"></a>01906 }
<a name="l01907"></a>01907
<a name="l01908"></a>01908 <span class="comment">/* CT : transformation matrix to eliminate useless ("false") parameters */</span>
<a name="l01909"></a>01909 <span class="keywordflow">if</span>(CT) {
<a name="l01910"></a>01910 nb_param -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l01911"></a>01911 dim -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l01912"></a>01912 hdim -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l01913"></a>01913
<a name="l01914"></a>01914 <span class="comment">/* Don't call Polyhedron2Param_Domain if there are no parameters */</span>
<a name="l01915"></a>01915 <span class="keywordflow">if</span>(nb_param == 0) {
<a name="l01916"></a>01916 res = <a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136" title="Procedure to count points in a non-parameterized polytope.">Enumerate_NoParameters</a>(P,C,CT,CEq,MAXRAYS,param_name);
<a name="l01917"></a>01917 <a class="code" href="polyparam_8c.html#499deb4842822ae8ae58ed1fdf079c88">Param_Polyhedron_Free</a>(PP);
<a name="l01918"></a>01918 <span class="keywordflow">goto</span> out;
<a name="l01919"></a>01919 }
<a name="l01920"></a>01920 }
<a name="l01921"></a>01921
<a name="l01922"></a>01922 <span class="comment">/* get memory for Values */</span>
<a name="l01923"></a>01923 lcm = (Value *)malloc((nb_param+1) * <span class="keyword">sizeof</span>(Value));
<a name="l01924"></a>01924 m1 = (Value *)malloc((nb_param+1) * <span class="keyword">sizeof</span>(Value));
<a name="l01925"></a>01925 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l01926"></a>01926 <span class="keywordflow">for</span>( np=0 ; np < nb_param+1; np++ )
<a name="l01927"></a>01927 {
<a name="l01928"></a>01928 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(lcm[np]); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1[np]);
<a name="l01929"></a>01929 }
<a name="l01930"></a>01930 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(hdv);
<a name="l01931"></a>01931
<a name="l01932"></a>01932 <span class="keywordflow">for</span>(Q=PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a>;Q;Q=Q-><a class="code" href="struct__Param__Domain.html#5e0de697b290be8c04aeb01af780c557">next</a>) {
<a name="l01933"></a>01933 <span class="keywordtype">int</span> hom = 0;
<a name="l01934"></a>01934 <span class="keywordflow">if</span>(CT) {
<a name="l01935"></a>01935 <a class="code" href="structpolyhedron.html">Polyhedron</a> *Dt;
<a name="l01936"></a>01936 CQ = Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>;
<a name="l01937"></a>01937 Dt = <a class="code" href="polyhedron_8c.html#53d52d5d1befc1d1446e0920556c3d24">Polyhedron_Preimage</a>(Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>,CT,MAXRAYS);
<a name="l01938"></a>01938 rVD = <a class="code" href="polyhedron_8c.html#c5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(Dt,CEq,MAXRAYS);
<a name="l01939"></a>01939
<a name="l01940"></a>01940 <span class="comment">/* if rVD is empty or too small in geometric dimension */</span>
<a name="l01941"></a>01941 <span class="keywordflow">if</span>(!rVD || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(rVD) ||
<a name="l01942"></a>01942 (rVD-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-rVD-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a> < Dt-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-Dt-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a>-CEq-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a>)) {
<a name="l01943"></a>01943 <span class="keywordflow">if</span>(rVD)
<a name="l01944"></a>01944 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(rVD);
<a name="l01945"></a>01945 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Dt);
<a name="l01946"></a>01946 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(CQ);
<a name="l01947"></a>01947 <span class="keywordflow">continue</span>; <span class="comment">/* empty validity domain */</span>
<a name="l01948"></a>01948 }
<a name="l01949"></a>01949 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Dt);
<a name="l01950"></a>01950 }
<a name="l01951"></a>01951 <span class="keywordflow">else</span>
<a name="l01952"></a>01952 rVD = CQ = Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>;
<a name="l01953"></a>01953 en = (<a class="code" href="struct__enumeration.html">Enumeration</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enumeration.html">Enumeration</a>));
<a name="l01954"></a>01954 en-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = res;
<a name="l01955"></a>01955 res = en;
<a name="l01956"></a>01956 res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = rVD;
<a name="l01957"></a>01957
<a name="l01958"></a>01958 <span class="keywordflow">if</span>( param_name ) {
<a name="l01959"></a>01959 fprintf(stdout,<span class="stringliteral">"---------------------------------------\n"</span>);
<a name="l01960"></a>01960 fprintf(stdout,<span class="stringliteral">"Domain:\n"</span>);
<a name="l01961"></a>01961
<a name="l01962"></a>01962 <span class="preprocessor">#ifdef EPRINT_ALL_VALIDITY_CONSTRAINTS</span>
<a name="l01963"></a>01963 <span class="preprocessor"></span> <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,param_name);
<a name="l01964"></a>01964 <span class="preprocessor">#else </span>
<a name="l01965"></a>01965 <span class="preprocessor"></span> {
<a name="l01966"></a>01966 <a class="code" href="structpolyhedron.html">Polyhedron</a> *VD;
<a name="l01967"></a>01967 VD = <a class="code" href="polyhedron_8c.html#5fe8c61eb1dddc73783aad88c76ce758">DomainSimplify</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,C,MAXRAYS);
<a name="l01968"></a>01968 <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,VD,param_name);
<a name="l01969"></a>01969 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(VD);
<a name="l01970"></a>01970 }
<a name="l01971"></a>01971 <span class="preprocessor">#endif </span><span class="comment">/* EPRINT_ALL_VALIDITY_CONSTRAINTS */</span>
<a name="l01972"></a>01972 }
<a name="l01973"></a>01973
<a name="l01974"></a>01974 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 1;
<a name="l01975"></a>01975
<a name="l01976"></a>01976 <span class="comment">/* Scan the vertices and compute lcm */</span>
<a name="l01977"></a>01977 <a class="code" href="ehrhart_8c.html#ecc29a697804903fb5526f4ebdd1993a">Scan_Vertices</a>(PP,Q,CT,lcm,nb_param,param_name);
<a name="l01978"></a>01978
<a name="l01979"></a>01979 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l01980"></a>01980 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Denominator = "</span>);
<a name="l01981"></a>01981 <span class="keywordflow">for</span>( np=0;np<nb_param;np++)
<a name="l01982"></a>01982 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,lcm[np]);
<a name="l01983"></a>01983 fprintf(stderr,<span class="stringliteral">" and hdim == %d \n"</span>,hdim);
<a name="l01984"></a>01984 <span class="preprocessor">#endif</span>
<a name="l01985"></a>01985 <span class="preprocessor"></span>
<a name="l01986"></a>01986 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l01987"></a>01987 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"CQ = \n"</span>);
<a name="l01988"></a>01988 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ);
<a name="l01989"></a>01989 <span class="preprocessor">#endif</span>
<a name="l01990"></a>01990 <span class="preprocessor"></span>
<a name="l01991"></a>01991 <span class="comment">/* Before scanning, add constraints to ensure at least hdim*lcm */</span>
<a name="l01992"></a>01992 <span class="comment">/* points in every dimension */</span>
<a name="l01993"></a>01993 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(hdv,hdim-nb_param);
<a name="l01994"></a>01994
<a name="l01995"></a>01995 <span class="keywordflow">for</span>( np=0;np<nb_param+1;np++) {
<a name="l01996"></a>01996 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(lcm[np]) )
<a name="l01997"></a>01997 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m1[np],hdv,lcm[np]);
<a name="l01998"></a>01998 <span class="keywordflow">else</span>
<a name="l01999"></a>01999 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(m1[np],1);
<a name="l02000"></a>02000 }
<a name="l02001"></a>02001
<a name="l02002"></a>02002 <span class="preprocessor">#ifdef EDEBUG2 </span>
<a name="l02003"></a>02003 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"m1 == "</span>);
<a name="l02004"></a>02004 <span class="keywordflow">for</span>( np=0;np<nb_param;np++)
<a name="l02005"></a>02005 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,m1[np]);
<a name="l02006"></a>02006 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l02007"></a>02007 <span class="preprocessor">#endif </span>
<a name="l02008"></a>02008 <span class="preprocessor"></span>
<a name="l02009"></a>02009 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#221261b286628ee622df9588446d503e">CATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>) {
<a name="l02010"></a>02010 fprintf(stderr,<span class="stringliteral">"Enumerate: arithmetic overflow error.\n"</span>);
<a name="l02011"></a>02011 CQ2 = NULL;
<a name="l02012"></a>02012 }
<a name="l02013"></a>02013 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#d2746371528bdf15c3910b7bf217dac0">TRY</a> {
<a name="l02014"></a>02014 CQ2 = <a class="code" href="ehrhart_8c.html#20d8f9c53578cb2025e9107b71165193" title="This procedure finds the smallest parallelepiped of size &#39;size[i]&#39; for every...">Polyhedron_Preprocess</a>(CQ,m1,MAXRAYS);
<a name="l02015"></a>02015
<a name="l02016"></a>02016 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02017"></a>02017 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"After preprocess, CQ2 = "</span>);
<a name="l02018"></a>02018 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ2);
<a name="l02019"></a>02019 <span class="preprocessor">#endif</span>
<a name="l02020"></a>02020 <span class="preprocessor"></span>
<a name="l02021"></a>02021 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#8211465bb59b0e6b8c374b440965dbb4">UNCATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>);
<a name="l02022"></a>02022 }
<a name="l02023"></a>02023
<a name="l02024"></a>02024 <span class="comment">/* Vin100, Feb 2001 */</span>
<a name="l02025"></a>02025 <span class="comment">/* in case of degenerate, try to find a domain _containing_ CQ */</span>
<a name="l02026"></a>02026 <span class="keywordflow">if</span> ((!CQ2 || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(CQ2)) && CQ-><a class="code" href="structpolyhedron.html#9e7c80deeddf472a57bd54217f75c717">NbBid</a>==0) {
<a name="l02027"></a>02027 <span class="keywordtype">int</span> r;
<a name="l02028"></a>02028
<a name="l02029"></a>02029 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02030"></a>02030 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Trying to call Polyhedron_Preprocess2 : CQ = \n"</span>);
<a name="l02031"></a>02031 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ);
<a name="l02032"></a>02032 <span class="preprocessor">#endif</span>
<a name="l02033"></a>02033 <span class="preprocessor"></span>
<a name="l02034"></a>02034 <span class="comment">/* Check if CQ is bounded */</span>
<a name="l02035"></a>02035 <span class="keywordflow">for</span>(r=0;r<CQ-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;r++) {
<a name="l02036"></a>02036 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(CQ-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][0]) ||
<a name="l02037"></a>02037 <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(CQ-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][CQ-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]))
<a name="l02038"></a>02038 <span class="keywordflow">break</span>;
<a name="l02039"></a>02039 }
<a name="l02040"></a>02040 <span class="keywordflow">if</span>(r==CQ-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>) {
<a name="l02041"></a>02041
<a name="l02042"></a>02042 <span class="comment">/* ok, CQ is bounded */</span>
<a name="l02043"></a>02043 <span class="comment">/* now find if CQ is contained in a hypercube of size m1 */</span>
<a name="l02044"></a>02044 CQ2 = <a class="code" href="ehrhart_8c.html#15a4cf0edb430fbf0916dee6e448b6a1" title="This procedure finds an hypercube of size &#39;size&#39;, containing polyhedron D...">Polyhedron_Preprocess2</a>(CQ,m1,lcm,MAXRAYS);
<a name="l02045"></a>02045 }
<a name="l02046"></a>02046 }
<a name="l02047"></a>02047
<a name="l02048"></a>02048 <span class="keywordflow">if</span> (!CQ2) {
<a name="l02049"></a>02049 <a class="code" href="structpolyhedron.html">Polyhedron</a> *tmp;
<a name="l02050"></a>02050 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02051"></a>02051 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Homogenize.\n"</span>);
<a name="l02052"></a>02052 <span class="preprocessor">#endif</span>
<a name="l02053"></a>02053 <span class="preprocessor"></span> hom = 1;
<a name="l02054"></a>02054 tmp = <a class="code" href="homogenization_8c.html#fc536ef283eb21ce3e2cbcd450d72969">homogenize</a>(CQ, MAXRAYS);
<a name="l02055"></a>02055 CQ2 = <a class="code" href="ehrhart_8c.html#20d8f9c53578cb2025e9107b71165193" title="This procedure finds the smallest parallelepiped of size &#39;size[i]&#39; for every...">Polyhedron_Preprocess</a>(tmp,m1,MAXRAYS);
<a name="l02056"></a>02056 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(tmp);
<a name="l02057"></a>02057 <span class="keywordflow">if</span> (!Ph)
<a name="l02058"></a>02058 Ph = <a class="code" href="homogenization_8c.html#fc536ef283eb21ce3e2cbcd450d72969">homogenize</a>(P, MAXRAYS);
<a name="l02059"></a>02059 <span class="keywordflow">for</span> (np=0; np < nb_param+1; np++)
<a name="l02060"></a>02060 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(lcm[np]))
<a name="l02061"></a>02061 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(m1[np],m1[np],lcm[np]);
<a name="l02062"></a>02062 }
<a name="l02063"></a>02063
<a name="l02064"></a>02064 <span class="keywordflow">if</span> (!CQ2 || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(CQ2)) {
<a name="l02065"></a>02065 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02066"></a>02066 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Degenerate.\n"</span>);
<a name="l02067"></a>02067 <span class="preprocessor">#endif</span>
<a name="l02068"></a>02068 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"Degenerate Domain. Can not continue.\n"</span>);
<a name="l02069"></a>02069 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l02070"></a>02070 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n);
<a name="l02071"></a>02071 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,1);
<a name="l02072"></a>02072 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n,-1);
<a name="l02073"></a>02073 }
<a name="l02074"></a>02074 <span class="keywordflow">else</span> {
<a name="l02075"></a>02075
<a name="l02076"></a>02076 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02077"></a>02077 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"CQ2 = \n"</span>);
<a name="l02078"></a>02078 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ2);
<a name="l02079"></a>02079 <span class="keywordflow">if</span>( ! <a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(CQ, CQ2) )
<a name="l02080"></a>02080 fprintf( stderr,<span class="stringliteral">"CQ does not include CQ2 !\n"</span>);
<a name="l02081"></a>02081 <span class="keywordflow">else</span>
<a name="l02082"></a>02082 fprintf( stderr,<span class="stringliteral">"CQ includes CQ2.\n"</span>);
<a name="l02083"></a>02083 <span class="keywordflow">if</span>( ! <a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, CQ2) )
<a name="l02084"></a>02084 fprintf( stderr,<span class="stringliteral">"CQ2 is *not* included in validity domain !\n"</span>);
<a name="l02085"></a>02085 <span class="keywordflow">else</span>
<a name="l02086"></a>02086 fprintf( stderr,<span class="stringliteral">"CQ2 is included in validity domain.\n"</span>);
<a name="l02087"></a>02087 <span class="preprocessor">#endif</span>
<a name="l02088"></a>02088 <span class="preprocessor"></span>
<a name="l02089"></a>02089 <span class="comment">/* L is used in counting the number of points in the base cases */</span>
<a name="l02090"></a>02090 L = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(hom ? Ph : P,CQ2,MAXRAYS);
<a name="l02091"></a>02091 U = <a class="code" href="polyhedron_8c.html#832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(0);
<a name="l02092"></a>02092
<a name="l02093"></a>02093 <span class="comment">/* LQ is used to scan the parameter space */</span>
<a name="l02094"></a>02094 LQ = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(CQ2,U,MAXRAYS); <span class="comment">/* bounds on parameters */</span>
<a name="l02095"></a>02095 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(U);
<a name="l02096"></a>02096 <span class="keywordflow">if</span>(CT) <span class="comment">/* we did compute another Q->Domain */</span>
<a name="l02097"></a>02097 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(CQ);
<a name="l02098"></a>02098
<a name="l02099"></a>02099 <span class="comment">/* Else, CQ was Q->Domain (used in res) */</span>
<a name="l02100"></a>02100 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(CQ2);
<a name="l02101"></a>02101
<a name="l02102"></a>02102 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02103"></a>02103 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"L = \n"</span>);
<a name="l02104"></a>02104 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,L);
<a name="l02105"></a>02105 fprintf(stderr,<span class="stringliteral">"LQ = \n"</span>);
<a name="l02106"></a>02106 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,LQ);
<a name="l02107"></a>02107 <span class="preprocessor">#endif</span>
<a name="l02108"></a>02108 <span class="preprocessor"></span><span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l02109"></a>02109 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"\nSystem of Equations:\n"</span>);
<a name="l02110"></a>02110 <span class="preprocessor">#endif</span>
<a name="l02111"></a>02111 <span class="preprocessor"></span>
<a name="l02112"></a>02112 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l02113"></a>02113 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l02114"></a>02114
<a name="l02115"></a>02115 <span class="comment">/* Create a context vector size dim+2 */</span>
<a name="l02116"></a>02116 context = (Value *) malloc ((hdim+1+hom)*<span class="keyword">sizeof</span>(Value));
<a name="l02117"></a>02117 <span class="keywordflow">for</span>(i=0;i<=(hdim+hom);i++)
<a name="l02118"></a>02118 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(context[i]);
<a name="l02119"></a>02119 <a class="code" href="vector_8c.html#27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(context,0,(hdim+1+hom));
<a name="l02120"></a>02120
<a name="l02121"></a>02121 <span class="comment">/* Set context[hdim] = 1 (the constant) */</span>
<a name="l02122"></a>02122 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[hdim+hom],1);
<a name="l02123"></a>02123
<a name="l02124"></a>02124 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#221261b286628ee622df9588446d503e">CATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>) {
<a name="l02125"></a>02125 fprintf(stderr,<span class="stringliteral">"Enumerate: arithmetic overflow error.\n"</span>);
<a name="l02126"></a>02126 fprintf(stderr,<span class="stringliteral">"You should rebuild PolyLib using GNU-MP "</span>
<a name="l02127"></a>02127 <span class="stringliteral">"or increasing the size of integers.\n"</span>);
<a name="l02128"></a>02128 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 0;
<a name="l02129"></a>02129 <a class="code" href="assert_8h.html#07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(<a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a>);
<a name="l02130"></a>02130
<a name="l02131"></a>02131 }
<a name="l02132"></a>02132 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#d2746371528bdf15c3910b7bf217dac0">TRY</a> {
<a name="l02133"></a>02133 res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p = <a class="code" href="ehrhart_8c.html#6f3773f94c2c24a11ae2eb07fd8673c8">P_Enum</a>(L,LQ,context,1,nb_param+hom,
<a name="l02134"></a>02134 dim+hom,lcm,param_name);
<a name="l02135"></a>02135 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#8211465bb59b0e6b8c374b440965dbb4">UNCATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>);
<a name="l02136"></a>02136 }
<a name="l02137"></a>02137 <span class="keywordflow">if</span> (hom)
<a name="l02138"></a>02138 <a class="code" href="homogenization_8c.html#ad8cd6181d26eb3f13171462ee30b932" title="dehomogenize an evalue.">dehomogenize_evalue</a>(&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>, nb_param+1);
<a name="l02139"></a>02139
<a name="l02140"></a>02140 <span class="keywordflow">for</span>(i=0;i<=(hdim+hom);i++)
<a name="l02141"></a>02141 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(context[i]);
<a name="l02142"></a>02142 free(context);
<a name="l02143"></a>02143 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(L);
<a name="l02144"></a>02144 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(LQ);
<a name="l02145"></a>02145
<a name="l02146"></a>02146 <span class="preprocessor">#ifdef EDEBUG5</span>
<a name="l02147"></a>02147 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l02148"></a>02148 {
<a name="l02149"></a>02149 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial (before simplification):\n"</span>);
<a name="l02150"></a>02150 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,param_name);
<a name="l02151"></a>02151 }
<a name="l02152"></a>02152 <span class="preprocessor">#endif</span>
<a name="l02153"></a>02153 <span class="preprocessor"></span>
<a name="l02154"></a>02154 <span class="comment">/* Try to simplify the result */</span>
<a name="l02155"></a>02155 <a class="code" href="ehrhart_8c.html#e02ef07ca7d9de519ffe46a89e941bb8">reduce_evalue</a>(&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l02156"></a>02156
<a name="l02157"></a>02157 <span class="comment">/* Put back the original parameters into result */</span>
<a name="l02158"></a>02158 <span class="comment">/* (equalities have been eliminated) */</span>
<a name="l02159"></a>02159 <span class="keywordflow">if</span>(CT)
<a name="l02160"></a>02160 <a class="code" href="ehrhart_8c.html#a620fc3759fc7fe715bc6d5e891631e7" title="Comments.">addeliminatedparams_evalue</a>(&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,CT);
<a name="l02161"></a>02161
<a name="l02162"></a>02162 <span class="keywordflow">if</span> (param_name) {
<a name="l02163"></a>02163 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial:\n"</span>);
<a name="l02164"></a>02164 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>, param_name);
<a name="l02165"></a>02165 fprintf(stdout,<span class="stringliteral">"\n"</span>);
<a name="l02166"></a>02166 <span class="comment">/* sometimes the final \n lacks (when a single constant is printed) */</span>
<a name="l02167"></a>02167 }
<a name="l02168"></a>02168
<a name="l02169"></a>02169 }
<a name="l02170"></a>02170 }
<a name="l02171"></a>02171
<a name="l02172"></a>02172 <span class="keywordflow">if</span> (Ph)
<a name="l02173"></a>02173 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Ph);
<a name="l02174"></a>02174 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l02175"></a>02175 <span class="keywordflow">for</span> (np=0; np < nb_param+1; np++)
<a name="l02176"></a>02176 {
<a name="l02177"></a>02177 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(lcm[np]); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1[np]);
<a name="l02178"></a>02178 }
<a name="l02179"></a>02179 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(hdv);
<a name="l02180"></a>02180 free(lcm);
<a name="l02181"></a>02181 free(m1);
<a name="l02182"></a>02182 <span class="comment">/* We can't simply call Param_Polyhedron_Free because we've reused the domains */</span>
<a name="l02183"></a>02183 <a class="code" href="polyparam_8c.html#130a2772c56c28b74a5c0ab42717c267">Param_Vertices_Free</a>(PP-><a class="code" href="struct__Param__Polyhedron.html#183b47f3f8b8c27079a840c934e7b972">V</a>);
<a name="l02184"></a>02184 <span class="keywordflow">while</span> (PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a>) {
<a name="l02185"></a>02185 Q = PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a>;
<a name="l02186"></a>02186 PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a> = PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a>-><a class="code" href="struct__Param__Domain.html#5e0de697b290be8c04aeb01af780c557">next</a>;
<a name="l02187"></a>02187 free(Q-><a class="code" href="struct__Param__Domain.html#c87a60cf654cb9b80ddcac469d6ee81a">F</a>);
<a name="l02188"></a>02188 free(Q);
<a name="l02189"></a>02189 }
<a name="l02190"></a>02190 free(PP);
<a name="l02191"></a>02191
<a name="l02192"></a>02192 out:
<a name="l02193"></a>02193 <span class="keywordflow">if</span> (CEq)
<a name="l02194"></a>02194 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(CEq);
<a name="l02195"></a>02195 <span class="keywordflow">if</span> (CT)
<a name="l02196"></a>02196 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(CT);
<a name="l02197"></a>02197 <span class="keywordflow">if</span>( P != Pi )
<a name="l02198"></a>02198 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>( P );
<a name="l02199"></a>02199
<a name="l02200"></a>02200 <span class="keywordflow">return</span> res;
<a name="l02201"></a>02201 } <span class="comment">/* Polyhedron_Enumerate */</span>
<a name="l02202"></a>02202
<a name="l02203"></a><a class="code" href="ehrhart_8h.html#eaadcf4c2404d688eb1443486ad8becb">02203</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#eaadcf4c2404d688eb1443486ad8becb">Enumeration_Free</a>(<a class="code" href="struct__enumeration.html">Enumeration</a> *en)
<a name="l02204"></a>02204 {
<a name="l02205"></a>02205 <a class="code" href="struct__enumeration.html">Enumeration</a> *ee;
<a name="l02206"></a>02206
<a name="l02207"></a>02207 <span class="keywordflow">while</span>( en )
<a name="l02208"></a>02208 {
<a name="l02209"></a>02209 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>( &(en-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>) );
<a name="l02210"></a>02210 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>( en-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> );
<a name="l02211"></a>02211 ee = en -><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l02212"></a>02212 free( en );
<a name="l02213"></a>02213 en = ee;
<a name="l02214"></a>02214 }
<a name="l02215"></a>02215 }
<a name="l02216"></a>02216
<a name="l02217"></a>02217 <span class="comment">/* adds by B. Meister for Ehrhart Polynomial approximation */</span>
<a name="l02218"></a>02218 <span class="comment"></span>
<a name="l02219"></a>02219 <span class="comment">/**</span>
<a name="l02220"></a>02220 <span class="comment"> * Divides the evalue e by the integer n<br/></span>
<a name="l02221"></a>02221 <span class="comment"> * recursive function<br/></span>
<a name="l02222"></a>02222 <span class="comment"> * Warning : modifies e</span>
<a name="l02223"></a>02223 <span class="comment"> * @param e an evalue (to be divided by n)</span>
<a name="l02224"></a>02224 <span class="comment"> * @param n</span>
<a name="l02225"></a>02225 <span class="comment"> */</span>
<a name="l02226"></a>02226
<a name="l02227"></a><a class="code" href="ehrhart_8c.html#1cec8d518c4034be8b44520f5d66f27b">02227</a> <span class="keywordtype">void</span> <a class="code" href="ehrhart_8c.html#1cec8d518c4034be8b44520f5d66f27b" title="Divides the evalue e by the integer n recursive function Warning : modifies e.">evalue_div</a>(<a class="code" href="struct__evalue.html">evalue</a> * e, Value <a class="code" href="polyparam_8c.html#76f11d9a0a47b94f72c2d0e77fb32240">n</a>) {
<a name="l02228"></a>02228 <span class="keywordtype">int</span> i;
<a name="l02229"></a>02229 Value gc;
<a name="l02230"></a>02230 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(gc);
<a name="l02231"></a>02231 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l02232"></a>02232 <span class="keywordflow">for</span> (i=0; i< e->x.p->size; i++) {
<a name="l02233"></a>02233 <a class="code" href="ehrhart_8c.html#1cec8d518c4034be8b44520f5d66f27b" title="Divides the evalue e by the integer n recursive function Warning : modifies e.">evalue_div</a>(&(e->x.p->arr[i]), n);
<a name="l02234"></a>02234 }
<a name="l02235"></a>02235 }
<a name="l02236"></a>02236 <span class="keywordflow">else</span> {
<a name="l02237"></a>02237 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, n);
<a name="l02238"></a>02238 <span class="comment">/* simplify the new rational if needed */</span>
<a name="l02239"></a>02239 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(gc, e->x.n, e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l02240"></a>02240 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(gc)) {
<a name="l02241"></a>02241 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, e-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, gc);
<a name="l02242"></a>02242 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(e->x.n, e->x.n, gc);
<a name="l02243"></a>02243 }
<a name="l02244"></a>02244 }
<a name="l02245"></a>02245 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(gc);
<a name="l02246"></a>02246 } <span class="comment">/* evalue_div */</span>
<a name="l02247"></a>02247
<a name="l02248"></a>02248 <span class="comment"></span>
<a name="l02249"></a>02249 <span class="comment">/** </span>
<a name="l02250"></a>02250 <span class="comment"></span>
<a name="l02251"></a>02251 <span class="comment">Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names)</span>
<a name="l02252"></a>02252 <span class="comment"></span>
<a name="l02253"></a>02253 <span class="comment">Procedure to estimate the number of points in a parameterized polytope.</span>
<a name="l02254"></a>02254 <span class="comment">Returns a list of validity domains + evalues EP</span>
<a name="l02255"></a>02255 <span class="comment">B.M.</span>
<a name="l02256"></a>02256 <span class="comment">The most rough and quick approximation by variables expansion </span>
<a name="l02257"></a>02257 <span class="comment">Deals with the full-dimensional case. </span>
<a name="l02258"></a>02258 <span class="comment">@param Pi : Polyhedron to enumerate (approximatively)</span>
<a name="l02259"></a>02259 <span class="comment">@param C : Context Domain</span>
<a name="l02260"></a>02260 <span class="comment">@param MAXRAYS : size of workspace</span>
<a name="l02261"></a>02261 <span class="comment">@param param_name : names for the parameters (char strings)</span>
<a name="l02262"></a>02262 <span class="comment"></span>
<a name="l02263"></a>02263 <span class="comment">*/</span>
<a name="l02264"></a><a class="code" href="ehrhart_8c.html#da57c2bc3420728ec985add1229b1259">02264</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ehrhart_8c.html#da57c2bc3420728ec985add1229b1259" title="Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names).">Ehrhart_Quick_Apx_Full_Dim</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="polyparam_8c.html#27503fb09c401518184a9f59d55bbf61">Pi</a>,<a class="code" href="structpolyhedron.html">Polyhedron</a> *C,
<a name="l02265"></a>02265 <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>, <span class="keyword">const</span> <span class="keywordtype">char</span> **param_name)
<a name="l02266"></a>02266 {
<a name="l02267"></a>02267 <a class="code" href="structpolyhedron.html">Polyhedron</a> *L, *CQ, *CQ2, *LQ, *U, *CEq, *rVD, *P;
<a name="l02268"></a>02268 <a class="code" href="structmatrix.html">Matrix</a> *CT;
<a name="l02269"></a>02269 <a class="code" href="struct__Param__Polyhedron.html">Param_Polyhedron</a> *PP;
<a name="l02270"></a>02270 <a class="code" href="struct__Param__Domain.html">Param_Domain</a> *Q;
<a name="l02271"></a>02271 <span class="keywordtype">int</span> i,j,hdim, dim, nb_param, np;
<a name="l02272"></a>02272 Value *lcm, *m1, hdv;
<a name="l02273"></a>02273 Value *context;
<a name="l02274"></a>02274 <a class="code" href="struct__enumeration.html">Enumeration</a> *en, *res;
<a name="l02275"></a>02275 Value expansion_det;
<a name="l02276"></a>02276 <a class="code" href="structpolyhedron.html">Polyhedron</a> * Expanded;
<a name="l02277"></a>02277
<a name="l02278"></a>02278 <span class="comment">/* used to scan the vertices */</span>
<a name="l02279"></a>02279 <a class="code" href="struct__Param__Vertex.html">Param_Vertices</a> * V_tmp;
<a name="l02280"></a>02280
<a name="l02281"></a>02281 res = NULL;
<a name="l02282"></a>02282 P = Pi;
<a name="l02283"></a>02283
<a name="l02284"></a>02284 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(expansion_det);
<a name="l02285"></a>02285
<a name="l02286"></a>02286 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02287"></a>02287 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"C = \n"</span>);
<a name="l02288"></a>02288 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,C);
<a name="l02289"></a>02289 fprintf(stderr,<span class="stringliteral">"P = \n"</span>);
<a name="l02290"></a>02290 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,P);
<a name="l02291"></a>02291 <span class="preprocessor">#endif</span>
<a name="l02292"></a>02292 <span class="preprocessor"></span>
<a name="l02293"></a>02293 hdim = P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a> + 1;
<a name="l02294"></a>02294 dim = P-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l02295"></a>02295 nb_param = C-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;
<a name="l02296"></a>02296
<a name="l02297"></a>02297 <span class="comment">/* Don't call Polyhedron2Param_Domain if there are no parameters */</span>
<a name="l02298"></a>02298 <span class="keywordflow">if</span>(nb_param == 0) {
<a name="l02299"></a>02299
<a name="l02300"></a>02300 <span class="keywordflow">return</span>(<a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136" title="Procedure to count points in a non-parameterized polytope.">Enumerate_NoParameters</a>(P,C,NULL,NULL,MAXRAYS, param_name));
<a name="l02301"></a>02301 }
<a name="l02302"></a>02302
<a name="l02303"></a>02303 <span class="preprocessor">#if EDEBUG2</span>
<a name="l02304"></a>02304 <span class="preprocessor"></span> printf(<span class="stringliteral">"Enumerating polyhedron : \n"</span>);
<a name="l02305"></a>02305 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stdout, <a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, P);
<a name="l02306"></a>02306 <span class="preprocessor">#endif</span>
<a name="l02307"></a>02307 <span class="preprocessor"></span>
<a name="l02308"></a>02308 PP = <a class="code" href="polyparam_8c.html#cc7b93726280a24b37b268e90a2e25ca">Polyhedron2Param_SimplifiedDomain</a>(&P,C,MAXRAYS,&CEq,&CT);
<a name="l02309"></a>02309 <span class="keywordflow">if</span>(!PP) {
<a name="l02310"></a>02310 <span class="keywordflow">if</span>( param_name )
<a name="l02311"></a>02311 fprintf(stdout, <span class="stringliteral">"\nEhrhart Polynomial:\nNULL\n"</span>);
<a name="l02312"></a>02312
<a name="l02313"></a>02313 <span class="keywordflow">return</span>(NULL);
<a name="l02314"></a>02314 }
<a name="l02315"></a>02315
<a name="l02316"></a>02316 <span class="comment">/* CT : transformation matrix to eliminate useless ("false") parameters */</span>
<a name="l02317"></a>02317 <span class="keywordflow">if</span>(CT) {
<a name="l02318"></a>02318 nb_param -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l02319"></a>02319 dim -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l02320"></a>02320 hdim -= CT-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-CT-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;
<a name="l02321"></a>02321
<a name="l02322"></a>02322 <span class="comment">/* Don't call Polyhedron2Param_Domain if there are no parameters */</span>
<a name="l02323"></a>02323 <span class="keywordflow">if</span>(nb_param == 0)
<a name="l02324"></a>02324 {
<a name="l02325"></a>02325 res = <a class="code" href="ehrhart_8c.html#5d9ae35e58b3ceb231ca2e26c1e6e136" title="Procedure to count points in a non-parameterized polytope.">Enumerate_NoParameters</a>(P,C,CT,CEq,MAXRAYS,param_name);
<a name="l02326"></a>02326 <span class="keywordflow">if</span>( P != Pi )
<a name="l02327"></a>02327 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>( P );
<a name="l02328"></a>02328 <span class="keywordflow">return</span>( res );
<a name="l02329"></a>02329 }
<a name="l02330"></a>02330 }
<a name="l02331"></a>02331
<a name="l02332"></a>02332 <span class="keywordflow">if</span> (!PP-><a class="code" href="struct__Param__Polyhedron.html#baa0a017c7bef81b5ed9f6d2fd3f6f58">nbV</a>)
<a name="l02333"></a>02333 <span class="comment">/* Leaks memory */</span>
<a name="l02334"></a>02334 <span class="keywordflow">return</span> NULL;
<a name="l02335"></a>02335
<a name="l02336"></a>02336 <span class="comment">/* get memory for Values */</span>
<a name="l02337"></a>02337 lcm = (Value *)malloc( nb_param * <span class="keyword">sizeof</span>(Value));
<a name="l02338"></a>02338 m1 = (Value *)malloc( nb_param * <span class="keyword">sizeof</span>(Value));
<a name="l02339"></a>02339 <span class="comment">/* Initialize all the 'Value' variables */</span>
<a name="l02340"></a>02340 <span class="keywordflow">for</span>( np=0 ; np<nb_param ; np++ )
<a name="l02341"></a>02341 {
<a name="l02342"></a>02342 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(lcm[np]); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1[np]);
<a name="l02343"></a>02343 }
<a name="l02344"></a>02344 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(hdv);
<a name="l02345"></a>02345
<a name="l02346"></a>02346 <span class="preprocessor">#if EDEBUG2 </span>
<a name="l02347"></a>02347 <span class="preprocessor"></span> <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr, <a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, P);
<a name="l02348"></a>02348 <span class="preprocessor">#endif</span>
<a name="l02349"></a>02349 <span class="preprocessor"></span>
<a name="l02350"></a>02350 Expanded = P;
<a name="l02351"></a>02351 <a class="code" href="polyparam_8c.html#5c62eaa235c8e77a994387f27b67ad3f">Param_Polyhedron_Scale_Integer</a>(PP, &Expanded, &expansion_det, MAXRAYS);
<a name="l02352"></a>02352
<a name="l02353"></a>02353 <span class="preprocessor">#if EDEBUG2</span>
<a name="l02354"></a>02354 <span class="preprocessor"></span> <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr, <a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, Expanded);
<a name="l02355"></a>02355 <span class="preprocessor">#endif</span>
<a name="l02356"></a>02356 <span class="preprocessor"></span>
<a name="l02357"></a>02357 <span class="keywordflow">if</span> (P != Expanded)
<a name="l02358"></a>02358 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(P);
<a name="l02359"></a>02359 P = Expanded;
<a name="l02360"></a>02360
<a name="l02361"></a>02361 <span class="comment">/* formerly : Scan the vertices and compute lcm </span>
<a name="l02362"></a>02362 <span class="comment"> Scan_Vertices_Quick_Apx(PP,Q,CT,lcm,nb_param); */</span>
<a name="l02363"></a>02363 <span class="comment">/* now : lcm = 1 (by construction) */</span>
<a name="l02364"></a>02364 <span class="comment">/* OPT : A lot among what happens after this point can be simplified by</span>
<a name="l02365"></a>02365 <span class="comment"> knowing that lcm[i] = 1 for now, we just conservatively fool the rest of</span>
<a name="l02366"></a>02366 <span class="comment"> the function with lcm = 1 */</span>
<a name="l02367"></a>02367 <span class="keywordflow">for</span> (i=0; i< nb_param; i++) <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(lcm[i], 1);
<a name="l02368"></a>02368
<a name="l02369"></a>02369 <span class="keywordflow">for</span>(Q=PP-><a class="code" href="struct__Param__Polyhedron.html#23eb52a684bb212c4cf1fbcbd9db066c">D</a>;Q;Q=Q-><a class="code" href="struct__Param__Domain.html#5e0de697b290be8c04aeb01af780c557">next</a>) {
<a name="l02370"></a>02370 <span class="keywordflow">if</span>(CT) {
<a name="l02371"></a>02371 <a class="code" href="structpolyhedron.html">Polyhedron</a> *Dt;
<a name="l02372"></a>02372 CQ = Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>;
<a name="l02373"></a>02373 Dt = <a class="code" href="polyhedron_8c.html#53d52d5d1befc1d1446e0920556c3d24">Polyhedron_Preimage</a>(Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>,CT,MAXRAYS);
<a name="l02374"></a>02374 rVD = <a class="code" href="polyhedron_8c.html#c5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(Dt,CEq,MAXRAYS);
<a name="l02375"></a>02375
<a name="l02376"></a>02376 <span class="comment">/* if rVD is empty or too small in geometric dimension */</span>
<a name="l02377"></a>02377 <span class="keywordflow">if</span>(!rVD || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(rVD) ||
<a name="l02378"></a>02378 (rVD-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-rVD-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a> < Dt-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-Dt-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a>-CEq-><a class="code" href="structpolyhedron.html#f316f6440017b2e02fa3a387b2818cc9">NbEq</a>)) {
<a name="l02379"></a>02379 <span class="keywordflow">if</span>(rVD)
<a name="l02380"></a>02380 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(rVD);
<a name="l02381"></a>02381 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Dt);
<a name="l02382"></a>02382 <span class="keywordflow">continue</span>; <span class="comment">/* empty validity domain */</span>
<a name="l02383"></a>02383 }
<a name="l02384"></a>02384 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(Dt);
<a name="l02385"></a>02385 }
<a name="l02386"></a>02386 <span class="keywordflow">else</span>
<a name="l02387"></a>02387 rVD = CQ = Q-><a class="code" href="struct__Param__Domain.html#ac7b708b50ebee4352fddebed2eaba7c">Domain</a>;
<a name="l02388"></a>02388 en = (<a class="code" href="struct__enumeration.html">Enumeration</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enumeration.html">Enumeration</a>));
<a name="l02389"></a>02389 en-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = res;
<a name="l02390"></a>02390 res = en;
<a name="l02391"></a>02391 res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = rVD;
<a name="l02392"></a>02392
<a name="l02393"></a>02393 <span class="keywordflow">if</span>( param_name )
<a name="l02394"></a>02394 {
<a name="l02395"></a>02395 fprintf(stdout,<span class="stringliteral">"---------------------------------------\n"</span>);
<a name="l02396"></a>02396 fprintf(stdout,<span class="stringliteral">"Domain:\n"</span>);
<a name="l02397"></a>02397
<a name="l02398"></a>02398 <span class="preprocessor">#ifdef EPRINT_ALL_VALIDITY_CONSTRAINTS</span>
<a name="l02399"></a>02399 <span class="preprocessor"></span> <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,param_name);
<a name="l02400"></a>02400 <span class="preprocessor">#else </span>
<a name="l02401"></a>02401 <span class="preprocessor"></span> {
<a name="l02402"></a>02402 <a class="code" href="structpolyhedron.html">Polyhedron</a> *VD;
<a name="l02403"></a>02403 VD = <a class="code" href="polyhedron_8c.html#5fe8c61eb1dddc73783aad88c76ce758">DomainSimplify</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,C,MAXRAYS);
<a name="l02404"></a>02404 <a class="code" href="polyparam_8c.html#fa315bc856959f9a781359f69b74d7a4">Print_Domain</a>(stdout,VD,param_name);
<a name="l02405"></a>02405 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(VD);
<a name="l02406"></a>02406 }
<a name="l02407"></a>02407 <span class="preprocessor">#endif </span><span class="comment">/* EPRINT_ALL_VALIDITY_CONSTRAINTS */</span>
<a name="l02408"></a>02408 }
<a name="l02409"></a>02409
<a name="l02410"></a>02410 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 1;
<a name="l02411"></a>02411
<a name="l02412"></a>02412 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02413"></a>02413 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Denominator = "</span>);
<a name="l02414"></a>02414 <span class="keywordflow">for</span>( np=0;np<nb_param;np++)
<a name="l02415"></a>02415 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,lcm[np]);
<a name="l02416"></a>02416 fprintf(stderr,<span class="stringliteral">" and hdim == %d \n"</span>,hdim);
<a name="l02417"></a>02417 <span class="preprocessor">#endif</span>
<a name="l02418"></a>02418 <span class="preprocessor"></span>
<a name="l02419"></a>02419 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02420"></a>02420 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"CQ = \n"</span>);
<a name="l02421"></a>02421 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ);
<a name="l02422"></a>02422 <span class="preprocessor">#endif</span>
<a name="l02423"></a>02423 <span class="preprocessor"></span>
<a name="l02424"></a>02424 <span class="comment">/* Before scanning, add constraints to ensure at least hdim*lcm */</span>
<a name="l02425"></a>02425 <span class="comment">/* points in every dimension */</span>
<a name="l02426"></a>02426 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(hdv,hdim-nb_param);
<a name="l02427"></a>02427
<a name="l02428"></a>02428 <span class="keywordflow">for</span>( np=0;np<nb_param;np++)
<a name="l02429"></a>02429 {
<a name="l02430"></a>02430 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(lcm[np]) )
<a name="l02431"></a>02431 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m1[np],hdv,lcm[np]);
<a name="l02432"></a>02432 <span class="keywordflow">else</span>
<a name="l02433"></a>02433 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(m1[np],1);
<a name="l02434"></a>02434 }
<a name="l02435"></a>02435
<a name="l02436"></a>02436 <span class="preprocessor">#ifdef EDEBUG2 </span>
<a name="l02437"></a>02437 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"m1 == "</span>);
<a name="l02438"></a>02438 <span class="keywordflow">for</span>( np=0;np<nb_param;np++)
<a name="l02439"></a>02439 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,m1[np]);
<a name="l02440"></a>02440 fprintf(stderr,<span class="stringliteral">"\n"</span>);
<a name="l02441"></a>02441 <span class="preprocessor">#endif </span>
<a name="l02442"></a>02442 <span class="preprocessor"></span>
<a name="l02443"></a>02443 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#221261b286628ee622df9588446d503e">CATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>) {
<a name="l02444"></a>02444 fprintf(stderr,<span class="stringliteral">"Enumerate: arithmetic overflow error.\n"</span>);
<a name="l02445"></a>02445 CQ2 = NULL;
<a name="l02446"></a>02446 }
<a name="l02447"></a>02447 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#d2746371528bdf15c3910b7bf217dac0">TRY</a> {
<a name="l02448"></a>02448 CQ2 = <a class="code" href="ehrhart_8c.html#20d8f9c53578cb2025e9107b71165193" title="This procedure finds the smallest parallelepiped of size &#39;size[i]&#39; for every...">Polyhedron_Preprocess</a>(CQ,m1,MAXRAYS);
<a name="l02449"></a>02449
<a name="l02450"></a>02450 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02451"></a>02451 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"After preprocess, CQ2 = "</span>);
<a name="l02452"></a>02452 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ2);
<a name="l02453"></a>02453 <span class="preprocessor">#endif</span>
<a name="l02454"></a>02454 <span class="preprocessor"></span>
<a name="l02455"></a>02455 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#8211465bb59b0e6b8c374b440965dbb4">UNCATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>);
<a name="l02456"></a>02456 }
<a name="l02457"></a>02457
<a name="l02458"></a>02458 <span class="comment">/* Vin100, Feb 2001 */</span>
<a name="l02459"></a>02459 <span class="comment">/* in case of degenerate, try to find a domain _containing_ CQ */</span>
<a name="l02460"></a>02460 <span class="keywordflow">if</span> ((!CQ2 || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(CQ2)) && CQ-><a class="code" href="structpolyhedron.html#9e7c80deeddf472a57bd54217f75c717">NbBid</a>==0) {
<a name="l02461"></a>02461 <span class="keywordtype">int</span> r;
<a name="l02462"></a>02462
<a name="l02463"></a>02463 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02464"></a>02464 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Trying to call Polyhedron_Preprocess2 : CQ = \n"</span>);
<a name="l02465"></a>02465 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ);
<a name="l02466"></a>02466 <span class="preprocessor">#endif</span>
<a name="l02467"></a>02467 <span class="preprocessor"></span>
<a name="l02468"></a>02468 <span class="comment">/* Check if CQ is bounded */</span>
<a name="l02469"></a>02469 <span class="keywordflow">for</span>(r=0;r<CQ-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>;r++) {
<a name="l02470"></a>02470 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(CQ-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][0]) ||
<a name="l02471"></a>02471 <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(CQ-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[r][CQ-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]))
<a name="l02472"></a>02472 <span class="keywordflow">break</span>;
<a name="l02473"></a>02473 }
<a name="l02474"></a>02474 <span class="keywordflow">if</span>(r==CQ-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>) {
<a name="l02475"></a>02475
<a name="l02476"></a>02476 <span class="comment">/* ok, CQ is bounded */</span>
<a name="l02477"></a>02477 <span class="comment">/* now find if CQ is contained in a hypercube of size m1 */</span>
<a name="l02478"></a>02478 CQ2 = <a class="code" href="ehrhart_8c.html#15a4cf0edb430fbf0916dee6e448b6a1" title="This procedure finds an hypercube of size &#39;size&#39;, containing polyhedron D...">Polyhedron_Preprocess2</a>(CQ,m1,lcm,MAXRAYS);
<a name="l02479"></a>02479 }
<a name="l02480"></a>02480 }
<a name="l02481"></a>02481 <span class="keywordflow">if</span> (!CQ2 || <a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(CQ2)) {
<a name="l02482"></a>02482 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02483"></a>02483 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"Degenerate.\n"</span>);
<a name="l02484"></a>02484 <span class="preprocessor">#endif</span>
<a name="l02485"></a>02485 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"Degenerate Domain. Can not continue.\n"</span>);
<a name="l02486"></a>02486 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l02487"></a>02487 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n);
<a name="l02488"></a>02488 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,1);
<a name="l02489"></a>02489 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n,-1);
<a name="l02490"></a>02490 }
<a name="l02491"></a>02491 <span class="keywordflow">else</span> {
<a name="l02492"></a>02492
<a name="l02493"></a>02493 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02494"></a>02494 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"CQ2 = \n"</span>);
<a name="l02495"></a>02495 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,CQ2);
<a name="l02496"></a>02496 <span class="keywordflow">if</span>( ! <a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(CQ, CQ2) )
<a name="l02497"></a>02497 fprintf( stderr,<span class="stringliteral">"CQ does not include CQ2 !\n"</span>);
<a name="l02498"></a>02498 <span class="keywordflow">else</span>
<a name="l02499"></a>02499 fprintf( stderr,<span class="stringliteral">"CQ includes CQ2.\n"</span>);
<a name="l02500"></a>02500 <span class="keywordflow">if</span>( ! <a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(res-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, CQ2) )
<a name="l02501"></a>02501 fprintf( stderr,<span class="stringliteral">"CQ2 is *not* included in validity domain !\n"</span>);
<a name="l02502"></a>02502 <span class="keywordflow">else</span>
<a name="l02503"></a>02503 fprintf( stderr,<span class="stringliteral">"CQ2 is included in validity domain.\n"</span>);
<a name="l02504"></a>02504 <span class="preprocessor">#endif</span>
<a name="l02505"></a>02505 <span class="preprocessor"></span>
<a name="l02506"></a>02506 <span class="comment">/* L is used in counting the number of points in the base cases */</span>
<a name="l02507"></a>02507 L = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(P,CQ,MAXRAYS);
<a name="l02508"></a>02508 U = <a class="code" href="polyhedron_8c.html#832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(0);
<a name="l02509"></a>02509
<a name="l02510"></a>02510 <span class="comment">/* LQ is used to scan the parameter space */</span>
<a name="l02511"></a>02511 LQ = <a class="code" href="polyhedron_8c.html#7e6c09758e3d3063be1386c7026b38ba">Polyhedron_Scan</a>(CQ2,U,MAXRAYS); <span class="comment">/* bounds on parameters */</span>
<a name="l02512"></a>02512 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(U);
<a name="l02513"></a>02513 <span class="keywordflow">if</span>(CT) <span class="comment">/* we did compute another Q->Domain */</span>
<a name="l02514"></a>02514 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(CQ);
<a name="l02515"></a>02515
<a name="l02516"></a>02516 <span class="comment">/* Else, CQ was Q->Domain (used in res) */</span>
<a name="l02517"></a>02517 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(CQ2);
<a name="l02518"></a>02518
<a name="l02519"></a>02519 <span class="preprocessor">#ifdef EDEBUG2</span>
<a name="l02520"></a>02520 <span class="preprocessor"></span> fprintf(stderr,<span class="stringliteral">"L = \n"</span>);
<a name="l02521"></a>02521 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,L);
<a name="l02522"></a>02522 fprintf(stderr,<span class="stringliteral">"LQ = \n"</span>);
<a name="l02523"></a>02523 <a class="code" href="polyhedron_8c.html#d87595bd01c5cdd0f3933824943db496">Polyhedron_Print</a>(stderr,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,LQ);
<a name="l02524"></a>02524 <span class="preprocessor">#endif</span>
<a name="l02525"></a>02525 <span class="preprocessor"></span><span class="preprocessor">#ifdef EDEBUG3</span>
<a name="l02526"></a>02526 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"\nSystem of Equations:\n"</span>);
<a name="l02527"></a>02527 <span class="preprocessor">#endif</span>
<a name="l02528"></a>02528 <span class="preprocessor"></span>
<a name="l02529"></a>02529 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l02530"></a>02530 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l02531"></a>02531
<a name="l02532"></a>02532 <span class="comment">/* Create a context vector size dim+2 */</span>
<a name="l02533"></a>02533 context = (Value *) malloc ((hdim+1)*<span class="keyword">sizeof</span>(Value));
<a name="l02534"></a>02534 <span class="keywordflow">for</span>(i=0;i<=(hdim);i++)
<a name="l02535"></a>02535 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(context[i]);
<a name="l02536"></a>02536 <a class="code" href="vector_8c.html#27ccb3ea01f3a496bb799fb99e9e3075">Vector_Set</a>(context,0,(hdim+1));
<a name="l02537"></a>02537
<a name="l02538"></a>02538 <span class="comment">/* Set context[hdim] = 1 (the constant) */</span>
<a name="l02539"></a>02539 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(context[hdim],1);
<a name="l02540"></a>02540
<a name="l02541"></a>02541 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#221261b286628ee622df9588446d503e">CATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>) {
<a name="l02542"></a>02542 fprintf(stderr,<span class="stringliteral">"Enumerate: arithmetic overflow error.\n"</span>);
<a name="l02543"></a>02543 fprintf(stderr,<span class="stringliteral">"You should rebuild PolyLib using GNU-MP "</span>
<a name="l02544"></a>02544 <span class="stringliteral">"or increasing the size of integers.\n"</span>);
<a name="l02545"></a>02545 <a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a> = 0;
<a name="l02546"></a>02546 <a class="code" href="assert_8h.html#07d17d6d5d1074c0969bc5d3c3d1d84a">assert</a>(<a class="code" href="ehrhart_8c.html#b969ed82da60f7f4fe87c5741311606b">overflow_warning_flag</a>);
<a name="l02547"></a>02547
<a name="l02548"></a>02548 }
<a name="l02549"></a>02549 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#d2746371528bdf15c3910b7bf217dac0">TRY</a> {
<a name="l02550"></a>02550 res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p = <a class="code" href="ehrhart_8c.html#6f3773f94c2c24a11ae2eb07fd8673c8">P_Enum</a>(L,LQ,context,1,nb_param,dim,lcm, param_name);
<a name="l02551"></a>02551 <a class="code" href="source_2arith_2arithmetic__errors_8h.html#8211465bb59b0e6b8c374b440965dbb4">UNCATCH</a>(<a class="code" href="source_2arith_2arithmetique_8h.html#f74135a8750c28205f819842ae8be9c9">overflow_error</a>);
<a name="l02552"></a>02552 }
<a name="l02553"></a>02553
<a name="l02554"></a>02554 <span class="keywordflow">for</span>(i=0;i<=(hdim);i++)
<a name="l02555"></a>02555 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(context[i]);
<a name="l02556"></a>02556 free(context);
<a name="l02557"></a>02557 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(L);
<a name="l02558"></a>02558 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(LQ);
<a name="l02559"></a>02559
<a name="l02560"></a>02560 <span class="preprocessor">#ifdef EDEBUG5</span>
<a name="l02561"></a>02561 <span class="preprocessor"></span> <span class="keywordflow">if</span>( param_name )
<a name="l02562"></a>02562 {
<a name="l02563"></a>02563 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial (before simplification):\n"</span>);
<a name="l02564"></a>02564 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,param_name);
<a name="l02565"></a>02565 }
<a name="l02566"></a>02566
<a name="l02567"></a>02567 <span class="comment">/* BM: divide EP by denom_det, the expansion factor */</span>
<a name="l02568"></a>02568 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial (before division):\n"</span>);
<a name="l02569"></a>02569 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>),param_name);
<a name="l02570"></a>02570 <span class="preprocessor">#endif</span>
<a name="l02571"></a>02571 <span class="preprocessor"></span>
<a name="l02572"></a>02572 <a class="code" href="ehrhart_8c.html#1cec8d518c4034be8b44520f5d66f27b" title="Divides the evalue e by the integer n recursive function Warning : modifies e.">evalue_div</a>(&(res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>), expansion_det);
<a name="l02573"></a>02573
<a name="l02574"></a>02574
<a name="l02575"></a>02575 <span class="comment">/* Try to simplify the result */</span>
<a name="l02576"></a>02576 <a class="code" href="ehrhart_8c.html#e02ef07ca7d9de519ffe46a89e941bb8">reduce_evalue</a>(&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l02577"></a>02577
<a name="l02578"></a>02578 <span class="comment">/* Put back the original parameters into result */</span>
<a name="l02579"></a>02579 <span class="comment">/* (equalities have been eliminated) */</span>
<a name="l02580"></a>02580 <span class="keywordflow">if</span>(CT)
<a name="l02581"></a>02581 <a class="code" href="ehrhart_8c.html#a620fc3759fc7fe715bc6d5e891631e7" title="Comments.">addeliminatedparams_evalue</a>(&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,CT);
<a name="l02582"></a>02582
<a name="l02583"></a>02583 <span class="keywordflow">if</span>( param_name )
<a name="l02584"></a>02584 {
<a name="l02585"></a>02585 fprintf(stdout,<span class="stringliteral">"\nEhrhart Polynomial:\n"</span>);
<a name="l02586"></a>02586 <a class="code" href="ehrhart_8c.html#99718adf05e065181f35f5ca847f94b0">print_evalue</a>(stdout,&res-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>, param_name);
<a name="l02587"></a>02587 fprintf(stdout,<span class="stringliteral">"\n"</span>);
<a name="l02588"></a>02588 <span class="comment">/* sometimes the final \n lacks (when a single constant is printed)</span>
<a name="l02589"></a>02589 <span class="comment"> */</span>
<a name="l02590"></a>02590 }
<a name="l02591"></a>02591
<a name="l02592"></a>02592 }
<a name="l02593"></a>02593 }
<a name="l02594"></a>02594 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(expansion_det);
<a name="l02595"></a>02595
<a name="l02596"></a>02596 <span class="keywordflow">if</span>( P != Pi )
<a name="l02597"></a>02597 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>( P );
<a name="l02598"></a>02598 <span class="comment">/* Clear all the 'Value' variables */</span>
<a name="l02599"></a>02599 <span class="keywordflow">for</span>( np=0; np<nb_param ; np++ )
<a name="l02600"></a>02600 {
<a name="l02601"></a>02601 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(lcm[np]); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1[np]);
<a name="l02602"></a>02602 }
<a name="l02603"></a>02603 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(hdv);
<a name="l02604"></a>02604
<a name="l02605"></a>02605 <span class="keywordflow">return</span> res;
<a name="l02606"></a>02606 } <span class="comment">/* Ehrhart_Quick_Apx_Full_Dim */</span>
<a name="l02607"></a>02607
<a name="l02608"></a>02608 <span class="comment"></span>
<a name="l02609"></a>02609 <span class="comment">/** </span>
<a name="l02610"></a>02610 <span class="comment"> * Computes the approximation of the Ehrhart polynomial of a polyhedron </span>
<a name="l02611"></a>02611 <span class="comment"> * (implicit form -> matrix), treating the non-full-dimensional case.</span>
<a name="l02612"></a>02612 <span class="comment"> * @param M a polyhedron under implicit form</span>
<a name="l02613"></a>02613 <span class="comment"> * @param C M's context under implicit form</span>
<a name="l02614"></a>02614 <span class="comment"> * @param Validity_Lattice a pointer to the parameter's validity lattice</span>
<a name="l02615"></a>02615 <span class="comment"> * @param MAXRAYS the needed "working space" for other polylib functions used here</span>
<a name="l02616"></a>02616 <span class="comment"> * @param param_name the names of the parameters, </span>
<a name="l02617"></a>02617 <span class="comment"> */</span>
<a name="l02618"></a><a class="code" href="ehrhart_8h.html#115270362b32051ceb2acd7160d191d1">02618</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ehrhart_8c.html#0d3e40195e67384f3655c772212ed1d5" title="Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form...">Ehrhart_Quick_Apx</a>(<a class="code" href="structmatrix.html">Matrix</a> * M, <a class="code" href="structmatrix.html">Matrix</a> * C,
<a name="l02619"></a>02619 <a class="code" href="structmatrix.html">Matrix</a> **Validity_Lattice, <span class="keywordtype">unsigned</span> <a class="code" href="testCompressParms_8c.html#508eb31b6faa4939e1c32adaef41b8c8">maxRays</a>) {
<a name="l02620"></a>02620 <span class="comment">/* char ** param_name) {*/</span>
<a name="l02621"></a>02621
<a name="l02622"></a>02622 <span class="comment">/* 0- compute a full-dimensional polyhedron with the same number of points,</span>
<a name="l02623"></a>02623 <span class="comment"> and its parameter's validity lattice */</span>
<a name="l02624"></a>02624 <a class="code" href="structmatrix.html">Matrix</a> * M_full;
<a name="l02625"></a>02625 <a class="code" href="structpolyhedron.html">Polyhedron</a> * P, * PC;
<a name="l02626"></a>02626 <a class="code" href="struct__enumeration.html">Enumeration</a> *en;
<a name="l02627"></a>02627
<a name="l02628"></a>02628 M_full = <a class="code" href="compress__parms_8c.html#b67657b853a34d82fdc72a3f771bc72c" title="Given a matrix with m parameterized equations, compress the nb_parms parameters and...">full_dimensionize</a>(M, C-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-2, Validity_Lattice);
<a name="l02629"></a>02629 <span class="comment">/* 1- apply the same tranformation to the context that what has been applied</span>
<a name="l02630"></a>02630 <span class="comment"> to the parameters space of the polyhedron. */</span>
<a name="l02631"></a>02631 <a class="code" href="matrix__addon_8c.html#44f487e1b38f0f47c115d2115087a017" title="compress the last vars/pars of the polyhedron M expressed as a polylib matrixadresses...">mpolyhedron_compress_last_vars</a>(C, *Validity_Lattice);
<a name="l02632"></a>02632 <a class="code" href="matrix__addon_8h.html#11468159c7fa7d75fadfa10e2e929fee" title="Polylib matrix addons Mainly, deals with polyhedra represented in implicit form (set...">show_matrix</a>(M_full);
<a name="l02633"></a>02633 P = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(M_full, maxRays);
<a name="l02634"></a>02634 PC = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(C, maxRays);
<a name="l02635"></a>02635 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M_full);
<a name="l02636"></a>02636 <span class="comment">/* compute the Ehrhart polynomial of the "equivalent" polyhedron */</span>
<a name="l02637"></a>02637 en = <a class="code" href="ehrhart_8c.html#da57c2bc3420728ec985add1229b1259" title="Ehrhart_Quick_Apx_Full_Dim(P, C, MAXRAYS, param_names).">Ehrhart_Quick_Apx_Full_Dim</a>(P, PC, maxRays, NULL);
<a name="l02638"></a>02638
<a name="l02639"></a>02639 <span class="comment">/* clean up */</span>
<a name="l02640"></a>02640 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(P);
<a name="l02641"></a>02641 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(PC);
<a name="l02642"></a>02642 <span class="keywordflow">return</span> en;
<a name="l02643"></a>02643 } <span class="comment">/* Ehrhart_Quick_Apx */</span>
<a name="l02644"></a>02644
<a name="l02645"></a>02645
<a name="l02646"></a>02646 <span class="comment"></span>
<a name="l02647"></a>02647 <span class="comment">/** </span>
<a name="l02648"></a>02648 <span class="comment"> * Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit</span>
<a name="l02649"></a>02649 <span class="comment"> * form -> matrix), treating the non-full-dimensional case. If there are some</span>
<a name="l02650"></a>02650 <span class="comment"> * equalities involving only parameters, these are used to eliminate useless </span>
<a name="l02651"></a>02651 <span class="comment"> * parameters.</span>
<a name="l02652"></a>02652 <span class="comment"> * @param M a polyhedron under implicit form</span>
<a name="l02653"></a>02653 <span class="comment"> * @param C M's context under implicit form</span>
<a name="l02654"></a>02654 <span class="comment"> * @param validityLattice a pointer to the parameter's validity lattice</span>
<a name="l02655"></a>02655 <span class="comment"> * (returned)</span>
<a name="l02656"></a>02656 <span class="comment"> * @param parmsEqualities Equalities involving only the parameters</span>
<a name="l02657"></a>02657 <span class="comment"> * @param maxRays the needed "working space" for other polylib functions used here</span>
<a name="l02658"></a>02658 <span class="comment"> * @param elimParams array of the indices of the eliminated parameters (returned)</span>
<a name="l02659"></a>02659 <span class="comment"> */</span>
<a name="l02660"></a><a class="code" href="ehrhart_8c.html#559687f3df836ab509cd6cd144ef74e4">02660</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ehrhart_8c.html#559687f3df836ab509cd6cd144ef74e4" title="Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form...">Constraints_EhrhartQuickApx</a>(<a class="code" href="structmatrix.html">Matrix</a> <span class="keyword">const</span> * M, <a class="code" href="structmatrix.html">Matrix</a> <span class="keyword">const</span> * C,
<a name="l02661"></a>02661 <a class="code" href="structmatrix.html">Matrix</a> ** validityLattice,
<a name="l02662"></a>02662 <a class="code" href="structmatrix.html">Matrix</a> ** parmEqualities,
<a name="l02663"></a>02663 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ** elimParms,
<a name="l02664"></a>02664 <span class="keywordtype">unsigned</span> <a class="code" href="testCompressParms_8c.html#508eb31b6faa4939e1c32adaef41b8c8">maxRays</a>) {
<a name="l02665"></a>02665 <a class="code" href="struct__enumeration.html">Enumeration</a> *EP;
<a name="l02666"></a>02666 <a class="code" href="structmatrix.html">Matrix</a> * Mp = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(M);
<a name="l02667"></a>02667 <a class="code" href="structmatrix.html">Matrix</a> * Cp = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(C);
<a name="l02668"></a>02668 <span class="comment">/* remove useless equalities involving only parameters, using these </span>
<a name="l02669"></a>02669 <span class="comment"> equalities to remove parameters. */</span>
<a name="l02670"></a>02670 (*parmEqualities) = <a class="code" href="compress__parms_8c.html#ca0035f9313236fd8046ab042180f544" title="Removes the equalities that involve only parameters, by eliminating some parameters...">Constraints_Remove_parm_eqs</a>(&Mp, &Cp, 0, elimParms);
<a name="l02671"></a>02671 <span class="keywordflow">if</span> (Mp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>>=0) {<span class="comment">/* if there is no contradiction */</span>
<a name="l02672"></a>02672 EP = <a class="code" href="ehrhart_8c.html#0d3e40195e67384f3655c772212ed1d5" title="Computes the approximation of the Ehrhart polynomial of a polyhedron (implicit form...">Ehrhart_Quick_Apx</a>(Mp, Cp, validityLattice, maxRays);
<a name="l02673"></a>02673 <span class="keywordflow">return</span> EP;
<a name="l02674"></a>02674 }
<a name="l02675"></a>02675 <span class="keywordflow">else</span> {
<a name="l02676"></a>02676 <span class="comment">/* if there are contradictions, return a zero Ehrhart polynomial */</span>
<a name="l02677"></a>02677 <span class="keywordflow">return</span> NULL;
<a name="l02678"></a>02678 }
<a name="l02679"></a>02679
<a name="l02680"></a>02680 }
<a name="l02681"></a>02681
<a name="l02682"></a>02682 <span class="comment"></span>
<a name="l02683"></a>02683 <span class="comment">/** </span>
<a name="l02684"></a>02684 <span class="comment"> * Returns the array of parameter names after some of them have been eliminated.</span>
<a name="l02685"></a>02685 <span class="comment"> * @param parmNames the initial names of the parameters</span>
<a name="l02686"></a>02686 <span class="comment"> * @param elimParms a list of parameters that have been eliminated from the</span>
<a name="l02687"></a>02687 <span class="comment"> * original parameters. The first element of this array is the number of</span>
<a name="l02688"></a>02688 <span class="comment"> * elements.</span>
<a name="l02689"></a>02689 <span class="comment"> * <p> Note: does not copy the parameters names themselves. </p></span>
<a name="l02690"></a>02690 <span class="comment"> * @param nbParms the initial number of parameters</span>
<a name="l02691"></a>02691 <span class="comment">*/</span>
<a name="l02692"></a><a class="code" href="ehrhart_8c.html#1f6f50943f68c80a90ec1b5107adc900">02692</a> <span class="keyword">const</span> <span class="keywordtype">char</span> **<a class="code" href="ehrhart_8c.html#1f6f50943f68c80a90ec1b5107adc900" title="Returns the array of parameter names after some of them have been eliminated.">parmsWithoutElim</a>(<span class="keywordtype">char</span> <span class="keyword">const</span> **parmNames,
<a name="l02693"></a>02693 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <span class="keyword">const</span> *elimParms,
<a name="l02694"></a>02694 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nbParms)
<a name="l02695"></a>02695 {
<a name="l02696"></a>02696 <span class="keywordtype">int</span> i=0, j=0,k;
<a name="l02697"></a>02697 <span class="keywordtype">int</span> newParmNb = nbParms - elimParms[0];
<a name="l02698"></a>02698 <span class="keyword">const</span> <span class="keywordtype">char</span> **newParmNames = (<span class="keyword">const</span> <span class="keywordtype">char</span> **)malloc(newParmNb * <span class="keyword">sizeof</span>(<span class="keywordtype">char</span> *));
<a name="l02699"></a>02699 <span class="keywordflow">for</span> (k=1; k<= elimParms[0]; k++) {
<a name="l02700"></a>02700 <span class="keywordflow">while</span> (i!=elimParms[k]) {
<a name="l02701"></a>02701 newParmNames[i-k+1] = parmNames[i];
<a name="l02702"></a>02702 i++;
<a name="l02703"></a>02703 }
<a name="l02704"></a>02704 }
<a name="l02705"></a>02705 <span class="keywordflow">return</span> newParmNames;
<a name="l02706"></a>02706 }
<a name="l02707"></a>02707
<a name="l02708"></a>02708 <span class="comment"></span>
<a name="l02709"></a>02709 <span class="comment">/** </span>
<a name="l02710"></a>02710 <span class="comment"> * returns a constant Ehrhart polynomial whose value is zero for any value of</span>
<a name="l02711"></a>02711 <span class="comment"> * the parameters.</span>
<a name="l02712"></a>02712 <span class="comment"> * @param nbParms the number of parameters, i.e., the number of arguments to</span>
<a name="l02713"></a>02713 <span class="comment"> * the Ehrhart polynomial</span>
<a name="l02714"></a>02714 <span class="comment"> */</span>
<a name="l02715"></a><a class="code" href="ehrhart_8h.html#b9d946f486657c1fde2ff63537f004fb">02715</a> <a class="code" href="struct__enumeration.html">Enumeration</a> * <a class="code" href="ehrhart_8c.html#b9d946f486657c1fde2ff63537f004fb" title="returns a constant Ehrhart polynomial whose value is zero for any value of the parameters...">Enumeration_zero</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> nbParms, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="testCompressParms_8c.html#508eb31b6faa4939e1c32adaef41b8c8">maxRays</a>) {
<a name="l02716"></a>02716 <a class="code" href="structmatrix.html">Matrix</a> * Mz = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(1, nbParms+3);
<a name="l02717"></a>02717 <a class="code" href="structpolyhedron.html">Polyhedron</a> * emptyP;
<a name="l02718"></a>02718 <a class="code" href="structpolyhedron.html">Polyhedron</a> * universe;
<a name="l02719"></a>02719 <a class="code" href="struct__enumeration.html">Enumeration</a> * zero;
<a name="l02720"></a>02720 <span class="comment">/* 1- build an empty polyhedron with the right dimension */</span>
<a name="l02721"></a>02721 <span class="comment">/* here we choose to take 2i = -1 */</span>
<a name="l02722"></a>02722 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Mz-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][1], 2);
<a name="l02723"></a>02723 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Mz-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][nbParms+2], 1);
<a name="l02724"></a>02724 emptyP = <a class="code" href="polyhedron_8c.html#efb77665a187d751bdd44f106b12465e" title="Given a matrix of constraints (&#39;Constraints&#39;), construct and return a polyhedron...">Constraints2Polyhedron</a>(Mz, maxRays);
<a name="l02725"></a>02725 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Mz);
<a name="l02726"></a>02726 universe = <a class="code" href="polyhedron_8c.html#832c074e0ce9da3df126dc7d51248276">Universe_Polyhedron</a>(nbParms);
<a name="l02727"></a>02727 zero = <a class="code" href="ehrhart_8c.html#3c3e442b1d2c924f03f02f9e9283141a" title="Procedure to count points in a parameterized polytope.">Polyhedron_Enumerate</a>(emptyP, universe, maxRays, NULL);
<a name="l02728"></a>02728 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(emptyP);
<a name="l02729"></a>02729 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(universe);
<a name="l02730"></a>02730 <span class="keywordflow">return</span> zero;
<a name="l02731"></a>02731 } <span class="comment">/* Enumeration_zero() */</span>
<a name="l02732"></a>02732
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Tue Sep 15 18:33:59 2009 for polylib by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
|
