mvrprint.c

主要进行大规模的电路综合

/**CFile****************************************************************

  FileName    [mvrPrint.c]

  PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]

  Synopsis    [Functionality of the package to manipulate MV relations.]

  Author      [MVSIS Group]
  
  Affiliation [UC Berkeley]

  Date        [Ver. 1.0. Started - Aug 20, 2000  Last update - Aug 20, 2000
               Ver. 2.0. Started - Oct 09, 2001  Last update - Oct 09, 2001
               Ver. 2.1. Started - Nov 28, 2001  Last update - Nov 28, 2001]
               Ver. 3.0. Started - Mar 11, 2003  Last update - Mar 11, 2003]

  Revision    [$Id: mvrPrint.c,v 1.10 2003/05/27 23:15:19 alanmi Exp $]

***********************************************************************/

#include "mvrInt.h"

////////////////////////////////////////////////////////////////////////
///                        DECLARATIONS                              ///
////////////////////////////////////////////////////////////////////////

#if 0

// single line
#define SINGLE_VERTICAL     (char)179
#define SINGLE_HORIZONTAL   (char)196
#define SINGLE_TOP_LEFT     (char)218
#define SINGLE_TOP_RIGHT    (char)191
#define SINGLE_BOT_LEFT     (char)192
#define SINGLE_BOT_RIGHT    (char)217

// double line
#define DOUBLE_VERTICAL     (char)186
#define DOUBLE_HORIZONTAL   (char)205
#define DOUBLE_TOP_LEFT     (char)201
#define DOUBLE_TOP_RIGHT    (char)187
#define DOUBLE_BOT_LEFT     (char)200
#define DOUBLE_BOT_RIGHT    (char)188

// line intersections
#define SINGLES_CROSS       (char)197
#define DOUBLES_CROSS       (char)206
#define S_HOR_CROSS_D_VER   (char)215
#define S_VER_CROSS_D_HOR   (char)216

// single line joining
#define S_JOINS_S_VER_LEFT  (char)180
#define S_JOINS_S_VER_RIGHT (char)195
#define S_JOINS_S_HOR_TOP   (char)193
#define S_JOINS_S_HOR_BOT   (char)194

// double line joining
#define D_JOINS_D_VER_LEFT  (char)185
#define D_JOINS_D_VER_RIGHT (char)204
#define D_JOINS_D_HOR_TOP   (char)202
#define D_JOINS_D_HOR_BOT   (char)203

// single line joining double line
#define S_JOINS_D_VER_LEFT  (char)182
#define S_JOINS_D_VER_RIGHT (char)199
#define S_JOINS_D_HOR_TOP   (char)207
#define S_JOINS_D_HOR_BOT   (char)209

#endif

#if 0 

// single line
#define SINGLE_VERTICAL     (char)'|'
#define SINGLE_HORIZONTAL   (char)'-'
#define SINGLE_TOP_LEFT     (char)'+'
#define SINGLE_TOP_RIGHT    (char)'+'
#define SINGLE_BOT_LEFT     (char)'+'
#define SINGLE_BOT_RIGHT    (char)'+'

// double line
#define DOUBLE_VERTICAL     (char)'H'
#define DOUBLE_HORIZONTAL   (char)'='
#define DOUBLE_TOP_LEFT     (char)'H'
#define DOUBLE_TOP_RIGHT    (char)'H'
#define DOUBLE_BOT_LEFT     (char)'H'
#define DOUBLE_BOT_RIGHT    (char)'H'

// line intersections
#define SINGLES_CROSS       (char)'+'
#define DOUBLES_CROSS       (char)'H'
#define S_HOR_CROSS_D_VER   (char)'H'
#define S_VER_CROSS_D_HOR   (char)'+'

// single line joining
#define S_JOINS_S_VER_LEFT  (char)'+'
#define S_JOINS_S_VER_RIGHT (char)'+'
#define S_JOINS_S_HOR_TOP   (char)'+'
#define S_JOINS_S_HOR_BOT   (char)'+'

// double line joining
#define D_JOINS_D_VER_LEFT  (char)'H'
#define D_JOINS_D_VER_RIGHT (char)'H'
#define D_JOINS_D_HOR_TOP   (char)'H'
#define D_JOINS_D_HOR_BOT   (char)'H'

// single line joining double line
#define S_JOINS_D_VER_LEFT  (char)'H'
#define S_JOINS_D_VER_RIGHT (char)'H'
#define S_JOINS_D_HOR_TOP   (char)'+'
#define S_JOINS_D_HOR_BOT   (char)'+'

#endif


// single line
#define SINGLE_VERTICAL     (char)'|'
#define SINGLE_HORIZONTAL   (char)'-'
#define SINGLE_TOP_LEFT     (char)'+'
#define SINGLE_TOP_RIGHT    (char)'+'
#define SINGLE_BOT_LEFT     (char)'+'
#define SINGLE_BOT_RIGHT    (char)'+'

// double line
#define DOUBLE_VERTICAL     (char)'|'
#define DOUBLE_HORIZONTAL   (char)'-'
#define DOUBLE_TOP_LEFT     (char)'+'
#define DOUBLE_TOP_RIGHT    (char)'+'
#define DOUBLE_BOT_LEFT     (char)'+'
#define DOUBLE_BOT_RIGHT    (char)'+'

// line intersections
#define SINGLES_CROSS       (char)'+'
#define DOUBLES_CROSS       (char)'+'
#define S_HOR_CROSS_D_VER   (char)'+'
#define S_VER_CROSS_D_HOR   (char)'+'

// single line joining
#define S_JOINS_S_VER_LEFT  (char)'+'
#define S_JOINS_S_VER_RIGHT (char)'+'
#define S_JOINS_S_HOR_TOP   (char)'+'
#define S_JOINS_S_HOR_BOT   (char)'+'

// double line joining
#define D_JOINS_D_VER_LEFT  (char)'+'
#define D_JOINS_D_VER_RIGHT (char)'+'
#define D_JOINS_D_HOR_TOP   (char)'+'
#define D_JOINS_D_HOR_BOT   (char)'+'

// single line joining double line
#define S_JOINS_D_VER_LEFT  (char)'+'
#define S_JOINS_D_VER_RIGHT (char)'+'
#define S_JOINS_D_HOR_TOP   (char)'+'
#define S_JOINS_D_HOR_BOT   (char)'+'



// other symbols
#define UNDERSCORE          (char)95
//#define SYMBOL_ZERO       (char)248   // degree sign
#define SYMBOL_ZERO         (char)'o'
#define SYMBOL_ONE          (char)'1'
#define SYMBOL_DC           (char)'-'
#define SYMBOL_OVERLAP      (char)'?'

// full cells and half cells
#define CELL_FREE           (char)32
#define CELL_FULL           (char)219
#define HALF_UPPER          (char)223
#define HALF_LOWER          (char)220
#define HALF_LEFT           (char)221
#define HALF_RIGHT          (char)222

// the maximum number of variables in k-maps
#define MAXVARS   14
#define MAXCELLS  1000
#define MAXVALUES 100

static int Mvr_RelationFindPartition( Mvr_Relation_t * pMvr );

////////////////////////////////////////////////////////////////////////
///                     FUNCTION DEFITIONS                           ///
////////////////////////////////////////////////////////////////////////

/**Function*************************************************************

  Synopsis    [Prints the Karnough-map of the relation.]

  Description [Prints the relation. Uses the real variable names 
  if the node is given.]
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
void Mvr_RelationPrintKmap( FILE * pFile, Mvr_Relation_t * pMvr, char ** pVarNames )
{
	Vm_VarMap_t * pVm;
	DdManager * dd = pMvr->pMan->pDdLoc;
	DdNode * bCubeHor, * bCube, * bValueSet;
	DdNode * bCubeVer, * bTemp;
	DdNode ** pbCubes;
	DdNode * bCubeInputs;

	char Buffer[10];
	int fUserNames;

	int * pVarMap;
	int nVarsVer, nVarsHor;
	int nCellsVer, nCellsHor;
	int nSkipSpaces;
	int nOutputValues;
	int nInputs;

	int	CellWidth, PartSkip, IntervalSkip;
	int Divisor, DivisorPrev;
	int VertProd, VertRemain;
	int iValue;

	int VertVarValues[MAXVALUES];
	int HoriVarValues[MAXVALUES];
	int VertLineType[MAXCELLS];
	int HoriLineType[MAXCELLS];
	int HoriInterval;
	int VertInterval;
	int a, b, w, p, s, v, n, h, d, i;

	//////////////////////////////////////////////////////////////////////
	// check the relation's support
	Mvr_RelationCheckSupport( pMvr );
//PRB( pMvr->pMan->pDdLoc, pMvr->bRel );

	// get the MV var map
	pVm = Mvr_RelationReadVm( pMvr );
    if ( pVm->nVarsIn > MAXVARS )
    {
        fprintf( pFile, "Cannot print the K-map of the MV relation with %d variables.\n", pVm->nVarsIn );
        return;
    }

    // check if the relation is all-binary
    // in this case, we print the binary K-map
    if ( Vm_VarMapIsBinary(pVm) && Vm_VarMapReadVarsInNum(pVm) )
    {
        DdNode * bVar, * bOnSet, * bOffSet, * bInter, * bTemp;
        DdNode * bXVars[MAXVARS];

        // cofactor the relation
        bVar = dd->vars[ pMvr->pVmx->pBitsOrder[pVm->nVarsIn] ];
        bOffSet = Cudd_Cofactor( dd, pMvr->bRel, Cudd_Not(bVar) );  Cudd_Ref( bOffSet );
        bOnSet  = Cudd_Cofactor( dd, pMvr->bRel, bVar );            Cudd_Ref( bOnSet );

        // subtract the intersection from both cofactors
        bInter  = Cudd_bddAnd( dd, bOffSet, bOnSet );               Cudd_Ref( bInter );
        bOffSet = Cudd_bddAnd( dd, bTemp = bOffSet, Cudd_Not(bInter) );       Cudd_Ref( bOffSet );
        Cudd_RecursiveDeref( dd, bTemp );
        bOnSet = Cudd_bddAnd( dd, bTemp = bOnSet, Cudd_Not(bInter) );         Cudd_Ref( bOnSet );
        Cudd_RecursiveDeref( dd, bTemp );
        Cudd_RecursiveDeref( dd, bInter );

        for ( i = 0; i < pVm->nVarsIn; i++ )
            bXVars[i] = dd->vars[ pMvr->pVmx->pBitsOrder[i] ];
        Extra_PrintKMap( pFile, dd, bOnSet, bOffSet, pVm->nVarsIn, bXVars, -1, pVarNames );
        Cudd_RecursiveDeref( dd, bOffSet );
        Cudd_RecursiveDeref( dd, bOnSet );
        return;
    }

	// find the partitioning of variables into horizontal and vertical
	nVarsHor = Mvr_RelationFindPartition( pMvr );
	nVarsVer = pVm->nVarsIn - nVarsHor;

	// get the total number of cells vertically and horizontally
	nCellsHor = 1;
	for ( i = 0; i < nVarsHor; i++ )
		nCellsHor *= pVm->pValues[i];

	nCellsVer = 1;
	for ( i = nVarsHor; i < pVm->nVarsIn; i++ )
		nCellsVer *= pVm->pValues[i];

	// check if the number of cells is okay
	if ( nCellsHor > MAXCELLS-2 || nCellsVer > MAXCELLS-2 )
	{
		fprintf( pFile, "Mvr_RelationPrintKmap(): Cannot print K-map because of large total number of input values\n" );
		return;
	}

	// get other parameters
	nInputs       = pVm->nVarsIn;
	nOutputValues = Vm_VarMapReadValuesOutput(pVm);
	CellWidth     = nOutputValues + 3;
	PartSkip      = CellWidth/2;  // the number of spaces to skip before the first digit
	IntervalSkip  = CellWidth;    // the number of spaces to skip between the cells
	nSkipSpaces   = nVarsVer + 1;

	// get the input names if they are not given
	fUserNames = 1;
	if ( pVarNames == NULL )
	{
		fUserNames = 0;
		pVarNames = ALLOC( char *, nInputs + 1 );
		for ( i = 0; i <= nInputs; i++ )
		{
			sprintf( Buffer, "v%d", i );
			pVarNames[i] = util_strsav( Buffer );
		}
	}