-
Notifications
You must be signed in to change notification settings - Fork 11
/
mclifo.c
191 lines (171 loc) · 4.77 KB
/
mclifo.c
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
/*
Copyright ESIEE (2009)
m.couprie@esiee.fr
This software is an image processing library whose purpose is to be
used primarily for research and teaching.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
/*
Librairie mclifo :
fonctions pour la gestion d'une liste lifo
Michel Couprie 1996
*/
/* #define TESTLifo */
#include <stdio.h>
#include <stdint.h>
#include <sys/types.h>
#include <stdlib.h>
#include <mclifo.h>
/* ==================================== */
Lifo * CreeLifoVide(index_t taillemax)
/* ==================================== */
{
Lifo * L = (Lifo *)calloc(1,sizeof(Lifo) + sizeof(index_t) * (taillemax-1));
if (L == NULL)
{
#ifdef MC_64_BITS
fprintf(stderr, "CreeLifoVide() : malloc failed : %lld bytes\n", sizeof(Lifo) + sizeof(index_t) * (taillemax-1));
#else
fprintf(stderr, "CreeLifoVide() : malloc failed : %ld bytes\n", sizeof(Lifo) + sizeof(index_t) * (taillemax-1));
#endif
return NULL;
}
L->Max = taillemax;
L->Sp = 0;
return L;
}
/* ==================================== */
void LifoFlush(Lifo * L)
/* ==================================== */
{
L->Sp = 0;
}
/* ==================================== */
index_t LifoVide(Lifo * L)
/* ==================================== */
{
return (L->Sp == 0);
}
/* ==================================== */
index_t LifoPop(Lifo * L)
/* ==================================== */
{
if (L->Sp == 0)
{
fprintf(stderr, "erreur Lifo vide\n");
exit(1);
}
L->Sp -= 1;
return L->Pts[L->Sp];
}
/* ==================================== */
index_t LifoHead(Lifo * L)
/* ==================================== */
{
if (L->Sp == 0)
{
fprintf(stderr, "erreur Lifo vide\n");
exit(1);
}
return L->Pts[L->Sp-1];
}
/* ==================================== */
void LifoPush(Lifo * L, index_t V)
/* ==================================== */
{
if (L->Sp > L->Max - 1)
{
fprintf(stderr, "erreur Lifo pleine\n");
exit(1);
}
L->Pts[L->Sp] = V;
L->Sp += 1;
}
/* ==================================== */
void LifoPrint(Lifo * L)
/* ==================================== */
{
index_t i;
if (LifoVide(L)) {printf("[]"); return;}
printf("[ ");
for (i = 0; i < L->Sp; i++)
#ifdef MC_64_BITS
printf("%lld ", L->Pts[i]);
#else
printf("%d ", L->Pts[i]);
#endif
printf("]");
}
/* ==================================== */
void LifoPrintLine(Lifo * L)
/* ==================================== */
{
index_t i;
if (LifoVide(L)) {printf("[]\n"); return;}
printf("[ ");
for (i = 0; i < L->Sp; i++)
#ifdef MC_64_BITS
printf("%lld ", L->Pts[i]);
#else
printf("%d ", L->Pts[i]);
#endif
printf("]\n");
}
/* ==================================== */
void LifoTermine(Lifo * L)
/* ==================================== */
{
free(L);
}
#ifdef TESTLifo
void main()
{
Lifo * L = CreeLifoVide(3);
LifoPrint(L);
if (LifoVide(L)) printf("LifoVide OUI\n");
LifoPush(L,1);
LifoPrint(L);
if (!LifoVide(L)) printf("LifoVide NON\n");
LifoPush(L,2);
LifoPrint(L);
LifoPush(L,3);
LifoPrint(L);
printf("LifoPop %d attendu 3\n", LifoPop(L));
LifoPrint(L);
LifoPush(L,4);
LifoPrint(L);
printf("LifoPop %d attendu 4\n", LifoPop(L));
LifoPrint(L);
printf("LifoPop %d attendu 2\n", LifoPop(L));
LifoPrint(L);
printf("LifoPop %d attendu 1\n", LifoPop(L));
LifoPrint(L);
if (LifoVide(L)) printf("LifoVide OUI\n");
printf("maintenant sortie attendue sur lifo pleine :\n");
LifoPush(L,3);
LifoPush(L,3);
LifoPush(L,3);
LifoPush(L,3);
}
#endif