compl.c File Reference

#include "espresso.h"

Include dependency graph for compl.c:

Go to the source code of this file.

Macros
#define	USE_COMPL_LIFT   0
#define	USE_COMPL_LIFT_ONSET   1
#define	USE_COMPL_LIFT_ONSET_COMPLEX   2
#define	NO_LIFTING   3

Functions
pcover	complement (pcube *T)
void	simp_comp (pcube *T, pcover *Tnew, pcover *Tbar)
pcover	simplify (pcube *T)

Macro Definition Documentation

NO_LIFTING

#define NO_LIFTING   3

Definition at line 35 of file compl.c.

USE_COMPL_LIFT

#define USE_COMPL_LIFT   0

Definition at line 32 of file compl.c.

USE_COMPL_LIFT_ONSET

#define USE_COMPL_LIFT_ONSET   1

Definition at line 33 of file compl.c.

USE_COMPL_LIFT_ONSET_COMPLEX

#define USE_COMPL_LIFT_ONSET_COMPLEX   2

Definition at line 34 of file compl.c.

Function Documentation

complement()

pcover complement

(

pcube *

T

)

Definition at line 49 of file compl.c.

{
    register pcube cl, cr;
    register int best;
    pcover Tbar, Tl, Tr;
    int lifting;
    static int compl_level = 0;
 
    if (debug & COMPL)
    debug_print(T, "COMPLEMENT", compl_level++);
 
    if (compl_special_cases(T, &Tbar) == MAYBE) {
 
    /* Allocate space for the partition cubes */
    cl = new_cube();
    cr = new_cube();
    best = binate_split_select(T, cl, cr, COMPL);
 
    /* Complement the left and right halves */
    Tl = complement(scofactor(T, cl, best));
    Tr = complement(scofactor(T, cr, best));
 
    if (Tr->count*Tl->count > (Tr->count+Tl->count)*CUBELISTSIZE(T)) {
        lifting = USE_COMPL_LIFT_ONSET;
    } else {
        lifting = USE_COMPL_LIFT;
    }
    Tbar = compl_merge(T, Tl, Tr, cl, cr, best, lifting);
 
    free_cube(cl);
    free_cube(cr);
    free_cubelist(T);
    }
 
    if (debug & COMPL)
    debug1_print(Tbar, "exit COMPLEMENT", --compl_level);
    return Tbar;
}

Here is the call graph for this function:

Here is the caller graph for this function:

simp_comp()

void simp_comp	(	pcube *	T,
		pcover *	Tnew,
		pcover *	Tbar )

Definition at line 425 of file compl.c.

{
    register pcube cl, cr;
    register int best;
    pcover Tl, Tr, Tlbar, Trbar;
    int lifting;
    static int simplify_level = 0;
 
    if (debug & COMPL)
    debug_print(T, "SIMPCOMP", simplify_level++);
 
    if (simp_comp_special_cases(T, Tnew, Tbar) == MAYBE) {
 
    /* Allocate space for the partition cubes */
    cl = new_cube();
    cr = new_cube();
    best = binate_split_select(T, cl, cr, COMPL);
 
    /* Complement the left and right halves */
    simp_comp(scofactor(T, cl, best), &Tl, &Tlbar);
    simp_comp(scofactor(T, cr, best), &Tr, &Trbar);
 
    lifting = USE_COMPL_LIFT;
    *Tnew = compl_merge(T, Tl, Tr, cl, cr, best, lifting);
 
    lifting = USE_COMPL_LIFT;
    *Tbar = compl_merge(T, Tlbar, Trbar, cl, cr, best, lifting);
 
    /* All of this work for nothing ? Let's hope not ... */
    if ((*Tnew)->count > CUBELISTSIZE(T)) {
        sf_free(*Tnew);
        *Tnew = cubeunlist(T);
    }
 
    free_cube(cl);
    free_cube(cr);
    free_cubelist(T);
    }
 
    if (debug & COMPL) {
    debug1_print(*Tnew, "exit SIMPCOMP (new)", simplify_level);
    debug1_print(*Tbar, "exit SIMPCOMP (compl)", simplify_level);
    simplify_level--;
    }
}

Here is the call graph for this function:

simplify()

pcover simplify

(

pcube *

T

)

Definition at line 566 of file compl.c.

{
    register pcube cl, cr;
    register int best;
    pcover Tbar, Tl, Tr;
    int lifting;
    static int simplify_level = 0;
 
    if (debug & COMPL) {
    debug_print(T, "SIMPLIFY", simplify_level++);
    }
 
    if (simplify_special_cases(T, &Tbar) == MAYBE) {
 
    /* Allocate space for the partition cubes */
    cl = new_cube();
    cr = new_cube();
 
    best = binate_split_select(T, cl, cr, COMPL);
 
    /* Complement the left and right halves */
    Tl = simplify(scofactor(T, cl, best));
    Tr = simplify(scofactor(T, cr, best));
 
    lifting = USE_COMPL_LIFT;
    Tbar = compl_merge(T, Tl, Tr, cl, cr, best, lifting);
 
    /* All of this work for nothing ? Let's hope not ... */
    if (Tbar->count > CUBELISTSIZE(T)) {
        sf_free(Tbar);
        Tbar = cubeunlist(T);
    }
 
    free_cube(cl);
    free_cube(cr);
    free_cubelist(T);
    }
 
    if (debug & COMPL) {
    debug1_print(Tbar, "exit SIMPLIFY", --simplify_level);
    }
    return Tbar;
}

Here is the call graph for this function:

Here is the caller graph for this function: