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
|
<!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: Lattice.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>Lattice.c</h1><a href="Lattice_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00002"></a>00002 <span class="preprocessor">#include <<a class="code" href="polylib_8h.html">polylib/polylib.h</a>></span>
<a name="l00003"></a>00003
<a name="l00004"></a>00004
<a name="l00005"></a><a class="code" href="structfactor.html">00005</a> <span class="keyword">typedef</span> <span class="keyword">struct </span>{
<a name="l00006"></a><a class="code" href="structfactor.html#e55e0a1174396542aa7f78afafa2ca4f">00006</a> <span class="keywordtype">int</span> count;
<a name="l00007"></a><a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">00007</a> <span class="keywordtype">int</span> *fac;
<a name="l00008"></a>00008 } <a class="code" href="structfactor.html">factor</a>;
<a name="l00009"></a>00009
<a name="l00010"></a>00010 <span class="keyword">static</span> <a class="code" href="structfactor.html">factor</a> <a class="code" href="Lattice_8c.html#6873054429fbd7cc187a08ec4776a749">allfactors</a> (<span class="keywordtype">int</span> num);
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment">/* </span>
<a name="l00013"></a>00013 <span class="comment"> * Print the contents of a list of Lattices 'Head' </span>
<a name="l00014"></a>00014 <span class="comment"> */</span>
<a name="l00015"></a><a class="code" href="Lattice_8h.html#e9589a3920f117a40663271977a9a84a">00015</a> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#e9589a3920f117a40663271977a9a84a">PrintLatticeUnion</a>(FILE *fp, <span class="keywordtype">char</span> *format, <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head) {
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp;
<a name="l00018"></a>00018
<a name="l00019"></a>00019 <span class="keywordflow">for</span>(temp = Head; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l00020"></a>00020 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(fp,format,(<a class="code" href="structmatrix.html">Matrix</a> *)temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>);
<a name="l00021"></a>00021 <span class="keywordflow">return</span>;
<a name="l00022"></a>00022 } <span class="comment">/* PrintLatticeUnion */</span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="comment">/* </span>
<a name="l00025"></a>00025 <span class="comment"> * Free the memory allocated to a list of lattices 'Head' </span>
<a name="l00026"></a>00026 <span class="comment"> */</span>
<a name="l00027"></a><a class="code" href="Lattice_8h.html#d405c032776bc0e029b1d431b3cab314">00027</a> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#d405c032776bc0e029b1d431b3cab314">LatticeUnion_Free</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head) {
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp;
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="keywordflow">while</span> (Head != NULL) {
<a name="l00032"></a>00032 temp = Head;
<a name="l00033"></a>00033 Head = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l00034"></a>00034 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>);
<a name="l00035"></a>00035 free(temp);
<a name="l00036"></a>00036 }
<a name="l00037"></a>00037 <span class="keywordflow">return</span>;
<a name="l00038"></a>00038 } <span class="comment">/* LatticeUnion_Free */</span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="comment">/* </span>
<a name="l00041"></a>00041 <span class="comment"> * Allocate a heads for a list of Lattices</span>
<a name="l00042"></a>00042 <span class="comment"> */</span>
<a name="l00043"></a><a class="code" href="Lattice_8h.html#3ec0f98cd150dbf78ef0a604c0eb74ff">00043</a> <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#3ec0f98cd150dbf78ef0a604c0eb74ff">LatticeUnion_Alloc</a>(<span class="keywordtype">void</span>) {
<a name="l00044"></a>00044
<a name="l00045"></a>00045 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp;
<a name="l00046"></a>00046
<a name="l00047"></a>00047 temp = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l00048"></a>00048 temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>=NULL;
<a name="l00049"></a>00049 temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>=NULL;
<a name="l00050"></a>00050 <span class="keywordflow">return</span> temp;
<a name="l00051"></a>00051 } <span class="comment">/* LatticeUnion_Alloc */</span>
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="comment">/*</span>
<a name="l00054"></a>00054 <span class="comment"> * Given two Lattices 'A' and 'B', return True if they have the same affine </span>
<a name="l00055"></a>00055 <span class="comment"> * part (the last column) otherwise return 'False'. </span>
<a name="l00056"></a>00056 <span class="comment"> */</span>
<a name="l00057"></a><a class="code" href="Lattice_8h.html#6a82f4f5730f8c7b5b912e3a7b55dbb4">00057</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#6a82f4f5730f8c7b5b912e3a7b55dbb4">sameAffinepart</a> (<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> *B) {
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="keywordtype">int</span> i;
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00062"></a>00062 <span class="preprocessor"></span> FILE *fp;
<a name="l00063"></a>00063 fp = fopen(<span class="stringliteral">"_debug"</span>,<span class="stringliteral">"a"</span>);
<a name="l00064"></a>00064 fprintf(fp,<span class="stringliteral">"\nEntered SAMEAFFINEPART \n"</span>);
<a name="l00065"></a>00065 fclose(fp);
<a name="l00066"></a>00066 <span class="preprocessor">#endif</span>
<a name="l00067"></a>00067 <span class="preprocessor"></span>
<a name="l00068"></a>00068 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++)
<a name="l00069"></a>00069 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][B-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]))
<a name="l00070"></a>00070 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l00071"></a>00071 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l00072"></a>00072 } <span class="comment">/* sameAffinepart */</span>
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="comment">/*</span>
<a name="l00075"></a>00075 <span class="comment"> * Return an empty lattice of dimension 'dimension-1'. An empty lattice is </span>
<a name="l00076"></a>00076 <span class="comment"> * represented as [[0 0 ... 0] .... [0 ... 0][0 0.....0 1]]. </span>
<a name="l00077"></a>00077 <span class="comment"> */</span>
<a name="l00078"></a><a class="code" href="Lattice_8h.html#ab7550d1f894cc88fe630ce56f502184">00078</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(<span class="keywordtype">int</span> dimension) {
<a name="l00079"></a>00079
<a name="l00080"></a>00080 <a class="code" href="structmatrix.html">Lattice</a> *result;
<a name="l00081"></a>00081 <span class="keywordtype">int</span> i,j;
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00084"></a>00084 <span class="preprocessor"></span> FILE *fp;
<a name="l00085"></a>00085 fp = fopen (<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00086"></a>00086 fprintf (fp, <span class="stringliteral">"\nEntered NULLATTICE \n"</span>);
<a name="l00087"></a>00087 fclose (fp);
<a name="l00088"></a>00088 <span class="preprocessor">#endif</span>
<a name="l00089"></a>00089 <span class="preprocessor"></span>
<a name="l00090"></a>00090 result = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(dimension, dimension);
<a name="l00091"></a>00091 <span class="keywordflow">for</span> (i = 0; i < dimension; i ++)
<a name="l00092"></a>00092 <span class="keywordflow">for</span> (j = 0; j < dimension; j ++)
<a name="l00093"></a>00093 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],0);
<a name="l00094"></a>00094 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i-1][i-1],1);
<a name="l00095"></a>00095 <span class="keywordflow">return</span> result;
<a name="l00096"></a>00096 } <span class="comment">/* EmptyLattice */</span>
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="comment">/*</span>
<a name="l00099"></a>00099 <span class="comment"> * Return True if Lattice 'A' is empty, otherwise return False. </span>
<a name="l00100"></a>00100 <span class="comment"> */</span>
<a name="l00101"></a><a class="code" href="Lattice_8h.html#7a9a551062ace0251e9bb0ea6b74c860">00101</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a> (<a class="code" href="structmatrix.html">Lattice</a> *A) {
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keywordtype">int</span> i,j;
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00106"></a>00106 <span class="preprocessor"></span> FILE *fp;
<a name="l00107"></a>00107 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00108"></a>00108 fprintf(fp,<span class="stringliteral">"\nEntered ISNULLATTICE \n"</span>);
<a name="l00109"></a>00109 fclose(fp);
<a name="l00110"></a>00110 <span class="preprocessor">#endif</span>
<a name="l00111"></a>00111 <span class="preprocessor"></span>
<a name="l00112"></a>00112 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00113"></a>00113 <span class="keywordflow">for</span> (j = 0; j < A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j ++)
<a name="l00114"></a>00114 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j])) {
<a name="l00115"></a>00115 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l00116"></a>00116 }
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#61db0ba9ba925615ec70eb92e40b9ef4">value_one_p</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1])) {
<a name="l00118"></a>00118 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a> ;
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a> ;
<a name="l00121"></a>00121 } <span class="comment">/* isEmptyLaattice */</span>
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="comment">/*</span>
<a name="l00124"></a>00124 <span class="comment"> * Given a Lattice 'A', check whether it is linear or not, i.e. whether the </span>
<a name="l00125"></a>00125 <span class="comment"> * affine part is NULL or not. If affine part is empty, it returns True other-</span>
<a name="l00126"></a>00126 <span class="comment"> * wise it returns False.</span>
<a name="l00127"></a>00127 <span class="comment"> */</span>
<a name="l00128"></a><a class="code" href="Lattice_8h.html#59f5ebfe98faf74f9b9628d0f484fece">00128</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#59f5ebfe98faf74f9b9628d0f484fece">isLinear</a>(<a class="code" href="structmatrix.html">Lattice</a> *A) {
<a name="l00129"></a>00129
<a name="l00130"></a>00130 <span class="keywordtype">int</span> i;
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00133"></a>00133 <span class="preprocessor"></span> FILE *fp;
<a name="l00134"></a>00134 fp = fopen (<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00135"></a>00135 fprintf (fp, <span class="stringliteral">"\nEntered ISLINEAR \n"</span>);
<a name="l00136"></a>00136 fclose (fp);
<a name="l00137"></a>00137 <span class="preprocessor">#endif</span>
<a name="l00138"></a>00138 <span class="preprocessor"></span>
<a name="l00139"></a>00139 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00140"></a>00140 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1])) {
<a name="l00141"></a>00141 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l00142"></a>00142 }
<a name="l00143"></a>00143 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l00144"></a>00144 } <span class="comment">/* isLinear */</span>
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="comment">/* </span>
<a name="l00147"></a>00147 <span class="comment"> * Return the affine Hermite normal form of the affine lattice 'A'. The unique </span>
<a name="l00148"></a>00148 <span class="comment"> * affine Hermite form if a lattice is stored in 'H' and the unimodular matrix </span>
<a name="l00149"></a>00149 <span class="comment"> * corresponding to 'A = H*U' is stored in the matrix 'U'. </span>
<a name="l00150"></a>00150 <span class="comment"> * Algorithm : </span>
<a name="l00151"></a>00151 <span class="comment"> * 1) Check if the Lattice is Linear or not.</span>
<a name="l00152"></a>00152 <span class="comment"> * 2) If it is not Linear, then Homogenise the Lattice.</span>
<a name="l00153"></a>00153 <span class="comment"> * 3) Call Hermite.</span>
<a name="l00154"></a>00154 <span class="comment"> * 4) If the Lattice was Homogenised, the HNF H must be </span>
<a name="l00155"></a>00155 <span class="comment"> * Dehomogenised and also corresponding changes must</span>
<a name="l00156"></a>00156 <span class="comment"> * be made to the Unimodular Matrix U.</span>
<a name="l00157"></a>00157 <span class="comment"> * 5) Return.</span>
<a name="l00158"></a>00158 <span class="comment"> */</span>
<a name="l00159"></a><a class="code" href="Lattice_8h.html#4d75ea3bed92d944fc4be0ec7e08bd15">00159</a> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a> (<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> **H, <a class="code" href="structmatrix.html">Matrix</a> **U) {
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <a class="code" href="structmatrix.html">Lattice</a> *temp;
<a name="l00162"></a>00162 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> flag = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00165"></a>00165 <span class="preprocessor"></span> FILE *fp;
<a name="l00166"></a>00166 fp = fopen (<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00167"></a>00167 fprintf (fp, <span class="stringliteral">"\nEntered AFFINEHERMITE \n"</span>);
<a name="l00168"></a>00168 fclose (fp);
<a name="l00169"></a>00169 <span class="preprocessor">#endif</span>
<a name="l00170"></a>00170 <span class="preprocessor"></span>
<a name="l00171"></a>00171 <span class="keywordflow">if</span> (<a class="code" href="Lattice_8c.html#59f5ebfe98faf74f9b9628d0f484fece">isLinear</a>(A) == <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>)
<a name="l00172"></a>00172 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a>(A,<a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>);
<a name="l00173"></a>00173 <span class="keywordflow">else</span> {
<a name="l00174"></a>00174 flag = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a> ;
<a name="l00175"></a>00175 temp = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(A);
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177 <a class="code" href="NormalForms_8c.html#cd4e00bd353920b83e3f27a76909b2ed" title="Hermite : This function takes a Matrix as its input and finds its HNF ( Left form...">Hermite</a>((<a class="code" href="structmatrix.html">Matrix</a> *)temp,(<a class="code" href="structmatrix.html">Matrix</a> **) H, U);
<a name="l00178"></a>00178 <span class="keywordflow">if</span> (flag == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l00179"></a>00179 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) temp);
<a name="l00180"></a>00180 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a>(H[0],<a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>);
<a name="l00181"></a>00181 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) H[0]);
<a name="l00182"></a>00182 H[0] = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(temp);
<a name="l00183"></a>00183 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) temp);
<a name="l00184"></a>00184 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a>(U[0],<a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>);
<a name="l00185"></a>00185 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) U[0]);
<a name="l00186"></a>00186 U[0] = (<a class="code" href="structmatrix.html">Matrix</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(temp);
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) temp);
<a name="l00189"></a>00189 <span class="keywordflow">return</span>;
<a name="l00190"></a>00190 } <span class="comment">/* AffineHermite */</span>
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="comment">/*</span>
<a name="l00193"></a>00193 <span class="comment"> * Given a Polylib matrix 'A' that rerepresents an affine function, return the</span>
<a name="l00194"></a>00194 <span class="comment"> * affine Smith normal form 'Delta' of 'A' and unimodular matrices 'U' and 'V'</span>
<a name="l00195"></a>00195 <span class="comment"> * such that 'A = U*Delta*V'. </span>
<a name="l00196"></a>00196 <span class="comment"> * Algorithm:</span>
<a name="l00197"></a>00197 <span class="comment"> * (1) Homogenise the Lattice.</span>
<a name="l00198"></a>00198 <span class="comment"> * (2) Call Smith</span>
<a name="l00199"></a>00199 <span class="comment"> * (3) The Smith Normal Form Delta must be Dehomogenised and also </span>
<a name="l00200"></a>00200 <span class="comment"> * corresponding changes must be made to the Unimodular Matrices </span>
<a name="l00201"></a>00201 <span class="comment"> * U and V.</span>
<a name="l00202"></a>00202 <span class="comment"> * 4) Bring Delta into AffineSmith Form.</span>
<a name="l00203"></a>00203 <span class="comment"> */</span>
<a name="l00204"></a><a class="code" href="Lattice_8h.html#ceafe2570bfa2354e04412151d903094">00204</a> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#ceafe2570bfa2354e04412151d903094">AffineSmith</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> **U, <a class="code" href="structmatrix.html">Lattice</a> **V, <a class="code" href="structmatrix.html">Lattice</a> **Diag) {
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <a class="code" href="structmatrix.html">Lattice</a> *temp;
<a name="l00207"></a>00207 <a class="code" href="structmatrix.html">Lattice</a> *Uinv;
<a name="l00208"></a>00208 <span class="keywordtype">int</span> i,j;
<a name="l00209"></a>00209 Value sum, quo, rem;
<a name="l00210"></a>00210
<a name="l00211"></a>00211 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00212"></a>00212 <span class="preprocessor"></span> FILE *fp;
<a name="l00213"></a>00213 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00214"></a>00214 fprintf(fp,<span class="stringliteral">"\nEntered AFFINESMITH \n"</span>);
<a name="l00215"></a>00215 fclose(fp);
<a name="l00216"></a>00216 <span class="preprocessor">#endif</span>
<a name="l00217"></a>00217 <span class="preprocessor"></span>
<a name="l00218"></a>00218 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(sum);
<a name="l00219"></a>00219 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(quo); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(rem);
<a name="l00220"></a>00220 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a>(A,<a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>);
<a name="l00221"></a>00221 <a class="code" href="NormalForms_8c.html#1d5c5fdbd71ebc1eb2ce3f11ce9fbd5f" title="Smith : This function takes a Matrix A of dim n * l as its input and returns the...">Smith</a>((<a class="code" href="structmatrix.html">Matrix</a> *)temp, (<a class="code" href="structmatrix.html">Matrix</a> **)U, (<a class="code" href="structmatrix.html">Matrix</a> **)V, (<a class="code" href="structmatrix.html">Matrix</a> **)Diag);
<a name="l00222"></a>00222 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00223"></a>00223
<a name="l00224"></a>00224 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a> (*U, <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>);
<a name="l00225"></a>00225 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) *U);
<a name="l00226"></a>00226 *U = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00227"></a>00227 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00228"></a>00228
<a name="l00229"></a>00229 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a> (*V, <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>);
<a name="l00230"></a>00230 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)*V);
<a name="l00231"></a>00231 *V = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00232"></a>00232 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00233"></a>00233
<a name="l00234"></a>00234 temp = <a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a> (*Diag, <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>);
<a name="l00235"></a>00235 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)*Diag);
<a name="l00236"></a>00236 *Diag = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00237"></a>00237 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00238"></a>00238
<a name="l00239"></a>00239 temp = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) *U);
<a name="l00240"></a>00240 Uinv = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a> (U[0]->NbRows, U[0]->NbColumns);
<a name="l00241"></a>00241 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>( (<a class="code" href="structmatrix.html">Matrix</a> *) temp, (<a class="code" href="structmatrix.html">Matrix</a> *) Uinv);
<a name="l00242"></a>00242 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) temp);
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keywordflow">for</span> (i = 0; i < U[0]-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++) {
<a name="l00245"></a>00245 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(sum,0);
<a name="l00246"></a>00246 <span class="keywordflow">for</span>(j = 0; j < U[0]-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j ++) {
<a name="l00247"></a>00247 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(sum, Uinv-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j], U[0]-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][U[0]-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l00248"></a>00248 }
<a name="l00249"></a>00249 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][j],sum);
<a name="l00250"></a>00250 }
<a name="l00251"></a>00251 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) Uinv);
<a name="l00252"></a>00252 <span class="keywordflow">for</span>(i = 0; i < U[0]-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00253"></a>00253 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(U[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][U[0]->NbColumns-1],0);
<a name="l00254"></a>00254 <span class="keywordflow">for</span>(i = 0; i < Diag[0]-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++) {
<a name="l00255"></a>00255 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(quo,Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][Diag[0]->NbColumns-1],Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][i]);
<a name="l00256"></a>00256 <a class="code" href="source_2arith_2arithmetique_8h.html#e77f928488d756f77270649775dbdc1d">value_modulus</a>(rem,Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][Diag[0]->NbColumns-1],Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][i]);
<a name="l00257"></a>00257
<a name="l00258"></a>00258 fprintf(stdout,<span class="stringliteral">" pourcent "</span>);
<a name="l00259"></a>00259 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,rem);
<a name="l00260"></a>00260 fprintf(stdout,<span class="stringliteral">" quotient "</span>);
<a name="l00261"></a>00261 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,quo);
<a name="l00262"></a>00262 fprintf(stdout,<span class="stringliteral">" \n"</span>);
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="comment">/* Apparently the % operator is strange when sign are different */</span>
<a name="l00265"></a>00265 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(rem)) {
<a name="l00266"></a>00266 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(rem,rem,Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][i]);
<a name="l00267"></a>00267 <a class="code" href="source_2arith_2arithmetique_8h.html#7e293e9652086118cc5b660e6022767c">value_decrement</a>(quo,quo);
<a name="l00268"></a>00268 };
<a name="l00269"></a>00269 fprintf(stdout,<span class="stringliteral">"apres pourcent "</span>);
<a name="l00270"></a>00270 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,rem);
<a name="l00271"></a>00271 fprintf(stdout,<span class="stringliteral">" quotient "</span>);
<a name="l00272"></a>00272 <a class="code" href="source_2arith_2arithmetique_8h.html#d34605b56b571830b928b50a74d618b7">value_print</a>(stdout,VALUE_FMT,quo);
<a name="l00273"></a>00273 fprintf(stdout,<span class="stringliteral">" \n"</span>);
<a name="l00274"></a>00274 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>( Diag[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][Diag[0]->NbColumns-1],rem);
<a name="l00275"></a>00275 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(V[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][V[0]->NbColumns-1],quo);
<a name="l00276"></a>00276 }
<a name="l00277"></a>00277 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(sum);
<a name="l00278"></a>00278 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(quo); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(rem);
<a name="l00279"></a>00279 <span class="keywordflow">return</span>;
<a name="l00280"></a>00280 } <span class="comment">/* AffineSmith */</span>
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <span class="comment">/*</span>
<a name="l00283"></a>00283 <span class="comment"> * Given a lattice 'A' and a boolean variable 'Forward', homogenise the lattice</span>
<a name="l00284"></a>00284 <span class="comment"> * if 'Forward' is True, otherwise if 'Forward' is False, dehomogenise the </span>
<a name="l00285"></a>00285 <span class="comment"> * lattice 'A'. </span>
<a name="l00286"></a>00286 <span class="comment"> * Algorithm: </span>
<a name="l00287"></a>00287 <span class="comment"> * (1) If Forward == True</span>
<a name="l00288"></a>00288 <span class="comment"> * Put the last row first. </span>
<a name="l00289"></a>00289 <span class="comment"> * Put the last columns first. </span>
<a name="l00290"></a>00290 <span class="comment"> * (2) Else </span>
<a name="l00291"></a>00291 <span class="comment"> * Put the first row last. </span>
<a name="l00292"></a>00292 <span class="comment"> * Put the first column last.</span>
<a name="l00293"></a>00293 <span class="comment"> * (3) Return the result. </span>
<a name="l00294"></a>00294 <span class="comment"> */</span>
<a name="l00295"></a><a class="code" href="Lattice_8h.html#00c3710631cd7f82d65329751095e78b">00295</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#00c3710631cd7f82d65329751095e78b">Homogenise</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> Forward) {
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <a class="code" href="structmatrix.html">Lattice</a> *result;
<a name="l00298"></a>00298
<a name="l00299"></a>00299 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00300"></a>00300 <span class="preprocessor"></span> FILE *fp;
<a name="l00301"></a>00301 fp = fopen(<span class="stringliteral">"_debug"</span>,<span class="stringliteral">"a"</span>);
<a name="l00302"></a>00302 fprintf(fp,<span class="stringliteral">"\nEntered HOMOGENISE \n"</span>);
<a name="l00303"></a>00303 fclose(fp);
<a name="l00304"></a>00304 <span class="preprocessor">#endif</span>
<a name="l00305"></a>00305 <span class="preprocessor"></span>
<a name="l00306"></a>00306 result = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(A);
<a name="l00307"></a>00307 <span class="keywordflow">if</span> (Forward == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a> ) {
<a name="l00308"></a>00308 <a class="code" href="Matop_8c.html#bff6804a65715b1def03cf02c07d138c">PutColumnFirst</a>((<a class="code" href="structmatrix.html">Matrix</a> *)result, A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1);
<a name="l00309"></a>00309 <a class="code" href="Matop_8c.html#b6ddbe687809022ebaf4ff691adbb48d">PutRowFirst</a>((<a class="code" href="structmatrix.html">Matrix</a> *)result, result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1);
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311 <span class="keywordflow">else</span> {
<a name="l00312"></a>00312 <a class="code" href="Matop_8c.html#5912c5c3befc11a92877a93969f359f6">PutColumnLast</a>((<a class="code" href="structmatrix.html">Matrix</a> *)result,0);
<a name="l00313"></a>00313 <a class="code" href="Matop_8c.html#437f63cf9b5f8caea2b5dd4b27f9a28a">PutRowLast</a>((<a class="code" href="structmatrix.html">Matrix</a> *)result,0);
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315 <span class="keywordflow">return</span> result;
<a name="l00316"></a>00316 } <span class="comment">/* Homogenise */</span>
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <span class="comment">/*</span>
<a name="l00319"></a>00319 <span class="comment"> * Given two lattices 'A' and 'B', verify if lattice 'A' is included in 'B' or</span>
<a name="l00320"></a>00320 <span class="comment"> * not. If 'A' is included in 'B' the 'A' intersection 'B', will be 'A'. So, </span>
<a name="l00321"></a>00321 <span class="comment"> * compute 'A' intersection 'B' and check if it is the same as 'A'. </span>
<a name="l00322"></a>00322 <span class="comment"> */</span>
<a name="l00323"></a><a class="code" href="Lattice_8h.html#be494c899b1c641aedcb95fec4719070">00323</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#be494c899b1c641aedcb95fec4719070">LatticeIncludes</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> *B) {
<a name="l00324"></a>00324
<a name="l00325"></a>00325 <a class="code" href="structmatrix.html">Lattice</a> *temp, *UA, *HA;
<a name="l00326"></a>00326 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> flag = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l00327"></a>00327
<a name="l00328"></a>00328 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00329"></a>00329 <span class="preprocessor"></span> FILE *fp;
<a name="l00330"></a>00330 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00331"></a>00331 fprintf(fp,<span class="stringliteral">"\nEntered LATTICE INCLUDES \n"</span>);
<a name="l00332"></a>00332 fclose(fp);
<a name="l00333"></a>00333 <span class="preprocessor">#endif</span>
<a name="l00334"></a>00334 <span class="preprocessor"></span>
<a name="l00335"></a>00335 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(A,&HA,&UA);
<a name="l00336"></a>00336 temp = <a class="code" href="Lattice_8c.html#db689baac30514102da4520b751c199d">LatticeIntersection</a>(B,HA);
<a name="l00337"></a>00337 <span class="keywordflow">if</span> (<a class="code" href="Lattice_8c.html#ec768b41c299f9545319f655a3d2fd1a">sameLattice</a>(temp, HA) == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>)
<a name="l00338"></a>00338 flag = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l00339"></a>00339
<a name="l00340"></a>00340 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)temp);
<a name="l00341"></a>00341 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)UA);
<a name="l00342"></a>00342 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)HA);
<a name="l00343"></a>00343 <span class="keywordflow">return</span> flag;
<a name="l00344"></a>00344 } <span class="comment">/* LatticeIncludes */</span>
<a name="l00345"></a>00345
<a name="l00346"></a>00346 <span class="comment">/*</span>
<a name="l00347"></a>00347 <span class="comment"> * Given two lattices 'A' and 'B', verify if 'A' and 'B' are the same lattice.</span>
<a name="l00348"></a>00348 <span class="comment"> * Algorithm: </span>
<a name="l00349"></a>00349 <span class="comment"> * The Affine Hermite form of two full dimensional matrices are </span>
<a name="l00350"></a>00350 <span class="comment"> * unique. So, take the Affine Hermite form of both 'A' and 'B' and compare the</span>
<a name="l00351"></a>00351 <span class="comment"> * matrices. If they are equal, the function returns True, else it returns </span>
<a name="l00352"></a>00352 <span class="comment"> * False. </span>
<a name="l00353"></a>00353 <span class="comment"> */</span>
<a name="l00354"></a><a class="code" href="Lattice_8h.html#ec768b41c299f9545319f655a3d2fd1a">00354</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#ec768b41c299f9545319f655a3d2fd1a">sameLattice</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> *B) {
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <a class="code" href="structmatrix.html">Lattice</a> *HA, *HB, *UA, *UB;
<a name="l00357"></a>00357 <span class="keywordtype">int</span> i,j;
<a name="l00358"></a>00358 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> result = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l00359"></a>00359
<a name="l00360"></a>00360 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00361"></a>00361 <span class="preprocessor"></span> FILE *fp;
<a name="l00362"></a>00362 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00363"></a>00363 fprintf(fp,<span class="stringliteral">"\nEntered SAME LATTICE \n"</span>);
<a name="l00364"></a>00364 fclose(fp);
<a name="l00365"></a>00365 <span class="preprocessor">#endif</span>
<a name="l00366"></a>00366 <span class="preprocessor"></span>
<a name="l00367"></a>00367 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(A, &HA, &UA);
<a name="l00368"></a>00368 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(B, &HB, &UB);
<a name="l00369"></a>00369
<a name="l00370"></a>00370 <span class="keywordflow">for</span> (i = 0 ; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++)
<a name="l00371"></a>00371 <span class="keywordflow">for</span> (j = 0; j < A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>; j ++)
<a name="l00372"></a>00372 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(HA-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],HB-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j])) {
<a name="l00373"></a>00373 result = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l00374"></a>00374 <span class="keywordflow">break</span>;
<a name="l00375"></a>00375 }
<a name="l00376"></a>00376
<a name="l00377"></a>00377 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) HA);
<a name="l00378"></a>00378 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) HB);
<a name="l00379"></a>00379 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) UA);
<a name="l00380"></a>00380 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) UB);
<a name="l00381"></a>00381
<a name="l00382"></a>00382 <span class="keywordflow">return</span> result;
<a name="l00383"></a>00383 } <span class="comment">/* sameLattice */</span>
<a name="l00384"></a>00384
<a name="l00385"></a>00385 <span class="comment">/*</span>
<a name="l00386"></a>00386 <span class="comment"> * Given a matrix 'A' and an integer 'dimension', do the following: </span>
<a name="l00387"></a>00387 <span class="comment"> * If dimension < A->dimension), output a (dimension * dimension) submatrix of </span>
<a name="l00388"></a>00388 <span class="comment"> * A. Otherwise the output matrix is [A 0][0 ID]. The order if the identity </span>
<a name="l00389"></a>00389 <span class="comment"> * matrix is (dimension - A->dimension). The input matrix is not necessarily </span>
<a name="l00390"></a>00390 <span class="comment"> * a Polylib matrix but the output is a polylib matrix. </span>
<a name="l00391"></a>00391 <span class="comment"> */</span>
<a name="l00392"></a><a class="code" href="Lattice_8h.html#2e1e0a75d5fb3ddf7cac35b0c6ffc75b">00392</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#2e1e0a75d5fb3ddf7cac35b0c6ffc75b">ChangeLatticeDimension</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <span class="keywordtype">int</span> dimension) {
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="keywordtype">int</span> i, j;
<a name="l00395"></a>00395 <a class="code" href="structmatrix.html">Lattice</a> *Result ;
<a name="l00396"></a>00396
<a name="l00397"></a>00397 Result = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(dimension, dimension);
<a name="l00398"></a>00398 <span class="keywordflow">if</span>(dimension <= A->NbRows) {
<a name="l00399"></a>00399 <span class="keywordflow">for</span> (i = 0; i < dimension; i ++)
<a name="l00400"></a>00400 <span class="keywordflow">for</span> (j = 0; j < dimension; j ++)
<a name="l00401"></a>00401 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00402"></a>00402 <span class="keywordflow">return</span> Result;
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++)
<a name="l00405"></a>00405 <span class="keywordflow">for</span> (j = 0; j < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; j ++)
<a name="l00406"></a>00406 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00407"></a>00407
<a name="l00408"></a>00408 <span class="keywordflow">for</span> (i = A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i < dimension; i ++)
<a name="l00409"></a>00409 <span class="keywordflow">for</span> (j = 0; j < dimension; j ++) {
<a name="l00410"></a>00410 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],0);
<a name="l00411"></a>00411 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][i],0);
<a name="l00412"></a>00412 }
<a name="l00413"></a>00413 <span class="keywordflow">for</span> (i = A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i < dimension; i ++)
<a name="l00414"></a>00414 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00415"></a>00415 <span class="keywordflow">return</span> Result;
<a name="l00416"></a>00416 } <span class="comment">/* ChangeLatticeDimension */</span>
<a name="l00417"></a>00417
<a name="l00418"></a>00418 <span class="comment">/* </span>
<a name="l00419"></a>00419 <span class="comment"> * Given an affine lattice 'A', return a matrix of the linear part of the </span>
<a name="l00420"></a>00420 <span class="comment"> * lattice. </span>
<a name="l00421"></a>00421 <span class="comment"> */</span>
<a name="l00422"></a><a class="code" href="Lattice_8h.html#009f469f3f4110d9035d36fa040dd176">00422</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#009f469f3f4110d9035d36fa040dd176">ExtractLinearPart</a>(<a class="code" href="structmatrix.html">Lattice</a> *A) {
<a name="l00423"></a>00423
<a name="l00424"></a>00424 <a class="code" href="structmatrix.html">Lattice</a> *Result;
<a name="l00425"></a>00425 <span class="keywordtype">int</span> i, j;
<a name="l00426"></a>00426 Result = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1, A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1);
<a name="l00427"></a>00427 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00428"></a>00428 <span class="keywordflow">for</span> (j = 0; j < A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j ++)
<a name="l00429"></a>00429 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00430"></a>00430 <span class="keywordflow">return</span> Result;
<a name="l00431"></a>00431 } <span class="comment">/* ExtractLinearPart */</span>
<a name="l00432"></a>00432
<a name="l00433"></a>00433 <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="Lattice_8c.html#31f4d60328a98606b1845899c88e93db">MakeDioEqforInter</a>(<a class="code" href="structmatrix.html">Matrix</a> *A, <a class="code" href="structmatrix.html">Matrix</a> *B);
<a name="l00434"></a>00434
<a name="l00435"></a>00435 <span class="comment">/*</span>
<a name="l00436"></a>00436 <span class="comment"> * Given two lattices 'A' and 'B', return the intersection of the two lattcies.</span>
<a name="l00437"></a>00437 <span class="comment"> * The dimension of 'A' and 'B' should be the same. </span>
<a name="l00438"></a>00438 <span class="comment"> * Algorithm:</span>
<a name="l00439"></a>00439 <span class="comment"> * (1) Verify if the lattcies 'A' and 'B' have the same affine part. </span>
<a name="l00440"></a>00440 <span class="comment"> * If they have same affine part, then only their Linear parts </span>
<a name="l00441"></a>00441 <span class="comment"> * need to be intersected. If they don't have the same affine</span>
<a name="l00442"></a>00442 <span class="comment"> * part then the affine part has to be taken into consideration. </span>
<a name="l00443"></a>00443 <span class="comment"> * For this, homogenise the lattices to get their Hermite Forms</span>
<a name="l00444"></a>00444 <span class="comment"> * and then find their intersection.</span>
<a name="l00445"></a>00445 <span class="comment"> *</span>
<a name="l00446"></a>00446 <span class="comment"> * (2) Step(2) involves, solving the Diophantine Equations in order </span>
<a name="l00447"></a>00447 <span class="comment"> * to extract the intersection of the Lattices. The Diophantine</span>
<a name="l00448"></a>00448 <span class="comment"> * equations are formed taking into consideration whether the </span>
<a name="l00449"></a>00449 <span class="comment"> * affine part has to be included or not. </span>
<a name="l00450"></a>00450 <span class="comment"> *</span>
<a name="l00451"></a>00451 <span class="comment"> * (3) Solve the Diophantine equations. </span>
<a name="l00452"></a>00452 <span class="comment"> *</span>
<a name="l00453"></a>00453 <span class="comment"> * (4) Extract the necessary information from the result. </span>
<a name="l00454"></a>00454 <span class="comment"> * </span>
<a name="l00455"></a>00455 <span class="comment"> * (5) If the lattices have different affine parts and they were </span>
<a name="l00456"></a>00456 <span class="comment"> * homogenised, the result is dehomogenised. </span>
<a name="l00457"></a>00457 <span class="comment"> */</span>
<a name="l00458"></a><a class="code" href="Lattice_8h.html#db689baac30514102da4520b751c199d">00458</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#db689baac30514102da4520b751c199d">LatticeIntersection</a>(<a class="code" href="structmatrix.html">Lattice</a> *X, <a class="code" href="structmatrix.html">Lattice</a> *Y) {
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="keywordtype">int</span> i, j, exist;
<a name="l00461"></a>00461 <a class="code" href="structmatrix.html">Lattice</a> *result = NULL, *U = NULL ;
<a name="l00462"></a>00462 <a class="code" href="structmatrix.html">Lattice</a> *A = NULL, *B = NULL, *H = NULL;
<a name="l00463"></a>00463 <a class="code" href="structmatrix.html">Matrix</a> *fordio;
<a name="l00464"></a>00464 <a class="code" href="structVector.html">Vector</a> *X1 = NULL;
<a name="l00465"></a>00465
<a name="l00466"></a>00466 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00467"></a>00467 <span class="preprocessor"></span> FILE *fp;
<a name="l00468"></a>00468 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00469"></a>00469 fprintf(fp,<span class="stringliteral">"\nEntered LATTICEINTERSECTION \n"</span>);
<a name="l00470"></a>00470 fclose(fp);
<a name="l00471"></a>00471 <span class="preprocessor">#endif</span>
<a name="l00472"></a>00472 <span class="preprocessor"></span>
<a name="l00473"></a>00473 <span class="keywordflow">if</span> (X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != X-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00474"></a>00474 fprintf(stderr, <span class="stringliteral">"\nIn LatticeIntersection : The Input Matrix X is a not a well defined Lattice\n"</span>);
<a name="l00475"></a>00475 <span class="keywordflow">return</span> <a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00476"></a>00476 }
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="keywordflow">if</span> (Y-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != Y-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00479"></a>00479 fprintf (stderr, <span class="stringliteral">"\nIn LatticeIntersection : The Input Matrix Y is a not a well defined Lattice\n"</span>);
<a name="l00480"></a>00480 <span class="keywordflow">return</span> <a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00481"></a>00481 }
<a name="l00482"></a>00482
<a name="l00483"></a>00483 <span class="keywordflow">if</span> (Y-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>) {
<a name="l00484"></a>00484 fprintf (stderr, <span class="stringliteral">"\nIn LatticeIntersection : the input lattices X and Y are of incompatible dimensions\n"</span>);
<a name="l00485"></a>00485 <span class="keywordflow">return</span> <a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00486"></a>00486 }
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="keywordflow">if</span> (<a class="code" href="Matop_8c.html#3f47c6fa59a6178c86d3990bb25af47b">isinHnf</a>(X))
<a name="l00489"></a>00489 A = (<a class="code" href="structmatrix.html">Lattice</a> *) <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(X);
<a name="l00490"></a>00490 <span class="keywordflow">else</span> {
<a name="l00491"></a>00491 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(X, &H, &U);
<a name="l00492"></a>00492 A = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> (H);
<a name="l00493"></a>00493 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) H);
<a name="l00494"></a>00494 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) U);
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <span class="keywordflow">if</span> (<a class="code" href="Matop_8c.html#3f47c6fa59a6178c86d3990bb25af47b">isinHnf</a>(Y))
<a name="l00498"></a>00498 B = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(Y);
<a name="l00499"></a>00499 <span class="keywordflow">else</span> {
<a name="l00500"></a>00500 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(Y, &H, &U);
<a name="l00501"></a>00501 B = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a> (H);
<a name="l00502"></a>00502 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) H);
<a name="l00503"></a>00503 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) U);
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505
<a name="l00506"></a>00506 <span class="keywordflow">if</span> ((<a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a>(A)) || (<a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a> (B))) {
<a name="l00507"></a>00507 result = <a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00508"></a>00508 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) A);
<a name="l00509"></a>00509 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *) B);
<a name="l00510"></a>00510 <span class="keywordflow">return</span> result;
<a name="l00511"></a>00511 }
<a name="l00512"></a>00512 fordio = <a class="code" href="Lattice_8c.html#31f4d60328a98606b1845899c88e93db">MakeDioEqforInter</a> (A, B);
<a name="l00513"></a>00513 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (A);
<a name="l00514"></a>00514 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (B);
<a name="l00515"></a>00515 exist = <a class="code" href="SolveDio_8c.html#0f417a4dacdd52103cc96cbe93e038cb">SolveDiophantine</a>(fordio,(<a class="code" href="structmatrix.html">Matrix</a> **) &U, &X1);
<a name="l00516"></a>00516 <span class="keywordflow">if</span> (exist < 0) { <span class="comment">/* Intersection is NULL */</span>
<a name="l00517"></a>00517 result = (<a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>));
<a name="l00518"></a>00518 <span class="keywordflow">return</span> result;
<a name="l00519"></a>00519 }
<a name="l00520"></a>00520
<a name="l00521"></a>00521 result = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>, X-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00522"></a>00522 <span class="keywordflow">for</span> (i = 0; i < result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00523"></a>00523 <span class="keywordflow">for</span> (j = 0; j < result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j ++)
<a name="l00524"></a>00524 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],U-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="keywordflow">for</span> (i = 0; i < result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l00527"></a>00527 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],X1-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l00528"></a>00528 <span class="keywordflow">for</span> (i = 0; i < result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i ++)
<a name="l00529"></a>00529 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i],0);
<a name="l00530"></a>00530 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],1);
<a name="l00531"></a>00531
<a name="l00532"></a>00532 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) U);
<a name="l00533"></a>00533 <a class="code" href="vector_8c.html#055608d1a3726b7cb26e3e8074764ba0">Vector_Free</a>(X1);
<a name="l00534"></a>00534 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(fordio);
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(result,&H,&U);
<a name="l00537"></a>00537 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)result);
<a name="l00538"></a>00538 result = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(H);
<a name="l00539"></a>00539
<a name="l00540"></a>00540 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) H);
<a name="l00541"></a>00541 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *) U);
<a name="l00542"></a>00542
<a name="l00543"></a>00543 <span class="comment">/* Check whether the Lattice is NULL or not */</span>
<a name="l00544"></a>00544
<a name="l00545"></a>00545 <span class="keywordflow">if</span> (<a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a> (result)) {
<a name="l00546"></a>00546 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> ((<a class="code" href="structmatrix.html">Matrix</a> *)result);
<a name="l00547"></a>00547 <span class="keywordflow">return</span> (<a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a> (X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>));
<a name="l00548"></a>00548 }
<a name="l00549"></a>00549 <span class="keywordflow">return</span> result;
<a name="l00550"></a>00550 } <span class="comment">/* LatticeIntersection */</span>
<a name="l00551"></a>00551
<a name="l00552"></a><a class="code" href="Lattice_8c.html#31f4d60328a98606b1845899c88e93db">00552</a> <span class="keyword">static</span> <a class="code" href="structmatrix.html">Matrix</a> * <a class="code" href="Lattice_8c.html#31f4d60328a98606b1845899c88e93db">MakeDioEqforInter</a> (<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Lattice</a> *B) {
<a name="l00553"></a>00553
<a name="l00554"></a>00554 <a class="code" href="structmatrix.html">Matrix</a> *Dio ;
<a name="l00555"></a>00555 <span class="keywordtype">int</span> i,j;
<a name="l00556"></a>00556
<a name="l00557"></a>00557 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00558"></a>00558 <span class="preprocessor"></span> FILE *fp;
<a name="l00559"></a>00559 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00560"></a>00560 fprintf(fp,<span class="stringliteral">"\nEntered MAKEDIOEQFORINTER \n"</span>);
<a name="l00561"></a>00561 fclose(fp);
<a name="l00562"></a>00562 <span class="preprocessor">#endif</span>
<a name="l00563"></a>00563 <span class="preprocessor"></span>
<a name="l00564"></a>00564 Dio = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(2*(A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1) + 1, 3 * (A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1)+1);
<a name="l00565"></a>00565
<a name="l00566"></a>00566 <span class="keywordflow">for</span> (i = 0; i < Dio-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++)
<a name="l00567"></a>00567 <span class="keywordflow">for</span> (j = 0; j < Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>; j ++)
<a name="l00568"></a>00568 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],0);
<a name="l00569"></a>00569
<a name="l00570"></a>00570 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++) {
<a name="l00571"></a>00571 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l00572"></a>00572 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i+A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i],1);
<a name="l00573"></a>00573 }
<a name="l00574"></a>00574 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1 ; i ++)
<a name="l00575"></a>00575 <span class="keywordflow">for</span> (j = 0; j < A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; j ++) {
<a name="l00576"></a>00576 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j+A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1],A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00577"></a>00577 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i+(A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1)][j+2*(A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1)],B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l00578"></a>00578 }
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="comment">/* Adding the affine part */</span>
<a name="l00581"></a>00581
<a name="l00582"></a>00582 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i++) {
<a name="l00583"></a>00583 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],A-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l00584"></a>00584 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i+A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]) ;
<a name="l00585"></a>00585 }
<a name="l00586"></a>00586 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Dio-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],1);
<a name="l00587"></a>00587 <span class="keywordflow">return</span> Dio;
<a name="l00588"></a>00588 } <span class="comment">/* MakeDioEqforInter */</span>
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#49f5fdc6d7632069efb3d2e194d30a7c">AddLattice</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *,<a class="code" href="structmatrix.html">Matrix</a> *, <a class="code" href="structmatrix.html">Matrix</a> *, <span class="keywordtype">int</span> , <span class="keywordtype">int</span>);
<a name="l00591"></a>00591 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#c6634fecb03e1eff63369bcd63bebfd2">SplitLattice</a>(<a class="code" href="structmatrix.html">Matrix</a> *, <a class="code" href="structmatrix.html">Matrix</a> *, <a class="code" href="structmatrix.html">Matrix</a> *);
<a name="l00592"></a>00592
<a name="l00593"></a>00593
<a name="l00594"></a>00594
<a name="l00595"></a>00595 <span class="comment">/*</span>
<a name="l00596"></a>00596 <span class="comment"> * The function is transforming a lattice X in a union of lattices based on a starting lattice Y.</span>
<a name="l00597"></a>00597 <span class="comment"> * Note1: If the intersection of X and Y lattices is empty the result is identic with the first argument (X) because no operation can be made.</span>
<a name="l00598"></a>00598 <span class="comment"> *Note2: The function is availabe only for simple Lattices and not for a union of Lattices.</span>
<a name="l00599"></a>00599 <span class="comment"></span>
<a name="l00600"></a>00600 <span class="comment"> * Step 1: Find Intersection = LatticeIntersection (A, B).</span>
<a name="l00601"></a>00601 <span class="comment"> * Step 2: Extract the Linear Parts of the Lattices A and Intersection.</span>
<a name="l00602"></a>00602 <span class="comment"> * (while dealing with Basis we only deal with the Linear Parts)</span>
<a name="l00603"></a>00603 <span class="comment"> * Step 3: Let M1 = Basis of A and M2 = Basis of B.</span>
<a name="l00604"></a>00604 <span class="comment"> * Let B1 and B2 be the Basis of A and B respectively, </span>
<a name="l00605"></a>00605 <span class="comment"> * corresponding to the above Theorem.</span>
<a name="l00606"></a>00606 <span class="comment"> * Then we Have B1 = M1 * U1 {a unimodular Matrix }</span>
<a name="l00607"></a>00607 <span class="comment"> * and B2 = M2 * U2. M1 and M2 we know, they are the linear </span>
<a name="l00608"></a>00608 <span class="comment"> * parts we obtained in Step 2. Our Task is now to find U1 and</span>
<a name="l00609"></a>00609 <span class="comment"> * U2. </span>
<a name="l00610"></a>00610 <span class="comment"> * We know that B1 * Delta = B2.</span>
<a name="l00611"></a>00611 <span class="comment"> * i.e. M1 * U1 * Delta = M2 * U2</span>
<a name="l00612"></a>00612 <span class="comment"> * or U1*Delta*U2Inverse = M1Inverse * M2.</span>
<a name="l00613"></a>00613 <span class="comment"> * and Delta is the Diagonal Matrix which satisifies the </span>
<a name="l00614"></a>00614 <span class="comment"> * above properties (in the Theorem).</span>
<a name="l00615"></a>00615 <span class="comment"> * So Delta is nothing but the Smith Normal Form of </span>
<a name="l00616"></a>00616 <span class="comment"> * M1Inverse * M2.</span>
<a name="l00617"></a>00617 <span class="comment"> * So, first we have to find M1Inverse.</span>
<a name="l00618"></a>00618 <span class="comment"> * </span>
<a name="l00619"></a>00619 <span class="comment"> * This Step, involves finding the Inverse of the Matrix M1.</span>
<a name="l00620"></a>00620 <span class="comment"> * We find the Inverse using the Polylib function </span>
<a name="l00621"></a>00621 <span class="comment"> * Matrix_Inverse. There is a catch here, the result of this</span>
<a name="l00622"></a>00622 <span class="comment"> * function is an integral matrix, not necessarily the exact</span>
<a name="l00623"></a>00623 <span class="comment"> * Inverse (since M1 need not be Unimodular), but a multiple</span>
<a name="l00624"></a>00624 <span class="comment"> * of the actual inverse. The number by which we have to divide</span>
<a name="l00625"></a>00625 <span class="comment"> * the matrix, is not obtained here as the input matrix is not</span>
<a name="l00626"></a>00626 <span class="comment"> * a Polylib matrix { We input only the Linear part }. Later I</span>
<a name="l00627"></a>00627 <span class="comment"> * give a way for finding that number.</span>
<a name="l00628"></a>00628 <span class="comment"> *</span>
<a name="l00629"></a>00629 <span class="comment"> * M1Inverse = Matrix_Inverse ( M1 );</span>
<a name="l00630"></a>00630 <span class="comment"> * </span>
<a name="l00631"></a>00631 <span class="comment"> * Step 4 : MtProduct = Matrix_Product (M1Inverse, M2);</span>
<a name="l00632"></a>00632 <span class="comment"> * Step 5 : SmithNormalFrom (MtProduct, Delta, U, V);</span>
<a name="l00633"></a>00633 <span class="comment"> * U1 = U and U2Inverse = V.</span>
<a name="l00634"></a>00634 <span class="comment"> * Step 6 : Find U2 = Matrix_Inverse (U2inverse). Here there is no prob</span>
<a name="l00635"></a>00635 <span class="comment"> * as U1 and its inverse are unimodular.</span>
<a name="l00636"></a>00636 <span class="comment"> * </span>
<a name="l00637"></a>00637 <span class="comment"> * Step 7 : Compute B1 = M1 * U1;</span>
<a name="l00638"></a>00638 <span class="comment"> * Step 8 : Compute B2 = M2 * U2;</span>
<a name="l00639"></a>00639 <span class="comment"> * Step 9 : Earlier when we computed M1Inverse, we knew that it was not</span>
<a name="l00640"></a>00640 <span class="comment"> * the exact inverse but a multiple of it. Now we find the </span>
<a name="l00641"></a>00641 <span class="comment"> * number, such that ( M1Inverse / number ) would give us the </span>
<a name="l00642"></a>00642 <span class="comment"> * exact inverse of M1.</span>
<a name="l00643"></a>00643 <span class="comment"> * We know that B1 * Delta = B2.</span>
<a name="l00644"></a>00644 <span class="comment"> * Let k = B2[0][0] / B1[0][0].</span>
<a name="l00645"></a>00645 <span class="comment"> * Let number = Delta[0][0]/k;</span>
<a name="l00646"></a>00646 <span class="comment"> * This 'number' is the number we want.</span>
<a name="l00647"></a>00647 <span class="comment"> * We Divide the matrix Delta by this number, to get the actual</span>
<a name="l00648"></a>00648 <span class="comment"> * Delta such that B1 * Delta = B2.</span>
<a name="l00649"></a>00649 <span class="comment"> * Step 10 : Call Split Lattice (B1, B2, Delta ).</span>
<a name="l00650"></a>00650 <span class="comment"> * This function returns the Union of Lattices in such a way </span>
<a name="l00651"></a>00651 <span class="comment"> * that B2 is at the Head of this List.</span>
<a name="l00652"></a>00652 <span class="comment"> *</span>
<a name="l00653"></a>00653 <span class="comment"> *If the intersection between X and Y is empty then the result is NULL.</span>
<a name="l00654"></a>00654 <span class="comment"> */</span>
<a name="l00655"></a>00655
<a name="l00656"></a>00656
<a name="l00657"></a><a class="code" href="Lattice_8h.html#020989e31cbf7e9cf32b85c4078fcb65">00657</a> <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#020989e31cbf7e9cf32b85c4078fcb65">Lattice2LatticeUnion</a>(<a class="code" href="structmatrix.html">Lattice</a> *X,<a class="code" href="structmatrix.html">Lattice</a> *Y)
<a name="l00658"></a>00658 {
<a name="l00659"></a>00659 <a class="code" href="structmatrix.html">Lattice</a> *B1 = NULL, *B2 = NULL, *newB1 = NULL, *newB2 = NULL, *Intersection=NULL;
<a name="l00660"></a>00660 <a class="code" href="structmatrix.html">Matrix</a> *U = NULL,*M1 = NULL, *M2 = NULL, *M1Inverse = NULL,*MtProduct = NULL;
<a name="l00661"></a>00661 <a class="code" href="structmatrix.html">Matrix</a> *Vinv, *V , *temp, *DiagMatrix ;
<a name="l00662"></a>00662
<a name="l00663"></a>00663 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head = NULL, *tempHead = NULL;
<a name="l00664"></a>00664 <span class="keywordtype">int</span> i;
<a name="l00665"></a>00665 Value k;
<a name="l00666"></a>00666
<a name="l00667"></a>00667
<a name="l00668"></a>00668 Intersection = <a class="code" href="Lattice_8c.html#db689baac30514102da4520b751c199d">LatticeIntersection</a>(X,Y);
<a name="l00669"></a>00669 <span class="keywordflow">if</span> (<a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a>(Intersection) == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l00670"></a>00670 fprintf(stderr,<span class="stringliteral">"\nIn Lattice2LatticeUnion : the input lattices X and Y do not have any common part\n"</span>);
<a name="l00671"></a>00671 <span class="keywordflow">return</span> NULL;
<a name="l00672"></a>00672 }
<a name="l00673"></a>00673
<a name="l00674"></a>00674 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(k);
<a name="l00675"></a>00675 M1 = (<a class="code" href="structmatrix.html">Matrix</a> *)<a class="code" href="Lattice_8c.html#009f469f3f4110d9035d36fa040dd176">ExtractLinearPart</a>(X);
<a name="l00676"></a>00676 M2 = (<a class="code" href="structmatrix.html">Matrix</a> *)<a class="code" href="Lattice_8c.html#009f469f3f4110d9035d36fa040dd176">ExtractLinearPart</a>(Intersection);
<a name="l00677"></a>00677
<a name="l00678"></a>00678 M1Inverse = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(M1->NbRows,M1->NbColumns);
<a name="l00679"></a>00679 temp = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(M1);
<a name="l00680"></a>00680 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(temp,M1Inverse);
<a name="l00681"></a>00681 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l00682"></a>00682
<a name="l00683"></a>00683 MtProduct = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(M1->NbRows, M1->NbColumns);
<a name="l00684"></a>00684 <a class="code" href="matrix_8c.html#1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a>(M1Inverse,M2,MtProduct) ;
<a name="l00685"></a>00685 <a class="code" href="NormalForms_8c.html#1d5c5fdbd71ebc1eb2ce3f11ce9fbd5f" title="Smith : This function takes a Matrix A of dim n * l as its input and returns the...">Smith</a>(MtProduct, &U, &Vinv, &DiagMatrix);
<a name="l00686"></a>00686 V = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(Vinv-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>,Vinv-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00687"></a>00687 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(Vinv, V);
<a name="l00688"></a>00688 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Vinv);
<a name="l00689"></a>00689 B1 = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(M1->NbRows, U-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00690"></a>00690 B2 = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(M2->NbRows, V-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00691"></a>00691 <a class="code" href="matrix_8c.html#1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a>(M1, U, B1);
<a name="l00692"></a>00692 <a class="code" href="matrix_8c.html#1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a>(M2, V, B2);
<a name="l00693"></a>00693 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M1);
<a name="l00694"></a>00694 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(M2);
<a name="l00695"></a>00695 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(k,B2->p[0][0],B1-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][0]);
<a name="l00696"></a>00696 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(k,DiagMatrix-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][0],k);
<a name="l00697"></a>00697 <span class="keywordflow">for</span> (i = 0; i < DiagMatrix-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++)
<a name="l00698"></a>00698 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(DiagMatrix-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],DiagMatrix-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],k);
<a name="l00699"></a>00699 newB1 = <a class="code" href="Lattice_8c.html#2e1e0a75d5fb3ddf7cac35b0c6ffc75b">ChangeLatticeDimension</a>(B1, B1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> + 1);
<a name="l00700"></a>00700 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(B1);
<a name="l00701"></a>00701 newB2 = <a class="code" href="Lattice_8c.html#2e1e0a75d5fb3ddf7cac35b0c6ffc75b">ChangeLatticeDimension</a>(B2, B2->NbRows +1);
<a name="l00702"></a>00702 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(B2);
<a name="l00703"></a>00703 <span class="keywordflow">for</span>(i = 0; i < newB1->NbRows - 1;i ++)
<a name="l00704"></a>00704 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(newB2->p[i][newB1->NbRows-1],Intersection->p[i][X-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1]);
<a name="l00705"></a>00705 Head = <a class="code" href="Lattice_8c.html#c6634fecb03e1eff63369bcd63bebfd2">SplitLattice</a>(newB1,newB2,DiagMatrix);
<a name="l00706"></a>00706 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(newB1);
<a name="l00707"></a>00707 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(DiagMatrix);
<a name="l00708"></a>00708 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(k);
<a name="l00709"></a>00709 <span class="keywordflow">return</span> Head;
<a name="l00710"></a>00710 }
<a name="l00711"></a>00711
<a name="l00712"></a>00712
<a name="l00713"></a>00713 <span class="comment"></span>
<a name="l00714"></a>00714 <span class="comment">/**</span>
<a name="l00715"></a>00715 <span class="comment"></span>
<a name="l00716"></a>00716 <span class="comment">*** Method : </span>
<a name="l00717"></a>00717 <span class="comment">*** </span>
<a name="l00718"></a>00718 <span class="comment">**/</span>
<a name="l00719"></a>00719 <span class="comment">/* </span>
<a name="l00720"></a>00720 <span class="comment"> * Return the Union of lattices that constitute the difference the lattices </span>
<a name="l00721"></a>00721 <span class="comment"> * 'A' and 'B'. The dimensions of 'A' and 'B' should be the same. </span>
<a name="l00722"></a>00722 <span class="comment"> * Note :</span>
<a name="l00723"></a>00723 <span class="comment"> * Inorder to Find the Difference of Lattices, we make use of</span>
<a name="l00724"></a>00724 <span class="comment"> * the following facts.</span>
<a name="l00725"></a>00725 <span class="comment"> * </span>
<a name="l00726"></a>00726 <span class="comment"> * Theorem : Given Two Lattices L1 and L2, (L2 subset of L1) there exists a</span>
<a name="l00727"></a>00727 <span class="comment"> * Basis B = {b1, b2,..bn} of L1 and integers {a1, a2...,an} such </span>
<a name="l00728"></a>00728 <span class="comment"> * that a1 divides a2, a2 divides a3 and so on and {a1b1, a2b2 ,...,</span>
<a name="l00729"></a>00729 <span class="comment"> * .., anbn} is a Basis of L2. So given this theorem we can express </span>
<a name="l00730"></a>00730 <span class="comment"> * the Lattice L1 in terms of Union of Lattices Involving L2, such </span>
<a name="l00731"></a>00731 <span class="comment"> * that Lattice L1 = B1 = Union of (B2 + i1b1 + i2b2 + .. inbn) such</span>
<a name="l00732"></a>00732 <span class="comment"> * that 0 <= i1 < a1; 0 <= i2 < a2; ....... 0 <= in < an. We also</span>
<a name="l00733"></a>00733 <span class="comment"> * know that A/B = A/(A Intersection B) and that (A Intersection B) </span>
<a name="l00734"></a>00734 <span class="comment"> * is a subset of A. So, Making use of these two facts, we find the </span>
<a name="l00735"></a>00735 <span class="comment"> * A/B. We Split The Lattice A in terms of Lattice (A Int B). From </span>
<a name="l00736"></a>00736 <span class="comment"> * this Union of Lattices Delete the Lattice (A Int B).</span>
<a name="l00737"></a>00737 <span class="comment"> *</span>
<a name="l00738"></a>00738 <span class="comment"> * Algorithm : </span>
<a name="l00739"></a>00739 <span class="comment"> *</span>
<a name="l00740"></a>00740 <span class="comment"> * Step 1: Find Intersection = LatticeIntersection (A, B).</span>
<a name="l00741"></a>00741 <span class="comment"> * Step 2: Extract the Linear Parts of the Lattices A and Intersection.</span>
<a name="l00742"></a>00742 <span class="comment"> * (while dealing with Basis we only deal with the Linear Parts)</span>
<a name="l00743"></a>00743 <span class="comment"> * Step 3: Let M1 = Basis of A and M2 = Basis of B.</span>
<a name="l00744"></a>00744 <span class="comment"> * Let B1 and B2 be the Basis of A and B respectively, </span>
<a name="l00745"></a>00745 <span class="comment"> * corresponding to the above Theorem.</span>
<a name="l00746"></a>00746 <span class="comment"> * Then we Have B1 = M1 * U1 {a unimodular Matrix }</span>
<a name="l00747"></a>00747 <span class="comment"> * and B2 = M2 * U2. M1 and M2 we know, they are the linear </span>
<a name="l00748"></a>00748 <span class="comment"> * parts we obtained in Step 2. Our Task is now to find U1 and</span>
<a name="l00749"></a>00749 <span class="comment"> * U2. </span>
<a name="l00750"></a>00750 <span class="comment"> * We know that B1 * Delta = B2.</span>
<a name="l00751"></a>00751 <span class="comment"> * i.e. M1 * U1 * Delta = M2 * U2</span>
<a name="l00752"></a>00752 <span class="comment"> * or U1*Delta*U2Inverse = M1Inverse * M2.</span>
<a name="l00753"></a>00753 <span class="comment"> * and Delta is the Diagonal Matrix which satisifies the </span>
<a name="l00754"></a>00754 <span class="comment"> * above properties (in the Theorem).</span>
<a name="l00755"></a>00755 <span class="comment"> * So Delta is nothing but the Smith Normal Form of </span>
<a name="l00756"></a>00756 <span class="comment"> * M1Inverse * M2.</span>
<a name="l00757"></a>00757 <span class="comment"> * So, first we have to find M1Inverse.</span>
<a name="l00758"></a>00758 <span class="comment"> * </span>
<a name="l00759"></a>00759 <span class="comment"> * This Step, involves finding the Inverse of the Matrix M1.</span>
<a name="l00760"></a>00760 <span class="comment"> * We find the Inverse using the Polylib function </span>
<a name="l00761"></a>00761 <span class="comment"> * Matrix_Inverse. There is a catch here, the result of this</span>
<a name="l00762"></a>00762 <span class="comment"> * function is an integral matrix, not necessarily the exact</span>
<a name="l00763"></a>00763 <span class="comment"> * Inverse (since M1 need not be Unimodular), but a multiple</span>
<a name="l00764"></a>00764 <span class="comment"> * of the actual inverse. The number by which we have to divide</span>
<a name="l00765"></a>00765 <span class="comment"> * the matrix, is not obtained here as the input matrix is not</span>
<a name="l00766"></a>00766 <span class="comment"> * a Polylib matrix { We input only the Linear part }. Later I</span>
<a name="l00767"></a>00767 <span class="comment"> * give a way for finding that number.</span>
<a name="l00768"></a>00768 <span class="comment"> *</span>
<a name="l00769"></a>00769 <span class="comment"> * M1Inverse = Matrix_Inverse ( M1 );</span>
<a name="l00770"></a>00770 <span class="comment"> * </span>
<a name="l00771"></a>00771 <span class="comment"> * Step 4 : MtProduct = Matrix_Product (M1Inverse, M2);</span>
<a name="l00772"></a>00772 <span class="comment"> * Step 5 : SmithNormalFrom (MtProduct, Delta, U, V);</span>
<a name="l00773"></a>00773 <span class="comment"> * U1 = U and U2Inverse = V.</span>
<a name="l00774"></a>00774 <span class="comment"> * Step 6 : Find U2 = Matrix_Inverse (U2inverse). Here there is no prob</span>
<a name="l00775"></a>00775 <span class="comment"> * as U1 and its inverse are unimodular.</span>
<a name="l00776"></a>00776 <span class="comment"> * </span>
<a name="l00777"></a>00777 <span class="comment"> * Step 7 : Compute B1 = M1 * U1;</span>
<a name="l00778"></a>00778 <span class="comment"> * Step 8 : Compute B2 = M2 * U2;</span>
<a name="l00779"></a>00779 <span class="comment"> * Step 9 : Earlier when we computed M1Inverse, we knew that it was not</span>
<a name="l00780"></a>00780 <span class="comment"> * the exact inverse but a multiple of it. Now we find the </span>
<a name="l00781"></a>00781 <span class="comment"> * number, such that ( M1Inverse / number ) would give us the </span>
<a name="l00782"></a>00782 <span class="comment"> * exact inverse of M1.</span>
<a name="l00783"></a>00783 <span class="comment"> * We know that B1 * Delta = B2.</span>
<a name="l00784"></a>00784 <span class="comment"> * Let k = B2[0][0] / B1[0][0].</span>
<a name="l00785"></a>00785 <span class="comment"> * Let number = Delta[0][0]/k;</span>
<a name="l00786"></a>00786 <span class="comment"> * This 'number' is the number we want.</span>
<a name="l00787"></a>00787 <span class="comment"> * We Divide the matrix Delta by this number, to get the actual</span>
<a name="l00788"></a>00788 <span class="comment"> * Delta such that B1 * Delta = B2.</span>
<a name="l00789"></a>00789 <span class="comment"> * Step 10 : Call Split Lattice (B1, B2, Delta ).</span>
<a name="l00790"></a>00790 <span class="comment"> * This function returns the Union of Lattices in such a way </span>
<a name="l00791"></a>00791 <span class="comment"> * that B2 is at the Head of this List.</span>
<a name="l00792"></a>00792 <span class="comment"> * Step 11 : To Remove B2 From the list of the Union of Lattices.</span>
<a name="l00793"></a>00793 <span class="comment"> * Head = Head->next;</span>
<a name="l00794"></a>00794 <span class="comment"> * Step 12 : Free the Memory that is now not needed and return Head.</span>
<a name="l00795"></a>00795 <span class="comment"> *</span>
<a name="l00796"></a>00796 <span class="comment"> */</span>
<a name="l00797"></a><a class="code" href="Lattice_8h.html#31fa008ccc3304ba29e3167b17c61b70">00797</a> <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#31fa008ccc3304ba29e3167b17c61b70" title="Method :.">LatticeDifference</a>(<a class="code" href="structmatrix.html">Lattice</a> *A,<a class="code" href="structmatrix.html">Lattice</a> *B) {
<a name="l00798"></a>00798
<a name="l00799"></a>00799 <a class="code" href="structmatrix.html">Lattice</a> *Intersection = NULL;
<a name="l00800"></a>00800 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head = NULL, *tempHead = NULL;
<a name="l00801"></a>00801 <a class="code" href="structmatrix.html">Matrix</a> *H , *U1 , *X, *Y ;
<a name="l00802"></a>00802
<a name="l00803"></a>00803 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00804"></a>00804 <span class="preprocessor"></span> FILE *fp;
<a name="l00805"></a>00805 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00806"></a>00806 fprintf(fp,<span class="stringliteral">"\nEntered LATTICEDIFFERENCE \n"</span>);
<a name="l00807"></a>00807 fclose(fp);
<a name="l00808"></a>00808 <span class="preprocessor">#endif</span>
<a name="l00809"></a>00809 <span class="preprocessor"></span>
<a name="l00810"></a>00810 <span class="keywordflow">if</span> (A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00811"></a>00811 fprintf(stderr,<span class="stringliteral">"\nIn LatticeDifference : The Input Matrix A is not a proper Lattice \n"</span>);
<a name="l00812"></a>00812 <span class="keywordflow">return</span> NULL;
<a name="l00813"></a>00813 }
<a name="l00814"></a>00814
<a name="l00815"></a>00815 <span class="keywordflow">if</span> (B-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != B-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00816"></a>00816 fprintf(stderr,<span class="stringliteral">"\nIn LatticeDifference : The Input Matrix B is not a proper Lattice \n"</span>);
<a name="l00817"></a>00817 <span class="keywordflow">return</span> NULL;
<a name="l00818"></a>00818 }
<a name="l00819"></a>00819
<a name="l00820"></a>00820 <span class="keywordflow">if</span> (A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != B-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>) {
<a name="l00821"></a>00821 fprintf(stderr,<span class="stringliteral">"\nIn Lattice Difference : The Input Lattices A and B have "</span>);
<a name="l00822"></a>00822 fprintf(stderr,<span class="stringliteral">"incompatible dimensions \n"</span>);
<a name="l00823"></a>00823 <span class="keywordflow">return</span> NULL;
<a name="l00824"></a>00824 }
<a name="l00825"></a>00825
<a name="l00826"></a>00826 <span class="keywordflow">if</span> (<a class="code" href="Matop_8c.html#3f47c6fa59a6178c86d3990bb25af47b">isinHnf</a> (A) != <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l00827"></a>00827 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(A,&H,&U1);
<a name="l00828"></a>00828 X = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(H);
<a name="l00829"></a>00829 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(U1);
<a name="l00830"></a>00830 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(H);
<a name="l00831"></a>00831 }
<a name="l00832"></a>00832 <span class="keywordflow">else</span>
<a name="l00833"></a>00833 X = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(A);
<a name="l00834"></a>00834
<a name="l00835"></a>00835 <span class="keywordflow">if</span> (<a class="code" href="Matop_8c.html#3f47c6fa59a6178c86d3990bb25af47b">isinHnf</a>(B) != <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l00836"></a>00836 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(B,&H,&U1);
<a name="l00837"></a>00837 Y = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(H);
<a name="l00838"></a>00838 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(H);
<a name="l00839"></a>00839 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(U1);
<a name="l00840"></a>00840 }
<a name="l00841"></a>00841 <span class="keywordflow">else</span>
<a name="l00842"></a>00842 Y = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(B);
<a name="l00843"></a>00843 <span class="keywordflow">if</span> (<a class="code" href="Lattice_8c.html#7a9a551062ace0251e9bb0ea6b74c860">isEmptyLattice</a>(X)) {
<a name="l00844"></a>00844 <span class="keywordflow">return</span> NULL;
<a name="l00845"></a>00845 }
<a name="l00846"></a>00846
<a name="l00847"></a>00847 Head=<a class="code" href="Lattice_8c.html#020989e31cbf7e9cf32b85c4078fcb65">Lattice2LatticeUnion</a>(X,Y);
<a name="l00848"></a>00848
<a name="l00849"></a>00849 <span class="comment">/* If the spliting operation can't be done the result is X. */</span>
<a name="l00850"></a>00850
<a name="l00851"></a>00851 <span class="keywordflow">if</span> (Head == NULL) {
<a name="l00852"></a>00852 Head = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l00853"></a>00853 Head-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(X);
<a name="l00854"></a>00854 Head-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = NULL;
<a name="l00855"></a>00855 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(X);
<a name="l00856"></a>00856 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Y);
<a name="l00857"></a>00857 <span class="keywordflow">return</span> Head;
<a name="l00858"></a>00858 }
<a name="l00859"></a>00859
<a name="l00860"></a>00860 tempHead = Head;
<a name="l00861"></a>00861 Head = Head-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l00862"></a>00862 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (tempHead->M);
<a name="l00863"></a>00863 tempHead->next = NULL;
<a name="l00864"></a>00864 free(tempHead);
<a name="l00865"></a>00865
<a name="l00866"></a>00866 <span class="keywordflow">if</span> ((Head != NULL))
<a name="l00867"></a>00867 Head = <a class="code" href="Lattice_8c.html#bcae5a642b26c67f65db8de16cca6064">LatticeSimplify</a> (Head);
<a name="l00868"></a>00868 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (X);
<a name="l00869"></a>00869 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (Y);
<a name="l00870"></a>00870
<a name="l00871"></a>00871 <span class="keywordflow">return</span> Head;
<a name="l00872"></a>00872 } <span class="comment">/* LatticeDifference */</span>
<a name="l00873"></a>00873
<a name="l00874"></a>00874
<a name="l00875"></a>00875 <span class="comment">/*</span>
<a name="l00876"></a>00876 <span class="comment"> * Given a Lattice 'B1' and a Lattice 'B2' and a Diagonal Matrix 'C' such that</span>
<a name="l00877"></a>00877 <span class="comment"> * 'B2' is a subset of 'B1' and C[0][0] divides C[1][1], C[1][1] divides C[2]</span>
<a name="l00878"></a>00878 <span class="comment"> * [2] and so on, output the list of matrices whose union is B1. The function</span>
<a name="l00879"></a>00879 <span class="comment"> * expresses the Lattice B1 in terms of B2 Unions of B1 = Union of {B2 + i0b0 +</span>
<a name="l00880"></a>00880 <span class="comment"> * i1b1 + .... + inbn} where 0 <= i0 < C[0][0]; 0 <= i1 < C[1][1] and so on and</span>
<a name="l00881"></a>00881 <span class="comment"> * {b0 ... bn} are the columns of Lattice B1. The list is so formed that the </span>
<a name="l00882"></a>00882 <span class="comment"> * Lattice B2 is the Head of the list. </span>
<a name="l00883"></a>00883 <span class="comment"> */</span>
<a name="l00884"></a><a class="code" href="Lattice_8c.html#c6634fecb03e1eff63369bcd63bebfd2">00884</a> <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#c6634fecb03e1eff63369bcd63bebfd2">SplitLattice</a>(<a class="code" href="structmatrix.html">Lattice</a> *B1, <a class="code" href="structmatrix.html">Lattice</a> *B2, <a class="code" href="structmatrix.html">Matrix</a> *C) {
<a name="l00885"></a>00885
<a name="l00886"></a>00886 <span class="keywordtype">int</span> i;
<a name="l00887"></a>00887
<a name="l00888"></a>00888 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head = NULL;
<a name="l00889"></a>00889 Head = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l00890"></a>00890 Head-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = (<a class="code" href="structmatrix.html">Lattice</a> *)B2;
<a name="l00891"></a>00891 Head-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = NULL;
<a name="l00892"></a>00892 <span class="keywordflow">for</span> (i = 0; i < C-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; i++)
<a name="l00893"></a>00893 <a class="code" href="Lattice_8c.html#49f5fdc6d7632069efb3d2e194d30a7c">AddLattice</a>(Head,B1,B2,VALUE_TO_INT(C-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]),i);
<a name="l00894"></a>00894 <span class="keywordflow">return</span> Head;
<a name="l00895"></a>00895 } <span class="comment">/* SplitLattice */</span>
<a name="l00896"></a>00896
<a name="l00897"></a>00897 <span class="comment">/*</span>
<a name="l00898"></a>00898 <span class="comment"> * Given lattices 'B1' and 'B2', an integer 'NumofTimes', a column number </span>
<a name="l00899"></a>00899 <span class="comment"> * 'Colnumber' and a pointer to a list of lattices, the function does the </span>
<a name="l00900"></a>00900 <span class="comment"> * following :-</span>
<a name="l00901"></a>00901 <span class="comment"> * For every lattice in the list, it adds a set of lattices such that the </span>
<a name="l00902"></a>00902 <span class="comment"> * affine part of the new lattices is greater than the original lattice by 0 to</span>
<a name="l00903"></a>00903 <span class="comment"> * NumofTimes-1 * {the (ColumnNumber)-th column of B1}. </span>
<a name="l00904"></a>00904 <span class="comment"> * Note : </span>
<a name="l00905"></a>00905 <span class="comment"> * Three pointers are defined to point at various points of the list. They are:</span>
<a name="l00906"></a>00906 <span class="comment"> * Head -> It always points to the head of the list. </span>
<a name="l00907"></a>00907 <span class="comment"> * tail -> It always points to the last element in the list. </span>
<a name="l00908"></a>00908 <span class="comment"> * marker -> It points to the element, which is the last element of the Input </span>
<a name="l00909"></a>00909 <span class="comment"> * list.</span>
<a name="l00910"></a>00910 <span class="comment"> */</span>
<a name="l00911"></a><a class="code" href="Lattice_8c.html#49f5fdc6d7632069efb3d2e194d30a7c">00911</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#49f5fdc6d7632069efb3d2e194d30a7c">AddLattice</a> (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head, <a class="code" href="structmatrix.html">Matrix</a> *B1, <a class="code" href="structmatrix.html">Matrix</a> *B2, <span class="keywordtype">int</span> NumofTimes, <span class="keywordtype">int</span> Colnumber) {
<a name="l00912"></a>00912
<a name="l00913"></a>00913 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp, *tail, *marker;
<a name="l00914"></a>00914 <span class="keywordtype">int</span> i,j;
<a name="l00915"></a>00915 Value tmp;
<a name="l00916"></a>00916
<a name="l00917"></a>00917 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l00918"></a>00918 tail = Head;
<a name="l00919"></a>00919 <span class="keywordflow">while</span> (tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> != NULL)
<a name="l00920"></a>00920 tail = tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l00921"></a>00921 marker = tail;
<a name="l00922"></a>00922
<a name="l00923"></a>00923 <span class="keywordflow">for</span>(temp = Head; temp != NULL; temp=temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>) {
<a name="l00924"></a>00924 <span class="keywordflow">for</span> (i = 1; i < NumofTimes; i++) {
<a name="l00925"></a>00925 <a class="code" href="structmatrix.html">Lattice</a> *tempMatrix, *H, *U;
<a name="l00926"></a>00926
<a name="l00927"></a>00927 tempMatrix = (<a class="code" href="structmatrix.html">Lattice</a> *)<a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>);
<a name="l00928"></a>00928 <span class="keywordflow">for</span> (j = 0; j < B2-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; j++) {
<a name="l00929"></a>00929 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(tmp,i);
<a name="l00930"></a>00930 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(tempMatrix-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][B2-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1], tmp, B1-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][Colnumber]);
<a name="l00931"></a>00931 }
<a name="l00932"></a>00932 tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l00933"></a>00933 <a class="code" href="Lattice_8c.html#4d75ea3bed92d944fc4be0ec7e08bd15">AffineHermite</a>(tempMatrix,&H,&U);
<a name="l00934"></a>00934 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>((<a class="code" href="structmatrix.html">Matrix</a> *)tempMatrix);
<a name="l00935"></a>00935 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(U);
<a name="l00936"></a>00936 tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = H;
<a name="l00937"></a>00937 tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>=NULL;
<a name="l00938"></a>00938 tail = tail-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l00939"></a>00939 }
<a name="l00940"></a>00940 <span class="keywordflow">if</span> (temp == marker)
<a name="l00941"></a>00941 <span class="keywordflow">break</span>;
<a name="l00942"></a>00942 }
<a name="l00943"></a>00943 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l00944"></a>00944 <span class="keywordflow">return</span>;
<a name="l00945"></a>00945 } <span class="comment">/* AddLattice */</span>
<a name="l00946"></a>00946
<a name="l00947"></a>00947 <span class="comment">/* </span>
<a name="l00948"></a>00948 <span class="comment"> * Given a polyhedron 'A', store the Hermite basis 'B' and return the true </span>
<a name="l00949"></a>00949 <span class="comment"> * dimension of the polyhedron 'A'. </span>
<a name="l00950"></a>00950 <span class="comment"> * Algorithm : </span>
<a name="l00951"></a>00951 <span class="comment"> *</span>
<a name="l00952"></a>00952 <span class="comment"> * 1) First we find all the vertices of the Polyhedron A.</span>
<a name="l00953"></a>00953 <span class="comment"> * Now suppose the vertices are [v1, v2...vn], then </span>
<a name="l00954"></a>00954 <span class="comment"> * a particular set of vectors governing the space of A are </span>
<a name="l00955"></a>00955 <span class="comment"> * given by [v1-v2, v1-v3, ... v1-vn] (let us say V).</span>
<a name="l00956"></a>00956 <span class="comment"> * So we initially calculate these vectors.</span>
<a name="l00957"></a>00957 <span class="comment"> * 2) Then there are the rays and lines which contribute to the</span>
<a name="l00958"></a>00958 <span class="comment"> * space in which A is going to lie.</span>
<a name="l00959"></a>00959 <span class="comment"> * So we append to the rays and lines. So now we get a matrix</span>
<a name="l00960"></a>00960 <span class="comment"> * {These are the rows} [ V ] [l1] [l2]...[lk] </span>
<a name="l00961"></a>00961 <span class="comment"> * where l1 to lk are either rays or lines of the Polyhedron A.</span>
<a name="l00962"></a>00962 <span class="comment"> * 3) The above matrix is the set of vectors which determine</span>
<a name="l00963"></a>00963 <span class="comment"> * the space in which A is going to lie.</span>
<a name="l00964"></a>00964 <span class="comment"> * Using this matrix we find a Basis which is such that</span>
<a name="l00965"></a>00965 <span class="comment"> * the first 'm' columns of it determine the space of A. </span>
<a name="l00966"></a>00966 <span class="comment"> * 4) But we also have to ensure that in the last 'n-m' </span>
<a name="l00967"></a>00967 <span class="comment"> * coordinates the Polyhedron is '0', this is done by</span>
<a name="l00968"></a>00968 <span class="comment"> * taking the image by B(inv) of A and finding the remaining</span>
<a name="l00969"></a>00969 <span class="comment"> * equalities, and composing it with the matrix B, so as</span>
<a name="l00970"></a>00970 <span class="comment"> * to get a new matrix which is the actual Hermite Basis of</span>
<a name="l00971"></a>00971 <span class="comment"> * the Polyhedron.</span>
<a name="l00972"></a>00972 <span class="comment"> */</span>
<a name="l00973"></a><a class="code" href="Lattice_8h.html#ee5cf58a5c79a49ada7909b84440499a">00973</a> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#ee5cf58a5c79a49ada7909b84440499a">FindHermiteBasisofDomain</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *A, <a class="code" href="structmatrix.html">Matrix</a> **B) {
<a name="l00974"></a>00974
<a name="l00975"></a>00975 <span class="keywordtype">int</span> i, j;
<a name="l00976"></a>00976 <a class="code" href="structmatrix.html">Matrix</a> *temp,*temp1, *tempinv, *Newmat ;
<a name="l00977"></a>00977 <a class="code" href="structmatrix.html">Matrix</a> *vert, *rays, *result;
<a name="l00978"></a>00978 <a class="code" href="structpolyhedron.html">Polyhedron</a> *Image;
<a name="l00979"></a>00979 <span class="keywordtype">int</span> rank, equcount ;
<a name="l00980"></a>00980 <span class="keywordtype">int</span> noofvertices = 0, noofrays = 0;
<a name="l00981"></a>00981 <span class="keywordtype">int</span> vercount , raycount;
<a name="l00982"></a>00982 Value lcm, fact;
<a name="l00983"></a>00983
<a name="l00984"></a>00984 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l00985"></a>00985 <span class="preprocessor"></span> FILE *fp;
<a name="l00986"></a>00986 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l00987"></a>00987 fprintf(fp,<span class="stringliteral">"\nEntered FINDHERMITEBASISOFDOMAIN \n"</span>);
<a name="l00988"></a>00988 fclose(fp);
<a name="l00989"></a>00989 <span class="preprocessor">#endif</span>
<a name="l00990"></a>00990 <span class="preprocessor"></span>
<a name="l00991"></a>00991 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(A);
<a name="l00992"></a>00992 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(A);
<a name="l00993"></a>00993
<a name="l00994"></a>00994 <span class="comment">/* Checking is empty */</span>
<a name="l00995"></a>00995 <span class="keywordflow">if</span> (<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(A)) {
<a name="l00996"></a>00996 B[0] = <a class="code" href="Matop_8c.html#c886b07103118bccddf1693e2bb9655f">Identity</a>(A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1);
<a name="l00997"></a>00997 <span class="keywordflow">return</span>(-1);
<a name="l00998"></a>00998 }
<a name="l00999"></a>00999
<a name="l01000"></a>01000 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(lcm); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(fact);
<a name="l01001"></a>01001 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(lcm,1);
<a name="l01002"></a>01002
<a name="l01003"></a>01003 <span class="comment">/* Finding the Vertices */</span>
<a name="l01004"></a>01004 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>; i++)
<a name="l01005"></a>01005 <span class="keywordflow">if</span> ((<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][0])) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]))
<a name="l01006"></a>01006 noofvertices++;
<a name="l01007"></a>01007 <span class="keywordflow">else</span>
<a name="l01008"></a>01008 noofrays ++;
<a name="l01009"></a>01009
<a name="l01010"></a>01010 vert = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(noofvertices,A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1);
<a name="l01011"></a>01011 rays = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(noofrays,A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>);
<a name="l01012"></a>01012 vercount = 0;
<a name="l01013"></a>01013 raycount = 0;
<a name="l01014"></a>01014
<a name="l01015"></a>01015 <span class="keywordflow">for</span>(i = 0; i < A-><a class="code" href="structpolyhedron.html#74cba037f5ac1c7182bf960d79d3f124">NbRays</a>; i++) {
<a name="l01016"></a>01016 <span class="keywordflow">if</span> ((<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][0])) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1])) {
<a name="l01017"></a>01017 <span class="keywordflow">for</span>(j = 1; j < A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2; j++)
<a name="l01018"></a>01018 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[vercount][j-1],A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][j]);
<a name="l01019"></a>01019 <a class="code" href="source_2arith_2arithmetique_8h.html#6da13dbfdd065b7609591ff6b3aee310">value_lcm</a>(lcm, lcm, A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][j-1]);
<a name="l01020"></a>01020 vercount++;
<a name="l01021"></a>01021 }
<a name="l01022"></a>01022 <span class="keywordflow">else</span> {
<a name="l01023"></a>01023 <span class="keywordflow">for</span> (j = 1; j < A-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1; j++)
<a name="l01024"></a>01024 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(rays-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[raycount][j-1],A-><a class="code" href="structpolyhedron.html#1332db86327e189effc8798ab230f36a">Ray</a>[i][j]);
<a name="l01025"></a>01025 raycount++;
<a name="l01026"></a>01026 }
<a name="l01027"></a>01027 }
<a name="l01028"></a>01028
<a name="l01029"></a>01029 <span class="comment">/* Multiplying the rows by the lcm */</span>
<a name="l01030"></a>01030 <span class="keywordflow">for</span>(i = 0; i < vert-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++) {
<a name="l01031"></a>01031 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(fact,lcm,vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][vert-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01032"></a>01032 <span class="keywordflow">for</span> (j = 0; j < vert-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j++)
<a name="l01033"></a>01033 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],fact);
<a name="l01034"></a>01034 }
<a name="l01035"></a>01035
<a name="l01036"></a>01036 <span class="comment">/* Drop the Last Columns */</span>
<a name="l01037"></a>01037 temp = <a class="code" href="Matop_8c.html#7866f34e302caaf90becd08b1245c126">RemoveColumn</a>(vert,vert-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1);
<a name="l01038"></a>01038 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(vert);
<a name="l01039"></a>01039
<a name="l01040"></a>01040 <span class="comment">/* Getting the Vectors */</span>
<a name="l01041"></a>01041 vert = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(temp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1, temp-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01042"></a>01042 <span class="keywordflow">for</span> (i = 1; i < temp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++)
<a name="l01043"></a>01043 <span class="keywordflow">for</span> (j = 0; j < temp-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> ; j++)
<a name="l01044"></a>01044 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i-1][j],temp-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][j],temp-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l01045"></a>01045
<a name="l01046"></a>01046 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l01047"></a>01047
<a name="l01048"></a>01048 <span class="comment">/* Add the Rays and Lines */</span>
<a name="l01049"></a>01049 <span class="comment">/* Combined Matrix */</span>
<a name="l01050"></a>01050 result = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(vert-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>+rays-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>, vert-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01051"></a>01051 <span class="keywordflow">for</span> (i = 0; i < vert-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++)
<a name="l01052"></a>01052 <span class="keywordflow">for</span> (j = 0 ;j < result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> ; j++)
<a name="l01053"></a>01053 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],vert-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l01054"></a>01054
<a name="l01055"></a>01055 <span class="keywordflow">for</span> (; i<result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++)
<a name="l01056"></a>01056 <span class="keywordflow">for</span> (j = 0; j < result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>; j++)
<a name="l01057"></a>01057 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],rays-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i-vert-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>][j]);
<a name="l01058"></a>01058
<a name="l01059"></a>01059 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(vert);
<a name="l01060"></a>01060 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(rays);
<a name="l01061"></a>01061
<a name="l01062"></a>01062 rank = <a class="code" href="Matop_8c.html#d77e679cec7ff5e82f9d09d52e92db06">findHermiteBasis</a>(result, &temp);
<a name="l01063"></a>01063 temp1 = <a class="code" href="Lattice_8c.html#2e1e0a75d5fb3ddf7cac35b0c6ffc75b">ChangeLatticeDimension</a>(temp,temp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>+1);
<a name="l01064"></a>01064
<a name="l01065"></a>01065 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(result);
<a name="l01066"></a>01066 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l01067"></a>01067
<a name="l01068"></a>01068 <span class="comment">/* Adding the Affine Part to take care of the Equalities */</span>
<a name="l01069"></a>01069 temp = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(temp1);
<a name="l01070"></a>01070 tempinv = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(temp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>,temp-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01071"></a>01071 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(temp,tempinv);
<a name="l01072"></a>01072 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l01073"></a>01073 Image = <a class="code" href="polyhedron_8c.html#8b92d94a0a1cbd47b98e9f72f34c43eb">DomainImage</a>(A,tempinv,<a class="code" href="types_8h.html#7a3726264ecf2f0985882e0c1adb4ddb">MAXNOOFRAYS</a>);
<a name="l01074"></a>01074 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(tempinv);
<a name="l01075"></a>01075 Newmat = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(temp1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>,temp1-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01076"></a>01076 <span class="keywordflow">for</span>(i = 0; i < rank ; i++)
<a name="l01077"></a>01077 <span class="keywordflow">for</span>(j = 0; j < Newmat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> ; j++)
<a name="l01078"></a>01078 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Newmat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],0);
<a name="l01079"></a>01079 <span class="keywordflow">for</span>(i = 0; i < rank; i++)
<a name="l01080"></a>01080 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Newmat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l01081"></a>01081 equcount = 0;
<a name="l01082"></a>01082 <span class="keywordflow">for</span> (i = 0; i < Image-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>; i ++)
<a name="l01083"></a>01083 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(Image-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][0])) {
<a name="l01084"></a>01084 <span class="keywordflow">for</span> (j = 1; j<Image-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+2; j ++)
<a name="l01085"></a>01085 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Newmat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[rank+equcount][j-1],Image-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[i][j]);
<a name="l01086"></a>01086 ++equcount ;
<a name="l01087"></a>01087 }
<a name="l01088"></a>01088 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(Image);
<a name="l01089"></a>01089 <span class="keywordflow">for</span> (i = 0; i < Newmat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i++)
<a name="l01090"></a>01090 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Newmat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Newmat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i],0);
<a name="l01091"></a>01091 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Newmat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Newmat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][Newmat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],1);
<a name="l01092"></a>01092 temp = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(Newmat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>, Newmat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01093"></a>01093 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(Newmat,temp);
<a name="l01094"></a>01094 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Newmat);
<a name="l01095"></a>01095 B[0] = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(temp1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>,temp-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01096"></a>01096
<a name="l01097"></a>01097 <a class="code" href="matrix_8c.html#1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a>(temp1,temp,B[0]);
<a name="l01098"></a>01098 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp1);
<a name="l01099"></a>01099 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l01100"></a>01100 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(lcm);
<a name="l01101"></a>01101 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(fact);
<a name="l01102"></a>01102 <span class="keywordflow">return</span> rank;
<a name="l01103"></a>01103 } <span class="comment">/* FindHermiteBasisofDomain */</span>
<a name="l01104"></a>01104
<a name="l01105"></a>01105 <span class="comment">/*</span>
<a name="l01106"></a>01106 <span class="comment"> * Return the image of a lattice 'A' by the invertible, affine, rational </span>
<a name="l01107"></a>01107 <span class="comment"> * function 'M'. </span>
<a name="l01108"></a>01108 <span class="comment"> */</span>
<a name="l01109"></a><a class="code" href="Lattice_8h.html#c67608cf4d08c51aa76da79051507fd4">01109</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#c67608cf4d08c51aa76da79051507fd4">LatticeImage</a>(<a class="code" href="structmatrix.html">Lattice</a> *A, <a class="code" href="structmatrix.html">Matrix</a> *M) {
<a name="l01110"></a>01110
<a name="l01111"></a>01111 <a class="code" href="structmatrix.html">Lattice</a> *Img, *temp, *Minv;
<a name="l01112"></a>01112
<a name="l01113"></a>01113 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l01114"></a>01114 <span class="preprocessor"></span> FILE *fp;
<a name="l01115"></a>01115 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l01116"></a>01116 fprintf(fp, <span class="stringliteral">"\nEntered LATTICEIMAGE \n"</span>);
<a name="l01117"></a>01117 fclose(fp);
<a name="l01118"></a>01118 <span class="preprocessor">#endif</span>
<a name="l01119"></a>01119 <span class="preprocessor"></span>
<a name="l01120"></a>01120 <span class="keywordflow">if</span> ((A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>) || (M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != M-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>))
<a name="l01121"></a>01121 <span class="keywordflow">return</span> (<a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a> (A-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>));
<a name="l01122"></a>01122
<a name="l01123"></a>01123 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#61db0ba9ba925615ec70eb92e40b9ef4">value_one_p</a>(M-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][M-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1])) {
<a name="l01124"></a>01124 Img = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a> ( M-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>, A-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> );
<a name="l01125"></a>01125 <a class="code" href="matrix_8c.html#1e967c74adaa2eec868fd737a55b6624">Matrix_Product</a> (M,A,Img);
<a name="l01126"></a>01126 <span class="keywordflow">return</span> Img;
<a name="l01127"></a>01127 }
<a name="l01128"></a>01128 temp = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(M);
<a name="l01129"></a>01129 Minv = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(temp-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>, temp-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l01130"></a>01130 <a class="code" href="matrix_8c.html#97aa755c011357ce2146d71ddb88ded6">Matrix_Inverse</a>(temp, Minv);
<a name="l01131"></a>01131 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp);
<a name="l01132"></a>01132
<a name="l01133"></a>01133 Img = <a class="code" href="Lattice_8c.html#0c4b5df1248325964344c44d1b3b93ed">LatticePreimage</a>(A, Minv);
<a name="l01134"></a>01134 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (Minv);
<a name="l01135"></a>01135 <span class="keywordflow">return</span> Img;
<a name="l01136"></a>01136 } <span class="comment">/* LatticeImage */</span>
<a name="l01137"></a>01137
<a name="l01138"></a>01138 <span class="comment">/* </span>
<a name="l01139"></a>01139 <span class="comment"> * Return the preimage of a lattice 'L' by an affine, rational function 'G'.</span>
<a name="l01140"></a>01140 <span class="comment"> * Algorithm: </span>
<a name="l01141"></a>01141 <span class="comment"> * (1) Prepare Diophantine equation :</span>
<a name="l01142"></a>01142 <span class="comment"> * [Gl -Ll][x y] = [Ga -La]{"l-linear, a-affine"}</span>
<a name="l01143"></a>01143 <span class="comment"> * (2) Solve the Diophantine equations.</span>
<a name="l01144"></a>01144 <span class="comment"> * (3) If there is solution to the Diophantine eq., extract the </span>
<a name="l01145"></a>01145 <span class="comment"> * general solution and the particular solution of x and that </span>
<a name="l01146"></a>01146 <span class="comment"> * forms the preimage of 'L' by 'G'. </span>
<a name="l01147"></a>01147 <span class="comment"> */</span>
<a name="l01148"></a><a class="code" href="Lattice_8h.html#0c4b5df1248325964344c44d1b3b93ed">01148</a> <a class="code" href="structmatrix.html">Lattice</a> *<a class="code" href="Lattice_8c.html#0c4b5df1248325964344c44d1b3b93ed">LatticePreimage</a>(<a class="code" href="structmatrix.html">Lattice</a> *L, <a class="code" href="structmatrix.html">Matrix</a> *G) {
<a name="l01149"></a>01149
<a name="l01150"></a>01150 <a class="code" href="structmatrix.html">Matrix</a> *Dio, *U ;
<a name="l01151"></a>01151 <a class="code" href="structmatrix.html">Lattice</a> *Result;
<a name="l01152"></a>01152 <a class="code" href="structVector.html">Vector</a> *X;
<a name="l01153"></a>01153 <span class="keywordtype">int</span> i,j;
<a name="l01154"></a>01154 <span class="keywordtype">int</span> rank;
<a name="l01155"></a>01155 Value divisor, tmp;
<a name="l01156"></a>01156
<a name="l01157"></a>01157 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l01158"></a>01158 <span class="preprocessor"></span> FILE *fp;
<a name="l01159"></a>01159 fp = fopen(<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l01160"></a>01160 fprintf(fp,<span class="stringliteral">"\nEntered LATTICEPREIMAGE \n"</span>);
<a name="l01161"></a>01161 fclose(fp);
<a name="l01162"></a>01162 <span class="preprocessor">#endif</span>
<a name="l01163"></a>01163 <span class="preprocessor"></span>
<a name="l01164"></a>01164 <span class="comment">/* Check for the validity of the function */</span>
<a name="l01165"></a>01165 <span class="keywordflow">if</span> (G-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != L-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>) {
<a name="l01166"></a>01166 fprintf (stderr, <span class="stringliteral">"\nIn LatticePreimage: Incompatible types of Lattice and the function\n"</span>);
<a name="l01167"></a>01167 <span class="keywordflow">return</span> (<a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>));
<a name="l01168"></a>01168 }
<a name="l01169"></a>01169
<a name="l01170"></a>01170 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(divisor); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l01171"></a>01171
<a name="l01172"></a>01172 <span class="comment">/* Making Diophantine Equations [g -L] */</span>
<a name="l01173"></a>01173 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(divisor,G-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[G-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01174"></a>01174 Dio = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(G-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>, G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>+L-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1);
<a name="l01175"></a>01175 <span class="keywordflow">for</span> (i = 0; i < G-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++)
<a name="l01176"></a>01176 <span class="keywordflow">for</span> (j = 0; j < G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j++)
<a name="l01177"></a>01177 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],G-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l01178"></a>01178
<a name="l01179"></a>01179 <span class="keywordflow">for</span> (i = 0;i < G-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++)
<a name="l01180"></a>01180 <span class="keywordflow">for</span> (j = 0; j < L-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j++) {
<a name="l01181"></a>01181 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(tmp,divisor,L-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l01182"></a>01182 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j+G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],tmp);
<a name="l01183"></a>01183 }
<a name="l01184"></a>01184
<a name="l01185"></a>01185 <span class="keywordflow">for</span> (i = 0; i < Dio-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++) {
<a name="l01186"></a>01186 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(tmp,divisor,L-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][L-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01187"></a>01187 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(tmp,G-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],tmp);
<a name="l01188"></a>01188 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],tmp);
<a name="l01189"></a>01189 }
<a name="l01190"></a>01190 <span class="keywordflow">for</span> (i = 0; i < Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i++)
<a name="l01191"></a>01191 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Dio-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i],0);
<a name="l01192"></a>01192
<a name="l01193"></a>01193 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Dio-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Dio-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][Dio-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],1);
<a name="l01194"></a>01194 rank = <a class="code" href="SolveDio_8c.html#0f417a4dacdd52103cc96cbe93e038cb">SolveDiophantine</a>(Dio, &U, &X);
<a name="l01195"></a>01195
<a name="l01196"></a>01196 <span class="keywordflow">if</span> (rank == -1)
<a name="l01197"></a>01197 Result = <a class="code" href="Lattice_8c.html#ab7550d1f894cc88fe630ce56f502184">EmptyLattice</a>(G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01198"></a>01198 <span class="keywordflow">else</span> {
<a name="l01199"></a>01199 Result = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a> (G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>, G-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l01200"></a>01200 <span class="keywordflow">for</span> (i = 0; i < Result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++)
<a name="l01201"></a>01201 <span class="keywordflow">for</span> (j = 0; j < Result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; j++)
<a name="l01202"></a>01202 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],U-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]);
<a name="l01203"></a>01203
<a name="l01204"></a>01204 <span class="keywordflow">for</span> (i = 0; i < Result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l01205"></a>01205 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][Result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],X-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[i]);
<a name="l01206"></a>01206 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (U);
<a name="l01207"></a>01207 <a class="code" href="vector_8c.html#055608d1a3726b7cb26e3e8074764ba0">Vector_Free</a> (X);
<a name="l01208"></a>01208 <span class="keywordflow">for</span> (i = 0; i < Result-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i ++)
<a name="l01209"></a>01209 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[Result-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i],0);
<a name="l01210"></a>01210 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(Result-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i],1);
<a name="l01211"></a>01211 }
<a name="l01212"></a>01212 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Dio);
<a name="l01213"></a>01213 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(divisor);
<a name="l01214"></a>01214 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01215"></a>01215 <span class="keywordflow">return</span> Result;
<a name="l01216"></a>01216 } <span class="comment">/* LatticePreimage */</span>
<a name="l01217"></a>01217
<a name="l01218"></a>01218 <span class="comment">/*</span>
<a name="l01219"></a>01219 <span class="comment"> * Return True if the matrix 'm' is a valid lattice, otherwise return False. </span>
<a name="l01220"></a>01220 <span class="comment"> * Note: A valid lattice has the last row as [0 0 0 ... 1]. </span>
<a name="l01221"></a>01221 <span class="comment"> */</span>
<a name="l01222"></a><a class="code" href="Lattice_8h.html#2b6cf7c3438a407cd28d6ea0c9219d1b">01222</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#2b6cf7c3438a407cd28d6ea0c9219d1b">IsLattice</a>(<a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#742204794ea328ba293fe59cec79b990">m</a>) {
<a name="l01223"></a>01223
<a name="l01224"></a>01224 <span class="keywordtype">int</span> i;
<a name="l01225"></a>01225
<a name="l01226"></a>01226 <span class="preprocessor">#ifdef DOMDEBUG</span>
<a name="l01227"></a>01227 <span class="preprocessor"></span> FILE *fp;
<a name="l01228"></a>01228 fp = fopen (<span class="stringliteral">"_debug"</span>, <span class="stringliteral">"a"</span>);
<a name="l01229"></a>01229 fprintf (fp, <span class="stringliteral">"\nEntered ISLATTICE \n"</span>);
<a name="l01230"></a>01230 fclose (fp);
<a name="l01231"></a>01231 <span class="preprocessor">#endif</span>
<a name="l01232"></a>01232 <span class="preprocessor"></span>
<a name="l01233"></a>01233 <span class="comment">/* Is it necessary to check if the lattice</span>
<a name="l01234"></a>01234 <span class="comment"> is fulldimensional or not here only? */</span>
<a name="l01235"></a>01235
<a name="l01236"></a>01236 <span class="keywordflow">if</span> (m-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> != m-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>)
<a name="l01237"></a>01237 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01238"></a>01238
<a name="l01239"></a>01239 <span class="keywordflow">for</span> (i = 0; i < m-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1; i++)
<a name="l01240"></a>01240 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(m-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[m-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][i]))
<a name="l01241"></a>01241 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a> ;
<a name="l01242"></a>01242 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(m-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]))
<a name="l01243"></a>01243 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01244"></a>01244 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a> ;
<a name="l01245"></a>01245 } <span class="comment">/* IsLattice */</span>
<a name="l01246"></a>01246
<a name="l01247"></a>01247 <span class="comment">/*</span>
<a name="l01248"></a>01248 <span class="comment"> * Check whether the matrix 'm' is full row-rank or not. </span>
<a name="l01249"></a>01249 <span class="comment"> */</span>
<a name="l01250"></a><a class="code" href="Lattice_8h.html#a55a58802da206d773cbaf5d6ffb90a5">01250</a> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#a55a58802da206d773cbaf5d6ffb90a5">isfulldim</a>(<a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="polyparam_8c.html#742204794ea328ba293fe59cec79b990">m</a>) {
<a name="l01251"></a>01251
<a name="l01252"></a>01252 <a class="code" href="structmatrix.html">Matrix</a> *h, *u ;
<a name="l01253"></a>01253 <span class="keywordtype">int</span> i ;
<a name="l01254"></a>01254
<a name="l01255"></a>01255 <span class="comment">/* </span>
<a name="l01256"></a>01256 <span class="comment"> res = Hermite (m, &h, &u);</span>
<a name="l01257"></a>01257 <span class="comment"> if (res != m->NbRows)</span>
<a name="l01258"></a>01258 <span class="comment"> return False ;</span>
<a name="l01259"></a>01259 <span class="comment"> */</span>
<a name="l01260"></a>01260
<a name="l01261"></a>01261 <a class="code" href="NormalForms_8c.html#cd4e00bd353920b83e3f27a76909b2ed" title="Hermite : This function takes a Matrix as its input and finds its HNF ( Left form...">Hermite</a>(m, &h, &u);
<a name="l01262"></a>01262 <span class="keywordflow">for</span> (i = 0; i < h-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i ++)
<a name="l01263"></a>01263 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(h-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i])) {
<a name="l01264"></a>01264 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (h);
<a name="l01265"></a>01265 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (u);
<a name="l01266"></a>01266 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01267"></a>01267 }
<a name="l01268"></a>01268 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (h);
<a name="l01269"></a>01269 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a> (u);
<a name="l01270"></a>01270 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l01271"></a>01271 } <span class="comment">/* isfulldim */</span>
<a name="l01272"></a>01272
<a name="l01273"></a>01273 <span class="comment">/* </span>
<a name="l01274"></a>01274 <span class="comment"> * This function takes as input a lattice list in which the lattices have the </span>
<a name="l01275"></a>01275 <span class="comment"> * same linear part, and almost the same affinepart, i.e. if A and B are two </span>
<a name="l01276"></a>01276 <span class="comment"> * of the lattices in the above lattice list and [a1, .. , an] and [b1 .. bn]</span>
<a name="l01277"></a>01277 <span class="comment"> * are the affineparts of A and B respectively, then for 0 < i < n ai = bi and</span>
<a name="l01278"></a>01278 <span class="comment"> * 'an' may not be equal to 'bn'. These are not the affine parts in the n-th</span>
<a name="l01279"></a>01279 <span class="comment"> * dimension, but the lattices have been tranformed such that the value of the </span>
<a name="l01280"></a>01280 <span class="comment"> * elment in the dimension on which we are simplifying is in the last row and</span>
<a name="l01281"></a>01281 <span class="comment"> * also the lattices are in a sorted order. </span>
<a name="l01282"></a>01282 <span class="comment"> * This function also takes as input the dimension along which we</span>
<a name="l01283"></a>01283 <span class="comment"> * are simplifying and takes the diagonal element of the lattice along that</span>
<a name="l01284"></a>01284 <span class="comment"> * dimension and tries to find out the factors of that element and sees if the</span>
<a name="l01285"></a>01285 <span class="comment"> * list of lattices can be simplified using these factors. The output of this </span>
<a name="l01286"></a>01286 <span class="comment"> * function is the list of lattices in the simplified form and a flag to indic-</span>
<a name="l01287"></a>01287 <span class="comment"> * ate whether any form of simplification was actually done or not. </span>
<a name="l01288"></a>01288 <span class="comment"> */</span>
<a name="l01289"></a><a class="code" href="Lattice_8c.html#44a46c8b1440d9720fc95d48b3fce756">01289</a> <span class="keyword">static</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#44a46c8b1440d9720fc95d48b3fce756">Simplify</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> **InputList, <a class="code" href="structLatticeUnion.html">LatticeUnion</a> **ResultList, <span class="keywordtype">int</span> dim) {
<a name="l01290"></a>01290
<a name="l01291"></a>01291 <span class="keywordtype">int</span> i;
<a name="l01292"></a>01292 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *prev, *temp;
<a name="l01293"></a>01293 <a class="code" href="structfactor.html">factor</a> allfac;
<a name="l01294"></a>01294 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> retval = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01295"></a>01295 <span class="keywordtype">int</span> width;
<a name="l01296"></a>01296 Value cnt, aux, k, fac, num, tmp, foobar;
<a name="l01297"></a>01297
<a name="l01298"></a>01298 <span class="keywordflow">if</span> ((*InputList == NULL) || (InputList[0]->next == NULL))
<a name="l01299"></a>01299 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a> ;
<a name="l01300"></a>01300
<a name="l01301"></a>01301 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(aux); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(cnt);
<a name="l01302"></a>01302 <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>(fac);
<a name="l01303"></a>01303 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(num); <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp);
<a name="l01304"></a>01304 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(foobar);
<a name="l01305"></a>01305
<a name="l01306"></a>01306 width = InputList[0]-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1;
<a name="l01307"></a>01307 allfac = <a class="code" href="Lattice_8c.html#6873054429fbd7cc187a08ec4776a749">allfactors</a>(VALUE_TO_INT(InputList[0]->M->p[dim][dim]));
<a name="l01308"></a>01308 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(cnt,0);
<a name="l01309"></a>01309 <span class="keywordflow">for</span> (temp = InputList[0]; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01310"></a>01310 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(cnt,cnt);
<a name="l01311"></a>01311 <span class="keywordflow">for</span>(i = 0; i < allfac.<a class="code" href="structfactor.html#e55e0a1174396542aa7f78afafa2ca4f">count</a>; i++) {
<a name="l01312"></a>01312 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(foobar,allfac.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i]);
<a name="l01313"></a>01313 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(aux,InputList[0]->M->p[dim][dim],foobar);
<a name="l01314"></a>01314 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#eee525b427bd616a24b5b9feb9a9f02e">value_ge</a>(cnt,aux))
<a name="l01315"></a>01315 <span class="keywordflow">break</span>;
<a name="l01316"></a>01316 }
<a name="l01317"></a>01317 <span class="keywordflow">if</span> (i == allfac.<a class="code" href="structfactor.html#e55e0a1174396542aa7f78afafa2ca4f">count</a>) {
<a name="l01318"></a>01318 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(cnt); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(aux);
<a name="l01319"></a>01319 <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>(fac);
<a name="l01320"></a>01320 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(num); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01321"></a>01321 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(foobar);
<a name="l01322"></a>01322 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01323"></a>01323 }
<a name="l01324"></a>01324 <span class="keywordflow">for</span> (; i < allfac.<a class="code" href="structfactor.html#e55e0a1174396542aa7f78afafa2ca4f">count</a>; i++) {
<a name="l01325"></a>01325 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> Present = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01326"></a>01326 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(k,0);
<a name="l01327"></a>01327
<a name="l01328"></a>01328 <span class="keywordflow">if</span> (*InputList == NULL) {
<a name="l01329"></a>01329 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(cnt); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(aux);
<a name="l01330"></a>01330 <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>(fac);
<a name="l01331"></a>01331 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(num); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01332"></a>01332 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(foobar);
<a name="l01333"></a>01333 <span class="keywordflow">return</span> retval;
<a name="l01334"></a>01334 }
<a name="l01335"></a>01335 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(foobar,allfac.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i]);
<a name="l01336"></a>01336 <a class="code" href="source_2arith_2arithmetique_8h.html#c633e4bcd9ed1d8412c67cda6d8ddb11">value_division</a>(num,InputList[0]->M->p[dim][dim],foobar);
<a name="l01337"></a>01337 <span class="keywordflow">while</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(k,foobar)) {
<a name="l01338"></a>01338 Present = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01339"></a>01339 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(fac,k);
<a name="l01340"></a>01340 <span class="keywordflow">for</span> (temp = *InputList; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>) {
<a name="l01341"></a>01341 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#aac63aa93e7c9fa23ebcde2dc80a12b9">value_eq</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],fac)) {
<a name="l01342"></a>01342 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(foobar,allfac.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i]);
<a name="l01343"></a>01343 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(fac,fac,foobar);
<a name="l01344"></a>01344 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#eee525b427bd616a24b5b9feb9a9f02e">value_ge</a>(fac,(*InputList)->M->p[dim][dim])) {
<a name="l01345"></a>01345 Present = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l01346"></a>01346 <span class="keywordflow">break</span>;
<a name="l01347"></a>01347 }
<a name="l01348"></a>01348 }
<a name="l01349"></a>01349 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],fac))
<a name="l01350"></a>01350 <span class="keywordflow">break</span>;
<a name="l01351"></a>01351 }
<a name="l01352"></a>01352 <span class="keywordflow">if</span> (Present == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l01353"></a>01353 retval = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l01354"></a>01354 <span class="keywordflow">if</span> (*ResultList == NULL)
<a name="l01355"></a>01355 *ResultList = temp = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l01356"></a>01356 <span class="keywordflow">else</span> {
<a name="l01357"></a>01357 <span class="keywordflow">for</span> (temp = *ResultList; temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>);
<a name="l01358"></a>01358 temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *) malloc (<span class="keyword">sizeof</span> (<a class="code" href="structLatticeUnion.html">LatticeUnion</a>));
<a name="l01359"></a>01359 temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01360"></a>01360 }
<a name="l01361"></a>01361 temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(InputList[0]->M);
<a name="l01362"></a>01362 temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = NULL;
<a name="l01363"></a>01363 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(foobar,allfac.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i]);
<a name="l01364"></a>01364 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[dim][dim],foobar);
<a name="l01365"></a>01365 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[dim][width],k);
<a name="l01366"></a>01366 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[width][width],1);
<a name="l01367"></a>01367
<a name="l01368"></a>01368 <span class="comment">/* Deleting the Lattices from the curlist */</span>
<a name="l01369"></a>01369 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(tmp,k);
<a name="l01370"></a>01370 prev = NULL;
<a name="l01371"></a>01371 temp = InputList[0];
<a name="l01372"></a>01372 <span class="keywordflow">while</span> (temp != NULL) {
<a name="l01373"></a>01373 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#aac63aa93e7c9fa23ebcde2dc80a12b9">value_eq</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[width][width],tmp)) {
<a name="l01374"></a>01374 <span class="keywordflow">if</span> (temp == InputList[0]) {
<a name="l01375"></a>01375 prev = temp;
<a name="l01376"></a>01376 temp = InputList [0] = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01377"></a>01377 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(prev-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>);
<a name="l01378"></a>01378 free(prev);
<a name="l01379"></a>01379 }
<a name="l01380"></a>01380 <span class="keywordflow">else</span> {
<a name="l01381"></a>01381 prev-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01382"></a>01382 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>);
<a name="l01383"></a>01383 free(temp);
<a name="l01384"></a>01384 temp = prev-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01385"></a>01385 }
<a name="l01386"></a>01386 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(foobar,allfac.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i]);
<a name="l01387"></a>01387 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(tmp,tmp,foobar);
<a name="l01388"></a>01388 }
<a name="l01389"></a>01389 <span class="keywordflow">else</span> {
<a name="l01390"></a>01390 prev = temp;
<a name="l01391"></a>01391 temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01392"></a>01392 }
<a name="l01393"></a>01393 }
<a name="l01394"></a>01394 }
<a name="l01395"></a>01395 <a class="code" href="source_2arith_2arithmetique_8h.html#88693f35dd41deddc6ac0700073fc8db">value_increment</a>(k,k);
<a name="l01396"></a>01396 }
<a name="l01397"></a>01397 }
<a name="l01398"></a>01398 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(cnt); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(aux);
<a name="l01399"></a>01399 <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>(fac);
<a name="l01400"></a>01400 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(num); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(tmp);
<a name="l01401"></a>01401 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(foobar);
<a name="l01402"></a>01402 <span class="keywordflow">return</span> retval;
<a name="l01403"></a>01403 } <span class="comment">/* Simplify */</span>
<a name="l01404"></a>01404
<a name="l01405"></a>01405 <span class="comment">/*</span>
<a name="l01406"></a>01406 <span class="comment"> * This function is used in the qsort function in sorting the lattices. Given </span>
<a name="l01407"></a>01407 <span class="comment"> * two lattices 'A' and 'B', both in HNF, where A = [ [a11 0], [a21, a22, 0] .</span>
<a name="l01408"></a>01408 <span class="comment"> * .... [an1, .., ann] ] and B = [ [b11 0], [b21, b22, 0] ..[bn1, .., bnn] ],</span>
<a name="l01409"></a>01409 <span class="comment"> * then A < B, if there exists a pair <i,j> such that [aij < bij] and for every</span>
<a name="l01410"></a>01410 <span class="comment"> * other pair <i1, j1>, 0<=i1<i, 0<=j1<j [ai1j1 = bi1j1]. </span>
<a name="l01411"></a>01411 <span class="comment"> */</span>
<a name="l01412"></a><a class="code" href="Lattice_8c.html#bc46fec897d671f73bd5a77f919b42f2">01412</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#bc46fec897d671f73bd5a77f919b42f2">LinearPartCompare</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *A, <span class="keyword">const</span> <span class="keywordtype">void</span> *B) {
<a name="l01413"></a>01413
<a name="l01414"></a>01414 <a class="code" href="structmatrix.html">Lattice</a> **L1, **L2;
<a name="l01415"></a>01415 <span class="keywordtype">int</span> i, j;
<a name="l01416"></a>01416
<a name="l01417"></a>01417 L1 = (<a class="code" href="structmatrix.html">Lattice</a> **) A;
<a name="l01418"></a>01418 L2 = (<a class="code" href="structmatrix.html">Lattice</a> **) B;
<a name="l01419"></a>01419
<a name="l01420"></a>01420 <span class="keywordflow">for</span> (i = 0; i < L1[0]-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++)
<a name="l01421"></a>01421 <span class="keywordflow">for</span> (j = 0; j <= i ; j++) {
<a name="l01422"></a>01422 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(L1[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][j],L2[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][j]))
<a name="l01423"></a>01423 <span class="keywordflow">return</span> 1;
<a name="l01424"></a>01424 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(L1[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][j],L2[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][j]))
<a name="l01425"></a>01425 <span class="keywordflow">return</span> -1;
<a name="l01426"></a>01426 }
<a name="l01427"></a>01427 <span class="keywordflow">return</span> 0;
<a name="l01428"></a>01428 } <span class="comment">/* LinearPartCompare */</span>
<a name="l01429"></a>01429
<a name="l01430"></a>01430 <span class="comment">/*</span>
<a name="l01431"></a>01431 <span class="comment"> * This function takes as input a List of Lattices and sorts them on the basis</span>
<a name="l01432"></a>01432 <span class="comment"> * of their Linear parts. It sorts in place, as a result of which the input </span>
<a name="l01433"></a>01433 <span class="comment"> * list is modified to the sorted order.</span>
<a name="l01434"></a>01434 <span class="comment"> */</span>
<a name="l01435"></a><a class="code" href="Lattice_8c.html#11fab2c71963a30f2d31ac4915347ac5">01435</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#11fab2c71963a30f2d31ac4915347ac5">LinearPartSort</a> (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *Head) {
<a name="l01436"></a>01436
<a name="l01437"></a>01437 <span class="keywordtype">int</span> cnt;
<a name="l01438"></a>01438 <a class="code" href="structmatrix.html">Lattice</a> **Latlist;
<a name="l01439"></a>01439 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp ;
<a name="l01440"></a>01440
<a name="l01441"></a>01441 cnt = 0;
<a name="l01442"></a>01442 <span class="keywordflow">for</span> (temp = Head; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01443"></a>01443 cnt ++;
<a name="l01444"></a>01444
<a name="l01445"></a>01445 Latlist = (<a class="code" href="structmatrix.html">Lattice</a> **) malloc ( <span class="keyword">sizeof</span> (<a class="code" href="structmatrix.html">Lattice</a> *) * cnt);
<a name="l01446"></a>01446
<a name="l01447"></a>01447 cnt = 0;
<a name="l01448"></a>01448 <span class="keywordflow">for</span> (temp = Head; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01449"></a>01449 Latlist[cnt++] = temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>;
<a name="l01450"></a>01450
<a name="l01451"></a>01451 qsort(Latlist, cnt, <span class="keyword">sizeof</span>(<a class="code" href="structmatrix.html">Lattice</a> *), <a class="code" href="Lattice_8c.html#bc46fec897d671f73bd5a77f919b42f2">LinearPartCompare</a>);
<a name="l01452"></a>01452
<a name="l01453"></a>01453 cnt = 0;
<a name="l01454"></a>01454 <span class="keywordflow">for</span> (temp = Head; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01455"></a>01455 temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = Latlist[cnt++];
<a name="l01456"></a>01456
<a name="l01457"></a>01457 free (Latlist);
<a name="l01458"></a>01458 <span class="keywordflow">return</span>;
<a name="l01459"></a>01459 } <span class="comment">/* LinearPartSort */</span>
<a name="l01460"></a>01460
<a name="l01461"></a>01461 <span class="comment">/*</span>
<a name="l01462"></a>01462 <span class="comment"> * This function is used in 'AfiinePartSort' in sorting the lattices with the</span>
<a name="l01463"></a>01463 <span class="comment"> * same linear part. GIven two lattices 'A' and 'B' with affineparts [a1 .. an]</span>
<a name="l01464"></a>01464 <span class="comment"> * and [b1 ... bn], then A < B if for some 0 < i <= n, ai < bi and for 0 < i1 <</span>
<a name="l01465"></a>01465 <span class="comment"> * i, ai1 = bi1. </span>
<a name="l01466"></a>01466 <span class="comment"> */</span>
<a name="l01467"></a><a class="code" href="Lattice_8c.html#7020d0d8380fd4dca736c299fb3f90ec">01467</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#7020d0d8380fd4dca736c299fb3f90ec">AffinePartCompare</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *A, <span class="keyword">const</span> <span class="keywordtype">void</span> *B) {
<a name="l01468"></a>01468
<a name="l01469"></a>01469 <span class="keywordtype">int</span> i;
<a name="l01470"></a>01470 <a class="code" href="structmatrix.html">Lattice</a> **L1, **L2;
<a name="l01471"></a>01471
<a name="l01472"></a>01472 L1 = (<a class="code" href="structmatrix.html">Lattice</a> **)A;
<a name="l01473"></a>01473 L2 = (<a class="code" href="structmatrix.html">Lattice</a> **)B;
<a name="l01474"></a>01474
<a name="l01475"></a>01475 <span class="keywordflow">for</span> (i = 0; i < L1[0]-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++) {
<a name="l01476"></a>01476 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#15b0362ff15576108c69c31e5ed0cfeb">value_gt</a>(L1[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][L1[0]->NbColumns-1],L2[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][L1[0]->NbColumns-1]))
<a name="l01477"></a>01477 <span class="keywordflow">return</span> 1;
<a name="l01478"></a>01478
<a name="l01479"></a>01479 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#d87a1fcce82a9885ffd8518f4fba2c0e">value_lt</a>(L1[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][L1[0]->NbColumns-1],L2[0]-><a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>[i][L1[0]->NbColumns-1]))
<a name="l01480"></a>01480 <span class="keywordflow">return</span> -1;
<a name="l01481"></a>01481 }
<a name="l01482"></a>01482 <span class="keywordflow">return</span> 0 ;
<a name="l01483"></a>01483 } <span class="comment">/* AffinePartCompare */</span>
<a name="l01484"></a>01484
<a name="l01485"></a>01485 <span class="comment">/* </span>
<a name="l01486"></a>01486 <span class="comment"> * This function takes a list of lattices with the same linear part and sorts</span>
<a name="l01487"></a>01487 <span class="comment"> * them on the basis of their affine part. The sorting is done in place.</span>
<a name="l01488"></a>01488 <span class="comment"> */</span>
<a name="l01489"></a><a class="code" href="Lattice_8c.html#afa5a0f5f86f185e18884f85d9962793">01489</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="Lattice_8c.html#afa5a0f5f86f185e18884f85d9962793">AffinePartSort</a> (<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *List) {
<a name="l01490"></a>01490
<a name="l01491"></a>01491 <span class="keywordtype">int</span> cnt;
<a name="l01492"></a>01492 <a class="code" href="structmatrix.html">Lattice</a> **LatList;
<a name="l01493"></a>01493 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *tmp;
<a name="l01494"></a>01494
<a name="l01495"></a>01495 cnt = 0;
<a name="l01496"></a>01496 <span class="keywordflow">for</span> (tmp = List; tmp != NULL; tmp = tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01497"></a>01497 cnt ++;
<a name="l01498"></a>01498
<a name="l01499"></a>01499 LatList = (<a class="code" href="structmatrix.html">Lattice</a> **) malloc (<span class="keyword">sizeof</span>(<a class="code" href="structmatrix.html">Lattice</a> *) * cnt);
<a name="l01500"></a>01500
<a name="l01501"></a>01501 cnt = 0;
<a name="l01502"></a>01502 <span class="keywordflow">for</span> (tmp = List; tmp != NULL; tmp = tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01503"></a>01503 LatList[cnt++] = tmp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>;
<a name="l01504"></a>01504
<a name="l01505"></a>01505 qsort(LatList,cnt, <span class="keyword">sizeof</span> (<a class="code" href="structmatrix.html">Lattice</a> *), <a class="code" href="Lattice_8c.html#7020d0d8380fd4dca736c299fb3f90ec">AffinePartCompare</a>);
<a name="l01506"></a>01506
<a name="l01507"></a>01507 cnt = 0;
<a name="l01508"></a>01508 <span class="keywordflow">for</span> (tmp = List; tmp != NULL; tmp = tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>)
<a name="l01509"></a>01509 tmp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a> = LatList[cnt++];
<a name="l01510"></a>01510 <span class="keywordflow">return</span>;
<a name="l01511"></a>01511 } <span class="comment">/* AffinePartSort */</span>
<a name="l01512"></a>01512
<a name="l01513"></a><a class="code" href="Lattice_8c.html#a5657618519c908fe09f61185cd28e85">01513</a> <span class="keyword">static</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#a5657618519c908fe09f61185cd28e85">AlmostSameAffinePart</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *A, <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *B) {
<a name="l01514"></a>01514
<a name="l01515"></a>01515 <span class="keywordtype">int</span> i;
<a name="l01516"></a>01516
<a name="l01517"></a>01517 <span class="keywordflow">if</span> ((A == NULL) || (B == NULL))
<a name="l01518"></a>01518 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01519"></a>01519
<a name="l01520"></a>01520 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i ++)
<a name="l01521"></a>01521 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],B-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]))
<a name="l01522"></a>01522 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01523"></a>01523 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l01524"></a>01524 } <span class="comment">/* AlmostSameAffinePart */</span>
<a name="l01525"></a>01525
<a name="l01526"></a>01526 <span class="comment">/* </span>
<a name="l01527"></a>01527 <span class="comment"> * This function takes a list of lattices having the same linear part and tries</span>
<a name="l01528"></a>01528 <span class="comment"> * to simplify these lattices. This may not be the only way of simplifying the</span>
<a name="l01529"></a>01529 <span class="comment"> * lattices. The function returns a list of partially simplified lattices and </span>
<a name="l01530"></a>01530 <span class="comment"> * also a flag to tell whether any simplification was performed at all. </span>
<a name="l01531"></a>01531 <span class="comment"> */</span>
<a name="l01532"></a><a class="code" href="Lattice_8c.html#8fc5b66980847b6732bed0c1bc205a8b">01532</a> <span class="keyword">static</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#8fc5b66980847b6732bed0c1bc205a8b">AffinePartSimplify</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *curlist, <a class="code" href="structLatticeUnion.html">LatticeUnion</a> **newlist) {
<a name="l01533"></a>01533
<a name="l01534"></a>01534 <span class="keywordtype">int</span> i;
<a name="l01535"></a>01535 Value aux;
<a name="l01536"></a>01536 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *temp, *curr, *next;
<a name="l01537"></a>01537 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *nextlist;
<a name="l01538"></a>01538 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> change = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>, chng;
<a name="l01539"></a>01539
<a name="l01540"></a>01540 <span class="keywordflow">if</span> (curlist == NULL)
<a name="l01541"></a>01541 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01542"></a>01542
<a name="l01543"></a>01543 <span class="keywordflow">if</span> (curlist-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> == NULL) {
<a name="l01544"></a>01544 curlist-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = newlist[0];
<a name="l01545"></a>01545 newlist[0] = curlist;
<a name="l01546"></a>01546 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a> ;
<a name="l01547"></a>01547 }
<a name="l01548"></a>01548
<a name="l01549"></a>01549 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(aux);
<a name="l01550"></a>01550 <span class="keywordflow">for</span> (i = 0; i < curlist-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> - 1; i ++) {
<a name="l01551"></a>01551
<a name="l01552"></a>01552 <span class="comment">/* Interchanging the elements of the Affine part for easy computation</span>
<a name="l01553"></a>01553 <span class="comment"> of the sort (using qsort) */</span>
<a name="l01554"></a>01554
<a name="l01555"></a>01555 <span class="keywordflow">for</span> (temp = curlist; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>) {
<a name="l01556"></a>01556 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(aux,temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01557"></a>01557 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01558"></a>01558 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],aux);
<a name="l01559"></a>01559 }
<a name="l01560"></a>01560 <a class="code" href="Lattice_8c.html#afa5a0f5f86f185e18884f85d9962793">AffinePartSort</a>(curlist);
<a name="l01561"></a>01561 nextlist = NULL;
<a name="l01562"></a>01562 curr = curlist;
<a name="l01563"></a>01563 <span class="keywordflow">while</span> (curr != NULL) {
<a name="l01564"></a>01564 next = curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01565"></a>01565 <span class="keywordflow">if</span> (!<a class="code" href="Lattice_8c.html#a5657618519c908fe09f61185cd28e85">AlmostSameAffinePart</a>(curr, next)) {
<a name="l01566"></a>01566 curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = NULL;
<a name="l01567"></a>01567 chng = <a class="code" href="Lattice_8c.html#44a46c8b1440d9720fc95d48b3fce756">Simplify</a>(&curlist, newlist, i);
<a name="l01568"></a>01568 <span class="keywordflow">if</span> (nextlist == NULL)
<a name="l01569"></a>01569 nextlist = curlist;
<a name="l01570"></a>01570 <span class="keywordflow">else</span> {
<a name="l01571"></a>01571 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *tmp;
<a name="l01572"></a>01572 <span class="keywordflow">for</span> (tmp = nextlist; tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>; tmp=tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>);
<a name="l01573"></a>01573 tmp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = curlist;
<a name="l01574"></a>01574 }
<a name="l01575"></a>01575 change = (<a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a>)(change | chng);
<a name="l01576"></a>01576 curlist = next;
<a name="l01577"></a>01577 }
<a name="l01578"></a>01578 curr = next;
<a name="l01579"></a>01579 }
<a name="l01580"></a>01580 curlist = nextlist;
<a name="l01581"></a>01581
<a name="l01582"></a>01582 <span class="comment">/* Interchanging the elements of the Affine part for easy computation</span>
<a name="l01583"></a>01583 <span class="comment"> of the sort (using qsort) */</span>
<a name="l01584"></a>01584
<a name="l01585"></a>01585 <span class="keywordflow">for</span>(temp = curlist; temp != NULL; temp = temp-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>) {
<a name="l01586"></a>01586 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(aux,temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01587"></a>01587 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1]);
<a name="l01588"></a>01588 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][temp-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1],aux);
<a name="l01589"></a>01589 }
<a name="l01590"></a>01590 <span class="keywordflow">if</span> (curlist == NULL)
<a name="l01591"></a>01591 <span class="keywordflow">break</span>;
<a name="l01592"></a>01592 }
<a name="l01593"></a>01593 <span class="keywordflow">if</span> ( *newlist == NULL)
<a name="l01594"></a>01594 *newlist = nextlist;
<a name="l01595"></a>01595 <span class="keywordflow">else</span> {
<a name="l01596"></a>01596 <span class="keywordflow">for</span> (curr = *newlist; curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> != NULL; curr = curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>);
<a name="l01597"></a>01597 curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = nextlist;
<a name="l01598"></a>01598 }
<a name="l01599"></a>01599 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(aux);
<a name="l01600"></a>01600 <span class="keywordflow">return</span> change;
<a name="l01601"></a>01601 } <span class="comment">/* AffinePartSimplify */</span>
<a name="l01602"></a>01602
<a name="l01603"></a><a class="code" href="Lattice_8c.html#7dbe994b4b5bceba74f68bc17ff7a129">01603</a> <span class="keyword">static</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> <a class="code" href="Lattice_8c.html#7dbe994b4b5bceba74f68bc17ff7a129">SameLinearPart</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *A, <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *B) {
<a name="l01604"></a>01604
<a name="l01605"></a>01605 <span class="keywordtype">int</span> i, j;
<a name="l01606"></a>01606 <span class="keywordflow">if</span> ((A == NULL) || (B ==NULL))
<a name="l01607"></a>01607 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01608"></a>01608 <span class="keywordflow">for</span> (i = 0; i < A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++)
<a name="l01609"></a>01609 <span class="keywordflow">for</span> (j = 0; j <= i; j++)
<a name="l01610"></a>01610 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#8092395b58522bbac9f2c8a1ee14c10c">value_ne</a>(A-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j],B-><a class="code" href="structLatticeUnion.html#b9b004530ace366d12a2cf46e7a13175">M</a>-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j]))
<a name="l01611"></a>01611 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01612"></a>01612
<a name="l01613"></a>01613 <span class="keywordflow">return</span> <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>;
<a name="l01614"></a>01614 } <span class="comment">/* SameLinearPart */</span>
<a name="l01615"></a>01615
<a name="l01616"></a>01616 <span class="comment">/* </span>
<a name="l01617"></a>01617 <span class="comment"> * Given a union of lattices, return a simplified list of lattices. </span>
<a name="l01618"></a>01618 <span class="comment"> */</span>
<a name="l01619"></a><a class="code" href="Lattice_8h.html#bcae5a642b26c67f65db8de16cca6064">01619</a> <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *<a class="code" href="Lattice_8c.html#bcae5a642b26c67f65db8de16cca6064">LatticeSimplify</a>(<a class="code" href="structLatticeUnion.html">LatticeUnion</a> *latlist) {
<a name="l01620"></a>01620
<a name="l01621"></a>01621 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *curlist, *nextlist;
<a name="l01622"></a>01622 <a class="code" href="structLatticeUnion.html">LatticeUnion</a> *curr, *next;
<a name="l01623"></a>01623 <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a> change = <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>, chng;
<a name="l01624"></a>01624
<a name="l01625"></a>01625 curlist = latlist;
<a name="l01626"></a>01626 <span class="keywordflow">while</span> (change == <a class="code" href="types_8h.html#39db6982619d623273fad8a3834893096d32c34708a0a3507c4bdb89219d650b">True</a>) {
<a name="l01627"></a>01627 change = <a class="code" href="types_8h.html#39db6982619d623273fad8a383489309f9d46b7804d93a4fcde88489a1b68c24">False</a>;
<a name="l01628"></a>01628 <a class="code" href="Lattice_8c.html#11fab2c71963a30f2d31ac4915347ac5">LinearPartSort</a>(curlist);
<a name="l01629"></a>01629 curr = curlist;
<a name="l01630"></a>01630 nextlist = NULL;
<a name="l01631"></a>01631 <span class="keywordflow">while</span>(curr != NULL) {
<a name="l01632"></a>01632 next = curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a>;
<a name="l01633"></a>01633 <span class="keywordflow">if</span> (!<a class="code" href="Lattice_8c.html#7dbe994b4b5bceba74f68bc17ff7a129">SameLinearPart</a>(curr, next)) {
<a name="l01634"></a>01634 curr-><a class="code" href="structLatticeUnion.html#b21274825bf2e44967e1fcf6f42bcd88">next</a> = NULL;
<a name="l01635"></a>01635 chng = <a class="code" href="Lattice_8c.html#8fc5b66980847b6732bed0c1bc205a8b">AffinePartSimplify</a>(curlist, &nextlist);
<a name="l01636"></a>01636 change = (<a class="code" href="types_8h.html#39db6982619d623273fad8a383489309">Bool</a>)(change | chng);
<a name="l01637"></a>01637 curlist = next;
<a name="l01638"></a>01638 }
<a name="l01639"></a>01639 curr = next;
<a name="l01640"></a>01640 }
<a name="l01641"></a>01641 curlist = nextlist;
<a name="l01642"></a>01642 }
<a name="l01643"></a>01643 <span class="keywordflow">return</span> curlist;
<a name="l01644"></a>01644 } <span class="comment">/* LatticeSimplify */</span>
<a name="l01645"></a>01645
<a name="l01646"></a><a class="code" href="Lattice_8h.html#b4a31767671350bb32e2ffb875348ac6">01646</a> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#b4a31767671350bb32e2ffb875348ac6">intcompare</a> (<span class="keyword">const</span> <span class="keywordtype">void</span> *a, <span class="keyword">const</span> <span class="keywordtype">void</span> *b) {
<a name="l01647"></a>01647
<a name="l01648"></a>01648 <span class="keywordtype">int</span> *i, *j;
<a name="l01649"></a>01649
<a name="l01650"></a>01650 i = (<span class="keywordtype">int</span> *) a;
<a name="l01651"></a>01651 j = (<span class="keywordtype">int</span> *) b;
<a name="l01652"></a>01652 <span class="keywordflow">if</span> (*i > *j)
<a name="l01653"></a>01653 <span class="keywordflow">return</span> 1;
<a name="l01654"></a>01654 <span class="keywordflow">if</span> (*i < *j)
<a name="l01655"></a>01655 <span class="keywordflow">return</span> -1;
<a name="l01656"></a>01656 <span class="keywordflow">return</span> 0;
<a name="l01657"></a>01657 } <span class="comment">/* intcompare */</span>
<a name="l01658"></a>01658
<a name="l01659"></a>01659 <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#b36ea6380c23e4f21f32f19b148b2918">polylib_sqrt</a>(<span class="keywordtype">int</span> i);
<a name="l01660"></a><a class="code" href="Lattice_8c.html#6873054429fbd7cc187a08ec4776a749">01660</a> <span class="keyword">static</span> <a class="code" href="structfactor.html">factor</a> <a class="code" href="Lattice_8c.html#6873054429fbd7cc187a08ec4776a749">allfactors</a> (<span class="keywordtype">int</span> num) {
<a name="l01661"></a>01661
<a name="l01662"></a>01662 <span class="keywordtype">int</span> i,j, tmp;
<a name="l01663"></a>01663 <span class="keywordtype">int</span> noofelmts = 1;
<a name="l01664"></a>01664 <span class="keywordtype">int</span> *list, *newlist;
<a name="l01665"></a>01665 <span class="keywordtype">int</span> count;
<a name="l01666"></a>01666 <a class="code" href="structfactor.html">factor</a> result;
<a name="l01667"></a>01667
<a name="l01668"></a>01668 list = (<span class="keywordtype">int</span> *)malloc(<span class="keyword">sizeof</span> (<span class="keywordtype">int</span>));
<a name="l01669"></a>01669 list[0] = 1;
<a name="l01670"></a>01670
<a name="l01671"></a>01671 tmp = num;
<a name="l01672"></a>01672 <span class="keywordflow">for</span> (i = 2; i <= <a class="code" href="Lattice_8c.html#b36ea6380c23e4f21f32f19b148b2918">polylib_sqrt</a>(tmp); i++) {
<a name="l01673"></a>01673 <span class="keywordflow">if</span> ((tmp % i) == 0) {
<a name="l01674"></a>01674 <span class="keywordflow">if</span> (noofelmts == 0) {
<a name="l01675"></a>01675 list = (<span class="keywordtype">int</span> *) malloc (<span class="keyword">sizeof</span> (<span class="keywordtype">int</span>));
<a name="l01676"></a>01676 list[0] = i;
<a name="l01677"></a>01677 noofelmts = 1;
<a name="l01678"></a>01678 }
<a name="l01679"></a>01679 <span class="keywordflow">else</span> {
<a name="l01680"></a>01680 newlist = (<span class="keywordtype">int</span> *) malloc (<span class="keyword">sizeof</span> (<span class="keywordtype">int</span>) * 2 * noofelmts + 1);
<a name="l01681"></a>01681 <span class="keywordflow">for</span> (j = 0; j < noofelmts; j++)
<a name="l01682"></a>01682 newlist[j] = list[j] ;
<a name="l01683"></a>01683 newlist[j] = i;
<a name="l01684"></a>01684 <span class="keywordflow">for</span> (j = 0; j < noofelmts; j++)
<a name="l01685"></a>01685 newlist[j+noofelmts+1] = i * list[j];
<a name="l01686"></a>01686 free (list);
<a name="l01687"></a>01687 list = newlist;
<a name="l01688"></a>01688 noofelmts= 2*noofelmts+1;
<a name="l01689"></a>01689 }
<a name="l01690"></a>01690 tmp = tmp / i;
<a name="l01691"></a>01691 i = 1;
<a name="l01692"></a>01692 }
<a name="l01693"></a>01693 }
<a name="l01694"></a>01694
<a name="l01695"></a>01695 <span class="keywordflow">if</span> ((tmp != 0) && (tmp != num)) {
<a name="l01696"></a>01696 newlist = (<span class="keywordtype">int</span> *) malloc (<span class="keyword">sizeof</span> (<span class="keywordtype">int</span>) * 2 * noofelmts + 1);
<a name="l01697"></a>01697 <span class="keywordflow">for</span> (j = 0; j < noofelmts; j ++)
<a name="l01698"></a>01698 newlist[j] = list[j] ;
<a name="l01699"></a>01699 newlist[j] = tmp;
<a name="l01700"></a>01700 <span class="keywordflow">for</span> (j = 0; j < noofelmts; j ++)
<a name="l01701"></a>01701 newlist[j+noofelmts+1] = tmp * list[j];
<a name="l01702"></a>01702 free (list);
<a name="l01703"></a>01703 list = newlist;
<a name="l01704"></a>01704 noofelmts= 2*noofelmts+1;
<a name="l01705"></a>01705 }
<a name="l01706"></a>01706 qsort (list, noofelmts, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>), <a class="code" href="Lattice_8c.html#b4a31767671350bb32e2ffb875348ac6">intcompare</a>);
<a name="l01707"></a>01707 count = 1;
<a name="l01708"></a>01708 <span class="keywordflow">for</span> (i = 1; i < noofelmts; i ++)
<a name="l01709"></a>01709 <span class="keywordflow">if</span> (list[i] != list[i-1])
<a name="l01710"></a>01710 list[count++] = list[i];
<a name="l01711"></a>01711 <span class="keywordflow">if</span> (list[count-1] == num)
<a name="l01712"></a>01712 count --;
<a name="l01713"></a>01713
<a name="l01714"></a>01714 result.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a> = (<span class="keywordtype">int</span> *) malloc (<span class="keyword">sizeof</span> (<span class="keywordtype">int</span>) * count);
<a name="l01715"></a>01715 result.<a class="code" href="structfactor.html#e55e0a1174396542aa7f78afafa2ca4f">count</a> = count;
<a name="l01716"></a>01716 <span class="keywordflow">for</span> (i = 0; i < count; i ++)
<a name="l01717"></a>01717 result.<a class="code" href="structfactor.html#861dae14b5da38d1e143619c12318b8b">fac</a>[i] = list[i];
<a name="l01718"></a>01718 free (list);
<a name="l01719"></a>01719 <span class="keywordflow">return</span> result;
<a name="l01720"></a>01720 } <span class="comment">/* allfactors */</span>
<a name="l01721"></a>01721
<a name="l01722"></a><a class="code" href="Lattice_8c.html#b36ea6380c23e4f21f32f19b148b2918">01722</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="Lattice_8c.html#b36ea6380c23e4f21f32f19b148b2918">polylib_sqrt</a> (<span class="keywordtype">int</span> i) {
<a name="l01723"></a>01723
<a name="l01724"></a>01724 <span class="keywordtype">int</span> j;
<a name="l01725"></a>01725 j = 0;
<a name="l01726"></a>01726 i = i > 0 ? i : -i;
<a name="l01727"></a>01727
<a name="l01728"></a>01728 <span class="keywordflow">while</span> (1) {
<a name="l01729"></a>01729 <span class="keywordflow">if</span> ((j * j) > i)
<a name="l01730"></a>01730 <span class="keywordflow">break</span>;
<a name="l01731"></a>01731 <span class="keywordflow">else</span>
<a name="l01732"></a>01732 j ++;
<a name="l01733"></a>01733 }
<a name="l01734"></a>01734 <span class="keywordflow">return</span> (j-1);
<a name="l01735"></a>01735 } <span class="comment">/* polylib_sqrt */</span>
<a name="l01736"></a>01736
<a name="l01737"></a>01737
<a name="l01738"></a>01738
<a name="l01739"></a>01739
<a name="l01740"></a>01740
<a name="l01741"></a>01741
<a name="l01742"></a>01742
</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>
|
