#include <stdio.h>
#include <limits.h>
#include "boolean.h"
#include "arithmetic_errors.h"

Include dependency graph for arithmetique.h:

Data Structures
struct	frac

struct	col

Macros
#define	CURRENT_FUNCTION "<unknown>"
	Warning! Do not modify this file that is automatically generated! More...

#define	PUSH_TIMEOUT_ENV(env) push_timeout_env(env, CURRENT_FUNCTION, __FILE__, __LINE__)

#define	POP_TIMEOUT_ENV(env) pop_timeout_env(env, CURRENT_FUNCTION, __FILE__, __LINE__)

#define	PUSH_TIMEOUT(delay) push_timeout(delay, CURRENT_FUNCTION, __FILE__, __LINE__)

#define	POP_TIMEOUT() pop_timeout(CURRENT_FUNCTION, __FILE__, __LINE__)

#define	__LONG_LONG_MAX__ 9223372036854775807LL
	put there because I cannot have these constants with ansi options. More...

#define	LONG_LONG_MAX __LONG_LONG_MAX__

#define	LONG_LONG_MIN (-LONG_LONG_MAX-1)

#define	ULONG_LONG_MAX (LONG_LONG_MAX * 2ULL + 1)

#define	LINEAR_VALUE_STRING "int"
	default: LINEAR_VALUE_IS_INT More...

#define	VALUE_FMT "%d"

#define	VALUE_CONST(val) (val)

#define	VALUE_NAN INT_MIN

#define	VALUE_MIN (INT_MIN+1)

#define	VALUE_MAX INT_MAX

#define	VALUE_ZERO 0

#define	VALUE_ONE 1

#define	VALUE_MONE -1

#define	VALUE_TO_LONG(val) ((long)(val))

#define	VALUE_TO_INT(val) ((int)(val))

#define	VALUE_TO_FLOAT(val) ((float)(val))

#define	VALUE_TO_DOUBLE(val) ((double)(val))

#define	int_to_value(i) ((Value)(i))
	end LINEAR_VALUE_IS_INT More...

#define	long_to_value(l) ((Value)(l))

#define	float_to_value(f) ((Value)(f))

#define	double_to_value(d) ((Value)(d))

#define	value_eq(v1, v2) ((v1)==(v2))
	bool operators on values More...

#define	value_ne(v1, v2) ((v1)!=(v2))

#define	value_gt(v1, v2) ((v1)>(v2))

#define	value_ge(v1, v2) ((v1)>=(v2))

#define	value_lt(v1, v2) ((v1)<(v2))

#define	value_le(v1, v2) ((v1)<=(v2))

#define	value_sign(v) (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)
	trian operators on values More...

#define	value_compare(v1, v2) (value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)

#define	value_plus(v1, v2) ((v1)+(v2))
	binary operators on values More...

#define	value_div(v1, v2) ((v1)/(v2))

#define	value_mod(v1, v2) ((v1)%(v2))

#define	value_direct_multiply(v1, v2) ((v1)(v2)) /direct! /

#define	value_minus(v1, v2) ((v1)-(v2))

#define	value_pdiv(v1, v2) (divide(v1,v2))

#define	value_pmod(v1, v2) (modulo(v1,v2))

#define	value_min(v1, v2) (value_le(v1,v2)? (v1): (v2))

#define	value_max(v1, v2) (value_ge(v1,v2)? (v1): (v2))

#define	value_or(v1, v2) ((v1)\|(v2))

#define	value_and(v1, v2) ((v1)&(v2))

#define	value_lshift(v1, v2) ((v1)<<(v2))

#define	value_rshift(v1, v2) ((v1)>>(v2))

#define	value_assign(ref, val) (ref=(val))
	assigments More...

#define	value_addto(ref, val) (ref+=(val))

#define	value_increment(ref) (ref++)

#define	value_direct_product(ref, val) (ref=(val)) /direct! /

#define	value_multiply(ref, val) value_assign(ref,value_mult(ref,val))

#define	value_substract(ref, val) (ref-=(val))

#define	value_decrement(ref) (ref--)

#define	value_division(ref, val) (ref/=(val))

#define	value_modulus(ref, val) (ref%=(val))

#define	value_pdivision(ref, val) value_assign(ref,value_pdiv(ref,val))

#define	value_oppose(ref) value_assign(ref,value_uminus(ref))

#define	value_absolute(ref) value_assign(ref,value_abs(ref))

#define	value_minimum(ref, val) value_assign(ref,value_min(ref,val))

#define	value_maximum(ref, val) value_assign(ref,value_max(ref,val))

#define	value_orto(ref, val) (ref \|= (val))

#define	value_andto(ref, val) (ref &= (val))

#define	value_uminus(val) (-(val))
	unary operators on values More...

#define	value_not(val) (~(val))

#define	value_abs(val)

#define	value_pos_p(val) value_gt(val,VALUE_ZERO)

#define	value_neg_p(val) value_lt(val,VALUE_ZERO)

#define	value_posz_p(val) value_ge(val,VALUE_ZERO)

#define	value_negz_p(val) value_le(val,VALUE_ZERO)

#define	value_zero_p(val) value_eq(val,VALUE_ZERO)

#define	value_notzero_p(val) value_ne(val,VALUE_ZERO)

#define	value_one_p(val) value_eq(val,VALUE_ONE)

#define	value_notone_p(val) value_ne(val,VALUE_ONE)

#define	value_mone_p(val) value_eq(val,VALUE_MONE)

#define	value_notmone_p(val) value_ne(val,VALUE_MONE)

#define	value_min_p(val) value_eq(val,VALUE_MIN)

#define	value_max_p(val) value_eq(val,VALUE_MAX)

#define	value_notmin_p(val) value_ne(val,VALUE_MIN)

#define	value_notmax_p(val) value_ne(val,VALUE_MAX)

#define	value_protected_hard_idiv_multiply(v, w, throw)
	(\|v\| < MAX / \|w\|) => vw is okay I could check ((vw)/w)==v but a tmp would be useful More...

#define	value_protected_multiply(v, w, throw) value_protected_hard_idiv_multiply(v,w,throw)
	is a software idiv is assumed, quick check performed first More...

#define	value_protected_mult(v, w) value_protected_multiply(v,w,THROW(overflow_error))
	protected versions More...

#define	value_protected_product(v, w) v=value_protected_mult(v,w)

#define	value_mult(v, w)
	whether the default is protected or not this define makes no sense any more... More...

#define	value_product(v, w) v=value_mult(v,w)

#define	ABS(x) (((x)>=0) ? (x) : -(x))
	was: #define value_mult(v,w) value_direct_multiply(v,w) #define value_product(v,w) value_direct_product(v,w) could be: protected versions... More...

#define	MIN(x, y) (((x)>=(y))?(y):(x))
	minimum and maximum if they are defined somewhere else, they are very likely to be defined the same way. More...

#define	MAX(x, y) (((x)>=(y))?(x):(y))

#define	SIGN(x) (((x)>0)? 1 : ((x)==0? 0 : -1))
	signe d'un entier: -1, 0 ou 1 More...

#define	DIVIDE(x, y)
	division avec reste toujours positif basee sur les equations: a/(-b) = - (a/b) (-a)/b = - ((a+b-1)/b) ou a et b sont des entiers positifs More...

#define	POSITIVE_DIVIDE(x, y) ((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))
	division avec reste toujours positif quand y est positif: assert(y>=0) More...

#define	MODULO(x, y) ((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))
	modulo a resultat toujours positif More...

#define	POSITIVE_MODULO(x, y)
	modulo par rapport a un nombre positif: assert(y>=0) More...

#define	pgcd(a, b) pgcd_slow(a,b)
	Pour la recherche de performance, selection d'une implementation particuliere des fonctions. More...

#define	divide(a, b) DIVIDE(a,b)

#define	modulo(a, b) MODULO(a,b)

#define	_has_yy_size_t

Typedefs
typedef int	Value

typedef struct col	tableau

typedef size_t	yy_size_t

Functions
void	__attribute__ ((weak, noreturn)) throw_exception(const int

Value	abs_ofl_ctrl (Value, int)
	_has_yy_size_t More...

Value	absval_ofl (Value)
	int absval_ofl(int i): absolute value of i (SUN version) More...

Value	absval (Value)
	int absval(int i): absolute value of i (SUN version) More...

Value	divide_fast (Value, Value)
	divide.c More...

Value	divide_slow (Value, Value)

Value	exponentiate (Value, int)
	exp.c More...

Value	modulo_fast (Value, Value)
	modulo.c More...

Value	pgcd_slow (Value, Value)
	pgcd.c More...

Value	pgcd_fast (Value, Value)
	int pgcd_fast(int a, int b): calcul iteratif du pgcd de deux entiers; le pgcd retourne est toujours positif; il n'est pas defini si a et b sont nuls (abort); More...

Value	pgcd_interne (Value, Value)
	int pgcd_interne(int a, int b): calcul iteratif du pgcd de deux entiers strictement positifs tels que a > b; le pgcd retourne est toujours positif; More...

Value	gcd_subtract (Value, Value)
	int gcd_subtract(int a, int b): find the gcd (pgcd) of two integers More...

Value	vecteur_bezout (Value[], Value[], int)
	int vecteur_bezout(int u[], int v[], int l): calcul du vecteur v qui verifie le theoreme de bezout pour le vecteur u; les vecteurs u et v sont de dimension l More...

Value	bezout (Value, Value, Value , Value )
	int bezout(int a, int b, int x, int y): calcule x et y, les deux nombres qui verifient le theoreme de Bezout pour a et b; le pgcd de a et b est retourne par valeur More...

Value	bezout_grl (Value, Value, Value , Value )
	int bezout_grl(int a, int b, int x, int y): calcule x et y, les deux entiers quelconcs qui verifient le theoreme de Bezout pour a et b; le pgcd de a et b est retourne par valeur More...

Value	ppcm (Value, Value)
	ppcm.c More...

void	print_Value (Value)
	io.c More...

void	fprint_Value (FILE *, Value)

void	fprint_string_Value (FILE , char , Value)

void	sprint_Value (char *, Value)

int	fscan_Value (FILE , Value )

int	scan_Value (Value *)

int	sscan_Value (char , Value )

char *	Value_to_string (Value)

char const *	get_exception_name (const linear_exception_t)

void	linear_reset_error_counters (void)
	reset linear counters More...

unsigned int	linear_error_count (void)
	return number of linear errors may be used as a test after a reset to know whether new errors occured. More...

void	linear_get_error_counts (unsigned int , unsigned int , unsigned int *)
	return various errors counts through unsigned int pointer overflow, simplex & misc (aka others) NULL pointers are ignored More...

void	set_exception_callbacks (exception_callback_t, exception_callback_t)

void	dump_exception_stack_to_file (FILE *)

void	dump_exception_stack (void)

jmp_buf *	linear_push_exception_on_stack (const int, const char , const char , const int)

jmp_buf *	push_exception_on_stack (const int, const char , const char , const int)

void	linear_pop_exception_from_stack (const int, const char , const char , const int)

void	pop_exception_from_stack (const int, const char , const char , const int)

void	linear_throw_exception (const int, const char , const char , const int)

void	throw_exception (const int, const char , const char , const int)

void	linear_initialize_exception_stack (unsigned int, exception_callback_t, exception_callback_t)

bool	linear_with_gmp (void)
	whether linear can use gmp (i.e. More...

bool	linear_require_gmp (void)
	whether linear is asked to use gmp if possible (env variable) More...

bool	linear_use_gmp (void)
	whether linear is to use gmp More...

void	set_timeout_callback (timeout_callback_f)

void	push_timeout (const unsigned int, const char , const char , const int)

bool	push_timeout_env (const char , const char , const char *, const int)

void	pop_timeout (const char , const char , const int)

void	pop_timeout_env (const char , const char , const char *, const int)

int	value_comparison (Value, Value)
	value.c More...

Variables
void const char const char const	int

int	linear_assertion_result
	errors.c More...

linear_exception_t	the_last_just_thrown_exception

int	linear_number_of_exception_thrown

Macro Definition Documentation

◆ __LONG_LONG_MAX__

#define __LONG_LONG_MAX__ 9223372036854775807LL

put there because I cannot have these constants with ansi options.

would fix on solaris: #define LONG_LONG_MAX LLONG_MAX #define LONG_LONG_MIN LLONG_MIN

Definition at line 98 of file arithmetique.h.

◆ _has_yy_size_t

#define _has_yy_size_t

Definition at line 597 of file arithmetique.h.

◆ ABS

#define ABS ( x ) (((x)>=0) ? (x) : -(x))

was: #define value_mult(v,w) value_direct_multiply(v,w) #define value_product(v,w) value_direct_product(v,w) could be: protected versions...

LINEAR_VALUE_IS_CHARS is used for type checking. some operations are not allowed on (char*), thus they are switched to some other operation here... valeur absolue

Definition at line 537 of file arithmetique.h.

◆ CURRENT_FUNCTION

#define CURRENT_FUNCTION "<unknown>"

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

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

Francois Irigoin, mai 1989

Modifications

reprise de DIVIDE qui etait faux (Remi Triolet, Francois Irigoin, april 90)
simplification de POSITIVE_DIVIDE par suppression d'un modulo We would like linear to be generic about the "integer" type used to represent integer values. Thus Value is defined here. It should be changed to "int" "long" or "long long". In an ideal world, any source modification should be limited to this package.

Indeed, we cannot switch easily to bignums that need constructors dans destructors... That would lead to too many modifications... C++ would make things easier and cleaner...

Fabien COELHO for FILE * to be included for _MIN and _MAX: include <limits.h>

Definition at line 72 of file arithmetique.h.

◆ divide

#define divide	(	a,
		b
	)	DIVIDE(a,b)

Definition at line 584 of file arithmetique.h.

◆ DIVIDE

#define DIVIDE	(	x,
		y
	)

Value:

((y)>0? POSITIVE_DIVIDE(x,y) : \

-POSITIVE_DIVIDE((x),(-(y))))

POSITIVE_DIVIDE

#define POSITIVE_DIVIDE(x, y)

division avec reste toujours positif quand y est positif: assert(y>=0)

Definition: arithmetique.h:564

x

static char * x

Definition: split_file.c:159

division avec reste toujours positif basee sur les equations: a/(-b) = - (a/b) (-a)/b = - ((a+b-1)/b) ou a et b sont des entiers positifs

Definition at line 560 of file arithmetique.h.

◆ double_to_value

#define double_to_value ( d ) ((Value)(d))

Definition at line 328 of file arithmetique.h.

◆ float_to_value

#define float_to_value ( f ) ((Value)(f))

Definition at line 327 of file arithmetique.h.

◆ int_to_value

#define int_to_value ( i ) ((Value)(i))

end LINEAR_VALUE_IS_INT

cast to value

Definition at line 325 of file arithmetique.h.

◆ LINEAR_VALUE_STRING

#define LINEAR_VALUE_STRING "int"

default: LINEAR_VALUE_IS_INT

Definition at line 303 of file arithmetique.h.

◆ LONG_LONG_MAX

#define LONG_LONG_MAX __LONG_LONG_MAX__

Definition at line 101 of file arithmetique.h.

◆ LONG_LONG_MIN

#define LONG_LONG_MIN (-LONG_LONG_MAX-1)

Definition at line 103 of file arithmetique.h.

◆ long_to_value

#define long_to_value ( l ) ((Value)(l))

Definition at line 326 of file arithmetique.h.

◆ MAX

#define MAX	(	x,
		y
	)	(((x)>=(y))?(x):(y))

Definition at line 548 of file arithmetique.h.

◆ MIN

#define MIN	(	x,
		y
	)	(((x)>=(y))?(y):(x))

minimum and maximum if they are defined somewhere else, they are very likely to be defined the same way.

Thus the previous def is not overwritten.

Definition at line 545 of file arithmetique.h.

◆ modulo

#define modulo	(	a,
		b
	)	MODULO(a,b)

Definition at line 586 of file arithmetique.h.

◆ MODULO

#define MODULO	(	x,
		y
	)	((y)>0 ? POSITIVE_MODULO(x,y) : POSITIVE_MODULO(-x,-y))

modulo a resultat toujours positif

Definition at line 567 of file arithmetique.h.

◆ pgcd

#define pgcd	(	a,
		b
	)	pgcd_slow(a,b)

Pour la recherche de performance, selection d'une implementation particuliere des fonctions.

Definition at line 582 of file arithmetique.h.

◆ POP_TIMEOUT

#define POP_TIMEOUT ( ) pop_timeout(CURRENT_FUNCTION, __FILE__, __LINE__)

Definition at line 85 of file arithmetique.h.

◆ POP_TIMEOUT_ENV

#define POP_TIMEOUT_ENV ( env ) pop_timeout_env(env, CURRENT_FUNCTION, __FILE__, __LINE__)

Definition at line 79 of file arithmetique.h.

◆ POSITIVE_DIVIDE

#define POSITIVE_DIVIDE	(	x,
		y
	)	((x)>0 ? (x)/(y) : - (-(x)+(y)-1)/(y))

division avec reste toujours positif quand y est positif: assert(y>=0)

Definition at line 564 of file arithmetique.h.

◆ POSITIVE_MODULO

#define POSITIVE_MODULO	(	x,
		y
	)

Value:

((x) > 0 ? (x)%(y) : \

((x)%(y) == 0 ? 0 : ((y)-(-(x))%(y))))

modulo par rapport a un nombre positif: assert(y>=0)

Ce n'est pas la macro la plus efficace que j'aie jamais ecrite: il faut faire, dans le pire des cas, deux appels a la routine .rem, qui n'est surement pas plus cablee que la division ou la multiplication

Definition at line 575 of file arithmetique.h.

◆ PUSH_TIMEOUT

#define PUSH_TIMEOUT ( delay ) push_timeout(delay, CURRENT_FUNCTION, __FILE__, __LINE__)

Definition at line 82 of file arithmetique.h.

◆ PUSH_TIMEOUT_ENV

#define PUSH_TIMEOUT_ENV ( env ) push_timeout_env(env, CURRENT_FUNCTION, __FILE__, __LINE__)

Definition at line 76 of file arithmetique.h.

◆ SIGN

#define SIGN ( x ) (((x)>0)? 1 : ((x)==0? 0 : -1))

signe d'un entier: -1, 0 ou 1

Definition at line 552 of file arithmetique.h.

◆ ULONG_LONG_MAX

#define ULONG_LONG_MAX (LONG_LONG_MAX * 2ULL + 1)

Definition at line 105 of file arithmetique.h.

◆ value_abs

#define value_abs ( val )

Value:

  ((value_posz_p(val) ?              (val) :                            \
    (value_ne((val), VALUE_NAN) ?     value_uminus(val) :               \
     (THROW (overflow_error), VALUE_NAN ))))

Definition at line 387 of file arithmetique.h.

◆ value_absolute

#define value_absolute ( ref ) value_assign(ref,value_abs(ref))

Definition at line 377 of file arithmetique.h.

◆ value_addto

#define value_addto	(	ref,
		val
	)	(ref+=(val))

Definition at line 367 of file arithmetique.h.

◆ value_and

#define value_and	(	v1,
		v2
	)	((v1)&(v2))

Definition at line 360 of file arithmetique.h.

◆ value_andto

#define value_andto	(	ref,
		val
	)	(ref &= (val))

Definition at line 381 of file arithmetique.h.

◆ value_assign

#define value_assign	(	ref,
		val
	)	(ref=(val))

assigments

Definition at line 366 of file arithmetique.h.

◆ value_compare

#define value_compare	(	v1,
		v2
	)	(value_eq(v1,v2)?0:value_lt(v1,v2)?-1:1)

Definition at line 342 of file arithmetique.h.

◆ VALUE_CONST

#define VALUE_CONST ( val ) (val)

Definition at line 306 of file arithmetique.h.

◆ value_decrement

#define value_decrement ( ref ) (ref--)

Definition at line 372 of file arithmetique.h.

◆ value_direct_multiply

#define value_direct_multiply	(	v1,
		v2
	)	((v1)(v2)) /direct! /

Definition at line 353 of file arithmetique.h.

◆ value_direct_product

#define value_direct_product	(	ref,
		val
	)	(ref=(val)) /direct! /

Definition at line 369 of file arithmetique.h.

◆ value_div

#define value_div	(	v1,
		v2
	)	((v1)/(v2))

Definition at line 351 of file arithmetique.h.

◆ value_division

#define value_division	(	ref,
		val
	)	(ref/=(val))

Definition at line 373 of file arithmetique.h.

◆ value_eq

#define value_eq	(	v1,
		v2
	)	((v1)==(v2))

bool operators on values

Definition at line 332 of file arithmetique.h.

◆ VALUE_FMT

#define VALUE_FMT "%d"

Definition at line 305 of file arithmetique.h.

◆ value_ge

#define value_ge	(	v1,
		v2
	)	((v1)>=(v2))

Definition at line 335 of file arithmetique.h.

◆ value_gt

#define value_gt	(	v1,
		v2
	)	((v1)>(v2))

Definition at line 334 of file arithmetique.h.

◆ value_increment

#define value_increment ( ref ) (ref++)

Definition at line 368 of file arithmetique.h.

◆ value_le

#define value_le	(	v1,
		v2
	)	((v1)<=(v2))

Definition at line 337 of file arithmetique.h.

◆ value_lshift

#define value_lshift	(	v1,
		v2
	)	((v1)<<(v2))

Definition at line 361 of file arithmetique.h.

◆ value_lt

#define value_lt	(	v1,
		v2
	)	((v1)<(v2))

Definition at line 336 of file arithmetique.h.

◆ VALUE_MAX

#define VALUE_MAX INT_MAX

Definition at line 309 of file arithmetique.h.

◆ value_max

#define value_max	(	v1,
		v2
	)	(value_ge(v1,v2)? (v1): (v2))

Definition at line 358 of file arithmetique.h.

◆ value_max_p

#define value_max_p ( val ) value_eq(val,VALUE_MAX)

Definition at line 405 of file arithmetique.h.

◆ value_maximum

#define value_maximum	(	ref,
		val
	)	value_assign(ref,value_max(ref,val))

Definition at line 379 of file arithmetique.h.

◆ VALUE_MIN

#define VALUE_MIN (INT_MIN+1)

Definition at line 308 of file arithmetique.h.

◆ value_min

#define value_min	(	v1,
		v2
	)	(value_le(v1,v2)? (v1): (v2))

Definition at line 357 of file arithmetique.h.

◆ value_min_p

#define value_min_p ( val ) value_eq(val,VALUE_MIN)

Definition at line 404 of file arithmetique.h.

◆ value_minimum

#define value_minimum	(	ref,
		val
	)	value_assign(ref,value_min(ref,val))

Definition at line 378 of file arithmetique.h.

◆ value_minus

#define value_minus	(	v1,
		v2
	)	((v1)-(v2))

Definition at line 354 of file arithmetique.h.

◆ value_mod

#define value_mod	(	v1,
		v2
	)	((v1)%(v2))

Definition at line 352 of file arithmetique.h.

◆ value_modulus

#define value_modulus	(	ref,
		val
	)	(ref%=(val))

Definition at line 374 of file arithmetique.h.

◆ VALUE_MONE

#define VALUE_MONE -1

Definition at line 312 of file arithmetique.h.

◆ value_mone_p

#define value_mone_p ( val ) value_eq(val,VALUE_MONE)

Definition at line 402 of file arithmetique.h.

◆ value_mult

#define value_mult	(	v,
		w
	)

Value:

value_protected_multiply(v,w, \

(fprintf(stderr,"[value_mult] value overflow!\n"),THROW(overflow_error)))

value_protected_multiply

#define value_protected_multiply(v, w, throw)

is a software idiv is assumed, quick check performed first

Definition: arithmetique.h:429

fprintf

int fprintf()

test sc_min : ce test s'appelle par : programme fichier1.data fichier2.data ...

whether the default is protected or not this define makes no sense any more...

well, doesn't matter. FC. I do enforce the protection whatever requested:-) prints out a message and throws the exception, hoping that some valid CATCH waits for it upwards.

Definition at line 452 of file arithmetique.h.

◆ value_multiply

#define value_multiply	(	ref,
		val
	)	value_assign(ref,value_mult(ref,val))

Definition at line 370 of file arithmetique.h.

◆ VALUE_NAN

#define VALUE_NAN INT_MIN

Definition at line 307 of file arithmetique.h.

◆ value_ne

#define value_ne	(	v1,
		v2
	)	((v1)!=(v2))

Definition at line 333 of file arithmetique.h.

◆ value_neg_p

#define value_neg_p ( val ) value_lt(val,VALUE_ZERO)

Definition at line 393 of file arithmetique.h.

◆ value_negz_p

#define value_negz_p ( val ) value_le(val,VALUE_ZERO)

Definition at line 395 of file arithmetique.h.

◆ value_not

#define value_not ( val ) (~(val))

Definition at line 386 of file arithmetique.h.

◆ value_notmax_p

#define value_notmax_p ( val ) value_ne(val,VALUE_MAX)

Definition at line 407 of file arithmetique.h.

◆ value_notmin_p

#define value_notmin_p ( val ) value_ne(val,VALUE_MIN)

Definition at line 406 of file arithmetique.h.

◆ value_notmone_p

#define value_notmone_p ( val ) value_ne(val,VALUE_MONE)

Definition at line 403 of file arithmetique.h.

◆ value_notone_p

#define value_notone_p ( val ) value_ne(val,VALUE_ONE)

Definition at line 401 of file arithmetique.h.

◆ value_notzero_p

#define value_notzero_p ( val ) value_ne(val,VALUE_ZERO)

Definition at line 399 of file arithmetique.h.

◆ VALUE_ONE

#define VALUE_ONE 1

Definition at line 311 of file arithmetique.h.

◆ value_one_p

#define value_one_p ( val ) value_eq(val,VALUE_ONE)

Definition at line 400 of file arithmetique.h.

◆ value_oppose

#define value_oppose ( ref ) value_assign(ref,value_uminus(ref))

Definition at line 376 of file arithmetique.h.

◆ value_or

#define value_or	(	v1,
		v2
	)	((v1)\|(v2))

Definition at line 359 of file arithmetique.h.

◆ value_orto

#define value_orto	(	ref,
		val
	)	(ref \|= (val))

Definition at line 380 of file arithmetique.h.

◆ value_pdiv

#define value_pdiv	(	v1,
		v2
	)	(divide(v1,v2))

Definition at line 355 of file arithmetique.h.

◆ value_pdivision

#define value_pdivision	(	ref,
		val
	)	value_assign(ref,value_pdiv(ref,val))

Definition at line 375 of file arithmetique.h.

◆ value_plus

#define value_plus	(	v1,
		v2
	)	((v1)+(v2))

binary operators on values

pdiv and pmod always return a positive remainder and a positive modulo. E.g. -1/100 = -1 and its remainder is 99. The modulo operator is periodic and not symmetric around zero.

Definition at line 350 of file arithmetique.h.

◆ value_pmod

#define value_pmod	(	v1,
		v2
	)	(modulo(v1,v2))

Definition at line 356 of file arithmetique.h.

◆ value_pos_p

#define value_pos_p ( val ) value_gt(val,VALUE_ZERO)

Definition at line 392 of file arithmetique.h.

◆ value_posz_p

#define value_posz_p ( val ) value_ge(val,VALUE_ZERO)

Definition at line 394 of file arithmetique.h.

◆ value_product

#define value_product	(	v,
		w
	)	v=value_mult(v,w)

Definition at line 455 of file arithmetique.h.

◆ value_protected_hard_idiv_multiply

#define value_protected_hard_idiv_multiply	(	v,
		w,
		throw
	)

Value:

  ((value_zero_p(w) || value_zero_p(v))? VALUE_ZERO:            \
   value_lt(value_abs(v),value_div(VALUE_MAX,value_abs(w)))?    \
   value_direct_multiply(v,w): (throw, VALUE_NAN))

(|v| < MAX / |w|) => v*w is okay I could check ((v*w)/w)==v but a tmp would be useful

Definition at line 416 of file arithmetique.h.

◆ value_protected_mult

#define value_protected_mult	(	v,
		w
	)	value_protected_multiply(v,w,THROW(overflow_error))

protected versions

Definition at line 435 of file arithmetique.h.

◆ value_protected_multiply

#define value_protected_multiply	(	v,
		w,
		throw
	)	value_protected_hard_idiv_multiply(v,w,throw)

is a software idiv is assumed, quick check performed first

Definition at line 429 of file arithmetique.h.

◆ value_protected_product

#define value_protected_product	(	v,
		w
	)	v=value_protected_mult(v,w)

Definition at line 437 of file arithmetique.h.

◆ value_rshift

#define value_rshift	(	v1,
		v2
	)	((v1)>>(v2))

Definition at line 362 of file arithmetique.h.

◆ value_sign

#define value_sign ( v ) (value_eq(v,VALUE_ZERO)?0:value_lt(v,VALUE_ZERO)?-1:1)

trian operators on values

Definition at line 341 of file arithmetique.h.

◆ value_substract

#define value_substract	(	ref,
		val
	)	(ref-=(val))

Definition at line 371 of file arithmetique.h.

◆ VALUE_TO_DOUBLE

#define VALUE_TO_DOUBLE ( val ) ((double)(val))

Definition at line 316 of file arithmetique.h.

◆ VALUE_TO_FLOAT

#define VALUE_TO_FLOAT ( val ) ((float)(val))

Definition at line 315 of file arithmetique.h.

◆ VALUE_TO_INT

#define VALUE_TO_INT ( val ) ((int)(val))

Definition at line 314 of file arithmetique.h.

◆ VALUE_TO_LONG

#define VALUE_TO_LONG ( val ) ((long)(val))

Definition at line 313 of file arithmetique.h.

◆ value_uminus

#define value_uminus ( val ) (-(val))

unary operators on values

Definition at line 385 of file arithmetique.h.

◆ VALUE_ZERO

#define VALUE_ZERO 0

Definition at line 310 of file arithmetique.h.

◆ value_zero_p

#define value_zero_p ( val ) value_eq(val,VALUE_ZERO)

Definition at line 396 of file arithmetique.h.

Typedef Documentation

◆ tableau

typedef struct col tableau

◆ Value

typedef int Value

Definition at line 304 of file arithmetique.h.

◆ yy_size_t

typedef size_t yy_size_t

Definition at line 598 of file arithmetique.h.

Function Documentation

◆ attribute()

void __attribute__ ( (weak, noreturn) ) const

◆ abs_ofl_ctrl()

Value abs_ofl_ctrl	(	Value	i,
		int	ofl_ctrl
	)

_has_yy_size_t

end of arithmetique-local.h cproto-generated files abs.c

_has_yy_size_t

FC.

Parameters

ofl_ctrl fl_ctrl

Definition at line 38 of file abs.c.

 {
     
     if ((ofl_ctrl == 1) && value_eq(i,VALUE_MIN))
         THROW(overflow_error);
         
     assert(value_ne(i,VALUE_MIN));
     return value_pos_p(i)? i: value_uminus(i);
 }

References assert, overflow_error, THROW, value_eq, VALUE_MIN, value_ne, value_pos_p, and value_uminus.

Referenced by absval(), and absval_ofl().

Here is the caller graph for this function:

◆ absval()

Value absval ( Value i )

int absval(int i): absolute value of i (SUN version)

Definition at line 58 of file abs.c.

 {
     return abs_ofl_ctrl(i, 0);
 }

References abs_ofl_ctrl().

Here is the call graph for this function:

◆ absval_ofl()

Value absval_ofl ( Value i )

int absval_ofl(int i): absolute value of i (SUN version)

Definition at line 50 of file abs.c.

 {
     return abs_ofl_ctrl(i, 1);
 }

References abs_ofl_ctrl().

Here is the call graph for this function:

◆ bezout()

Value bezout	(	Value	a,
		Value	b,
		Value *	x,
		Value *	y
	)

int bezout(int a, int b, int *x, int *y): calcule x et y, les deux nombres qui verifient le theoreme de Bezout pour a et b; le pgcd de a et b est retourne par valeur

a * x + b * y = gcd(a,b) return gcd(a,b)

Definition at line 265 of file pgcd.c.

 {
     Value u0=VALUE_ONE,u1=VALUE_ZERO,v0=VALUE_ZERO,v1=VALUE_ONE;
     Value a0,a1,u,v,r,q,c;
  
     if (value_ge(a,b))
     {
         a0 = a;
         a1 = b;
         c = VALUE_ZERO;
     }
     else
     {
         a0 = b;
         a1 = a;
         c = VALUE_ONE;
     }
         
     r = value_mod(a0,a1);
     while (value_notzero_p(r))
     {
         q = value_div(a0,a1);
         u = value_mult(u1,q);
         u = value_minus(u0,u);
  
         v = value_mult(v1,q);
         v = value_minus(v0,v);
         a0 = a1; a1 = r;
         u0 = u1; u1 = u;
         v0 = v1; v1 = v;
  
         r = value_mod(a0,a1);
     }
   
     if (value_zero_p(c)) {
         *x = u1;
         *y = v1;
     }
     else {
         *x = v1;
         *y = u1;
     }
  
        return(a1);
 }

References value_div, value_ge, value_minus, value_mod, value_mult, value_notzero_p, VALUE_ONE, VALUE_ZERO, value_zero_p, and x.

Referenced by vecteur_bezout().

Here is the caller graph for this function:

◆ bezout_grl()

Value bezout_grl	(	Value	a,
		Value	b,
		Value *	x,
		Value *	y
	)

int bezout_grl(int a, int b, int *x, int *y): calcule x et y, les deux entiers quelconcs qui verifient le theoreme de Bezout pour a et b; le pgcd de a et b est retourne par valeur

a * x + b * y = gcd(a,b) return gcd(a,b) gcd () >=0 le pre et le post conditions de pgcd sont comme la fonction gcd_subtract(). les situations speciaux sont donnes ci_dessous: si (a==0 et b==0) x=y=0; gcd()=0, si (a==0)(ou b==0) x=1(ou -1) y=0 (ou x=0 y=1(ou -1)) et gcd()=a(ou -a) (ou gcd()=b(ou -b))

les signes de a et b

Definition at line 324 of file pgcd.c.

 {
     Value u0=VALUE_ONE,u1=VALUE_ZERO,v0=VALUE_ZERO,v1=VALUE_ONE;
     Value a0,a1,u,v,r,q,c;
     Value sa,sb;               /* les signes de a et b */
  
     sa = sb = VALUE_ONE;
     if (value_neg_p(a)){
         sa = VALUE_MONE;
         a = value_uminus(a);
     }
     if (value_neg_p(b)){
         sb  = VALUE_MONE;
         b = value_uminus(b);
     }
     if (value_zero_p(a) && value_zero_p(b)){
         *x = VALUE_ONE;
         *y = VALUE_ONE;
         return VALUE_ZERO;
     }
     else if(value_zero_p(a) || value_zero_p(b)){
         if (value_zero_p(a)){
             *x = VALUE_ZERO;
             *y = sb;
             return(b);
         }
         else{
             *x = sa;
             *y = VALUE_ZERO;
             return(a);
         }
     }
     else{
  
         if (value_ge(a,b))
         {
             a0 = a;
             a1 = b;
             c = VALUE_ZERO;
         }
         else
         {
             a0 = b;
             a1 = a;
             c = VALUE_ONE;
         }
         
         r = value_mod(a0,a1);
         while (value_notzero_p(r))
         {
             q = value_div(a0,a1);
             u = value_mult(u1,q);
             u = value_minus(u0,u);
  
             v = value_mult(v1,q);
             v = value_minus(v0,v);
             a0 = a1; a1 = r;
             u0 = u1; u1 = u;
             v0 = v1; v1 = v;
  
             r = value_mod(a0,a1);
         }
   
         if (value_zero_p(c)) {
             *x = value_mult(sa,u1);
             *y = value_mult(sb,v1);
         }
         else {
             *x = value_mult(sa,v1);
             *y = value_mult(sb,u1);
         }
  
         return a1;
     }
 }

References value_div, value_ge, value_minus, value_mod, VALUE_MONE, value_mult, value_neg_p, value_notzero_p, VALUE_ONE, value_uminus, VALUE_ZERO, value_zero_p, and x.

Referenced by base_G_h1_unnull().

Here is the caller graph for this function:

◆ divide_fast()

Value divide_fast	(	Value	a,
		Value	b
	)

divide.c

INTLIBRARY int divide(int a, int b): calcul du divide de a par b; le reste (qui n'est pas retourne) est toujours positif; il est fourni par la fonction modulo()

Il y a quatre configuration de signe a traiter:

a>0 && b>0: a / b
a<0 && b>0: (a-b+1) / b
a>0 && b<0: cf. 1. apres changement de signe de b, puis changement de signe du resultat
a<0 && b<0: cf. 2. apres changement de signe de b, puis changement de signe du resultat
a==0: 0

definition d'une look-up table pour les valeurs de a appartenant a [-DIVIDE_MAX_A..DIVIDE_MAX_A] et pour les valeurs de b appartenant a 1..DIVIDE_MAX_B

Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?

Serait-il utile de tester b > a pour renvoyer 0 ou -1 tout de suite?

b == 1 2 3 4 5 6 7 8

a == - 7

a == - 6

a == - 5

a == - 4

a == - 3

a == - 2

a == - 1

a == 0

a == 1

a == 2

a == 3

a == 4

a == 5

a == 6

a == 7

translation de a pour acces a la look-up table par indice positif: la == a + DIVIDE_MAX_A >= 0

valeur du quotient C

serait-il utile d'optimiser la division de a=0 par b? Ou bien cette routine n'est-elle jamais appelee avec a=0 par le package vecteur?

direct table look up

shift a for the table

this is just divide_slow

Definition at line 51 of file divide.c.

 {
     /* definition d'une look-up table pour les valeurs de a appartenant
        a [-DIVIDE_MAX_A..DIVIDE_MAX_A] et pour les valeurs de b
        appartenant a [1..DIVIDE_MAX_B] (en fait [-DIVIDE_MAX_B..DIVIDE_MAX_B]
        a cause du changement de signe)
        
        Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?
  
        Serait-il utile de tester b > a pour renvoyer 0 ou -1 tout de suite?
        */
  
 #define DIVIDE_MAX_A 7
 #define DIVIDE_MAX_B 8
  
     static Value
         divide_look_up[2*DIVIDE_MAX_A+1][DIVIDE_MAX_B]={
         /* b ==         1   2   3   4   5   6   7   8 */
         {/* a == - 7 */ -7, -4, -3, -2, -2, -2, -1, -1},
         {/* a == - 6 */ -6, -3, -2, -2, -2, -1, -1, -1},
         {/* a == - 5 */ -5, -3, -2, -2, -1, -1, -1, -1},
         {/* a == - 4 */ -4, -2, -2, -2, -1, -1, -1, -1},
         {/* a == - 3 */ -3, -2, -1, -1, -1, -1, -1, -1},
         {/* a == - 2 */ -2, -1, -1, -1, -1, -1, -1, -1},
         {/* a == - 1 */ -1, -1, -1, -1, -1, -1, -1, -1},
         {/* a ==   0 */  0,  0,  0,  0,  0,  0,  0,  0},
         {/* a ==   1 */  1,  0,  0,  0,  0,  0,  0,  0},
         {/* a ==   2 */  2,  1,  0,  0,  0,  0,  0,  0},
         {/* a ==   3 */  3,  1,  1,  0,  0,  0,  0,  0},
         {/* a ==   4 */  4,  2,  1,  1,  0,  0,  0,  0},
         {/* a ==   5 */  5,  2,  1,  1,  1,  0,  0,  0},
         {/* a ==   6 */  6,  3,  2,  1,  1,  1,  0,  0},
         {/* a ==   7 */  7,  3,  2,  1,  1,  1,  1,  0}
     };
     /* translation de a pour acces a la look-up table par indice positif:
        la == a + DIVIDE_MAX_A >= 0 */
  
     Value quotient;     /* valeur du quotient C */
  
     assert(value_notzero_p(b));
  
     /* serait-il utile d'optimiser la division de a=0 par b? Ou bien
        cette routine n'est-elle jamais appelee avec a=0 par le package vecteur?
        */
  
     if (value_le(a, int_to_value(DIVIDE_MAX_A)) && 
         value_ge(a, int_to_value(-DIVIDE_MAX_A)) &&
         value_le(b, int_to_value(DIVIDE_MAX_B)) &&
         value_ge(b, int_to_value(-DIVIDE_MAX_B)))
     {
         /* direct table look up */
         int bint = VALUE_TO_INT(b),
             la = VALUE_TO_INT(a)+DIVIDE_MAX_A; /* shift a for the table */
         quotient = (bint>0)?
             divide_look_up[la][bint-1]:
                 value_uminus(divide_look_up[la][(-bint)-1]);
     }
     else 
         quotient = value_pdiv(a,b); /* this is just divide_slow */
  
     return quotient;
 }

References assert, DIVIDE_MAX_A, DIVIDE_MAX_B, int_to_value, value_ge, value_le, value_notzero_p, value_pdiv, VALUE_TO_INT, and value_uminus.

◆ divide_slow()

Value divide_slow	(	Value	a,
		Value	b
	)

Definition at line 114 of file divide.c.

 {
     return value_pdiv(a, b);
 }

References value_pdiv.

◆ dump_exception_stack()

void dump_exception_stack ( void )

Referenced by __attribute__().

Here is the caller graph for this function:

◆ dump_exception_stack_to_file()

void dump_exception_stack_to_file ( FILE * )

◆ exponentiate()

Value exponentiate	(	Value	x,
		int	n
	)

exp.c

INTLIBRARY no overflow is checked int exponentiate(x,n): raise x to the power n

Precondition: n => 0

validation - n is positive

FI: la complexite pourrait etre reduite de O(n) a O(log n)

Definition at line 45 of file exp.c.

 {
     Value y;
  
     /* validation - n is positive 
      */
     assert(n >= 0);
     if (n == 0) return VALUE_ONE;
  
     /* FI: la complexite pourrait etre reduite de O(n) a O(log n) 
      */
     for(y=VALUE_ONE; n>0; n--)
         value_product(y,x);
  
     return y;
 }

References assert, VALUE_ONE, value_product, and x.

Referenced by integer_power_to_transformer().

Here is the caller graph for this function:

◆ fprint_string_Value()

void fprint_string_Value	(	FILE *	f,
		char *	blah,
		Value	v
	)

Parameters

blah lah

Definition at line 47 of file io.c.

 {
     fputs(blah,f);
     fprint_Value(f, v);
 }

References f(), and fprint_Value().

Referenced by build_sc_machine(), calculate_delay(), evaluate_var_to_complexity(), make_movements_loop_body_wp65(), print_cone_vecteur(), print_dependence_cone(), print_vect_in_vertice_val(), region_translation_init(), and TestDiVariables().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fprint_Value()

void fprint_Value	(	FILE *	f,
		Value	v
	)

Definition at line 42 of file io.c.

 {
     (void) fprintf(f, VALUE_FMT, v);
 }

References f(), fprintf(), and VALUE_FMT.

Referenced by adg_contrainte_fprint(), build1(), choose(), computebounds(), contrainte_fprint(), coupe(), evaluate_var_to_complexity(), fast(), fastplus(), findandmod(), fourier1(), fprint_contrainte_vecteur(), fprint_string_Value(), gcdtest(), igvoir3(), inequaldivision(), ipivotage2(), iprimal(), iprimalplus(), is2(), lowbound(), majlowbounds(), majuu(), matrice_fprint(), matrix_fprint(), matrix_pr_quot(), pr_quot(), pu_contrainte_fprint(), pu_vect_fprint(), sc_minmax_of_variable2(), sommet_fprint(), sommet_fprint_as_dense(), splitpb(), tableau_janus(), term(), upperbound(), vect_fprint(), vect_fprint_as_dense(), vect_gen_write(), voirbornes(), vzcut(), and wvoir().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fscan_Value()

int fscan_Value	(	FILE *	f,
		Value *	pv
	)

Parameters

pv v

Definition at line 58 of file io.c.

 {
     return fscanf(f, VALUE_FMT, pv);
 }

References f(), and VALUE_FMT.

Referenced by matrice_fscan(), and matrix_fscan().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ gcd_subtract()

Value gcd_subtract	(	Value	a,
		Value	b
	)

int gcd_subtract(int a, int b): find the gcd (pgcd) of two integers

 There is no precondition on the input. Negative input is handled
 in the same way as positive ones. If one input is zero the output
 is equal to the other input - thus an input of two zeros is the
 only way an output of zero is created.

 Postcondition:     gcd(a,b) > 0 ; gcd(a,b)==0 iff a==0 and b==0
                 whereas it should be undefined (F. Irigoin)

 Exception: gcd(0,0) aborts

 Implementation: by subtractions

Note: the signs of a and b do not matter because they can be exactly divided by the gcd

b == 0

Definition at line 189 of file pgcd.c.

 {
     a = value_abs(a);
     b = value_abs(b);
  
     while (value_notzero_p(a) && value_notzero_p(b)) {
         if (value_ge(a,b)) 
             a = value_minus(a,b);
         else
             b = value_minus(b,a);
     }
  
     if (value_zero_p(a)) {
         assert(value_notzero_p(b));
         return b;
     }
     else {
         /* b == 0 */
         assert(value_notzero_p(a));
         return a; 
     }
 }

References assert, value_abs, value_ge, value_minus, value_notzero_p, and value_zero_p.

◆ get_exception_name()

char const* get_exception_name ( const linear_exception_t )

Parameters

linear_exception_t xception

◆ linear_error_count()

unsigned int linear_error_count ( void )

return number of linear errors may be used as a test after a reset to know whether new errors occured.

Definition at line 85 of file errors.c.

 {
   return overflow_error_count + simplex_error_count + misc_error_count;
 }

References misc_error_count, overflow_error_count, and simplex_error_count.

Referenced by catch_user_error().

Here is the caller graph for this function:

◆ linear_get_error_counts()

void linear_get_error_counts	(	unsigned int *	poe,
		unsigned int *	pse,
		unsigned int *	pme
	)

return various errors counts through unsigned int pointer overflow, simplex & misc (aka others) NULL pointers are ignored

Parameters

poe	oe
pse	se
pme	me

Definition at line 94 of file errors.c.

 {
   if (poe) *poe = overflow_error_count;
   if (pse) *pse = simplex_error_count;
   if (pme) *pme = misc_error_count;
 }

References misc_error_count, overflow_error_count, and simplex_error_count.

Referenced by catch_user_error().

Here is the caller graph for this function:

◆ linear_initialize_exception_stack()

void linear_initialize_exception_stack	(	unsigned int	,
		exception_callback_t	,
		exception_callback_t
	)

◆ linear_pop_exception_from_stack()

void linear_pop_exception_from_stack	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ linear_push_exception_on_stack()

jmp_buf* linear_push_exception_on_stack	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ linear_require_gmp()

bool linear_require_gmp ( void )

whether linear is asked to use gmp if possible (env variable)

Definition at line 446 of file errors.c.

 {
         char* env = getenv("LINEAR_USE_GMP");
         return env && atoi(env) != 0;
 }

References env.

Referenced by catch_user_error(), and linear_use_gmp().

Here is the caller graph for this function:

◆ linear_reset_error_counters()

void linear_reset_error_counters ( void )

reset linear counters

Definition at line 75 of file errors.c.

 {
   overflow_error_count = 0;
   simplex_error_count = 0;
   misc_error_count = 0;
 }

References misc_error_count, overflow_error_count, and simplex_error_count.

Referenced by catch_user_error().

Here is the caller graph for this function:

◆ linear_throw_exception()

void linear_throw_exception	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ linear_use_gmp()

bool linear_use_gmp ( void )

whether linear is to use gmp

Definition at line 454 of file errors.c.

 {
   bool
     with_gmp = linear_with_gmp(),
     req_gmp = linear_require_gmp();
  
   if (req_gmp && !with_gmp && !warned_if_inconsistent_gmp)
   {
     fprintf(stderr, "linear was compiled without GMP support\n");
     warned_if_inconsistent_gmp = true;
   }
  
   return with_gmp && req_gmp;
 }

References fprintf(), linear_require_gmp(), linear_with_gmp(), and warned_if_inconsistent_gmp.

Referenced by internal_sc_feasibility(), sc_convex_hull(), sc_to_sg_chernikova(), and sg_to_sc_chernikova().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ linear_with_gmp()

bool linear_with_gmp ( void )

whether linear can use gmp (i.e.

compiled in)

Definition at line 435 of file errors.c.

 {
 #ifdef HAVE_GMP_H
   return true;
 #else
   return false;
 #endif // HAVE_GMP_H
 }

Referenced by catch_user_error(), and linear_use_gmp().

Here is the caller graph for this function:

◆ modulo_fast()

Value modulo_fast	(	Value	a,
		Value	b
	)

modulo.c

INTLIBRARY int modulo_fast(int a, int b): calcul du modulo de a par b; le modulo retourne est toujours positif

Il y a quatre configuration de signe a traiter:

a>0 && b>0: a % b
a<0 && b>0: a % b == 0 ? 0 : b - (-a)b
a>0 && b<0: cf. 1. apres changement de signe de b
a<0 && b<0: cf. 2. apres changement de signe de b

definition d'une look-up table pour les valeurs de a appartenant a [-MODULO_MAX_A..MODULO_MAX_A] et pour les valeurs de b appartenant a 1..MODULO_MAX_B Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?

b == 1 2 3 4 5

a == - 5

a == - 4

a == - 3

a == - 2

a == - 1

a == 0

a == 1

a == 2

a == 3

a == 4

a == 5

supprime pour cause de look-up table if(a==1 || a== 0) return(a);

if(b==1) return(0);

Definition at line 48 of file modulo.c.

 {
   /* definition d'une look-up table pour les valeurs de a appartenant
      a [-MODULO_MAX_A..MODULO_MAX_A] et pour les valeurs de b
      appartenant a [1..MODULO_MAX_B] (en fait [-MODULO_MAX_B..MODULO_MAX_B]
      a cause du changement de signe)
      Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?
   */
 #define MODULO_MAX_A 5
 #define MODULO_MAX_B 5
  
   // should be generated automatically
   static Value
     modulo_look_up[2*MODULO_MAX_A+1][MODULO_MAX_B]= {
     /*  b ==        1  2  3  4  5 */
     {/* a == - 5 */ 0, 1, 1, 3, 0},
     {/* a == - 4 */ 0, 0, 2, 0, 1},
     {/* a == - 3 */ 0, 1, 0, 1, 2},
     {/* a == - 2 */ 0, 0, 1, 2, 3},
     {/* a == - 1 */ 0, 1, 2, 3, 4},
     {/* a ==   0 */ 0, 0, 0, 0, 0},
     {/* a ==   1 */ 0, 1, 1, 1, 1},
     {/* a ==   2 */ 0, 0, 2, 2, 2},
     {/* a ==   3 */ 0, 1, 0, 3, 3},
     {/* a ==   4 */ 0, 0, 1, 0, 4},
     {/* a ==   5 */ 0, 1, 2, 1, 0}
         };
  
   // translation de a pour acces a la look-up table
  
   Value mod;    // valeur du modulo C
   assert(value_notzero_p(b));
  
   // premier changement de signe, ne changeant pas le resultat
   b = value_abs(b);
  
   // traitement des cas particuliers
   /* supprime pour cause de look-up table
    * if(a==1 || a== 0)
    *     return(a);
    *
    * if(b==1)
    *     return(0);
    */
  
   if (value_le(a, int_to_value( MODULO_MAX_A)) &&
       value_ge(a, int_to_value(-MODULO_MAX_A)) &&
       value_le(b, int_to_value( MODULO_MAX_B)))
   {
     // acceleration par une look-up table
     mod = modulo_look_up[VALUE_TO_INT(a)+MODULO_MAX_A][VALUE_TO_INT(b)-1];
   }
   else
   {
     // calcul effectif du modulo: attention, portabilite douteuse
     mod = value_mod(a,b);
     mod = value_neg_p(mod)? value_minus(b,mod): mod;
   }
  
   return mod;
 }

References assert, int_to_value, MODULO_MAX_A, MODULO_MAX_B, value_abs, value_ge, value_le, value_minus, value_mod, value_neg_p, value_notzero_p, and VALUE_TO_INT.

◆ pgcd_fast()

Value pgcd_fast	(	Value	a,
		Value	b
	)

int pgcd_fast(int a, int b): calcul iteratif du pgcd de deux entiers; le pgcd retourne est toujours positif; il n'est pas defini si a et b sont nuls (abort);

si cette routine n'est JAMAIS appelee avec des arguments nuls, il faudrait supprimer les deux tests d'egalite a 0; ca devrait etre le cas avec les vecteurs creux

Definition at line 82 of file pgcd.c.

 {
     Value gcd;
    
     assert(value_notzero_p(b)||value_notzero_p(a));
  
     a = value_abs(a);
     b = value_abs(b);
  
     /* si cette routine n'est JAMAIS appelee avec des arguments nuls,
        il faudrait supprimer les deux tests d'egalite a 0; ca devrait
        etre le cas avec les vecteurs creux */
     if(value_gt(a,b))
         gcd = value_zero_p(b)? a : pgcd_interne(a,b);
     else
         gcd = value_zero_p(a)? b : pgcd_interne(b,a);
  
     return gcd;
 }

References assert, pgcd_interne(), value_abs, value_gt, value_notzero_p, and value_zero_p.

Here is the call graph for this function:

◆ pgcd_interne()

Value pgcd_interne	(	Value	a,
		Value	b
	)

int pgcd_interne(int a, int b): calcul iteratif du pgcd de deux entiers strictement positifs tels que a > b; le pgcd retourne est toujours positif;

Definition d'une look-up table pour les valeurs de a appartenant a 0..GCD_MAX_A et pour les valeurs de b appartenant a 1..GCD_MAX_B

Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?

la commutativite du pgcd n'est pas utilisee pour reduire la taille de la table

b == 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

a == 0

a == 1

a == 2

a == 3

a == 4

a == 5

a == 6

a == 7

a == 8

a == 9

a == 10

a == 11

a == 12

a == 13

a == 14

a == 15

on pourrait aussi utiliser une table des nombres premiers pour diminuer le nombre de boucles

on utilise la valeur particuliere -1 pour iterer

compute modulo(a,b) en utilisant la routine C puisque a et b sont strictement positifs (vaudrait-il mieux utiliser la soustraction?)

Definition at line 106 of file pgcd.c.

 {
     /* Definition d'une look-up table pour les valeurs de a appartenant
        a [0..GCD_MAX_A] (en fait [-GCD_MAX_A..GCD_MAX_A])
        et pour les valeurs de b appartenant a [1..GCD_MAX_B]
        (en fait [-GCD_MAX_B..GCD_MAX_B] a cause du changement de signe)
        
        Serait-il utile d'ajouter une test b==1 pour supprimer une colonne?
        */
 #define GCD_MAX_A 15
 #define GCD_MAX_B 15
     /* la commutativite du pgcd n'est pas utilisee pour reduire la
        taille de la table */
     static Value 
         gcd_look_up[GCD_MAX_A+1][GCD_MAX_B+1]= {
         /*  b ==        0  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 */
         {/* a ==   0 */ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,15},
         {/* a ==   1 */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
         {/* a ==   2 */ 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1}, 
         {/* a ==   3 */ 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 3},
         {/* a ==   4 */ 4, 1, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1},
         {/* a ==   5 */ 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5},
         {/* a ==   6 */ 6, 1, 2, 3, 2, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 3},
         {/* a ==   7 */ 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1},
         {/* a ==   8 */ 8, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1},
         {/* a ==   9 */ 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3},
         {/* a ==  10 */10, 1, 2, 1, 2, 5, 2, 1, 2, 1,10, 1, 2, 1, 2, 5},
         {/* a ==  11 */11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,11, 1, 1, 1, 1},
         {/* a ==  12 */12, 1, 2, 3, 4, 1, 6, 1, 4, 3, 2, 1,12, 1, 2, 3},
         {/* a ==  13 */13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,13, 1, 1},
         {/* a ==  14 */14, 1, 2, 1, 2, 1, 2, 7, 2, 1, 2, 1, 2, 1,14, 1},
         {/* a ==  15 */15, 1, 1, 3, 1, 5, 3, 1, 1, 3, 5, 1, 3, 1, 1, 15}
     };
     /* on pourrait aussi utiliser une table des nombres premiers
        pour diminuer le nombre de boucles */
  
     /* on utilise la valeur particuliere -1 pour iterer */
     Value gcd = VALUE_MONE;
     Value mod;
  
     assert(value_gt(a,b) && value_pos_p(b));
  
     do{
         if(value_le(b,int_to_value(GCD_MAX_B)) && 
            value_le(a,int_to_value(GCD_MAX_A))) {
             gcd = gcd_look_up[VALUE_TO_INT(a)][VALUE_TO_INT(b)];
             break;
         }
         else {
             /* compute modulo(a,b) en utilisant la routine C puisque a et b
                sont strictement positifs (vaudrait-il mieux utiliser la
                soustraction?) */
             mod = value_mod(a,b);
             if(value_zero_p(mod)) {
                 gcd = b;
             }
             else {
                 a = b;
                 b = mod;
             }
         }
     } while(value_neg_p(gcd));
  
     return gcd;
 }

References assert, GCD_MAX_A, GCD_MAX_B, int_to_value, value_gt, value_le, value_mod, VALUE_MONE, value_neg_p, value_pos_p, VALUE_TO_INT, and value_zero_p.

Referenced by pgcd_fast().

Here is the caller graph for this function:

◆ pgcd_slow()

Value pgcd_slow	(	Value	a,
		Value	b
	)

pgcd.c

INTLIBRARY Value pgcd_slow(Value a, Value b) computation of the gcd of a and b. the result is always positive. standard algorithm in log(max(a,b)). pgcd_slow(0,0)==1 (maybe should we abort?). I changed from a recursive for a simple iterative version, FC 07/96.

a==0, b==0

a==0, b!=0

a!=0, b==0

a==b

swap

on entry in this loop, a > b > 0 is insured

Definition at line 44 of file pgcd.c.

 {
     Value m;
  
     if (value_zero_p(a))
     {
         if (value_zero_p(b))
             return VALUE_ONE;    /* a==0, b==0 */
         else
             return value_abs(b); /* a==0, b!=0 */
     }
     else
         if (value_zero_p(b))
             return value_abs(a); /* a!=0, b==0 */
  
     value_absolute(a);
     value_absolute(b);
  
     if (value_eq(a,b)) /* a==b */
         return a;
  
     if (value_gt(b,a))
         m = a, a = b, b = m; /* swap */
  
     /* on entry in this loop, a > b > 0 is insured */
     do {
         m = value_mod(a,b);
         a = b;
         b = m;
     } while(value_notzero_p(b));
  
     return a;
 }

References value_abs, value_absolute, value_eq, value_gt, value_mod, value_notzero_p, VALUE_ONE, and value_zero_p.

Referenced by matrice_determinant(), matrice_diagonale_inversion(), matrice_triangulaire_inversion(), matrix_determinant(), and substitute_var_with_vec().

Here is the caller graph for this function:

◆ pop_exception_from_stack()

void pop_exception_from_stack	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ pop_timeout()

void pop_timeout	(	const char *	,
		const char *	,
		const int
	)

◆ pop_timeout_env()

void pop_timeout_env	(	const char *	env,
		const char *	funcname,
		const char *	filename,
		const int	lineno
	)

Parameters

env	nv
funcname	uncname
filename	ilename
lineno	ineno

Definition at line 619 of file errors.c.

 {
   int delay = env2int(env);
   if (delay > 0)
     pop_timeout(funcname, filename, lineno);
 }

References env, env2int(), and pop_timeout().

Here is the call graph for this function:

◆ ppcm()

Value ppcm	(	Value	i,
		Value	j
	)

ppcm.c

INTLIBRARY int ppcm(int i, int j): plus petit entier positif divisible par i et j

Ancien nom et ancien type: void lcm(int i, int j, int *pk)

Definition at line 42 of file ppcm.c.

 {
     if (value_neg_p(i)) i = value_uminus(i);
     if (value_neg_p(j)) j = value_uminus(j);
  
     if (value_zero_p(i) || value_zero_p(j)) 
         return VALUE_ZERO;
     else {
         Value d = pgcd(i,j);
         d = value_div(i,d);
         return value_mult(d,j);
     }
 }

References pgcd, value_div, value_mult, value_neg_p, value_uminus, VALUE_ZERO, and value_zero_p.

Referenced by bounds_equal_p(), build_contraction_matrices(), compose_vvs(), include_trans_on_LC_in_ref(), matrice_diagonale_inversion(), matrice_substract(), matrix_add(), matrix_diagonal_inversion(), matrix_substract(), my_matrices_to_constraints_with_sym_cst(), my_matrices_to_constraints_with_sym_cst_2(), simplify_dimension(), simplify_predicate(), and vvs_on_vvs().

Here is the caller graph for this function:

◆ print_Value()

void print_Value ( Value v )

io.c

IO on a Value

Definition at line 37 of file io.c.

 {
     (void) printf(VALUE_FMT, v);
 }

References printf(), and VALUE_FMT.

Referenced by __attribute__(), add_var_sup(), eq_in_ineq(), lignes_entrant(), printfrac(), and var_ecart_sup().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ push_exception_on_stack()

jmp_buf* push_exception_on_stack	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ push_timeout()

void push_timeout	(	const unsigned int	delay,
		const char *	funcname,
		const char *	filename,
		const int	lineno
	)

Parameters

delay	elay
funcname	uncname
filename	ilename
lineno	ineno

Definition at line 539 of file errors.c.

 {
   time_t now = time(NULL);
  
   assert(timeout_index < TIMEOUT_MAX_STACK_SIZE);
  
   timeouts[timeout_index].start = now;
   timeouts[timeout_index].delay = delay;
   timeouts[timeout_index].env = NULL;
   timeouts[timeout_index].end = timeouts[timeout_index].start + delay;
   timeouts[timeout_index].funcname = funcname;
   timeouts[timeout_index].filename = filename;
   timeouts[timeout_index].lineno = lineno;
  
   timeout_index++;
  
   signal(SIGALRM, timeout_handler);
   alarm(delay);
 }

References assert, timeout_t::delay, timeout_t::end, timeout_t::env, timeout_t::filename, timeout_t::funcname, timeout_t::lineno, timeout_t::start, timeout_index, TIMEOUT_MAX_STACK_SIZE, and timeouts.

Referenced by push_timeout_env().

Here is the caller graph for this function:

◆ push_timeout_env()

bool push_timeout_env	(	const char *	env,
		const char *	funcname,
		const char *	filename,
		const int	lineno
	)

Parameters

env	nv
funcname	uncname
filename	ilename
lineno	ineno

Definition at line 575 of file errors.c.

 {
   int delay = env2int(env);
   if (delay > 0)
   {
     push_timeout(delay, funcname, filename, lineno);
     timeouts[timeout_index-1].env = env;
     return true;
   }
   return false;
 }

References timeout_t::env, env, env2int(), push_timeout(), timeout_index, and timeouts.

Here is the call graph for this function:

◆ scan_Value()

int scan_Value ( Value * pv )

Parameters

pv v

Definition at line 63 of file io.c.

 {
     return scanf(VALUE_FMT, pv);
 }

References VALUE_FMT.

Referenced by fonct_read(), and vect_read().

Here is the caller graph for this function:

◆ set_exception_callbacks()

void set_exception_callbacks	(	exception_callback_t	,
		exception_callback_t
	)

Referenced by atinit(), gpips_main(), pips_main(), tpips_main(), and wpips_main().

Here is the caller graph for this function:

◆ set_timeout_callback()

void set_timeout_callback ( timeout_callback_f callback )

Parameters

callback allback

Definition at line 485 of file errors.c.

 {
   timeout_callback = callback;
 }

References callback, and timeout_callback.

Referenced by set_pips_timeout(), and set_pips_timeout_from_env().

Here is the caller graph for this function:

◆ sprint_Value()

void sprint_Value	(	char *	s,
		Value	v
	)

Definition at line 53 of file io.c.

 {
     (void) sprintf(s, VALUE_FMT, v);
 }

References VALUE_FMT.

Referenced by heuristique_1(), heuristique_3(), and vect_sprint_as_monome().

Here is the caller graph for this function:

◆ sscan_Value()

int sscan_Value	(	char *	s,
		Value *	pv
	)

Parameters

pv v

Definition at line 68 of file io.c.

 {
     return sscanf(s, VALUE_FMT, pv);
 }

References VALUE_FMT.

Referenced by vect_gen_read().

Here is the caller graph for this function:

◆ throw_exception()

void throw_exception	(	const int	,
		const char *	,
		const char *	,
		const int
	)

◆ value_comparison()

int value_comparison	(	Value	v1,
		Value	v2
	)

value.c

Parameters

v1	1
v2	2

Definition at line 36 of file value.c.

 {
   int cmp = 0;
   if(value_gt(v1, v2))
     cmp = 1;
   else if(value_gt(v2, v1))
     cmp = -1;
   return cmp;
 }

References value_gt.

◆ Value_to_string()

char* Value_to_string ( Value v )

Definition at line 76 of file io.c.

 {
     static char buf[BUFFER_SIZE];
     sprintf(buf, VALUE_FMT, v);
     return buf;
 }

References buf, BUFFER_SIZE, and VALUE_FMT.

Referenced by add_Value_to_current_line().

Here is the caller graph for this function:

◆ vecteur_bezout()

Value vecteur_bezout	(	Value	u[],
		Value	v[],
		int	l
	)

int vecteur_bezout(int u[], int v[], int l): calcul du vecteur v qui verifie le theoreme de bezout pour le vecteur u; les vecteurs u et v sont de dimension l

-> -> -> < u . v > = gcd(u ) i

printf("gcd = %d \n",gcd);

sum u * v = gcd(u ) k<l k k k<l k

a1 = gcd (u ) k<l-1 k

printf("gcd = %d\n",gcd);

Definition at line 220 of file pgcd.c.

 {
     Value gcd, a1, x;
     Value *p1, *p2;
     int i, j;
  
     assert(l>0);
  
     if (l==1) {
         v[0] = VALUE_ONE;
         gcd = u[0];
     }
     else {
         p1 = &v[0]; p2 = &v[1];
         a1 = u[0]; gcd = u[1];
         gcd = bezout(a1,gcd,p1,p2);
  
         /* printf("gcd = %d \n",gcd); */
  
         for (i=2;i<l;i++){ 
             /* sum u * v = gcd(u ) 
              * k<l  k   k  k<l  k
              *
              * a1 = gcd  (u )
              *      k<l-1  k
              */
             a1 = u[i];
             p1 = &v[i];
             gcd = bezout(a1,gcd,p1,&x);
             /* printf("gcd = %d\n",gcd); */
             for (j=0;j<i;j++)
                 value_product(v[j],x);
         } 
     }
  
     return gcd;
 }

References assert, bezout(), VALUE_ONE, value_product, and x.

Here is the call graph for this function:

Variable Documentation

◆ int

void const char const char const int

Definition at line 593 of file arithmetique.h.

◆ linear_assertion_result

int linear_assertion_result

extern

errors.c

Definition at line 43 of file errors.c.

◆ linear_number_of_exception_thrown

int linear_number_of_exception_thrown

extern

Referenced by __attribute__(), build_sc_nredund_1pass_ofl_ctrl(), efficient_sc_check_inequality_feasibility(), internal_sc_feasibility(), sc_cute_convex_hull(), sc_feasibility_ofl_ctrl(), sc_fourier_motzkin_feasibility_ofl_ctrl_timeout_ctrl(), sc_janus_feasibility_ofl_ctrl_timeout_ctrl(), and sc_simplexe_feasibility_ofl_ctrl_timeout_ctrl().

◆ the_last_just_thrown_exception

linear_exception_t the_last_just_thrown_exception

extern

Referenced by __attribute__(), catch_user_error(), safe_concurrent_apply(), and tpips_exec().

Data Structures

Macros

Typedefs

Functions

Variables

Macro Definition Documentation

◆ __LONG_LONG_MAX__

◆ _has_yy_size_t

◆ ABS

◆ CURRENT_FUNCTION

◆ divide

◆ DIVIDE

◆ double_to_value

◆ float_to_value

◆ int_to_value

◆ LINEAR_VALUE_STRING

◆ LONG_LONG_MAX

◆ LONG_LONG_MIN

◆ long_to_value

◆ MAX

◆ MIN

◆ modulo

◆ MODULO

◆ pgcd

◆ POP_TIMEOUT

◆ POP_TIMEOUT_ENV

◆ POSITIVE_DIVIDE

◆ POSITIVE_MODULO

◆ PUSH_TIMEOUT

◆ PUSH_TIMEOUT_ENV

◆ SIGN

◆ ULONG_LONG_MAX

◆ value_abs

◆ value_absolute

◆ value_addto

◆ value_and

◆ value_andto

◆ value_assign

◆ value_compare

◆ VALUE_CONST

◆ value_decrement

◆ value_direct_multiply

◆ value_direct_product

◆ value_div

◆ value_division

◆ value_eq

◆ VALUE_FMT

◆ value_ge

◆ value_gt

◆ value_increment

◆ value_le

◆ value_lshift

◆ value_lt

◆ VALUE_MAX

◆ value_max

◆ value_max_p

◆ value_maximum

◆ VALUE_MIN

◆ value_min

◆ value_min_p

◆ value_minimum

◆ value_minus

◆ value_mod

◆ value_modulus

◆ VALUE_MONE

◆ value_mone_p

◆ value_mult

◆ value_multiply

◆ VALUE_NAN

◆ value_ne

◆ value_neg_p

◆ value_negz_p

◆ value_not

◆ value_notmax_p

◆ value_notmin_p

◆ value_notmone_p

◆ value_notone_p

◆ value_notzero_p

◆ VALUE_ONE

◆ value_one_p

◆ attribute()