gecoder-with-gecode 0.7.1 → 0.8.0

data/ext/gecode-2.1.1/gecode/support/buddy/kernel.h

@@ -0,0 +1,244 @@
+/*========================================================================
+               Copyright (C) 1996-2002 by Jorn Lind-Nielsen
+                            All rights reserved
+
+    Permission is hereby granted, without written agreement and without
+    license or royalty fees, to use, reproduce, prepare derivative
+    works, distribute, and display this software and its documentation
+    for any purpose, provided that (1) the above copyright notice and
+    the following two paragraphs appear in all copies of the source code
+    and (2) redistributions, including without limitation binaries,
+    reproduce these notices in the supporting documentation. Substantial
+    modifications to this software may be copyrighted by their authors
+    and need not follow the licensing terms described here, provided
+    that the new terms are clearly indicated in all files where they apply.
+
+    IN NO EVENT SHALL JORN LIND-NIELSEN, OR DISTRIBUTORS OF THIS
+    SOFTWARE BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL,
+    INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OF THIS
+    SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE AUTHORS OR ANY OF THE
+    ABOVE PARTIES HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    JORN LIND-NIELSEN SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,
+    BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+    FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
+    ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO
+    OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
+    MODIFICATIONS.
+========================================================================*/
+
+/*************************************************************************
+  $Header: /cvsroot/buddy/buddy/src/kernel.h,v 1.2 2004/07/13 20:51:49 haimcohen Exp $
+  FILE:  kernel.h
+  DESCR: Kernel specific definitions for BDD package
+  AUTH:  Jorn Lind
+  DATE:  (C) june 1997
+*************************************************************************/
+
+#ifndef _KERNEL_H
+#define _KERNEL_H
+
+#include "gecode/support/config.icc"
+
+#ifdef GECODE_GCC_HAS_CLASS_VISIBILITY
+#pragma GCC visibility push(default)
+#endif
+
+/*=== Includes =========================================================*/
+
+#include <limits.h>
+#include <setjmp.h>
+#include "gecode/support/buddy/bdd.h"
+
+/*=== SANITY CHECKS ====================================================*/
+
+   /* Make sure we use at least 32 bit integers */
+#if (INT_MAX < 0x7FFFFFFF)
+#error The compiler does not support 4 byte integers!
+#endif
+
+
+   /* Sanity check argument and return eventual error code */
+#define CHECK(r)\
+   if (!bddrunning) return bdd_error(BDD_RUNNING);\
+   else if ((r) < 0  ||  (r) >= bddnodesize) return bdd_error(BDD_ILLBDD);\
+   else if (r >= 2 && LOW(r) == -1) return bdd_error(BDD_ILLBDD)\
+
+   /* Sanity check argument and return eventually the argument 'a' */
+#define CHECKa(r,a)\
+   if (!bddrunning) { bdd_error(BDD_RUNNING); return (a); }\
+   else if ((r) < 0  ||  (r) >= bddnodesize)\
+     { bdd_error(BDD_ILLBDD); return (a); }\
+   else if (r >= 2 && LOW(r) == -1)\
+     { bdd_error(BDD_ILLBDD); return (a); }
+
+#define CHECKn(r)\
+   if (!bddrunning) { bdd_error(BDD_RUNNING); return; }\
+   else if ((r) < 0  ||  (r) >= bddnodesize)\
+     { bdd_error(BDD_ILLBDD); return; }\
+   else if (r >= 2 && LOW(r) == -1)\
+     { bdd_error(BDD_ILLBDD); return; }
+
+
+/*=== SEMI-INTERNAL TYPES ==============================================*/
+
+typedef struct s_BddNode /* Node table entry */
+{
+   unsigned int refcou : 10;
+   unsigned int level  : 22;
+   int low;
+   int high;
+   int hash;
+   int next;
+   int loCard;
+   int hiCard;
+} BddNode;
+
+
+/*=== KERNEL VARIABLES =================================================*/
+
+#ifdef CPLUSPLUS
+extern "C" {
+#endif
+
+extern GECODE_SUPPORT_EXPORT int       bddrunning;         /* Flag - package initialized */
+extern GECODE_SUPPORT_EXPORT int       bdderrorcond;       /* Some error condition was met */
+extern GECODE_SUPPORT_EXPORT int       bddnodesize;        /* Number of allocated nodes */
+extern GECODE_SUPPORT_EXPORT int       bddmaxnodesize;     /* Maximum allowed number of nodes */
+extern GECODE_SUPPORT_EXPORT int       bddmaxnodeincrease; /* Max. # of nodes used to inc. table */
+extern GECODE_SUPPORT_EXPORT BddNode*  bddnodes;           /* All of the bdd nodes */
+extern GECODE_SUPPORT_EXPORT int       bddvarnum;          /* Number of defined BDD variables */
+extern GECODE_SUPPORT_EXPORT int*      bddrefstack;        /* Internal node reference stack */
+extern GECODE_SUPPORT_EXPORT int*      bddrefstacktop;     /* Internal node reference stack top */
+extern GECODE_SUPPORT_EXPORT int*      bddvar2level;
+extern GECODE_SUPPORT_EXPORT int*      bddlevel2var;
+extern GECODE_SUPPORT_EXPORT jmp_buf   bddexception;
+extern GECODE_SUPPORT_EXPORT int       bddreorderdisabled;
+extern GECODE_SUPPORT_EXPORT int       bddresized;
+extern GECODE_SUPPORT_EXPORT bddCacheStat bddcachestats;
+
+#ifdef CPLUSPLUS
+}
+#endif
+
+
+/*=== KERNEL DEFINITIONS ===============================================*/
+
+#define MAXVAR 0x1FFFFF
+#define MAXREF 0x3FF
+
+   /* Reference counting */
+#define DECREF(n) if (bddnodes[n].refcou!=MAXREF && bddnodes[n].refcou>0) bddnodes[n].refcou--
+#define INCREF(n) if (bddnodes[n].refcou<MAXREF) bddnodes[n].refcou++
+#define DECREFp(n) if (n->refcou!=MAXREF && n->refcou>0) n->refcou--
+#define INCREFp(n) if (n->refcou<MAXREF) n->refcou++
+#define HASREF(n) (bddnodes[n].refcou > 0)
+
+   /* Marking BDD nodes */
+#define MARKON   0x200000    /* Bit used to mark a node (1) */
+#define MARKOFF  0x1FFFFF    /* - unmark */
+#define MARKHIDE 0x1FFFFF
+#define SETMARK(n)  (bddnodes[n].level |= MARKON)
+#define UNMARK(n)   (bddnodes[n].level &= MARKOFF)
+#define MARKED(n)   (bddnodes[n].level & MARKON)
+#define SETMARKp(p) (node->level |= MARKON)
+#define UNMARKp(p)  (node->level &= MARKOFF)
+#define MARKEDp(p)  (node->level & MARKON)
+
+   /* Hashfunctions */
+
+#define PAIR(a,b)      ((unsigned int)((((unsigned int)a)+((unsigned int)b))*(((unsigned int)a)+((unsigned int)b)+((unsigned int)1))/((unsigned int)2)+((unsigned int)a)))
+#define TRIPLE(a,b,c)  ((unsigned int)(PAIR((unsigned int)c,PAIR(a,b))))
+
+
+   /* Inspection of BDD nodes */
+#define ISCONST(a) ((a) < 2)
+#define ISNONCONST(a) ((a) >= 2)
+#define ISONE(a)   ((a) == 1)
+#define ISZERO(a)  ((a) == 0)
+#define LEVEL(a)   (bddnodes[a].level)
+#define LOW(a)     (bddnodes[a].low)
+#define HIGH(a)    (bddnodes[a].high)
+#define LEVELp(p)   ((p)->level)
+#define LOWp(p)     ((p)->low)
+#define HIGHp(p)    ((p)->high)
+
+   /* Stacking for garbage collector */
+#define INITREF    bddrefstacktop = bddrefstack
+#define PUSHREF(a) *(bddrefstacktop++) = (a)
+#define READREF(a) *(bddrefstacktop-(a))
+#define POPREF(a)  bddrefstacktop -= (a)
+
+#define BDDONE 1
+#define BDDZERO 0
+
+#ifndef CLOCKS_PER_SEC
+  /* Pass `CPPFLAGS=-DDEFAULT_CLOCK=1000' as an argument to ./configure
+     to override this setting.  */
+# ifndef DEFAULT_CLOCK
+#  define DEFAULT_CLOCK 60
+# endif
+# define CLOCKS_PER_SEC DEFAULT_CLOCK
+#endif
+
+#define DEFAULTMAXNODEINC 50000
+
+#define MIN(a,b) ((a) < (b) ? (a) : (b))
+#define MAX(a,b) ((a) > (b) ? (a) : (b))
+#define NEW(t,n) ( (t*)malloc(sizeof(t)*(n)) )
+
+
+/*=== KERNEL PROTOTYPES ================================================*/
+
+#ifdef CPLUSPLUS
+extern "C" {
+#endif
+
+extern int    bdd_error(int);
+extern int    bdd_makenode(unsigned int, int, int);
+extern int    bdd_noderesize(int);
+extern void   bdd_checkreorder(void);
+extern void   bdd_mark(int);
+extern void   bdd_mark_upto(int, int);
+extern void   bdd_markcount(int, int*);
+extern void   bdd_unmark(int);
+extern void   bdd_unmark_upto(int, int);
+extern void   bdd_register_pair(bddPair*);
+extern int   *fdddec2bin(int, int);
+
+extern int    bdd_operator_init(int);
+extern void   bdd_operator_done(void);
+extern void   bdd_operator_varresize(void);
+extern void   bdd_operator_reset(void);
+
+extern void   bdd_pairs_init(void);
+extern void   bdd_pairs_done(void);
+extern int    bdd_pairs_resize(int,int);
+extern void   bdd_pairs_vardown(int);
+
+extern void   bdd_fdd_init(void);
+extern void   bdd_fdd_done(void);
+
+extern void   bdd_reorder_init(void);
+extern void   bdd_reorder_done(void);
+extern int    bdd_reorder_ready(void);
+extern void   bdd_reorder_auto(void);
+extern int    bdd_reorder_vardown(int);
+extern int    bdd_reorder_varup(int);
+
+extern void   bdd_cpp_init(void);
+
+#ifdef CPLUSPLUS
+}
+#endif
+
+#ifdef GECODE_GCC_HAS_CLASS_VISIBILITY
+#pragma GCC visibility pop
+#endif
+
+#endif /* _KERNEL_H */
+
+
+/* EOF */
+
+// STATISTICS: buddy-any

data/ext/gecode-2.1.1/gecode/support/buddy/pairs.c

@@ -0,0 +1,336 @@
+/*========================================================================
+               Copyright (C) 1996-2002 by Jorn Lind-Nielsen
+                            All rights reserved
+
+    Permission is hereby granted, without written agreement and without
+    license or royalty fees, to use, reproduce, prepare derivative
+    works, distribute, and display this software and its documentation
+    for any purpose, provided that (1) the above copyright notice and
+    the following two paragraphs appear in all copies of the source code
+    and (2) redistributions, including without limitation binaries,
+    reproduce these notices in the supporting documentation. Substantial
+    modifications to this software may be copyrighted by their authors
+    and need not follow the licensing terms described here, provided
+    that the new terms are clearly indicated in all files where they apply.
+
+    IN NO EVENT SHALL JORN LIND-NIELSEN, OR DISTRIBUTORS OF THIS
+    SOFTWARE BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, SPECIAL,
+    INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OF THIS
+    SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE AUTHORS OR ANY OF THE
+    ABOVE PARTIES HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+    JORN LIND-NIELSEN SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,
+    BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+    FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
+    ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO
+    OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
+    MODIFICATIONS.
+========================================================================*/
+
+/*************************************************************************
+  $Header: /cvsroot/buddy/buddy/src/pairs.c,v 1.1.1.1 2004/06/25 13:22:50 haimcohen Exp $
+  FILE:  pairs.c
+  DESCR: Pair management for BDD package.
+  AUTH:  Jorn Lind
+  DATE:  february 1997
+*************************************************************************/
+#include <stdlib.h>
+#include <limits.h>
+#include "gecode/support/buddy/kernel.h"
+
+/*======================================================================*/
+
+static int      pairsid;            /* Pair identifier */
+static bddPair* pairs;              /* List of all replacement pairs in use */
+
+
+/*************************************************************************
+*************************************************************************/
+
+void bdd_pairs_init(void)
+{
+   pairsid = 0;
+   pairs = NULL;
+}
+
+
+void bdd_pairs_done(void)
+{
+   bddPair *p = pairs;
+   int n;
+
+   while (p != NULL)
+   {
+      bddPair *next = p->next;
+      for (n=0 ; n<bddvarnum ; n++)
+         bdd_delref( p->result[n] );
+      free(p->result);
+      free(p);
+      p = next;
+   }
+}
+
+
+static int update_pairsid(void)
+{
+   pairsid++;
+   
+   if (pairsid == (INT_MAX >> 2))
+   {
+      bddPair *p;
+      pairsid = 0;
+      for (p=pairs ; p!=NULL ; p=p->next)
+         p->id = pairsid++;
+      bdd_operator_reset();
+   }
+
+   return pairsid;
+}
+
+
+void bdd_register_pair(bddPair *p)
+{
+   p->next = pairs;
+   pairs = p;
+}
+
+
+void bdd_pairs_vardown(int level)
+{
+   bddPair *p;
+   
+   for (p=pairs ; p!=NULL ; p=p->next)
+   {
+      int tmp;
+
+      tmp = p->result[level];
+      p->result[level] = p->result[level+1];
+      p->result[level+1] = tmp;
+      
+      if (p->last == level)
+         p->last++;
+   }
+}
+
+
+int bdd_pairs_resize(int oldsize, int newsize)
+{
+   bddPair *p;
+   int n;
+   
+   for (p=pairs ; p!=NULL ; p=p->next)
+   {
+      if ((p->result=(BDD*)realloc(p->result,sizeof(BDD)*newsize)) == NULL)
+         return bdd_error(BDD_MEMORY);
+
+      for (n=oldsize ; n<newsize ; n++)
+         p->result[n] = bdd_ithvar(bddlevel2var[n]);
+   }
+
+   return 0;
+}
+
+
+/*
+NAME    {* bdd\_newpair *}
+SECTION {* kernel *}
+SHORT   {* creates an empty variable pair table *}
+PROTO   {* bddPair *bdd_newpair(void) *}
+DESCR   {* Variable pairs of the type {\tt bddPair} are used in
+           {\tt bdd\_replace} to define which variables to replace with
+           other variables. This function allocates such an empty table. The
+           table can be freed by a call to {\em bdd\_freepair}. *}
+RETURN  {* Returns a new table of pairs. *}
+ALSO    {* bdd\_freepair, bdd\_replace, bdd\_setpair, bdd\_setpairs *}
+*/
+bddPair *bdd_newpair(void)
+{
+   int n;
+   bddPair *p;
+   
+   if ((p=(bddPair*)malloc(sizeof(bddPair))) == NULL)
+   {
+      bdd_error(BDD_MEMORY);
+      return NULL;
+   }
+
+   if ((p->result=(BDD*)malloc(sizeof(BDD)*bddvarnum)) == NULL)
+   {
+      free(p);
+      bdd_error(BDD_MEMORY);
+      return NULL;
+   }
+
+   for (n=0 ; n<bddvarnum ; n++)
+      p->result[n] = bdd_ithvar(bddlevel2var[n]);
+
+   p->id = update_pairsid();
+   p->last = -1;
+   
+   bdd_register_pair(p);
+   return p;
+}
+
+
+/*
+NAME    {* bdd\_setpair *}
+EXTRA   {* bdd\_setbddpair *}
+SECTION {* kernel *}
+SHORT   {* set one variable pair *}
+PROTO   {* int bdd_setpair(bddPair *pair, int oldvar, int newvar)
+int bdd_setbddpair(bddPair *pair, BDD oldvar, BDD newvar) *}
+DESCR   {* Adds the pair {\tt (oldvar,newvar)} to the table of pairs
+           {\tt pair}. This results in {\tt oldvar} being substituted
+           with {\tt newvar} in a call to {\tt bdd\_replace}. In the first
+           version {\tt newvar} is an integer representing the variable
+           to be replaced with the old variable.
+           In the second version {\tt oldvar} is a BDD.
+           In this case the variable {\tt oldvar} is substituted with the
+           BDD {\tt newvar}.
+           The possibility to substitute with any BDD as {\tt newvar} is
+           utilized in bdd\_compose, whereas only the topmost variable
+           in the BDD is used in bdd\_replace. *}
+RETURN  {* Zero on success, otherwise a negative error code. *}
+ALSO    {* bdd\_newpair, bdd\_setpairs, bdd\_resetpair, bdd\_replace, bdd\_compose *}
+*/
+int bdd_setpair(bddPair *pair, int oldvar, int newvar)
+{
+   if (pair == NULL)
+      return 0;
+   
+   if (oldvar < 0  ||  oldvar > bddvarnum-1)
+      return bdd_error(BDD_VAR);
+   if (newvar < 0  ||  newvar > bddvarnum-1)
+      return bdd_error(BDD_VAR);
+
+   bdd_delref( pair->result[bddvar2level[oldvar]] );
+   pair->result[bddvar2level[oldvar]] = bdd_ithvar(newvar);
+   pair->id = update_pairsid();
+   
+   if (bddvar2level[oldvar] > pair->last)
+      pair->last = bddvar2level[oldvar];
+      
+   return 0;
+}
+
+
+int bdd_setbddpair(bddPair *pair, int oldvar, BDD newvar)
+{
+   int oldlevel;
+   
+   if (pair == NULL)
+      return 0;
+
+   CHECK(newvar);
+   if (oldvar < 0  ||  oldvar >= bddvarnum)
+      return bdd_error(BDD_VAR);
+   oldlevel = bddvar2level[oldvar];
+      
+   bdd_delref( pair->result[oldlevel] );
+   pair->result[oldlevel] = bdd_addref(newvar);
+   pair->id = update_pairsid();
+   
+   if (oldlevel > pair->last)
+      pair->last = oldlevel;
+      
+   return 0;
+}
+
+
+/*
+NAME    {* bdd\_setpairs *}
+EXTRA   {* bdd\_setbddpairs *}
+SECTION {* kernel *}
+SHORT   {* defines a whole set of pairs *}
+PROTO   {* int bdd_setpairs(bddPair *pair, int *oldvar, int *newvar, int size)
+int bdd_setbddpairs(bddPair *pair, int *oldvar, BDD *newvar, int size) *}
+DESCR   {* As for {\tt bdd\_setpair} but with {\tt oldvar} and {\tt newvar}
+           being arrays of variables (BDDs) of size {\tt size}. *}
+RETURN  {* Zero on success, otherwise a negative error code. *}
+ALSO    {* bdd\_newpair, bdd\_setpair, bdd\_replace, bdd\_compose *}
+*/
+int bdd_setpairs(bddPair *pair, int *oldvar, int *newvar, int size)
+{
+   int n,e;
+   if (pair == NULL)
+      return 0;
+   
+   for (n=0 ; n<size ; n++)
+      if ((e=bdd_setpair(pair, oldvar[n], newvar[n])) < 0)
+         return e;
+   
+   return 0;
+}
+
+
+int bdd_setbddpairs(bddPair *pair, int *oldvar, BDD *newvar, int size)
+{
+   int n,e;
+   if (pair == NULL)
+      return 0;
+   
+   for (n=0 ; n<size ; n++)
+      if ((e=bdd_setbddpair(pair, oldvar[n], newvar[n])) < 0)
+         return e;
+   
+   return 0;
+}
+
+
+/*
+NAME    {* bdd\_freepair *}
+SECTION {* kernel *}
+SHORT   {* frees a table of pairs *}
+PROTO   {* void bdd_freepair(bddPair *pair) *}
+DESCR   {* Frees the table of pairs {\tt pair} that has been allocated
+           by a call to {\tt bdd\_newpair}. *}
+ALSO    {* bdd\_replace, bdd\_newpair, bdd\_setpair, bdd\_resetpair *}
+*/
+void bdd_freepair(bddPair *p)
+{
+   int n;
+   
+   if (p == NULL)
+      return;
+   
+   if (pairs != p)
+   {
+      bddPair *bp = pairs;
+      while (bp != NULL  &&  bp->next != p)
+         bp = bp->next;
+
+      if (bp != NULL)
+         bp->next = p->next;
+   }
+   else
+      pairs = p->next;
+
+   for (n=0 ; n<bddvarnum ; n++)
+      bdd_delref( p->result[n] );
+   free(p->result);
+   free(p);
+}
+
+
+/*
+NAME    {* bdd\_resetpair *}
+SECTION {* kernel *}
+SHORT   {* clear all variable pairs *}
+PROTO   {* void bdd_resetpair(bddPair *pair) *}
+DESCR   {* Resets the table of pairs {\tt pair} by setting all substitutions
+           to their default values (that is no change). *}
+ALSO    {* bdd\_newpair, bdd\_setpair, bdd\_freepair *}
+*/
+void bdd_resetpair(bddPair *p)
+{
+   int n;
+
+   for (n=0 ; n<bddvarnum ; n++)
+      p->result[n] = bdd_ithvar(n);
+   p->last = 0;
+}
+
+
+/* EOF */
+
+// STATISTICS: buddy-any