summaryrefslogtreecommitdiffstats
path: root/src/aig/dch/dchInt.h
blob: e35f811128009cdb3a7d409c7fe9d8231432e1de (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/**CFile****************************************************************

  FileName    [dchInt.h]

  SystemName  [ABC: Logic synthesis and verification system.]

  PackageName [Choice computation for tech-mapping.]

  Synopsis    [External declarations.]

  Author      [Alan Mishchenko]
  
  Affiliation [UC Berkeley]

  Date        [Ver. 1.0. Started - June 29, 2008.]

  Revision    [$Id: dchInt.h,v 1.00 2008/07/29 00:00:00 alanmi Exp $]

***********************************************************************/
 
#ifndef __DCH_INT_H__
#define __DCH_INT_H__

#ifdef __cplusplus
extern "C" {
#endif

////////////////////////////////////////////////////////////////////////
///                          INCLUDES                                ///
////////////////////////////////////////////////////////////////////////

#include "aig.h"
#include "satSolver.h"
#include "dch.h"

////////////////////////////////////////////////////////////////////////
///                         PARAMETERS                               ///
////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////
///                         BASIC TYPES                              ///
////////////////////////////////////////////////////////////////////////

// equivalence classes
typedef struct Dch_Cla_t_ Dch_Cla_t;
struct Dch_Cla_t_
{
    int              nNodes;       // the number of nodes in the class
    int              pNodes[0];    // the nodes of the class
};

// choicing manager
typedef struct Dch_Man_t_ Dch_Man_t;
struct Dch_Man_t_
{
    // parameters
    Dch_Pars_t *     pPars;
    // AIGs used in the package
    Vec_Ptr_t *      vAigs;        // user-given AIGs
    Aig_Man_t *      pAigTotal;    // intermediate AIG
    Aig_Man_t *      pAigFraig;    // final AIG
    // equivalence classes
    Dch_Cla_t **     ppClasses;    // classes for representative nodes
    // SAT solving
    sat_solver *     pSat;         // recyclable SAT solver
    Vec_Int_t **     ppSatVars;    // SAT variables for used nodes
    Vec_Ptr_t *      vUsedNodes;   // nodes whose SAT vars are assigned
    // runtime stats
};

////////////////////////////////////////////////////////////////////////
///                      MACRO DEFINITIONS                           ///
////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////
///                    FUNCTION DECLARATIONS                         ///
////////////////////////////////////////////////////////////////////////

/*=== dchAig.c =====================================================*/
extern Aig_Man_t *     Dch_DeriveTotalAig( Vec_Ptr_t * vAigs );
extern Aig_Man_t *     Dch_DeriveChoiceAig( Aig_Man_t * pAig );

/*=== dchMan.c =====================================================*/
extern Dch_Man_t *     Dch_ManCreate( Vec_Ptr_t * vAigs, Dch_Pars_t * pPars );
extern void            Dch_ManStop( Dch_Man_t * p );

/*=== dchSat.c =====================================================*/
 
/*=== dchSim.c =====================================================*/
extern Dch_Cla_t **    Dch_CreateCandEquivClasses( Aig_Man_t * pAig, int nWords, int fVerbose );


#ifdef __cplusplus
}
#endif

#endif

////////////////////////////////////////////////////////////////////////
///                       END OF FILE                                ///
////////////////////////////////////////////////////////////////////////