Home
last modified time | relevance | path

Searched refs:Vec_Que_t (Results 1 – 10 of 10) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/vec/
H A DvecQue.h40 typedef struct Vec_Que_t_ Vec_Que_t; typedef
71 static inline Vec_Que_t * Vec_QueAlloc( int nCap ) in Vec_QueAlloc()
73 Vec_Que_t * p; in Vec_QueAlloc()
74 p = ABC_CALLOC( Vec_Que_t, 1 ); in Vec_QueAlloc()
83 static inline void Vec_QueFree( Vec_Que_t * p ) in Vec_QueFree()
89 static inline void Vec_QueFreeP( Vec_Que_t ** p ) in Vec_QueFreeP()
110 static inline void Vec_QueClear( Vec_Que_t * p ) in Vec_QueClear()
134 static inline int Vec_QueSize( Vec_Que_t * p ) in Vec_QueSize()
139 static inline int Vec_QueTop( Vec_Que_t * p ) in Vec_QueTop()
234 static inline int Vec_QuePop( Vec_Que_t * p ) in Vec_QuePop()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/fxch/
H A DFxch.h105 Vec_Que_t* vDivPrio; /* priority queue for divisors by weight */
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/map/scl/
H A DsclSize.h63 Vec_Que_t * vQue; // outputs by their time
76 Vec_Que_t * vNodeByGain; // nodes by gain
H A DsclBuffer.c47 Vec_Que_t * vQue; // queue by fanout count
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/proof/acec/
H A DacecPolyn.c51 Vec_Que_t * vQue; // queue by largest node
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaFalse.c283 Vec_Que_t * vPrio; in Gia_ManCheckFalse2()
H A DgiaBalAig.c46 Vec_Que_t * vQue; // pairs by their weight
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/pla/
H A DplaFxch.c53 Vec_Que_t * vPrio; // priority queue for divisors by weight
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcFx.c98 Vec_Que_t * vPrio; // priority queue for divisors by weight
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/acb/
H A Dacb.h97 Vec_Que_t * vQue; // temporary