optimisation 19 mai

Pierre Cwik
1 parent ac45592e
Showing 26 changed files with 1116 additions and 0 deletions Show diff stats
a.out
code_mort
code_mort.c
code_mort.c.067t.dce1
code_mort.c.083t.dce2
deroulement_boucle
deroulement_boucle.c
deroulement_boucle.c.117t.cunroll
deroulement_boucle.c.169t.optimized
loptimizz
optimisation2
optimisation2.c
optimisation2.c.018t.einline
optimisation2.c.169t.optimized
propagation
propagation.c
propagation.c.021t.ccp1
propagation.c.055t.ccp2
propagation.c.087t.ccp3
recursion
@@ -0,0 +1,9 @@
+#include <stdio.h>
+int main(void){
+int a=0;
+if(a==2) printf("Bonjour \n");
+printf("Coucou !\n");
+a=1;
+return a;
+printf("Caché !\n");
+}
 \ No newline at end of file
@@ -0,0 +1,12 @@
+
+;; Function main (main, funcdef_no=11, decl_uid=2234, symbol_order=11) (executed once)
+
+main ()
+{
+  <bb 2>:
+  __builtin_puts (&"Coucou !"[0]);
+  return 1;
+
+}
+
+
@@ -0,0 +1,12 @@
+
+;; Function main (main, funcdef_no=11, decl_uid=2234, symbol_order=11) (executed once)
+
+main ()
+{
+  <bb 2>:
+  __builtin_puts (&"Coucou !"[0]);
+  return 1;
+
+}
+
+
@@ -0,0 +1,12 @@
+#include <stdio.h>
+#define TAILLE 100
+#define TAILLE1 500
+#define TAILLE2 500
+int a[TAILLE][TAILLE1][TAILLE2];
+int main(void){
+int resultat=0;
+int i,e,u;
+for(i=0;i<TAILLE;i++) { for(e=0; e < TAILLE1;e++) { for(u=0; u<TAILLE2;u++) {  a[i][e][u]=rand(); }}}
+for(i=0;i<TAILLE;i++) { for(e=0; e < TAILLE1;e++) { for(u=0; u<TAILLE2;u++) {  resultat += a[i][e][u]; }}}
+return resultat;
+}
@@ -0,0 +1,153 @@
+
+;; Function main (main, funcdef_no=11, decl_uid=2235, symbol_order=12) (executed once)
+
+main ()
+{
+  int vect_resultat_28.9;
+  vector(4) int vect_resultat_28.8;
+  int stmp_resultat_28.7;
+  vector(4) int vect_resultat_28.6;
+  vector(4) int vect__27.5;
+  vector(4) int * vectp_a.4;
+  vector(4) int * vectp_a.3;
+  int u;
+  int e;
+  int i;
+  int resultat;
+  unsigned int ivtmp_1;
+  unsigned int ivtmp_2;
+  unsigned int ivtmp_3;
+  unsigned int ivtmp_4;
+  unsigned int ivtmp_5;
+  unsigned int ivtmp_6;
+  unsigned int ivtmp_7;
+  unsigned int ivtmp_8;
+  unsigned int ivtmp_9;
+  int _19;
+  unsigned int ivtmp_25;
+  unsigned int ivtmp_32;
+  sizetype _40;
+  sizetype _42;
+  sizetype _44;
+  sizetype _45;
+  sizetype _47;
+  unsigned int ivtmp_59;
+
+  <bb 2>:
+  goto <bb 11>;
+
+  <bb 3>:
+
+  <bb 4>:
+  # u_54 = PHI <u_21(3), 0(7)>
+  # ivtmp_9 = PHI <ivtmp_7(3), 500(7)>
+  _19 = rand ();
+  a[i_26][e_52][u_54] = _19;
+  u_21 = u_54 + 1;
+  ivtmp_7 = ivtmp_9 - 1;
+  if (ivtmp_7 != 0)
+    goto <bb 3>;
+  else
+    goto <bb 5>;
+
+  <bb 5>:
+  e_22 = e_52 + 1;
+  ivtmp_3 = ivtmp_4 - 1;
+  if (ivtmp_3 != 0)
+    goto <bb 6>;
+  else
+    goto <bb 8>;
+
+  <bb 6>:
+
+  <bb 7>:
+  # e_52 = PHI <e_22(6), 0(11)>
+  # ivtmp_4 = PHI <ivtmp_3(6), 500(11)>
+  goto <bb 4>;
+
+  <bb 8>:
+  i_23 = i_26 + 1;
+  ivtmp_1 = ivtmp_2 - 1;
+  if (ivtmp_1 != 0)
+    goto <bb 10>;
+  else
+    goto <bb 9>;
+
+  <bb 9>:
+  goto <bb 19>;
+
+  <bb 10>:
+
+  <bb 11>:
+  # i_26 = PHI <i_23(10), 0(2)>
+  # ivtmp_2 = PHI <ivtmp_1(10), 100(2)>
+  goto <bb 7>;
+
+  <bb 12>:
+
+  <bb 13>:
+  # vectp_a.3_49 = PHI <vectp_a.3_50(12), vectp_a.4_39(16)>
+  # vect_resultat_28.6_46 = PHI <vect_resultat_28.6_12(12), { 0, 0, 0, 0 }(16)>
+  # ivtmp_25 = PHI <ivtmp_59(12), 0(16)>
+  vect__27.5_48 = MEM[(int *)vectp_a.3_49];
+  vect_resultat_28.6_12 = vect__27.5_48 + vect_resultat_28.6_46;
+  vectp_a.3_50 = vectp_a.3_49 + 16;
+  ivtmp_59 = ivtmp_25 + 1;
+  if (ivtmp_59 < 125)
+    goto <bb 12>;
+  else
+    goto <bb 14>;
+
+  <bb 14>:
+  # vect_resultat_28.6_11 = PHI <vect_resultat_28.6_12(13)>
+  vect_resultat_28.8_10 = vect_resultat_28.6_11 v>> 64;
+  vect_resultat_28.8_17 = vect_resultat_28.8_10 + vect_resultat_28.6_11;
+  vect_resultat_28.8_14 = vect_resultat_28.8_17 v>> 32;
+  vect_resultat_28.8_24 = vect_resultat_28.8_14 + vect_resultat_28.8_17;
+  stmp_resultat_28.7_16 = BIT_FIELD_REF <vect_resultat_28.8_24, 32, 0>;
+  vect_resultat_28.9_33 = stmp_resultat_28.7_16 + resultat_34;
+  e_30 = e_53 + 1;
+  ivtmp_8 = ivtmp_32 - 1;
+  if (ivtmp_8 != 0)
+    goto <bb 15>;
+  else
+    goto <bb 17>;
+
+  <bb 15>:
+
+  <bb 16>:
+  # resultat_34 = PHI <vect_resultat_28.9_33(15), resultat_35(19)>
+  # e_53 = PHI <e_30(15), 0(19)>
+  # ivtmp_32 = PHI <ivtmp_8(15), 500(19)>
+  _44 = (sizetype) i_51;
+  _42 = _44 * 1000000;
+  _40 = (sizetype) e_53;
+  _47 = _40 * 2000;
+  _45 = _42 + _47;
+  vectp_a.4_39 = &a + _45;
+  goto <bb 13>;
+
+  <bb 17>:
+  # resultat_41 = PHI <vect_resultat_28.9_33(14)>
+  i_31 = i_51 + 1;
+  ivtmp_5 = ivtmp_6 - 1;
+  if (ivtmp_5 != 0)
+    goto <bb 18>;
+  else
+    goto <bb 20>;
+
+  <bb 18>:
+
+  <bb 19>:
+  # resultat_35 = PHI <resultat_41(18), 0(9)>
+  # i_51 = PHI <i_31(18), 0(9)>
+  # ivtmp_6 = PHI <ivtmp_5(18), 100(9)>
+  goto <bb 16>;
+
+  <bb 20>:
+  # resultat_37 = PHI <resultat_41(17)>
+  return resultat_37;
+
+}
+
+
@@ -0,0 +1,126 @@
+
+;; Function main (main, funcdef_no=11, decl_uid=2235, symbol_order=12) (executed once)
+
+Removing basic block 14
+Removing basic block 15
+Removing basic block 16
+Removing basic block 17
+Removing basic block 18
+Removing basic block 19
+Removing basic block 20
+Removing basic block 21
+Removing basic block 22
+Removing basic block 23
+main ()
+{
+  unsigned long ivtmp.58;
+  unsigned long ivtmp.49;
+  unsigned long ivtmp.41;
+  unsigned long ivtmp.32;
+  unsigned long ivtmp.23;
+  unsigned long ivtmp.12;
+  vector(4) int vect_resultat_28.8;
+  int stmp_resultat_28.7;
+  vector(4) int vect_resultat_28.6;
+  vector(4) int vect__27.5;
+  int resultat;
+  void * _13;
+  int _19;
+  void * _36;
+  unsigned long _39;
+  unsigned long _50;
+  unsigned long _62;
+  unsigned long _65;
+  unsigned long _74;
+
+  <bb 2>:
+  ivtmp.58_6 = (unsigned long) &MEM[(void *)&a + 1000000B];
+  _62 = (unsigned long) &MEM[(void *)&a + 101000000B];
+  goto <bb 7>;
+
+  <bb 3>:
+  # ivtmp.41_51 = PHI <ivtmp.41_60(3), ivtmp.49_54(5)>
+  _19 = rand ();
+  _36 = (void *) ivtmp.41_51;
+  MEM[base: _36, offset: 0B] = _19;
+  ivtmp.41_60 = ivtmp.41_51 + 4;
+  if (ivtmp.41_60 != _74)
+    goto <bb 3>;
+  else
+    goto <bb 4>;
+
+  <bb 4>:
+  if (ivtmp.58_52 != _74)
+    goto <bb 5>;
+  else
+    goto <bb 6>;
+
+  <bb 5>:
+  # ivtmp.49_54 = PHI <_74(4), _50(7)>
+  _74 = ivtmp.49_54 + 2000;
+  goto <bb 3>;
+
+  <bb 6>:
+  ivtmp.58_31 = ivtmp.58_52 + 1000000;
+  if (ivtmp.58_31 != _62)
+    goto <bb 7>;
+  else
+    goto <bb 12>;
+
+  <bb 7>:
+  # ivtmp.58_52 = PHI <ivtmp.58_31(6), ivtmp.58_6(2)>
+  _50 = ivtmp.58_52 + 18446744073708551616;
+  goto <bb 5>;
+
+  <bb 8>:
+  # vect_resultat_28.6_46 = PHI <vect_resultat_28.6_12(8), { 0, 0, 0, 0 }(10)>
+  # ivtmp.12_43 = PHI <ivtmp.12_38(8), ivtmp.23_49(10)>
+  _13 = (void *) ivtmp.12_43;
+  vect__27.5_48 = MEM[base: _13, offset: 0B];
+  vect_resultat_28.6_12 = vect__27.5_48 + vect_resultat_28.6_46;
+  ivtmp.12_38 = ivtmp.12_43 + 16;
+  if (ivtmp.12_38 != _65)
+    goto <bb 8>;
+  else
+    goto <bb 9>;
+
+  <bb 9>:
+  # vect_resultat_28.6_11 = PHI <vect_resultat_28.6_12(8)>
+  vect_resultat_28.8_10 = vect_resultat_28.6_11 v>> 64;
+  vect_resultat_28.8_17 = vect_resultat_28.8_10 + vect_resultat_28.6_11;
+  vect_resultat_28.8_14 = vect_resultat_28.8_17 v>> 32;
+  vect_resultat_28.8_24 = vect_resultat_28.8_14 + vect_resultat_28.8_17;
+  stmp_resultat_28.7_16 = BIT_FIELD_REF <vect_resultat_28.8_24, 32, 0>;
+  resultat_33 = stmp_resultat_28.7_16 + resultat_34;
+  if (ivtmp.32_53 != _65)
+    goto <bb 10>;
+  else
+    goto <bb 11>;
+
+  <bb 10>:
+  # resultat_34 = PHI <resultat_33(9), resultat_35(12)>
+  # ivtmp.23_49 = PHI <_65(9), _39(12)>
+  _65 = ivtmp.23_49 + 2000;
+  goto <bb 8>;
+
+  <bb 11>:
+  # resultat_41 = PHI <resultat_33(9)>
+  ivtmp.32_40 = ivtmp.32_53 + 1000000;
+  if (ivtmp.32_40 != _62)
+    goto <bb 12>;
+  else
+    goto <bb 13>;
+
+  <bb 12>:
+  # resultat_35 = PHI <resultat_41(11), 0(6)>
+  # ivtmp.32_53 = PHI <ivtmp.32_40(11), ivtmp.58_6(6)>
+  _39 = ivtmp.32_53 + 18446744073708551616;
+  goto <bb 10>;
+
+  <bb 13>:
+  # resultat_37 = PHI <resultat_41(11)>
+  return resultat_37;
+
+}
+
+
@@ -0,0 +1,139 @@
+///////////////////////////////////////////     Optimisation 2/5  ////////////////////////////////////////////////////
+
+exercices : "fonctions imbriquées"
+
+Le compilateur voit bien l'utilité de la fonction "oppose" et remplace directement par des "-" .
+
+
+
+
+
+
+
+
+exercices "calcul du gain"
+
+On ajoute deux dimensions au tableau ( a[1000][1000][1000] )
+
+et on voit bien la différence 
+
+avec optimisation : 
+real    0m7.410s
+user    0m6.728s
+sys     0m0.672s
+                                  il est environ 1.5 fois plus rapide
+
+sans optimisation :
+real    0m10.000s
+user    0m9.364s
+sys     0m0.624s
+
+
+
+avec a[100][500][500]
+
+optimisé :
+real    0m0.245s
+user    0m0.216s
+sys     0m0.028s
+                           il est presque deux fois plus rapide avec la version optimisée
+
+non optimisé :
+real    0m0.405s
+user    0m0.384s
+sys     0m0.020s
+
+
+exercices "multiplication récursive"
+
+plus aboutie car le compilateur remplace directement les additions par une multiplication
+
+
+///////////////////////////////////////////     Optimisation 3/5  ////////////////////////////////////////////////////
+
+
+Exercice de code mort
+
+je modifie legerement le programme 
+
+#include <stdio.h>
+int main(void){
+int a=0;
+if(a==2) printf("Bonjour \n");
+printf("Coucou !\n");
+a=1;
+return a;
+printf("Caché !\n");
+}
+
+et le compile
+résultat : 
+
+;; Function main (main, funcdef_no=11, decl_uid=2234, symbol_order=11) (executed once)
+
+main ()
+{
+  <bb 2>:
+  __builtin_puts (&"Coucou !"[0]);
+  return 1;
+
+}
+
+Le compilateur enlève la ligne if(a==2) printf("Bonjour \n"); qui ne s'executerait jamais --> Code mort
+
+
+Exercice de propagation :
+
+en modifiant le code de cette manière puis en compilant (avec -03) j'obtient :
+
+ int main(void){
+int a=1,b=2,c=3, i=2;
+int d=a*c,e=d+2*b;
+while(i > 0) { i--; if(e!=2) e--; }
+return e;
+}
+
+
+;; Function main (main, funcdef_no=0, decl_uid=1743, symbol_order=0) (executed once)
+
+main ()
+{
+  int e;
+  int i;
+
+  <bb 2>:
+  return 5;
+
+}
+
+C'est assez impressionant !
+
+Exercice second degre :
+
+#include <stdio.h>
+#include <math.h>
+
+int main() {
+  int a,b,c;
+  scanf("%d,%d,%d",&a,&b,&c);
+  float r1, r2;
+
+if(b*b-4*a*c > 0) { r1=(-b-sqrt(b*b-4*a*c))/(2*a); r2=(-b+sqrt(b*b-4*a*c))/(2*a); printf("r1 = %f   \nr2 = %f",r1,r2);}
+
+if(b*b-4*a*c == 0) { r1 = -b/(2*a); r2=r1; printf("r1 = %f   \nr2 = %f",r1,r2); }
+
+if(b*b-4*a*c < 0) printf("pas de racine");
+
+return 0;
+
+}
+  
+ 
+ Pour ce code le compilateur recalcule le delta au moins une fois
+
+
+
+
+
+
+
@@ -0,0 +1,10 @@
+#include <stdio.h>
+static int oppose(int y) {return y*(-1);}
+static int soustraction(int x,int y){ return x+ oppose(y); }
+int main(void){
+int a,b,c;
+printf("Donnez 3 entiers\n");
+scanf("%d %d %d",&a,&b,&c);
+printf("%d\n",soustraction(a,soustraction(b,c)));
+return 0;
+}
@@ -0,0 +1,110 @@
+
+;; Function oppose (oppose, funcdef_no=11, decl_uid=2234, symbol_order=11)
+
+Iterations: 0
+oppose (int y)
+{
+  int _2;
+
+  <bb 2>:
+  _2 = -y_1(D);
+  return _2;
+
+}
+
+
+
+;; Function soustraction (soustraction, funcdef_no=12, decl_uid=2238, symbol_order=12)
+
+Considering inline candidate oppose.
+ Inlining oppose into soustraction.
+Iterations: 1
+Merging blocks 2 and 4
+Merging blocks 2 and 3
+
+Symbols to be put in SSA form
+{ D.2264 }
+Incremental SSA update started at block: 0
+Number of blocks in CFG: 3
+Number of blocks to update: 2 ( 67%)
+
+
+soustraction (int x, int y)
+{
+  int D.2264;
+  int _2;
+  int _4;
+  int _6;
+
+  <bb 2>:
+  _6 = -y_1(D);
+  _7 = _6;
+  _2 = _7;
+  _4 = _2 + x_3(D);
+  return _4;
+
+}
+
+
+
+;; Function main (main, funcdef_no=13, decl_uid=2241, symbol_order=13)
+
+Considering inline candidate soustraction.
+ Inlining soustraction into main.
+Considering inline candidate soustraction.
+ Inlining soustraction into main.
+Iterations: 1
+Merging blocks 2 and 4
+Merging blocks 3 and 6
+Merging blocks 2 and 3
+Merging blocks 2 and 5
+
+Symbols to be put in SSA form
+{ D.2269 D.2272 }
+Incremental SSA update started at block: 0
+Number of blocks in CFG: 3
+Number of blocks to update: 2 ( 67%)
+
+
+main ()
+{
+  int D.2272;
+  int D.2269;
+  int c;
+  int b;
+  int a;
+  int c.0_4;
+  int b.1_5;
+  int _6;
+  int a.2_7;
+  int _8;
+  int _10;
+  int _14;
+  int _15;
+  int _16;
+  int _17;
+
+  <bb 2>:
+  __builtin_puts (&"Donnez 3 entiers"[0]);
+  scanf ("%d %d %d", &a, &b, &c);
+  c.0_4 = c;
+  b.1_5 = b;
+  _14 = -c.0_4;
+  _15 = b.1_5 + _14;
+  _18 = _15;
+  _6 = _18;
+  a.2_7 = a;
+  _16 = -_6;
+  _17 = a.2_7 + _16;
+  _19 = _17;
+  _8 = _19;
+  printf ("%d\n", _8);
+  _10 = 0;
+  a ={v} {CLOBBER};
+  b ={v} {CLOBBER};
+  c ={v} {CLOBBER};
+  return _10;
+
+}
+
+
@@ -0,0 +1,31 @@
+
+;; Function main (main, funcdef_no=13, decl_uid=2241, symbol_order=13) (executed once)
+
+main ()
+{
+  int c;
+  int b;
+  int a;
+  int c.0_4;
+  int b.1_5;
+  int a.2_6;
+  int _11;
+  int _12;
+
+  <bb 2>:
+  __builtin_puts (&"Donnez 3 entiers"[0]);
+  scanf ("%d %d %d", &a, &b, &c);
+  c.0_4 = c;
+  b.1_5 = b;
+  _11 = b.1_5 - c.0_4;
+  a.2_6 = a;
+  _12 = a.2_6 - _11;
+  printf ("%d\n", _12);
+  a ={v} {CLOBBER};
+  b ={v} {CLOBBER};
+  c ={v} {CLOBBER};
+  return 0;
+
+}
+
+
@@ -0,0 +1,6 @@
+ int main(void){
+int a=1,b=2,c=3, i=2;
+int d=a*c,e=d+2*b;
+while(i > 0) { i--; if(e!=2) e--; }
+return e;
+}
@@ -0,0 +1,42 @@
+
+;; Function main (main, funcdef_no=0, decl_uid=1743, symbol_order=0)
+
+main ()
+{
+  int e;
+  int d;
+  int i;
+  int c;
+  int b;
+  int a;
+
+  <bb 2>:
+  i_6 = 2;
+  e_9 = 7;
+  goto <bb 5>;
+
+  <bb 3>:
+  i_10 = i_1 + -1;
+  if (e_2 != 2)
+    goto <bb 4>;
+  else
+    goto <bb 5>;
+
+  <bb 4>:
+  e_11 = e_2 + -1;
+
+  <bb 5>:
+  # i_1 = PHI <2(2), i_10(3), i_10(4)>
+  # e_2 = PHI <7(2), e_2(3), e_11(4)>
+  if (i_1 > 0)
+    goto <bb 3>;
+  else
+    goto <bb 6>;
+
+  <bb 6>:
+  e_12 = e_2;
+  return e_12;
+
+}
+
+
@@ -0,0 +1,40 @@
+
+;; Function main (main, funcdef_no=0, decl_uid=1743, symbol_order=0) (executed once)
+
+main ()
+{
+  int e;
+  int i;
+
+  <bb 2>:
+  goto <bb 7>;
+
+  <bb 3>:
+  i_5 = i_1 + -1;
+  if (e_2 != 2)
+    goto <bb 4>;
+  else
+    goto <bb 5>;
+
+  <bb 4>:
+  e_6 = e_2 + -1;
+
+  <bb 5>:
+  # i_3 = PHI <i_5(4), i_5(3)>
+  # e_4 = PHI <e_6(4), e_2(3)>
+
+  <bb 7>:
+  # i_1 = PHI <i_3(5), 2(2)>
+  # e_2 = PHI <e_4(5), 7(2)>
+  if (i_1 > 0)
+    goto <bb 3>;
+  else
+    goto <bb 6>;
+
+  <bb 6>:
+  e_7 = e_2;
+  return e_7;
+
+}
+
+
@@ -0,0 +1,14 @@
+
+;; Function main (main, funcdef_no=0, decl_uid=1743, symbol_order=0) (executed once)
+
+main ()
+{
+  int e;
+  int i;
+
+  <bb 2>:
+  return 5;
+
+}
+
+
@@ -0,0 +1,11 @@
+#include <stdio.h>
+int multiplication(int a,int b){
+if(b==0) return 0;
+else return multiplication(a,b-1)+a;
+}
+int main(void){
+int a,b;
+scanf("%d %d",&a,&b);
+printf("%d\n",multiplication(a,b));
+return 0;
+}
@@ -0,0 +1,60 @@
+
+;; Function multiplication (multiplication, funcdef_no=11, decl_uid=2235, symbol_order=11)
+
+Removing basic block 5
+multiplication (int a, int b)
+{
+  int add_acc_7;
+  int add_acc_9;
+
+  <bb 2>:
+  if (b_11(D) == 0)
+    goto <bb 4>;
+  else
+    goto <bb 3>;
+
+  <bb 3>:
+  add_acc_9 = a_4(D) * b_11(D);
+
+  <bb 4>:
+  # add_acc_7 = PHI <add_acc_9(3), 0(2)>
+  return add_acc_7;
+
+}
+
+
+
+;; Function main (main, funcdef_no=12, decl_uid=2238, symbol_order=12) (executed once)
+
+Removing basic block 5
+main ()
+{
+  int a;
+  int b;
+  int b;
+  int a;
+  int add_acc_12;
+  int add_acc_13;
+
+  <bb 2>:
+  scanf ("%d %d", &a, &b);
+  b_3 = b;
+  a_4 = a;
+  if (b_3 == 0)
+    goto <bb 4>;
+  else
+    goto <bb 3>;
+
+  <bb 3>:
+  add_acc_12 = b_3 * a_4;
+
+  <bb 4>:
+  # add_acc_13 = PHI <add_acc_12(3), 0(2)>
+  printf ("%d\n", add_acc_13);
+  a ={v} {CLOBBER};
+  b ={v} {CLOBBER};
+  return 0;
+
+}
+
+
@@ -0,0 +1,20 @@
+#include <stdio.h>
+#include <math.h>
+
+int main() {
+  int a,b,c;
+  scanf("%d,%d,%d",&a,&b,&c);
+  float r1, r2;
+
+if(b*b-4*a*c > 0) { r1=(-b-sqrt(b*b-4*a*c))/(2*a); r2=(-b+sqrt(b*b-4*a*c))/(2*a); printf("r1 = %f   \nr2 = %f",r1,r2);}
+
+if(b*b-4*a*c == 0) { r1 = -b/(2*a); r2=r1; printf("r1 = %f   \nr2 = %f",r1,r2); }
+
+if(b*b-4*a*c < 0) printf("pas de racine");
+
+return 0;
+
+}
+  
+  
+  
@@ -0,0 +1,153 @@
+
+;; Function main (main, funcdef_no=14, decl_uid=3287, symbol_order=14) (executed once)
+
+main ()
+{
+  float r2;
+  float r1;
+  int c;
+  int b;
+  int a;
+  int b.0_6;
+  int _7;
+  int a.1_8;
+  int _9;
+  int c.2_10;
+  int _11;
+  int _12;
+  int _13;
+  double _14;
+  double _15;
+  double _17;
+  double _18;
+  int a.1_19;
+  int _20;
+  double _21;
+  double _22;
+  int b.0_24;
+  int _25;
+  double _26;
+  int _27;
+  int _28;
+  int c.2_29;
+  int _30;
+  int _31;
+  double _32;
+  double _34;
+  double _35;
+  int a.1_36;
+  int _37;
+  double _38;
+  double _39;
+  double _41;
+  double _42;
+  int b.0_44;
+  int _45;
+  int a.1_46;
+  int _47;
+  int c.2_48;
+  int _49;
+  int _50;
+  int _51;
+  int _52;
+  double _54;
+  int pretmp_82;
+  int pretmp_84;
+  int pretmp_86;
+  int pretmp_88;
+  int pretmp_90;
+  int pretmp_92;
+  int pretmp_94;
+  int prephitmp_95;
+
+  <bb 2>:
+  scanf ("%d,%d,%d", &a, &b, &c);
+  b.0_6 = b;
+  _7 = b.0_6 * b.0_6;
+  a.1_8 = a;
+  _9 = a.1_8 * -4;
+  c.2_10 = c;
+  _11 = _9 * c.2_10;
+  _12 = _7 + _11;
+  if (_12 > 0)
+    goto <bb 3>;
+  else
+    goto <bb 4>;
+
+  <bb 3>:
+  _13 = -b.0_6;
+  _14 = (double) _13;
+  _15 = (double) _12;
+  _17 = sqrt (_15);
+  _18 = _14 - _17;
+  a.1_19 = a;
+  _20 = a.1_19 * 2;
+  _21 = (double) _20;
+  _22 = _18 / _21;
+  r1_23 = (float) _22;
+  b.0_24 = b;
+  _25 = -b.0_24;
+  _26 = (double) _25;
+  _27 = b.0_24 * b.0_24;
+  _28 = a.1_19 * -4;
+  c.2_29 = c;
+  _30 = _28 * c.2_29;
+  _31 = _27 + _30;
+  _32 = (double) _31;
+  _34 = sqrt (_32);
+  _35 = _26 + _34;
+  a.1_36 = a;
+  _37 = a.1_36 * 2;
+  _38 = (double) _37;
+  _39 = _35 / _38;
+  r2_40 = (float) _39;
+  _41 = (double) r2_40;
+  _42 = (double) r1_23;
+  printf ("r1 = %f   \nr2 = %f", _42, _41);
+
+  <bb 4>:
+  b.0_44 = b;
+  _45 = b.0_44 * b.0_44;
+  a.1_46 = a;
+  _47 = a.1_46 * -4;
+  c.2_48 = c;
+  _49 = _47 * c.2_48;
+  _50 = _45 + _49;
+  if (_50 == 0)
+    goto <bb 5>;
+  else
+    goto <bb 6>;
+
+  <bb 5>:
+  _51 = a.1_46 * -2;
+  _52 = b.0_44 / _51;
+  r2_53 = (float) _52;
+  _54 = (double) r2_53;
+  printf ("r1 = %f   \nr2 = %f", _54, _54);
+  pretmp_82 = b;
+  pretmp_84 = pretmp_82 * pretmp_82;
+  pretmp_86 = a;
+  pretmp_88 = pretmp_86 * -4;
+  pretmp_90 = c;
+  pretmp_92 = pretmp_88 * pretmp_90;
+  pretmp_94 = pretmp_84 + pretmp_92;
+
+  <bb 6>:
+  # prephitmp_95 = PHI <_50(4), pretmp_94(5)>
+  if (prephitmp_95 < 0)
+    goto <bb 7>;
+  else
+    goto <bb 8>;
+
+  <bb 7>:
+  printf ("pas de racine");
+
+  <bb 8>:
+  a ={v} {CLOBBER};
+  b ={v} {CLOBBER};
+  c ={v} {CLOBBER};
+  return 0;
+
+}
+
+
@@ -0,0 +1,156 @@
+
+;; Function main (main, funcdef_no=14, decl_uid=3287, symbol_order=14) (executed once)
+
+Removing basic block 9
+Removing basic block 10
+Removing basic block 11
+main ()
+{
+  float r2;
+  float r1;
+  int c;
+  int b;
+  int a;
+  int b.0_6;
+  int _7;
+  int a.1_8;
+  int _9;
+  int c.2_10;
+  int _11;
+  int _12;
+  int _13;
+  double _14;
+  double _15;
+  double _17;
+  double _18;
+  int a.1_19;
+  int _20;
+  double _21;
+  double _22;
+  int b.0_24;
+  int _25;
+  double _26;
+  int _27;
+  int _28;
+  int c.2_29;
+  int _30;
+  int _31;
+  double _32;
+  double _34;
+  double _35;
+  int a.1_36;
+  int _37;
+  double _38;
+  double _39;
+  double _41;
+  double _42;
+  int b.0_44;
+  int _45;
+  int a.1_46;
+  int _47;
+  int c.2_48;
+  int _49;
+  int _50;
+  int _51;
+  int _52;
+  double _54;
+  int pretmp_82;
+  int pretmp_84;
+  int pretmp_86;
+  int pretmp_88;
+  int pretmp_90;
+  int pretmp_92;
+  int pretmp_94;
+  int prephitmp_95;
+
+  <bb 2>:
+  scanf ("%d,%d,%d", &a, &b, &c);
+  b.0_6 = b;
+  _7 = b.0_6 * b.0_6;
+  a.1_8 = a;
+  _9 = a.1_8 * -4;
+  c.2_10 = c;
+  _11 = _9 * c.2_10;
+  _12 = _7 + _11;
+  if (_12 > 0)
+    goto <bb 3>;
+  else
+    goto <bb 4>;
+
+  <bb 3>:
+  _13 = -b.0_6;
+  _14 = (double) _13;
+  _15 = (double) _12;
+  _17 = sqrt (_15);
+  _18 = _14 - _17;
+  a.1_19 = a;
+  _20 = a.1_19 * 2;
+  _21 = (double) _20;
+  _22 = _18 / _21;
+  r1_23 = (float) _22;
+  b.0_24 = b;
+  _25 = -b.0_24;
+  _26 = (double) _25;
+  _27 = b.0_24 * b.0_24;
+  _28 = a.1_19 * -4;
+  c.2_29 = c;
+  _30 = _28 * c.2_29;
+  _31 = _27 + _30;
+  _32 = (double) _31;
+  _34 = sqrt (_32);
+  _35 = _26 + _34;
+  a.1_36 = a;
+  _37 = a.1_36 * 2;
+  _38 = (double) _37;
+  _39 = _35 / _38;
+  r2_40 = (float) _39;
+  _41 = (double) r2_40;
+  _42 = (double) r1_23;
+  printf ("r1 = %f   \nr2 = %f", _42, _41);
+
+  <bb 4>:
+  b.0_44 = b;
+  _45 = b.0_44 * b.0_44;
+  a.1_46 = a;
+  _47 = a.1_46 * -4;
+  c.2_48 = c;
+  _49 = _47 * c.2_48;
+  _50 = _45 + _49;
+  if (_50 == 0)
+    goto <bb 5>;
+  else
+    goto <bb 6>;
+
+  <bb 5>:
+  _51 = a.1_46 * -2;
+  _52 = b.0_44 / _51;
+  r2_53 = (float) _52;
+  _54 = (double) r2_53;
+  printf ("r1 = %f   \nr2 = %f", _54, _54);
+  pretmp_82 = b;
+  pretmp_84 = pretmp_82 * pretmp_82;
+  pretmp_86 = a;
+  pretmp_88 = pretmp_86 * -4;
+  pretmp_90 = c;
+  pretmp_92 = pretmp_88 * pretmp_90;
+  pretmp_94 = pretmp_84 + pretmp_92;
+
+  <bb 6>:
+  # prephitmp_95 = PHI <_50(4), pretmp_94(5)>
+  if (prephitmp_95 < 0)
+    goto <bb 7>;
+  else
+    goto <bb 8>;
+
+  <bb 7>:
+  printf ("pas de racine");
+
+  <bb 8>:
+  a ={v} {CLOBBER};
+  b ={v} {CLOBBER};
+  c ={v} {CLOBBER};
+  return 0;
+
+}
+
+