1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
/*****************************************/
/* CLE-2000 API */
/* LIFO stack utility for CLE-2000 */
/* AUTHOR: A. Hebert ; 27/07/10 */
/*****************************************/
#include <stdlib.h>
#include <string.h>
#include "cle2000.h"
void cleopn(lifo **my_lifo)
{
(*my_lifo) = (lifo *) malloc(sizeof(lifo));
(*my_lifo)->nup = 0;
(*my_lifo)->root = NULL;
(*my_lifo)->node = NULL;
}
lifo_node * clepop(lifo **my_lifo)
{
lifo_node *my_node;
if ((*my_lifo)->nup == 0) return NULL;
my_node = (*my_lifo)->node;
(*my_lifo)->node = my_node->daughter;
my_node->daughter = NULL;
(*my_lifo)->nup--;
return my_node;
}
void clepush(lifo **my_lifo, lifo_node *my_node)
{
lifo_node *daughter_node;
if ((*my_lifo)->nup == 0) {
(*my_lifo)->root = my_node;
daughter_node = NULL;
} else {
daughter_node = (*my_lifo)->node;
}
(*my_lifo)->node = my_node;
(*my_lifo)->node->daughter = daughter_node;
(*my_lifo)->nup++;
}
int_32 clecls(lifo **my_lifo)
{
if ((*my_lifo)->nup != 0) return -1;
free(*my_lifo);
(*my_lifo) = NULL;
return 0;
}
lifo_node * clenode(lifo **my_lifo, const char *name)
{
lifo_node *my_node;
my_node = (*my_lifo)->node;
if (my_node == NULL) return NULL;
while (my_node->daughter != NULL) {
if (strcmp(my_node->name, name) == 0) return my_node;
my_node = my_node->daughter;
}
if (strcmp(my_node->name, name) == 0) return my_node;
return NULL;
}
lifo_node * clepos(lifo **my_lifo, int_32 ipos)
{
lifo_node *my_node;
int_32 iloop;
if ((ipos > (*my_lifo)->nup - 1) || (ipos < 0)) return NULL;
my_node = (*my_lifo)->node;
for (iloop = 0; iloop < (*my_lifo)->nup - ipos - 1; ++iloop) {
my_node = my_node->daughter;
}
return my_node;
}
void clelib(lifo **my_lifo)
{
lifo_node *my_node;
int_32 iloop;
printf("\n lifo content:\n node type name........ access OSname/value\n");
for (iloop = 0; iloop < (*my_lifo)->nup; ++iloop) {
my_node = clepos(my_lifo, iloop);
if (abs((int)my_node->type) < 10) {
printf(" %4d (%4d) %12s (%2d) %s\n", (int)iloop, (int)my_node->type, my_node->name, (int)my_node->access, my_node->OSname);
} else if ((int)my_node->type == 11) {
printf(" %4d (%4d) %12s val = %d\n", (int)iloop, (int)my_node->type, my_node->name, my_node->value.ival);
} else if ((int)my_node->type == 12) {
printf(" %4d (%4d) %12s val = %e\n", (int)iloop, (int)my_node->type, my_node->name, my_node->value.fval);
} else if ((int)my_node->type == 13) {
printf(" %4d (%4d) %12s val = '%s'\n", (int)iloop, (int)my_node->type, my_node->name, my_node->value.hval);
} else if ((int)my_node->type == 14) {
printf(" %4d (%4d) %12s val = %e\n", (int)iloop, (int)my_node->type, my_node->name, my_node->value.dval);
} else if ((int)my_node->type == 15) {
printf(" %4d (%4d) %12s val = %d\n", (int)iloop, (int)my_node->type, my_node->name, my_node->value.ival);
} else {
printf(" %4d (%4d) %12s\n", (int)iloop, (int)my_node->type, my_node->name);
}
}
printf("\n access= 0:creation mode / 1:modification mode / 2:read-only mode\n\n");
}
|
