ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
giaCTas2.c File Reference
#include "gia.h"
Include dependency graph for giaCTas2.c:

Go to the source code of this file.

Classes

struct  Tas_Par_t_
 
struct  Tas_Sto_t_
 
struct  Tas_Que_t_
 
struct  Tas_Var_t_
 
struct  Tas_Cls_t_
 
struct  Tas_Man_t_
 

Macros

#define Tas_ClaForEachVar(p, pClause, pVar, i)
 
#define Tas_QueForEachVar(p, pQue, pVar, i)
 

Typedefs

typedef struct Tas_Var_t_ Tas_Var_t
 

Functions

Tas_Var_tTas_ManCreateVar (Tas_Man_t *p)
 FUNCTION DEFINITIONS ///.
 
Tas_Var_tTas_ManObj2Var (Tas_Man_t *p, Gia_Obj_t *pObj)
 

Macro Definition Documentation

◆ Tas_ClaForEachVar

#define Tas_ClaForEachVar ( p,
pClause,
pVar,
i )
Value:
for ( pVar = Tas_ManVar(p, pClause->pVars[(i=0)]); pClause->pVars[i]; pVar = (Tas_Var_t *)(((char *)pVar + pClause->pVars[++i])) )
Cube * p
Definition exorList.c:222
struct Tas_Var_t_ Tas_Var_t
Definition giaCTas2.c:61

Definition at line 141 of file giaCTas2.c.

141#define Tas_ClaForEachVar( p, pClause, pVar, i ) \
142 for ( pVar = Tas_ManVar(p, pClause->pVars[(i=0)]); pClause->pVars[i]; pVar = (Tas_Var_t *)(((char *)pVar + pClause->pVars[++i])) )

◆ Tas_QueForEachVar

#define Tas_QueForEachVar ( p,
pQue,
pVar,
i )
Value:
for ( pVar = Tas_ManVar(p, pQue->pVars[(i=pQue->iHead)]); i < pQue->iTail; pVar = Tas_ManVar(p, pQue->pVars[i++]) )

Definition at line 144 of file giaCTas2.c.

144#define Tas_QueForEachVar( p, pQue, pVar, i ) \
145 for ( pVar = Tas_ManVar(p, pQue->pVars[(i=pQue->iHead)]); i < pQue->iTail; pVar = Tas_ManVar(p, pQue->pVars[i++]) )

Typedef Documentation

◆ Tas_Var_t

typedef struct Tas_Var_t_ Tas_Var_t

Definition at line 61 of file giaCTas2.c.

Function Documentation

◆ Tas_ManCreateVar()

Tas_Var_t * Tas_ManCreateVar ( Tas_Man_t * p)

FUNCTION DEFINITIONS ///.

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 163 of file giaCTas2.c.

164{
165 Tas_Var_t * pVar;
166 if ( p->pVars->iCur + sizeof(Tas_Var_t) > p->pVars->nSize )
167 {
168 p->pVars->nSize *= 2;
169 p->pVars->pData = ABC_REALLOC( char, p->pVars->pData, p->pVars->nSize );
170 }
171 pVar = p->pVars->pData + p->pVars->iCur;
172 p->pVars->iCur += sizeof(Tas_Var_t);
173 memset( pVar, 0, sizeof(Tas_Var_t) );
174 pVar->Id = pVar - ((Tas_Var_t *)p->pVars->pData);
175 return pVar;
176}
#define ABC_REALLOC(type, obj, num)
Definition abc_global.h:268
char * memset()
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Tas_ManObj2Var()

Tas_Var_t * Tas_ManObj2Var ( Tas_Man_t * p,
Gia_Obj_t * pObj )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 189 of file giaCTas2.c.

190{
191 Tas_Var_t * pVar;
192 assert( !Gia_ObjIsComplement(pObj) );
193 if ( pObj->Value == 0 )
194 {
195 pVar = Tas_ManCreateVar( p );
196 pVar->
197
198 }
199 return Tas_ManVar( p, pObj->Value );
200}
Tas_Var_t * Tas_ManCreateVar(Tas_Man_t *p)
FUNCTION DEFINITIONS ///.
Definition giaCTas2.c:163
unsigned Value
Definition gia.h:89
#define assert(ex)
Definition util_old.h:213
Here is the call graph for this function: