/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Guido Tack <tack@gecode.org>
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Guido Tack, 2004
 *     Christian Schulte, 2004
 *
 *  Last modified:
 *     $Date: 2008-02-26 11:08:59 +0100 (Tue, 26 Feb 2008) $ by $Author: tack $
 *     $Revision: 6312 $
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.org
 *
 *  Permission is hereby granted, free of charge, to any person obtaining
 *  a copy of this software and associated documentation files (the
 *  "Software"), to deal in the Software without restriction, including
 *  without limitation the rights to use, copy, modify, merge, publish,
 *  distribute, sublicense, and/or sell copies of the Software, and to
 *  permit persons to whom the Software is furnished to do so, subject to
 *  the following conditions:
 *
 *  The above copyright notice and this permission notice shall be
 *  included in all copies or substantial portions of the Software.
 *
 *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 */

#include "gecode/minimodel.hh"

namespace Gecode { namespace MiniModel {

  /*
   * Operations for nodes
   *
   */
  forceinline void*
  BoolExpr::Node::operator new(size_t size) {
    return Memory::malloc(size);
  }
  
  forceinline void
  BoolExpr::Node::operator delete(void* p, size_t) {
    Memory::free(p);
  }
  
  forceinline
  BoolExpr::Node::Node(void) : use(1) {}
  
  bool
  BoolExpr::Node::decrement(void) {
    if (--use == 0) {
      if ((l != NULL) && l->decrement())
        delete l;
      if ((r != NULL) && r->decrement())
        delete r;
      return true;
    }
    return false;
  }
  
  BoolVar
  BoolExpr::Node::post(Space* home, IntConLevel icl, PropKind pk) const {
    if (t == NT_VAR)
      return x;
    BoolVar b(home, 0, 1);
    post(home, b, icl, pk);
    return b;
  }
  
  int
  BoolExpr::Node::post(Space* home, NodeType t, 
                       BoolVarArgs& b, int i, 
                       IntConLevel icl, PropKind pk) const {
    if (this->t != t) {
      b[i] = post(home, icl, pk);
      return i+1;
    } else {
      return l->post(home, t, b, r->post(home, t, b, i, icl, pk), icl, pk);
    }
  }
  
  void
  BoolExpr::Node::post(Space* home, BoolVar b, 
                       IntConLevel icl, PropKind pk) const {
    assert(t != NT_VAR);
    switch (t) {
    case NT_NOT:
      rel(home, l->post(home, icl, pk), IRT_NQ, b, icl, pk);
      break;
    case NT_AND:
      if (same > 2) {
        BoolVarArgs ba(same);
        (void) post(home, NT_AND, ba, 0, icl, pk);
        rel(home, BOT_AND, ba, b, icl, pk);
      } else {
        rel(home, 
            l->post(home, icl, pk), BOT_AND, r->post(home, icl, pk), b, 
            icl, pk);
      }
      break;
    case NT_OR:
      if (same > 2) {
        BoolVarArgs ba(same);
        (void) post(home, NT_OR, ba, 0, icl, pk);
        rel(home, BOT_OR, ba, b, icl, pk);
      } else {
        rel(home, 
            l->post(home, icl, pk), BOT_OR, r->post(home, icl, pk), b, 
            icl, pk);
      }
      break;
    case NT_IMP:
      rel(home, 
          l->post(home, icl, pk), BOT_IMP, r->post(home, icl, pk), b, 
          icl, pk);
      break;
    case NT_XOR:
      rel(home, 
          l->post(home, icl, pk), BOT_XOR, r->post(home, icl, pk), b, 
          icl, pk);
      break;
    case NT_EQV:
      rel(home, 
          l->post(home, icl, pk), BOT_EQV, r->post(home, icl, pk), b, 
          icl, pk);
      break;
    case NT_RLIN_INT:
      rl_int.post(home, b, icl, pk);
      break;
    case NT_RLIN_BOOL:
      rl_bool.post(home, b, icl, pk);
      break;
    default: GECODE_NEVER;
    }
  }
  
  void
  BoolExpr::Node::post(Space* home, bool b, 
                       IntConLevel icl, PropKind pk) const {
    if (b) {
      switch (t) {
      case NT_VAR:
        rel(home, x, IRT_EQ, 1);
        break;
      case NT_NOT:
        l->post(home, false, icl, pk);
        break;
      case NT_OR:
        if (same > 2) {
          BoolVarArgs ba(same);
          (void) post(home, NT_OR, ba, 0, icl, pk);
          rel(home, BOT_OR, ba, 1, icl, pk);
        } else {
          rel(home, 
              l->post(home, icl, pk), BOT_OR, r->post(home, icl, pk), 1, 
              icl, pk);
        }
        break;
      case NT_AND:
        l->post(home, true, icl, pk); 
        r->post(home, true, icl, pk);
        break;
      case NT_EQV:
        if ((l->t == NT_VAR) && (r->t != NT_VAR)) {
          r->post(home, l->x, icl, pk);
        } else if ((l->t != NT_VAR) && (r->t == NT_VAR)) {
          l->post(home, r->x, icl, pk);
        } else if ((l->t != NT_VAR) && (r->t != NT_VAR)) {
          BoolVar b(home, 0, 1);
          l->post(home, b, icl, pk);
          r->post(home, b, icl, pk);
        } else {
          BoolVar b(home, 1, 1);
          post(home, b, icl, pk);
        }
        break;
      case NT_RLIN_INT:
        rl_int.post(home, true, icl, pk);
        break;
      case NT_RLIN_BOOL:
        rl_bool.post(home, true, icl, pk);
        break;
      default:
        {
          BoolVar b(home, 1, 1);
          post(home, b, icl, pk);
        }
        break;
      }
    } else {
      switch (t) {
      case NT_VAR:
        rel(home, x, IRT_EQ, 0, icl, pk);
        break;
      case NT_NOT:
        l->post(home, true, icl, pk);
        break;
      case NT_OR:
        l->post(home, false, icl, pk); 
        r->post(home, false, icl, pk);
        break;
      case NT_AND:
        if (same > 2) {
          BoolVarArgs ba(same);
          (void) post(home, NT_AND, ba, 0, icl, pk);
          rel(home, BOT_AND, ba, 0, icl, pk);
        } else {
          rel(home, 
              l->post(home, icl, pk), BOT_AND, r->post(home, icl, pk), 0, 
              icl, pk);
        }
        break;
      case NT_IMP:
        l->post(home, true, icl, pk);
        r->post(home, false, icl, pk);
        break;
      case NT_XOR:
        if ((l->t == NT_VAR) && (r->t != NT_VAR)) {
          r->post(home, l->x, icl, pk);
        } else if ((l->t != NT_VAR) && (r->t == NT_VAR)) {
          l->post(home, r->x, icl, pk);
        } else if ((l->t != NT_VAR) && (r->t != NT_VAR)) {
          BoolVar b(home, 0, 1);
          l->post(home, b, icl, pk);
          r->post(home, b, icl, pk);
        } else {
          BoolVar b(home, 0, 0);
          post(home, b, icl, pk);
        }
        break;
      case NT_RLIN_INT:
        rl_int.post(home, false, icl, pk);
        break;
      case NT_RLIN_BOOL:
        rl_bool.post(home, false, icl, pk);
        break;
      default:
        {
          BoolVar b(home, 0, 0);
          post(home, b, icl, pk);
        }
        break;
      }
    }
  }

  BoolExpr::BoolExpr(const BoolVar& x) : n(new Node) {
    n->same = 1;
    n->t    = NT_VAR;
    n->l    = NULL;
    n->r    = NULL;
    n->x    = x;
  }

  BoolExpr::BoolExpr(const BoolExpr& l, NodeType t, const BoolExpr& r)
    : n(new Node) {
    unsigned int ls = ((l.n->t == t) || (l.n->t == NT_VAR)) ? l.n->same : 1;
    unsigned int rs = ((r.n->t == t) || (r.n->t == NT_VAR)) ? r.n->same : 1;
    n->same = ls+rs;
    n->t    = t;
    n->l    = l.n;
    n->l->use++;
    n->r    = r.n;
    n->r->use++;
  }

  BoolExpr::BoolExpr(const BoolExpr& l, NodeType t)
    : n(new Node) {
    (void) t;
    assert(t == NT_NOT);
    n->same = 1;
    n->t    = NT_NOT;
    n->l    = l.n;
    n->l->use++;
    n->r    = NULL;
  }

  BoolExpr::BoolExpr(const LinRel<IntVar>& rl)
    : n(new Node) {
    n->same   = 1;
    n->t      = NT_RLIN_INT;
    n->l      = NULL;
    n->r      = NULL;
    n->rl_int = rl;
  }

  BoolExpr::BoolExpr(const LinRel<BoolVar>& rl)
    : n(new Node) {
    n->same    = 1;
    n->t       = NT_RLIN_BOOL;
    n->l       = NULL;
    n->r       = NULL;
    n->rl_bool = rl;
  }

  const BoolExpr&
  BoolExpr::operator=(const BoolExpr& e) {
    if (this != &e) {
      if (n->decrement())
        delete n;
      n = e.n;
      n->use++;
    }
    return *this;
  }

  BoolExpr::~BoolExpr(void) {
    if (n->decrement())
      delete n;
  }


}}

// STATISTICS: minimodel-any