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

Data Structures
struct	Ssyslist
	Warning! Do not modify this file that is automatically generated! More...

struct	Spath

struct	Sunion

Macros
#define	SL_NULL (Psyslist) NULL

#define	DJ_UNDEFINED (Pdisjunct) NULL

#define	CO_UNDEFINED (Pcomplement) NULL

#define	PA_UNDEFINED (Ppath) NULL

#define	UN_UNDEFINED (Punion) NULL

#define	UN_FULL_SPACE (Punion) NULL

#define	UN_EMPTY_SPACE (Punion) NULL

#define	my_sc_full() sc_full()
	FOR BACKWARD COMPATIBILITY. More...

#define	my_sc_empty() sc_empty((Pbase) NULL)

#define	is_sc_my_empty_p(ps) sc_empty_p((ps))

#define	is_dj_full_p(dj) dj_full_p((dj))

#define	is_dj_empty_p(dj) dj_empty_p((dj))

#define	is_pa_full_p(pa) pa_full_p((pa))

#define	is_pa_empty_p(pa) pa_empty_p((pa))

#define	sc_difference(ps1, ps2) pa_system_difference_ofl_ctrl((ps1),(ps2),FWD_OFL_CTRL)
	FOR BACKWARD COMPATIBILITY. More...

#define	sc_inclusion_p(ps1, ps2) pa_inclusion_p_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)

#define	sc_inclusion_p_ofl(ps1, ps2) pa_inclusion_p_ofl_ctrl((ps1), (ps2), FWD_OFL_CTRL)

#define	sc_inclusion_p_ofl_ctrl(ps1, ps2, ofl) pa_inclusion_p_ofl_ctrl((ps1), (ps2), (ofl))

#define	sc_equal_p(ps1, ps2) pa_system_equal_p_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)

#define	sc_equal_p_ofl(ps1, ps2) pa_system_equal_p_ofl_ctrl((ps1), (ps2), FWD_OFL_CTRL)

#define	sc_equal_p_ofl_ctrl(ps1, ps2, ofl) pa_system_equal_p_ofl_ctrl((ps1), (ps2), (ofl))

#define	sc_convex_hull_equals_union_p(conv_hull, ps1, ps2) pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2),NO_OFL_CTRL, false)

#define	sc_convex_hull_equals_union_p_ofl(conv_hull, ps1, ps2) pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), OFL_CTRL, false)

#define	sc_convex_hull_equals_union_p_ofl_ctrl(conv_hull, ps1, ps2, ofl, bo) pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), (ofl), (bo))

#define	sc_elim_redund_with_first(ps1, ps2) sc_elim_redund_with_first_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)
	OTHERS. More...

#define	dj_fprint(fi, dj, fu) dj_fprint_tab((fi), (dj), (fu), 0)

#define	DJ_UNDEFINED_P(dj) ((dj) == DJ_UNDEFINED)

#define	dj_faisabilite(dj) dj_feasibility_ofl_ctrl((dj), NO_OFL_CTRL)

#define	dj_feasibility(dj) dj_feasibility_ofl_ctrl((dj), NO_OFL_CTRL)

#define	dj_faisabilite_ofl(dj) dj_feasibility_ofl_ctrl((dj), FWD_OFL_CTRL)

#define	dj_intersection(dj1, dj2) dj_intersection_ofl_ctrl((dj1), (dj2), NO_OFL_CTRL)

#define	dj_intersect_system(dj, ps) dj_intersect_system_ofl_ctrl((dj), (ps), NO_OFL_CTRL )

#define	dj_intersect_djcomp(dj1, dj2) dj_intersect_djcomp_ofl_ctrl( (dj1), (dj2), NO_OFL_CTRL )

#define	dj_projection_along_variables(dj, pv) dj_projection_along_variables_ofl_ctrl((dj),(pv),NO_OFL_CTRL)

#define	dj_variable_substitution_with_eqs(dj, co, pv) dj_variable_substitution_with_eqs_ofl_ctrl( (dj), (co), (pv), NO_OFL_CTRL )

#define	pa_fprint(fi, pa, fu) pa_fprint_tab((fi), (pa), (fu), 0)

#define	PA_UNDEFINED_P(pa) ((pa) == PA_UNDEFINED)

#define	pa_new() pa_make(NULL, NULL)

#define	pa_faisabilite(pa) pa_feasibility_ofl_ctrl((pa), NO_OFL_CTRL)

#define	pa_feasibility(pa) pa_feasibility_ofl_ctrl((pa), NO_OFL_CTRL)

#define	pa_faisabilite_ofl(pa) pa_feasibility_ofl_ctrl((pa), FWD_OFL_CTRL)

#define	pa_path_to_disjunct(pa) pa_path_to_disjunct_ofl_ctrl((pa), NO_OFL_CTRL )

#define	pa_path_dup_to_disjunct(pa) pa_path_to_disjunct_ofl_ctrl((pa), NO_OFL_CTRL )

#define	pa_system_difference(ps1, ps2) pa_system_difference_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

#define	pa_system_equal_p(ps1, ps2) pa_system_equal_p_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

#define	pa_inclusion_p(ps1, ps2) pa_inclusion_p_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

#define	pa_path_to_disjunct_ofl(pa) pa_path_to_disjunct_ofl_ctrl((pa), FWD_OFL_CTRL )

#define	pa_path_to_disjunct_rule4(pa) pa_path_to_disjunct_rule4_ofl_ctrl((pa), FWD_OFL_CTRL )

#define	pa_path_to_few_disjunct(pa) pa_path_to_few_disjunct_ofl_ctrl((pa), NO_OFL_CTRL)

#define	pa_system_difference(ps1, ps2) pa_system_difference_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

#define	pa_convex_hull_equals_union_p(conv_hull, ps1, ps2) pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), NO_OFL_CTRL, false)

#define	un_fprint(fi, un, fu, ty) un_fprint_tab((fi), (un), (fu), (ty), 0)

#define	PATH_MAX_CONSTRAINTS 12
	Misceleanous (debuging...) More...

#define	IS_SC 1

#define	IS_SL 2

#define	IS_DJ 3

#define	IS_PA 4

#define	C3_DEBUG(fun, code)

#define	C3_RETURN(type, val) {return val;}

Typedefs
typedef struct Ssyslist *	Psyslist
	Warning! Do not modify this file that is automatically generated! More...

typedef struct Ssyslist	Ssyslist

typedef Ssyslist *	Pdisjunct

typedef Ssyslist	Sdisjunct

typedef Ssysteme *	Pcomplement

typedef Ssysteme	Scomplement

typedef Ssyslist *	Pcomplist

typedef Ssyslist	Scomplist

typedef struct Spath *	Ppath

typedef struct Spath	Spath

typedef struct Sunion *	Punion

typedef struct Sunion	Sunion

Enumerations
enum	hspara_elem { unpara = 0 , sszero = 1 , ssplus = 2 , ssminus = 3 , opzero = 4 , opplus = 5 , keep = 6 , opminus = 7 , empty = 8 , full = 9 , unpara = 0 , sszero = 1 , ssplus = 2 , ssminus = 3 , opzero = 4 , opplus = 5 , keep = 6 , opminus = 7 , empty = 8 , full = 9 }
	Implementation of the finite parallel half space lattice hspara. More...

Functions
Pdisjunct	dj_new (void)
	cproto-generated files More...

Pdisjunct	dj_dup (Pdisjunct)
	Pdisjunct dj_dup( (Pdisjunct) in_dj ) AL 15/11/93 Duplicates input disjunction. More...

Pdisjunct	dj_free (Pdisjunct)
	Pdisjunct dj_free( (Pdisjunct) in_dj ) AL 31/05/94 w - 1 depth free of input disjunction. More...

Pdisjunct	dj_dup1 (Pdisjunct)
	Pdisjunct dj_dup1( (Pdisjunct) in_dj ) AL 31/05/94 1st depth duplication of input disjunction. More...

Pdisjunct	dj_free1 (Pdisjunct)
	Pdisjunct dj_free1( (Pdisjunct) in_dj ) AL 31/05/94 1st depth free of input disjunction. More...

Pdisjunct	dj_full (void)
	Pdisjunct dj_full() AL 18/11/93 Return full space disjunction = dj_new() More...

bool	dj_full_p (Pdisjunct)
	dj_full_p( (Pdisjunct) in_dj ) AL 30/05/94 Returns True if in_dj = (NIL) ^ (NIL) More...

Pdisjunct	dj_empty (void)
	Pdisjunct dj_empty() AL 18/11/93 Returns a disjunction with sc_empty() element. More...

bool	dj_empty_p (Pdisjunct)
	dj_empty_p( (Ppath) in_pa ) AL 30/05/94 Returns True if in_dj = (1*TCST = 0) ^ (NIL) More...

Pdisjunct	dj_intersection_ofl_ctrl (Pdisjunct, Pdisjunct, int)
	Pdisjunct dj_intersection_ofl_ctrl( in_dj1, in_dj2, ofl_ctrl ) Computes intersection of two disjunctions. More...

Pdisjunct	dj_intersect_system_ofl_ctrl (Pdisjunct, Psysteme, int)

Pdisjunct	dj_intersect_djcomp_ofl_ctrl (Pdisjunct, Pdisjunct, int)
	Pdisjunct dj_intersect_djcomp_ofl_ctrl( ) No sharing. More...

Pdisjunct	dj_union (Pdisjunct, Pdisjunct)
	Pdisjunct dj_union( (Pdisjunct) in_dj1, (Pdisjunct) in_dj2 ) Give the union of the two disjunctions. More...

bool	dj_feasibility_ofl_ctrl (Pdisjunct, int)
	bool dj_feasibility_ofl_ctrl( (Pdisjunct) in_dj, (int) ofl_ctrl ) Returns true if in_dj is a feasible disjunction. More...

Pdisjunct	dj_system_complement (Psysteme)
	Pdisjunct dj_system_complement( (Psystem) in_ps ) AL 26/10/93 Input : A Psysteme. More...

Pdisjunct	dj_disjunct_complement (Pdisjunct)
	Returns complement of in_dj. More...

Pdisjunct	dj_projection_along_variables_ofl_ctrl (Pdisjunct, Pvecteur, int)
	Returns projection of in_dj along vars of in_pv. More...

Pdisjunct	dj_simple_inegs_to_eg (Pdisjunct)
	Pdisjunct dj_simple_inegs_to_eg( in_dj ) transforms two opposite inequalities in a simple equality in each system of the input disjunction. More...

bool	dj_is_system_p (Pdisjunct)
	bool dj_is_system_p( (Pdisjunct) in_dj ) AL 16/11/93 Returns True if disjunction in_dj has only one Psysteme in it. More...

Pdisjunct	dj_append_system (Pdisjunct, Psysteme)
	Pdisjunct dj_append_system( (Pdisjunct) in_dj, (Psysteme) in_ps ) Input : A disjunct in_dj to wich in_ps will be added. More...

Pdisjunct	dj_variable_rename (Pdisjunct, Variable, Variable)
	dj_variable_rename replaces in_vold with in_vnew : in_dj is modified More...

Pdisjunct	dj_variable_substitution_with_eqs_ofl_ctrl (Pdisjunct, Pcontrainte, Pvecteur, int)

void	dj_fprint_tab (FILE , Pdisjunct, char (*)(void), int)

Pdisjunct	dj_read (char *)
	void dj_read(FILE*) reads a Pdisjunct More...

Ppath	pa_make (Psysteme, Pcomplist)
	path.c More...

Ppath	pa_dup (Ppath)
	void pa_dup(Ppath pa) AL 30/05/94 More...

Ppath	pa_free (Ppath)
	Ppath pa_free(Ppath pa) BA, AL 30/05/94. More...

Ppath	pa_dup1 (Ppath)
	void pa_dup1(Ppath pa) AL 30/05/94 1 depth duplication: system and complements are shared. More...

Ppath	pa_free1 (Ppath)
	Ppath pa_free1(Ppath pa) BA, AL 30/05/94 1 depth free. More...

Ppath	pa_full (void)
	Ppath pa_full() AL 18/11/93 Returns full space path : pa_full = pa_new() More...

bool	pa_full_p (Ppath)
	pa_full_p( (Ppath) in_pa ) AL 18/11/93 Returns True if in_pa = (NIL) ^ (NIL) More...

Ppath	pa_empty (void)
	Ppath pa_empty() AL 18/11/93 Returns empty path : pa_empty = sc_empty(NULL) ^ (NIL) More...

bool	pa_empty_p (Ppath)
	pa_empty_p( (Ppath) in_pa ) AL 18/11/93 Returns True if in_pa = (1*TCST = 0) ^ (NIL) More...

int	pa_max_constraints_nb (Ppath)
	int pa_max_constraints_nb( (Ppath) in_pa ) Give the maximum constraints nb among systems of in_pa. More...

Ppath	pa_intersect_system (Ppath, Psysteme)
	Ppath pa_intersect_system( (Ppath) in_pa, (Psysteme) in_ps ) Computes the intersection between in_pa and in_ps. More...

Ppath	pa_intersect_complement (Ppath, Pcomplement)
	Ppath pa_intersect_complement( (Ppath) in_pa, (Pcomplement) in_pc ) Computes the intersection between in_pa and in_ps. More...

Ppath	pa_reduce_simple_complement (Ppath)
	Ppath pa_reduce_simple_complement( (Ppath) in_pa ) AL 16/11/93 Scan all the complement. More...

Ppath	pa_transform_eg_in_ineg (Ppath)
	Ppath pa_transform_eg_in_ineg( in_pa ) Transforms all equalities of all systems composing in_pa in inequalities and returns in_pa. More...

bool	pa_feasibility_ofl_ctrl (Ppath, int)
	bool pa_feasibility_ofl_ctrl( (Ppath) in_pa, int ofl_ctrl) Returns true if the input path is possible and false if it is not possible or undefined. More...

Pdisjunct	pa_path_to_disjunct_ofl_ctrl (Ppath, int)
	Pdisjunct pa_path_to_disjunct_ofl_ctrl ( (Ppath) in_pa, (int) ofl_ctrl) Produces a Pdisjunct corresponding to the path Ppath. More...

void	pa_fprint_tab (FILE , Ppath, char (*)(void), int)

Ppath	pa_read (char *)
	void pa_read(FILE*) reads a Ppath More...

enum hspara_elem	vect_parallel (Pvecteur, Pvecteur)
	reduc.c More...

enum hspara_elem	contrainte_parallel_in_liste (Pcontrainte, Pcontrainte)
	enum enum hspara_elem contrainte_parallel_in_liste( in_co, in_lc ) AL950711 input: 1 constraint in_co and a list of constraints in_lc output: hspara_elem (element of the parallel half space lattice) memory: Inspector (nothing is shared, nor modified, output allocated). More...

Psysteme	sc_supress_parallel_redund_constraints (Psysteme, Psysteme)
	Psysteme sc_supress_parallel_redund_constraints( in_ps1, in_ps2 ) input: 2 Psystemes in_ps1 and in_ps2 output: in_ps1 / in_ps2 (cut operation on polyhedrons) memory: Inspector (nothing is shared, nor modified, output allocated). More...

Psysteme	sc_supress_same_constraints (Psysteme, Psysteme)
	Psysteme sc_supress_same_constraints( in_ps1, in_ps2 ) supress in in_ps2 constraints that are in in_ps1. More...

Psysteme	sc_elim_redund_with_first_ofl_ctrl (Psysteme, Psysteme, int)
	Psysteme sc_elim_redund_with_first_ofl_ctrl( in_ps1, in_ps2, ofl_ctrl ) Returns constraints of in_ps2 which cut in_ps1. More...

Ppath	pa_supress_same_constraints (Ppath)
	Ppath pa_supress_same_constraints( (Ppath) in_pa ) Supress from complements of in_pa same constraints than those in positif Psystem in_pa->psys. More...

Pdisjunct	pa_path_to_disjunct_rule4_ofl_ctrl (Ppath, int)
	Pdisjunct pa_path_to_disjunct_rule4_ofl_ctrl( (Ppath) in_pa, int ofl_ctrl) Returns the corresponding disjunction according rule 4. More...

Pdisjunct	pa_path_to_few_disjunct_ofl_ctrl (Ppath, int)
	line 1197 "reduc.w" More...

bool	pa_inclusion_p_ofl_ctrl (Psysteme, Psysteme, int)
	bool pa_inclusion_p(Psysteme ps1, Psysteme ps2) BA, AL 31/05/94 returns true if ps1 represents a subset of ps2, false otherwise Inspector (no sharing on memory). More...

bool	pa_system_equal_p_ofl_ctrl (Psysteme, Psysteme, int)
	bool pa_system_equal_p(Psysteme ps1, Psysteme ps2) BA More...

Pdisjunct	pa_system_difference_ofl_ctrl (Psysteme, Psysteme, int)
	Pdisjunct pa_system_difference_ofl_ctrl(ps1, ps2) input : two Psystemes output : a disjunction representing ps1 - ps2 modifies : nothing comment : algorihtm : chemin = ps1 inter complement of (ps2) ret_dj = dj_simple_inegs_to_eg( pa_path_to_few_disjunct(chemin) ) More...

bool	pa_convex_hull_equals_union_p_ofl_ctrl (Psysteme, Psysteme, Psysteme, int, volatile bool)
	bool pa_convex_hull_equals_union_p(conv_hull, ps1, ps2) input : two Psystems and their convex hull AL,BC 23/03/95 output : true if ps1 U ps2 = convex_hull, false otherwise modifies : nothing comment : complexity = nb_constraints(ps1) * nb_constraints(ps2) if ofl_ctrl = OFL_CTRL, conservatively returns ofl_ctrl when an overflow error occurs More...

Psysteme	sc_full (void)
	Psysteme sc_full() similar to sc_new. More...

bool	sc_full_p (Psysteme)
	Psysteme sc_full_p( in_ps ) similar to sc_new. More...

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

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

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

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

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

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

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

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

Psyslist	sl_append_system_first (Psyslist, Psysteme)
	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). More...

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

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

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

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

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

void	sl_set_variable_name (char ()(void))

char *	sl_get_tab_string (int)
	char* sl_get_tab_string( in_tab ) returns a string of in_tab \t More...

void	sl_fprint_tab (FILE , Psyslist, char (*)(void), int)

void	sl_fprint (FILE , Psyslist, char (*)(void))

Psyslist	sl_read (char *)
	void sl_read(FILE*) reads a Psyslist More...

void	un_fprint_tab (FILE , char , char ()(void), int, int)

int	slx_parse (void)

int	slx_error (char *)

int	slx_lex (void)

void	slx_restart (FILE *)

void	slx_pop_buffer_state (void)

int	slx_get_lineno (void)

FILE *	slx_get_in (void)

FILE *	slx_get_out (void)

int	slx_get_leng (void)

char *	slx_get_text (void)

void	slx_set_lineno (int)

void	slx_set_in (FILE *)

void	slx_set_out (FILE *)

int	slx_get_debug (void)

void	slx_set_debug (int)

int	slx_lex_destroy (void)

void *	slx_alloc (yy_size_t)

void *	slx_realloc (void *, yy_size_t)

void	slx_free (void *)

int	slx_wrap (void)

void	sl_init_lex (void)

Variables
char (	union_variable_name )(Variable)
	sc_list.c More...

bool	syntax_error
	sl_gram.c More...

Value	valcst

Psyslist	sl_yacc

Pbase	ba_yacc

Variable	va_yacc

int	slx_char

int	slx_nerrs

int	slx_leng
	sl_lex.c More...

FILE *	slx_in

FILE *	slx_out

int	slx_lineno

int	slx__flex_debug

char *	slx_text

Macro Definition Documentation

◆ C3_DEBUG

#define C3_DEBUG	(	fun,
		code
	)

Definition at line 158 of file union.h.

◆ C3_RETURN

#define C3_RETURN	(	type,
		val
	)	{return val;}

Definition at line 159 of file union.h.

◆ CO_UNDEFINED

#define CO_UNDEFINED (Pcomplement) NULL

Definition at line 24 of file union.h.

◆ dj_faisabilite

#define dj_faisabilite ( dj ) dj_feasibility_ofl_ctrl((dj), NO_OFL_CTRL)

Definition at line 106 of file union.h.

◆ dj_faisabilite_ofl

#define dj_faisabilite_ofl ( dj ) dj_feasibility_ofl_ctrl((dj), FWD_OFL_CTRL)

Definition at line 108 of file union.h.

◆ dj_feasibility

#define dj_feasibility ( dj ) dj_feasibility_ofl_ctrl((dj), NO_OFL_CTRL)

Definition at line 107 of file union.h.

◆ dj_fprint

#define dj_fprint	(	fi,
		dj,
		fu
	)	dj_fprint_tab((fi), (dj), (fu), 0)

Definition at line 104 of file union.h.

◆ dj_intersect_djcomp

#define dj_intersect_djcomp	(	dj1,
		dj2
	)	dj_intersect_djcomp_ofl_ctrl( (dj1), (dj2), NO_OFL_CTRL )

Definition at line 111 of file union.h.

◆ dj_intersect_system

#define dj_intersect_system	(	dj,
		ps
	)	dj_intersect_system_ofl_ctrl((dj), (ps), NO_OFL_CTRL )

Definition at line 110 of file union.h.

◆ dj_intersection

#define dj_intersection	(	dj1,
		dj2
	)	dj_intersection_ofl_ctrl((dj1), (dj2), NO_OFL_CTRL)

Definition at line 109 of file union.h.

◆ dj_projection_along_variables

#define dj_projection_along_variables	(	dj,
		pv
	)	dj_projection_along_variables_ofl_ctrl((dj),(pv),NO_OFL_CTRL)

Definition at line 112 of file union.h.

◆ DJ_UNDEFINED

#define DJ_UNDEFINED (Pdisjunct) NULL

Definition at line 20 of file union.h.

◆ DJ_UNDEFINED_P

#define DJ_UNDEFINED_P ( dj ) ((dj) == DJ_UNDEFINED)

Definition at line 105 of file union.h.

◆ dj_variable_substitution_with_eqs

#define dj_variable_substitution_with_eqs	(	dj,
		co,
		pv
	)	dj_variable_substitution_with_eqs_ofl_ctrl( (dj), (co), (pv), NO_OFL_CTRL )

Definition at line 114 of file union.h.

◆ IS_DJ

#define IS_DJ 3

Definition at line 143 of file union.h.

◆ is_dj_empty_p

#define is_dj_empty_p ( dj ) dj_empty_p((dj))

Definition at line 81 of file union.h.

◆ is_dj_full_p

#define is_dj_full_p ( dj ) dj_full_p((dj))

Definition at line 80 of file union.h.

◆ IS_PA

#define IS_PA 4

Definition at line 144 of file union.h.

◆ is_pa_empty_p

#define is_pa_empty_p ( pa ) pa_empty_p((pa))

Definition at line 83 of file union.h.

◆ is_pa_full_p

#define is_pa_full_p ( pa ) pa_full_p((pa))

Definition at line 82 of file union.h.

◆ IS_SC

#define IS_SC 1

Definition at line 141 of file union.h.

◆ is_sc_my_empty_p

#define is_sc_my_empty_p ( ps ) sc_empty_p((ps))

Definition at line 79 of file union.h.

◆ IS_SL

#define IS_SL 2

Definition at line 142 of file union.h.

◆ my_sc_empty

#define my_sc_empty ( ) sc_empty((Pbase) NULL)

Definition at line 78 of file union.h.

◆ my_sc_full

#define my_sc_full ( ) sc_full()

FOR BACKWARD COMPATIBILITY.

Definition at line 77 of file union.h.

◆ pa_convex_hull_equals_union_p

#define pa_convex_hull_equals_union_p	(	conv_hull,
		ps1,
		ps2
	)	pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), NO_OFL_CTRL, false)

Definition at line 132 of file union.h.

◆ pa_faisabilite

#define pa_faisabilite ( pa ) pa_feasibility_ofl_ctrl((pa), NO_OFL_CTRL)

Definition at line 120 of file union.h.

◆ pa_faisabilite_ofl

#define pa_faisabilite_ofl ( pa ) pa_feasibility_ofl_ctrl((pa), FWD_OFL_CTRL)

Definition at line 122 of file union.h.

◆ pa_feasibility

#define pa_feasibility ( pa ) pa_feasibility_ofl_ctrl((pa), NO_OFL_CTRL)

Definition at line 121 of file union.h.

◆ pa_fprint

#define pa_fprint	(	fi,
		pa,
		fu
	)	pa_fprint_tab((fi), (pa), (fu), 0)

Definition at line 117 of file union.h.

◆ pa_inclusion_p

#define pa_inclusion_p	(	ps1,
		ps2
	)	pa_inclusion_p_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

Definition at line 127 of file union.h.

◆ pa_new

#define pa_new ( ) pa_make(NULL, NULL)

Definition at line 119 of file union.h.

◆ pa_path_dup_to_disjunct

#define pa_path_dup_to_disjunct ( pa ) pa_path_to_disjunct_ofl_ctrl((pa), NO_OFL_CTRL )

Definition at line 124 of file union.h.

◆ pa_path_to_disjunct

#define pa_path_to_disjunct ( pa ) pa_path_to_disjunct_ofl_ctrl((pa), NO_OFL_CTRL )

Definition at line 123 of file union.h.

◆ pa_path_to_disjunct_ofl

#define pa_path_to_disjunct_ofl ( pa ) pa_path_to_disjunct_ofl_ctrl((pa), FWD_OFL_CTRL )

Definition at line 128 of file union.h.

◆ pa_path_to_disjunct_rule4

#define pa_path_to_disjunct_rule4 ( pa ) pa_path_to_disjunct_rule4_ofl_ctrl((pa), FWD_OFL_CTRL )

Definition at line 129 of file union.h.

◆ pa_path_to_few_disjunct

#define pa_path_to_few_disjunct ( pa ) pa_path_to_few_disjunct_ofl_ctrl((pa), NO_OFL_CTRL)

Definition at line 130 of file union.h.

◆ pa_system_difference [1/2]

#define pa_system_difference	(	ps1,
		ps2
	)	pa_system_difference_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

Definition at line 131 of file union.h.

◆ pa_system_difference [2/2]

#define pa_system_difference	(	ps1,
		ps2
	)	pa_system_difference_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

Definition at line 131 of file union.h.

◆ pa_system_equal_p

#define pa_system_equal_p	(	ps1,
		ps2
	)	pa_system_equal_p_ofl_ctrl((ps1),(ps2),NO_OFL_CTRL)

Definition at line 126 of file union.h.

◆ PA_UNDEFINED

#define PA_UNDEFINED (Ppath) NULL

Definition at line 31 of file union.h.

◆ PA_UNDEFINED_P

#define PA_UNDEFINED_P ( pa ) ((pa) == PA_UNDEFINED)

Definition at line 118 of file union.h.

◆ PATH_MAX_CONSTRAINTS

#define PATH_MAX_CONSTRAINTS 12

Misceleanous (debuging...)

Definition at line 139 of file union.h.

◆ sc_convex_hull_equals_union_p

#define sc_convex_hull_equals_union_p	(	conv_hull,
		ps1,
		ps2
	)	pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2),NO_OFL_CTRL, false)

Definition at line 94 of file union.h.

◆ sc_convex_hull_equals_union_p_ofl

#define sc_convex_hull_equals_union_p_ofl	(	conv_hull,
		ps1,
		ps2
	)	pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), OFL_CTRL, false)

Definition at line 96 of file union.h.

◆ sc_convex_hull_equals_union_p_ofl_ctrl

#define sc_convex_hull_equals_union_p_ofl_ctrl	(	conv_hull,
		ps1,
		ps2,
		ofl,
		bo
	)	pa_convex_hull_equals_union_p_ofl_ctrl((conv_hull), (ps1), (ps2), (ofl), (bo))

Definition at line 98 of file union.h.

◆ sc_difference

#define sc_difference	(	ps1,
		ps2
	)	pa_system_difference_ofl_ctrl((ps1),(ps2),FWD_OFL_CTRL)

FOR BACKWARD COMPATIBILITY.

Definition at line 87 of file union.h.

◆ sc_elim_redund_with_first

#define sc_elim_redund_with_first	(	ps1,
		ps2
	)	sc_elim_redund_with_first_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)

OTHERS.

Definition at line 102 of file union.h.

◆ sc_equal_p

#define sc_equal_p	(	ps1,
		ps2
	)	pa_system_equal_p_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)

Definition at line 91 of file union.h.

◆ sc_equal_p_ofl

#define sc_equal_p_ofl	(	ps1,
		ps2
	)	pa_system_equal_p_ofl_ctrl((ps1), (ps2), FWD_OFL_CTRL)

Definition at line 92 of file union.h.

◆ sc_equal_p_ofl_ctrl

#define sc_equal_p_ofl_ctrl	(	ps1,
		ps2,
		ofl
	)	pa_system_equal_p_ofl_ctrl((ps1), (ps2), (ofl))

Definition at line 93 of file union.h.

◆ sc_inclusion_p

#define sc_inclusion_p	(	ps1,
		ps2
	)	pa_inclusion_p_ofl_ctrl((ps1), (ps2), NO_OFL_CTRL)

Definition at line 88 of file union.h.

◆ sc_inclusion_p_ofl

#define sc_inclusion_p_ofl	(	ps1,
		ps2
	)	pa_inclusion_p_ofl_ctrl((ps1), (ps2), FWD_OFL_CTRL)

Definition at line 89 of file union.h.

◆ sc_inclusion_p_ofl_ctrl

#define sc_inclusion_p_ofl_ctrl	(	ps1,
		ps2,
		ofl
	)	pa_inclusion_p_ofl_ctrl((ps1), (ps2), (ofl))

Definition at line 90 of file union.h.

◆ SL_NULL

#define SL_NULL (Psyslist) NULL

Definition at line 16 of file union.h.

◆ UN_EMPTY_SPACE

#define UN_EMPTY_SPACE (Punion) NULL

Definition at line 40 of file union.h.

◆ un_fprint

#define un_fprint	(	fi,
		un,
		fu,
		ty
	)	un_fprint_tab((fi), (un), (fu), (ty), 0)

Definition at line 135 of file union.h.

◆ UN_FULL_SPACE

#define UN_FULL_SPACE (Punion) NULL

Definition at line 39 of file union.h.

◆ UN_UNDEFINED

#define UN_UNDEFINED (Punion) NULL

Definition at line 38 of file union.h.

Typedef Documentation

◆ Pcomplement

typedef Ssysteme* Pcomplement

Definition at line 22 of file union.h.

◆ Pcomplist

typedef Ssyslist* Pcomplist

Definition at line 25 of file union.h.

◆ Pdisjunct

typedef Ssyslist* Pdisjunct

Definition at line 18 of file union.h.

◆ Ppath

typedef struct Spath * Ppath

◆ Psyslist

typedef struct Ssyslist * Psyslist

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

Modify src/Libs/union/union-local.h instead, to add your own modifications. header file built by cproto union-local.h

◆ Punion

typedef struct Sunion * Punion

◆ Scomplement

typedef Ssysteme Scomplement

Definition at line 22 of file union.h.

◆ Scomplist

typedef Ssyslist Scomplist

Definition at line 25 of file union.h.

◆ Sdisjunct

typedef Ssyslist Sdisjunct

Definition at line 18 of file union.h.

◆ Spath

typedef struct Spath Spath

◆ Ssyslist

typedef struct Ssyslist Ssyslist

◆ Sunion

typedef struct Sunion Sunion

Enumeration Type Documentation

◆ hspara_elem

enum hspara_elem

Implementation of the finite parallel half space lattice hspara.

                 ________ full 
                /          |
               /          empty ___
              /            |       \
             /           keep       \
            /           /    \       \
         ssplus        /    opplus    \
            |      ssminus    |     opminus
          sszero        \   opzero    /
             \           \   /       /
              \________ unpara _____/

Enumerator
unpara	compare {h1: a1 X + b1 <= 0} with {hj: aj X + bj <= 0}
sszero	unparallel -> h1/hj = h1 a1 == aj for same sign (ss) part lattice
ssplus	b1 == bj -> h1/hj = full
ssminus	bj > b1 -> h1/hj = full keep part
opzero	bj < b1 -> h1/hj = h1 -a1 == aj for opposite sign (op) part lattice
opplus	b1 == bj -> h1/hj = h1
keep	bj > b1 -> h1/hj = h1
opminus	empty part
empty	b1 < bj -> h1/hj = empty
full
unpara	compare {h1: a1 X + b1 <= 0} with {hj: aj X + bj <= 0}
sszero	unparallel -> h1/hj = h1 a1 == aj for same sign (ss) part lattice
ssplus	b1 == bj -> h1/hj = full
ssminus	bj > b1 -> h1/hj = full keep part
opzero	bj < b1 -> h1/hj = h1 -a1 == aj for opposite sign (op) part lattice
opplus	b1 == bj -> h1/hj = h1
keep	bj > b1 -> h1/hj = h1
opminus	empty part
empty	b1 < bj -> h1/hj = empty
full

Definition at line 56 of file union.h.

 {                      /* compare   {h1: a1 X + b1 <= 0} with {hj: aj X + bj <= 0} */      
   unpara        = 0,   /*  unparallel ->   h1/hj = h1    */
   /**/                 /*  a1 == aj for same sign (ss)  part lattice */ 
     sszero      = 1,   /*  b1 == bj   ->   h1/hj = full  */ 
     ssplus      = 2,   /*  bj >  b1   ->   h1/hj = full  */
   /**/     
     /**/               /* keep part                      */
       /**/     
         ssminus = 3,   /*  bj <  b1   ->   h1/hj = h1    */ 
       /**/             /* -a1 == aj for opposite sign (op)  part lattice */
         opzero  = 4,   /*  b1 == bj   ->   h1/hj = h1    */ 
         opplus  = 5,   /*  bj >  b1   ->   h1/hj = h1    */
     keep        = 6,
     /**/               /* empty part                     */
       opminus   = 7,   /*  b1 <  bj   ->   h1/hj = empty */  
     empty       = 8,   
   full          = 9     
 };

Function Documentation

◆ contrainte_parallel_in_liste()

enum hspara_elem contrainte_parallel_in_liste	(	Pcontrainte	in_co,
		Pcontrainte	in_lc
	)

enum enum hspara_elem contrainte_parallel_in_liste( in_co, in_lc ) AL950711 input: 1 constraint in_co and a list of constraints in_lc output: hspara_elem (element of the parallel half space lattice) memory: Inspector (nothing is shared, nor modified, output allocated).

complexity: length(in_lc) * comp(vect_parallel()) comment: in_co represents a1 X+b1 <= 0 and in_lc aj X + bj <=0. Returns in_co/in_lc = join_j( vect_parallel( in_co, in_lc_j ) ) between keep, empty and full.

debuging

Parameters

in_co	n_co
in_lc	n_lc

Definition at line 49 of file reduc.c.

 {
   Pcontrainte         c;
   Pvecteur            vpos;
   enum hspara_elem    ret_sle = keep;  
  
   assert(!CONTRAINTE_UNDEFINED_P(in_co));
   if (CONTRAINTE_NULLE_P(in_co)) return keep;
   
   /* debuging */
   C3_DEBUG("contrainte_parallel_in_list", {
     fprintf(stderr, "Input in_co:");  
     inegalite_fprint( stderr, in_co, union_variable_name ); 
     fprintf(stderr, "Input in_lc:\n"); 
     inegalites_fprint( stderr, in_lc, union_variable_name );
   });
  
   vpos = in_co->vecteur;
   
   for (c = in_lc; !CONTRAINTE_UNDEFINED_P(c) && (ret_sle != full); c=c->succ) {
     Pvecteur         cv   = c->vecteur;
     enum hspara_elem hs   = vect_parallel(vpos, cv);
  
     C3_DEBUG("contrainte_parallel_in_list", {
       fprintf(stderr, "ret_sle: %s ,  hs: %s\n", 
          hspara_to_string(ret_sle),  
          hspara_to_string( hs  )  ); 
     });
     
     ret_sle = hspara_join( ret_sle, hs);
   }
  
  
   /* debuging */
   C3_DEBUG("contrainte_parallel_in_list", 
     { fprintf(stderr, "Output hspara: %s\n", hspara_to_string(ret_sle)); });
   
   return ret_sle;
 }

Referenced by sc_supress_parallel_redund_constraints().

Here is the caller graph for this function:

◆ dj_append_system()

Pdisjunct dj_append_system	(	Pdisjunct	in_dj,
		Psysteme	in_ps
	)

Pdisjunct dj_append_system( (Pdisjunct) in_dj, (Psysteme) in_ps ) Input : A disjunct in_dj to wich in_ps will be added.

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

Parameters

in_dj	n_dj
in_ps	n_ps

Definition at line 403 of file disjunct.c.

 { 
   Pdisjunct ret_dj;
   
   if (dj_full_p(in_dj)) { ret_dj = dj_new(); ret_dj->psys = in_ps; }
   else {ret_dj = (Pdisjunct) sl_append_system((Psyslist) in_dj, in_ps);}
   return ret_dj;
 }

References dj_full_p(), dj_new(), Ssyslist::psys, and sl_append_system().

Referenced by compatible_pc_p(), dj_system_complement(), and pa_path_to_disjunct_rule4_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_disjunct_complement()

Pdisjunct dj_disjunct_complement ( Pdisjunct in_dj )

Returns complement of in_dj.

No sharing

debugging

Parameters

in_dj n_dj

Definition at line 299 of file disjunct.c.

 {
   Pdisjunct ret_dj;
   if DJ_UNDEFINED_P(in_dj) return DJ_UNDEFINED;
   if (dj_empty_p(in_dj)||dj_full_p(in_dj)) return dj_dup(in_dj);
   
   /* debugging */
   C3_DEBUG("dj_disjunct_complement (in_ps)",
       {dj_fprint_tab(stderr, in_dj, union_variable_name, 1);});
  
   ret_dj = dj_full();
   for(; in_dj != NULL; in_dj = in_dj->succ) 
     { ret_dj = dj_intersection(ret_dj, dj_system_complement(in_dj->psys)); }
   C3_RETURN(IS_DJ, ret_dj);
 }

References C3_DEBUG, C3_RETURN, dj_dup(), dj_empty_p(), dj_fprint_tab(), dj_full(), dj_full_p(), dj_intersection, dj_system_complement(), DJ_UNDEFINED, DJ_UNDEFINED_P, IS_DJ, and union_variable_name.

Referenced by dj_intersect_djcomp_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_dup()

Pdisjunct dj_dup ( Pdisjunct in_dj )

Pdisjunct dj_dup( (Pdisjunct) in_dj ) AL 15/11/93 Duplicates input disjunction.

Parameters

in_dj n_dj

Definition at line 58 of file disjunct.c.

 { 
   if (dj_full_p(in_dj)) return dj_full();
   return (Pdisjunct) sl_dup( (Psyslist) in_dj ); 
 }

References dj_full(), dj_full_p(), and sl_dup().

Referenced by dj_disjunct_complement(), dj_intersect_djcomp_ofl_ctrl(), dj_intersection_ofl_ctrl(), and dj_simple_inegs_to_eg().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_dup1()

Pdisjunct dj_dup1 ( Pdisjunct in_dj )

Pdisjunct dj_dup1( (Pdisjunct) in_dj ) AL 31/05/94 1st depth duplication of input disjunction.

Parameters

in_dj n_dj

Definition at line 76 of file disjunct.c.

78 { return( (Pdisjunct) sl_dup1( (Psyslist) in_dj ) ); }

sl_dup1

Psyslist sl_dup1(Psyslist in_sl)

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

Definition: sc_list.c:311

References sl_dup1().

Here is the call graph for this function:

◆ dj_empty()

Pdisjunct dj_empty ( void )

Pdisjunct dj_empty() AL 18/11/93 Returns a disjunction with sc_empty() element.

Definition at line 111 of file disjunct.c.

112 { return (Pdisjunct) sl_append_system(NULL, sc_empty((Pbase) NULL)); }

sc_empty

Psysteme sc_empty(Pbase b)

Psysteme sc_empty(Pbase b): build a Psysteme with one unfeasible constraint to define the empty subsp...

Definition: sc_alloc.c:319

References sc_empty(), and sl_append_system().

Referenced by dj_intersect_djcomp_ofl_ctrl(), dj_intersection_ofl_ctrl(), pa_path_to_disjunct_ofl_ctrl(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), and pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_empty_p()

bool dj_empty_p ( Pdisjunct in_dj )

dj_empty_p( (Ppath) in_pa ) AL 30/05/94 Returns True if in_dj = (1*TCST = 0) ^ (NIL)

Parameters

in_dj n_dj

Definition at line 118 of file disjunct.c.

 {
   return( ( in_dj != DJ_UNDEFINED     )    &&
      ( in_dj->succ == NULL       )    &&
      ( in_dj->psys != NULL       )    &&
      ( sc_empty_p( in_dj->psys ) )       );
 }

References DJ_UNDEFINED, and sc_empty_p().

Referenced by dj_disjunct_complement(), dj_intersect_djcomp_ofl_ctrl(), dj_intersection_ofl_ctrl(), dj_projection_along_variables_ofl_ctrl(), dj_simple_inegs_to_eg(), dj_union(), dj_variable_rename(), dj_variable_substitution_with_eqs_ofl_ctrl(), and pa_feasibility_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_feasibility_ofl_ctrl()

bool dj_feasibility_ofl_ctrl	(	Pdisjunct	in_dj,
		int	ofl_ctrl
	)

bool dj_feasibility_ofl_ctrl( (Pdisjunct) in_dj, (int) ofl_ctrl ) Returns true if in_dj is a feasible disjunction.

AL,BC 23/02/95

Parameters

in_dj	n_dj
ofl_ctrl	fl_ctrl

Definition at line 232 of file disjunct.c.

 {
   bool   ret_bool = false;
   Pdisjunct dj;
  
   if ( in_dj == DJ_UNDEFINED ) return false;
   for( dj = in_dj; dj != NULL && !ret_bool; dj = dj->succ ) {
     if (dj->psys == SC_UNDEFINED) return false;
     ret_bool = ret_bool || 
       sc_rational_feasibility_ofl_ctrl( dj->psys, ofl_ctrl, true );
   }
   return ret_bool;
 }

References DJ_UNDEFINED, Ssyslist::psys, sc_rational_feasibility_ofl_ctrl(), and Ssyslist::succ.

Here is the call graph for this function:

◆ dj_fprint_tab()

void dj_fprint_tab	(	FILE *	,
		Pdisjunct	,
		char *	*)(void,
		int
	)

◆ dj_free()

Pdisjunct dj_free ( Pdisjunct in_dj )

Pdisjunct dj_free( (Pdisjunct) in_dj ) AL 31/05/94 w - 1 depth free of input disjunction.

Parameters

in_dj n_dj

Definition at line 69 of file disjunct.c.

70 { return (Pdisjunct) sl_free( (Psyslist) in_dj ); }

sl_free

Psyslist sl_free(Psyslist psl)

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

Definition: sc_list.c:327

References sl_free().

Referenced by disjunction_to_region_sc(), dj_union(), pa_feasibility_ofl_ctrl(), pa_path_to_disjunct_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), and pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_free1()

Pdisjunct dj_free1 ( Pdisjunct in_dj )

Pdisjunct dj_free1( (Pdisjunct) in_dj ) AL 31/05/94 1st depth free of input disjunction.

Parameters

in_dj n_dj

Definition at line 84 of file disjunct.c.

85 { return (Pdisjunct) sl_free1( (Psyslist) in_dj ); }

sl_free1

Psyslist sl_free1(Psyslist psl)

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

Definition: sc_list.c:343

References sl_free1().

Referenced by disjunction_to_region_sc().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_full()

Pdisjunct dj_full ( void )

Pdisjunct dj_full() AL 18/11/93 Return full space disjunction = dj_new()

Definition at line 92 of file disjunct.c.

92 { return( dj_new() ); }

References dj_new().

Referenced by dj_disjunct_complement(), dj_dup(), dj_intersection_ofl_ctrl(), dj_system_complement(), pa_path_to_disjunct_ofl_ctrl(), and pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_full_p()

bool dj_full_p ( Pdisjunct in_dj )

dj_full_p( (Pdisjunct) in_dj ) AL 30/05/94 Returns True if in_dj = (NIL) ^ (NIL)

Parameters

in_dj n_dj

Definition at line 98 of file disjunct.c.

 {
   return( (in_dj != DJ_UNDEFINED) &&
     ( in_dj->succ == NULL ) &&
     ( in_dj->psys  == NULL ) );
 }

References DJ_UNDEFINED.

Referenced by dj_append_system(), dj_disjunct_complement(), dj_dup(), dj_fprint_tab(), dj_intersect_djcomp_ofl_ctrl(), dj_intersection_ofl_ctrl(), dj_projection_along_variables_ofl_ctrl(), dj_simple_inegs_to_eg(), dj_union(), dj_variable_rename(), and dj_variable_substitution_with_eqs_ofl_ctrl().

Here is the caller graph for this function:

◆ dj_intersect_djcomp_ofl_ctrl()

Pdisjunct dj_intersect_djcomp_ofl_ctrl	(	Pdisjunct	in_dj1,
		Pdisjunct	in_dj2,
		int	ofl_ctrl
	)

Pdisjunct dj_intersect_djcomp_ofl_ctrl( ) No sharing.

in_dj1 and in_dj2 stay as is.

Special cases

debuging

General cases

Parameters

in_dj1	n_dj1
in_dj2	n_dj2
ofl_ctrl	fl_ctrl

Definition at line 173 of file disjunct.c.

 {
   Pdisjunct dj, ret_dj;  
   
   /* Special cases */
   if (DJ_UNDEFINED_P(in_dj1) || DJ_UNDEFINED_P(in_dj2)) return DJ_UNDEFINED;
   
   if (dj_empty_p( in_dj1 ) || dj_full_p(in_dj2)) return dj_empty();
   if (dj_full_p ( in_dj1 ))                      return dj_disjunct_complement( in_dj2 );
   if (dj_empty_p( in_dj2 ))                      return dj_dup( in_dj1 );
   
   /* debuging */
   C3_DEBUG("dj_intersect_djcomp_ofl_ctrl",{
     fprintf(stderr,"Inputs (in_dj1, then in_dj2):");
     dj_fprint_tab(stderr, in_dj1, union_variable_name, 1);
     dj_fprint_tab(stderr, in_dj2, union_variable_name, 1);
   });
  
   /* General cases */
   ret_dj = dj_empty();
   for(dj = in_dj1; dj != NULL; dj = dj->succ ){ 
     Ppath pa = pa_make( dj->psys, (Pcomplist) in_dj2  ); 
     ret_dj   = dj_union( ret_dj, pa_path_to_few_disjunct_ofl_ctrl( pa, ofl_ctrl ) ); 
     free(pa);
   }
   C3_RETURN(IS_DJ, ret_dj);
 }

References C3_DEBUG, C3_RETURN, dj_disjunct_complement(), dj_dup(), dj_empty(), dj_empty_p(), dj_fprint_tab(), dj_full_p(), DJ_UNDEFINED, DJ_UNDEFINED_P, dj_union(), fprintf(), free(), IS_DJ, pa_make(), pa_path_to_few_disjunct_ofl_ctrl(), Ssyslist::psys, Ssyslist::succ, and union_variable_name.

Here is the call graph for this function:

◆ dj_intersect_system_ofl_ctrl()

Pdisjunct dj_intersect_system_ofl_ctrl	(	Pdisjunct	,
		Psysteme	,
		int
	)

◆ dj_intersection_ofl_ctrl()

Pdisjunct dj_intersection_ofl_ctrl	(	Pdisjunct	in_dj1,
		Pdisjunct	in_dj2,
		int	ofl_ctrl
	)

Pdisjunct dj_intersection_ofl_ctrl( in_dj1, in_dj2, ofl_ctrl ) Computes intersection of two disjunctions.

AL,BC 23/03/95 Very costly function : -> sc_faisabilite_ofl_ctrl used. No sharing

empty intersection

Parameters

in_dj1	n_dj1
in_dj2	n_dj2
ofl_ctrl	fl_ctrl

Definition at line 134 of file disjunct.c.

 {
   Pdisjunct dj1, dj2, ret_dj;
   
   if (DJ_UNDEFINED_P(in_dj1)||DJ_UNDEFINED_P(in_dj2)) return DJ_UNDEFINED   ;
   if (dj_full_p(in_dj1) && dj_full_p(in_dj2))         return dj_full()      ;
   if (dj_full_p(in_dj1))                              return dj_dup(in_dj2) ;
   if (dj_full_p(in_dj2))                              return dj_dup(in_dj1) ;
   if (dj_empty_p(in_dj1)||dj_empty_p(in_dj2))         return dj_empty()     ;
   
   ret_dj = (Pdisjunct) NULL; 
   for(dj1 = in_dj1; dj1 != NULL; dj1 = dj1->succ) {
     for(dj2 = in_dj2; dj2 != NULL; dj2 = dj2->succ) {
       Psysteme ps = sc_append( sc_dup(dj1->psys), dj2->psys );
       if (!sc_rational_feasibility_ofl_ctrl( ps, ofl_ctrl, true )) 
    { ps = sc_free( ps ); continue; }
       ret_dj = (Pdisjunct) sl_append_system( ret_dj, ps );
     }
   }
   if (ret_dj == (Pdisjunct) NULL) return dj_empty(); /* empty intersection */
   return ret_dj;
 }

References dj_dup(), dj_empty(), dj_empty_p(), dj_full(), dj_full_p(), DJ_UNDEFINED, DJ_UNDEFINED_P, Ssyslist::psys, sc_append(), sc_dup(), sc_free(), sc_rational_feasibility_ofl_ctrl(), sl_append_system(), and Ssyslist::succ.

Referenced by dj_intersect_system_ofl_ctrl(), and pa_path_to_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_is_system_p()

bool dj_is_system_p ( Pdisjunct in_dj )

bool dj_is_system_p( (Pdisjunct) in_dj ) AL 16/11/93 Returns True if disjunction in_dj has only one Psysteme in it.

Parameters

in_dj n_dj

Definition at line 393 of file disjunct.c.

395 { return( sl_is_system_p( (Psyslist) in_dj ) ); }

sl_is_system_p

bool sl_is_system_p(Psyslist in_sl)

bool sl_is_system_p( (Psyslist) in_sl ) AL 16/11/93 Returns True if syslist in_sl has only one Psyste...

Definition: sc_list.c:230

References sl_is_system_p().

Here is the call graph for this function:

◆ dj_new()

Pdisjunct dj_new ( void )

cproto-generated files

disjunct.c

cproto-generated files

           WARNING

THOSE FUNCTIONS ARE AUTOMATICALLY DERIVED

    FROM THE WEB SOURCES !

Ansi includes
Linear includes
Pdisjunct dj_new() AL 26/10/93 Allocate a new Pdisjunct

Definition at line 52 of file disjunct.c.

52 { return( (Pdisjunct) sl_new() ); }

sl_new

Psyslist sl_new()

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

Definition: sc_list.c:277

References sl_new().

Referenced by dj_append_system(), and dj_full().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_projection_along_variables_ofl_ctrl()

Pdisjunct dj_projection_along_variables_ofl_ctrl	(	Pdisjunct	in_dj,
		Pvecteur	in_pv,
		int	ofl_ctrl
	)

Returns projection of in_dj along vars of in_pv.

Sharing : in_dj is modified

Parameters

in_dj	n_dj
in_pv	n_pv
ofl_ctrl	fl_ctrl

Definition at line 319 of file disjunct.c.

 {
   Pdisjunct dj;
   if DJ_UNDEFINED_P(in_dj) return DJ_UNDEFINED;
   if (dj_empty_p(in_dj)||dj_full_p(in_dj)) return in_dj;
   
   for(dj = in_dj; dj != NULL; dj = dj->succ) 
     { sc_projection_along_variables_ofl_ctrl( &(dj->psys), in_pv, ofl_ctrl ); }
   return in_dj;
 }

References dj_empty_p(), dj_full_p(), DJ_UNDEFINED, DJ_UNDEFINED_P, Ssyslist::psys, and Ssyslist::succ.

Here is the call graph for this function:

◆ dj_read()

Pdisjunct dj_read ( char * nomfic )

void dj_read(FILE*) reads a Pdisjunct

Parameters

nomfic omfic

Definition at line 510 of file disjunct.c.

512 { return ( (Pdisjunct) sl_read(nomfic) ); }

sl_read

Psyslist sl_read(char *nomfic)

void sl_read(FILE*) reads a Psyslist

Definition: sc_list.c:461

References sl_read().

Here is the call graph for this function:

◆ dj_simple_inegs_to_eg()

Pdisjunct dj_simple_inegs_to_eg ( Pdisjunct in_dj )

Pdisjunct dj_simple_inegs_to_eg( in_dj ) transforms two opposite inequalities in a simple equality in each system of the input disjunction.

Input disjunction is not modified.

Special case

General case

Compare with inequalities

Do we have ineq <= 0 and - ineq <= 0 ?

Parameters

in_dj n_dj

Definition at line 339 of file disjunct.c.

 {
   Pdisjunct  dj;
   Pdisjunct  ret_dj = NULL;
  
   /* Special case */
   if (DJ_UNDEFINED_P(in_dj) || dj_empty_p(in_dj) || dj_full_p(in_dj)) 
     return dj_dup(in_dj);
  
   /* General case */
   for( dj = in_dj; dj != NULL; dj = dj->succ) {
     Psysteme     ps = dj->psys, new_ps;
     Pcontrainte  ineq;
     
     assert(!SC_UNDEFINED_P(ps)&&!sc_empty_p(ps)&&!sc_full_p(ps));
     
     if (ps->nb_ineq <= 1) { 
       ret_dj = sl_append_system( ret_dj, sc_dup( ps )); 
       continue; 
     }
  
     /* Compare with inequalities */
     new_ps = sc_make( contraintes_dup(ps->egalites), CONTRAINTE_UNDEFINED );
     for (ineq = ps->inegalites; ineq != NULL; ineq = ineq->succ) {
       Pcontrainte  co, ineq2;
       Pvecteur     pv = vect_dup(ineq->vecteur); 
       vect_chg_sgn        ( pv );
       co    = contrainte_make( pv );
       ineq2 = contrainte_dup(ineq);
  
       /* Do we have ineq <= 0 and - ineq <= 0 ? */ 
       if (contrainte_in_liste(co, ps->inegalites)) {
    if (   !contrainte_in_liste(ineq, new_ps->egalites)
        && !contrainte_in_liste(co,   new_ps->egalites) )
        sc_add_egalite( new_ps, ineq2 );
       }
       else { sc_add_inegalite( new_ps, ineq2 ); }
       co = contrainte_free( co );
     }
  
     new_ps->base = NULL;
     sc_creer_base( new_ps );
     ret_dj = (Pdisjunct) sl_append_system( ret_dj, new_ps );
   }
  
   return ret_dj;
 }

References assert, contrainte_dup(), contrainte_free(), contrainte_in_liste(), contrainte_make(), CONTRAINTE_UNDEFINED, contraintes_dup(), dj_dup(), dj_empty_p(), dj_full_p(), DJ_UNDEFINED_P, Ssysteme::egalites, Ssysteme::inegalites, Ssysteme::nb_ineq, Ssyslist::psys, sc_add_egalite(), sc_add_inegalite(), sc_creer_base(), sc_dup(), sc_empty_p(), sc_full_p(), sc_make(), sl_append_system(), Scontrainte::succ, Ssyslist::succ, vect_chg_sgn(), vect_dup(), and Scontrainte::vecteur.

Referenced by pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_system_complement()

Pdisjunct dj_system_complement ( Psysteme in_ps )

Pdisjunct dj_system_complement( (Psystem) in_ps ) AL 26/10/93 Input : A Psysteme.

Output : A disjunction which is complement of in_ps.

debugging

v1 = 1*TCST to build complement system ...

Look for equalities

Look for inequalities

Parameters

in_ps n_ps

Definition at line 254 of file disjunct.c.

 {
   Pdisjunct       ret_dj = NULL;
   Pvecteur        v1 = NULL, pv = NULL;
   Psysteme        ps = NULL;
   Pcontrainte     eq = NULL, ineq = NULL;
  
   if ( in_ps == SC_UNDEFINED ) return DJ_UNDEFINED;
   if (sc_empty_p(in_ps))       return dj_full();
   
   /* debugging */
   C3_DEBUG("dj_system_complement (in_ps)",
       {sc_fprint(stderr, in_ps, union_variable_name);});
  
  
   /* v1 = 1*TCST to build complement system ... */
   v1 = vect_new( TCST, VALUE_ONE);
   /* Look for equalities */
   for( eq = in_ps->egalites; eq != NULL; eq = eq->succ ) {
     ps     = sc_make( CONTRAINTE_UNDEFINED,
        contrainte_make( vect_add( v1, eq->vecteur ) ) );
     ret_dj =  (Pdisjunct) sl_append_system( ret_dj, ps );
     pv     = vect_dup( eq->vecteur ); vect_chg_sgn( pv );
     ps     = sc_make( CONTRAINTE_UNDEFINED, contrainte_make(vect_add( v1, pv )));
     vect_rm( pv ); pv = NULL;
     ret_dj =  (Pdisjunct) sl_append_system( ret_dj, ps );
     
   }
   /* Look for inequalities */
   for(ineq = in_ps->inegalites; ineq != NULL; ineq = ineq->succ) {
     pv = vect_dup(ineq->vecteur);
     vect_chg_sgn( pv );
     ps = sc_make( CONTRAINTE_UNDEFINED, contrainte_make(vect_add( v1, pv )));
     vect_rm( pv ); pv = NULL;
     ret_dj =  dj_append_system( ret_dj, ps );
   }
    
   vect_rm( v1 );
   C3_RETURN(IS_DJ, ret_dj);
 }

References C3_DEBUG, C3_RETURN, contrainte_make(), CONTRAINTE_UNDEFINED, dj_append_system(), dj_full(), DJ_UNDEFINED, Ssysteme::egalites, eq, Ssysteme::inegalites, IS_DJ, sc_empty_p(), sc_fprint(), sc_make(), sl_append_system(), Scontrainte::succ, TCST, union_variable_name, VALUE_ONE, vect_add(), vect_chg_sgn(), vect_dup(), vect_new(), vect_rm(), and Scontrainte::vecteur.

Referenced by analyze_quast(), dj_disjunct_complement(), pa_path_to_disjunct_ofl_ctrl(), and pa_reduce_simple_complement().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_union()

Pdisjunct dj_union	(	Pdisjunct	in_dj1,
		Pdisjunct	in_dj2
	)

Pdisjunct dj_union( (Pdisjunct) in_dj1, (Pdisjunct) in_dj2 ) Give the union of the two disjunctions.

AL 15/11/93 Memory: systems of the 2 unions are shared. in_dj1 = dj_union(in_dj1,in_dj2); (in_dj1 = dj_free(in_dj1); to remove in_dj1 and in_dj2

Parameters

in_dj1	n_dj1
in_dj2	n_dj2

Definition at line 211 of file disjunct.c.

 {
   Pdisjunct dj;
    
   if (DJ_UNDEFINED_P(in_dj1) || DJ_UNDEFINED_P(in_dj2)) return DJ_UNDEFINED;
   if (dj_empty_p( in_dj2 )) {dj_free(in_dj2); return in_dj1;}
   if (dj_full_p ( in_dj2 )) {dj_free(in_dj1); return in_dj2;}
   if (dj_empty_p( in_dj1 )) {dj_free(in_dj1); return in_dj2;}
   if (dj_full_p ( in_dj1 )) {dj_free(in_dj2); return in_dj1;}
  
   for( dj = in_dj1; dj->succ != NULL; dj = dj->succ) {};
   dj->succ = in_dj2;
   return in_dj1;
 }

References dj_empty_p(), dj_free(), dj_full_p(), DJ_UNDEFINED, DJ_UNDEFINED_P, and Ssyslist::succ.

Referenced by dj_intersect_djcomp_ofl_ctrl(), and pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ dj_variable_rename()

Pdisjunct dj_variable_rename	(	Pdisjunct	in_dj,
		Variable	in_vold,
		Variable	in_vnew
	)

dj_variable_rename replaces in_vold with in_vnew : in_dj is modified

Parameters

in_dj	n_dj
in_vold	n_vold
in_vnew	n_vnew

Definition at line 417 of file disjunct.c.

 { 
   Pdisjunct dj;
   if DJ_UNDEFINED_P(in_dj) return DJ_UNDEFINED;
   if (dj_empty_p(in_dj)||dj_full_p(in_dj)) return in_dj;
   
   for(dj = in_dj; dj != NULL; dj = dj->succ) 
     { sc_variable_rename( dj->psys, in_vold, in_vnew ); }
   return in_dj;
 }

References dj_empty_p(), dj_full_p(), DJ_UNDEFINED, DJ_UNDEFINED_P, Ssyslist::psys, sc_variable_rename(), and Ssyslist::succ.

Here is the call graph for this function:

◆ dj_variable_substitution_with_eqs_ofl_ctrl()

Pdisjunct dj_variable_substitution_with_eqs_ofl_ctrl	(	Pdisjunct	,
		Pcontrainte	,
		Pvecteur	,
		int
	)

◆ pa_convex_hull_equals_union_p_ofl_ctrl()

bool pa_convex_hull_equals_union_p_ofl_ctrl	(	Psysteme	conv_hull,
		Psysteme	ps1,
		Psysteme	ps2,
		int	ofl_ctrl,
		volatile bool	ofl_res
	)

bool pa_convex_hull_equals_union_p(conv_hull, ps1, ps2) input : two Psystems and their convex hull AL,BC 23/03/95 output : true if ps1 U ps2 = convex_hull, false otherwise modifies : nothing comment : complexity = nb_constraints(ps1) * nb_constraints(ps2) if ofl_ctrl = OFL_CTRL, conservatively returns ofl_ctrl when an overflow error occurs

Parameters

conv_hull	onv_hull
ps1	s1
ps2	s2
ofl_ctrl	fl_ctrl
ofl_res	fl_res

Definition at line 937 of file reduc.c.

 {
   volatile Ppath    chemin;
   bool  result;
   int      local_ofl_ctrl = (ofl_ctrl == OFL_CTRL)?FWD_OFL_CTRL:ofl_ctrl;
   
   chemin = pa_make(conv_hull,sl_append_system(sl_append_system(NULL,ps1),ps2));
   
   if (ofl_ctrl==OFL_CTRL) {
    CATCH(overflow_error) {
             result = ofl_res;
         }
         TRY {
             result = !(pa_feasibility_ofl_ctrl(chemin, local_ofl_ctrl));
             UNCATCH(overflow_error);
         }
   }
   else
       result = !(pa_feasibility_ofl_ctrl(chemin, local_ofl_ctrl));
  
   chemin = pa_free1(chemin);
   return(result);
 }

References CATCH, FWD_OFL_CTRL, OFL_CTRL, overflow_error, pa_feasibility_ofl_ctrl(), pa_free1(), pa_make(), sl_append_system(), TRY, and UNCATCH.

Here is the call graph for this function:

◆ pa_dup()

Ppath pa_dup ( Ppath in_pa )

void pa_dup(Ppath pa) AL 30/05/94

Parameters

in_pa n_pa

Definition at line 68 of file path.c.

 {
   if (in_pa == PA_UNDEFINED ) return PA_UNDEFINED;
   return pa_make( sc_dup(in_pa->psys), sl_dup(in_pa->pcomp) );
 }

References pa_make(), PA_UNDEFINED, sc_dup(), and sl_dup().

Here is the call graph for this function:

◆ pa_dup1()

Ppath pa_dup1 ( Ppath in_pa )

void pa_dup1(Ppath pa) AL 30/05/94 1 depth duplication: system and complements are shared.

Parameters

in_pa n_pa

Definition at line 91 of file path.c.

 {
   if (in_pa == PA_UNDEFINED) return PA_UNDEFINED;
   return pa_make( in_pa->psys, sl_dup1(in_pa->pcomp) );
 }

References pa_make(), PA_UNDEFINED, and sl_dup1().

Here is the call graph for this function:

◆ pa_empty()

Ppath pa_empty ( void )

Ppath pa_empty() AL 18/11/93 Returns empty path : pa_empty = sc_empty(NULL) ^ (NIL)

Definition at line 135 of file path.c.

135 { return pa_make(sc_empty(NULL), NULL); }

References pa_make(), and sc_empty().

Referenced by adg_path_possible_source(), pa_intersect_complement(), pa_intersect_system(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), and pa_supress_same_constraints().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_empty_p()

bool pa_empty_p ( Ppath in_pa )

pa_empty_p( (Ppath) in_pa ) AL 18/11/93 Returns True if in_pa = (1*TCST = 0) ^ (NIL)

Parameters

in_pa n_pa

Definition at line 141 of file path.c.

 {
   return( (in_pa != PA_UNDEFINED) &&
     ( in_pa->pcomp == NULL ) &&
     ( in_pa->psys != NULL ) &&
     ( sc_empty_p( in_pa->psys ) ) );
 }

References PA_UNDEFINED, and sc_empty_p().

Referenced by adg_dataflowgraph(), adg_path_possible_source(), pa_feasibility_ofl_ctrl(), pa_intersect_complement(), pa_intersect_system(), pa_max_constraints_nb(), 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(), and pa_transform_eg_in_ineg().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_feasibility_ofl_ctrl()

bool pa_feasibility_ofl_ctrl	(	Ppath	in_pa,
		int	ofl_ctrl
	)

bool pa_feasibility_ofl_ctrl( (Ppath) in_pa, int ofl_ctrl)
Returns true if the input path is possible and false if it is not possible or undefined.

Parameters

in_pa	n_pa
ofl_ctrl	fl_ctrl

Definition at line 309 of file path.c.

 {
   Pdisjunct  dj;
   Ppath      pa;
   bool    ret_bo = false;
 #ifdef TRACE_LINEAR_PATH
   FILE*      report_file;
 #endif 
  
   if ( PA_UNDEFINED_P( in_pa )) return false;
   if ( pa_empty_p    ( in_pa )) return false;
   if ( pa_full_p     ( in_pa )) return true;
   
 #ifdef TRACE_LINEAR_PATH
   /* Just to keep trace of input paths if wanted */
   if (getenv("KEEP_PATH") != (char*) NULL) {
     struct timeval  *tp = (struct timeval*)  malloc(sizeof(struct timeval));
     struct timezone *tz = (struct timezone*) malloc(sizeof(struct timezone));
     int seconds;
     gettimeofday( tp, tz ); seconds = tp->tv_sec;
     report_file = fopen("mail_those_paths_to_arnauld","a");
     pa_fprint( report_file, in_pa, union_variable_name );
     fprintf( report_file, "# %s", ctime( &(seconds) ));
     fprintf( report_file, 
        "# Module:                            \t%s\n", db_get_current_module_name());
     fprintf( report_file, 
        "# Input number of complement:        \t%d\n", sl_length(in_pa->pcomp)     );
     fprintf( report_file, 
        "# Input max constrainst:             \t%d\n", pa_max_constraints_nb(in_pa));
     fflush ( report_file ); free( tp ); free( tz );
   }
 #endif  
  
   pa = pa_supress_same_constraints( in_pa );
   dj = pa_path_to_few_disjunct_ofl_ctrl( pa, ofl_ctrl );
   if( dj_empty_p(dj) || (dj == NULL) ) ret_bo = false;
   else                                 ret_bo = true;
  
  
 #ifdef TRACE_LINEAR_PATH
   /* keep trace of paths */
   if (getenv("KEEP_PATH") != (char*) NULL) {
     fprintf( report_file, 
        "# Output number of disjunctions:     \t%d\n", sl_length(dj)            );
     fprintf( report_file, 
        "# Output max constrainst:            \t%d\n", sl_max_constraints_nb(dj));
     fprintf( report_file, 
        "# Feasible:                          \t%s\n", (ret_bo) ? "YES":"NO"    );
     fclose ( report_file );
   }
 #endif 
  
   pa = pa_free( pa );  dj = dj_free( dj );
   return ret_bo;
 }

References db_get_current_module_name(), dj_empty_p(), dj_free(), fprintf(), free(), malloc(), pa_empty_p(), pa_fprint, pa_free(), pa_full_p(), pa_max_constraints_nb(), pa_path_to_few_disjunct_ofl_ctrl(), pa_supress_same_constraints(), PA_UNDEFINED_P, sl_length(), sl_max_constraints_nb(), and union_variable_name.

Referenced by disjunction_to_region_sc(), pa_convex_hull_equals_union_p_ofl_ctrl(), and pa_inclusion_p_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_fprint_tab()

void pa_fprint_tab	(	FILE *	,
		Ppath	,
		char *	*)(void,
		int
	)

◆ pa_free()

Ppath pa_free ( Ppath in_pa )

Ppath pa_free(Ppath pa) BA, AL 30/05/94.

Parameters

in_pa n_pa

Definition at line 76 of file path.c.

 {
   if (in_pa != PA_UNDEFINED) {
     in_pa->psys  = sc_free(in_pa->psys);
     in_pa->pcomp = sl_free((Psyslist) in_pa->pcomp);
     free( in_pa ); in_pa = PA_UNDEFINED;
   }
   return((Ppath) PA_UNDEFINED);
 }

References free(), PA_UNDEFINED, Spath::psys, sc_free(), and sl_free().

Referenced by pa_feasibility_ofl_ctrl(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), and pa_reduce_simple_complement().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_free1()

Ppath pa_free1 ( Ppath in_pa )

Ppath pa_free1(Ppath pa) BA, AL 30/05/94 1 depth free.

System and complement are not freed.

Parameters

in_pa n_pa

Definition at line 102 of file path.c.

 {
   if (in_pa != PA_UNDEFINED) {
     sl_free1((Psyslist) in_pa->pcomp);
     free( in_pa ); in_pa = PA_UNDEFINED;
   }  
   return((Ppath) PA_UNDEFINED);
 }

References free(), PA_UNDEFINED, and sl_free1().

Referenced by disjunction_to_region_sc(), pa_convex_hull_equals_union_p_ofl_ctrl(), pa_inclusion_p_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), and pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_full()

Ppath pa_full ( void )

Ppath pa_full() AL 18/11/93 Returns full space path : pa_full = pa_new()

Definition at line 117 of file path.c.

117 { return pa_new(); }

pa_new

#define pa_new()

Definition: union-local.h:111

References pa_new.

Referenced by adg_dataflowgraph(), adg_dataflowgraph_with_extremities(), and pa_supress_same_constraints().

Here is the caller graph for this function:

◆ pa_full_p()

bool pa_full_p ( Ppath in_pa )

pa_full_p( (Ppath) in_pa ) AL 18/11/93 Returns True if in_pa = (NIL) ^ (NIL)

Parameters

in_pa n_pa

Definition at line 123 of file path.c.

 {
   return( (in_pa != PA_UNDEFINED) &&
     ( in_pa->pcomp == NULL ) &&
     ( in_pa->psys  == NULL ) );
 }

References PA_UNDEFINED.

Referenced by pa_feasibility_ofl_ctrl(), pa_fprint_tab(), pa_intersect_complement(), pa_intersect_system(), pa_max_constraints_nb(), pa_path_to_disjunct_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), pa_supress_same_constraints(), and pa_transform_eg_in_ineg().

Here is the caller graph for this function:

◆ pa_inclusion_p_ofl_ctrl()

bool pa_inclusion_p_ofl_ctrl	(	Psysteme	ps1,
		Psysteme	ps2,
		int	ofl_ctrl
	)

bool pa_inclusion_p(Psysteme ps1, Psysteme ps2) BA, AL 31/05/94 returns true if ps1 represents a subset of ps2, false otherwise Inspector (no sharing on memory).

Parameters

ps1	s1
ps2	s2
ofl_ctrl	fl_ctrl

Definition at line 868 of file reduc.c.

 {
   bool   result;
   Ppath     chemin = pa_make(ps1, sl_append_system(NULL, ps2));
   
   CATCH(overflow_error) {
     result = false; 
   }
   TRY {
     result = ! (pa_feasibility_ofl_ctrl(chemin, ofl_ctrl));
     UNCATCH(overflow_error);
   }
   chemin = pa_free1(chemin); 
   return(result);
 }

References CATCH, overflow_error, pa_feasibility_ofl_ctrl(), pa_free1(), pa_make(), sl_append_system(), TRY, and UNCATCH.

Referenced by pa_system_equal_p_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_intersect_complement()

Ppath pa_intersect_complement	(	Ppath	in_pa,
		Pcomplement	in_pc
	)

Ppath pa_intersect_complement( (Ppath) in_pa, (Pcomplement) in_pc ) Computes the intersection between in_pa and in_ps.

AL 17/11/93 No sharing

Parameters

in_pa	n_pa
in_pc	n_pc

Definition at line 200 of file path.c.

 {
   Pcomplist  pc;
   Psysteme   ps;
  
   if (PA_UNDEFINED_P(in_pa)||SC_UNDEFINED_P(in_pc)) return PA_UNDEFINED;
   if (pa_empty_p(in_pa))                            return pa_empty();
  
   if (pa_full_p(in_pa)) ps = sc_full(); else  ps = sc_dup(in_pa->psys);
   pc = sl_append_system( sl_dup(in_pa->pcomp), sc_dup(in_pc) );
   return pa_make(ps, pc) ;
 }

References pa_empty(), pa_empty_p(), pa_full_p(), pa_make(), PA_UNDEFINED, PA_UNDEFINED_P, sc_dup(), sc_full(), sl_append_system(), and sl_dup().

Referenced by adg_path_max_source(), adg_path_possible_source(), and adg_update_dfg().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_intersect_system()

Ppath pa_intersect_system	(	Ppath	in_pa,
		Psysteme	in_ps
	)

Ppath pa_intersect_system( (Ppath) in_pa, (Psysteme) in_ps ) Computes the intersection between in_pa and in_ps.

AL 25/04/95 No sharing

Parameters

in_pa	n_pa
in_ps	n_ps

Definition at line 178 of file path.c.

 {
   Psysteme ps;
  
   if (PA_UNDEFINED_P(in_pa)||SC_UNDEFINED_P(in_ps)) 
                             return PA_UNDEFINED;
   if ( pa_empty_p(in_pa) )  return pa_empty();
   if ( pa_full_p(in_pa) )   return pa_make(sc_dup(in_ps),NULL);
   
   ps = sc_normalize(sc_append( sc_dup(in_pa->psys), in_ps ));
   if (ps == NULL){ ps = sc_free(ps); return pa_empty(); }
   return pa_make(ps, sl_dup(in_pa->pcomp));
 }

References pa_empty(), pa_empty_p(), pa_full_p(), pa_make(), PA_UNDEFINED, PA_UNDEFINED_P, sc_append(), sc_dup(), sc_free(), sc_normalize(), and sl_dup().

Referenced by adg_max_of_leaves(), adg_path_max_source(), adg_path_possible_source(), and adg_update_dfg().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_make()

Ppath pa_make	(	Psysteme	in_ps,
		Pcomplist	in_pcomp
	)

path.c

           WARNING

THOSE FUNCTIONS ARE AUTOMATICALLY DERIVED

    FROM THE WEB SOURCES !

Ansi includes
Linear includes
Ppath pa_make(in_ps, in_pcomp) AL 16/11/93 Allocates a Ppath and initialize it with in_ps and in_pcomp SHARING.

Parameters

in_ps	n_ps
in_pcomp	n_pcomp

Definition at line 53 of file path.c.

 {
   Ppath ret_pa = (Ppath) malloc( sizeof( Spath ) );
   if (ret_pa == NULL) {
     (void) fprintf(stderr,"pa_new: Out of memory space\n");
     exit(-1);
   }
   ret_pa->psys = in_ps; ret_pa->pcomp = in_pcomp;
   return ret_pa;
 }

References exit, fprintf(), malloc(), Spath::pcomp, and Spath::psys.

Referenced by disjunction_to_region_sc(), dj_intersect_djcomp_ofl_ctrl(), pa_convex_hull_equals_union_p_ofl_ctrl(), pa_dup(), pa_dup1(), pa_empty(), pa_inclusion_p_ofl_ctrl(), pa_intersect_complement(), pa_intersect_system(), pa_path_to_disjunct_rule4_ofl_ctrl(), pa_path_to_few_disjunct_ofl_ctrl(), pa_read(), pa_reduce_simple_complement(), pa_supress_same_constraints(), and pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_max_constraints_nb()

int pa_max_constraints_nb ( Ppath in_pa )

int pa_max_constraints_nb( (Ppath) in_pa ) Give the maximum constraints nb among systems of in_pa.

Parameters

in_pa n_pa

Definition at line 155 of file path.c.

 {
   Psysteme   ps;
   int        loc, ret_int;
  
   if (PA_UNDEFINED_P(in_pa)||pa_full_p(in_pa)) return 0;
   if ( pa_empty_p(in_pa) )                     return 1;
  
   ps      = in_pa->psys; 
   ret_int = 2*(ps->nb_eq) + ps->nb_ineq;
   loc     = sl_max_constraints_nb( (Psyslist) in_pa->pcomp );
   
   if (loc > ret_int) ret_int = loc;
   return ret_int;
 }

References Ssysteme::nb_eq, Ssysteme::nb_ineq, pa_empty_p(), pa_full_p(), PA_UNDEFINED_P, and sl_max_constraints_nb().

Referenced by pa_feasibility_ofl_ctrl(), and pa_path_to_disjunct_rule4_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_path_to_disjunct_ofl_ctrl()

Pdisjunct pa_path_to_disjunct_ofl_ctrl	(	Ppath	in_pa,
		int	ofl_ctrl
	)

Pdisjunct pa_path_to_disjunct_ofl_ctrl ( (Ppath) in_pa, (int) ofl_ctrl)
Produces a Pdisjunct corresponding to the path Ppath.

No sharing.

comparison between 2 methods

Parameters

in_pa	n_pa
ofl_ctrl	fl_ctrl

Definition at line 374 of file path.c.

 {
   Pdisjunct       ret_dj;
   Pcomplist       comp;
   int             meth1 = 0, meth2 = 1; /* comparison between 2 methods */
  
   if ( in_pa == PA_UNDEFINED )   return DJ_UNDEFINED;
   if (pa_full_p(in_pa))          return dj_full();
   if (pa_empty_p(in_pa))         return dj_empty();
   if ((in_pa->psys != NULL) && 
    sc_empty_p(in_pa->psys)) return dj_empty();
   
   ret_dj = (Pdisjunct) sl_append_system(NULL, sc_dup(in_pa->psys)); 
   for( comp = in_pa->pcomp; comp != NULL; comp = comp->succ) {
     Pdisjunct dj1 = dj_system_complement( comp->psys ); 
     Pdisjunct dj2 = ret_dj;
     int       lg1 = sl_length( dj1 );
     int       lg2 = sl_length( dj2 );
  
     meth1 = meth1 + lg2*lg1 ; meth2 = meth2 * lg1;
  
     ret_dj        = dj_intersection_ofl_ctrl( ret_dj, dj1, ofl_ctrl);
     dj1           = dj_free( dj1 ); dj2 = dj_free( dj2 );
   }
    
   C3_DEBUG("pa_path_to_disjunct_ofl_ctrl", {
     fprintf(stderr, "Feasibility calls with method 1 and 2 : %d\t%d\n", 
       meth1, meth2);  
   });
  
   return( ret_dj );
 }

References C3_DEBUG, dj_empty(), dj_free(), dj_full(), dj_intersection_ofl_ctrl(), dj_system_complement(), DJ_UNDEFINED, fprintf(), pa_empty_p(), pa_full_p(), PA_UNDEFINED, Ssyslist::psys, sc_dup(), sc_empty_p(), sl_append_system(), sl_length(), and Ssyslist::succ.

Referenced by pa_path_to_disjunct_rule4_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_path_to_disjunct_rule4_ofl_ctrl()

Pdisjunct pa_path_to_disjunct_rule4_ofl_ctrl	(	Ppath	in_pa,
		int	ofl_ctrl
	)

Pdisjunct pa_path_to_disjunct_rule4_ofl_ctrl( (Ppath) in_pa, int ofl_ctrl)
Returns the corresponding disjunction according rule 4.

AL 05/16/95 No sharing.

Returns according to different cases

we've modified P0 systeme

Parameters

in_pa	n_pa
ofl_ctrl	fl_ctrl

Definition at line 570 of file reduc.c.

 {
   Pcomplist   comp, lcomp = NULL;
   Pdisjunct   ret_dj  ; 
   Psysteme    systeme ; 
   Ppath       pa      ; 
   int         pa_clength1, pa_clength2; 
  
   if (in_pa == PA_UNDEFINED) return DJ_UNDEFINED;
   if (pa_empty_p(in_pa))     return dj_empty();
  
   C3_DEBUG( "pa_path_to_disjunct_rule4_ofl_ctrl", {
     fprintf(stderr, "\n\n Input path:\n\n");
     pa_fprint(stderr, in_pa, union_variable_name );
   });
  
  
   if (pa_max_constraints_nb(in_pa) > PATH_MAX_CONSTRAINTS) 
     C3_RETURN(IS_DJ, pa_path_to_disjunct_ofl_ctrl( in_pa, ofl_ctrl));
     
   systeme = in_pa->psys;
   if (in_pa->pcomp == NULL) 
     C3_RETURN(IS_DJ, sl_append_system(NULL,sc_dup(systeme)));
  
   for( comp = in_pa->pcomp; comp != NULL; comp = comp->succ ) {
     Psysteme ps;
     if (comp->psys == SC_UNDEFINED) 
       { sl_free(lcomp); C3_RETURN( IS_DJ, DJ_UNDEFINED ); }
  
     ps = sc_dup(comp->psys);
  
     ps = sc_elim_redund_with_first_ofl_ctrl( systeme, ps, ofl_ctrl );
  
     if (sc_empty_p( ps )) { ps = sc_free(ps); continue; }
     if (sc_full_p ( ps ))  
       { ps = sc_free(ps); C3_RETURN( IS_DJ, dj_empty() ); }
  
     lcomp = sl_append_system( lcomp, ps );
   }
  
   pa          = pa_make(sc_dup(in_pa->psys), lcomp); 
   pa_clength1 = sl_length( pa->pcomp );
   pa          = pa_reduce_simple_complement( pa );
   pa_clength2 = sl_length( pa->pcomp );
   systeme     = pa->psys;
  
  
   /* Returns according to different cases */
   if (pa_empty_p(pa)) 
        { ret_dj = dj_empty(); } 
   else if (pa_clength2 == 0) 
        { ret_dj = dj_append_system(NULL,sc_dup(systeme)); } 
   else if (pa_clength1 != pa_clength2)  /* we've modified P0 systeme */
        { ret_dj = pa_path_to_disjunct_rule4_ofl_ctrl( pa, ofl_ctrl); } 
   else { ret_dj = pa_path_to_disjunct_ofl_ctrl( pa, ofl_ctrl); }
  
   pa = pa_free( pa );
  
   C3_RETURN( IS_DJ, ret_dj );
 }

References C3_DEBUG, C3_RETURN, dj_append_system(), dj_empty(), DJ_UNDEFINED, fprintf(), IS_DJ, pa_empty_p(), pa_fprint, pa_free(), pa_make(), pa_max_constraints_nb(), pa_path_to_disjunct_ofl_ctrl(), pa_reduce_simple_complement(), PA_UNDEFINED, PATH_MAX_CONSTRAINTS, Spath::pcomp, Ssyslist::psys, Spath::psys, sc_dup(), sc_elim_redund_with_first_ofl_ctrl(), sc_empty_p(), sc_free(), sc_full_p(), sl_append_system(), sl_free(), sl_length(), Ssyslist::succ, and union_variable_name.

Referenced by pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_path_to_few_disjunct_ofl_ctrl()

Pdisjunct pa_path_to_few_disjunct_ofl_ctrl	(	Ppath	in_pa,
		int	ofl_ctrl
	)

line 1197 "reduc.w"

Pdisjunct pa_path_to_few_disjunct_ofl_ctrl( (Ppath) in_pa, (int) ofl_ctrl )
Produces a Pdisjunct corresponding to the path Ppath and reduces the number of disjunctions. See "Extension de C3 aux Unions de Polyedres" Version 2, for a complete explanation about this function. in_pa is modified. AL 23/03/95

line 1208 "reduc.w"

If it's an empty path or if it has no complements : return

We are looking for a common hyperplan

removes cons_pv and vect_dup(vect_1)

take care of rule 2

Manage memory, free: cons_oppose, common_ps, common_ps_oppose, cons_pv, vect_1, pa1, pa2

Manage memory

Parameters

in_pa	n_pa
ofl_ctrl	fl_ctrl

Definition at line 648 of file reduc.c.

 {
   
 #line 980 "reduc.w"
    Psysteme  systeme;  Pdisjunct ret_dj = DJ_UNDEFINED; 
 #line 1001 "reduc.w"
      Ppath pa; Pcomplist lcomp;
 #line 1040 "reduc.w"
      
   Pcontrainte common_cons = NULL, cons, cons_oppose = NULL; 
   Pvecteur    vect_1, cons_pv = NULL;
   Pcomplist   comp;
   
 #line 1111 "reduc.w"
      
   Pcontrainte common_cons_oppose;
   Psysteme    common_ps, common_ps_oppose;
   Ppath    pa1, pa2; 
   bool     pa1_empty  = false, pa2_empty  = false;
   bool     pa1_filled = false, pa2_filled = false;
   
 #line 1144 "reduc.w"
      Pdisjunct  dj1 = dj_empty(), dj2 = dj_empty(); 
 #line 1214 "reduc.w"
  
  
   
 #line 981 "reduc.w"
   
   C3_DEBUG( "pa_path_to_few_disjunct_ofl_ctrl", {
     fprintf(stderr, "\n\n Input path:\n\n");
     pa_fprint(stderr, in_pa, union_variable_name );
   });
   
   if (PA_UNDEFINED_P( in_pa ))   C3_RETURN(IS_DJ, DJ_UNDEFINED);
   if (pa_full_p     ( in_pa ))   C3_RETURN(IS_DJ, dj_full());
   if (pa_empty_p    ( in_pa ))   C3_RETURN(IS_DJ, dj_empty());
     
   /* If it's an empty path or if it has no complements : return */ 
   systeme = in_pa->psys ; 
   if (!sc_faisabilite_ofl( systeme )) C3_RETURN(IS_DJ,dj_empty());
   if (in_pa->pcomp == NULL) C3_RETURN(IS_DJ,(Pdisjunct) sl_append_system(NULL,sc_dup(systeme)));
   
 #line 1216 "reduc.w"
  
   
 #line 1002 "reduc.w"
   
   pa      = pa_make(sc_dup(systeme), sl_dup(in_pa->pcomp)); 
   pa      = pa_reduce_simple_complement( pa );
   
   if (pa_empty_p(pa)) {pa = pa_free(pa); C3_RETURN(IS_DJ,dj_empty());}
   
   pa      = pa_transform_eg_in_ineg    ( pa ); 
   lcomp   = pa->pcomp ; 
   systeme = pa->psys  ;
   
   C3_DEBUG( "pa_path_to_few_disjunct_ofl_ctrl", {
     fprintf(stderr, "pa:\n");
     pa_fprint_tab(stderr, pa, union_variable_name, 1 );
   });
   
   if ( pa->pcomp == NULL ) { 
     pa     = pa_free1(pa); 
     ret_dj = (Pdisjunct) sl_append_system(NULL, systeme);
     
     C3_DEBUG( "pa_path_to_few_disjunct_ofl_ctrl", {
       fprintf(stderr, "No complement, returning:\n");
       dj_fprint_tab(stderr, ret_dj, union_variable_name, 1 );
     });
     
     return ret_dj;
   }
   
 #line 1217 "reduc.w"
  
   
 #line 1045 "reduc.w"
   
   /* We are looking for a common hyperplan */
   vect_1 = vect_new(TCST, VALUE_ONE); common_cons = NULL;
   
   for(cons = (lcomp->psys)->inegalites;
      (cons != NULL)&&(lcomp->succ != NULL);cons = cons->succ){
     bool is_common = true;
     cons_pv           = vect_dup( cons->vecteur ); vect_chg_sgn( cons_pv );
     cons_oppose       = contrainte_make(vect_add( cons_pv, vect_1 )); 
   
     for(comp = lcomp->succ;(comp != NULL) && is_common; comp = comp->succ){
       Pcontrainte ineg = (comp->psys)->inegalites;
       bool     is_common1, is_common2;
   
       is_common1 = contrainte_in_liste( cons,        ineg );
       is_common2 = contrainte_in_liste( cons_oppose, ineg );
       is_common  = is_common1 || is_common2;
     }
     if (!is_common) { 
       /* removes cons_pv and vect_dup(vect_1) */
       cons_oppose = contrainte_free(cons_oppose);
       vect_rm( cons_pv ); cons_pv = (Pvecteur) NULL;
       continue; 
     }
     common_cons = cons;
     vect_chg_sgn( cons_pv );
     break;
   } 
   
   C3_DEBUG( "pa_path_to_few_disjunct_ofl_ctrl", {
     fprintf(stderr, "cons_pv: ");
     if (common_cons == NULL) fprintf(stderr, "NULL\n"); 
     else vect_fprint(stderr, cons_pv, union_variable_name); 
   });
   
 #line 1218 "reduc.w"
  
   
 #line 1086 "reduc.w"
   
   if( common_cons != NULL ) {
     
 #line 1118 "reduc.w"
     
     common_ps          = sc_make( CONTRAINTE_UNDEFINED, contrainte_make(cons_pv) );
     cons_pv            = vect_dup( common_cons->vecteur ); vect_chg_sgn( cons_pv );
     common_cons_oppose = contrainte_make(vect_add(cons_pv,vect_1));
     common_ps_oppose   = sc_make( CONTRAINTE_UNDEFINED, common_cons_oppose );
     pa1 = pa_new(); pa2= pa_new();
     
     for(comp = lcomp; comp != NULL; comp = comp->succ){
       Psysteme     local_ps;
       Pcontrainte  co = comp->psys->inegalites;
       
       if (!pa1_empty && contrainte_in_liste(common_cons, co)) {
         local_ps = sc_supress_same_constraints( common_ps, comp->psys );
         if (local_ps == SC_EMPTY) { pa1 = pa_empty(); pa1_empty = true; continue;}
         pa1->pcomp = sl_append_system( pa1->pcomp, local_ps ); pa1_filled = true;
       }
       else if(!pa2_empty &&  contrainte_in_liste(common_cons_oppose, co)) {
         local_ps = sc_supress_same_constraints( common_ps_oppose, comp->psys );
         if (local_ps == SC_EMPTY) {pa2 = pa_empty(); pa2_empty = true; continue;}
         pa2->pcomp = sl_append_system( pa2->pcomp, local_ps ); pa2_filled = true;
       }
     }
     
 #line 1088 "reduc.w"
   
     
 #line 1145 "reduc.w"
     
     if (pa1_filled) {
       /* take care of rule 2 */
       if (pa_full_p( pa2 )) pa1->psys = sc_dup( systeme );
       else pa1->psys = sc_safe_append( sc_dup(common_ps), systeme );
     
       C3_DEBUG("pa_path_to_few_disjunct", {
         fprintf(stderr, "pa1:\n");  
         pa_fprint_tab( stderr, pa1, union_variable_name, 1 );
       });
     
       if (pa_full_p(pa2)||sc_faisabilite_ofl(pa1->psys)) 
        {dj_free(dj1);dj1 = pa_path_to_few_disjunct_ofl_ctrl(pa1, ofl_ctrl);}
     
     }
     
     if (pa2_filled) {
       /* take care of rule 2 */
       if (pa_full_p( pa1 )) pa2->psys = sc_dup( systeme );
       else pa2->psys = sc_safe_append( sc_dup(common_ps_oppose), systeme );
     
       C3_DEBUG("pa_path_to_few_disjunct", {
         fprintf(stderr, "pa2:\n");  
         pa_fprint_tab( stderr, pa2, union_variable_name, 1 );
       });
       if (pa_full_p(pa1)||sc_faisabilite_ofl(pa2->psys)) 
        {dj_free(dj2);dj2 = pa_path_to_few_disjunct_ofl_ctrl(pa2, ofl_ctrl);}
     
     
     }
     
     ret_dj = dj_union( dj1, dj2 ); 
     
     /* Manage memory, free:
      * cons_oppose, common_ps, common_ps_oppose, 
      * cons_pv, vect_1, pa1, pa2
      */
     cons_oppose      = contrainte_free( cons_oppose );
     common_ps        = sc_free( common_ps );
     common_ps_oppose = sc_free( common_ps_oppose );
     vect_rm(cons_pv); cons_pv = NULL;
     pa1 = pa_free(pa1);   pa2 = pa_free(pa2); 
     
 #line 1089 "reduc.w"
   
   }
   else { 
     
 #line 1191 "reduc.w"
      ret_dj = pa_path_to_disjunct_rule4_ofl_ctrl( pa, ofl_ctrl ); 
     
 #line 1092 "reduc.w"
   
   }
   
   /* Manage memory */
   pa = pa_free(pa); vect_rm(vect_1); vect_1 = NULL;
   
   C3_RETURN(IS_DJ, ret_dj);
   
 #line 1219 "reduc.w"
  
 }

References C3_DEBUG, C3_RETURN, contrainte_free(), contrainte_in_liste(), contrainte_make(), CONTRAINTE_UNDEFINED, dj_empty(), dj_fprint_tab(), dj_free(), dj_full(), DJ_UNDEFINED, dj_union(), fprintf(), Ssysteme::inegalites, IS_DJ, pa_empty(), pa_empty_p(), pa_fprint, pa_fprint_tab(), pa_free(), pa_free1(), pa_full_p(), pa_make(), pa_new, pa_path_to_disjunct_rule4_ofl_ctrl(), pa_reduce_simple_complement(), pa_transform_eg_in_ineg(), PA_UNDEFINED_P, Spath::pcomp, Ssyslist::psys, Spath::psys, sc_dup(), sc_free(), sc_make(), sc_safe_append(), sc_supress_same_constraints(), sl_append_system(), sl_dup(), Ssyslist::succ, TCST, union_variable_name, VALUE_ONE, vect_add(), vect_chg_sgn(), vect_dup(), vect_fprint(), vect_new(), vect_rm(), and Scontrainte::vecteur.

Referenced by dj_intersect_djcomp_ofl_ctrl(), pa_feasibility_ofl_ctrl(), and pa_system_difference_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_read()

Ppath pa_read ( char * nomfic )

void pa_read(FILE*) reads a Ppath

Parameters

nomfic omfic

Definition at line 438 of file path.c.

 {
   Ppath       ret_pa;
   Psyslist    sl;
  
   sl = sl_read(nomfic);
   if (sl == SL_NULL) return PA_UNDEFINED;
   ret_pa = pa_make(sl->psys, (Pcomplist) sl->succ);
   free( sl );
   return ret_pa;
 }

References free(), pa_make(), PA_UNDEFINED, Ssyslist::psys, SL_NULL, sl_read(), and Ssyslist::succ.

Here is the call graph for this function:

◆ pa_reduce_simple_complement()

Ppath pa_reduce_simple_complement ( Ppath in_pa )

Ppath pa_reduce_simple_complement( (Ppath) in_pa ) AL 16/11/93 Scan all the complement.

If one complement is a simple inequality, its complement is computed and intersected with psys part of in_pa. in_pa is modified. (Sharing with in_pa).

Do we have a simple complement ?

also frees pss

Parameters

in_pa n_pa

Definition at line 222 of file path.c.

 {
   Psysteme      pss;
   Pcomplist pco, pco2 = NULL, tofree = NULL;
   Ppath         ret_pa;
   bool       at_least_one = false ; /* Do we have a simple complement ? */
   
   if( pa_full_p(in_pa) || pa_empty_p(in_pa) || (in_pa == PA_UNDEFINED) ) 
                 return (in_pa);
   
   C3_DEBUG("pa_reduce_simple_complement", {
     fprintf(stderr, "Input path:\n");  
     pa_fprint_tab( stderr, in_pa, union_variable_name, 1 );
   });
  
   pss = in_pa->psys;
   for( pco = in_pa->pcomp, pco2 = NULL; pco != NULL; pco = pco->succ ) {
     Psysteme ps = pco->psys;
     
     if (ps == SC_UNDEFINED) { 
    pco2  = sl_free1(pco2); 
    in_pa = pa_free1(in_pa); 
    return PA_UNDEFINED ; 
     }
     else if (sc_empty_p(ps)) continue;
     else if ((ps->nb_ineq == 1) && (ps->nb_eq == 0)) {
       Pdisjunct dj = dj_system_complement( ps );
       pss          = sc_safe_append( pss, dj->psys );
       tofree       = sl_append_system( tofree, ps );
       dj           = dj_free( dj ); 
       at_least_one = true;
     }
     else { pco2 = (Pcomplist) sl_append_system( pco2, ps ); }
   }
  
   if(!at_least_one) {
     pco2   = sl_free1(pco2);  
     ret_pa = in_pa;
   }
   else if(!sc_faisabilite_ofl(pss)) {
     pco2   = sl_free1( pco2   ); 
     tofree = sl_free1( tofree );
     in_pa  = pa_free ( in_pa  ); /* also frees pss */
     ret_pa = pa_empty(); 
   } 
   else {
     in_pa  = pa_free1( in_pa  ); 
     tofree = sl_free ( tofree );
     ret_pa = pa_make ( pss, pco2 );
   }
  
   C3_RETURN( IS_PA, ret_pa );
 }

References C3_DEBUG, C3_RETURN, dj_free(), dj_system_complement(), false, fprintf(), IS_PA, Ssysteme::nb_eq, Ssysteme::nb_ineq, pa_empty(), pa_empty_p(), pa_fprint_tab(), pa_free(), pa_free1(), pa_full_p(), pa_make(), PA_UNDEFINED, Ssyslist::psys, sc_empty_p(), sc_safe_append(), sl_append_system(), sl_free(), sl_free1(), Ssyslist::succ, and union_variable_name.

Referenced by pa_path_to_disjunct_rule4_ofl_ctrl(), and pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_supress_same_constraints()

Ppath pa_supress_same_constraints ( Ppath in_pa )

Ppath pa_supress_same_constraints( (Ppath) in_pa )
Supress from complements of in_pa same constraints than those in positif Psystem in_pa->psys.

Returned path have no more equalities. AL050795 No sharing, no modification of inputs.

Special cases

debuging

General case

Psysteme ps = sc_supress_same_constraints( positif, comp->psys );

Parameters

in_pa n_pa

Definition at line 528 of file reduc.c.

 {
   Ppath        ret_pa = PA_UNDEFINED;
   Pcomplist    comp;
   Psysteme     positif;
   Psyslist     psl = NULL;
  
   /* Special cases */
   if ( PA_UNDEFINED_P( in_pa )) return PA_UNDEFINED;
   if ( pa_empty_p    ( in_pa )) return pa_empty();
   if ( pa_full_p     ( in_pa )) return pa_full ();
  
   /* debuging */
   C3_DEBUG( "pa_supress_same_constraints", {
     fprintf(stderr, "Input path:\n");
     pa_fprint_tab(stderr, in_pa, union_variable_name, 1);
   });
  
   /* General case */
   positif = in_pa->psys;
   if (!sc_faisabilite_ofl(positif)) return pa_empty();
   
   for( comp = in_pa->pcomp; comp != NULL; comp = comp->succ) {
  /*   Psysteme ps = sc_supress_same_constraints( positif, comp->psys ); */
     Psysteme ps = sc_supress_parallel_redund_constraints( comp->psys, positif );
     if (ps == NULL) 
       {psl = sl_free(psl); ret_pa = pa_empty(); C3_RETURN(IS_PA, ret_pa);}
     else psl = sl_append_system( psl, ps );
   }
  
   positif = sc_dup(positif); sc_transform_eg_in_ineg( positif );
   ret_pa  = pa_make( positif, (Pcomplist) psl );
   C3_RETURN(IS_PA, ret_pa);
 }

References C3_DEBUG, C3_RETURN, fprintf(), IS_PA, pa_empty(), pa_empty_p(), pa_fprint_tab(), pa_full(), pa_full_p(), pa_make(), PA_UNDEFINED, PA_UNDEFINED_P, Ssyslist::psys, sc_dup(), sc_supress_parallel_redund_constraints(), sc_transform_eg_in_ineg(), sl_append_system(), sl_free(), Ssyslist::succ, and union_variable_name.

Referenced by pa_feasibility_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pa_system_difference_ofl_ctrl()

Pdisjunct pa_system_difference_ofl_ctrl	(	Psysteme	ps1,
		Psysteme	ps2,
		int	ofl_ctrl
	)

Pdisjunct pa_system_difference_ofl_ctrl(ps1, ps2) input : two Psystemes output : a disjunction representing ps1 - ps2 modifies : nothing comment : algorihtm : chemin = ps1 inter complement of (ps2) ret_dj = dj_simple_inegs_to_eg( pa_path_to_few_disjunct(chemin) )

Parameters

ps1	s1
ps2	s2
ofl_ctrl	fl_ctrl

Definition at line 908 of file reduc.c.

 {
   Ppath     chemin;
   Pdisjunct dj, ret_dj;
   
   if ((ps1 == SC_UNDEFINED)||(ps2 == SC_UNDEFINED)) return DJ_UNDEFINED; 
   if (sc_empty_p(ps2)) return sl_append_system(NULL,sc_dup(ps1));
   if (sc_empty_p(ps1)) return dj_empty();
   
   chemin  =  pa_make(ps1, sl_append_system(NULL,ps2));
   dj      =  pa_path_to_few_disjunct_ofl_ctrl(chemin, ofl_ctrl);
   chemin  =  pa_free1( chemin );
   ret_dj  =  dj_simple_inegs_to_eg( dj );
   dj      =  dj_free( dj );
   return ret_dj;
 }

References dj_empty(), dj_free(), dj_simple_inegs_to_eg(), DJ_UNDEFINED, pa_free1(), pa_make(), pa_path_to_few_disjunct_ofl_ctrl(), sc_dup(), sc_empty_p(), and sl_append_system().

Here is the call graph for this function:

◆ pa_system_equal_p_ofl_ctrl()

bool pa_system_equal_p_ofl_ctrl	(	Psysteme	ps1,
		Psysteme	ps2,
		int	ofl_ctrl
	)

bool pa_system_equal_p(Psysteme ps1, Psysteme ps2) BA

Parameters

ps1	s1
ps2	s2
ofl_ctrl	fl_ctrl

Definition at line 890 of file reduc.c.

 {
     return (  pa_inclusion_p_ofl_ctrl(ps1,ps2, ofl_ctrl) && 
          pa_inclusion_p_ofl_ctrl(ps2,ps1, ofl_ctrl) );
 }

References pa_inclusion_p_ofl_ctrl().

Here is the call graph for this function:

◆ pa_transform_eg_in_ineg()

Ppath pa_transform_eg_in_ineg ( Ppath in_pa )

Ppath pa_transform_eg_in_ineg( in_pa ) Transforms all equalities of all systems composing in_pa in inequalities and returns in_pa.

in_pa is modified. (Sharing with in_pa).

Parameters

in_pa n_pa

Definition at line 284 of file path.c.

 {
   Pcomplist pco;
  
   if( pa_full_p(in_pa) || pa_empty_p(in_pa) || (in_pa == PA_UNDEFINED) ) 
                 return (in_pa);
   
   sc_transform_eg_in_ineg( in_pa->psys );
   for( pco = in_pa->pcomp; pco != NULL; pco = pco->succ ) 
     { sc_transform_eg_in_ineg( pco->psys ); }
  
   return in_pa;
 }

References pa_empty_p(), pa_full_p(), PA_UNDEFINED, Ssyslist::psys, sc_transform_eg_in_ineg(), and Ssyslist::succ.

Referenced by pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_concatenate()

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 157 of file sc_list.c.

 {
   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);
 }

References Ssysteme::base, Ssysteme::egalites, eq, free(), Ssysteme::inegalites, Ssysteme::nb_eq, Ssysteme::nb_ineq, s1, sc_creer_base(), sc_dup1(), sc_free1(), Scontrainte::succ, and vect_rm().

Here is the call graph for this function:

◆ sc_dup1()

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 72 of file sc_list.c.

 {
   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);
 }

References assert, contrainte_new(), contrainte_vecteur, cp, eq, sc_add_egalite(), sc_add_inegalite(), sc_new(), Scontrainte::succ, vect_dup(), vect_size(), VECTEUR_UNDEFINED, and VECTEUR_UNDEFINED_P.

Referenced by sc_concatenate().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_elim_redund_with_first_ofl_ctrl()

Psysteme sc_elim_redund_with_first_ofl_ctrl	(	Psysteme	in_ps1,
		Psysteme	in_ps2,
		int	ofl_ctrl
	)

Psysteme sc_elim_redund_with_first_ofl_ctrl( in_ps1, in_ps2, ofl_ctrl ) Returns constraints of in_ps2 which cut in_ps1.

AL 06 04 95 It is assumed that in_ps1 and in_ps2 are feasible ! in_ps1 is not modified, in_ps2 is modified.

Return on special cases

debuging

build in_ps1.and.in_ps2 with sharing on in_ps2 This also works if in_ps1 is full space

debuging

update information on ps1

debuging

Normalize 2 inputs systems

returns if there is no intersection

We run over in_ps2 constraints (shared by ps1) and detect redundance

eliminate the constraint from in_ps2, and thus from ps1

Parameters

in_ps1	n_ps1
in_ps2	n_ps2
ofl_ctrl	fl_ctrl

Definition at line 412 of file reduc.c.

 {
   Psysteme    ps1; 
   Pcontrainte prev_eq = NULL, eq, tail = NULL;
   Pbase       pb;
  
   /* Return on special cases */
   if ( sc_full_p(in_ps1) )    return in_ps2;
   if ( in_ps1->nb_ineq == 0 ) return in_ps2;
  
   /* debuging */
   C3_DEBUG("sc_elim_redund_with_first", {
     fprintf(stderr, "\nInput systems, in_ps1, then in_ps2:\n");  
     sc_fprint( stderr, in_ps1, union_variable_name );
     sc_fprint( stderr, in_ps2, union_variable_name );
   });
  
  
   /* build in_ps1.and.in_ps2 with sharing on in_ps2
    * This also works if in_ps1 is full space */
   if ( in_ps2->nb_eq != 0 ) sc_transform_eg_in_ineg( in_ps2 );
   ps1 = sc_dup( in_ps1 );
   for (eq = ps1->inegalites; eq != NULL; tail = eq, eq = eq->succ) {}
   tail->succ = in_ps2->inegalites;
  
   /* debuging */
   C3_DEBUG("sc_elim_redund_with_first", {
     fprintf(stderr, "ps1 old: nb_eq= %d, nb_ineq= %d, dimension= %d, base= \n", 
        ps1->nb_eq, ps1->nb_ineq, ps1->dimension);  
     vect_fprint(stderr, ps1->base, union_variable_name);
     fprintf(stderr, "in_ps2: nb_eq= %d, nb_ineq= %d, dimension= %d, base= \n", 
        in_ps2->nb_eq, in_ps2->nb_ineq, in_ps2->dimension);  
     vect_fprint(stderr, in_ps2->base, union_variable_name);
   });
  
   /* update information on ps1 */
   ps1->nb_eq     = ps1->nb_eq   + in_ps2->nb_eq;
   ps1->nb_ineq   = ps1->nb_ineq + in_ps2->nb_ineq;
   pb             = ps1->base;
   ps1->base      = base_union( ps1->base, in_ps2->base );
   ps1->dimension = vect_size ( ps1->base );
   vect_rm( pb );
  
   /* debuging */
   C3_DEBUG("sc_elim_redund_with_first", {
     fprintf(stderr, "ps1: nb_eq= %d, nb_ineq= %d, dimension= %d, base= \n", 
        ps1->nb_eq, ps1->nb_ineq, ps1->dimension);
     vect_fprint(stderr, ps1->base, union_variable_name);
   });
  
   /* Normalize 2 inputs systems */
   for (eq = ps1->inegalites; eq != NULL; eq=eq->succ)
   {
       vect_normalize(eq->vecteur);
   }
   /* returns if there is no intersection */
   if (!sc_rational_feasibility_ofl_ctrl(ps1, ofl_ctrl, true)) { 
     tail->succ = NULL;  ps1 = sc_free(ps1); 
     in_ps2 = sc_free(in_ps2); in_ps2 = sc_empty(NULL);
     C3_RETURN( IS_SC, in_ps2 ); 
   }
     
  
   /* We run over in_ps2 constraints (shared by ps1) 
    * and detect redundance */
   assert(sc_weak_consistent_p(in_ps2));
   assert(sc_weak_consistent_p(ps1));
   for (eq = tail->succ, prev_eq = tail; eq != NULL; eq = eq->succ)
   {
       contrainte_reverse(eq); 
       assert(sc_weak_consistent_p(ps1));
       C3_DEBUG("sc_elim_redund_with_first", {
      fprintf(stderr, "\nps1:\n");  
      fprintf(stderr, "nb_eq= %d, nb_ineq= %d, dimension= %d\n", 
         ps1->nb_eq, ps1->nb_ineq, ps1->dimension);
      sc_fprint( stderr, ps1, union_variable_name );
       });
  
       if (sc_rational_feasibility_ofl_ctrl(ps1, ofl_ctrl, true))
       {
      contrainte_reverse(eq);
      prev_eq = prev_eq->succ;
       }
       else{  
      /* eliminate the constraint from in_ps2, and thus from ps1 */   
      eq_set_vect_nul(eq);  
      if (in_ps2->inegalites == eq)
          in_ps2->inegalites = eq->succ;
      prev_eq->succ = eq->succ;
      eq->succ = CONTRAINTE_UNDEFINED;
      eq = contrainte_free(eq);
      eq = prev_eq;
      in_ps2->nb_ineq--;
      ps1->nb_ineq--;
      assert(sc_weak_consistent_p(ps1));
      assert(sc_weak_consistent_p(in_ps2));
       }
   }
  
  
   if ( in_ps2->inegalites == NULL ) 
     { in_ps2 = sc_free(in_ps2);  in_ps2 = sc_full(); }
  
   tail->succ = NULL; ps1 = sc_free( ps1 ); 
   C3_RETURN( IS_SC, in_ps2 );
 }

References assert, Ssysteme::base, base_union(), C3_DEBUG, C3_RETURN, contrainte_free(), contrainte_reverse(), CONTRAINTE_UNDEFINED, Ssysteme::dimension, eq, eq_set_vect_nul(), fprintf(), Ssysteme::inegalites, IS_SC, Ssysteme::nb_eq, Ssysteme::nb_ineq, sc_dup(), sc_empty(), sc_fprint(), sc_free(), sc_full(), sc_full_p(), sc_rational_feasibility_ofl_ctrl(), sc_transform_eg_in_ineg(), sc_weak_consistent_p(), Scontrainte::succ, union_variable_name, vect_fprint(), vect_normalize(), vect_rm(), vect_size(), and Scontrainte::vecteur.

Referenced by pa_path_to_disjunct_rule4_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_free()

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 112 of file sc_list.c.

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

sc_rm

void sc_rm(Psysteme ps)

void sc_rm(Psysteme ps): liberation de l'espace memoire occupe par le systeme de contraintes ps;

Definition: sc_alloc.c:277

References sc_rm().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_free1()

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 121 of file sc_list.c.

 {
   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 );
 }

References free(), Scontrainte::succ, and vect_rm().

Referenced by sc_concatenate().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_full()

Psysteme sc_full ( void )

Psysteme sc_full() similar to sc_new.

Definition at line 58 of file sc_list.c.

58 { return sc_new(); }

References sc_new().

Referenced by pa_intersect_complement(), and sc_elim_redund_with_first_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_full_p()

bool sc_full_p ( Psysteme in_ps )

Psysteme sc_full_p( in_ps ) similar to sc_new.

Parameters

in_ps n_ps

Definition at line 61 of file sc_list.c.

63 { return( (in_ps->nb_eq == 0) && (in_ps->nb_ineq == 0) &&

64 (in_ps->egalites == NULL) && (in_ps->inegalites == 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().

Here is the caller graph for this function:

◆ sc_supress_parallel_redund_constraints()

Psysteme sc_supress_parallel_redund_constraints	(	Psysteme	in_ps1,
		Psysteme	in_ps2
	)

Psysteme sc_supress_parallel_redund_constraints( in_ps1, in_ps2 ) input: 2 Psystemes in_ps1 and in_ps2 output: in_ps1 / in_ps2 (cut operation on polyhedrons) memory: Inspector (nothing is shared, nor modified, output allocated).

comment: Supress in dup(in_ps2) parallel constraints that are redundant relatively to in_ps1. Returned Psysteme have only inequalities.

debuging

Transforms equalities in inequalities if necessary

Compare with inequalities

update base and normalize

Manage memory and return

Parameters

in_ps1	n_ps1
in_ps2	n_ps2

Definition at line 255 of file reduc.c.

 {
   Psysteme        ps1, ps2,  ret_ps = NULL;
   Pcontrainte     ineq1, ineqs2;
   bool         stop = false, dup1 = false, dup2 = false;
   
   if ( in_ps1 == SC_RN ) return sc_dup(in_ps2);
   
   /* debuging */
   C3_DEBUG("sc_supress_parallel_constraints", {
     fprintf(stderr, "Input systems, in_ps1, then in_ps2:\n");  
     sc_fprint( stderr, in_ps1, union_variable_name );
     sc_fprint( stderr, in_ps2, union_variable_name );
   });
   
  
   /* Transforms equalities in inequalities if necessary */
   if (in_ps1->nb_eq != 0) 
     { ps1 = sc_dup( in_ps1 ); sc_transform_eg_in_ineg( ps1 ); dup1 = true; }
   else ps1 = in_ps1;
  
   if (in_ps2->nb_eq != 0) 
     { ps2 = sc_dup( in_ps2 ); sc_transform_eg_in_ineg( ps2 ); dup2 = true; }
   else ps2 = in_ps2;
  
  
   /* Compare with inequalities */
   ineqs2 = ps2->inegalites;
  
   for (ineq1 = ps1->inegalites; ineq1 != NULL && !stop; ineq1 = ineq1->succ) {
     enum hspara_elem  sk = contrainte_parallel_in_liste( ineq1, ineqs2 );
     switch (sk) 
       {
       case keep:
    if (ret_ps != NULL){ sc_add_inegalite( ret_ps, contrainte_dup(ineq1) ); }
    else ret_ps = sc_make( NULL, contrainte_dup(ineq1) );
    break;
       case empty:
    ret_ps = sc_free(ret_ps);
    ret_ps = sc_empty(NULL);
    stop = true; 
    break;
       case full: continue; break;
       default:  
    {
      fprintf(stderr, "%s supress_kind == %d should not appear !",
         "[sc_supress_parallel_redund_constraints]", (int) sk ); 
      abort();
    } 
       }
       
   }
  
   /* update base and normalize */  
   if ((ret_ps != NULL) && !sc_empty_p(ret_ps))  { 
     vect_rm(ret_ps->base); 
     ret_ps->base = NULL; sc_creer_base( ret_ps );
     ret_ps = sc_normalize( ret_ps );
   }
  
   /* Manage memory and return */
   ps1 = (dup1)? sc_free(ps1) : ps1;
   ps2 = (dup2)? sc_free(ps2) : ps2;
   C3_RETURN( IS_SC, ret_ps );
 }

References abort, Ssysteme::base, C3_DEBUG, C3_RETURN, contrainte_dup(), contrainte_parallel_in_liste(), empty, fprintf(), full, Ssysteme::inegalites, IS_SC, keep, sc_add_inegalite(), sc_creer_base(), sc_dup(), sc_empty(), sc_empty_p(), sc_fprint(), sc_free(), sc_make(), sc_normalize(), sc_transform_eg_in_ineg(), Scontrainte::succ, union_variable_name, and vect_rm().

Referenced by pa_supress_same_constraints().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sc_supress_same_constraints()

Psysteme sc_supress_same_constraints	(	Psysteme	in_ps1,
		Psysteme	in_ps2
	)

Psysteme sc_supress_same_constraints( in_ps1, in_ps2 ) supress in in_ps2 constraints that are in in_ps1.

Nothing is shared, nor modified. Returned Psysteme have only inequalities. This function should be superseded by sc_supress_parallel_redund_contraints

Compare with equalities a == 0 <=> a <= 0 and -a <= 0

add co to returned inegs

add eq to returned inegs

add co and eq to returned inegs

Compare with inequalities

Parameters

in_ps1	n_ps1
in_ps2	n_ps2

Definition at line 329 of file reduc.c.

 {
   Psysteme        ret_ps = NULL;
   Pcontrainte     eq, ineq;
   
   if ( in_ps1 == SC_RN ) return sc_dup(in_ps2);
   
   C3_DEBUG("sc_supress_same_constraints", {
     fprintf(stderr, "\nInput systems, in_ps1, then in_ps2:\n");  
     sc_fprint( stderr, in_ps1, union_variable_name );
     sc_fprint( stderr, in_ps2, union_variable_name );
   });
  
   /* Compare with equalities a == 0   <=>   a <= 0 and -a <= 0 */
   for (eq = in_ps2->egalites; eq != NULL; eq = eq->succ) {
     Pcontrainte  co, eq2;
     Pvecteur     pv;
     bool      eq_in_ineq, co_in_ineq;
  
     if (contrainte_in_liste(eq, in_ps1->egalites)) continue;
     
     pv = vect_dup(eq->vecteur); 
     vect_chg_sgn        ( pv );
     co = contrainte_make( pv );
     if (contrainte_in_liste(co, in_ps1->egalites ))
       { co = contrainte_free( co ); continue; }
  
  
     eq_in_ineq = contrainte_in_liste(eq, in_ps1->inegalites);
     co_in_ineq = contrainte_in_liste(co, in_ps1->inegalites);
     
     if (eq_in_ineq && co_in_ineq) { 
       co = contrainte_free( co ); 
     }
     else if (eq_in_ineq) { /* add co to returned inegs */
       if (ret_ps != NULL){ sc_add_inegalite( ret_ps, co ); }
       else ret_ps = sc_make( NULL, co );
     }
     else if (co_in_ineq) { /* add eq to returned inegs */
       eq2 = contrainte_dup(eq);
       if (ret_ps != NULL){ sc_add_inegalite( ret_ps, eq2 ); }
       else ret_ps = sc_make( NULL, eq2 );
       co = contrainte_free( co ); 
     }
     else { /* add co and eq to returned inegs */
       eq2 = contrainte_dup(eq);
       if (ret_ps != NULL){ sc_add_inegalite( ret_ps, eq2 ); }
       else ret_ps = sc_make( NULL, eq2 );
       sc_add_inegalite( ret_ps, co );
     }
   }
  
   /* Compare with inequalities */
   for (ineq = in_ps2->inegalites; ineq != NULL; ineq = ineq->succ) {
     Pcontrainte io;
     if (contrainte_in_liste(ineq, in_ps1->inegalites)) continue;
     if (contrainte_in_liste(ineq, in_ps1->egalites))   continue;
     io = contrainte_dup( ineq ); contrainte_chg_sgn( io );
     if (contrainte_in_liste(io, in_ps1->egalites)) {
       io = contrainte_free(io);  
       continue;
     }
     
     if (ret_ps != NULL){ sc_add_inegalite( ret_ps, contrainte_dup(ineq) ); }
     else ret_ps = sc_make( NULL, contrainte_dup(ineq) );
     io = contrainte_free(io);  
   }
   
   if (ret_ps != NULL) 
     { vect_rm(ret_ps->base); ret_ps->base = NULL; sc_creer_base( ret_ps );}
   
   ret_ps = sc_normalize( ret_ps );
   C3_RETURN( IS_SC, ret_ps );
 }

References Ssysteme::base, C3_DEBUG, C3_RETURN, contrainte_chg_sgn(), contrainte_dup(), contrainte_free(), contrainte_in_liste(), contrainte_make(), eq, eq_in_ineq(), fprintf(), IS_SC, sc_add_inegalite(), sc_creer_base(), sc_dup(), sc_fprint(), sc_make(), sc_normalize(), Scontrainte::succ, union_variable_name, vect_chg_sgn(), vect_dup(), vect_rm(), and Scontrainte::vecteur.

Referenced by pa_path_to_few_disjunct_ofl_ctrl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_append_system()

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 240 of file sc_list.c.

 {
   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 );
 }

References 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().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_append_system_first()

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 256 of file sc_list.c.

 {
   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 );
 }

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

Here is the call graph for this function:

◆ sl_dup()

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 296 of file sc_list.c.

 {
   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;
 }

References 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().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_dup1()

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 311 of file sc_list.c.

 {
   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;
 }

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

Referenced by dj_dup1(), and pa_dup1().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_fprint()

void sl_fprint	(	FILE *	,
		Psyslist	,
		char *	*)(void
	)

◆ sl_fprint_tab()

void sl_fprint_tab	(	FILE *	,
		Psyslist	,
		char *	*)(void,
		int
	)

◆ sl_free()

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 327 of file sc_list.c.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_free1()

Psyslist sl_free1 ( Psyslist psl )

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

Parameters

psl sl

Definition at line 343 of file sc_list.c.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_get_tab_string()

char* sl_get_tab_string ( int in_tab )

char* sl_get_tab_string( in_tab ) returns a string of in_tab \t

Parameters

in_tab n_tab

Definition at line 366 of file sc_list.c.

 {
   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);
 }

References assert, and strdup().

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_init_lex()

void sl_init_lex ( void )

◆ sl_is_system_p()

bool sl_is_system_p ( Psyslist in_sl )

bool 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 230 of file sc_list.c.

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

References sl_length().

Referenced by dj_is_system_p().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_length()

bool 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 193 of file sc_list.c.

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

References 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().

Here is the caller graph for this function:

◆ sl_max_constraints_nb()

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 207 of file sc_list.c.

 { 
   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; 
 }

References if(), Ssysteme::nb_eq, Ssysteme::nb_ineq, and sc_empty_p().

Referenced by pa_feasibility_ofl_ctrl(), and pa_max_constraints_nb().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_new()

Psyslist sl_new ( void )

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

Output : An empty syslist.

Definition at line 277 of file sc_list.c.

 {
   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);
 }

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_read()

Psyslist sl_read ( char * nomfic )

void sl_read(FILE*) reads a Psyslist

Parameters

nomfic omfic

Definition at line 461 of file sc_list.c.

 {
   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 );
 }

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

Referenced by dj_read(), and pa_read().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ sl_set_variable_name()

void sl_set_variable_name ( char * *)(void )

◆ slx_alloc()

void* slx_alloc ( yy_size_t )

◆ slx_error()

int slx_error ( char * s )

procedure minimum de recouvrement d'erreurs

Definition at line 1702 of file sl_gram.c.

 {
   /* procedure minimum de recouvrement d'erreurs */
   int c;
   (void) fprintf(stderr, "%s near %s\n",s, slx_text);
   while ((c = getchar()) != EOF) putchar(c);
   syntax_error = true;
   return 0;
 }

References fprintf(), slx_text, and syntax_error.

Here is the call graph for this function:

◆ slx_free()

void slx_free ( void * )

◆ slx_get_debug()

int slx_get_debug ( void )

◆ slx_get_in()

FILE* slx_get_in ( void )

◆ slx_get_leng()

int slx_get_leng ( void )

◆ slx_get_lineno()

int slx_get_lineno ( void )

◆ slx_get_out()

FILE* slx_get_out ( void )

◆ slx_get_text()

char* slx_get_text ( void )

◆ slx_lex()

int slx_lex ( void )

◆ slx_lex_destroy()

int slx_lex_destroy ( void )

◆ slx_parse()

int slx_parse ( void )

◆ slx_pop_buffer_state()

void slx_pop_buffer_state ( void )

◆ slx_realloc()

void* slx_realloc	(	void *	,
		yy_size_t
	)

◆ slx_restart()

void slx_restart ( FILE * )

◆ slx_set_debug()

void slx_set_debug ( int )

◆ slx_set_in()

void slx_set_in ( FILE * )

◆ slx_set_lineno()

void slx_set_lineno ( int )

◆ slx_set_out()

void slx_set_out ( FILE * )

◆ slx_wrap()

int slx_wrap ( void )

◆ un_fprint_tab()

void un_fprint_tab	(	FILE *	,
		char *	,
		char *	*)(void,
		int	,
		int
	)

◆ vect_parallel()

enum hspara_elem vect_parallel	(	Pvecteur	in_v1,
		Pvecteur	in_v2
	)

reduc.c

complexity: length(in_v1) * length(in_v2) comment: in_v1 = a1 X + b1 represents a1 X+b1 <= 0 and in_v2 a2 X + b2 <=0. if (a1!=a2) || (a1!=-a2), returns unpara else if (a1==a2), return sign(b2-b1) in ss part of hspara else if (a1==-a2), return sign(-b2-b1) in op part of hspara.

gcd of each vector

length of each vector without TCST

value of TCST and their diff

debuging

get gcd of each vector and constant linked to TCST

Determine what kind of parallel hyperplane we are in

coefficient value was 0 and was not represented

compute return value

debuging

Parameters

in_v1	n_v1
in_v2	n_v2

Definition at line 49 of file reduc.c.

 {
   Pvecteur            v1, v2;
   enum hspara_elem    ret_sle = unpara;
   bool             first     = true;
   bool             same_sign = false;
   Value                 gcd1, gcd2;   /* gcd of each vector                 */
   int                 l1, l2;   /* length of each vector without TCST */
   Value               b1, b2, diff; /* value of TCST and their diff       */
  
   if (!in_v1 || !in_v2) return unpara;
  
   /* debuging */
   /*
   C3_DEBUG("vect_parallel", {
     fprintf(stderr, "Input vectors, in_v1, then in_v2:\n");  
     vect_fprint( stderr, in_v1, union_variable_name );
     vect_fprint( stderr, in_v2, union_variable_name );
   });
   */
  
  
   /* get gcd of each vector and constant linked to TCST */
  
   l1 = 0; b1 = 0; gcd1 = value_abs(val_of(in_v1));
   for (v1 = in_v1; v1 != NULL; v1 = v1->succ) {
     gcd1 = pgcd( gcd1, value_abs(val_of(v1)) );
     if(var_of(v1)==TCST) b1 = val_of(v1); 
     else l1++;
   }
  
   l2 = 0; b2 = 0; gcd2 = value_abs(val_of(in_v2));
   for (v2 = in_v2; v2 != NULL; v2 = v2->succ) {
     gcd2 = pgcd( gcd2, value_abs(val_of(v2)) );
     if(var_of(v2)==TCST) b2 = val_of(v2);
     else l2++;
   }
  
   if (l1 != l2)    return unpara ;
  
   
   /* Determine what kind of parallel hyperplane we are in */
   for (v2 = in_v2; v2 != NULL; v2 = v2->succ) {
     Variable  var2  = var_of(v2);
     Value     val2  = val_of(v2);
     bool   found = false;
  
     if (var2 == TCST) continue;
  
     for (v1 = in_v1; v1 != NULL; v1 = v1->succ) {
       if (var_of(v1) == var2) {
    Value      i1 = value_mult(gcd2,val_of(v1));
    Value     i2 = value_mult(gcd1,val2);
    bool  ss = value_eq(i1,i2);
    bool  op = value_eq(i1,value_uminus(i2));
    
    if (!ss && !op) return unpara;
    if (first) {first = false; same_sign = (ss)?ss:op ;}
    if ((same_sign && op)||(!same_sign && ss)) return unpara; 
    found = true;
       }
     }
  
     /* coefficient value was 0 and was not represented */
     if(!found) return unpara;  
   }
    
  
   /* compute return value */
   {
       Value p1 = value_mult(gcd1,b2),
             p2 = value_uminus(value_mult(gcd2,b1));
       diff = (same_sign)? value_plus(p1,p2): value_minus(p2,p1);
   }
   if      (value_zero_p(diff)) ret_sle = (same_sign) ? sszero  : opzero  ;
   else if (value_pos_p(diff)) ret_sle = (same_sign) ? ssplus  : opplus  ;
   else if (value_neg_p(diff)) ret_sle = (same_sign) ? ssminus : opminus ;
   else ret_sle = unpara;
  
   /* debuging */
   /*
   C3_DEBUG("vect_parallel", 
      { fprintf(stderr, "Output hspara: %s\n", hspara_to_string(ret_sle));  });
   */
  
   return ret_sle;
 }

Variable Documentation

◆ ba_yacc

Pbase ba_yacc

extern

Definition at line 113 of file sl_gram.c.

◆ sl_yacc

Psyslist sl_yacc

extern

Definition at line 113 of file sl_gram.c.

◆ slx__flex_debug

int slx__flex_debug

extern

◆ slx_char

int slx_char

extern

◆ slx_in

FILE* slx_in

extern

◆ slx_leng

int slx_leng

extern

sl_lex.c

◆ slx_lineno

int slx_lineno

extern

◆ slx_nerrs

int slx_nerrs

extern

◆ slx_out

FILE* slx_out

extern

◆ slx_text

char* slx_text

extern

◆ syntax_error

bool syntax_error

extern

sl_gram.c

Definition at line 95 of file sl_gram.c.

Referenced by slx_error().

◆ union_variable_name

char*(* union_variable_name) (Variable) ( Variable )

extern

sc_list.c

           WARNING

THOSE FUNCTIONS ARE AUTOMATICALLY DERIVED

    FROM THE WEB SOURCES !

Ansi includes
Linear includes

Definition at line 220 of file union.h.

Referenced by 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().

◆ va_yacc

Variable va_yacc

extern

Definition at line 113 of file sl_gram.c.

◆ valcst

Value valcst

extern

Definition at line 96 of file sl_gram.c.

Data Structures

Macros

Typedefs

Enumerations

Functions

Variables

Macro Definition Documentation

◆ C3_DEBUG

◆ C3_RETURN

◆ CO_UNDEFINED

◆ dj_faisabilite

◆ dj_faisabilite_ofl

◆ dj_feasibility

◆ dj_fprint

◆ dj_intersect_djcomp

◆ dj_intersect_system

◆ dj_intersection

◆ dj_projection_along_variables

◆ DJ_UNDEFINED

◆ DJ_UNDEFINED_P

◆ dj_variable_substitution_with_eqs

◆ IS_DJ

◆ is_dj_empty_p

◆ is_dj_full_p

◆ IS_PA

◆ is_pa_empty_p

◆ is_pa_full_p

◆ IS_SC

◆ is_sc_my_empty_p

◆ IS_SL

◆ my_sc_empty

◆ my_sc_full

◆ pa_convex_hull_equals_union_p

◆ pa_faisabilite

◆ pa_faisabilite_ofl

◆ pa_feasibility

◆ pa_fprint

◆ pa_inclusion_p

◆ pa_new

◆ pa_path_dup_to_disjunct

◆ pa_path_to_disjunct

◆ pa_path_to_disjunct_ofl

◆ pa_path_to_disjunct_rule4

◆ pa_path_to_few_disjunct

◆ pa_system_difference [1/2]

◆ pa_system_difference [2/2]

◆ pa_system_equal_p

◆ PA_UNDEFINED

◆ PA_UNDEFINED_P

◆ PATH_MAX_CONSTRAINTS

◆ sc_convex_hull_equals_union_p

◆ sc_convex_hull_equals_union_p_ofl

◆ sc_convex_hull_equals_union_p_ofl_ctrl

◆ sc_difference

◆ sc_elim_redund_with_first

◆ sc_equal_p

◆ sc_equal_p_ofl

◆ sc_equal_p_ofl_ctrl

◆ sc_inclusion_p

◆ sc_inclusion_p_ofl

◆ sc_inclusion_p_ofl_ctrl

◆ SL_NULL

◆ UN_EMPTY_SPACE

◆ un_fprint

◆ UN_FULL_SPACE

◆ UN_UNDEFINED

Typedef Documentation

◆ Pcomplement

◆ Pcomplist

◆ Pdisjunct

◆ Ppath

◆ Psyslist

◆ Punion

◆ Scomplement

◆ Scomplist

◆ Sdisjunct

◆ Spath

◆ Ssyslist

◆ Sunion

Enumeration Type Documentation