acd::acd66_impl Class Reference

#include <acd66.hpp>

Public Member Functions
	acd66_impl (uint32_t const num_vars, bool multiple_shared_set=false, bool const verify=false)
bool	run (word *ptt)
	Runs ACD 66.
int	run (word *ptt, unsigned delay_profile)
	Runs ACD 66.
int	compute_decomposition ()
uint32_t	get_num_edges ()
unsigned	get_profile ()
void	get_decomposition (unsigned char *decompArray)

Detailed Description

Definition at line 52 of file acd66.hpp.

Constructor & Destructor Documentation

acd66_impl()

acd::acd66_impl::acd66_impl ( uint32_t const num_vars, bool multiple_shared_set = false, bool const verify = false )

inlineexplicit

Definition at line 60 of file acd66.hpp.

      : num_vars( num_vars ), multiple_ss( multiple_shared_set ), verify( verify )
  {
    std::iota( permutations.begin(), permutations.end(), 0 );
  }

Member Function Documentation

compute_decomposition()

int acd::acd66_impl::compute_decomposition ( )

inline

Definition at line 112 of file acd66.hpp.

  {
    if ( best_multiplicity == UINT32_MAX )
      return -1;
 
    compute_decomposition_impl();
 
    if ( verify && !verify_impl() )
    {
      return 1;
    }
 
    return 0;
  }

get_decomposition()

void acd::acd66_impl::get_decomposition ( unsigned char * decompArray )

inline

Definition at line 165 of file acd66.hpp.

  {
    if ( bs_support_size == UINT32_MAX )
      return;
 
    get_decomposition_abc( decompArray );
  }

get_num_edges()

uint32_t acd::acd66_impl::get_num_edges ( )

inline

Definition at line 127 of file acd66.hpp.

  {
    if ( bs_support_size == UINT32_MAX )
    {
      return num_vars + 1 + num_shared_vars;
    }
 
    /* real value after support minimization */
    return bs_support_size + best_free_set + 1 + num_shared_vars;
  }

get_profile()

unsigned acd::acd66_impl::get_profile ( )

inline

Definition at line 139 of file acd66.hpp.

  {
    unsigned profile = 0;
 
    if ( best_multiplicity == UINT32_MAX )
      return -1;
 
    if ( bs_support_size == UINT32_MAX )
    {
      for ( uint32_t i = 0; i < best_free_set; ++i )
      {
        profile |= 1 << permutations[i];
      }
    }
    else
    {
      for ( uint32_t i = 0; i < bs_support_size; ++i )
      {
        profile |= 1 << permutations[bs_support[i] + best_free_set];
      }
      profile = ~profile & ( ( 1u << num_vars ) - 1 );
    }
 
    return profile;
  }

run() [1/2]

bool acd::acd66_impl::run ( word * ptt )

inline

Runs ACD 66.

Definition at line 67 of file acd66.hpp.

  {
    assert( num_vars > 6 );
 
    /* truth table is too large for the settings */
    if ( num_vars > max_num_vars || num_vars > 11 )
    {
      return false;
    }
 
    /* convert to static TT */
    init_truth_table( ptt );
 
    /* run ACD trying different bound sets and free sets */
    return find_decomposition();
  }

run() [2/2]

int acd::acd66_impl::run ( word * ptt, unsigned delay_profile )

inline

Runs ACD 66.

Definition at line 85 of file acd66.hpp.

  {
    assert( num_vars > 6 );
 
    /* truth table is too large for the settings */
    if ( num_vars > max_num_vars || num_vars > 11 )
    {
      return false;
    }
 
    uint32_t late_arriving = __builtin_popcount( delay_profile );
 
    /* too many late arriving variables */
    if ( late_arriving > 5 )
      return 0;
 
    /* convert to static TT */
    init_truth_table( ptt );
    best_tt = start_tt;
 
    /* permute late arriving variables to be the least significant */
    reposition_late_arriving_variables( delay_profile, late_arriving );
 
    /* run ACD trying different bound sets and free sets */
    return find_decomposition_offset( late_arriving ) ? ( delay_profile == 0 ? 2 : 1 ) : 0;
  }

---

The documentation for this class was generated from the following file:

• src/map/if/acd/acd66.hpp