;; 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;

}