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
|
<!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: ext_ehrhart.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>ext_ehrhart.c</h1><a href="ext__ehrhart_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001
<a name="l00002"></a>00002 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00003"></a>00003 <span class="preprocessor">#include <<a class="code" href="polylib_8h.html">polylib/polylib.h</a>></span>
<a name="l00004"></a><a class="code" href="ext__ehrhart_8c.html#59799636dce6e7dfa2ce20c48147fa6b">00004</a> <span class="preprocessor">#define WS 200 </span>
<a name="l00005"></a>00005 <span class="preprocessor"></span>
<a name="l00006"></a>00006 <span class="comment">/* #define UE_DEBUG */</span>
<a name="l00007"></a>00007
<a name="l00008"></a>00008
<a name="l00009"></a><a class="code" href="struct__Polyhedron__union.html">00009</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="struct__Polyhedron__union.html">_Polyhedron_union</a> {
<a name="l00010"></a><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">00010</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>;
<a name="l00011"></a><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">00011</a> <span class="keyword">struct </span><a class="code" href="struct__Polyhedron__union.html">_Polyhedron_union</a> *<a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>;} <a class="code" href="struct__Polyhedron__union.html">Polyhedron_union</a>;
<a name="l00012"></a>00012
<a name="l00013"></a>00013 <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#71f585bdcb55169c5207f612960e74b3">ppcm1</a> (<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b);
<a name="l00014"></a>00014 <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="ext__ehrhart_8c.html#301fdd12d3f7b14a8560c147426ab915">CalcBase</a>( <a class="code" href="structmatrix.html">Matrix</a> *R);
<a name="l00015"></a>00015
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="comment">/**** ker.c ****/</span>
<a name="l00018"></a>00018
<a name="l00019"></a>00019 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#5da79efdb8a7f801aaf7b6dfa3ce0d00">Soustraire_ligne</a>(<a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l1, <span class="keywordtype">int</span> l2, <span class="keywordtype">int</span> piv );
<a name="l00020"></a>00020 <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#4a60247388987989e5c063bfe2725977">existepivot</a>( <a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l );
<a name="l00021"></a>00021 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#bda61bc491d1fb64ad027f1ece418e46">swap_line</a>(<a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l1, <span class="keywordtype">int</span> l2);
<a name="l00022"></a>00022
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="comment">/* Caclule une base du noyau de l'application definie</span>
<a name="l00025"></a>00025 <span class="comment">par la matrice _carree_ R (completee par des 0..0) */</span>
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="comment">/* /!\ R est alteree par cette fonction. */</span>
<a name="l00028"></a>00028
<a name="l00029"></a><a class="code" href="ext__ehrhart_8c.html#301fdd12d3f7b14a8560c147426ab915">00029</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="ext__ehrhart_8c.html#301fdd12d3f7b14a8560c147426ab915">CalcBase</a>( <a class="code" href="structmatrix.html">Matrix</a> *R )
<a name="l00030"></a>00030 {
<a name="l00031"></a>00031 <a class="code" href="structmatrix.html">Matrix</a> *B<span class="comment">/*,*BTran*/</span>; <span class="comment">/* matrice des vect. de la base */</span>
<a name="l00032"></a>00032 <span class="keywordtype">int</span> i, j;
<a name="l00033"></a>00033 Value <a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00034"></a>00034 <span class="keywordtype">int</span> l; <span class="comment">/* ligne en cours de `pivotage' */</span>
<a name="l00035"></a>00035 <span class="keywordtype">int</span> lnn;
<a name="l00036"></a>00036 <span class="keywordtype">int</span> dimbase;
<a name="l00037"></a>00037 <span class="keywordtype">int</span> u; <span class="comment">/* vecteur util en cours de calcul */</span>
<a name="l00038"></a>00038 Value som;
<a name="l00039"></a>00039 <span class="keywordtype">int</span> c;
<a name="l00040"></a>00040 <span class="comment">/* diagonalisation de R : algo du pivot */</span>
<a name="l00041"></a>00041 <span class="comment">/* avec conservation des pivots nuls */</span>
<a name="l00042"></a>00042 <span class="keywordflow">for</span>( l=0 ; l<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++l )
<a name="l00043"></a>00043 {
<a name="l00044"></a>00044 <span class="comment">/* cherche le prochain pivot non nul */</span>
<a name="l00045"></a>00045 <span class="keywordflow">if</span>( (lnn=<a class="code" href="ext__ehrhart_8c.html#4a60247388987989e5c063bfe2725977">existepivot</a>(R,l)) != -1 )
<a name="l00046"></a>00046 {
<a name="l00047"></a>00047 <a class="code" href="ext__ehrhart_8c.html#bda61bc491d1fb64ad027f1ece418e46">swap_line</a>( R, l, lnn );
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="comment">/* met la colonne dessous a 0 */</span>
<a name="l00050"></a>00050 <span class="keywordflow">for</span>( j=l+1 ; j<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++j )
<a name="l00051"></a>00051 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>( R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]) )
<a name="l00052"></a>00052 <a class="code" href="ext__ehrhart_8c.html#5da79efdb8a7f801aaf7b6dfa3ce0d00">Soustraire_ligne</a>( R, l, j, l );
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="comment">/* et celle dessus aussi */</span>
<a name="l00055"></a>00055 <span class="keywordflow">for</span>( j=0 ; j<l ; ++j )
<a name="l00056"></a>00056 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]) )
<a name="l00057"></a>00057 <a class="code" href="ext__ehrhart_8c.html#5da79efdb8a7f801aaf7b6dfa3ce0d00">Soustraire_ligne</a>( R, l, j, l );
<a name="l00058"></a>00058
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060 <span class="comment">/* s'ils sont tous nuls on passe au suivant */</span>
<a name="l00061"></a>00061 <span class="comment">/* en laissant cette ligne inchangee. */</span>
<a name="l00062"></a>00062 }
<a name="l00063"></a>00063
<a name="l00064"></a>00064 dimbase = 0;
<a name="l00065"></a>00065 <span class="keywordflow">for</span>( l=0 ; l<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++l )
<a name="l00066"></a>00066 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][l]) )
<a name="l00067"></a>00067 ++dimbase; <span class="comment">/* = nb de 0 dans la diagonale */</span>
<a name="l00068"></a>00068
<a name="l00069"></a>00069 B = <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>( dimbase, R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> );
<a name="l00070"></a>00070
<a name="l00071"></a>00071 l=0;
<a name="l00072"></a>00072 <span class="keywordflow">for</span>( u=0 ; u<dimbase ; ++u )
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074 <span class="keywordflow">while</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>( R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l][l]) )
<a name="l00075"></a>00075 ++l;
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="comment">/* calcul effectif de ce vecteur : chaque coord en commencant par le bas */</span>
<a name="l00078"></a>00078 <span class="keywordflow">for</span>( i=R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1 ; i>l ; --i )
<a name="l00079"></a>00079 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i], 0);
<a name="l00080"></a>00080 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][l], 1);
<a name="l00081"></a>00081 <span class="keywordflow">for</span>( i=l-1 ; i>=0 ; --i ) <span class="comment">/* i=chaque coord du vecteur */</span>
<a name="l00082"></a>00082 {
<a name="l00083"></a>00083 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>( R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]) )
<a name="l00084"></a>00084 <span class="comment">/* on a deux 0... un seul dans */</span>
<a name="l00085"></a>00085 <span class="comment">/* ce vect util suffit */</span>
<a name="l00086"></a>00086 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i],0);
<a name="l00087"></a>00087 <span class="keywordflow">else</span>
<a name="l00088"></a>00088 {
<a name="l00089"></a>00089 <span class="comment">/* somme des coef deja calcules * coef dans la matrice */</span>
<a name="l00090"></a>00090 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(som,0);
<a name="l00091"></a>00091 <span class="keywordflow">for</span>( c=l ; c>i ; --c )
<a name="l00092"></a>00092 {
<a name="l00093"></a>00093 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(som, R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][c], B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][c]);
<a name="l00094"></a>00094 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][c] ,B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][c] , R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][i]);
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i] , som );
<a name="l00097"></a>00097 }
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099 <span class="comment">/* reste a faire le pgcd du vecteur et a l'orienter */</span>
<a name="l00100"></a>00100 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(p,0);
<a name="l00101"></a>00101 <span class="keywordflow">for</span>( i=0 ; i<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++i )
<a name="l00102"></a>00102 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(p, p, B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i]);
<a name="l00103"></a>00103 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(p))
<a name="l00104"></a>00104 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(p,1);
<a name="l00105"></a>00105 <span class="keywordflow">for</span>( i=0 ; i<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> && <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i]); ++i )
<a name="l00106"></a>00106 ;
<a name="l00107"></a>00107 <span class="keywordflow">if</span>( i<R->NbRows )
<a name="l00108"></a>00108 <span class="keywordflow">if</span>( <a class="code" href="source_2arith_2arithmetique_8h.html#f031da52c8a160fd1ee6e4c793f8c78a">value_neg_p</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i]) )
<a name="l00109"></a>00109 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>( p,p );
<a name="l00110"></a>00110
<a name="l00111"></a>00111 <span class="keywordflow">for</span>( i=0 ; i<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++i )
<a name="l00112"></a>00112 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i], B-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[u][i], p);
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="comment">/* incrementer le compteur de lignes */</span>
<a name="l00115"></a>00115 ++l;
<a name="l00116"></a>00116 }
<a name="l00117"></a>00117 <span class="keywordflow">return</span> B;
<a name="l00118"></a>00118 }
<a name="l00119"></a>00119
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="comment">/* fonction qui calcule les vect generateurs de l'espace vectoriel</span>
<a name="l00122"></a>00122 <span class="comment"> contenant le polyhedre P */</span>
<a name="l00123"></a>00123 <span class="comment">/*</span>
<a name="l00124"></a>00124 <span class="comment">Matrix *CalcPolyhedronBase( Polyhedron *P )</span>
<a name="l00125"></a>00125 <span class="comment">{</span>
<a name="l00126"></a>00126 <span class="comment"> Matrix *R;</span>
<a name="l00127"></a>00127 <span class="comment"> Matrix *B;</span>
<a name="l00128"></a>00128 <span class="comment"> int n, lines;</span>
<a name="l00129"></a>00129 <span class="comment"> </span>
<a name="l00130"></a>00130 <span class="comment"> if( emptyQ(P) )</span>
<a name="l00131"></a>00131 <span class="comment"> return( Matrix_Alloc( 0, P->Dimension ) ); */</span> <span class="comment">/* pas de vect. gen */</span> <span class="comment">/*</span>
<a name="l00132"></a>00132 <span class="comment"> </span>
<a name="l00133"></a>00133 <span class="comment"> R = Matrix_Alloc( P->Dimension, P->Dimension );</span>
<a name="l00134"></a>00134 <span class="comment"> </span>
<a name="l00135"></a>00135 <span class="comment"> */</span> <span class="comment">/* recopie le 'lineality space' du polyedre dans la matrice R */</span> <span class="comment">/*</span>
<a name="l00136"></a>00136 <span class="comment"> for( lines=0,n=0 ; n<P->NbConstraints ; ++n )</span>
<a name="l00137"></a>00137 <span class="comment"> {</span>
<a name="l00138"></a>00138 <span class="comment"> if( P->Constraint[n][0]==0 )</span>
<a name="l00139"></a>00139 <span class="comment"> */</span> <span class="comment">/* c'est une direction definissant un ss-espace */</span> <span class="comment">/*</span>
<a name="l00140"></a>00140 <span class="comment"> {</span>
<a name="l00141"></a>00141 <span class="comment"> memcpy( &R->p[lines][0], &P->Constraint[n][1],</span>
<a name="l00142"></a>00142 <span class="comment"> sizeof(int)*P->Dimension );</span>
<a name="l00143"></a>00143 <span class="comment"> ++lines;</span>
<a name="l00144"></a>00144 <span class="comment"> }</span>
<a name="l00145"></a>00145 <span class="comment"> }</span>
<a name="l00146"></a>00146 <span class="comment"> */</span> <span class="comment">/* remplit le reste de 0..0 */</span> <span class="comment">/*</span>
<a name="l00147"></a>00147 <span class="comment"> for( ; lines<R->NbRows ; ++lines )</span>
<a name="l00148"></a>00148 <span class="comment"> memset( &R->p[lines][0], 0, sizeof(int)*P->Dimension );</span>
<a name="l00149"></a>00149 <span class="comment"> </span>
<a name="l00150"></a>00150 <span class="comment"> B = CalcBase( R );</span>
<a name="l00151"></a>00151 <span class="comment"> Matrix_Free( R );</span>
<a name="l00152"></a>00152 <span class="comment"> </span>
<a name="l00153"></a>00153 <span class="comment"> return( B );</span>
<a name="l00154"></a>00154 <span class="comment">}*/</span>
<a name="l00155"></a>00155
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="comment">/* fonction qui calcule l'espace vectoriel non parametre de dimension dim</span>
<a name="l00158"></a>00158 <span class="comment"> contenant le polyhedre parametre P */</span>
<a name="l00159"></a>00159 <span class="comment">/* les _egalites_ sont stockees par la polylib sous forme triangulaire</span>
<a name="l00160"></a>00160 <span class="comment">superieure donc il suffit de prendre les premieres. */</span>
<a name="l00161"></a>00161
<a name="l00162"></a>00162 <span class="comment">/*Matrix *CalcEVPolyhedronNP( Polyhedron *P, int dim )</span>
<a name="l00163"></a>00163 <span class="comment">{</span>
<a name="l00164"></a>00164 <span class="comment"> Matrix *R;</span>
<a name="l00165"></a>00165 <span class="comment"> Matrix *B;</span>
<a name="l00166"></a>00166 <span class="comment"> int n, lines;</span>
<a name="l00167"></a>00167 <span class="comment"></span>
<a name="l00168"></a>00168 <span class="comment"> if( emptyQ(P) ) */</span> <span class="comment">/* pas de vect. gen */</span> <span class="comment">/*</span>
<a name="l00169"></a>00169 <span class="comment"> {</span>
<a name="l00170"></a>00170 <span class="comment"> B = Matrix_Alloc( 1, dim ); */</span> <span class="comment">/* on ne peut pas allouer 0 lignes ! */</span> <span class="comment">/*</span>
<a name="l00171"></a>00171 <span class="comment"> B->NbRows = 0;</span>
<a name="l00172"></a>00172 <span class="comment"> return( B );</span>
<a name="l00173"></a>00173 <span class="comment"> }</span>
<a name="l00174"></a>00174 <span class="comment"></span>
<a name="l00175"></a>00175 <span class="comment"> R = Matrix_Alloc( dim, dim );</span>
<a name="l00176"></a>00176 <span class="comment"></span>
<a name="l00177"></a>00177 <span class="comment">*/</span> <span class="comment">/* recopie le 'lineality space' du polyedre dans la matrice R */</span> <span class="comment">/*</span>
<a name="l00178"></a>00178 <span class="comment"> for( lines=0,n=0 ; n<P->NbConstraints && lines<dim ; ++n )</span>
<a name="l00179"></a>00179 <span class="comment"> {</span>
<a name="l00180"></a>00180 <span class="comment"> if( P->Constraint[n][0]==0 )</span>
<a name="l00181"></a>00181 <span class="comment"> */</span> <span class="comment">/* c'est une direction definissant un ss-espace */</span> <span class="comment">/*</span>
<a name="l00182"></a>00182 <span class="comment"> {</span>
<a name="l00183"></a>00183 <span class="comment"> memcpy( &R->p[lines][0], &P->Constraint[n][1],</span>
<a name="l00184"></a>00184 <span class="comment"> sizeof(int)*P->Dimension );</span>
<a name="l00185"></a>00185 <span class="comment"> ++lines;</span>
<a name="l00186"></a>00186 <span class="comment"> }</span>
<a name="l00187"></a>00187 <span class="comment"> }</span>
<a name="l00188"></a>00188 <span class="comment">*/</span> <span class="comment">/* remplit le reste de 0..0 */</span> <span class="comment">/*</span>
<a name="l00189"></a>00189 <span class="comment"> for( ; lines<R->NbRows ; ++lines )</span>
<a name="l00190"></a>00190 <span class="comment"> memset( &R->p[lines][0], 0, sizeof(int)*dim );</span>
<a name="l00191"></a>00191 <span class="comment"></span>
<a name="l00192"></a>00192 <span class="comment"> B = CalcBase( R );</span>
<a name="l00193"></a>00193 <span class="comment"> Matrix_Free( R );</span>
<a name="l00194"></a>00194 <span class="comment"></span>
<a name="l00195"></a>00195 <span class="comment"> return( B );</span>
<a name="l00196"></a>00196 <span class="comment">}*/</span>
<a name="l00197"></a>00197
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="comment">/* renvoie la ligne sur laquelle on a trouve un coef non nul */</span>
<a name="l00200"></a>00200 <span class="comment">/* pareil mais cherche dans toutes les lignes */</span>
<a name="l00201"></a>00201 <span class="comment">/* et -1 s'il n'y en a pas. */</span>
<a name="l00202"></a><a class="code" href="ext__ehrhart_8c.html#4a60247388987989e5c063bfe2725977">00202</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#4a60247388987989e5c063bfe2725977">existepivot</a>( <a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l )
<a name="l00203"></a>00203 {
<a name="l00204"></a>00204 <span class="keywordtype">int</span> j, c;
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="keywordflow">for</span>( j=l ; j<R-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> ; ++j )
<a name="l00207"></a>00207 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>( R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]) )
<a name="l00208"></a>00208 <span class="keywordflow">return</span>( j );
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="comment">/* on ne l'a pas trouve pour l'instant... on cherche au dessus */</span>
<a name="l00211"></a>00211 <span class="comment">/* les lignes ayant que des 0 jusqu'a la position l */</span>
<a name="l00212"></a>00212 <span class="keywordflow">for</span>( j=0 ; j<l ; ++j )
<a name="l00213"></a>00213 {
<a name="l00214"></a>00214 <span class="keywordflow">for</span>( c=0 ; c<l && <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][c]) ; c++ )
<a name="l00215"></a>00215 ;
<a name="l00216"></a>00216 <span class="keywordflow">if</span>( c==l && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][l]) )
<a name="l00217"></a>00217 <span class="keywordflow">return</span>( j );
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="keywordflow">return</span>( -1 );
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="comment">/* echange les lignes l1 et l2 dans la matrice R */</span>
<a name="l00225"></a><a class="code" href="ext__ehrhart_8c.html#bda61bc491d1fb64ad027f1ece418e46">00225</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#bda61bc491d1fb64ad027f1ece418e46">swap_line</a>(<a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l1, <span class="keywordtype">int</span> l2)
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 <span class="keywordtype">int</span> i;
<a name="l00228"></a>00228 Value tmp;
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="keywordflow">if</span>( l1 != l2 )
<a name="l00231"></a>00231 <span class="keywordflow">for</span>(i = 0;i < R-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;i ++)
<a name="l00232"></a>00232 {
<a name="l00233"></a>00233 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(tmp , R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l1][i]);
<a name="l00234"></a>00234 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l1][i] , R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i]);
<a name="l00235"></a>00235 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i] , tmp);
<a name="l00236"></a>00236 }
<a name="l00237"></a>00237 }
<a name="l00238"></a>00238
<a name="l00239"></a>00239
<a name="l00240"></a>00240
<a name="l00241"></a><a class="code" href="ext__ehrhart_8c.html#1b15dffeaad8bde724a59adea33429a5">00241</a> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#1b15dffeaad8bde724a59adea33429a5">pgcd1</a>( <span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b)
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 <span class="keywordtype">int</span> r;
<a name="l00244"></a>00244 <span class="keywordflow">if</span>( a== 0 )
<a name="l00245"></a>00245 <span class="keywordflow">return</span>( abs(b) );
<a name="l00246"></a>00246 <span class="keywordflow">if</span>(b==0 )
<a name="l00247"></a>00247 <span class="keywordflow">return</span>(abs(a) );
<a name="l00248"></a>00248 <span class="keywordflow">do</span>
<a name="l00249"></a>00249 {
<a name="l00250"></a>00250 r= a % b;
<a name="l00251"></a>00251 a= b;
<a name="l00252"></a>00252 b = r;
<a name="l00253"></a>00253 }
<a name="l00254"></a>00254 <span class="keywordflow">while</span> ( r!=0 );
<a name="l00255"></a>00255 <span class="keywordflow">return</span>(abs(a));
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a>00258
<a name="l00259"></a>00259
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="comment">/* Soustraire la ligne l1 de l2 */</span>
<a name="l00262"></a>00262 <span class="comment">/* On effectue l2 = (l1[piv]/pgcd)*l2 - l1 * (l2[piv]/pgcd) */</span>
<a name="l00263"></a><a class="code" href="ext__ehrhart_8c.html#5da79efdb8a7f801aaf7b6dfa3ce0d00">00263</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#5da79efdb8a7f801aaf7b6dfa3ce0d00">Soustraire_ligne</a>(<a class="code" href="structmatrix.html">Matrix</a> *R, <span class="keywordtype">int</span> l1, <span class="keywordtype">int</span> l2, <span class="keywordtype">int</span> piv )
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 <span class="keywordtype">int</span> i;
<a name="l00266"></a>00266 Value a, b, <a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>, t;
<a name="l00267"></a>00267 <span class="comment">/* l2 = a*l2 - b*l1 */</span>
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][piv] )) <span class="comment">/* c'est deja fait ! */</span>
<a name="l00270"></a>00270 <span class="keywordflow">return</span>;
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(a);
<a name="l00273"></a>00273 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(b);
<a name="l00274"></a>00274 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(p);
<a name="l00275"></a>00275 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(t);
<a name="l00276"></a>00276
<a name="l00277"></a>00277 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(p, R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l1][piv], R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][piv]);
<a name="l00278"></a>00278 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(a, R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l1][piv], p);
<a name="l00279"></a>00279 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(b, R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][piv], p);
<a name="l00280"></a>00280
<a name="l00281"></a>00281 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][piv] , 0);
<a name="l00282"></a>00282 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(p,0);
<a name="l00283"></a>00283 <span class="keywordflow">for</span>(i = piv + 1;i < R-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;i ++)
<a name="l00284"></a>00284 {
<a name="l00285"></a>00285 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(t,b,R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l1][i]);
<a name="l00286"></a>00286 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i],a,R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i]);
<a name="l00287"></a>00287 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i],R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i],t);
<a name="l00288"></a>00288 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(p, p, R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i]);
<a name="l00289"></a>00289 }
<a name="l00290"></a>00290 <span class="comment">/* Simplification par le pgcd de toute la ligne */</span>
<a name="l00291"></a>00291 <span class="keywordflow">for</span>( i=piv+1 ; i<R-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> && p!=0 ; i++ )
<a name="l00292"></a>00292 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i], R-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[l2][i], p);
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(a);
<a name="l00295"></a>00295 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(b);
<a name="l00296"></a>00296 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(p);
<a name="l00297"></a>00297 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(t);
<a name="l00298"></a>00298 }
<a name="l00299"></a>00299
<a name="l00300"></a>00300
<a name="l00301"></a>00301 <span class="comment">/*** ext_ehrhart.c ****/</span>
<a name="l00302"></a>00302
<a name="l00303"></a>00303
<a name="l00304"></a><a class="code" href="ext__ehrhart_8h.html#1758d39c40dcdf8916517a34133f54e8">00304</a> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(<a class="code" href="struct__evalue.html">evalue</a> *e1,<a class="code" href="struct__evalue.html">evalue</a> *res) {
<a name="l00305"></a>00305 <span class="keywordtype">int</span> i, <a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>, x, y;
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <a class="code" href="struct__evalue.html">evalue</a> *ne;
<a name="l00308"></a>00308 Value g,m1,m2;
<a name="l00309"></a>00309
<a name="l00310"></a>00310 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(g);
<a name="l00311"></a>00311 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m1);
<a name="l00312"></a>00312 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(m2);
<a name="l00313"></a>00313 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00314"></a>00314 <span class="comment">/* Add two rational numbers*/</span>
<a name="l00315"></a>00315 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m1,e1->x.n,res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00316"></a>00316 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(m2,res->x.n,e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00317"></a>00317 <a class="code" href="source_2arith_2arithmetique_8h.html#ea216a0e750144f0e6eb9b0a82583739">value_addto</a>(res->x.n,m1,m2);
<a name="l00318"></a>00318 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00319"></a>00319 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(g, res->x.n,res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00320"></a>00320 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(g)) {
<a name="l00321"></a>00321 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, g);
<a name="l00322"></a>00322 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(res->x.n, res->x.n, g);
<a name="l00323"></a>00323 }
<a name="l00324"></a>00324 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00325"></a>00325 return ;
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00328"></a>00328 <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00329"></a>00329 <span class="comment">/* Add the constant to the constant term of a polynomial*/</span>
<a name="l00330"></a>00330 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(e1, &res->x.p->arr[0]);
<a name="l00331"></a>00331 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00332"></a>00332 return ;
<a name="l00333"></a>00333 }
<a name="l00334"></a>00334 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00335"></a>00335 <span class="comment">/* Add the constant to all elements of a periodic number */</span>
<a name="l00336"></a>00336 <span class="keywordflow">for</span> (i=0; i<res->x.p->size; i++) {
<a name="l00337"></a>00337 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(e1, &res->x.p->arr[i]);
<a name="l00338"></a>00338 }
<a name="l00339"></a>00339 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00340"></a>00340
<a name="l00341"></a>00341 return ;
<a name="l00342"></a>00342 }
<a name="l00343"></a>00343 <span class="keywordflow">else</span> {
<a name="l00344"></a>00344 fprintf(stderr, <span class="stringliteral">"eadd: cannot add const with vector\n"</span>);
<a name="l00345"></a>00345 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00346"></a>00346
<a name="l00347"></a>00347 <span class="keywordflow">return</span>;
<a name="l00348"></a>00348 }
<a name="l00349"></a>00349 }
<a name="l00350"></a>00350 <span class="comment">/* ######### add polynomial or periodic to constant #############</span>
<a name="l00351"></a>00351 <span class="comment"> you have to exchange e1 and res, before doing addition */</span>
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(e1-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>) && <a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00354"></a>00354 <a class="code" href="struct__enode.html">enode</a> *tmp;
<a name="l00355"></a>00355 <a class="code" href="struct__evalue.html">evalue</a> x;
<a name="l00356"></a>00356 x=*res;
<a name="l00357"></a>00357 tmp= <a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(e1->x.p);
<a name="l00358"></a>00358 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00359"></a>00359 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( res-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, 0 );
<a name="l00360"></a>00360 res->x.p=tmp;
<a name="l00361"></a>00361
<a name="l00362"></a>00362 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&x,res);
<a name="l00363"></a>00363 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00364"></a>00364 return ;
<a name="l00365"></a>00365 }
<a name="l00366"></a>00366 <span class="keywordflow">else</span> { <span class="comment">/* ((e1->d==0) && (res->d==0)) */</span>
<a name="l00367"></a>00367 <span class="keywordflow">if</span> ((e1->x.p->type != res->x.p->type) ) {
<a name="l00368"></a>00368 <span class="comment">/* ##### adding to evalues of different type. two cases are possible #### </span>
<a name="l00369"></a>00369 <span class="comment"> </span>
<a name="l00370"></a>00370 <span class="comment"> #### res is periodic and e1 is polynomial, you have to exchange</span>
<a name="l00371"></a>00371 <span class="comment"> e1 and res then to add e1 to the constant term of res #### */</span>
<a name="l00372"></a>00372 <span class="keywordflow">if</span> ((res->x.p->type == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>)&&(e1->x.p->type == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>)) {
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <a class="code" href="struct__evalue.html">evalue</a> eval;
<a name="l00375"></a>00375 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( eval.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, 0 );
<a name="l00376"></a>00376 eval.x.p=<a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(res->x.p);
<a name="l00377"></a>00377 res->x.p= <a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(e1->x.p);
<a name="l00378"></a>00378 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&eval,&res->x.p->arr[0]);
<a name="l00379"></a>00379
<a name="l00380"></a>00380 }
<a name="l00381"></a>00381 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((res->x.p->type == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>)&&(e1->x.p->type == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>)) {
<a name="l00382"></a>00382 <span class="comment">/* #### res is polynomial and e1 is periodic,</span>
<a name="l00383"></a>00383 <span class="comment"> add e1 to the constant term of res #### */</span>
<a name="l00384"></a>00384
<a name="l00385"></a>00385 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(e1,&res->x.p->arr[0]);
<a name="l00386"></a>00386 }
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00389"></a>00389 <span class="keywordflow">return</span>;
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (e1->x.p->pos != res->x.p->pos ) {
<a name="l00392"></a>00392 <span class="comment">/* ### adding evalues of different position (i.e function of different unknowns</span>
<a name="l00393"></a>00393 <span class="comment"> to case are possible ### */</span>
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="keywordflow">if</span> (res->x.p->type == <a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {<span class="comment">/* ### res and e1 are polynomials</span>
<a name="l00396"></a>00396 <span class="comment"> add e1 to the constant term of res */</span>
<a name="l00397"></a>00397
<a name="l00398"></a>00398 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(e1,&res->x.p->arr[0]);
<a name="l00399"></a>00399 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00400"></a>00400 <span class="keywordflow">return</span>;
<a name="l00401"></a>00401 }
<a name="l00402"></a>00402 <span class="keywordflow">else</span> { <span class="comment">/* ### res and e1 are pointers to periodic numbers</span>
<a name="l00403"></a>00403 <span class="comment"> add e1 to all elements of res */</span>
<a name="l00404"></a>00404
<a name="l00405"></a>00405 <span class="keywordflow">for</span> (i=0;i<res->x.p->size;i++) {
<a name="l00406"></a>00406 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(e1,&res->x.p->arr[i]);
<a name="l00407"></a>00407 }
<a name="l00408"></a>00408 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00409"></a>00409 <span class="keywordflow">return</span>;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411
<a name="l00412"></a>00412
<a name="l00413"></a>00413 } <span class="comment">/* ### */</span>
<a name="l00414"></a>00414
<a name="l00415"></a>00415
<a name="l00416"></a>00416 <span class="comment">/* same type , same pos and same size */</span>
<a name="l00417"></a>00417 <span class="keywordflow">if</span> (e1->x.p->size == res->x.p->size) {
<a name="l00418"></a>00418 <span class="comment">/* add any element in e1 to the corresponding element in res */</span>
<a name="l00419"></a>00419 <span class="keywordflow">for</span> (i=0; i<res->x.p->size; i++) {
<a name="l00420"></a>00420 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&e1->x.p->arr[i], &res->x.p->arr[i]);
<a name="l00421"></a>00421 }
<a name="l00422"></a>00422 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00423"></a>00423 return ;
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <span class="comment">/* Sizes are different */</span>
<a name="l00427"></a>00427 <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409feda486649798da33c51389df14eaccd3ce">polynomial</a>) {
<a name="l00428"></a>00428 <span class="comment">/* VIN100: if e1-size > res-size you have to copy e1 in a */</span>
<a name="l00429"></a>00429 <span class="comment">/* new enode and add res to that new node. If you do not do */</span>
<a name="l00430"></a>00430 <span class="comment">/* that, you lose the the upper weight part of e1 ! */</span>
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <span class="keywordflow">if</span>(e1->x.p->size > res->x.p->size) {
<a name="l00433"></a>00433 <a class="code" href="struct__enode.html">enode</a> *tmp;
<a name="l00434"></a>00434 tmp = <a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(e1->x.p);
<a name="l00435"></a>00435 <span class="keywordflow">for</span>(i=0;i<res->x.p->size;++i) {
<a name="l00436"></a>00436 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&res->x.p->arr[i], &tmp-><a class="code" href="struct__enode.html#215794f8b8ab87573bd46f14a8e916d4">arr</a>[i]);
<a name="l00437"></a>00437 <span class="comment">/* free_evalue_refs(&res->x.p->arr[i]); */</span>
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439 res->x.p = tmp;
<a name="l00440"></a>00440
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442 <span class="keywordflow">else</span> {
<a name="l00443"></a>00443
<a name="l00444"></a>00444 <span class="keywordflow">for</span> (i=0; i<e1->x.p->size ; i++) {
<a name="l00445"></a>00445 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&e1->x.p->arr[i], &res->x.p->arr[i]);
<a name="l00446"></a>00446 }
<a name="l00447"></a>00447 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00448"></a>00448
<a name="l00449"></a>00449 return ;
<a name="l00450"></a>00450 }
<a name="l00451"></a>00451 }
<a name="l00452"></a>00452
<a name="l00453"></a>00453 <span class="comment">/* ### add two periodics of the same pos (unknown) but whith different sizes (periods) ### */</span>
<a name="l00454"></a>00454 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res->x.p->type==<a class="code" href="types_8h.html#01e5f42033d0f34c1a182a25a7409fed3cb930eb7594d2236ab4fc6dd622c207">periodic</a>) {
<a name="l00455"></a>00455 <span class="comment">/* you have to create a new evalue 'ne' in whitch size equals to the scm</span>
<a name="l00456"></a>00456 <span class="comment"> of the sizes of e1 and res, then to copy res periodicaly in ne, after</span>
<a name="l00457"></a>00457 <span class="comment"> to add periodicaly elements of e1 to elements of ne, and finaly to </span>
<a name="l00458"></a>00458 <span class="comment"> return ne. */</span>
<a name="l00459"></a>00459
<a name="l00460"></a>00460 x=e1->x.p->size;
<a name="l00461"></a>00461 y= res->x.p->size;
<a name="l00462"></a>00462 p=<a class="code" href="ext__ehrhart_8c.html#71f585bdcb55169c5207f612960e74b3">ppcm1</a>(x,y);
<a name="l00463"></a>00463 ne= (<a class="code" href="struct__evalue.html">evalue</a> *) malloc (<span class="keyword">sizeof</span>(<a class="code" href="struct__evalue.html">evalue</a>));
<a name="l00464"></a>00464 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(ne-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00465"></a>00465 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( ne-><a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>,0);
<a name="l00466"></a>00466
<a name="l00467"></a>00467 ne->x.p=<a class="code" href="ehrhart_8c.html#7acd3dfb7d74bf5551bce6f31f7189bc" title="EHRHART POLYNOMIAL SYMBOLIC ALGEBRA SYSTEM.">new_enode</a>(res->x.p->type,p, res->x.p->pos);
<a name="l00468"></a>00468 <span class="keywordflow">for</span>(i=0;i<p;i++) {
<a name="l00469"></a>00469 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(ne->x.p->arr[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, res->x.p->arr[i%y].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00470"></a>00470 <span class="keywordflow">if</span> (<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(ne->x.p->arr[i].<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00471"></a>00471 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(ne->x.p->arr[i].x.n);
<a name="l00472"></a>00472 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(ne->x.p->arr[i].x.n, res->x.p->arr[i%y].x.n);
<a name="l00473"></a>00473 }
<a name="l00474"></a>00474 <span class="keywordflow">else</span> {
<a name="l00475"></a>00475 ne->x.p->arr[i].x.p =<a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(res->x.p->arr[i%y].x.p);
<a name="l00476"></a>00476 }
<a name="l00477"></a>00477 }
<a name="l00478"></a>00478 <span class="keywordflow">for</span>(i=0;i<p;i++) {
<a name="l00479"></a>00479 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&e1->x.p->arr[i%x], &ne->x.p->arr[i]);
<a name="l00480"></a>00480 }
<a name="l00481"></a>00481
<a name="l00482"></a>00482 res=ne;
<a name="l00483"></a>00483
<a name="l00484"></a>00484 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00485"></a>00485 return ;
<a name="l00486"></a>00486 }
<a name="l00487"></a>00487 <span class="keywordflow">else</span> { <span class="comment">/* evector */</span>
<a name="l00488"></a>00488 fprintf(stderr, <span class="stringliteral">"eadd: ?cannot add vectors of different length\n"</span>);
<a name="l00489"></a>00489 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00490"></a>00490 return ;
<a name="l00491"></a>00491 }
<a name="l00492"></a>00492 }
<a name="l00493"></a>00493 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(g); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m1); <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(m2);
<a name="l00494"></a>00494 return ;
<a name="l00495"></a>00495 } <span class="comment">/* new_eadd */</span>
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <span class="comment">/* remove the last row and the last column of a matrix Mat */</span>
<a name="l00498"></a><a class="code" href="ext__ehrhart_8c.html#da49ee072a02798c5557853034894158">00498</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="ext__ehrhart_8c.html#da49ee072a02798c5557853034894158">Reduce_Matrix</a> (<a class="code" href="structmatrix.html">Matrix</a> *Mat) {
<a name="l00499"></a>00499 <span class="keywordtype">int</span> i;
<a name="l00500"></a>00500 Value *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00501"></a>00501 p=*(Mat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>+(Mat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1));
<a name="l00502"></a>00502 <span class="keywordflow">for</span> (i=0;i<Mat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>; i++) {
<a name="l00503"></a>00503 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(*p++);
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505 <span class="keywordflow">for</span> (i=0; i<Mat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>-1; i++) {
<a name="l00506"></a>00506 p=*(Mat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>+i);
<a name="l00507"></a>00507 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(*(p+(Mat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>-1)));
<a name="l00508"></a>00508 }
<a name="l00509"></a>00509 Mat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>--;
<a name="l00510"></a>00510 Mat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>--;
<a name="l00511"></a>00511 <span class="keywordflow">return</span> Mat;
<a name="l00512"></a>00512 } <span class="comment">/* Reduce_Matrix */</span>
<a name="l00513"></a>00513
<a name="l00514"></a>00514
<a name="l00515"></a>00515 <span class="comment">/* Computes the scalar product (in euclidien space) of two vectors */</span>
<a name="l00516"></a>00516
<a name="l00517"></a><a class="code" href="ext__ehrhart_8c.html#3c8687093fe77f61c70d3d52f2867a71">00517</a> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#3c8687093fe77f61c70d3d52f2867a71">Scalar_product</a>(Value *p1,Value *p2,<span class="keywordtype">unsigned</span> length, Value *r) {
<a name="l00518"></a>00518 Value *cp1, *cp2;
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="keywordtype">int</span> i;
<a name="l00521"></a>00521 cp1=p1;
<a name="l00522"></a>00522 cp2=p2;
<a name="l00523"></a>00523 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(*r,0);
<a name="l00524"></a>00524 <span class="keywordflow">for</span> (i=0;i<length;i++) {
<a name="l00525"></a>00525 <a class="code" href="source_2arith_2arithmetique_8h.html#9900fbd029b36f5887e587642a064a52">value_addmul</a>(*r, *cp1, *cp2);
<a name="l00526"></a>00526 cp1++; cp2++;
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528 } <span class="comment">/* Scalar_product */</span>
<a name="l00529"></a>00529
<a name="l00530"></a>00530 <span class="comment">/* computes the scm of two integrals */</span>
<a name="l00531"></a>00531
<a name="l00532"></a><a class="code" href="ext__ehrhart_8c.html#71f585bdcb55169c5207f612960e74b3">00532</a> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#71f585bdcb55169c5207f612960e74b3">ppcm1</a> (<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {
<a name="l00533"></a>00533 <span class="keywordtype">int</span> t;
<a name="l00534"></a>00534 t = (a*b)/ <a class="code" href="ext__ehrhart_8c.html#1b15dffeaad8bde724a59adea33429a5">pgcd1</a>(a,b);
<a name="l00535"></a>00535 <span class="keywordflow">return</span> t;
<a name="l00536"></a>00536 } <span class="comment">/* ppcm1 */</span>
<a name="l00537"></a>00537
<a name="l00538"></a>00538
<a name="l00539"></a><a class="code" href="ext__ehrhart_8c.html#1d0568ced2e25ee2ce5495518d3254bf">00539</a> <a class="code" href="structmatrix.html">Matrix</a> *<a class="code" href="ext__ehrhart_8c.html#1d0568ced2e25ee2ce5495518d3254bf">Orthogonal_Base</a>(<a class="code" href="structmatrix.html">Matrix</a> *Mat) {
<a name="l00540"></a>00540 <a class="code" href="structmatrix.html">Matrix</a> *OrthMat;
<a name="l00541"></a>00541 Value a,b,c,d;
<a name="l00542"></a>00542 <a class="code" href="structVector.html">Vector</a> *q,*<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>,*f;
<a name="l00543"></a>00543 <span class="keywordtype">unsigned</span> length;
<a name="l00544"></a>00544 <span class="keywordtype">int</span> i,j,k;
<a name="l00545"></a>00545 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(a);
<a name="l00546"></a>00546 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(b);
<a name="l00547"></a>00547 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(c);
<a name="l00548"></a>00548 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(d);
<a name="l00549"></a>00549 OrthMat= <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(Mat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>,Mat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00550"></a>00550 length=Mat-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;
<a name="l00551"></a>00551 <span class="keywordflow">for</span>(k=0; k<length; k++) {
<a name="l00552"></a>00552 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(OrthMat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][k],Mat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[0][k]);
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554 f=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(length);
<a name="l00555"></a>00555 p=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(length);
<a name="l00556"></a>00556 q=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(length);
<a name="l00557"></a>00557 <span class="keywordflow">for</span>(i=1; i<Mat-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>; i++) {
<a name="l00558"></a>00558 <span class="keywordflow">for</span>(k=0;k<length;k++) {
<a name="l00559"></a>00559 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(f-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],Mat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l00560"></a>00560 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],Mat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][k]);
<a name="l00561"></a>00561 }
<a name="l00562"></a>00562 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>(d,1);
<a name="l00563"></a>00563 <span class="keywordflow">for</span>(j=0; j<i; j++) {
<a name="l00564"></a>00564 <span class="keywordflow">for</span>(k=0;k<length;k++) {
<a name="l00565"></a>00565 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],OrthMat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[j][k]);
<a name="l00566"></a>00566 }
<a name="l00567"></a>00567
<a name="l00568"></a>00568 <a class="code" href="ext__ehrhart_8c.html#3c8687093fe77f61c70d3d52f2867a71">Scalar_product</a>(p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,f-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,length,&a);
<a name="l00569"></a>00569 <a class="code" href="ext__ehrhart_8c.html#3c8687093fe77f61c70d3d52f2867a71">Scalar_product</a>(p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,length,&b);
<a name="l00570"></a>00570 <a class="code" href="source_2arith_2arithmetique_8h.html#50a34e78517e58cd1c2494a99be1e62b">value_gcd</a>(c, a, b);
<a name="l00571"></a>00571 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(a, a, c);
<a name="l00572"></a>00572 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(b, b, c);
<a name="l00573"></a>00573 <span class="keywordflow">for</span>(k=0;k<length;k++) {
<a name="l00574"></a>00574 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],a);
<a name="l00575"></a>00575 }
<a name="l00576"></a>00576
<a name="l00577"></a>00577 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(d)|<a class="code" href="source_2arith_2arithmetique_8h.html#5f258141f9e07b66da01ff7f4fe3d56d">value_notone_p</a>(b)) {
<a name="l00578"></a>00578 <a class="code" href="source_2arith_2arithmetique_8h.html#6da13dbfdd065b7609591ff6b3aee310">value_lcm</a>(c, d, b);
<a name="l00579"></a>00579 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(a, c, b);
<a name="l00580"></a>00580 <a class="code" href="source_2arith_2arithmetique_8h.html#4b01d50506e0c7691b69d57a87280f5d">value_divexact</a>(b, c, d);
<a name="l00581"></a>00581 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(d,c);
<a name="l00582"></a>00582 <span class="keywordflow">for</span>(k=0;k<length;k++) {
<a name="l00583"></a>00583 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],a);
<a name="l00584"></a>00584 <a class="code" href="source_2arith_2arithmetique_8h.html#c9986d34264874727344f666079e2294">value_multiply</a>(q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],b);
<a name="l00585"></a>00585 }
<a name="l00586"></a>00586
<a name="l00587"></a>00587 }
<a name="l00588"></a>00588
<a name="l00589"></a>00589 <span class="keywordflow">for</span>(k=0;k<length;k++) {
<a name="l00590"></a>00590 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],p-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k]);
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592
<a name="l00593"></a>00593 }
<a name="l00594"></a>00594 <a class="code" href="vector_8c.html#801486b45cadc8b9d22d99a79af91fa1">Vector_Gcd</a>(q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,length,&c);
<a name="l00595"></a>00595 <a class="code" href="vector_8c.html#95d6452a07b82054af71a14c686e66a8">Vector_AntiScale</a>(q-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>, OrthMat-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i], c, length);
<a name="l00596"></a>00596 }
<a name="l00597"></a>00597 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(a);
<a name="l00598"></a>00598 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(b);
<a name="l00599"></a>00599 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(c);
<a name="l00600"></a>00600 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(d);
<a name="l00601"></a>00601 <span class="keywordflow">return</span> OrthMat;
<a name="l00602"></a>00602 } <span class="comment">/* Orthogonal_Base */</span>
<a name="l00603"></a>00603
<a name="l00604"></a>00604
<a name="l00605"></a>00605 <span class="comment">/* Remove an element of a list */</span>
<a name="l00606"></a><a class="code" href="ext__ehrhart_8c.html#e58a1dd711203df52a134ccb9ce7484d">00606</a> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#e58a1dd711203df52a134ccb9ce7484d">Remove_Element</a>(<a class="code" href="struct__enumeration.html">Enumeration</a> *en,<a class="code" href="struct__enumeration.html">Enumeration</a> **re, <a class="code" href="struct__enumeration.html">Enumeration</a> *prev) {
<a name="l00607"></a>00607 <span class="keywordflow">if</span> (en== *re) {
<a name="l00608"></a>00608 *re= (*re)-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610 <span class="keywordflow">else</span> {
<a name="l00611"></a>00611 prev-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>=en-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l00612"></a>00612 }
<a name="l00613"></a>00613 } <span class="comment">/* Remove_Element */</span>
<a name="l00614"></a>00614
<a name="l00615"></a>00615 <span class="comment">/* Remove validite domains and correspending ehrhart polynomials whitch are redundant after </span>
<a name="l00616"></a>00616 <span class="comment"> the enumeration of a polyhedron */</span>
<a name="l00617"></a>00617
<a name="l00618"></a><a class="code" href="ext__ehrhart_8c.html#c56ec2d73ba6448ba16d5b51e2cc38a9">00618</a> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#c56ec2d73ba6448ba16d5b51e2cc38a9">Remove_RedundantDomains</a> (<a class="code" href="struct__enumeration.html">Enumeration</a> **Ures) {
<a name="l00619"></a>00619 <a class="code" href="struct__enumeration.html">Enumeration</a> *ren1, *ren2, *previous=NULL;
<a name="l00620"></a>00620 <span class="keywordtype">int</span> red;
<a name="l00621"></a>00621 <span class="keywordflow">for</span> (ren1=*Ures; ren1; ren1=ren1-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>) {
<a name="l00622"></a>00622 red=0;
<a name="l00623"></a>00623 <span class="keywordflow">for</span> (ren2=*Ures; ren2; ren2=ren2-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>) {
<a name="l00624"></a>00624 <span class="keywordflow">if</span> (ren1!=ren2) {
<a name="l00625"></a>00625
<a name="l00626"></a>00626 <span class="keywordflow">if</span> (<a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(ren2-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, ren1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>)) {
<a name="l00627"></a>00627 red= 1;
<a name="l00628"></a>00628 <span class="keywordflow">break</span>;
<a name="l00629"></a>00629
<a name="l00630"></a>00630 }
<a name="l00631"></a>00631
<a name="l00632"></a>00632 }
<a name="l00633"></a>00633 }
<a name="l00634"></a>00634 <span class="keywordflow">if</span> (red) {
<a name="l00635"></a>00635 <a class="code" href="ext__ehrhart_8c.html#e58a1dd711203df52a134ccb9ce7484d">Remove_Element</a>(ren1,Ures,previous);
<a name="l00636"></a>00636 }
<a name="l00637"></a>00637 previous=ren1;
<a name="l00638"></a>00638 }
<a name="l00639"></a>00639 }<span class="comment">/*Remove_RedendentDomains */</span>
<a name="l00640"></a>00640
<a name="l00641"></a>00641
<a name="l00642"></a><a class="code" href="ext__ehrhart_8c.html#6d5c4fe13303527d0cf008cb4f0fa2d3">00642</a> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#6d5c4fe13303527d0cf008cb4f0fa2d3">IncludeInRes</a> (<a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>, <a class="code" href="struct__enumeration.html">Enumeration</a> *e, <span class="keywordtype">unsigned</span> MR) {
<a name="l00643"></a>00643 <a class="code" href="struct__enumeration.html">Enumeration</a> *en;
<a name="l00644"></a>00644 <span class="keywordflow">for</span> (en=e; en; en=en-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>) {
<a name="l00645"></a>00645
<a name="l00646"></a>00646 <span class="keywordflow">if</span> (<a class="code" href="polyhedron_8c.html#107a96d44465428ffcd25f1ab3d67b43">PolyhedronIncludes</a>(e-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,p))
<a name="l00647"></a>00647 <span class="keywordflow">return</span> 1;
<a name="l00648"></a>00648 }
<a name="l00649"></a>00649 <span class="keywordflow">return</span> 0;
<a name="l00650"></a>00650 }
<a name="l00651"></a>00651
<a name="l00652"></a><a class="code" href="ext__ehrhart_8c.html#cebf00b847b32fd4c9454919fb5d7757">00652</a> <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="ext__ehrhart_8c.html#cebf00b847b32fd4c9454919fb5d7757">DMUnion</a>(<a class="code" href="struct__enumeration.html">Enumeration</a> *en, <span class="keywordtype">unsigned</span> MR) {
<a name="l00653"></a>00653 <a class="code" href="struct__enumeration.html">Enumeration</a> *e1;
<a name="l00654"></a>00654 <a class="code" href="structpolyhedron.html">Polyhedron</a> *d;
<a name="l00655"></a>00655 e1=en;
<a name="l00656"></a>00656 d=e1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>;
<a name="l00657"></a>00657 <span class="keywordflow">for</span> (e1=en-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>; e1; e1=e1-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>) {
<a name="l00658"></a>00658 d= <a class="code" href="polyhedron_8c.html#6e402792ade8ef5e83a87d623f03c5cb">DomainUnion</a>( d, e1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>, MR);
<a name="l00659"></a>00659 }
<a name="l00660"></a>00660 <span class="keywordflow">return</span> d;
<a name="l00661"></a>00661 }
<a name="l00662"></a>00662
<a name="l00663"></a>00663
<a name="l00664"></a><a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">00664</a> <span class="keywordtype">void</span> <a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">AffConstraints</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *Poldisj)
<a name="l00665"></a>00665 {
<a name="l00666"></a>00666 <a class="code" href="structpolyhedron.html">Polyhedron</a> *<a class="code" href="vector_8c.html#a45b2e3dcf291527c5aedc420819adfc">p</a>;
<a name="l00667"></a>00667
<a name="l00668"></a>00668 <span class="keywordflow">for</span>(p=Poldisj;p;p=p-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>)
<a name="l00669"></a>00669 {
<a name="l00670"></a>00670 <a class="code" href="polyhedron_8c.html#2303f014f8cd948a950c920085135081">Polyhedron_PrintConstraints</a>( stdout, <a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>, p);
<a name="l00671"></a>00671 printf(<span class="stringliteral">"\n"</span>);
<a name="l00672"></a>00672 }
<a name="l00673"></a>00673 }
<a name="l00674"></a><a class="code" href="ext__ehrhart_8c.html#5c578d9b28d554b35d712575311f3b30">00674</a> <span class="keywordtype">int</span> <a class="code" href="ext__ehrhart_8c.html#5c578d9b28d554b35d712575311f3b30">Degenerate</a> (<a class="code" href="struct__enumeration.html">Enumeration</a> *en) {
<a name="l00675"></a>00675 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#47d32925340d2dc99ef2d4215080a60d">value_notzero_p</a>(en-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>)) {
<a name="l00676"></a>00676
<a name="l00677"></a>00677 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#0a56519397244e2bc48e480bcd2f2a63">value_mone_p</a>(en-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n )) {
<a name="l00678"></a>00678 <span class="keywordflow">return</span> 1;
<a name="l00679"></a>00679 }
<a name="l00680"></a>00680 }
<a name="l00681"></a>00681 <span class="keywordflow">return</span> 0;
<a name="l00682"></a>00682 }
<a name="l00683"></a>00683
<a name="l00684"></a>00684 <span class="comment">/* Enumeration of a domain D */</span>
<a name="l00685"></a>00685
<a name="l00686"></a><a class="code" href="ext__ehrhart_8h.html#1a7c95208634df638d39a6656d4abb76">00686</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ext__ehrhart_8c.html#1a7c95208634df638d39a6656d4abb76">Domain_Enumerate</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D, <a class="code" href="structpolyhedron.html">Polyhedron</a> *C, <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>,
<a name="l00687"></a>00687 <span class="keyword">const</span> <span class="keywordtype">char</span> **pn)
<a name="l00688"></a>00688 { <a class="code" href="struct__Polyhedron__union.html">Polyhedron_union</a> *Polun,*pu;
<a name="l00689"></a>00689 <a class="code" href="structpolyhedron.html">Polyhedron</a> *lp, *lp1, *lp1next;
<a name="l00690"></a>00690 <a class="code" href="structpolyhedron.html">Polyhedron</a> *d1,*d2,*d;
<a name="l00691"></a>00691 <a class="code" href="struct__enumeration.html">Enumeration</a> *e,*pr,*en,*en1, *en2,*tmp, *res, *sen;
<a name="l00692"></a>00692 Polun=NULL;
<a name="l00693"></a>00693
<a name="l00694"></a>00694 <span class="keywordflow">for</span> (d = D; d; d = d-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>) {
<a name="l00695"></a>00695 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(d);
<a name="l00696"></a>00696 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(d);
<a name="l00697"></a>00697 }
<a name="l00698"></a>00698 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(C);
<a name="l00699"></a>00699 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(C);
<a name="l00700"></a>00700
<a name="l00701"></a>00701 lp = <a class="code" href="polyhedron_8c.html#a2db71a574d8c1b1c3d90df140f1e5fd">Disjoint_Domain</a>( D, 0, MAXRAYS );
<a name="l00702"></a>00702
<a name="l00703"></a>00703 <span class="preprocessor">#ifdef UE_DEBUG</span>
<a name="l00704"></a>00704 <span class="preprocessor"></span> printf(<span class="stringliteral">"##############################################################\n"</span>);
<a name="l00705"></a>00705 printf(<span class="stringliteral">"\n###### DISJOINT UNION ######\n\n"</span>);
<a name="l00706"></a>00706 <a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">AffConstraints</a>(lp);
<a name="l00707"></a>00707 printf(<span class="stringliteral">"##############################################################\n"</span>);
<a name="l00708"></a>00708 <span class="preprocessor">#endif</span>
<a name="l00709"></a>00709 <span class="preprocessor"></span>
<a name="l00710"></a>00710 <span class="keywordflow">for</span> (lp1=lp ; lp1; lp1=lp1-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>)
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712 <a class="code" href="struct__enumeration.html">Enumeration</a> *enext;
<a name="l00713"></a>00713 lp1next = lp1-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a>;
<a name="l00714"></a>00714 lp1-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a> = NULL;
<a name="l00715"></a>00715 en= <a class="code" href="ehrhart_8c.html#3c3e442b1d2c924f03f02f9e9283141a" title="Procedure to count points in a parameterized polytope.">Polyhedron_Enumerate</a>(lp1, C, MAXRAYS,NULL);
<a name="l00716"></a>00716 lp1-><a class="code" href="structpolyhedron.html#ab97126cb9e56431d40eaf4e68b3953d">next</a> = lp1next;
<a name="l00717"></a>00717 sen= NULL;
<a name="l00718"></a>00718 <span class="keywordflow">for</span> (e=en;e;e=enext) {
<a name="l00719"></a>00719 enext = e-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l00720"></a>00720 <span class="keywordflow">if</span> (!<a class="code" href="ext__ehrhart_8c.html#5c578d9b28d554b35d712575311f3b30">Degenerate</a>(e)) {
<a name="l00721"></a>00721 e-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = sen;
<a name="l00722"></a>00722 sen=e;
<a name="l00723"></a>00723 } <span class="keywordflow">else</span> {
<a name="l00724"></a>00724 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&e-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l00725"></a>00725 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(e-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>);
<a name="l00726"></a>00726 free(e);
<a name="l00727"></a>00727 }
<a name="l00728"></a>00728 }
<a name="l00729"></a>00729
<a name="l00730"></a>00730 <span class="keywordflow">if</span>(sen!= NULL)
<a name="l00731"></a>00731 {
<a name="l00732"></a>00732 pu = (<a class="code" href="struct__Polyhedron__union.html">Polyhedron_union</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__Polyhedron__union.html">Polyhedron_union</a>));
<a name="l00733"></a>00733 pu-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>=sen;
<a name="l00734"></a>00734 pu-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a> = Polun;
<a name="l00735"></a>00735 Polun = pu;
<a name="l00736"></a>00736 }
<a name="l00737"></a>00737 }
<a name="l00738"></a>00738 <span class="keywordflow">if</span>(!Polun)
<a name="l00739"></a>00739 {
<a name="l00740"></a>00740 <span class="preprocessor">#ifdef UE_DEBUG</span>
<a name="l00741"></a>00741 <span class="preprocessor"></span> fprintf(stdout,<span class="stringliteral">"Empty Polun\n"</span>);
<a name="l00742"></a>00742 <span class="preprocessor">#endif</span>
<a name="l00743"></a>00743 <span class="preprocessor"></span> <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00744"></a>00744 }
<a name="l00745"></a>00745
<a name="l00746"></a>00746 <span class="keywordflow">while</span>(Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a> != NULL) {
<a name="l00747"></a>00747 <a class="code" href="struct__enumeration.html">Enumeration</a> *enext;
<a name="l00748"></a>00748 res=NULL;
<a name="l00749"></a>00749 en1=Polun-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>;
<a name="l00750"></a>00750 en2=(Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>)-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>;
<a name="l00751"></a>00751
<a name="l00752"></a>00752 d1=<a class="code" href="ext__ehrhart_8c.html#cebf00b847b32fd4c9454919fb5d7757">DMUnion</a>(en1, MAXRAYS);
<a name="l00753"></a>00753 d2=<a class="code" href="ext__ehrhart_8c.html#cebf00b847b32fd4c9454919fb5d7757">DMUnion</a>(en2, MAXRAYS);
<a name="l00754"></a>00754
<a name="l00755"></a>00755 <span class="keywordflow">for</span> (en1=Polun-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>;en1;en1=enext) {
<a name="l00756"></a>00756 enext = en1-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l00757"></a>00757 <span class="keywordflow">for</span>(en2=(Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>)->pt;en2;en2=en2-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>)
<a name="l00758"></a>00758 {
<a name="l00759"></a>00759 d = <a class="code" href="polyhedron_8c.html#c5a1a2751f0b833183560af25b18033b">DomainIntersection</a>(en1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,en2-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,MAXRAYS);
<a name="l00760"></a>00760 <span class="keywordflow">if</span>( d && !<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d)&&!<a class="code" href="ext__ehrhart_8c.html#6d5c4fe13303527d0cf008cb4f0fa2d3">IncludeInRes</a>(d,res,MAXRAYS)) {
<a name="l00761"></a>00761 tmp = (<a class="code" href="struct__enumeration.html">Enumeration</a> *)malloc(<span class="keyword">sizeof</span>(<a class="code" href="struct__enumeration.html">Enumeration</a>));
<a name="l00762"></a>00762 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>);
<a name="l00763"></a>00763 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>( tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>, en2-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a> );
<a name="l00764"></a>00764 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.<a class="code" href="struct__evalue.html#e4aada7b06d44dcbf9f4d2daf1834e29">d</a>))
<a name="l00765"></a>00765 tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p=<a class="code" href="ehrhart_8c.html#c94c9f3a408511c6ea5defdc47eb6563">ecopy</a>(en2-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.p);
<a name="l00766"></a>00766 <span class="keywordflow">else</span>
<a name="l00767"></a>00767 {
<a name="l00768"></a>00768 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n);
<a name="l00769"></a>00769 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>( tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n, en2-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>.x.n );
<a name="l00770"></a>00770 }
<a name="l00771"></a>00771
<a name="l00772"></a>00772 <a class="code" href="ext__ehrhart_8c.html#1758d39c40dcdf8916517a34133f54e8">new_eadd</a>(&en1-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>,&tmp-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l00773"></a>00773 tmp-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> =d;
<a name="l00774"></a>00774 tmp-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>= res;
<a name="l00775"></a>00775 res=tmp;
<a name="l00776"></a>00776 }
<a name="l00777"></a>00777 }
<a name="l00778"></a>00778 d=<a class="code" href="polyhedron_8c.html#aaefa8685a2b2819b9863f2e4ff427f5">DomainDifference</a>(en1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,d2 ,MAXRAYS);
<a name="l00779"></a>00779 <span class="keywordflow">if</span> (d && !<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d) && !<a class="code" href="ext__ehrhart_8c.html#6d5c4fe13303527d0cf008cb4f0fa2d3">IncludeInRes</a>(d,res,MAXRAYS)) {
<a name="l00780"></a>00780 en1-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = d;
<a name="l00781"></a>00781 en1-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>= res;
<a name="l00782"></a>00782 res=en1;
<a name="l00783"></a>00783 } <span class="keywordflow">else</span> {
<a name="l00784"></a>00784 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&en1-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l00785"></a>00785 free(en1);
<a name="l00786"></a>00786 }
<a name="l00787"></a>00787 }
<a name="l00788"></a>00788 <span class="keywordflow">for</span> (en2=(Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>)->pt; en2; en2 = enext) {
<a name="l00789"></a>00789 enext = en2-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a>;
<a name="l00790"></a>00790 d= <a class="code" href="polyhedron_8c.html#aaefa8685a2b2819b9863f2e4ff427f5">DomainDifference</a>(en2-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a>,d1,MAXRAYS);
<a name="l00791"></a>00791 <span class="keywordflow">if</span> (d && !<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(d)&&!<a class="code" href="ext__ehrhart_8c.html#6d5c4fe13303527d0cf008cb4f0fa2d3">IncludeInRes</a>(d,res,MAXRAYS)) {
<a name="l00792"></a>00792 en2-><a class="code" href="struct__enumeration.html#57e35419d63ab12898542ef58d8decac">ValidityDomain</a> = d;
<a name="l00793"></a>00793 en2-><a class="code" href="struct__enumeration.html#d2fd42474e015c9abc6aea0e2bea08b8">next</a> = res;
<a name="l00794"></a>00794 res = en2;
<a name="l00795"></a>00795 } <span class="keywordflow">else</span> {
<a name="l00796"></a>00796 <a class="code" href="ehrhart_8c.html#96434ed8279f7999773fa3343cfe98b8" title="releases all memory referenced by e.">free_evalue_refs</a>(&en2-><a class="code" href="struct__enumeration.html#a499b062a10ce16356e9b52d25cae0d9">EP</a>);
<a name="l00797"></a>00797 free(en2);
<a name="l00798"></a>00798 }
<a name="l00799"></a>00799 }
<a name="l00800"></a>00800 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(d1);
<a name="l00801"></a>00801 <a class="code" href="polyhedron_8c.html#e6d0a7daf8e801a777fc8e93d8cfe43a">Domain_Free</a>(d2);
<a name="l00802"></a>00802
<a name="l00803"></a>00803 Polun-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>=res;
<a name="l00804"></a>00804
<a name="l00805"></a>00805 Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>= (Polun-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>)-><a class="code" href="struct__Polyhedron__union.html#ffbcb1037b57c76b80f1017533dd58e7">next</a>;
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807 res=Polun-><a class="code" href="struct__Polyhedron__union.html#6ae7500fadbcecc36c7127b75f5dc336">pt</a>;
<a name="l00808"></a>00808
<a name="l00809"></a>00809 <a class="code" href="ext__ehrhart_8c.html#c56ec2d73ba6448ba16d5b51e2cc38a9">Remove_RedundantDomains</a>(&res);
<a name="l00810"></a>00810 <span class="keywordflow">return</span>(res);
<a name="l00811"></a>00811 }
<a name="l00812"></a>00812
<a name="l00813"></a>00813
<a name="l00814"></a>00814 <span class="comment">/**********</span>
<a name="l00815"></a>00815 <span class="comment"> DO NOT USE THE FOLLOWING FUNCTION IT'S NOT WORKING PROPERLY YET.</span>
<a name="l00816"></a>00816 <span class="comment"> **********/</span>
<a name="l00817"></a>00817
<a name="l00818"></a>00818 <span class="comment">/* Enumeration of the image by T of domain D */</span>
<a name="l00819"></a><a class="code" href="ext__ehrhart_8c.html#0d5dad50628eee411cda4622dabcb6d7">00819</a> <a class="code" href="struct__enumeration.html">Enumeration</a> *<a class="code" href="ext__ehrhart_8c.html#0d5dad50628eee411cda4622dabcb6d7">Polyhedron_Image_Enumerate</a>(<a class="code" href="structpolyhedron.html">Polyhedron</a> *D, <a class="code" href="structpolyhedron.html">Polyhedron</a> *C, <a class="code" href="structmatrix.html">Matrix</a> *T, <span class="keywordtype">unsigned</span> <a class="code" href="verif__ehrhart_8c.html#89fd83aa168651629c012d8655635588">MAXRAYS</a>, <span class="keyword">const</span> <span class="keywordtype">char</span> **par_name)
<a name="l00820"></a>00820 { <a class="code" href="structpolyhedron.html">Polyhedron</a> *polun,*pol;
<a name="l00821"></a>00821 <a class="code" href="struct__enumeration.html">Enumeration</a> *ee;
<a name="l00822"></a>00822 <a class="code" href="structmatrix.html">Matrix</a> *TCopy,*Tred, *d1,*d;
<a name="l00823"></a>00823 <a class="code" href="structVector.html">Vector</a> *v1,*v2;
<a name="l00824"></a>00824 Value h;
<a name="l00825"></a>00825 <span class="keywordtype">int</span> i,j,k;
<a name="l00826"></a>00826
<a name="l00827"></a>00827 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(D);
<a name="l00828"></a>00828 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(D);
<a name="l00829"></a>00829 <a class="code" href="polyhedron_8h.html#729f721c450a034c1219447745c6b123">POL_ENSURE_FACETS</a>(C);
<a name="l00830"></a>00830 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(C);
<a name="l00831"></a>00831
<a name="l00832"></a>00832 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>(h);
<a name="l00833"></a>00833 <span class="keywordflow">if</span>(!D) {
<a name="l00834"></a>00834 fprintf(stdout,<span class="stringliteral">" Error: in reading input domain \n"</span>);
<a name="l00835"></a>00835 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00836"></a>00836 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00837"></a>00837 }
<a name="l00838"></a>00838 <span class="keywordflow">else</span> {
<a name="l00839"></a>00839 printf(<span class="stringliteral">"\n ################ INPUT POLYHEDRON #######################\n\n"</span>);
<a name="l00840"></a>00840 <a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">AffConstraints</a>(D);
<a name="l00841"></a>00841 }
<a name="l00842"></a>00842
<a name="l00843"></a>00843 <span class="preprocessor">#ifdef DOMAIN_IMAGE</span>
<a name="l00844"></a>00844 <span class="preprocessor"></span> fpol=<a class="code" href="polyhedron_8c.html#8b92d94a0a1cbd47b98e9f72f34c43eb">DomainImage</a>(D,T,MAXRAYS);
<a name="l00845"></a>00845 printf(<span class="stringliteral">"\n $$$$$$$$$$$$$ THE DOMAIN IMAGE $$$$$$$$$$$$$\n\n"</span>);
<a name="l00846"></a>00846 <a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">AffConstraints</a>(fpol);
<a name="l00847"></a>00847 <span class="keywordflow">if</span>(<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(fpol)) {
<a name="l00848"></a>00848 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00849"></a>00849 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00850"></a>00850 }
<a name="l00851"></a>00851 ee = <a class="code" href="ext__ehrhart_8c.html#1a7c95208634df638d39a6656d4abb76">Domain_Enumerate</a>(fpol,C,MAXRAYS,par_name);
<a name="l00852"></a>00852 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00853"></a>00853 <span class="keywordflow">return</span> (ee);
<a name="l00854"></a>00854 <span class="preprocessor">#endif</span>
<a name="l00855"></a>00855 <span class="preprocessor"></span>
<a name="l00856"></a>00856 TCopy= <a class="code" href="Matop_8c.html#9d027e9fc6b85e6fa37fc284bf1b5e06">Matrix_Copy</a>(T);
<a name="l00857"></a>00857 Tred= <a class="code" href="ext__ehrhart_8c.html#da49ee072a02798c5557853034894158">Reduce_Matrix</a>(TCopy);
<a name="l00858"></a>00858 printf(<span class="stringliteral">"\n ################## INPUT REDUCED TRANSFORMATION MATRIX ##################\n"</span> );
<a name="l00859"></a>00859 <a class="code" href="matrix_8c.html#d4c3c350dba633f72bbcf3609b6b67d7">Matrix_Print</a>(stdout,<a class="code" href="types_8h.html#e6f16bcd4a42ba51cbb003e3d1e1cde6">P_VALUE_FMT</a>,Tred);
<a name="l00860"></a>00860
<a name="l00861"></a>00861 <span class="keywordflow">if</span> (Tred-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a> <Tred-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>) {
<a name="l00862"></a>00862 d1=(<a class="code" href="structmatrix.html">Matrix</a> *) <a class="code" href="matrix_8c.html#c0b29e1d99a2823ad00b5f2157879d80">Matrix_Alloc</a>(Tred-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>,Tred-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>);
<a name="l00863"></a>00863 <span class="keywordflow">for</span> (i=0;i<Tred-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;i++) {
<a name="l00864"></a>00864 <span class="keywordflow">for</span> (j=0; j<Tred-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;j++) {
<a name="l00865"></a>00865 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>( d1-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j], Tred-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j] );
<a name="l00866"></a>00866 }
<a name="l00867"></a>00867 }
<a name="l00868"></a>00868 <span class="keywordflow">for</span>(i=Tred-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;i<Tred->NbColumns;i++) {
<a name="l00869"></a>00869 <span class="keywordflow">for</span> (j=0;j<Tred-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a>;j++) {
<a name="l00870"></a>00870 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( d1-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[i][j], 0 );
<a name="l00871"></a>00871 }
<a name="l00872"></a>00872 }
<a name="l00873"></a>00873 d= (<a class="code" href="structmatrix.html">Matrix</a> *) <a class="code" href="ext__ehrhart_8c.html#301fdd12d3f7b14a8560c147426ab915">CalcBase</a>(d1);
<a name="l00874"></a>00874 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Tred);
<a name="l00875"></a>00875 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(d1);
<a name="l00876"></a>00876
<a name="l00877"></a>00877 }
<a name="l00878"></a>00878 <span class="keywordflow">else</span> {
<a name="l00879"></a>00879 d=(<a class="code" href="structmatrix.html">Matrix</a> *) <a class="code" href="ext__ehrhart_8c.html#301fdd12d3f7b14a8560c147426ab915">CalcBase</a>(Tred);
<a name="l00880"></a>00880 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(Tred);
<a name="l00881"></a>00881 }
<a name="l00882"></a>00882 <span class="keywordflow">if</span>(d-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>==0) {
<a name="l00883"></a>00883 <span class="keywordflow">if</span>(<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(D)) {
<a name="l00884"></a>00884 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00885"></a>00885 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00886"></a>00886 }
<a name="l00887"></a>00887 <span class="keywordflow">else</span> {
<a name="l00888"></a>00888 printf( <span class="stringliteral">" Ker(A)=0 implys directly Enumeration on input polyhedron\n\n"</span>);
<a name="l00889"></a>00889 ee=<a class="code" href="ext__ehrhart_8c.html#1a7c95208634df638d39a6656d4abb76">Domain_Enumerate</a>(D,C,MAXRAYS,par_name);
<a name="l00890"></a>00890 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00891"></a>00891 <span class="keywordflow">return</span> ee;
<a name="l00892"></a>00892 }
<a name="l00893"></a>00893 }
<a name="l00894"></a>00894
<a name="l00895"></a>00895 d1=<a class="code" href="Matop_8c.html#b635a9108899776e30e1de03fe183915">Transpose</a>(d);
<a name="l00896"></a>00896 <a class="code" href="matrix_8c.html#fcb312b7c12a6997cd66964ecc34e1a6">Matrix_Free</a>(d);
<a name="l00897"></a>00897
<a name="l00898"></a>00898 <span class="keywordflow">if</span>(d1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>!=D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>) {
<a name="l00899"></a>00899 fprintf(stdout,<span class="stringliteral">" \n Error: incompatible dimension \n"</span>);
<a name="l00900"></a>00900 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00901"></a>00901 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00902"></a>00902 }
<a name="l00903"></a>00903 <span class="keywordflow">if</span>(d1-><a class="code" href="structmatrix.html#68858fd3b57684ef38bdfce13c65d182">NbColumns</a> > 1) {
<a name="l00904"></a>00904 fprintf(stdout,<span class="stringliteral">" \n Error: Can not compute intgral points : More then vector in ker(A)! \n"</span>);
<a name="l00905"></a>00905 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00906"></a>00906 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00907"></a>00907
<a name="l00908"></a>00908 }
<a name="l00909"></a>00909 printf( <span class="stringliteral">" \n Ker(A)=1 implys adding constraints befor Enumeration\n"</span>);
<a name="l00910"></a>00910 v1=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(d1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00911"></a>00911 v2=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(d1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>);
<a name="l00912"></a>00912
<a name="l00913"></a>00913 polun=(<a class="code" href="structpolyhedron.html">Polyhedron</a> *) NULL;
<a name="l00914"></a>00914 <span class="keywordflow">for</span> (k=0;k<d1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>;k++) {
<a name="l00915"></a>00915 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(v1-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],d1-><a class="code" href="structmatrix.html#2c6d840d8d911ae95c2ae4fc96f4b5ba">p</a>[k][0]) ;
<a name="l00916"></a>00916 }
<a name="l00917"></a>00917 <span class="comment">/* adding a new constraint for all constraints of D in which the scalar product of the*/</span>
<a name="l00918"></a>00918 <span class="comment">/* normal whith vector v1 is greter then zero*/</span>
<a name="l00919"></a>00919
<a name="l00920"></a>00920 <span class="keywordflow">for</span> (j=0;j<D-><a class="code" href="structpolyhedron.html#2db05293e731089b9198d45cf027bd1c">NbConstraints</a>;j++) {
<a name="l00921"></a>00921 <span class="keywordflow">for</span> (k=0;k<=D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>-1;k++) {
<a name="l00922"></a>00922 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a>(v2-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k],D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[j][k+1]) ;
<a name="l00923"></a>00923 }
<a name="l00924"></a>00924 <a class="code" href="ext__ehrhart_8c.html#3c8687093fe77f61c70d3d52f2867a71">Scalar_product</a>(v1-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,v2-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>,&h);
<a name="l00925"></a>00925
<a name="l00926"></a>00926 <span class="keywordflow">if</span>(<a class="code" href="source_2arith_2arithmetique_8h.html#01904c8c75c10d407a24c55f16ec27c7">value_pos_p</a>(h)&&!<a class="code" href="source_2arith_2arithmetique_8h.html#827532f2140ae2aa96e46baebae09723">value_zero_p</a>(D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[j][0])) {
<a name="l00927"></a>00927 <a class="code" href="structVector.html">Vector</a> *NCont;
<a name="l00928"></a>00928 Value val;
<a name="l00929"></a>00929 <a class="code" href="source_2arith_2arithmetique_8h.html#f71a2ca0294a19cff0cdcbdcc052ee27">value_init</a>( val );
<a name="l00930"></a>00930 <span class="comment">/* Create a new contraint whitch is added to the polyhedron*/</span>
<a name="l00931"></a>00931
<a name="l00932"></a>00932 NCont=<a class="code" href="vector_8c.html#358c545236f58b1001479e4a69d318aa">Vector_Alloc</a>(d1-><a class="code" href="structmatrix.html#16ad614d15c6e81c0041e877b623c72d">NbRows</a>+2);
<a name="l00933"></a>00933 <a class="code" href="source_2arith_2arithmetique_8h.html#8cc56567a4a29271559ac0fd5f6c5bfa">value_set_si</a>( NCont-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[0],1); <span class="comment">/* the constraint is an inequality */</span>
<a name="l00934"></a>00934
<a name="l00935"></a>00935 <span class="keywordflow">for</span> (k=1;k<=D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>;k++) {
<a name="l00936"></a>00936 <a class="code" href="source_2arith_2arithmetique_8h.html#0daf9a8ecdc14e7a274832b0d2add830">value_oppose</a>( NCont-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[k], D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[j][k]);
<a name="l00937"></a>00937 }
<a name="l00938"></a>00938 <a class="code" href="source_2arith_2arithmetique_8h.html#7e293e9652086118cc5b660e6022767c">value_decrement</a>(val,h);
<a name="l00939"></a>00939 <a class="code" href="source_2arith_2arithmetique_8h.html#e92a58eee3b6f5c6a99e6837e68407e1">value_subtract</a>(val,val,D-><a class="code" href="structpolyhedron.html#b2691b8eb5d2dc43a509ac2094d2bc73">Constraint</a>[j][D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1]);
<a name="l00940"></a>00940 <a class="code" href="source_2arith_2arithmetique_8h.html#864613888dc46f15679aa4f63e468f89">value_assign</a> (NCont-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>[D-><a class="code" href="structpolyhedron.html#2a02cea8b7ba3dde415041b8b2373bc8">Dimension</a>+1],val);
<a name="l00941"></a>00941 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(val);
<a name="l00942"></a>00942 <span class="comment">/* add the new constraint to polyhedron D */</span>
<a name="l00943"></a>00943 pol=<a class="code" href="polyhedron_8c.html#9690baafb863abbd2e8d5c4da2995416">AddConstraints</a>(NCont-><a class="code" href="structVector.html#ecf9fddd3ad47d143da2e041fdff37cc">p</a>,1,D,MAXRAYS);
<a name="l00944"></a>00944 <a class="code" href="polyhedron_8h.html#317e5eb888f5c14e1229742f31169378">POL_ENSURE_VERTICES</a>(pol);
<a name="l00945"></a>00945 polun=<a class="code" href="polyhedron_8c.html#965fd466bed4b1dd143c426e51ac16c5">AddPolyToDomain</a>(<a class="code" href="polyhedron_8c.html#b0f89a51f01cea6b93b8fb3ab43feca3">Polyhedron_Copy</a>(pol),polun);
<a name="l00946"></a>00946 <a class="code" href="polyhedron_8c.html#4ae97b9794e3a616f1d38c68e6515cc3">Polyhedron_Free</a>(pol);
<a name="l00947"></a>00947 <a class="code" href="vector_8c.html#055608d1a3726b7cb26e3e8074764ba0">Vector_Free</a>(NCont);
<a name="l00948"></a>00948 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>( val );
<a name="l00949"></a>00949 }
<a name="l00950"></a>00950 }
<a name="l00951"></a>00951 <span class="keywordflow">if</span>(polun==NULL) { <span class="comment">/* No constraint is added to input polyhedron */</span>
<a name="l00952"></a>00952 <span class="keywordflow">if</span>(<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(D)) {
<a name="l00953"></a>00953 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00954"></a>00954 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00955"></a>00955 }
<a name="l00956"></a>00956 <span class="keywordflow">else</span> {
<a name="l00957"></a>00957 ee= <a class="code" href="ext__ehrhart_8c.html#1a7c95208634df638d39a6656d4abb76">Domain_Enumerate</a>(D,C,MAXRAYS,par_name);
<a name="l00958"></a>00958 }
<a name="l00959"></a>00959 }
<a name="l00960"></a>00960 <span class="keywordflow">else</span> { <span class="comment">/* some constraintes are added to input polyhedron */</span>
<a name="l00961"></a>00961 <span class="keywordflow">if</span>(<a class="code" href="types_8h.html#156641ae25106f9a6ac5c5c2a624c168">emptyQ</a>(polun)){
<a name="l00962"></a>00962 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00963"></a>00963 <span class="keywordflow">return</span> ((<a class="code" href="struct__enumeration.html">Enumeration</a> *) 0);
<a name="l00964"></a>00964 }
<a name="l00965"></a>00965 <span class="keywordflow">else</span> {
<a name="l00966"></a>00966 printf(<span class="stringliteral">"\n ##################################################################"</span>);
<a name="l00967"></a>00967 printf(<span class="stringliteral">"\n ****** THE RESULT OF ADDING CONSTRAINTS TO THE INPUT POLYHEDRON ****** \n"</span>);
<a name="l00968"></a>00968 <a class="code" href="ext__ehrhart_8c.html#1dff2dadbb37fc12dcba692d8f60db31">AffConstraints</a>(polun);
<a name="l00969"></a>00969 ee= <a class="code" href="ext__ehrhart_8c.html#1a7c95208634df638d39a6656d4abb76">Domain_Enumerate</a>(polun,C,MAXRAYS,par_name);
<a name="l00970"></a>00970 <a class="code" href="source_2arith_2arithmetique_8h.html#b9b282921e85a0527d462d331533d619">value_clear</a>(h);
<a name="l00971"></a>00971 <span class="keywordflow">return</span> (ee );
<a name="l00972"></a>00972 }
<a name="l00973"></a>00973 }
<a name="l00974"></a>00974
<a name="l00975"></a>00975
<a name="l00976"></a>00976 <span class="keywordflow">return</span>( NULL );
<a name="l00977"></a>00977 }
<a name="l00978"></a>00978
<a name="l00979"></a>00979
</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>
|
