sparse_sc.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	sys_matrice_index (Psysteme, Pbase, matrice, int, int)
	Warning! Do not modify this file that is automatically generated! More...
void	matrice_index_sys (Psysteme, Pbase, matrice, int, int)
	void matrice_index_sys(Psysteme sc, Pbase base_index, matrice AG, int n, int m) replace the coefficients of the index variables in sc by their new coefficients in the matrix AG[m,n]. More...
void	sc_to_matrices (Psysteme, Pbase, matrice, matrice, int, int)
	Creation de la matrice A correspondant au systeme lineaire et de la matrice correspondant a la partie constante B Le systeme est suppose ne pas contenir de constantes symboliques. More...
void	matrices_to_sc (Psysteme, Pbase, matrice, matrice, int, int)
void	loop_sc_to_matrices (Psysteme, Pbase, Pbase, matrice, matrice, int, int, int)
	Creation de la matrice A correspondant au systeme lineaire et de la matrice correspondant a la partie constante B Le systeme peut contenir des constantes symboliques. More...
void	matrices_to_loop_sc (Psysteme, Pbase, Pbase, matrice, matrice, int, int, int)
void	constraints_to_matrices (Pcontrainte, Pbase, Pmatrix, Pmatrix)
	======================================================================= More...
void	matrices_to_constraints (Pcontrainte *, Pbase, Pmatrix, Pmatrix)
	======================================================================= More...
void	constraints_with_sym_cst_to_matrices (Pcontrainte, Pbase, Pbase, Pmatrix, Pmatrix)
	======================================================================= More...
void	matrices_to_constraints_with_sym_cst (Pcontrainte *, Pbase, Pbase, Pmatrix, Pmatrix)
	======================================================================= More...

Function Documentation

constraints_to_matrices()

void constraints_to_matrices	(	Pcontrainte	pc,
		Pbase	b,
		Pmatrix	A,
		Pmatrix	B
	)

=======================================================================

Parameters

pc

c

Definition at line 461 of file sys_matrice_conv.c.

{
    int i,j;
    Pvecteur pv;
    Pcontrainte eq;
    int n=0;
 
    for (eq = pc; !CONTRAINTE_UNDEFINED_P(eq); eq=eq->succ,n++);
  
    matrix_nulle(B);
    matrix_nulle(A);
 
    for(eq = pc,i=1; !CONTRAINTE_UNDEFINED_P(eq); eq=eq->succ,i++) {
        for(pv = b, j=1; pv != NULL; pv = pv->succ, j++){
            MATRIX_ELEM(A,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        MATRIX_ELEM(B,i,1) = vect_coeff(0,eq->vecteur);
    }
}

References B, CONTRAINTE_UNDEFINED_P, eq, MATRIX_ELEM, matrix_nulle(), Scontrainte::succ, Svecteur::succ, vect_coeff(), Scontrainte::vecteur, and vecteur_var.

Referenced by extract_lattice(), region_sc_minimal(), and transformer_to_1D_lattice().

Here is the call graph for this function:

Here is the caller graph for this function:

constraints_with_sym_cst_to_matrices()

void constraints_with_sym_cst_to_matrices	(	Pcontrainte	pc,
		Pbase	index_base,
		Pbase	const_base,
		Pmatrix	A,
		Pmatrix	B
	)

=======================================================================

void constraints_with_sym_cst_to_matrices(Pcontrainte pc, Pbase index_base const_base, matrice A B, int n m1 m2):

constructs the matrices "A" and "B" corresponding to the linear constraints "pc", so: A.ib + B1.cb + B2 = 0 <=> pc(ib, cb) = 0:

 B = ( B1 | B2 ), B2 of dimension (n,1).

The basis "ib" gives the variables of the linear system. The basis "cb" gives the symbolic constants of the linear system.

The matrices "A" and "B" are supposed to have been already allocated in memory, respectively of dimension (n, m1) and (n, m2).

"n" must be the exact number of constraints in "pc". "m1" must be the exact number of variables in "ib". "m2" must be equal to the number of symbolic constants (in "cb") PLUS ONE (the actual constant).

Parameters

pc	c
index_base	ndex_base
const_base	onst_base

Definition at line 572 of file sys_matrice_conv.c.

{
    int i,j;
    Pcontrainte eq;
    Pvecteur pv;
    int n = 0;
    int m2 = vect_size(const_base);
    for (eq = pc; !CONTRAINTE_UNDEFINED_P(eq); eq=eq->succ,n++);
    matrix_nulle(B);
    matrix_nulle(A);
 
    for (eq = pc,i=1; !CONTRAINTE_UNDEFINED_P(eq); eq=eq->succ,i++) {
        for(pv = index_base, j=1; pv != NULL; pv = pv->succ, j++){
            MATRIX_ELEM(A,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        for(pv = const_base, j=1; pv != NULL; pv = pv->succ, j++){
            MATRIX_ELEM(B,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        MATRIX_ELEM(B,i,m2) = vect_coeff(TCST,eq->vecteur);
    }
}

References B, CONTRAINTE_UNDEFINED_P, eq, MATRIX_ELEM, matrix_nulle(), Scontrainte::succ, Svecteur::succ, TCST, vect_coeff(), vect_size(), Scontrainte::vecteur, and vecteur_var.

Referenced by make_reindex().

Here is the call graph for this function:

Here is the caller graph for this function:

loop_sc_to_matrices()

void loop_sc_to_matrices	(	Psysteme	ps,
		Pbase	index_base,
		Pbase	const_base,
		matrice	A,
		matrice	B,
		int	n,
		int	m1,
		int	m2
	)

Creation de la matrice A correspondant au systeme lineaire et de la matrice correspondant a la partie constante B Le systeme peut contenir des constantes symboliques.

Dans ce cas, la base index_base ne doit contenir que les variables etant des indices de boucles et la base const_base les constantes symboliques. La matrice B represente toutes les contraintes sur les constantes.

Les parametres de la fonction :

Psysteme ps : systeme lineaire !int A[] : matrice !int B[] : matrice int n : nombre de lignes de la matrice int m : nombre de colonnes de la matrice

Parameters

ps	s
index_base	ndex_base
const_base	onst_base
m1	1
m2	2

Definition at line 278 of file sys_matrice_conv.c.

{
 
    int i,j;
    Pcontrainte eq;
    Pvecteur pv;
 
    matrice_nulle(B,n,m2);
    matrice_nulle(A,n,m1);
 
    for (eq = ps->inegalites,i=1;
         !CONTRAINTE_UNDEFINED_P(eq); 
         eq=eq->succ,i++) {     
        for(pv = index_base, j=1; pv != NULL; pv = pv->succ, j++){
            ACCESS(A,n,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        for(pv = const_base, j=1; pv != NULL; pv = pv->succ, j++){
            ACCESS(B,n,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        ACCESS(B,n,i,m2) = vect_coeff(TCST,eq->vecteur);
    }
 
}

References ACCESS, B, CONTRAINTE_UNDEFINED_P, eq, matrice_nulle(), Scontrainte::succ, Svecteur::succ, TCST, vect_coeff(), Scontrainte::vecteur, and vecteur_var.

Referenced by sc_image_computation().

Here is the call graph for this function:

Here is the caller graph for this function:

matrice_index_sys()

void matrice_index_sys	(	Psysteme	sc,
		Pbase	base_index,
		matrice	AG,
		int	n,
		int	m
	)

void matrice_index_sys(Psysteme sc, Pbase base_index, matrice AG, int n, int m) replace the coefficients of the index variables in sc by their new coefficients in the matrix AG[m,n].

Modif: taken into account the order of system of constraints.

vect_chg_coeff(&pc->vecteur, pb->var, ACCESS(AG,m,m-i+1,j));

Obsolete code: this old code was implemented assumming the order of system of constraints had changed because of _dup version. Thanks to _copy version, it's now straight. However, there'll be an incompatiblity if exist some calls of this function (which is already obsolete since it uses matrice instead of matrix) outside hyperplane.c. changed by DN.

Parameters

sc	c
base_index	ase_index
AG	G

Definition at line 80 of file sys_matrice_conv.c.

{
    Pcontrainte pc;
    Pbase pb;
    Pvecteur pv;
    int i,j;
    Value deno;
 
    deno = DENOMINATOR(AG);
    for (pc = sc->inegalites, i=1; i<=m; pc = pc->succ, i++)
        for (pb = base_index, j=1; j<=n; pb = pb->succ, j++)
 
          /*        vect_chg_coeff(&pc->vecteur, pb->var, ACCESS(AG,m,m-i+1,j));*/
          /* Obsolete code: 
                * this old code was implemented assumming the order of system of constraints
                * had changed because of _dup version. Thanks to _copy version, it's now straight.
           * However, there'll be an incompatiblity if exist some calls of this function 
                * (which is already obsolete since it uses matrice instead of matrix) outside hyperplane.c. 
                * changed by DN.
                */
          vect_chg_coeff(&pc->vecteur, pb->var, ACCESS(AG,m,i,j));
 
    if (value_gt(deno,VALUE_ONE))
        for (pc = sc->inegalites, i=1; i<=m; pc = pc->succ, i++)
            for (pv = pc->vecteur; pv != NULL; pv = pv->succ)
                if (base_find_variable(base_index,pv->var)==VARIABLE_UNDEFINED)
                    value_product(pv->val,deno);                    
}

References ACCESS, base_find_variable(), DENOMINATOR, Svecteur::succ, Svecteur::val, value_gt, VALUE_ONE, value_product, Svecteur::var, VARIABLE_UNDEFINED, vect_chg_coeff(), and Scontrainte::vecteur.

Referenced by hyperplane(), and unimodular().

Here is the call graph for this function:

Here is the caller graph for this function:

matrices_to_constraints()

void matrices_to_constraints	(	Pcontrainte *	pc,
		Pbase	b,
		Pmatrix	A,
		Pmatrix	B
	)

=======================================================================

build the constant terme if it is not null

build a new vecteur if there is a null constant term

the constraints are in reverse order

Parameters

pc

c

Definition at line 501 of file sys_matrice_conv.c.

{
    Pcontrainte newpc = NULL;
    int i, j;
    Value cst, coeff, dena, denb;
    int n = MATRIX_NB_LINES(A);
    int m = MATRIX_NB_COLUMNS(A);
 
    dena = MATRIX_DENOMINATOR(A);
    denb = MATRIX_DENOMINATOR(B);
 
    for (i=n;i>=1; i--) {
        Pvecteur vect, pv;
        Pcontrainte cp;
        bool found = false;
 
        cp = contrainte_new();
 
        /* build the constant terme if it is not null */
        cst = MATRIX_ELEM(B,i,1);
        if (value_notzero_p(cst)) {
            pv = vect_new(TCST,  value_mult(dena,cst));
            found = true;
        }
 
        for (vect = b,j=1;j<=m;vect=vect->succ,j++) {
            coeff = MATRIX_ELEM(A,i,j);
            if (value_notzero_p(coeff)) {
                if (found)
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {
                    /* build a new vecteur if there is a null constant term */
                    pv = vect_new(vecteur_var(vect), 
                                   value_mult(denb,coeff));
                    found = true;
                }
            }
        }
        /* the constraints are in reverse order */
        cp->vecteur = pv;
        cp->succ =  newpc;
        newpc = cp;
    }
    *pc = newpc;
}

References B, contrainte_new(), cp, MATRIX_DENOMINATOR, MATRIX_ELEM, MATRIX_NB_COLUMNS, MATRIX_NB_LINES, Svecteur::succ, TCST, value_mult, value_notzero_p, vect_chg_coeff(), vect_new(), and vecteur_var.

Referenced by extract_lattice(), and region_sc_minimal().

Here is the call graph for this function:

Here is the caller graph for this function:

matrices_to_constraints_with_sym_cst()

void matrices_to_constraints_with_sym_cst	(	Pcontrainte *	pc,
		Pbase	index_base,
		Pbase	const_base,
		Pmatrix	A,
		Pmatrix	B
	)

=======================================================================

build the constant terme if it exists

build a new vecteur if there is not constant term

build a new vecteur if there is not constant term

Parameters

pc	c
index_base	ndex_base
const_base	onst_base

Definition at line 621 of file sys_matrice_conv.c.

{
    Pvecteur vect,pv=NULL;
    Pcontrainte cp,newpc= NULL;
    int i,j;
    Value cst,coeff,dena,denb;
    bool found ;
    int n = MATRIX_NB_LINES(A);
    int m1 = MATRIX_NB_COLUMNS(A);
    int m2 = MATRIX_NB_COLUMNS(B);
    dena = MATRIX_DENOMINATOR(A);
    denb = MATRIX_DENOMINATOR(B);
 
    for (i=n;i>=1; i--) {
        found = false;
        cp = contrainte_new();
 
        /* build the constant terme if it exists */
        cst = MATRIX_ELEM(B,i,m2);
        if (value_notzero_p(cst)) {
            pv = vect_new(TCST,  value_mult(dena,cst));
            found = true;
        }
 
        vect = base_union(index_base, const_base);
        for (j=1;j<=m1;vect=vect->succ,j++) {
            coeff = MATRIX_ELEM(A,i,j);
            if (value_notzero_p(coeff)) {
                if (found)
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {
                    /* build a new vecteur if there is not constant term */
                    pv = vect_new(vecteur_var(vect), 
                                  value_mult(denb,coeff));
                    found = true;
                }
            }
        }
 
        for (j=1;j<=m2-1;vect=vect->succ,j++) {
            coeff = MATRIX_ELEM(B,i,j);
            if (value_notzero_p(coeff)) {
                if (found)
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {
                    /* build a new vecteur if there is not constant term */
                    pv = vect_new(vecteur_var(vect),
                                  value_mult(denb,coeff));
                    found = true;
                }
            }
        }
        cp->vecteur = pv;
        cp->succ = newpc;
        newpc = cp;
    }
    *pc = newpc;
}

References B, base_union(), contrainte_new(), cp, MATRIX_DENOMINATOR, MATRIX_ELEM, MATRIX_NB_COLUMNS, MATRIX_NB_LINES, Svecteur::succ, TCST, value_mult, value_notzero_p, vect_chg_coeff(), vect_new(), and vecteur_var.

Here is the call graph for this function:

matrices_to_loop_sc()

void matrices_to_loop_sc	(	Psysteme	ps,
		Pbase	index_base,
		Pbase	const_base,
		matrice	A,
		matrice	B,
		int	n,
		int	m1,
		int	m2
	)

create the variables

ajout des variables supplementaires utiles

build the constant terme if it exists

build a new vecteur if there is not constant term

build a new vecteur if there is not constant term

Parameters

ps	s
index_base	ndex_base
const_base	onst_base
m1	1
m2	2

Definition at line 338 of file sys_matrice_conv.c.

{
    Pvecteur vect,pv=NULL;
    Pcontrainte cp,pc= NULL;
    Pbase b;
    int i,j;
    Value cst,coeff,dena,denb;
    bool trouve ;
 
    /* create the  variables */
 
    if (index_base != BASE_NULLE)
    ps->base = base_reversal(vect_dup(index_base));
    else ps->base = VECTEUR_UNDEFINED;
 
    ps->dimension = vect_size(ps->base);
   
    /* ajout des variables supplementaires utiles */
 
    if (VECTEUR_NUL_P(ps->base)) {
        Variable var = creat_new_var(ps);
        ps->base = vect_new(var,VALUE_ONE);
        ps->dimension++;
    }
 
    for (b = ps->base,i =2; i<= m1; i++,b=b->succ)  
        if (VECTEUR_NUL_P(b->succ)) {
            Variable var = creat_new_var(ps);
            b->succ = vect_new(var,VALUE_ONE);
            ps->dimension++;
        }
 
    ps->base = vect_add(vect_dup(const_base),vect_dup(ps->base));
 
    ps->dimension += vect_size(const_base);
 
    for (b = ps->base,i =2; i<= m1+m2-1; i++,b=b->succ)  
        if (VECTEUR_NUL_P(b->succ)) {
            Variable var = creat_new_var(ps);
            b->succ = vect_new(var,VALUE_ONE);
            ps->dimension++;
        }
 
    dena = DENOMINATOR(A);
    denb = DENOMINATOR(B);
 
    for (i=1;i<=n; i++)
    {   trouve = false;
        cp = contrainte_new();
 
        /* build the constant terme if it exists */
        cst = ACCESS(B,n,i,m2);
 
        if (value_notzero_p(cst)) {
            pv = vect_new(TCST,  value_mult(dena,cst));
            trouve = true;
        }
 
 
        for (vect = ps->base,j=1;j<=m1;vect=vect->succ,j++) {
            coeff = ACCESS(A,n,i,j);
            if (value_notzero_p(coeff)) {
                if (trouve) 
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {                  
                    /* build a new vecteur if there is not constant term */
                    pv = vect_new(vecteur_var(vect), value_mult(denb,coeff));
                    trouve = true;
                }
            }
        }
 
        for (j=1;j<=m2-1;vect=vect->succ,j++) {
            coeff = ACCESS(B,n,i,j);
            if (value_notzero_p(coeff)) {
                if (trouve) 
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {                  
                    /* build a new vecteur if there is not constant term */
                    pv = vect_new(vecteur_var(vect), value_mult(denb,coeff));
                    trouve = true;
                }
            }
        }
        cp->vecteur = pv;
        cp->succ = pc;
        pc = cp;
    }
 
    ps->inegalites = pc;
    ps->nb_ineq = n;
    ps->egalites = NULL;
    ps->nb_eq = 0;
 
 
}

References ACCESS, B, BASE_NULLE, base_reversal(), contrainte_new(), cp, creat_new_var(), DENOMINATOR, Svecteur::succ, TCST, value_mult, value_notzero_p, VALUE_ONE, vect_add(), vect_chg_coeff(), vect_dup(), vect_new(), vect_size(), VECTEUR_NUL_P, VECTEUR_UNDEFINED, and vecteur_var.

Referenced by sc_image_computation().

Here is the call graph for this function:

Here is the caller graph for this function:

matrices_to_sc()

void matrices_to_sc	(	Psysteme	ps,
		Pbase	base_index,
		matrice	A,
		matrice	B,
		int	n,
		int	m
	)

create the variables

ajout des variables supplementaires utiles

build the constant terme if it exists

build a new vecteur if there is not constant term

Parameters

ps	s
base_index	ase_index

Definition at line 185 of file sys_matrice_conv.c.

{
    Pvecteur vect,pv=NULL;
    Pcontrainte cp,pc= NULL;
    Pbase b;
    int i,j;
    Value cst,coeff,dena,denb;
    bool trouve ;
 
    /* create the  variables */
 
    ps->base = base_reversal(vect_dup(base_index));
 
    for (b = ps->base;!VECTEUR_UNDEFINED_P(b);b=b->succ,ps->dimension ++) ;
   
    /* ajout des variables supplementaires utiles */
 
    if (VECTEUR_NUL_P(ps->base)) {
        Variable var = creat_new_var(ps);
        ps->base = vect_new(var,VALUE_ONE);
    }
 
    for (b = ps->base,i =2; i<= m; i++,b=b->succ)  
        if (VECTEUR_NUL_P(b->succ)) {
            Variable var = creat_new_var(ps);
            b->succ = vect_new(var,VALUE_ONE);
        }
 
   
    dena = DENOMINATOR(A);
    denb = DENOMINATOR(B);
 
    for (i=1;i<=n; i++)
    {   trouve = false;
        cp = contrainte_new();
 
        /* build the constant terme if it exists */
        cst = ACCESS(B,n,i,1);
        if (value_notzero_p(cst)) {
            pv = vect_new(TCST, value_mult(dena,cst));
            trouve = true;
        }
 
        for (vect = ps->base,j=1;j<=m;vect=vect->succ,j++) {
            coeff = ACCESS(A,n,i,j);
            if (value_notzero_p(coeff)) {
                if (trouve) 
                    vect_chg_coeff(&pv, vecteur_var(vect),
                                   value_mult(denb,coeff));
                else {  /* build a new vecteur if there is not constant term */
                    pv = vect_new(vecteur_var(vect), 
                                  value_mult(denb,coeff));
                    trouve = true;
                }
            }
        }
        cp->vecteur = pv;
        cp->succ = pc;
        pc = cp;
    }
 
    ps->inegalites = pc;
    ps->nb_ineq = n;
    ps->egalites = NULL;
    ps->nb_eq = 0;
 
 
}

References ACCESS, B, base_reversal(), contrainte_new(), cp, creat_new_var(), DENOMINATOR, Svecteur::succ, TCST, value_mult, value_notzero_p, VALUE_ONE, vect_chg_coeff(), vect_dup(), vect_new(), VECTEUR_NUL_P, VECTEUR_UNDEFINED_P, and vecteur_var.

Here is the call graph for this function:

sc_to_matrices()

void sc_to_matrices	(	Psysteme	ps,
		Pbase	base_index,
		matrice	A,
		matrice	B,
		int	n,
		int	m
	)

Creation de la matrice A correspondant au systeme lineaire et de la matrice correspondant a la partie constante B Le systeme est suppose ne pas contenir de constantes symboliques.

Les parametres de la fonction :

Psysteme ps : systeme lineaire !int A[] : matrice !int B[] : matrice int n : nombre de lignes de la matrice int m : nombre de colonnes de la matrice

Parameters

ps	s
base_index	ase_index

Definition at line 134 of file sys_matrice_conv.c.

{
    int i,j;
    Pcontrainte eq;
    Pvecteur pv;
    matrice_nulle(B,n,1);
    matrice_nulle(A,n,m);
 
    for (eq = ps->inegalites,i=1;
         !CONTRAINTE_UNDEFINED_P(eq); 
         eq=eq->succ,i++) {     
        for(pv = base_index, j=1; pv != NULL; pv = pv->succ, j++){
            ACCESS(A,n,i,j) = vect_coeff(vecteur_var(pv),eq->vecteur);
        }
        ACCESS(B,n,i,1) = vect_coeff(0,eq->vecteur);
    }
}

References ACCESS, B, CONTRAINTE_UNDEFINED_P, eq, matrice_nulle(), Scontrainte::succ, Svecteur::succ, vect_coeff(), Scontrainte::vecteur, and vecteur_var.

Referenced by make_primal().

Here is the call graph for this function:

Here is the caller graph for this function:

sys_matrice_index()

void sys_matrice_index	(	Psysteme	sc,
		Pbase	base_index,
		matrice	A,
		int	n,
		int	m
	)

Warning! Do not modify this file that is automatically generated!

Modify src/Libs/sparse_sc/sparse_sc-local.h instead, to add your own modifications. header file built by cproto sparse_sc-local.h cproto-generated files sys_matrice_conv.c

Warning! Do not modify this file that is automatically generated!

Corinne Ancourt void sys_matrice_index(Psysteme sc, Pbase base_index, matrice A, int n, int m) create the matrix A [m,n] made with the coefficients of the index variables

Parameters

sc	c
base_index	ase_index

Definition at line 53 of file sys_matrice_conv.c.

{
    Pcontrainte pc;
    Pvecteur pv;
    int i, j;
   
    matrice_nulle(A, m, n);
    for (pc = sc->inegalites, i=1; pc != NULL; pc = pc->succ, i++)
        for(pv = base_index, j=1; pv != NULL; pv = pv->succ, j++)
            ACCESS(A,m,i,j) = vect_coeff(pv->var, pc->vecteur);
}

References ACCESS, matrice_nulle(), Scontrainte::succ, Svecteur::succ, Svecteur::var, vect_coeff(), and Scontrainte::vecteur.

Referenced by hyperplane(), and unimodular().

Here is the call graph for this function:

Here is the caller graph for this function: