version 1.33, 2012/03/01 10:14:09
|
version 1.48, 2014/04/25 07:37:35
|
Line 1
|
Line 1
|
/* |
/* |
================================================================================ |
================================================================================ |
RPL/2 (R) version 4.1.7 |
RPL/2 (R) version 4.1.18 |
Copyright (C) 1989-2012 Dr. BERTRAND Joël |
Copyright (C) 1989-2014 Dr. BERTRAND Joël |
|
|
This file is part of RPL/2. |
This file is part of RPL/2. |
|
|
Line 38
|
Line 38
|
struct_objet * |
struct_objet * |
simplification(struct_processus *s_etat_processus, struct_objet *s_objet) |
simplification(struct_processus *s_etat_processus, struct_objet *s_objet) |
{ |
{ |
|
#ifdef EXPERIMENTAL_CODE |
struct_arbre *s_arbre; |
struct_arbre *s_arbre; |
struct_arbre *s_noeud_courant; |
struct_arbre *s_noeud_courant; |
|
|
struct_liste_chainee *l_element_courant; |
struct_liste_chainee *l_element_courant; |
|
#endif |
struct_objet *s_objet_simplifie; |
struct_objet *s_objet_simplifie; |
|
#ifdef EXPERIMENTAL_CODE |
struct_objet **t_expression; |
struct_objet **t_expression; |
|
|
unsigned long i; |
unsigned long i; |
unsigned long nombre_elements; |
unsigned long nombre_elements; |
|
|
s_arbre = NULL; |
s_arbre = NULL; |
|
#endif |
|
|
if ((*s_objet).type == ALG) |
if ((*s_objet).type == ALG) |
{ |
{ |
Line 126 simplification(struct_processus *s_etat_
|
Line 128 simplification(struct_processus *s_etat_
|
|
|
struct_arbre * |
struct_arbre * |
creation_arbre(struct_processus *s_etat_processus, |
creation_arbre(struct_processus *s_etat_processus, |
struct_objet **t_objets, unsigned long indice, |
struct_objet **t_objets, integer8 indice, integer8 indice_maximal) |
unsigned long indice_maximal) |
|
{ |
{ |
struct_arbre *s_noeud; |
struct_arbre *s_noeud; |
|
|
unsigned long i; |
//unsigned long i; |
|
|
if ((s_noeud = malloc(sizeof(struct_arbre))) == NULL) |
if ((s_noeud = malloc(sizeof(struct_arbre))) == NULL) |
{ |
{ |