diff options
| author | Alan Mishchenko <alanmi@berkeley.edu> | 2011-04-13 22:41:54 -0700 |
|---|---|---|
| committer | Alan Mishchenko <alanmi@berkeley.edu> | 2011-04-13 22:41:54 -0700 |
| commit | 6e74c46bcfbf48029d17835754fd570f283fb9d8 (patch) | |
| tree | eb5556b76b4f0f9cc82c4d042e94089638819fcd /src/misc/vec/vecVec.h | |
| parent | 8b22fd285607c2d99150ef7f1ec0c4a7d9a9b8de (diff) | |
| download | abc-6e74c46bcfbf48029d17835754fd570f283fb9d8.tar.gz abc-6e74c46bcfbf48029d17835754fd570f283fb9d8.tar.bz2 abc-6e74c46bcfbf48029d17835754fd570f283fb9d8.zip | |
Enabled new BDD-based reachability engine 'reachy'.
Diffstat (limited to 'src/misc/vec/vecVec.h')
| -rw-r--r-- | src/misc/vec/vecVec.h | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/src/misc/vec/vecVec.h b/src/misc/vec/vecVec.h index 83c334b4..cb3b3445 100644 --- a/src/misc/vec/vecVec.h +++ b/src/misc/vec/vecVec.h @@ -64,6 +64,8 @@ struct Vec_Vec_t_ for ( i = Vec_VecSize(vGlob)-1; (i >= 0) && (((vVec) = (Vec_Ptr_t*)Vec_VecEntry(vGlob, i)), 1); i-- ) #define Vec_VecForEachLevelReverseStartStop( vGlob, vVec, i, LevelStart, LevelStop ) \ for ( i = LevelStart-1; (i >= LevelStop) && (((vVec) = (Vec_Ptr_t*)Vec_VecEntry(vGlob, i)), 1); i-- ) +#define Vec_VecForEachLevelTwo( vGlob1, vGlob2, vVec1, vVec2, i ) \ + for ( i = 0; (i < Vec_VecSize(vGlob1)) && (((vVec1) = (Vec_Ptr_t*)Vec_VecEntry(vGlob1, i)), 1) && (((vVec2) = (Vec_Ptr_t*)Vec_VecEntry(vGlob2, i)), 1); i++ ) // iterators through levels #define Vec_VecForEachLevelInt( vGlob, vVec, i ) \ @@ -78,6 +80,8 @@ struct Vec_Vec_t_ for ( i = Vec_VecSize(vGlob)-1; (i >= 0) && (((vVec) = (Vec_Int_t*)Vec_VecEntry(vGlob, i)), 1); i-- ) #define Vec_VecForEachLevelIntReverseStartStop( vGlob, vVec, i, LevelStart, LevelStop ) \ for ( i = LevelStart-1; (i >= LevelStop) && (((vVec) = (Vec_Int_t*)Vec_VecEntry(vGlob, i)), 1); i-- ) +#define Vec_VecForEachLevelIntTwo( vGlob1, vGlob2, vVec1, vVec2, i ) \ + for ( i = 0; (i < Vec_VecSize(vGlob1)) && (((vVec1) = (Vec_Int_t*)Vec_VecEntry(vGlob1, i)), 1) && (((vVec2) = (Vec_Int_t*)Vec_VecEntry(vGlob2, i)), 1); i++ ) // iteratores through entries #define Vec_VecForEachEntry( Type, vGlob, pEntry, i, k ) \ |