diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2017-07-04 15:23:51 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2017-07-04 15:23:51 -0700 |
| commit | 859e769f22195ba971de037c883c0d8552459fe7 (patch) | |
| tree | d8ce1204cc1a42820d388f4dd62843aeba320c28 /src/aig/miniaig/minilut.h | |
| parent | bf6a053c648576c1e5493f2d5390eb78b2e3df1c (diff) | |
| download | abc-859e769f22195ba971de037c883c0d8552459fe7.tar.gz abc-859e769f22195ba971de037c883c0d8552459fe7.tar.bz2 abc-859e769f22195ba971de037c883c0d8552459fe7.zip | |
Synchronizing various data-structures.
Diffstat (limited to 'src/aig/miniaig/minilut.h')
| -rw-r--r-- | src/aig/miniaig/minilut.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/aig/miniaig/minilut.h b/src/aig/miniaig/minilut.h index e84428d4..fb5c6f06 100644 --- a/src/aig/miniaig/minilut.h +++ b/src/aig/miniaig/minilut.h @@ -123,9 +123,9 @@ static int Mini_LutNodeConst1() { return 1; static int Mini_LutNodeNum( Mini_Lut_t * p ) { return p->nSize; } static int Mini_LutNodeIsConst( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id == 0 || Id == 1; } -static int Mini_LutNodeIsPi( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 0 && Mini_LutNodeFanin( p, Id, 0 ) == MINI_LUT_NULL; } -static int Mini_LutNodeIsPo( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 0 && Mini_LutNodeFanin( p, Id, 0 ) != MINI_LUT_NULL && Mini_LutNodeFanin( p, Id, 1 ) == MINI_LUT_NULL2; } -static int Mini_LutNodeIsNode( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 0 && Mini_LutNodeFanin( p, Id, 0 ) != MINI_LUT_NULL && Mini_LutNodeFanin( p, Id, 1 ) != MINI_LUT_NULL2; } +static int Mini_LutNodeIsPi( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 1 && Mini_LutNodeFanin( p, Id, 0 ) == MINI_LUT_NULL; } +static int Mini_LutNodeIsPo( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 1 && Mini_LutNodeFanin( p, Id, 0 ) != MINI_LUT_NULL && Mini_LutNodeFanin( p, Id, 1 ) == MINI_LUT_NULL2; } +static int Mini_LutNodeIsNode( Mini_Lut_t * p, int Id ) { assert( Id >= 0 ); return Id > 1 && Mini_LutNodeFanin( p, Id, 0 ) != MINI_LUT_NULL && Mini_LutNodeFanin( p, Id, 1 ) != MINI_LUT_NULL2; } static int Mini_LutSize( Mini_Lut_t * p ) { return p->LutSize; } |