mirror of https://github.com/YosysHQ/abc.git
219 lines
6.4 KiB
C
219 lines
6.4 KiB
C
|
/**CFile****************************************************************
|
||
|
|
|
||
|
|
FileName [vecVec.h]
|
||
|
|
|
||
|
|
SystemName [ABC: Logic synthesis and verification system.]
|
||
|
|
|
||
|
|
PackageName [Resizable arrays.]
|
||
|
|
|
||
|
|
Synopsis [Resizable vector of resizable vectors.]
|
||
|
|
|
||
|
|
Author [Alan Mishchenko]
|
||
|
|
|
||
|
|
Affiliation [UC Berkeley]
|
||
|
|
|
||
|
|
Date [Ver. 1.0. Started - June 20, 2005.]
|
||
|
|
|
||
|
|
Revision [$Id: vecVec.h,v 1.00 2005/06/20 00:00:00 alanmi Exp $]
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
|
||
|
|
#ifndef __VEC_VEC_H__
|
||
|
|
#define __VEC_VEC_H__
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// INCLUDES ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include "extra.h"
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// PARAMETERS ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// BASIC TYPES ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
typedef struct Vec_Vec_t_ Vec_Vec_t;
|
||
|
|
struct Vec_Vec_t_
|
||
|
|
{
|
||
|
|
int nSize;
|
||
|
|
int nCap;
|
||
|
|
void ** pArray;
|
||
|
|
};
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// MACRO DEFITIONS ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
// iterators through levels
|
||
|
|
#define Vec_VecForEachLevel( vGlob, vVec, i ) \
|
||
|
|
for ( i = 0; (i < Vec_VecSize(vGlob)) && (((vVec) = Vec_VecEntry(vGlob, i)), 1); i++ )
|
||
|
|
#define Vec_VecForEachLevelStart( vGlob, vVec, i, LevelStart ) \
|
||
|
|
for ( i = LevelStart; (i < Vec_PtrSize(vGlob)) && (((vVec) = Vec_VecEntry(vGlob, i)), 1); i++ )
|
||
|
|
#define Vec_VecForEachLevelStartStop( vGlob, vVec, i, LevelStart, LevelStop ) \
|
||
|
|
for ( i = LevelStart; (i <= LevelStop) && (((vVec) = Vec_VecEntry(vGlob, i)), 1); i++ )
|
||
|
|
|
||
|
|
// iteratores through entries
|
||
|
|
#define Vec_VecForEachEntry( vGlob, pEntry, i, k ) \
|
||
|
|
for ( i = 0; i < Vec_VecSize(vGlob); i++ ) \
|
||
|
|
Vec_PtrForEachEntry( Vec_VecEntry(vGlob, i), pEntry, k )
|
||
|
|
#define Vec_VecForEachEntryStart( vGlob, pEntry, i, k, LevelStart ) \
|
||
|
|
for ( i = LevelStart; i < Vec_VecSize(vGlob); i++ ) \
|
||
|
|
Vec_PtrForEachEntry( Vec_VecEntry(vGlob, i), pEntry, k )
|
||
|
|
#define Vec_VecForEachEntryStartStop( vGlob, pEntry, i, k, LevelStart, LevelStop ) \
|
||
|
|
for ( i = LevelStart; i <= LevelStop; i++ ) \
|
||
|
|
Vec_PtrForEachEntry( Vec_VecEntry(vGlob, i), pEntry, k )
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// FUNCTION DEFITIONS ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis [Allocates a vector with the given capacity.]
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline Vec_Vec_t * Vec_VecAlloc( int nCap )
|
||
|
|
{
|
||
|
|
Vec_Vec_t * p;
|
||
|
|
p = ALLOC( Vec_Vec_t, 1 );
|
||
|
|
if ( nCap > 0 && nCap < 8 )
|
||
|
|
nCap = 8;
|
||
|
|
p->nSize = 0;
|
||
|
|
p->nCap = nCap;
|
||
|
|
p->pArray = p->nCap? ALLOC( void *, p->nCap ) : NULL;
|
||
|
|
return p;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis []
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline int Vec_VecSize( Vec_Vec_t * p )
|
||
|
|
{
|
||
|
|
return p->nSize;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis []
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline void * Vec_VecEntry( Vec_Vec_t * p, int i )
|
||
|
|
{
|
||
|
|
assert( i >= 0 && i < p->nSize );
|
||
|
|
return p->pArray[i];
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis [Frees the vector.]
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline void Vec_VecFree( Vec_Vec_t * p )
|
||
|
|
{
|
||
|
|
Vec_Ptr_t * vVec;
|
||
|
|
int i;
|
||
|
|
Vec_VecForEachLevel( p, vVec, i )
|
||
|
|
Vec_PtrFree( vVec );
|
||
|
|
Vec_PtrFree( (Vec_Ptr_t *)p );
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis [Frees the vector of vectors.]
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline int Vec_VecSizeSize( Vec_Vec_t * p )
|
||
|
|
{
|
||
|
|
Vec_Ptr_t * vVec;
|
||
|
|
int i, Counter = 0;
|
||
|
|
Vec_VecForEachLevel( p, vVec, i )
|
||
|
|
Counter += vVec->nSize;
|
||
|
|
return Counter;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis []
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline void Vec_VecClear( Vec_Vec_t * p )
|
||
|
|
{
|
||
|
|
Vec_Ptr_t * vVec;
|
||
|
|
int i;
|
||
|
|
Vec_VecForEachLevel( p, vVec, i )
|
||
|
|
Vec_PtrClear( vVec );
|
||
|
|
}
|
||
|
|
|
||
|
|
/**Function*************************************************************
|
||
|
|
|
||
|
|
Synopsis []
|
||
|
|
|
||
|
|
Description []
|
||
|
|
|
||
|
|
SideEffects []
|
||
|
|
|
||
|
|
SeeAlso []
|
||
|
|
|
||
|
|
***********************************************************************/
|
||
|
|
static inline void Vec_VecPush( Vec_Vec_t * p, int Level, void * Entry )
|
||
|
|
{
|
||
|
|
if ( p->nSize < Level + 1 )
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
Vec_PtrGrow( (Vec_Ptr_t *)p, Level + 1 );
|
||
|
|
for ( i = p->nSize; i < Level + 1; i++ )
|
||
|
|
p->pArray[i] = Vec_PtrAlloc( 0 );
|
||
|
|
p->nSize = Level + 1;
|
||
|
|
}
|
||
|
|
Vec_PtrPush( p->pArray[Level], Entry );
|
||
|
|
}
|
||
|
|
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
/// END OF FILE ///
|
||
|
|
////////////////////////////////////////////////////////////////////////
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|