72 for ( pNode = p->
pTable[Entry]; pNode; pNode = pNode->
pNext )
97 int Volume, VolumeTotal = 0;
98 for ( pNode = p->
pTable[Entry]; pNode; pNode = pNode->
pNext )
105 VolumeTotal += Volume;
125 if ( pNode->
Id == 0 )
127 fprintf( pFile,
"Const1" );
133 fprintf( pFile,
"%c",
'a' + pNode->
Id - 1 );
142 fprintf( pFile,
"\'" );
146 fprintf( pFile,
"(" );
148 fprintf( pFile,
")\'" );
159 fprintf( pFile,
"(" );
161 fprintf( pFile,
")" );
166 fprintf( pFile,
"+" );
173 fprintf( pFile,
"\'" );
177 fprintf( pFile,
"(" );
179 fprintf( pFile,
")\'" );
190 fprintf( pFile,
"(" );
192 fprintf( pFile,
")" );
211 fprintf( pFile,
"%5d : ", pNode->
Id );
214 fprintf( pFile,
" tt=" );
219 fprintf( pFile,
" lev=%d", pNode->
Level );
220 fprintf( pFile,
" vol=%d", pNode->
Volume );
221 fprintf( pFile,
" " );
223 fprintf( pFile,
"\n" );
242 int Limit,
Counter, Volume, nFuncs, i;
243 pFile = fopen(
"graph_lib.txt",
"w" );
246 for ( i = 0; i < Limit; i++ )
248 if ( p->
pTable[i] == NULL )
252 fprintf( pFile,
"\nClass %3d. Func %6d. ", p->
pMap[i], Counter++ );
257 fprintf( pFile,
"\n" );
258 for ( pNode = p->
pTable[i]; pNode; pNode = pNode->
pNext )
void Rwr_ManPrint(Rwr_Man_t *p)
unsigned short * puCanons
void Rwr_NodePrint(FILE *pFile, Rwr_Man_t *p, Rwr_Node_t *pNode)
static int Rwr_IsComplement(Rwr_Node_t *p)
void Rwr_ManIncTravId(Rwr_Man_t *p)
ABC_NAMESPACE_IMPL_START void Rwr_Trav2_rec(Rwr_Man_t *p, Rwr_Node_t *pNode, int *pVolume)
DECLARATIONS ///.
#define ABC_NAMESPACE_IMPL_END
void Rwr_GetBushVolume(Rwr_Man_t *p, int Entry, int *pVolume, int *pnFuncs)
#define ABC_NAMESPACE_IMPL_START
int Rwr_GetBushSumOfVolumes(Rwr_Man_t *p, int Entry)
void Extra_PrintBinary(FILE *pFile, unsigned Sign[], int nBits)
static Rwr_Node_t * Rwr_Regular(Rwr_Node_t *p)
void Rwr_NodePrint_rec(FILE *pFile, Rwr_Node_t *pNode)