Adding new command &rex2gia.

4 files changed, 417 insertions, 0 deletions

diff --git a/abclib.dsp b/abclib.dsp
index 56e09bbc..27412301 100644
--- a/abclib.dsp
+++ b/abclib.dsp
@@ -4267,6 +4267,10 @@ SOURCE=.\src\aig\gia\giaRetime.c
 # End Source File
 # Begin Source File
 
+SOURCE=.\src\aig\gia\giaRex.c
+# End Source File
+# Begin Source File
+
 SOURCE=.\src\aig\gia\giaScl.c
 # End Source File
 # Begin Source File
diff --git a/src/aig/gia/giaRex.c b/src/aig/gia/giaRex.c
new file mode 100644
index 00000000..55074f00
--- /dev/null
+++ b/src/aig/gia/giaRex.c
@@ -0,0 +1,345 @@
+/**CFile****************************************************************
+
+  FileName    [giaRex.c]
+
+  SystemName  [ABC: Logic synthesis and verification system.]
+
+  PackageName [Scalable AIG package.]
+
+  Synopsis    [Regular expressions.]
+
+  Author      [Alan Mishchenko]
+  
+  Affiliation [UC Berkeley]
+
+  Date        [Ver. 1.0. Started - June 20, 2005.]
+
+  Revision    [$Id: giaRex.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
+
+***********************************************************************/
+
+#include "gia.h"
+
+ABC_NAMESPACE_IMPL_START
+
+
+////////////////////////////////////////////////////////////////////////
+///                        DECLARATIONS                              ///
+////////////////////////////////////////////////////////////////////////
+
+////////////////////////////////////////////////////////////////////////
+///                     FUNCTION DEFINITIONS                         ///
+////////////////////////////////////////////////////////////////////////
+
+/**Function*************************************************************
+
+  Synopsis    [Simulate AIG with the given sequence.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+void Gia_ManAutomSimulate( Gia_Man_t * p, Vec_Int_t * vAlpha, char * pSim )
+{
+    Gia_Obj_t * pObj, * pObjRi, * pObjRo;
+    int nInputs = Vec_IntSize(vAlpha);
+    int nFrames = strlen(pSim);
+    int i, k;
+    assert( Gia_ManPiNum(p) == nInputs );
+    printf( "Simulating string \"%s\":\n", pSim );
+    Gia_ManCleanMark0(p);
+    Gia_ManForEachRo( p, pObj, i )
+        pObj->fMark0 = 0;
+    for ( i = 0; i < nFrames; i++ )
+    {
+        Gia_ManForEachPi( p, pObj, k )
+            pObj->fMark0 = (int)(Vec_IntFind(vAlpha, pSim[i]) == k);
+        Gia_ManForEachAnd( p, pObj, k )
+            pObj->fMark0 = (Gia_ObjFanin0(pObj)->fMark0 ^ Gia_ObjFaninC0(pObj)) & 
+                           (Gia_ObjFanin1(pObj)->fMark0 ^ Gia_ObjFaninC1(pObj));
+        Gia_ManForEachCo( p, pObj, k )
+            pObj->fMark0 = Gia_ObjFanin0(pObj)->fMark0 ^ Gia_ObjFaninC0(pObj);
+        Gia_ManForEachRiRo( p, pObjRi, pObjRo, k )
+            pObjRo->fMark0 = pObjRi->fMark0;
+
+        printf( "Frame %d : %c %d\n", i, pSim[i], Gia_ManPo(p, 0)->fMark0 );
+    }
+    Gia_ManCleanMark0(p);
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Builds 1-hotness contraint.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+void Gia_ManBuild1Hot_rec( Gia_Man_t * p, int * pLits, int nLits, int * pZero, int * pOne )
+{
+    int Zero0, One0, Zero1, One1;
+    if ( nLits == 1 )
+    {
+        *pZero = Abc_LitNot(pLits[0]);
+        *pOne  = pLits[0];
+        return;
+    }
+    Gia_ManBuild1Hot_rec( p, pLits,           nLits/2,         &Zero0, &One0 );
+    Gia_ManBuild1Hot_rec( p, pLits + nLits/2, nLits - nLits/2, &Zero1, &One1 );
+    *pZero = Gia_ManHashAnd( p, Zero0, Zero1 );
+    *pOne  = Gia_ManHashOr( p, Gia_ManHashAnd(p, Zero0, One1), Gia_ManHashAnd(p, Zero1, One0) );
+}
+int Gia_ManBuild1Hot( Gia_Man_t * p, Vec_Int_t * vLits )
+{
+    int Zero, One;
+    assert( Vec_IntSize(vLits) > 0 );
+    Gia_ManBuild1Hot_rec( p, Vec_IntArray(vLits), Vec_IntSize(vLits), &Zero, &One );
+    return One;
+}
+
+/**Function*************************************************************
+
+  Synopsis    [Converting regular expressions into sequential AIGs.]
+
+  Description [http://algs4.cs.princeton.edu/lectures/54RegularExpressions.pdf]
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+static inline int Gia_SymbSpecial( char c ) { return c == '(' || c == ')' || c == '*' || c == '|'; }
+// collects info about input alphabet and state of the automaton
+int Gia_ManRexNumInputs( char * pStr, Vec_Int_t ** pvAlphas, Vec_Int_t ** pvStr2Sta )
+{
+    int i, nStates = 0, Length = strlen(pStr);
+    Vec_Int_t * vAlphas  = Vec_IntAlloc( 100 );            // alphabet
+    Vec_Int_t * vStr2Sta = Vec_IntStartFull( Length + 1 ); // symbol to state
+    for ( i = 0; i < Length; i++ )
+    {
+        if ( Gia_SymbSpecial(pStr[i]) )
+            continue;
+        if ( Vec_IntFind(vAlphas, pStr[i]) == -1 )
+            Vec_IntPush( vAlphas, pStr[i] );
+        Vec_IntWriteEntry( vStr2Sta, i, nStates++ );
+    }
+    Vec_IntWriteEntry( vStr2Sta, i, nStates );
+    *pvAlphas  = vAlphas;
+    *pvStr2Sta = vStr2Sta;
+    return nStates;
+}
+// prints automaton
+void Gia_ManPrintAutom( char * pStr, Vec_Int_t * vStaTrans )
+{
+    int i = 0, nLength = strlen(pStr);
+    for ( i = 0; i < nLength; i++ )
+    {
+        printf( "%d \'%c\' ", i, pStr[i] );
+        if ( Vec_IntEntry(vStaTrans, i) >= 0 )
+            printf( "-> %d \'%c\' ", Vec_IntEntry(vStaTrans, i), pStr[Vec_IntEntry(vStaTrans, i)] );
+        printf( "\n" );
+    }
+}
+// prints states reachable through e-transitions
+void Gia_ManPrintReached( char * pStr, int iState, Vec_Int_t * vReached )
+{
+    int i, Entry;
+    printf( "Reached from state %d \'%c\':  ", iState, pStr[iState] );
+    Vec_IntForEachEntry( vReached, Entry, i )
+        printf( "%d \'%c\'  ", Entry, pStr[Entry] );
+    printf( "\n" );
+}
+// collect states reachable from the given one by e-transitions
+void Gia_ManPrintReached_rec( char * pStr, Vec_Int_t * vStaTrans, int iState, Vec_Int_t * vReached, Vec_Int_t * vVisited, int TravId )
+{
+    if ( Vec_IntEntry(vVisited, iState) == TravId )
+        return;
+    Vec_IntWriteEntry( vVisited, iState, TravId );
+    if ( !Gia_SymbSpecial(pStr[iState]) ) // read state
+        Vec_IntPush( vReached, iState );
+    if ( pStr[iState] == '\0' )
+        return;
+    if ( Gia_SymbSpecial(pStr[iState]) && pStr[iState] != '|' ) // regular e-transition
+       Gia_ManPrintReached_rec( pStr, vStaTrans, iState + 1, vReached, vVisited, TravId );
+    if ( Vec_IntEntry(vStaTrans, iState) >= 0 ) // additional e-transition
+       Gia_ManPrintReached_rec( pStr, vStaTrans, Vec_IntEntry(vStaTrans, iState), vReached, vVisited, TravId );
+}
+void Gia_ManCollectReached( char * pStr, Vec_Int_t * vStaTrans, int iState, Vec_Int_t * vReached, Vec_Int_t * vVisited, int TravId )
+{
+    assert( iState == 0 || !Gia_SymbSpecial(pStr[iState]) );
+    assert( Vec_IntEntry(vVisited, iState) != TravId );
+    Vec_IntClear( vReached );
+    Gia_ManPrintReached_rec( pStr, vStaTrans, iState + 1, vReached, vVisited, TravId );
+}
+// preprocesses the regular expression
+char * Gia_ManRexPreprocess( char * pStr )
+{
+    char * pCopy = ABC_CALLOC( char, strlen(pStr) * 2 + 10 );
+    int i, k = 0;
+    pCopy[k++] = '(';
+    for ( i = 0; pStr[i]; i++ )
+    {
+        if ( pStr[i] == '(' )
+            pCopy[k++] = '(';
+        else if ( pStr[i] == ')' )
+            pCopy[k++] = ')';
+        if ( pStr[i] != ' ' && pStr[i] != '\t' && pStr[i] != '\n' && pStr[i] != '\r' )
+            pCopy[k++] = pStr[i];
+    }
+    pCopy[k++] = ')';
+    pCopy[k++] = '\0';
+    return pCopy;
+}
+// construct sequential AIG for the automaton
+Gia_Man_t * Gia_ManRex2Gia( char * pStrInit, int fOrder, int fVerbose )
+{
+    Gia_Man_t * pNew = NULL, * pTemp; 
+    Vec_Int_t * vAlphas, * vStr2Sta, * vStaLits;
+    Vec_Int_t * vStaTrans, * vStack, * vVisited;
+    Vec_Str_t * vInit;
+    char * pStr = Gia_ManRexPreprocess( pStrInit );
+    int nStates = Gia_ManRexNumInputs( pStr, &vAlphas, &vStr2Sta );
+    int i, k, iLit, Entry, nLength = strlen(pStr), nTravId = 1;
+    if ( fOrder )
+        Vec_IntSort( vAlphas, 0 );
+//    if ( fVerbose )
+    {
+        printf( "Input variable order: " );
+        Vec_IntForEachEntry( vAlphas, Entry, k )
+            printf( "%c", (char)Entry );
+        printf( "\n" );
+    }
+    // start AIG
+    pNew = Gia_ManStart( 1000 );
+    pNew->pName = Abc_UtilStrsav( pStr );
+    for ( i = 0; i < Vec_IntSize(vAlphas) + nStates; i++ )
+        Gia_ManAppendCi( pNew );
+    // prepare automaton
+    vStaLits  = Vec_IntStart( nStates + 1 );
+    vStaTrans = Vec_IntStartFull( nLength );
+    vStack    = Vec_IntAlloc( nLength );
+    vVisited  = Vec_IntStartFull( nLength + 1 );
+    for ( i = 0; i < nLength; i++ )
+    {
+        int Lp = i;
+        if ( pStr[i] == '(' || pStr[i] == '|' )
+            Vec_IntPush( vStack, i );
+        else if ( pStr[i] == ')' )
+        {
+            int Or = Vec_IntPop( vStack );
+            if ( pStr[Or] == '|' )
+            {
+                Lp = Vec_IntPop( vStack );
+                Vec_IntWriteEntry( vStaTrans, Lp, Or + 1 );
+                Vec_IntWriteEntry( vStaTrans, Or, i );
+            }
+            else
+                Lp = Or;
+        }
+        if ( i < nLength - 1 && pStr[i+1] == '*' )
+        {
+            Vec_IntWriteEntry( vStaTrans, Lp, i+1 );
+            Vec_IntWriteEntry( vStaTrans, i+1, Lp );
+        }
+    }
+    assert( Vec_IntSize(vStack) == 0 );
+    if ( fVerbose )
+        Gia_ManPrintAutom( pStr, vStaTrans );
+
+    // create next-state functions for each state
+    Gia_ManHashAlloc( pNew );
+    for ( i = 1; i < nLength; i++ )
+    {
+        int iThis, iThat, iThisLit, iInputLit;
+        if ( Gia_SymbSpecial(pStr[i]) )
+            continue;
+        Gia_ManCollectReached( pStr, vStaTrans, i, vStack, vVisited, nTravId++ );
+        if ( fVerbose )
+            Gia_ManPrintReached( pStr, i, vStack );
+        // create transitions from this state under this input
+        iThis = Vec_IntEntry(vStr2Sta, i);
+        iThisLit = Gia_Obj2Lit(pNew, Gia_ManPi(pNew, Vec_IntSize(vAlphas) + iThis));
+        iInputLit = Gia_Obj2Lit(pNew, Gia_ManPi(pNew, Vec_IntFind(vAlphas, pStr[i])));
+        iLit = Gia_ManHashAnd( pNew, iThisLit, iInputLit );
+        Vec_IntForEachEntry( vStack, Entry, k )
+        {
+            iThat = Vec_IntEntry(vStr2Sta, Entry);
+            iLit = Gia_ManHashOr( pNew, iLit, Vec_IntEntry(vStaLits, iThat) );
+            Vec_IntWriteEntry( vStaLits, iThat, iLit );
+        }
+    }
+    // create one-hotness
+    Vec_IntClear( vStack );
+    for ( i = 0; i < Vec_IntSize(vAlphas); i++ )
+        Vec_IntPush( vStack, Gia_Obj2Lit(pNew, Gia_ManPi(pNew, i)) );
+    iLit = Gia_ManBuild1Hot( pNew, vStack );
+    // combine with outputs
+    Vec_IntForEachEntry( vStaLits, Entry, k )
+        Vec_IntWriteEntry( vStaLits, k, Gia_ManHashAnd(pNew, iLit, Entry) );
+    Gia_ManHashStop( pNew );
+
+    // collect initial state
+    Gia_ManCollectReached( pStr, vStaTrans, 0, vStack, vVisited, nTravId++ );
+    if ( fVerbose )
+        Gia_ManPrintReached( pStr, 0, vStack );
+    vInit = Vec_StrStart( nStates + 1 );
+    Vec_StrFill( vInit, nStates, '0' );
+    Vec_IntForEachEntry( vStack, Entry, k )
+        if ( pStr[Entry] != '\0' )
+            Vec_StrWriteEntry( vInit, Vec_IntEntry(vStr2Sta, Entry), '1' );
+    if ( fVerbose )
+        printf( "Init state = %s\n", Vec_StrArray(vInit) );
+
+    // add outputs
+    Vec_IntPushFirst( vStaLits, Vec_IntPop(vStaLits) );
+    assert( Vec_IntSize(vStaLits) == nStates + 1 );
+    Vec_IntForEachEntry( vStaLits, iLit, i )
+        Gia_ManAppendCo( pNew, iLit );
+    Gia_ManSetRegNum( pNew, nStates );
+    pNew = Gia_ManCleanup( pTemp = pNew );
+    Gia_ManStop( pTemp );
+
+    // add initial state
+    pNew = Gia_ManDupZeroUndc( pTemp = pNew, Vec_StrArray(vInit), 0 );
+    Gia_ManStop( pTemp );
+    Vec_StrFree( vInit );
+/*
+    Gia_ManAutomSimulate( pNew, vAlphas, "0" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "01" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "110" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "011" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "111" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "1111" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "1010" );
+
+    Gia_ManAutomSimulate( pNew, vAlphas, "A" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "AD" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "ABCD" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "BCD" );
+    Gia_ManAutomSimulate( pNew, vAlphas, "CD" );
+*/
+
+    // cleanup
+    Vec_IntFree( vAlphas );
+    Vec_IntFree( vStr2Sta );
+    Vec_IntFree( vStaLits );
+    Vec_IntFree( vStaTrans );
+    Vec_IntFree( vStack );
+    Vec_IntFree( vVisited );
+    ABC_FREE( pStr );
+    return pNew;
+}
+
+////////////////////////////////////////////////////////////////////////
+///                       END OF FILE                                ///
+////////////////////////////////////////////////////////////////////////
+
+
+ABC_NAMESPACE_IMPL_END
+
diff --git a/src/aig/gia/module.make b/src/aig/gia/module.make
index f8794bcf..0aecc70d 100644
--- a/src/aig/gia/module.make
+++ b/src/aig/gia/module.make
@@ -51,6 +51,7 @@ SRC +=    src/aig/gia/giaAig.c \
     src/aig/gia/giaQbf.c \
     src/aig/gia/giaResub.c \
     src/aig/gia/giaRetime.c \
+    src/aig/gia/giaRex.c \
     src/aig/gia/giaScl.c \
     src/aig/gia/giaScript.c \
     src/aig/gia/giaShrink.c \
diff --git a/src/base/abci/abc.c b/src/base/abci/abc.c
index ca0e2f33..26d28543 100644
--- a/src/base/abci/abc.c
+++ b/src/base/abci/abc.c
@@ -345,6 +345,7 @@ static int Abc_CommandAbc9PFan               ( Abc_Frame_t * pAbc, int argc, cha
 static int Abc_CommandAbc9PSig               ( Abc_Frame_t * pAbc, int argc, char ** argv );
 static int Abc_CommandAbc9Status             ( Abc_Frame_t * pAbc, int argc, char ** argv );
 static int Abc_CommandAbc9MuxProfile         ( Abc_Frame_t * pAbc, int argc, char ** argv );
+static int Abc_CommandAbc9Rex2Gia            ( Abc_Frame_t * pAbc, int argc, char ** argv );
 static int Abc_CommandAbc9Show               ( Abc_Frame_t * pAbc, int argc, char ** argv );
 static int Abc_CommandAbc9SetRegNum          ( Abc_Frame_t * pAbc, int argc, char ** argv );
 static int Abc_CommandAbc9Strash             ( Abc_Frame_t * pAbc, int argc, char ** argv );
@@ -962,6 +963,7 @@ void Abc_Init( Abc_Frame_t * pAbc )
     Cmd_CommandAdd( pAbc, "ABC9",         "&psig",         Abc_CommandAbc9PSig,         0 );
     Cmd_CommandAdd( pAbc, "ABC9",         "&status",       Abc_CommandAbc9Status,       0 );
     Cmd_CommandAdd( pAbc, "ABC9",         "&profile",      Abc_CommandAbc9MuxProfile,   0 );
+    Cmd_CommandAdd( pAbc, "ABC9",         "&rex2gia",      Abc_CommandAbc9Rex2Gia,      0 );
     Cmd_CommandAdd( pAbc, "ABC9",         "&show",         Abc_CommandAbc9Show,         0 );
     Cmd_CommandAdd( pAbc, "ABC9",         "&setregnum",    Abc_CommandAbc9SetRegNum,    0 );
     Cmd_CommandAdd( pAbc, "ABC9",         "&st",           Abc_CommandAbc9Strash,       0 );
@@ -26930,6 +26932,71 @@ usage:
   SeeAlso     []
 
 ***********************************************************************/
+int Abc_CommandAbc9Rex2Gia( Abc_Frame_t * pAbc, int argc, char ** argv )
+{
+    extern Gia_Man_t * Gia_ManRex2Gia( char * pStr, int fOrder, int fVerbose );
+    Gia_Man_t * pGia = NULL;
+    char * pStr = NULL;
+    char ** pArgvNew;
+    int nArgcNew;
+    int c, fOrder = 1, fVerbose = 0;
+    Extra_UtilGetoptReset();
+    while ( ( c = Extra_UtilGetopt( argc, argv, "avh" ) ) != EOF )
+    {
+        switch ( c )
+        {
+        case 'a':
+            fOrder ^= 1;
+            break;
+        case 'v':
+            fVerbose ^= 1;
+            break;
+        case 'h':
+            goto usage;
+        default:
+            goto usage;
+        }
+    }
+    pArgvNew = argv + globalUtilOptind;
+    nArgcNew = argc - globalUtilOptind;
+    if ( nArgcNew != 1 )
+    {
+        Abc_Print( -1, "No regular expression is entered on the command line.\n" );
+        return 1;
+    }
+    pStr = pArgvNew[0];
+    pGia = Gia_ManRex2Gia( pStr, fOrder, fVerbose );
+    if ( pGia )
+        Abc_FrameUpdateGia( pAbc, pGia );
+    return 0;
+
+usage:
+    Abc_Print( -2, "usage: &rex2gia [-avh] [string]\n" );
+    Abc_Print( -2, "\t         converts a regular expression into a sequential AIG\n" );
+    Abc_Print( -2, "\t-a     : toggle ordering input symbols alphabetically [default = %s]\n", fOrder? "yes": "no" );
+    Abc_Print( -2, "\t-v     : toggle verbose output [default = %s]\n", fVerbose? "yes": "no" );
+    Abc_Print( -2, "\t-h     : print the command usage\n");
+    Abc_Print( -2, "\tstring : representation of a regular expression\n");
+    Abc_Print( -2, "\t         Special symbols: parentheses \'(\' and \')\', Kleene closure \'*\', union \'|'\n");
+    Abc_Print( -2, "\t         All other characters are treated as symbols of the input alphabet.\n");
+    Abc_Print( -2, "\t         For example, ((A*B|AC)D) is defined over the alphabet {A, B, C, D}\n");
+    Abc_Print( -2, "\t         and generates the following language: {BD, ABD, AABD, AAABD, ..., ACD}\n");
+    Abc_Print( -2, "\t         A known limitation:  For the command to work correctly, each two-input union\n");
+    Abc_Print( -2, "\t         should have a dedicated pair of parentheses: ((A|B)|C) rather than (A|B|C)\n");
+    return 1;
+}
+
+/**Function*************************************************************
+
+  Synopsis    []
+
+  Description []
+
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
 int Abc_CommandAbc9Show( Abc_Frame_t * pAbc, int argc, char ** argv )
 {
     Aig_Man_t * pMan;