diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2019-06-28 14:23:26 +0300 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2019-06-28 14:23:26 +0300 |
| commit | 9acc242e6d25506a0b0c92e594678ffde3b8dcfb (patch) | |
| tree | e6f09d1d10e0ac7611d33c171ca14e5204c30c28 | |
| parent | 0e787224199d3a39d112b238861b0fca01ba431f (diff) | |
| download | abc-9acc242e6d25506a0b0c92e594678ffde3b8dcfb.tar.gz abc-9acc242e6d25506a0b0c92e594678ffde3b8dcfb.tar.bz2 abc-9acc242e6d25506a0b0c92e594678ffde3b8dcfb.zip | |
Assering valid fanins during MiniLUT construction.
| -rw-r--r-- | src/aig/miniaig/minilut.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/aig/miniaig/minilut.h b/src/aig/miniaig/minilut.h index fb5c6f06..b080c983 100644 --- a/src/aig/miniaig/minilut.h +++ b/src/aig/miniaig/minilut.h @@ -97,6 +97,8 @@ static void Mini_LutPush( Mini_Lut_t * p, int nVars, int * pVars, unsigned * pTr Mini_LutGrow( p, 2 * p->nCap ); } for ( i = 0; i < nVars; i++ ) + assert( pVars[i] >= 0 && pVars[i] < p->nSize ); + for ( i = 0; i < nVars; i++ ) p->pArray[p->LutSize * p->nSize + i] = pVars[i]; for ( ; i < p->LutSize; i++ ) p->pArray[p->LutSize * p->nSize + i] = MINI_LUT_NULL; |