polynome_ri.c File Reference

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "linear.h"
#include "genC.h"
#include "ri.h"
#include "effects.h"
#include "complexity_ri.h"
#include "ri-util.h"
#include "pipsdbm.h"
#include "workspace-util.h"
#include "effects-util.h"
#include "misc.h"
#include "matrice.h"
#include "complexity.h"

Include dependency graph for polynome_ri.c:

Go to the source code of this file.

Functions
char *	variable_name (Variable var)
	polynome_ri.c More...
char *	variable_local_name (Variable var)
bool	is_inferior_var (Variable var1, Variable var2)
int	is_inferior_varval (Pvecteur varval1, Pvecteur varval2)
int	is_inferior_pvarval (Pvecteur *pvarval1, Pvecteur *pvarval2)
Variable	name_to_variable (char *name)
Variable	local_name_to_variable (char *name)

Function Documentation

is_inferior_pvarval()

int is_inferior_pvarval	(	Pvecteur *	pvarval1,
		Pvecteur *	pvarval2
	)

Parameters

pvarval1	varval1
pvarval2	varval2

Definition at line 149 of file polynome_ri.c.

{
  int is_inferior;
 
  if (term_cst(*pvarval1))
    is_inferior = -1;
  else if(term_cst(*pvarval2))
    is_inferior = 1;
  else {
    // FI: should be entity_user_name...
    is_inferior = strcmp(variable_local_name(vecteur_var(*pvarval1)),
                         variable_local_name(vecteur_var(*pvarval2)));
  }
 
  // FI: Make sure that you do not return 0 for two different entities
  if(is_inferior==0 && vecteur_var(*pvarval1)!=vecteur_var(*pvarval2)) {
    is_inferior = strcmp(entity_name((entity)vecteur_var(*pvarval1)),
                         entity_name((entity)vecteur_var(*pvarval2)));
  }
 
  return is_inferior;
}

References entity_name, term_cst, variable_local_name(), and vecteur_var.

Referenced by complexity_sprint(), prp(), and translate_complexity_from_local_to_current_name().

Here is the call graph for this function:

Here is the caller graph for this function:

is_inferior_var()

bool is_inferior_var	(	Variable	var1,
		Variable	var2
	)

Parameters

var1	ar1
var2	ar2

Definition at line 118 of file polynome_ri.c.

{
    bool is_inferior = true;
    
    if (var1 == TCST)
        is_inferior = true;
    else if(var2 == TCST)
        is_inferior = false;
    else
        is_inferior = (strcmp(variable_local_name(var1), 
                             variable_local_name(var2)) <= 0 );
 
    return is_inferior; 
}

References TCST, and variable_local_name().

Referenced by is_inferior_monome(), polynome_fprint(), polynome_sort(), polynome_sprint(), and polynome_used_var().

Here is the call graph for this function:

Here is the caller graph for this function:

is_inferior_varval()

int is_inferior_varval	(	Pvecteur	varval1,
		Pvecteur	varval2
	)

Parameters

varval1	arval1
varval2	arval2

Definition at line 134 of file polynome_ri.c.

{
  int is_inferior;
 
  if (term_cst(varval1))
    is_inferior = 1;
  else if(term_cst(varval2))
    is_inferior = -1;
  else
    is_inferior = - strcmp(variable_local_name(vecteur_var(varval1)),
                           variable_local_name(vecteur_var(varval2)));
 
  return is_inferior;
}

References term_cst, variable_local_name(), and vecteur_var.

Here is the call graph for this function:

local_name_to_variable()

Variable local_name_to_variable

(

char *

name

)

Parameters

name

ame

Definition at line 194 of file polynome_ri.c.

{
    string s = make_entity_fullname("TOP-LEVEL", name);
 
    if (strcmp(name, TCST_NAME)==0) 
        return(TCST);
    /*
    else if (strcmp(name, UNKNOWN_VARIABLE_NAME) == 0) 
        return (UNKNOWN_VARIABLE);
    else if (strcmp(name, UNKNOWN_RANGE_NAME) == 0) 
        return (UNKNOWN_RANGE);
        */
    else {
        entity e = gen_find_tabulated(s, entity_domain);
        if (e != entity_undefined) 
            return ((Variable) e);
        else {
            user_warning("local_name_to_variable",
                         "entity '%s' not found:return chunk_undefined\n", name);
            return((Variable) chunk_undefined);
        }
    }
}

References chunk_undefined, entity_domain, entity_undefined, gen_find_tabulated(), make_entity_fullname(), TCST, TCST_NAME, and user_warning.

Here is the call graph for this function:

name_to_variable()

Variable name_to_variable

(

char *

name

)

Parameters

name

ame

Definition at line 172 of file polynome_ri.c.

{
    if (strcmp(name, TCST_NAME) == 0)
        return(TCST);
    /*
    else if (strcmp(name, UNKNOWN_VARIABLE_NAME) == 0) 
        return (UNKNOWN_VARIABLE);
    else if (strcmp(name, UNKNOWN_RANGE_NAME) == 0) 
        return (UNKNOWN_RANGE);
        */
    else {
        entity e = gen_find_tabulated(name, entity_domain);
        if (e != entity_undefined) 
            return ((Variable) e);
        else {
            user_warning("name_to_variable",
                         "entity '%s' not found:return chunk_undefined\n", name);
            return((Variable) chunk_undefined);
        }
    }
}

References chunk_undefined, entity_domain, entity_undefined, gen_find_tabulated(), TCST, TCST_NAME, and user_warning.

Referenced by polynome_sscanf(), and translate_complexity_from_local_to_current_name().

Here is the call graph for this function:

Here is the caller graph for this function:

variable_local_name()

char* variable_local_name

(

Variable

var

)

Parameters

var

ar

Definition at line 95 of file polynome_ri.c.

{
    string s = NULL;
 
    if (var == TCST) 
        s = strdup(TCST_NAME);
    /*
    else if (var == UNKNOWN_VARIABLE) 
        s = strdup(UNKNOWN_VARIABLE_NAME);
    else if (var == UNKNOWN_RANGE) 
        s = strdup(UNKNOWN_RANGE_NAME);
        */
    else if (var == (Variable) chunk_undefined) 
        pips_internal_error("unexpected var == chunk_undefined.");
    else {
      // s = strdup(entity_local_name((entity) var));
        s = strdup(entity_minimal_name((entity) var));
    }
 
    return (s);
}

References chunk_undefined, entity_minimal_name(), pips_internal_error, strdup(), TCST, and TCST_NAME.

Referenced by complexity_sprint(), final_statement_to_complexity_evaluation(), is_inferior_pvarval(), is_inferior_var(), and is_inferior_varval().

Here is the call graph for this function:

Here is the caller graph for this function:

variable_name()

char* variable_name

(

Variable

var

)

polynome_ri.c

This file gathers some functions interfacing polynomial library and the RI.

The "Variable" type used by polynomials is casted to "entity", the "Value" type, to int.

char *variable_name(Variable var) return the complete name of the entity var

char *variable_local_name(Variable var) return the abbreviated, local name of var

bool is_inferior_var(Variable var1, var2) return true if the complete name of var1 is lexicographically before var2's one.

Variable name_to_variable(char *name) inverse function of variable_name. name must be the complete name of the variable. Modif: – entity_local_name is replaced by module_local_name. LZ 230993

FI: no longer useful

Parameters

var

ar

Definition at line 73 of file polynome_ri.c.

{
    string s = (string) malloc(10);
 
    if (var == TCST) 
        s = strdup(TCST_NAME);
    /* FI: no longer useful */
    /*
    else if (var == UNKNOWN_VARIABLE) 
        s = strdup(UNKNOWN_VARIABLE_NAME);
    else if (var == UNKNOWN_RANGE) 
        s = strdup(UNKNOWN_RANGE_NAME);
        */
    else if (var == (Variable) chunk_undefined) 
        pips_internal_error("unexpected var == chunk_undefined.");
    else 
        s = strdup(entity_name((entity) var));
 
    return (s);
}

References chunk_undefined, entity_name, malloc(), pips_internal_error, strdup(), TCST, and TCST_NAME.

Referenced by add_parameter_variable_to_module(), add_private_variable_to_module(), adg_contrainte_fprint(), adg_egalite_fprint(), adg_inegalite_fprint(), adg_vecteur_fprint(), base_find_variable_name(), base_find_variable_rank(), base_fprint(), complexity_sprint(), complexity_var_subst(), contrainte_fprint(), contrainte_sprint(), contrainte_sprint_format(), contrainte_text_format(), contrainte_to_text_1(), contrainte_to_text_2(), contrainte_translate(), contraintes_text_format(), egalite_fprint(), egalite_sprint(), egalite_sprint_format(), egalite_text_format(), egalites_fprint(), egalites_to_matrice(), fprint_contrainte_vecteur(), generate_variable_with_unique_name_to_module(), generic_make_entity_copy_with_new_name(), heuristique_1(), heuristique_3(), inegalite_fprint(), inegalite_sprint(), inegalite_sprint_format(), inegalite_text_format(), inegalites_fprint(), make_new_derived_entity_with_prefix(), make_new_scalar_variable_with_prefix(), make_variable_from_name_and_entity(), monome_fprint(), monome_sprint(), polynome_fprint(), polynome_sprint(), print_homogeneous_arguments(), prp(), prv(), pu_contrainte_fprint(), pu_egalite_fprint(), pu_inegalite_fprint(), pvecteur_to_polynome(), relation_to_string(), replace_formal_parameters_by_real_ones(), sc_strong_normalize4(), sc_strong_normalize5(), sc_strong_normalize_and_check_feasibility2(), sc_translate(), sc_variables_rename(), signed_operation_to_textline(), system_sorted_text_format(), system_text_format(), translate_complexity_from_local_to_current_name(), unsigned_operation_to_textline(), vect_fprint(), vect_fprint_as_monome(), vect_print(), vect_rename(), vect_sprint_as_monome(), vect_translate(), and vecteur_fprint().

Here is the call graph for this function: