Version abc60508

7 files changed, 711 insertions, 1 deletions

diff --git a/src/misc/extra/extra.h b/src/misc/extra/extra.h
index e02ec82a..6336f5ea 100644
--- a/src/misc/extra/extra.h
+++ b/src/misc/extra/extra.h
@@ -41,6 +41,10 @@ extern "C" {
 /* Nested includes                                                           */
 /*---------------------------------------------------------------------------*/
 
+// this include should be the first one in the list
+// it is used to catch memory leaks on Windows
+#include "leaks.h"
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
@@ -463,6 +467,7 @@ extern unsigned Extra_TruthSemiCanonicize( unsigned * pInOut, unsigned * pAux, i
         (obj) ? ((type *) realloc((char *) obj, sizeof(type) * (num))) : \
         ((type *) malloc(sizeof(type) * (num)))
 
+
 extern long        Extra_CpuTime();
 extern int         Extra_GetSoftDataLimit();
 extern void        Extra_UtilGetoptReset();
diff --git a/src/misc/extra/extraUtilMemory.c b/src/misc/extra/extraUtilMemory.c
index c9137c56..768f86fa 100644
--- a/src/misc/extra/extraUtilMemory.c
+++ b/src/misc/extra/extraUtilMemory.c
@@ -73,6 +73,9 @@ struct Extra_MmStep_t_
     Extra_MmFixed_t ** pMems;    // memory managers: 2^1 words, 2^2 words, etc
     int                nMapSize; // the size of the memory array
     Extra_MmFixed_t ** pMap;     // maps the number of bytes into its memory manager
+    int                nLargeChunksAlloc;  // the maximum number of large memory chunks 
+    int                nLargeChunks;       // the current number of large memory chunks 
+    void **            pLargeChunks;       // the allocated large memory chunks
 };
 
 /*---------------------------------------------------------------------------*/
@@ -448,6 +451,7 @@ Extra_MmStep_t * Extra_MmStepStart( int nSteps )
     Extra_MmStep_t * p;
     int i, k;
     p = ALLOC( Extra_MmStep_t, 1 );
+    memset( p, 0, sizeof(Extra_MmStep_t) );
     p->nMems = nSteps;
     // start the fixed memory managers
     p->pMems = ALLOC( Extra_MmFixed_t *, p->nMems );
@@ -483,6 +487,12 @@ void Extra_MmStepStop( Extra_MmStep_t * p, int fVerbose )
     int i;
     for ( i = 0; i < p->nMems; i++ )
         Extra_MmFixedStop( p->pMems[i], fVerbose );
+//    if ( p->pLargeChunks ) 
+//    {
+//      for ( i = 0; i < p->nLargeChunks; i++ )
+//          free( p->pLargeChunks[i] );
+//      free( p->pLargeChunks );
+//    }
     free( p->pMems );
     free( p->pMap );
     free( p );
@@ -506,6 +516,17 @@ char * Extra_MmStepEntryFetch( Extra_MmStep_t * p, int nBytes )
     if ( nBytes > p->nMapSize )
     {
 //        printf( "Allocating %d bytes.\n", nBytes );
+/*
+        if ( p->nLargeChunks == p->nLargeChunksAlloc )
+        {
+            if ( p->nLargeChunksAlloc == 0 )
+                p->nLargeChunksAlloc = 5;
+            p->nLargeChunksAlloc *= 2;
+            p->pLargeChunks = REALLOC( char *, p->pLargeChunks, p->nLargeChunksAlloc ); 
+        }
+        p->pLargeChunks[ p->nLargeChunks++ ] = ALLOC( char, nBytes );
+        return p->pLargeChunks[ p->nLargeChunks - 1 ];
+*/
         return ALLOC( char, nBytes );
     }
     return Extra_MmFixedEntryFetch( p->pMap[nBytes] );
diff --git a/src/misc/extra/extraUtilTruth.c b/src/misc/extra/extraUtilTruth.c
index 2d6f307c..74308ab2 100644
--- a/src/misc/extra/extraUtilTruth.c
+++ b/src/misc/extra/extraUtilTruth.c
@@ -706,23 +706,27 @@ int Extra_TruthMinCofSuppOverlap( unsigned * pTruth, int nVars, int * pVarMin )
     static unsigned uCofactor[16];
     int i, ValueCur, ValueMin, VarMin;
     unsigned uSupp0, uSupp1;
+    int nVars0, nVars1;
     assert( nVars <= 9 );
     ValueMin = 32;
+    VarMin   = -1;
     for ( i = 0; i < nVars; i++ )
     {
         // get negative cofactor
         Extra_TruthCopy( uCofactor, pTruth, nVars );
         Extra_TruthCofactor0( uCofactor, nVars, i );
         uSupp0 = Extra_TruthSupport( uCofactor, nVars );
+        nVars0 = Extra_WordCountOnes( uSupp0 );
 //Extra_PrintBinary( stdout, &uSupp0, 8 ); printf( "\n" );
         // get positive cofactor
         Extra_TruthCopy( uCofactor, pTruth, nVars );
         Extra_TruthCofactor1( uCofactor, nVars, i );
         uSupp1 = Extra_TruthSupport( uCofactor, nVars );
+        nVars1 = Extra_WordCountOnes( uSupp1 );
 //Extra_PrintBinary( stdout, &uSupp1, 8 ); printf( "\n" );
         // get the number of common vars
         ValueCur = Extra_WordCountOnes( uSupp0 & uSupp1 );
-        if ( ValueMin > ValueCur )
+        if ( ValueMin > ValueCur && nVars0 <= 5 && nVars1 <= 5 )
         {
             ValueMin = ValueCur;
             VarMin = i;
diff --git a/src/misc/nm/nm.h b/src/misc/nm/nm.h
new file mode 100644
index 00000000..5b17aaed
--- /dev/null
+++ b/src/misc/nm/nm.h
@@ -0,0 +1,69 @@
+/**CFilextern e****************************************************************
+
+  FileName    [nm.h]
+
+  SystemName  [ABC: Logic synthesis and verification system.]
+
+  PackageName [Name manager.]
+
+  Synopsis    [External declarations.]
+
+  Author      [Alan Mishchenko]
+  
+  Affiliation [UC Berkeley]
+
+  Date        [Ver. 1.0. Started - June 20, 2005.]
+
+  Revision    [$Id: nm.h,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+ 
+#ifndef __NM_H__
+#define __NM_H__
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+////////////////////////////////////////////////////////////////////////
+///                          INCLUDES                                ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                         PARAMETERS                               ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                         BASIC TYPES                              ///
+////////////////////////////////////////////////////////////////////////
+
+typedef struct Nm_Man_t_ Nm_Man_t;
+
+////////////////////////////////////////////////////////////////////////
+///                      MACRO DEFINITIONS                           ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                    FUNCTION DECLARATIONS                         ///
+////////////////////////////////////////////////////////////////////////
+
+/*=== nmApi.c ==========================================================*/
+extern Nm_Man_t *   Nm_ManCreate( int nSize );
+extern void         Nm_ManFree( Nm_Man_t * p );
+extern int          Nm_ManNumEntries( Nm_Man_t * p );
+extern char *       Nm_ManStoreIdName( Nm_Man_t * p, int ObjId, char * pName, char * pSuffix );
+extern char *       Nm_ManCreateUniqueName( Nm_Man_t * p, int ObjId );
+extern char *       Nm_ManFindNameById( Nm_Man_t * p, int ObjId );
+extern int          Nm_ManFindIdByName( Nm_Man_t * p, char * pName, int * pSecond );
+extern void         Nm_ManPrintTables( Nm_Man_t * p );
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
+////////////////////////////////////////////////////////////////////////
+///                       END OF FILE                                ///
+////////////////////////////////////////////////////////////////////////
+
diff --git a/src/misc/nm/nmApi.c b/src/misc/nm/nmApi.c
new file mode 100644
index 00000000..72ec24e6
--- /dev/null
+++ b/src/misc/nm/nmApi.c
@@ -0,0 +1,262 @@
+/**CFile****************************************************************
+
+  FileName    [nmApi.c]
+
+  SystemName  [ABC: Logic synthesis and verification system.]
+
+  PackageName [Name manager.]
+
+  Synopsis    [APIs of the name manager.]
+
+  Author      [Alan Mishchenko]
+  
+  Affiliation [UC Berkeley]
+
+  Date        [Ver. 1.0. Started - June 20, 2005.]
+
+  Revision    [$Id: nmApi.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+
+#include "nmInt.h"
+
+////////////////////////////////////////////////////////////////////////
+///                        DECLARATIONS                              ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                     FUNCTION DEFINITIONS                         ///
+////////////////////////////////////////////////////////////////////////
+
+/**Function*************************************************************
+
+  Synopsis    [Allocates the name manager.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+Nm_Man_t * Nm_ManCreate( int nSize )
+{
+    Nm_Man_t * p;
+    // allocate the table
+    p = ALLOC( Nm_Man_t, 1 );
+    memset( p, 0, sizeof(Nm_Man_t) );
+    // set the parameters
+    p->nSizeFactor   = 3; // determined how much larger the table should be compared to data in it
+    p->nGrowthFactor = 3; // determined how much the table grows after resizing
+    // allocate and clean the bins
+    p->nBins = Cudd_PrimeNm(p->nSizeFactor*nSize);
+    p->pBinsI2N = ALLOC( Nm_Entry_t *, p->nBins );
+    p->pBinsN2I = ALLOC( Nm_Entry_t *, p->nBins );
+    memset( p->pBinsI2N, 0, sizeof(Nm_Entry_t *) * p->nBins );
+    memset( p->pBinsN2I, 0, sizeof(Nm_Entry_t *) * p->nBins );
+    // start the memory manager
+    p->pMem = Extra_MmFlexStart();
+    return p;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Deallocates the name manager.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+void Nm_ManFree( Nm_Man_t * p )
+{
+    Extra_MmFlexStop( p->pMem, 0 );
+    FREE( p->pBinsI2N );
+    FREE( p->pBinsN2I );
+    FREE( p );
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Returns the number of objects with names.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+int Nm_ManNumEntries( Nm_Man_t * p )
+{
+    return p->nEntries;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Creates a new entry in the name manager.]
+
+  Description [Returns 1 if the entry with the given object ID
+  already exists in the name manager.]
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+char * Nm_ManStoreIdName( Nm_Man_t * p, int ObjId, char * pName, char * pSuffix )
+{
+    Nm_Entry_t * pEntry, * pEntry2;
+    int RetValue, nEntrySize;
+    if ( pEntry = Nm_ManTableLookupId(p, ObjId) )
+    {
+        if ( strcmp(pEntry->Name, pName) == 0 )
+            printf( "Nm_ManStoreIdName(): Entry with the same ID and name already exists.\n" );
+        else
+            printf( "Nm_ManStoreIdName(): Entry with the same ID and different name already exists.\n" );
+        return NULL;
+    }
+    if ( pSuffix == NULL && (pEntry = Nm_ManTableLookupName(p, pName, &pEntry2)) && pEntry2 )
+    {
+        printf( "Nm_ManStoreIdName(): Two entries with the same name already exist.\n" );
+        return NULL;
+    }
+    // create the entry
+    nEntrySize = sizeof(Nm_Entry_t) + strlen(pName) + (pSuffix?strlen(pSuffix):0) + 1;
+    nEntrySize = (nEntrySize / 4 + ((nEntrySize % 4) > 0)) * 4;
+    pEntry = (Nm_Entry_t *)Extra_MmFlexEntryFetch( p->pMem, nEntrySize );
+    pEntry->ObjId = ObjId;
+    sprintf( pEntry->Name, "%s%s", pName, pSuffix? pSuffix : "" );
+    // add the entry to the hash table
+    RetValue = Nm_ManTableAdd( p, pEntry );
+    assert( RetValue == 1 );
+    return pEntry->Name;
+}
+
+
+/**Function*************************************************************
+
+  Synopsis    [Finds a unique name for the node.]
+
+  Description [If the name exists, tries appending numbers to it until 
+  it becomes unique.]
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+char * Nm_ManCreateUniqueName( Nm_Man_t * p, int ObjId )
+{
+    static char NameStr[1000];
+    Nm_Entry_t * pEntry;
+    int i;
+    if ( pEntry = Nm_ManTableLookupId(p, ObjId) )
+        return pEntry->Name;
+    sprintf( NameStr, "[%d]", ObjId );
+    for ( i = 1; Nm_ManTableLookupName(p, NameStr, NULL); i++ )
+        sprintf( NameStr, "[%d]_%d", ObjId, i );
+    return Nm_ManStoreIdName( p, ObjId, NameStr, NULL );
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Returns name of the object if the ID is known.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+char * Nm_ManFindNameById( Nm_Man_t * p, int ObjId )
+{
+    Nm_Entry_t * pEntry;
+    if ( pEntry = Nm_ManTableLookupId(p, ObjId) )
+        return pEntry->Name;
+    return NULL;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Returns ID of the object if its name is known.]
+
+  Description [This procedure may return two IDs because POs and latches 
+  may have the same name (the only allowed case of name duplication).]
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+int Nm_ManFindIdByName( Nm_Man_t * p, char * pName, int * pSecond )
+{
+    Nm_Entry_t * pEntry, * pEntry2;
+    if ( pEntry = Nm_ManTableLookupName(p, pName, &pEntry2) )
+    {
+        if ( pSecond )
+            *pSecond = pEntry2? pEntry2->ObjId : -1;
+        return pEntry->ObjId;
+    }
+    return -1;
+}
+
+
+/**Function*************************************************************
+
+  Synopsis    [Prints distribution of entries in the bins.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+void Nm_ManPrintTables( Nm_Man_t * p )
+{
+    int i, Counter;
+
+    // rehash the entries from the old table
+    Counter = 0;
+    printf( "Int2Name: " );
+    for ( i = 0; i < p->nBins; i++ )
+    {
+        if ( Counter == 0 && p->pBinsI2N[i] == NULL )
+            continue;
+        if ( p->pBinsI2N[i] )
+            Counter++;
+        else
+        {
+            printf( "%d ", Counter );
+            Counter = 0;
+        }
+    }
+    printf( "\n" );
+
+    // rehash the entries from the old table
+    Counter = 0;
+    printf( "Name2Int: " );
+    for ( i = 0; i < p->nBins; i++ )
+    {
+        if ( Counter == 0 && p->pBinsN2I[i] == NULL )
+            continue;
+        if ( p->pBinsN2I[i] )
+            Counter++;
+        else
+        {
+            printf( "%d ", Counter );
+            Counter = 0;
+        }
+    }
+    printf( "\n" );
+}
+
+////////////////////////////////////////////////////////////////////////
+///                       END OF FILE                                ///
+////////////////////////////////////////////////////////////////////////
+
+
diff --git a/src/misc/nm/nmInt.h b/src/misc/nm/nmInt.h
new file mode 100644
index 00000000..d0475c23
--- /dev/null
+++ b/src/misc/nm/nmInt.h
@@ -0,0 +1,86 @@
+/**CFile****************************************************************
+
+  FileName    [nmInt.h]
+
+  SystemName  [ABC: Logic synthesis and verification system.]
+
+  PackageName [Name manager.]
+
+  Synopsis    [Internal declarations.]
+
+  Author      [Alan Mishchenko]
+  
+  Affiliation [UC Berkeley]
+
+  Date        [Ver. 1.0. Started - June 20, 2005.]
+
+  Revision    [$Id: nmInt.h,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+ 
+#ifndef __NM_INT_H__
+#define __NM_INT_H__
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+////////////////////////////////////////////////////////////////////////
+///                          INCLUDES                                ///
+////////////////////////////////////////////////////////////////////////
+
+#include "extra.h"
+#include "nm.h"
+
+////////////////////////////////////////////////////////////////////////
+///                         PARAMETERS                               ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                         BASIC TYPES                              ///
+////////////////////////////////////////////////////////////////////////
+
+typedef struct Nm_Entry_t_ Nm_Entry_t;
+struct Nm_Entry_t_
+{
+    int              ObjId;         // object ID
+    char             Name[0];       // name of the object
+};
+
+struct Nm_Man_t_
+{
+    Nm_Entry_t **    pBinsI2N;      // mapping IDs into names
+    Nm_Entry_t **    pBinsN2I;      // mapping names into IDs 
+    int              nBins;         // the number of bins in tables
+    int              nEntries;      // the number of entries
+    int              nSizeFactor;   // determined how much larger the table should be
+    int              nGrowthFactor; // determined how much the table grows after resizing
+    Extra_MmFlex_t * pMem;          // memory manager for entries (and names)
+};
+
+////////////////////////////////////////////////////////////////////////
+///                      MACRO DEFINITIONS                           ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                    FUNCTION DECLARATIONS                         ///
+////////////////////////////////////////////////////////////////////////
+
+/*=== nmTable.c ==========================================================*/
+extern int              Nm_ManTableAdd( Nm_Man_t * p, Nm_Entry_t * pEntry );
+extern int              Nm_ManTableDelete( Nm_Man_t * p, Nm_Entry_t * pEntry );
+extern Nm_Entry_t *     Nm_ManTableLookupId( Nm_Man_t * p, int ObjId );
+extern Nm_Entry_t *     Nm_ManTableLookupName( Nm_Man_t * p, char * pName, Nm_Entry_t ** ppSecond );
+extern unsigned int     Cudd_PrimeNm( unsigned int p );
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
+////////////////////////////////////////////////////////////////////////
+///                       END OF FILE                                ///
+////////////////////////////////////////////////////////////////////////
+
+
diff --git a/src/misc/nm/nmTable.c b/src/misc/nm/nmTable.c
new file mode 100644
index 00000000..86c520d8
--- /dev/null
+++ b/src/misc/nm/nmTable.c
@@ -0,0 +1,263 @@
+/**CFile****************************************************************
+
+  FileName    [nmTable.c]
+
+  SystemName  [ABC: Logic synthesis and verification system.]
+
+  PackageName [Name manager.]
+
+  Synopsis    [Hash table for the name manager.]
+
+  Author      [Alan Mishchenko]
+  
+  Affiliation [UC Berkeley]
+
+  Date        [Ver. 1.0. Started - June 20, 2005.]
+
+  Revision    [$Id: nmTable.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+
+#include "nmInt.h"
+
+////////////////////////////////////////////////////////////////////////
+///                        DECLARATIONS                              ///
+////////////////////////////////////////////////////////////////////////
+
+// hashing for integers
+static unsigned Nm_HashNumber( int Num, int TableSize ) 
+{
+    unsigned Key = 0;
+    Key ^= ( Num        & 0xFF) * 7937;
+    Key ^= ((Num >>  8) & 0xFF) * 2971;
+    Key ^= ((Num >> 16) & 0xFF) * 911;
+    Key ^= ((Num >> 24) & 0xFF) * 353;
+    return Key % TableSize;
+}
+
+// hashing for strings
+static unsigned Nm_HashString( char * pName, int TableSize ) 
+{
+    static int s_Primes[10] = { 
+        1291, 1699, 2357, 4177, 5147, 
+        5647, 6343, 7103, 7873, 8147
+    };
+    unsigned i, Key = 0;
+    for ( i = 0; pName[i] != '\0'; i++ )
+        Key ^= s_Primes[i%10]*pName[i];
+    return Key % TableSize;
+}
+
+static void Nm_ManResize( Nm_Man_t * p );
+
+////////////////////////////////////////////////////////////////////////
+///                     FUNCTION DEFINITIONS                         ///
+////////////////////////////////////////////////////////////////////////
+
+/**Function*************************************************************
+
+  Synopsis    [Adds an entry to two hash tables.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+int Nm_ManTableAdd( Nm_Man_t * p, Nm_Entry_t * pEntry )
+{
+    int i;
+    // resize the tables if needed
+    if ( p->nEntries * p->nSizeFactor > p->nBins )
+    {
+//        Nm_ManPrintTables( p );
+        Nm_ManResize( p );
+    }
+    // hash it by ID
+    for ( i = Nm_HashNumber(pEntry->ObjId, p->nBins); p->pBinsI2N[i]; i = (i+1) % p->nBins )
+        if ( p->pBinsI2N[i] == pEntry )
+            return 0;
+    assert( p->pBinsI2N[i] == NULL );
+    p->pBinsI2N[i] = pEntry;
+    // hash it by Name
+    for ( i = Nm_HashString(pEntry->Name, p->nBins); p->pBinsN2I[i]; i = (i+1) % p->nBins )
+        if ( p->pBinsN2I[i] == pEntry )
+            return 0;
+    assert( p->pBinsN2I[i] == NULL );
+    p->pBinsN2I[i] = pEntry;
+    // report successfully added entry
+    p->nEntries++;
+    return 1;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Deletes the entry from two hash tables.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+int Nm_ManTableDelete( Nm_Man_t * p, Nm_Entry_t * pEntry )
+{
+    assert( 0 );
+    return 0;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Looks up the entry by ID.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+Nm_Entry_t * Nm_ManTableLookupId( Nm_Man_t * p, int ObjId )
+{
+    int i;
+    for ( i = Nm_HashNumber(ObjId, p->nBins); p->pBinsI2N[i]; i = (i+1) % p->nBins )
+        if ( p->pBinsI2N[i]->ObjId == ObjId )
+            return p->pBinsI2N[i];
+    return NULL;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Looks up the entry by name. May return two entries.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+Nm_Entry_t * Nm_ManTableLookupName( Nm_Man_t * p, char * pName, Nm_Entry_t ** ppSecond )
+{
+    Nm_Entry_t * pFirst, * pSecond;
+    int i;
+    pFirst = pSecond = NULL;
+    for ( i = Nm_HashString(pName, p->nBins); p->pBinsN2I[i]; i = (i+1) % p->nBins )
+        if ( strcmp(p->pBinsN2I[i]->Name, pName) == 0 )
+        {
+            if ( pFirst == NULL )
+                pFirst = p->pBinsN2I[i];
+            else if ( pSecond == NULL )
+                pSecond = p->pBinsN2I[i];
+            else
+                assert( 0 ); // name appears more than 2 times
+        }
+    // save the names
+    if ( ppSecond )
+        *ppSecond = pSecond;
+    return pFirst;
+}
+
+
+/**Function*************************************************************
+
+  Synopsis    [Resizes the table.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+void Nm_ManResize( Nm_Man_t * p )
+{
+    Nm_Entry_t ** pBinsNewI2N, ** pBinsNewN2I, * pEntry;
+    int nBinsNew, Counter, e, i, clk;
+
+clk = clock();
+    // get the new table size
+    nBinsNew = Cudd_PrimeCopy( p->nGrowthFactor * p->nBins ); 
+    // allocate a new array
+    pBinsNewI2N = ALLOC( Nm_Entry_t *, nBinsNew );
+    pBinsNewN2I = ALLOC( Nm_Entry_t *, nBinsNew );
+    memset( pBinsNewI2N, 0, sizeof(Nm_Entry_t *) * nBinsNew );
+    memset( pBinsNewN2I, 0, sizeof(Nm_Entry_t *) * nBinsNew );
+    // rehash the entries from the old table
+    Counter = 0;
+    for ( e = 0; e < p->nBins; e++ )
+    {
+        pEntry = p->pBinsI2N[e];
+        if ( pEntry == NULL )
+            continue;
+        Counter++;
+
+        // hash it by ID
+        for ( i = Nm_HashNumber(pEntry->ObjId, nBinsNew); pBinsNewI2N[i]; i = (i+1) % nBinsNew )
+            if ( pBinsNewI2N[i] == pEntry )
+                assert( 0 );
+        assert( pBinsNewI2N[i] == NULL );
+        pBinsNewI2N[i] = pEntry;
+        // hash it by Name
+        for ( i = Nm_HashString(pEntry->Name, nBinsNew); pBinsNewN2I[i]; i = (i+1) % nBinsNew )
+            if ( pBinsNewN2I[i] == pEntry )
+                assert( 0 );
+        assert( pBinsNewN2I[i] == NULL );
+        pBinsNewN2I[i] = pEntry;
+    }
+    assert( Counter == p->nEntries );
+//    printf( "Increasing the structural table size from %6d to %6d. ", p->nBins, nBinsNew );
+//    PRT( "Time", clock() - clk );
+    // replace the table and the parameters
+    free( p->pBinsI2N );
+    free( p->pBinsN2I );
+    p->pBinsI2N = pBinsNewI2N;
+    p->pBinsN2I = pBinsNewN2I;
+    p->nBins = nBinsNew;
+}
+
+
+
+/**Function*************************************************************
+
+  Synopsis    [Returns the smallest prime larger than the number.]
+
+  Description []
+
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+unsigned int Cudd_PrimeNm( unsigned int  p)
+{
+    int i,pn;
+
+    p--;
+    do {
+        p++;
+        if (p&1) {
+        pn = 1;
+        i = 3;
+        while ((unsigned) (i * i) <= p) {
+        if (p % i == 0) {
+            pn = 0;
+            break;
+        }
+        i += 2;
+        }
+    } else {
+        pn = 0;
+    }
+    } while (!pn);
+    return(p);
+
+} /* end of Cudd_Prime */
+
+////////////////////////////////////////////////////////////////////////
+///                       END OF FILE                                ///
+////////////////////////////////////////////////////////////////////////
+
+