summaryrefslogtreecommitdiffstats
path: root/src/aig/hop/hopCheck.c
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2008-01-30 08:01:00 -0800
committerAlan Mishchenko <alanmi@berkeley.edu>2008-01-30 08:01:00 -0800
commit4d30a1e4f1edecff86d5066ce4653a370e59e5e1 (patch)
tree366355938a4af0a92f848841ac65374f338d691b /src/aig/hop/hopCheck.c
parent6537f941887b06e588d3acfc97b5fdf48875cc4e (diff)
downloadabc-4d30a1e4f1edecff86d5066ce4653a370e59e5e1.tar.gz
abc-4d30a1e4f1edecff86d5066ce4653a370e59e5e1.tar.bz2
abc-4d30a1e4f1edecff86d5066ce4653a370e59e5e1.zip
Version abc80130
Diffstat (limited to 'src/aig/hop/hopCheck.c')
-rw-r--r--src/aig/hop/hopCheck.c110
1 files changed, 0 insertions, 110 deletions
diff --git a/src/aig/hop/hopCheck.c b/src/aig/hop/hopCheck.c
deleted file mode 100644
index 9120906f..00000000
--- a/src/aig/hop/hopCheck.c
+++ /dev/null
@@ -1,110 +0,0 @@
-/**CFile****************************************************************
-
- FileName [hopCheck.c]
-
- SystemName [ABC: Logic synthesis and verification system.]
-
- PackageName [Minimalistic And-Inverter Graph package.]
-
- Synopsis [AIG checking procedures.]
-
- Author [Alan Mishchenko]
-
- Affiliation [UC Berkeley]
-
- Date [Ver. 1.0. Started - May 11, 2006.]
-
- Revision [$Id: hopCheck.c,v 1.00 2006/05/11 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#include "hop.h"
-
-////////////////////////////////////////////////////////////////////////
-/// DECLARATIONS ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-/// FUNCTION DEFINITIONS ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
- Synopsis [Checks the consistency of the AIG manager.]
-
- Description []
-
- SideEffects []
-
- SeeAlso []
-
-***********************************************************************/
-int Hop_ManCheck( Hop_Man_t * p )
-{
- Hop_Obj_t * pObj, * pObj2;
- int i;
- // check primary inputs
- Hop_ManForEachPi( p, pObj, i )
- {
- if ( Hop_ObjFanin0(pObj) || Hop_ObjFanin1(pObj) )
- {
- printf( "Hop_ManCheck: The PI node \"%p\" has fanins.\n", pObj );
- return 0;
- }
- }
- // check primary outputs
- Hop_ManForEachPo( p, pObj, i )
- {
- if ( !Hop_ObjFanin0(pObj) )
- {
- printf( "Hop_ManCheck: The PO node \"%p\" has NULL fanin.\n", pObj );
- return 0;
- }
- if ( Hop_ObjFanin1(pObj) )
- {
- printf( "Hop_ManCheck: The PO node \"%p\" has second fanin.\n", pObj );
- return 0;
- }
- }
- // check internal nodes
- Hop_ManForEachNode( p, pObj, i )
- {
- if ( !Hop_ObjFanin0(pObj) || !Hop_ObjFanin1(pObj) )
- {
- printf( "Hop_ManCheck: The AIG has internal node \"%p\" with a NULL fanin.\n", pObj );
- return 0;
- }
- if ( Hop_ObjFanin0(pObj)->Id >= Hop_ObjFanin1(pObj)->Id )
- {
- printf( "Hop_ManCheck: The AIG has node \"%p\" with a wrong ordering of fanins.\n", pObj );
- return 0;
- }
- pObj2 = Hop_TableLookup( p, pObj );
- if ( pObj2 != pObj )
- {
- printf( "Hop_ManCheck: Node \"%p\" is not in the structural hashing table.\n", pObj );
- return 0;
- }
- }
- // count the total number of nodes
- if ( Hop_ManObjNum(p) != 1 + Hop_ManPiNum(p) + Hop_ManPoNum(p) + Hop_ManAndNum(p) + Hop_ManExorNum(p) )
- {
- printf( "Hop_ManCheck: The number of created nodes is wrong.\n" );
- return 0;
- }
- // count the number of nodes in the table
- if ( Hop_TableCountEntries(p) != Hop_ManAndNum(p) + Hop_ManExorNum(p) )
- {
- printf( "Hop_ManCheck: The number of nodes in the structural hashing table is wrong.\n" );
- return 0;
- }
-// if ( !Hop_ManIsAcyclic(p) )
-// return 0;
- return 1;
-}
-
-////////////////////////////////////////////////////////////////////////
-/// END OF FILE ///
-////////////////////////////////////////////////////////////////////////
-
-