25 #include "pips_config.h"
73 #include "constants.h"
83 #define INS_NAME_LENGTH 4
85 #define BDT_STRING "bdt"
120 if( (bdt_file = fopen(bdt_file_name,
"r")) == NULL)
122 fprintf(stderr,
"Cannot open file %s\n", bdt_file_name);
126 #if defined(HAS_BDTYY)
156 if( (p1 == NULL) && (p2 == NULL) )
174 list sch_l, new_sch_l =
NIL, l;
182 for(l = new_sch_l; (!
ENDP(l)) && to_add;
POP(l)) {
float a2sf[2] __attribute__((aligned(16)))
USER generates a user error (i.e., non fatal) by printing the given MSG according to the FMT.
schedule make_schedule(intptr_t a1, predicate a2, list a3)
lisp_expression make_lisp_expression(string a1, list a2)
bdt base
Current expression.
void bdt_save_pred(int option)
===========================================================================
dfg_arc_label arc_label
Name : bdt_read_paf.c Package : paf-util Author : Alexis Platonoff Date : april 1993 Historic :
bool same_predicate_p(predicate p1, predicate p2)
===========================================================================
void bdt_init_new_ins(char *s_ins)
===========================================================================
void bdt_init_op_exp(string op_name)
===========================================================================
void reorganize_bdt(bdt base)
===========================================================================
void bdt_new_shedule(string s_func __attribute__((unused)))
===========================================================================
dfg_vertex_label vertex_label
static list pred_l
Current stmt (an integer)
static expression crt_exp
Current list of linear expressions.
void bdt_save_id(string s)
===========================================================================
static int crt_ins
Static global variables.
void bdt_save_int(int i)
===========================================================================
void bdt_elim_last_pred()
===========================================================================
void bdt_init_new_base()
===========================================================================
void bdt_save_exp()
===========================================================================
bdt bdt_read_paf(char *s)
===========================================================================
static list lin_exp_l
Current list of predicates.
#define ENDP(l)
Test if a list is empty.
#define POP(l)
Modify a list pointer to point on the next element of the list.
#define NIL
The empty list (nil in Lisp)
#define CONS(_t_, _i_, _l_)
List element cell constructor (insert an element at the beginning of a list)
list gen_nconc(list cp1, list cp2)
physically concatenates CP1 and CP2 but do not duplicates the elements
#define CAR(pcons)
Get the value of the first element of a list.
#define CDR(pcons)
Get the list less its first element.
#define pips_internal_error
string concatenate(const char *,...)
Return the concatenation of the given strings.
expression negate_expression(expression)
===========================================================================
expression lisp_exp_to_ri_exp(lisp_expression)
===========================================================================
expression make_id_expression(string)
===========================================================================
predicate expressions_to_predicate(list)
===========================================================================
#define SCHEDULE(x)
SCHEDULE.
#define LISP_EXPRESSION(x)
LISP_EXPRESSION.
#define schedule_predicate(x)
#define schedule_statement(x)
#define lisp_expression_args(x)
#define PLUS_OPERATOR_NAME
expression int_to_expression(_int i)
transform an int into an expression and generate the corresponding entity if necessary; it is not cle...
expression make_op_exp(char *op_name, expression exp1, expression exp2)
================================================================
#define EXPRESSION(x)
EXPRESSION.
#define expression_undefined
#define predicate_undefined
int fprintf()
test sc_min : ce test s'appelle par : programme fichier1.data fichier2.data ...
The structure used to build lists in NewGen.