pnome-io.c File Reference

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include "linear_assert.h"
#include <ctype.h>
#include "boolean.h"
#include "arithmetique.h"
#include "vecteur.h"
#include "polynome.h"

Include dependency graph for pnome-io.c:

Go to the source code of this file.

Macros
#define	POLYNOME_BUFFER_SIZE   20480

Functions
void	float_to_frac (float x, char **ps)
	void float_to_frac(float x, char** ps) PRIVATE returns the simplest representation of floating-point number x tries to make an integer, then a small fraction, then a floating-point, then a floating-point with exponent. More...
void	monome_fprint (FILE *fd, Pmonome pm, Pbase pb, bool plus_sign, char *(*variable_name)(Variable))
	void monome_fprint(FILE* fd, Pmonome pm, Pbase pb, bool plus_sign, char* (*variable_name)()) PRIVATE Outputs to file fd an ASCII form of monomial pm, naming variables with the "variable-name" function, ordering them with the basis pb. More...
char *	monome_sprint (Pmonome pm, Pbase pb, bool plus_sign, char *(*variable_name)(Variable))
	char monome_sprint(Pmonome pm, Pbase pb, bool plus_sign, char (*variable_name)()) PRIVATE Outputs a string representing monomial pm, naming variables with the "variable-name" function, ordering them with the basis pb. More...
void	polynome_fprint (FILE *fd, Ppolynome pp, char *(*variable_name)(Variable), int *is_inferior_var)
	void polynome_fprint(FILE* fd, Ppolynome pp, char* (*variable_name)(), bool (*is_inferior_var)()) Outputs to file fd an ASCII form of polynomial pp, using the user-provided function variable_name(Variable var) to associate the "Variable" pointers with the variable names. More...
char *	polynome_sprint (Ppolynome pp, char *(*variable_name)(Variable), int *is_inferior_var)
	char polynome_sprint(Ppolynome pp, char (*variable_name)(), bool (*is_inferior_var)()) Outputs to file fd an ASCII form of polynomial pp, using the user-provided function variable_name(Variable var) to associate the "Variable" pointers with the variable names. More...
char *	default_variable_name (Variable var)
	char *default_variable_name(Variable var) returns for variable var the name "Vxxxx" where xxxx are four letters computed from (int) var. More...
int	default_is_inferior_var (Variable var1, Variable var2)
	bool default_is_inferior_var(Variable var1, Variable var2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming. More...
int	default_is_inferior_varval (Pvecteur varval1, Pvecteur varval2)
	bool default_is_inferior_varval(Pvecteur varval1, Pvecteur varval2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming. More...
int	default_is_inferior_pvarval (Pvecteur *pvarval1, Pvecteur *pvarval2)
	bool default_is_inferior_pvarval(Pvecteur * pvarval1, Pvecteur * pvarval2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming. More...
static void	remove_blanks (char **ps)
static float	parse_coeff (char **ps)
static char *	parse_var_name (char **ps)
Ppolynome	polynome_sscanf (char *sp, Variable(*name_to_variable)(Variable))
	Ppolynome polynome_sscanf(char *sp, (*name_to_variable)()) converts into polynomial structure the expression passed in ASCII form in string sp. More...

Macro Definition Documentation

POLYNOME_BUFFER_SIZE

#define POLYNOME_BUFFER_SIZE   20480

Function Documentation

default_is_inferior_pvarval()

int default_is_inferior_pvarval	(	Pvecteur *	pvarval1,
		Pvecteur *	pvarval2
	)

bool default_is_inferior_pvarval(Pvecteur * pvarval1, Pvecteur * pvarval2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming.

Parameters

pvarval1	varval1
pvarval2	varval2

Definition at line 286 of file pnome-io.c.

{
    return strcmp(default_variable_name(vecteur_var(* pvarval1)),
                       default_variable_name(vecteur_var(* pvarval2)));
}

References default_variable_name(), and vecteur_var.

Referenced by block_to_complexity(), final_statement_to_complexity_evaluation(), and polynome_equal().

Here is the call graph for this function:

Here is the caller graph for this function:

default_is_inferior_var()

int default_is_inferior_var	(	Variable	var1,
		Variable	var2
	)

bool default_is_inferior_var(Variable var1, Variable var2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming.

Parameters

var1	ar1
var2	ar2

Definition at line 265 of file pnome-io.c.

{
    return strcmp(default_variable_name(var1), 
                       default_variable_name(var2));
}

References default_variable_name().

Here is the call graph for this function:

default_is_inferior_varval()

int default_is_inferior_varval	(	Pvecteur	varval1,
		Pvecteur	varval2
	)

bool default_is_inferior_varval(Pvecteur varval1, Pvecteur varval2) return true if var1 is before var2, lexicographically, according to the "default_variable_name" naming.

Parameters

varval1	arval1
varval2	arval2

Definition at line 276 of file pnome-io.c.

{
    return strcmp(default_variable_name(vecteur_var(varval1)),
                       default_variable_name(vecteur_var(varval2)));
}

References default_variable_name(), and vecteur_var.

Here is the call graph for this function:

default_variable_name()

char* default_variable_name

(

Variable

var

)

char *default_variable_name(Variable var) returns for variable var the name "Vxxxx" where xxxx are four letters computed from (int) var.

I guess that many variables can have the same name since the naming is done modulo 26^4 ? RK. To be fixed...

Parameters

var

ar

Definition at line 242 of file pnome-io.c.

{
    char *s = (char *) malloc(6);
    int i = (intptr_t) var;
    
    if (var != TCST) {
        sprintf(s, "V%c%c%c%c",
                (char) 93 + (i % 26),
                (char) 93 + ((i / 26) % 26),
                (char) 93 + ((i / 26 / 26) % 26),
                (char) 93 + ((i / 26 / 26 / 26) % 26));
    }
    else 
        sprintf(s, "TCST");
    return(s);
}

References intptr_t, malloc(), and TCST.

Referenced by default_is_inferior_pvarval(), default_is_inferior_var(), and default_is_inferior_varval().

Here is the call graph for this function:

Here is the caller graph for this function:

float_to_frac()

void float_to_frac	(	float	x,
		char **	ps
	)

void float_to_frac(float x, char** ps) PRIVATE returns the simplest representation of floating-point number x tries to make an integer, then a small fraction, then a floating-point, then a floating-point with exponent.

if too little or too big print it with an exponent

default printing: as a float

if x is close enough up to a little fraction

rint it as a fraction

Definition at line 54 of file pnome-io.c.

{
    int i;
    float fprecision = (float) intpower(10.0, -PNOME_FLOAT_N_DECIMALES);
 
    if (((x <= fprecision) && (x >= -fprecision)) || 
        ((x>PNOME_FLOAT_TO_EXP_LEVEL) | (x<-PNOME_FLOAT_TO_EXP_LEVEL)))
         /* if too little or too big print it with an exponent */
        sprintf(*ps, "%.*E", PNOME_FLOAT_N_DECIMALES, x);
    else {
        /* default printing: as a float */
        sprintf(*ps, "%.*f", PNOME_FLOAT_N_DECIMALES, x);
        for (i=1; i<PNOME_FLOAT_TO_FRAC_LEVEL; i++)
            if ((((x*i) - ((int) (x*i+0.5))) < (fprecision)) &&  
                (((x*i) - ((int) (x*i+0.5))) > (-fprecision))) { 
                /* if x is close enough up to a little fraction */
                if ((((int) (x*i+0.5)) < PNOME_FLOAT_TO_FRAC_LEVEL) || (i==1)) {
                    /*print it as a fraction */
                    if (i==1)
                        sprintf(*ps, "%d", (int) (x*i+0.5));
                    else
                        sprintf(*ps, "%d/%d", (int) (x*i+0.5), i);
                }
                break;
            }
    }
}

References intpower(), PNOME_FLOAT_N_DECIMALES, PNOME_FLOAT_TO_EXP_LEVEL, PNOME_FLOAT_TO_FRAC_LEVEL, and x.

Referenced by monome_sprint().

Here is the call graph for this function:

Here is the caller graph for this function:

monome_fprint()

void monome_fprint	(	FILE *	fd,
		Pmonome	pm,
		Pbase	pb,
		bool	plus_sign,
		char * (*)(Variable)	variable_name
	)

void monome_fprint(FILE* fd, Pmonome pm, Pbase pb, bool plus_sign, char* (*variable_name)()) PRIVATE Outputs to file fd an ASCII form of monomial pm, naming variables with the "variable-name" function, ordering them with the basis pb.

the "+" sign is printed if plus_sign == true.

Definition at line 90 of file pnome-io.c.

{
    char *s = monome_sprint(pm, pb, plus_sign, variable_name);
 
    fprintf(fd, "%s", s);
    free(s);
}

References fprintf(), free(), monome_sprint(), and variable_name().

Here is the call graph for this function:

monome_sprint()

char* monome_sprint	(	Pmonome	pm,
		Pbase	pb,
		bool	plus_sign,
		char * (*)(Variable)	variable_name
	)

char monome_sprint(Pmonome pm, Pbase pb, bool plus_sign, char (*variable_name)()) PRIVATE Outputs a string representing monomial pm, naming variables with the "variable-name" function, ordering them with the basis pb.

the "+" sign is printed if plus_sign == true.

Definition at line 109 of file pnome-io.c.

{
    float x;
    char t[99];
    char *r, *s;
    char *u;
 
    u = (char *) malloc(99);
    r = t;
 
    if (MONOME_UNDEFINED_P(pm))
        sprintf(r, "%s", MONOME_UNDEFINED_SYMBOL);
    else {
        x = monome_coeff(pm);
        if (x==0) 
            sprintf(r, "%s", MONOME_NUL_SYMBOL);
        else {
            if (x<0) {
                *(r++) = '-';
                if (plus_sign) 
                    *(r++) = ' ';
                x = - x; 
            }
            else if (plus_sign) {
                *(r++) = '+';
                *(r++) = ' ';
            }
 
            float_to_frac(x, &u);
 
            if (vect_coeff(TCST, monome_term(pm)) == 0) {
                if (x != 1) {
                    sprintf(r, "%s%s", u, MONOME_COEFF_MULTIPLY_SYMBOL);
                    r = strchr(r, '\0');
                }
                s = vect_sprint_as_monome(monome_term(pm), pb,
                                          variable_name, MONOME_VAR_MULTIPLY_SYMBOL);
                strcpy(r, s);
                free(s);
            }
            else 
                sprintf(r, "%s", u);
        }
    }
    free(u);
    return (char*) strdup((char *) t);
}

References float_to_frac(), free(), malloc(), monome_coeff, MONOME_COEFF_MULTIPLY_SYMBOL, MONOME_NUL_SYMBOL, monome_term, MONOME_UNDEFINED_P, MONOME_UNDEFINED_SYMBOL, MONOME_VAR_MULTIPLY_SYMBOL, strdup(), TCST, variable_name(), vect_coeff(), vect_sprint_as_monome(), and x.

Referenced by monome_fprint(), and polynome_sprint().

Here is the call graph for this function:

Here is the caller graph for this function:

parse_coeff()

static float parse_coeff ( char **  ps )

static

handle fractionnal coefficients

Definition at line 307 of file pnome-io.c.

{
    float coeff = 0;
 
    if (isdigit(**ps) || (**ps == '.') || (**ps == '+') || (**ps == '-')) {
        sscanf(*ps, "%f", &coeff);
        if ((coeff == 0) && (**ps == '+')) 
            coeff = 1;
        if ((coeff == 0) && (**ps == '-')) 
            coeff = -1;
    }
    else 
        coeff = 1;
 
    if ((**ps == '-') || (**ps == '+')) 
        (*ps)++;
    while (isdigit(**ps) || (**ps == '.') || (**ps == '*')) 
        (*ps)++;
    
    if (**ps == '/') {  /* handle fractionnal coefficients */
        float denom;
        (*ps)++;
        denom = parse_coeff(ps);
        coeff /= denom;
    }
 
    return(coeff);
}

Referenced by polynome_sscanf().

Here is the caller graph for this function:

parse_var_name()

static char* parse_var_name ( char **  ps )

static

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

THE ':' STANDS FOR MODULE_SEP_STRING OF Linear/C3 Library

TO BE ABLE TO HANDLE VARIABLES SUCH AS P:I

Definition at line 337 of file pnome-io.c.

{
    char *name, *n;
 
    name = (char *) malloc(MAX_NAME_LENGTH);
    n = name;
 
    if (isalpha(**ps))                      /* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! */
        do { *n++ = *((*ps)++); }
    while (isalnum(**ps) || (**ps == ':')); /* THE ':' STANDS FOR MODULE_SEP_STRING OF Linear/C3 Library */
                                            /* TO BE ABLE TO HANDLE VARIABLES SUCH AS P:I   */
    *n = '\0';
 
    return(name);
}

References malloc(), and MAX_NAME_LENGTH.

Referenced by polynome_sscanf().

Here is the call graph for this function:

Here is the caller graph for this function:

polynome_fprint()

void polynome_fprint	(	FILE *	fd,
		Ppolynome	pp,
		char * (*)(Variable)	variable_name,
		int *	is_inferior_var
	)

void polynome_fprint(FILE* fd, Ppolynome pp, char* (*variable_name)(), bool (*is_inferior_var)()) Outputs to file fd an ASCII form of polynomial pp, using the user-provided function variable_name(Variable var) to associate the "Variable" pointers with the variable names.

is_inferior_var(Variable var1, Variable var2) is also given by the user: it must return true if var1 must be printed before var2 in monomials.

For the moment, monomials are not sorted. No "\n" is printed after the polynomial.

Definition at line 173 of file pnome-io.c.

{
    char *s = polynome_sprint(pp, variable_name, is_inferior_var);
 
    fprintf(fd, "%s", s);
    free(s);
}

References fprintf(), free(), is_inferior_var(), polynome_sprint(), and variable_name().

Referenced by fprint_pla_pp_dims(), is_not_trivial_p(), mapping_on_broadcast(), nullify_factors(), partition_unknowns(), plc_fprint_distance(), plc_fprint_proto(), plc_make_distance(), prgm_mapping(), prototype_dimension(), prp(), and valuer().

Here is the call graph for this function:

Here is the caller graph for this function:

polynome_sprint()

char* polynome_sprint	(	Ppolynome	pp,
		char * (*)(Variable)	variable_name,
		int *	is_inferior_var
	)

char polynome_sprint(Ppolynome pp, char (*variable_name)(), bool (*is_inferior_var)()) Outputs to file fd an ASCII form of polynomial pp, using the user-provided function variable_name(Variable var) to associate the "Variable" pointers with the variable names.

is_inferior_var(Variable var1, Variable var2) is also given by the user: it must return true if var1 must be printed before var2 in monomials.

For the moment, monomials are not sorted. No "\n" is printed after the polynomial.

The following line is added by L.Zhou Mar. 26, 91

Definition at line 197 of file pnome-io.c.

{
#define POLYNOME_BUFFER_SIZE 20480
    static char t[POLYNOME_BUFFER_SIZE];
    char *r, *s;
 
    r = t;
 
    if (POLYNOME_UNDEFINED_P(pp))
        sprintf(r, "%s", POLYNOME_UNDEFINED_SYMBOL);
    else if (POLYNOME_NUL_P(pp))
        sprintf(r, "%s", POLYNOME_NUL_SYMBOL);
    else {
        Pbase pb = (Pbase) polynome_used_var(pp, is_inferior_var);
        bool print_plus_sign = false;
 
        /* The following line is added by L.Zhou    Mar. 26, 91 */
        pp = polynome_sort(&pp, is_inferior_var);
 
        while (!POLYNOME_NUL_P(pp)) {
            s = monome_sprint(polynome_monome(pp), pb, 
                              print_plus_sign, variable_name);
            strcpy(r, s);
            r = strchr(r, '\0');
            pp = polynome_succ(pp);
            print_plus_sign = true;
            if (!POLYNOME_NUL_P(pp)) *(r++) = ' ';
            free(s);
        }
    }
    assert( strlen(t) < POLYNOME_BUFFER_SIZE);
    return (char*) strdup((char *) t);
}

References assert, free(), is_inferior_var(), monome_sprint(), POLYNOME_BUFFER_SIZE, polynome_monome, POLYNOME_NUL_P, POLYNOME_NUL_SYMBOL, polynome_sort(), polynome_succ, POLYNOME_UNDEFINED_P, POLYNOME_UNDEFINED_SYMBOL, polynome_used_var(), strdup(), and variable_name().

Referenced by complexity_sprint(), and polynome_fprint().

Here is the call graph for this function:

Here is the caller graph for this function:

polynome_sscanf()

Ppolynome polynome_sscanf	(	char *	sp,
		Variable (*)(Variable)	name_to_variable
	)

Ppolynome polynome_sscanf(char *sp, (*name_to_variable)()) converts into polynomial structure the expression passed in ASCII form in string sp.

(for debug only) pas vraiment quick mais bien dirty

printf(stderr, "\ns='%s'\n", s);

printf(stderr, "au milieu: s='%s'\n", s);

Parameters

sp

p

Definition at line 359 of file pnome-io.c.

{
    Ppolynome pp = POLYNOME_NUL;
    Pmonome curpm;
    bool constructing_monome = false;
    float coeff = 0.;
    char *varname;
    Value power;
    char *s;
 
    s = (char*) strdup(sp);
    remove_blanks(&s);
 
    while (*s != '\0')
    {
        /*fprintf(stderr, "\ns='%s'\n", s);*/
        power = VALUE_ONE;
        if (!constructing_monome) { coeff = parse_coeff(&s);
                                }
        varname = parse_var_name(&s);
        if (strlen(varname)!=0) {
            if (*s == '^') {
                s++;
                power = float_to_value(parse_coeff(&s));
            }
            else 
                while ((*s == '.') || (*s == '*')) s++;
        }
        else varname = (char*) strdup("TCST");
 
        if (constructing_monome) {
            vect_add_elem(&(monome_term(curpm)), 
                          name_to_variable(varname), 
                          power);
        }
        else {
            curpm = make_monome(coeff, name_to_variable(varname), power);
            constructing_monome = true;
        }
        /*fprintf(stderr, "au milieu: s='%s'\n", s);*/
 
        if ((*s == '+') || (*s == '-'))
        {
            polynome_monome_add(&pp, curpm);
            monome_rm(&curpm);
            constructing_monome = false;
        }
    }
    if (!MONOME_NUL_P(curpm)) {
        polynome_monome_add(&pp, curpm);
        monome_rm(&curpm);
    }
 
    return (pp);
}

References float_to_value, make_monome(), MONOME_NUL_P, monome_rm(), monome_term, name_to_variable(), parse_coeff(), parse_var_name(), polynome_monome_add(), POLYNOME_NUL, remove_blanks(), strdup(), VALUE_ONE, and vect_add_elem().

Here is the call graph for this function:

remove_blanks()

static void remove_blanks ( char **  ps )

static

Definition at line 292 of file pnome-io.c.

{
    char *s = *ps,
         *t = *ps;
 
    do {
        while (isspace(**ps)) 
            (*ps)++;
        *t++ = *(*ps)++;
    } while (**ps != '\0');
    *t++ = '\0';
    *ps = s;
}

Referenced by polynome_sscanf().

Here is the caller graph for this function: