Code coverage for expr_and_and_logic.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_AND_AND_LOGIC;

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


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

Section Inherit

  + parent_expr_and_logic:Expanded EXPR_AND_LOGIC;

Section Public

  + symbol:STRING_CONSTANT := "  ";

  //
  // Execute.
  //

  - execute_unlink:INSTR <-
  (
    execute_link
  );

  - execute_link:EXPR <-
  ( + result:EXPR;
    + old_seq:UINTEGER_32;
    + left_cst,right_cst:PROTOTYPE_CST;
    + left_t,right_t:TYPE;

    old_seq := seq_call_and_loop;
    left  := left.execute_link;
    //
    seq_or_and := seq_or_and + 1;
    seq_inline := seq_inline + 1;
    //
    right := right.execute_link;
    //
    left_cst  ?= left;
    right_cst ?= right;

    (left_cst != NULL).if { // BSBS : Peux faire mieux !!!
      (left_cst.static_type.raw = type_true).if {
	left_t := type_true;
      } else {
	left_t := type_false;
      };
    };
    (right_cst != NULL).if {
      (right_cst.static_type.raw = type_true).if {
	right_t := type_true;
      } else {
	right_t := type_false;
      };
    };

    // Conservator transformation.
    result := exec_conservator;
    ((result = NULL)    {left_cst != NULL}).if {
      result := exec_conservator_left left_t;
    };
    ((result = NULL)    {right_cst != NULL}).if {
      result := exec_conservator_right right_t;
    };
    (
      (result = NULL)       
      {right_cst != NULL}   
      {left_cst != NULL}
    ).if {
      result := exec left_t and right_t;
    };
    ((result = NULL)    {(old_seq + 1) = seq_call_and_loop}).if {
      // No conservator transformation.
      result := exec;
      ((result = NULL)    {left_cst != NULL}).if {
	result := exec_left left_t;
      };
      ((result = NULL)    {right_cst != NULL}).if {
	result := exec_right right_t;
      };
    };
    //
    (result = NULL).if {
      result := Self;
    } else {
      new_execute_pass;
    };

    result
  );

  - exec_conservator:EXPR <-
  //-- E    Var -> E   Var
  ( + rd:READ;
    + result:EXPR;

    rd ?= right;
    (rd != NULL).if {
      result := EXPR_AND_LOGIC.create position with left and right;
    };
    result
  );

  //-- for    same  

  - exec_conservator_left  left_cst :TYPE :EXPR <-
  //-- FALSE    E -> FALSE
  ( + result:EXPR;

    result := parent_expr_and_logic.exec_conservator_left left_cst;
    ((result = NULL)    {left_cst = type_false}).if {
      result := left;
      right.remove;
    };
    result
  );