sc_list.c File Reference

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <time.h>
#include <sys/time.h>
#include "boolean.h"
#include "arithmetique.h"
#include "vecteur.h"
#include "contrainte.h"
#include "sc.h"
#include "sommet.h"
#include "polyedre.h"
#include "union.h"

Include dependency graph for sc_list.c:

Go to the source code of this file.

Functions
Psysteme	sc_full ()
	Psysteme sc_full() similar to sc_new.
boolean	sc_full_p (Psysteme in_ps)
	Psysteme sc_full_p( in_ps ) similar to sc_new.
Psysteme	sc_dup1 (Psysteme in_ps)
	Psysteme sc_dup1( in_ps ) AL 30/05/94 1 depth copy of in_ps: no duplication of vectors (except for the base).
Psysteme	sc_free (Psysteme in_ps)
	Psysteme sc_free( in_ps ) AL 30/05/94 Free of in_ps.
Psysteme	sc_free1 (Psysteme in_ps)
	Psysteme sc_free1( in_ps ) AL 30/05/94 Only pcontrainte of in_ps are freed.
Psysteme	sc_concatenate (Psysteme in_s1, Psysteme in_s2)
	Psysteme sc_concatenate( in_s1, in_s2 ) AL 30/05/94 Append in_s2 to the end of in_s1 and returns in_s1.
boolean	sl_length (Psyslist in_sl)
	int sl_length( (Psyslist) in_sl ) AL 26/04/95 Returns length of in_sl.
int	sl_max_constraints_nb (Psyslist in_sl)
	int sl_max_constraints_nb( (Psyslist) in_sl ) Give the maximum constraints nb among systems of in_sl.
boolean	sl_is_system_p (Psyslist in_sl)
	boolean sl_is_system_p( (Psyslist) in_sl ) AL 16/11/93 Returns True if syslist in_sl has only one Psysteme in it.
Psyslist	sl_append_system (Psyslist in_sl, Psysteme in_ps)
	Psyslist sl_append_system( (Psyslist) in_sl, (Psysteme) in_ps ) Input : A disjunct in_sl to wich in_ps will be added.
Psyslist	sl_append_system_first (Psyslist in_sl, Psysteme in_ps)
	Psyslist sl_append_system_first( in_sl, in_ps ) AL 23/03/95 A new Psyslist with in_ps at the end of in_sl (sharing).
Psyslist	sl_new ()
	Psyslist sl_new() AL 26/10/93 Input : Nothing.
Psyslist	sl_dup (Psyslist in_sl)
	Psyslist sl_dup( (Psyslist) in_sl ) AL 15/11/93 w - 1 duplication : everything is duplicated, except entities.
Psyslist	sl_dup1 (Psyslist in_sl)
	Psyslist sl_dup1( (Psyslist) in_sl ) AL 15/11/93 Duplicates input syslist.
Psyslist	sl_free (Psyslist psl)
	Psyslist sl_free(Psyslist psl) BA, AL 30/05/94 w - 1 depth free.
Psyslist	sl_free1 (Psyslist psl)
	Psyslist sl_free1(Psyslist psl) AL 30/05/94 1 depth free.
void	sl_set_variable_name (char *(*in_fu)())
	char* sl_set_variable_name( in_fu ) give the function to read variables
char *	sl_get_tab_string (int in_tab)
	char* sl_get_tab_string( in_tab ) returns a string of in_tab
void	sl_fprint_tab (FILE *in_fi, Psyslist in_sl, char *(*in_fu)(), int in_tab)
void	sl_fprint (in_fi, in_sl, char *(*in_fu)())
Psyslist	sl_read (char *nomfic)
	fichier lu par sl_lex.l
void	un_fprint_tab (FILE *in_fi, char *in_un, char *(*in_fu)(), int in_ty, int in_tab)
	void un_fprint_tab(FILE*, Pdisjunct, function, type, tab) prints a union
Variables
char *(*	union_variable_name )(Variable) = variable_default_name
	Package : C3/union Author : Arnauld LESERVOT (leservot(a)limeil.cea.fr) Date : Modified : 04 04 95 Documents: UNION.tex : ``Extension de C3 aux unions de polyedres'' Comments :.
Psyslist	sl_yacc
FILE *	slx_in
	Psysteme construit par sl_gram.y.

---

Function Documentation

Psysteme sc_concatenate	(	Psysteme	in_s1,
		Psysteme	in_s2
	)

Psysteme sc_concatenate( in_s1, in_s2 ) AL 30/05/94 Append in_s2 to the end of in_s1 and returns in_s1.

Freeable with sc_free1(). Sharing.

Memory management and returns

Parameters:

	in_s1	n_s1
	in_s2	n_s2

Definition at line 154 of file sc_list.c.

References eq, free(), NULL, s1, sc_creer_base(), sc_dup1(), sc_free1(), SC_UNDEFINED_P, and vect_rm().

{
  Pcontrainte  eq;
  Psysteme  s1, s2;

  s1 = sc_dup1( in_s1 );      s2 = sc_dup1( in_s2 );
  if (SC_UNDEFINED_P(in_s1))  {s1 = sc_free1(s1); return(s2);}
  if (SC_UNDEFINED_P(in_s2))  {s2 = sc_free1(s2); return(s1);}

  if (s1->nb_eq != 0) {
    for (eq = s1->egalites; eq->succ != (Pcontrainte)NULL; eq = eq->succ) ;
    eq->succ = s2->egalites; s1->nb_eq += s2->nb_eq;
  } 
  else { s1->egalites = s2->egalites; s1->nb_eq = s2->nb_eq; }
  
  if (s1->nb_ineq != 0) {
    for (eq = s1->inegalites;eq->succ != (Pcontrainte)NULL;eq = eq->succ) ;
    eq->succ = s2->inegalites;  s1->nb_ineq += s2->nb_ineq;
  } 
  else { s1->inegalites = s2->inegalites; s1->nb_ineq = s2->nb_ineq; }
  
  /* Memory management and returns */
  vect_rm( s1->base ); vect_rm( s2->base ); free( s2 ); s2 = NULL;
  s1->base = NULL; sc_creer_base( s1 );
  return(s1);
}

Here is the call graph for this function:

Psysteme sc_dup1

(

Psysteme

in_ps

)

Psysteme sc_dup1( in_ps ) AL 30/05/94 1 depth copy of in_ps: no duplication of vectors (except for the base).

Sharing !

Parameters:

in_ps

n_ps

Definition at line 69 of file sc_list.c.

References assert, contrainte_new(), cp, eq, NULL, sc_add_egalite(), sc_add_inegalite(), sc_new(), SC_UNDEFINED, SC_UNDEFINED_P, vect_dup(), vect_size(), VECTEUR_UNDEFINED, and VECTEUR_UNDEFINED_P.

Referenced by sc_concatenate().

{
  Psysteme cp = SC_UNDEFINED;
  Pcontrainte eq, eq_cp;
  
  if (!SC_UNDEFINED_P(in_ps)) {
    cp = sc_new();
    
    for (eq = in_ps->egalites; eq != NULL; eq = eq->succ) {
      eq_cp = contrainte_new();
      contrainte_vecteur(eq_cp) = contrainte_vecteur(eq);
      sc_add_egalite(cp, eq_cp);
    }
    
    for(eq=in_ps->inegalites;eq!=NULL;eq=eq->succ) {
      eq_cp = contrainte_new();
      contrainte_vecteur(eq_cp) = contrainte_vecteur(eq);
      sc_add_inegalite(cp, eq_cp);
    }

    if(in_ps->dimension==0) {
      assert(VECTEUR_UNDEFINED_P(in_ps->base));
      cp->dimension = 0;
      cp->base = VECTEUR_UNDEFINED;
    }
    else {
      assert(in_ps->dimension==vect_size(in_ps->base));
      cp->dimension = in_ps->dimension;
      cp->base = vect_dup(in_ps->base);    
    }
  }
  return(cp);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psysteme sc_free

(

Psysteme

in_ps

)

Psysteme sc_free( in_ps ) AL 30/05/94 Free of in_ps.

Returns NULL to be used as in_ps = sc_free( in_ps );

Parameters:

in_ps

n_ps

Definition at line 109 of file sc_list.c.

References NULL, and sc_rm().

Referenced by c_convex_effects_on_actual_parameter_forward_translation(), dj_intersection_ofl_ctrl(), pa_free(), pa_intersect_system(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), sc_elim_redund_with_first_ofl_ctrl(), sc_minmax_of_pvector(), sc_supress_parallel_redund_constraints(), sl_free(), xml_Application(), xml_Boxes(), xml_Call(), xml_Loop(), and xml_Pattern_Paving().

{  sc_rm( in_ps ); return( (Psysteme) NULL ); }

Here is the call graph for this function:

Here is the caller graph for this function:

Psysteme sc_free1

(

Psysteme

in_ps

)

Psysteme sc_free1( in_ps ) AL 30/05/94 Only pcontrainte of in_ps are freed.

Parameters:

in_ps

n_ps

Definition at line 118 of file sc_list.c.

References free(), NULL, and vect_rm().

Referenced by sc_concatenate().

{
  Pcontrainte pc, pc2;

  if (in_ps != NULL) {
    for(pc = in_ps->inegalites; pc != NULL; ) {
      pc2 = pc;
      pc = pc->succ;
      free(pc2);
      pc2 = NULL;
    }
    for(pc = in_ps->egalites; pc != NULL; ) {
      pc2 = pc;
      pc = pc->succ;
      free(pc2);
      pc2 = NULL;
    }
    in_ps->nb_eq = 0;
    in_ps->nb_ineq = 0;
    in_ps->dimension = 0;
    vect_rm( in_ps->base );
    in_ps->base = NULL;
    
    free((char *) in_ps);
    in_ps = (Psysteme) NULL;
  }
  return( (Psysteme) NULL );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psysteme sc_full

(

void

)

Psysteme sc_full() similar to sc_new.

Definition at line 55 of file sc_list.c.

References sc_new().

Referenced by pa_intersect_complement(), and sc_elim_redund_with_first_ofl_ctrl().

{ return sc_new(); }

Here is the call graph for this function:

Here is the caller graph for this function:

boolean sc_full_p

(

Psysteme

in_ps

)

Psysteme sc_full_p( in_ps ) similar to sc_new.

Parameters:

in_ps

n_ps

Definition at line 58 of file sc_list.c.

References NULL.

Referenced by dj_simple_inegs_to_eg(), pa_path_to_disjunct_rule4_ofl_ctrl(), sc_elim_redund_with_first_ofl_ctrl(), and sl_fprint_tab().

{ return( (in_ps->nb_eq == 0) && (in_ps->nb_ineq == 0) && 
          (in_ps->egalites == NULL) && (in_ps->inegalites == NULL) ); }

Here is the caller graph for this function:

Psyslist sl_append_system	(	Psyslist	in_sl,
		Psysteme	in_ps
	)

Psyslist sl_append_system( (Psyslist) in_sl, (Psysteme) in_ps ) Input : A disjunct in_sl to wich in_ps will be added.

Output : Disjunct in_sl with in_ps. => ! Sharing. Comment: Nothing is checked on result in_sl. AL 10/11/93

Parameters:

	in_sl	n_sl
	in_ps	n_ps

Definition at line 237 of file sc_list.c.

References NULL, Ssyslist::psys, sl_new(), and Ssyslist::succ.

Referenced by dj_append_system(), dj_empty(), dj_intersect_system_ofl_ctrl(), dj_intersection_ofl_ctrl(), dj_simple_inegs_to_eg(), dj_system_complement(), pa_convex_hull_equals_union_p_ofl_ctrl(), pa_inclusion_p_ofl_ctrl(), pa_intersect_complement(), pa_path_to_disjunct_ofl_ctrl(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), pa_supress_same_constraints(), pa_system_difference_ofl_ctrl(), sl_append_system_first(), sl_dup(), and sl_dup1().

{
  Psyslist ret_sl;
  
  if (in_ps == NULL) return( in_sl );
  ret_sl = sl_new(); ret_sl->psys = in_ps; ret_sl->succ = in_sl;
  return( ret_sl );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_append_system_first	(	Psyslist	in_sl,
		Psysteme	in_ps
	)

Psyslist sl_append_system_first( in_sl, in_ps ) AL 23/03/95 A new Psyslist with in_ps at the end of in_sl (sharing).

Parameters:

	in_sl	n_sl
	in_ps	n_ps

Definition at line 253 of file sc_list.c.

References NULL, sl_append_system(), SL_NULL, and Ssyslist::succ.

Referenced by slx_parse().

{
  Psyslist new_sl = SL_NULL, sl = SL_NULL;
  
  if (in_ps == NULL) return( in_sl );
  new_sl = sl_append_system(NULL, in_ps);
  if (in_sl == SL_NULL) return new_sl; 
  if (in_sl->succ == NULL) { in_sl->succ = new_sl ; return in_sl; }
  for(sl = in_sl; (sl->succ != NULL); sl = sl->succ) {}
  sl->succ = new_sl;
  return( in_sl );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_dup

(

Psyslist

in_sl

)

Psyslist sl_dup( (Psyslist) in_sl ) AL 15/11/93 w - 1 duplication : everything is duplicated, except entities.

Duplicates input syslist.

Parameters:

in_sl

n_sl

Definition at line 293 of file sc_list.c.

References NULL, Ssyslist::psys, sc_dup(), sl_append_system(), SL_NULL, and Ssyslist::succ.

Referenced by dj_dup(), pa_dup(), pa_intersect_complement(), pa_intersect_system(), and pa_path_to_few_disjunct_ofl_ctrl().

{
  Psyslist  sl, ret_sl = SL_NULL;
  for( sl = in_sl; sl != NULL; sl = sl->succ ) {
    ret_sl = sl_append_system( ret_sl, sc_dup( sl->psys ) );
  }
  return ret_sl;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_dup1

(

Psyslist

in_sl

)

Psyslist sl_dup1( (Psyslist) in_sl ) AL 15/11/93 Duplicates input syslist.

Sharing.

Parameters:

in_sl

n_sl

Definition at line 308 of file sc_list.c.

References NULL, Ssyslist::psys, SC_UNDEFINED, sl_append_system(), and Ssyslist::succ.

Referenced by dj_dup1(), and pa_dup1().

{
  Psyslist  sl, ret_sl = NULL;
  for( sl = in_sl; sl != NULL; sl = sl->succ ) {
    if ( sl->psys == SC_UNDEFINED ) continue;
    ret_sl = sl_append_system( ret_sl, sl->psys );
  }
  return ret_sl;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void sl_fprint	(	in_fi	,
		in_sl	,
		char *(*)()	in_fu
	)

Definition at line 444 of file sc_list.c.

References sl_fprint_tab().

Referenced by build_list_of_min(), prepare_reindexing(), separate_variables(), and separate_variables_2().

{ sl_fprint_tab( in_fi, in_sl, in_fu, 0 );  }

Here is the call graph for this function:

Here is the caller graph for this function:

void sl_fprint_tab	(	FILE*	in_fi,
		Psyslist	in_sl,
		char *(*)()	in_fu,
		int	in_tab
	)

Prints the VAR part

Prints Psysteme list

Special cases

General Cases

Definition at line 380 of file sc_list.c.

References b, b1, base_union(), egalite_fprint(), fprintf(), free(), inegalite_fprint(), NULL, Ssyslist::psys, sc_empty_p(), sc_full_p(), SC_UNDEFINED_P, sl_get_tab_string(), SL_NULL, Svecteur::succ, Ssyslist::succ, vect_rm(), vect_size(), VECTEUR_NUL_P, and vecteur_var.

Referenced by dj_fprint_tab(), pa_fprint_tab(), sl_fprint(), and un_fprint_tab().

{
  Pcontrainte   peq  = NULL;
  Psyslist      sl   = NULL;
  Pbase         b    = NULL, b1;
  char*         tabs = sl_get_tab_string( in_tab );

  if (in_sl == SL_NULL) {
    fprintf( in_fi, "\n%sSL_NULL\n", tabs ); 
    free(tabs); return; 
  }
  
  /* Prints the VAR part */
  for(sl = in_sl; sl != NULL; sl = sl->succ) {
    if (sl->psys == NULL) continue;
    b1 = b;
    b  = base_union( b, (sl->psys)->base );
    if ( b != b1 ) { vect_rm( b1 ); b1 = (Pvecteur) NULL; } 
  }
  
  if (vect_size( b ) >= 1 ) {
    fprintf( in_fi,"%s", tabs);
    fprintf( in_fi,"VAR %s", (*in_fu)(vecteur_var(b)));
    for (b1=b->succ; !VECTEUR_NUL_P(b1); b1 = b1->succ)
      fprintf(in_fi,", %s",(*in_fu)(vecteur_var(b1)));
  }
  
  vect_rm( (Pvecteur) b ); b = (Pvecteur) NULL;

  /* Prints Psysteme list */
  for(sl = in_sl ; sl != NULL; sl = sl->succ) {
    Psysteme    ps = NULL;
    
    ps = sl->psys;
    
    /* Special cases */
    if ( SC_UNDEFINED_P(ps) ) 
      {fprintf( in_fi, "\n%sSC_UNDEFINED\n", tabs); continue; }
    if ( sc_full_p(ps) ) 
      {fprintf( in_fi, "\n%sSC_FULL\n", tabs); continue; }
    if ( sc_empty_p(ps) ) 
      {fprintf( in_fi, "\n%sSC_EMPTY\n", tabs); continue; }


    /* General Cases */
    fprintf(in_fi,"\n%s { \n", tabs);
    
    for (peq = ps->inegalites;peq!=NULL;
    fprintf(in_fi,"%s", tabs),
         inegalite_fprint(in_fi,peq,in_fu),peq=peq->succ);
    
    for (peq = ps->egalites;peq!=NULL;
    fprintf(in_fi,"%s", tabs),
         egalite_fprint(in_fi,peq,in_fu),peq=peq->succ);
    
    fprintf(in_fi,"%s } \n", tabs);
  }
  free( tabs );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_free

(

Psyslist

psl

)

Psyslist sl_free(Psyslist psl) BA, AL 30/05/94 w - 1 depth free.

Parameters:

psl

sl

Definition at line 324 of file sc_list.c.

References free(), NULL, Ssyslist::psys, sc_free(), sl_free(), and SL_NULL.

Referenced by dj_free(), pa_free(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_reduce_simple_complement(), pa_supress_same_constraints(), and sl_free().

{
  if( psl != SL_NULL ) {
    psl->psys = sc_free( psl->psys );
    psl->succ = sl_free(psl->succ);
    free( psl ); psl = NULL;
  }
  return SL_NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_free1

(

Psyslist

psl

)

Psyslist sl_free1(Psyslist psl) AL 30/05/94 1 depth free.

Parameters:

psl

sl

Definition at line 340 of file sc_list.c.

References free(), NULL, Ssyslist::psys, sl_free1(), and SL_NULL.

Referenced by dj_free1(), pa_free1(), pa_reduce_simple_complement(), and sl_free1().

{
  if( psl != SL_NULL ) {
    psl->psys = (Psysteme) NULL;
    psl->succ = sl_free1(psl->succ);
    free( psl );
  }
  return SL_NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

char* sl_get_tab_string

(

int

in_tab

)

char* sl_get_tab_string( in_tab ) returns a string of in_tab

Parameters:

in_tab

n_tab

Definition at line 363 of file sc_list.c.

References assert, name, and strdup().

Referenced by dj_fprint_tab(), pa_fprint_tab(), sl_fprint_tab(), and un_fprint_tab().

{
  int            d;
  static  char   name[20];
#ifndef strdup
  extern  char*  strdup();
#endif

  if (in_tab == 0) return strdup("");
  assert( (in_tab > 0) && (in_tab < 20) );
  for(d = 0; d < in_tab; d++){ sprintf(&name[d],"\t"); }
  return strdup(name);
}

Here is the call graph for this function:

Here is the caller graph for this function:

boolean sl_is_system_p

(

Psyslist

in_sl

)

boolean sl_is_system_p( (Psyslist) in_sl ) AL 16/11/93 Returns True if syslist in_sl has only one Psysteme in it.

Parameters:

in_sl

n_sl

Definition at line 227 of file sc_list.c.

References sl_length().

Referenced by dj_is_system_p().

{ return ( sl_length(in_sl) == 1 ); } 

Here is the call graph for this function:

Here is the caller graph for this function:

boolean sl_length

(

Psyslist

in_sl

)

int sl_length( (Psyslist) in_sl ) AL 26/04/95 Returns length of in_sl.

Parameters:

in_sl

n_sl

Definition at line 190 of file sc_list.c.

References NULL, and Ssyslist::succ.

Referenced by pa_feasibility_ofl_ctrl(), pa_path_to_disjunct_ofl_ctrl(), pa_path_to_disjunct_rule4_ofl_ctrl(), and sl_is_system_p().

{
  int length; Psyslist sl = in_sl;  
  if (in_sl == NULL) return 0;
  for(length = 0; sl != NULL; sl = sl->succ, length++);
  return length; 
}

Here is the caller graph for this function:

int sl_max_constraints_nb

(

Psyslist

in_sl

)

int sl_max_constraints_nb( (Psyslist) in_sl ) Give the maximum constraints nb among systems of in_sl.

Parameters:

in_sl

n_sl

Definition at line 204 of file sc_list.c.

References if(), NULL, and sc_empty_p().

Referenced by pa_feasibility_ofl_ctrl(), and pa_max_constraints_nb().

{ 
  Psysteme   ps;
  int        ret_int = 0;
  
  if (in_sl == NULL) return 0;
  
  for(; in_sl != NULL; in_sl = in_sl->succ) {
    int loc;
    ps  = in_sl->psys; 
    if (sc_empty_p(ps)) continue;
    loc = 2*(ps->nb_eq) + ps->nb_ineq;
    if (loc > ret_int) ret_int = loc;
  }
  return ret_int; 
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_new

(

void

)

Psyslist sl_new() AL 26/10/93 Input : Nothing.

Output : An empty syslist.

Definition at line 274 of file sc_list.c.

References exit(), fprintf(), malloc(), NULL, Ssyslist::psys, and Ssyslist::succ.

Referenced by build_third_comb(), dj_new(), pa_fprint_tab(), prepare_array_bounds(), and sl_append_system().

{
  Psyslist p;
  
  p = (Psyslist) malloc(sizeof(Ssyslist));
  if (p == NULL) {
    (void) fprintf(stderr,"sl_new: Out of memory space\n");
    exit(-1);
  }
  p->psys = (Psysteme ) NULL; p->succ = (Psyslist) NULL;
  return(p);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Psyslist sl_read

(

char*

nomfic

)

fichier lu par sl_lex.l

void sl_read(FILE*) reads a Psyslist

Parameters:

nomfic

omfic

Definition at line 456 of file sc_list.c.

References exit(), fprintf(), NULL, sl_init_lex(), slx_in, and slx_parse().

Referenced by dj_read(), and pa_read().

{
  if ((slx_in = fopen(nomfic, "r")) == NULL) {
    (void) fprintf(stderr, "Ouverture du fichier %s impossible\n",nomfic);
    exit(4);
  }
  sl_init_lex(); slx_parse(); fclose( slx_in );
  return( sl_yacc );
}

Here is the call graph for this function:

Here is the caller graph for this function:

void sl_set_variable_name

(

char* (*)()

in_fu

)

char* sl_set_variable_name( in_fu ) give the function to read variables

Definition at line 354 of file sc_list.c.

References union_variable_name.

{
  union_variable_name = in_fu;
}

void un_fprint_tab	(	FILE*	in_fi,
		char*	in_un,
		char *(*)()	in_fu,
		int	in_ty,
		int	in_tab
	)

void un_fprint_tab(FILE*, Pdisjunct, function, type, tab) prints a union

Definition at line 470 of file sc_list.c.

References dj_fprint, fprintf(), IS_DJ, IS_PA, IS_SC, IS_SL, pa_fprint, sc_fprint(), sl_fprint_tab(), and sl_get_tab_string().

{ 
  switch( in_ty ) {
  
  case IS_SC: 
    fprintf  ( in_fi, "Systeme:\n");
    sc_fprint( in_fi, (Psysteme) in_un, in_fu );
    break;
   
  case IS_SL: 
    fprintf      ( in_fi, "%sSyslist:\n", sl_get_tab_string( in_tab ));
    sl_fprint_tab( in_fi, (Psyslist) in_un, in_fu, in_tab );
    break;
   
  case IS_DJ:
    dj_fprint( in_fi, (Pdisjunct) in_un, in_fu );
    break;
    
  case IS_PA:
    pa_fprint( in_fi, (Ppath) in_un, in_fu );
    break;
 
  default: {}
  }
}

Here is the call graph for this function:

---

Variable Documentation

Psyslist sl_yacc

Definition at line 106 of file sl_gram.c.

FILE * slx_in

Psysteme construit par sl_gram.y.

Definition at line 345 of file sl_lex.c.

Referenced by sl_read(), slx__init_globals(), slx_get_in(), and slx_set_in().

char*(* union_variable_name)(Variable) = variable_default_name

Package : C3/union Author : Arnauld LESERVOT (leservot(a)limeil.cea.fr) Date : Modified : 04 04 95 Documents: UNION.tex : ``Extension de C3 aux unions de polyedres'' Comments :.

sc_list.c

WARNING THOSE FUNCTIONS ARE AUTOMATICALLY DERIVED

FROM THE WEB SOURCES !Ansi includesLinear includes

Referenced by contrainte_parallel_in_liste(), dj_disjunct_complement(), dj_intersect_djcomp_ofl_ctrl(), dj_system_complement(), dj_variable_substitution_with_eqs_ofl_ctrl(), pa_feasibility_ofl_ctrl(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), pa_supress_same_constraints(), sc_elim_redund_with_first_ofl_ctrl(), sc_supress_parallel_redund_constraints(), sc_supress_same_constraints(), and sl_set_variable_name().