Code coverage for expr_mul.li

///////////////////////////////////////////////////////////////////////////////
//                             Lisaac Compiler                               //
//                                                                           //
//                   LSIIT - ULP - CNRS - INRIA - FRANCE                     //
//                                                                           //
//   This program is free software: you can redistribute it and/or modify    //
//   it under the terms of the GNU General Public License as published by    //
//   the Free Software Foundation, either version 3 of the License, or       //
//   (at your option) any later version.                                     //
//                                                                           //
//   This program is distributed in the hope that it will be useful,         //
//   but WITHOUT ANY WARRANTY; without even the implied warranty of          //
//   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the           //
//   GNU General Public License for more details.                            //
//                                                                           //
//   You should have received a copy of the GNU General Public License       //
//   along with this program.  If not, see <http://www.gnu.org/licenses/>.   //
//                                                                           //
//                     http://isaacproject.u-strasbg.fr/                     //
///////////////////////////////////////////////////////////////////////////////
Section Header

  + name        := EXPR_MUL;

  - copyright   := "2003-2007 Benoit Sonntag";


  - author      := "Sonntag Benoit (bsonntag@loria.fr)";
  - comment     := "Mul Binary Expression.";

Section Inherit

  + parent_expr_binary:Expanded EXPR_BINARY;

Section Public

  - symbol:STRING_CONSTANT := "*";

  //
  // Execute.
  //

  - exec_conservator_left  left_cst :INTEGER_CST :EXPR <-
  //-- 1   * E -> E
  //-- -1  * E -> - E
  //-- 2^n * E -> E << n
  ( + v:INTEGER_64;
    + result:EXPR;

    (left_cst.value = 1).if {
      left_cst.remove;
      result := right;
    }.elseif {left_cst.value = -1} then {
      left_cst.remove;
      result := EXPR_NEG.create position with right;
    }.elseif {(v := left_cst.to_power) != -1} then {
      left_cst.set_value v;
      result := EXPR_SHIFT_L.create position with right and left_cst;
    };
    result
  );

  - exec_conservator_right right_cst:INTEGER_CST :EXPR <-
  //-- E *   1 -> E
  //-- E *  -1 -> - E
  //-- E * 2^n -> E << n
  ( + result:EXPR;
    + v:INTEGER_64;

    (right_cst.value = 1).if {
      right_cst.remove;
      result := left;
    }.elseif {right_cst.value = -1} then {
      right_cst.remove;
      result := EXPR_NEG.create position with left;
    }.elseif {(v := right_cst.to_power) != -1} then {
      right_cst.set_value v;
      result := EXPR_SHIFT_L.create position with left and right_cst;
    };
    result
  );

  - exec left_cst:INTEGER_CST and right_cst:INTEGER_CST :EXPR <-
  //-- C1 * C2 -> C3
  (
    left_cst.set_value (left_cst.value * right_cst.value);
    right_cst.remove;
    left_cst
  );

  - exec_left  left_cst :INTEGER_CST :EXPR <-
  //-- 0   * E -> 0
  ( + result:EXPR;

    (left_cst.value = 0).if {
      result := left_cst;
      right.remove;
    };
    result
  );

  - exec_right right_cst:INTEGER_CST :EXPR <-
  //-- E *   0 -> 0
  ( + result:EXPR;

    (right_cst.value = 0).if {
      result := right_cst;
      left.remove;
    };
    result
  );