cvrmisc.c File Reference

#include "espresso.h"

Include dependency graph for cvrmisc.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START void	cover_cost (IN pcover F, INOUT pcost cost)
char *	fmt_cost (IN pcost cost)
char *	print_cost (IN pcover F)
void	copy_cost (pcost s, pcost d)
void	size_stamp (IN pcover T, IN char *name)
void	print_trace (pcover T, char *name, long time)
void	totals (long time, int i, pcover T, pcost cost)
void	fatal (char *s)

Function Documentation

copy_cost()

void copy_cost	(	pcost	s,
		pcost	d )

Definition at line 86 of file cvrmisc.c.

{
    d->cubes = s->cubes;
    d->in = s->in;
    d->out = s->out;
    d->mv = s->mv;
    d->total = s->total;
    d->primes = s->primes;
}

cover_cost()

ABC_NAMESPACE_IMPL_START void cover_cost	(	IN pcover	F,
		INOUT pcost	cost )

Definition at line 17 of file cvrmisc.c.

{
    register pcube p, last;
    pcube *T;
    int var;
 
    /* use the routine used by cofactor to decide splitting variables */
    massive_count(T = cube1list(F));
    free_cubelist(T);
 
    cost->cubes = F->count;
    cost->total = cost->in = cost->out = cost->mv = cost->primes = 0;
 
    /* Count transistors (zeros) for each binary variable (inputs) */
    for(var = 0; var < cube.num_binary_vars; var++)
    cost->in += cdata.var_zeros[var];
 
    /* Count transistors for each mv variable based on sparse/dense */
    for(var = cube.num_binary_vars; var < cube.num_vars - 1; var++)
    if (cube.sparse[var])
        cost->mv += F->count * cube.part_size[var] - cdata.var_zeros[var];
    else
        cost->mv += cdata.var_zeros[var];
 
    /* Count the transistors (ones) for the output variable */
    if (cube.num_binary_vars != cube.num_vars) {
    var = cube.num_vars - 1;
    cost->out = F->count * cube.part_size[var] - cdata.var_zeros[var];
    }
 
    /* Count the number of nonprime cubes */
    foreach_set(F, last, p)
    cost->primes += TESTP(p, PRIME) != 0;
 
    /* Count the total number of literals */
    cost->total = cost->in + cost->out + cost->mv;
}

Here is the call graph for this function:

fatal()

void fatal

(

char *

s

)

Definition at line 140 of file cvrmisc.c.

{
    (void) fprintf(stderr, "espresso: %s\n", s);
    exit(1);
}

Here is the call graph for this function:

fmt_cost()

char * fmt_cost

(

IN pcost

cost

)

Definition at line 59 of file cvrmisc.c.

{
    static char s[200];
 
    if (cube.num_binary_vars == cube.num_vars - 1)
    (void) sprintf(s, "c=%d(%d) in=%d out=%d tot=%d",
        cost->cubes, cost->cubes - cost->primes, cost->in,
        cost->out, cost->total);
    else
    (void) sprintf(s, "c=%d(%d) in=%d mv=%d out=%d",
       cost->cubes, cost->cubes - cost->primes, cost->in,
       cost->mv, cost->out);
    return s;
}

Here is the call graph for this function:

print_cost()

char * print_cost

(

IN pcover

F

)

Definition at line 76 of file cvrmisc.c.

{
    cost_t cost;
    cover_cost(F, &cost);
    return fmt_cost(&cost);
}

Here is the call graph for this function:

print_trace()

void print_trace	(	pcover	T,
		char *	name,
		long	time )

Definition at line 109 of file cvrmisc.c.

{
    (void) printf("# %s\tTime was %s, cost is %s\n",
    name, print_time(time), print_cost(T));
    (void) fflush(stdout);
}

Here is the call graph for this function:

size_stamp()

void size_stamp	(	IN pcover	T,
		IN char *	name )

Definition at line 99 of file cvrmisc.c.

{
    (void) printf("# %s\tCost is %s\n", name, print_cost(T));
    (void) fflush(stdout);
}

Here is the call graph for this function:

totals()

void totals	(	long	time,
		int	i,
		pcover	T,
		pcost	cost )

Definition at line 121 of file cvrmisc.c.

{
    time = ptime() - time;
    total_time[i] += time;
    total_calls[i]++;
    cover_cost(T, cost);
    if (trace) {
    (void) printf("# %s\tTime was %s, cost is %s\n",
        total_name[i], print_time(time), fmt_cost(cost));
    (void) fflush(stdout);
    }
}

Here is the call graph for this function: