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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/* do not edit automatically generated by mc from mcStack. */
/* This file is part of GNU Modula-2.
GNU Modula-2 is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GNU Modula-2 is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include <stdbool.h>
# if !defined (PROC_D)
# define PROC_D
typedef void (*PROC_t) (void);
typedef struct { PROC_t proc; } PROC;
# endif
# include "GStorage.h"
# include "Gmcrts.h"
#if defined(__cplusplus)
# undef NULL
# define NULL 0
#endif
#define _mcStack_C
#include "GmcStack.h"
# include "GStorage.h"
# include "GIndexing.h"
# include "GM2RTS.h"
typedef struct mcStack__T1_r mcStack__T1;
typedef mcStack__T1 *mcStack_stack__opaque;
struct mcStack__T1_r {
Indexing_Index list;
unsigned int count;
};
/*
init - create and return a stack.
*/
extern "C" mcStack_stack mcStack_init (void);
/*
kill - deletes stack, s.
*/
extern "C" void mcStack_kill (mcStack_stack *s);
/*
push - an address, a, onto the stack, s.
It returns, a.
*/
extern "C" void * mcStack_push (mcStack_stack s, void * a);
/*
pop - and return the top element from stack, s.
*/
extern "C" void * mcStack_pop (mcStack_stack s);
/*
replace - performs a pop; push (a); return a.
*/
extern "C" void * mcStack_replace (mcStack_stack s, void * a);
/*
depth - returns the depth of the stack.
*/
extern "C" unsigned int mcStack_depth (mcStack_stack s);
/*
access - returns the, i, th stack element.
The top of stack is defined by:
access (s, depth (s)).
*/
extern "C" void * mcStack_access (mcStack_stack s, unsigned int i);
/*
init - create and return a stack.
*/
extern "C" mcStack_stack mcStack_init (void)
{
mcStack_stack__opaque s;
Storage_ALLOCATE ((void **) &s, sizeof (mcStack__T1));
s->list = Indexing_InitIndex (1);
s->count = 0;
return static_cast<mcStack_stack> (s);
/* static analysis guarentees a RETURN statement will be used before here. */
__builtin_unreachable ();
}
/*
kill - deletes stack, s.
*/
extern "C" void mcStack_kill (mcStack_stack *s)
{
static_cast<mcStack_stack__opaque> ((*s))->list = Indexing_KillIndex (static_cast<mcStack_stack__opaque> ((*s))->list);
Storage_DEALLOCATE ((void **) &(*s), sizeof (mcStack__T1));
(*s) = static_cast<mcStack_stack> (NULL);
}
/*
push - an address, a, onto the stack, s.
It returns, a.
*/
extern "C" void * mcStack_push (mcStack_stack s, void * a)
{
if (static_cast<mcStack_stack__opaque> (s)->count == 0)
{
Indexing_PutIndice (static_cast<mcStack_stack__opaque> (s)->list, Indexing_LowIndice (static_cast<mcStack_stack__opaque> (s)->list), a);
}
else
{
Indexing_PutIndice (static_cast<mcStack_stack__opaque> (s)->list, (Indexing_HighIndice (static_cast<mcStack_stack__opaque> (s)->list))+1, a);
}
static_cast<mcStack_stack__opaque> (s)->count += 1;
return a;
/* static analysis guarentees a RETURN statement will be used before here. */
__builtin_unreachable ();
}
/*
pop - and return the top element from stack, s.
*/
extern "C" void * mcStack_pop (mcStack_stack s)
{
void * a;
if (static_cast<mcStack_stack__opaque> (s)->count == 0)
{
M2RTS_HALT (-1);
__builtin_unreachable ();
}
else
{
static_cast<mcStack_stack__opaque> (s)->count -= 1;
a = Indexing_GetIndice (static_cast<mcStack_stack__opaque> (s)->list, Indexing_HighIndice (static_cast<mcStack_stack__opaque> (s)->list));
Indexing_DeleteIndice (static_cast<mcStack_stack__opaque> (s)->list, Indexing_HighIndice (static_cast<mcStack_stack__opaque> (s)->list));
return a;
}
ReturnException ("../../gcc/m2/mc/mcStack.def", 20, 1);
__builtin_unreachable ();
}
/*
replace - performs a pop; push (a); return a.
*/
extern "C" void * mcStack_replace (mcStack_stack s, void * a)
{
void * b;
b = mcStack_pop (s);
return mcStack_push (s, a);
/* static analysis guarentees a RETURN statement will be used before here. */
__builtin_unreachable ();
}
/*
depth - returns the depth of the stack.
*/
extern "C" unsigned int mcStack_depth (mcStack_stack s)
{
return static_cast<mcStack_stack__opaque> (s)->count;
/* static analysis guarentees a RETURN statement will be used before here. */
__builtin_unreachable ();
}
/*
access - returns the, i, th stack element.
The top of stack is defined by:
access (s, depth (s)).
*/
extern "C" void * mcStack_access (mcStack_stack s, unsigned int i)
{
if ((i > static_cast<mcStack_stack__opaque> (s)->count) || (i == 0))
{
M2RTS_HALT (-1);
__builtin_unreachable ();
}
else
{
return Indexing_GetIndice (static_cast<mcStack_stack__opaque> (s)->list, i);
}
ReturnException ("../../gcc/m2/mc/mcStack.def", 20, 1);
__builtin_unreachable ();
}
extern "C" void _M2_mcStack_init (__attribute__((unused)) int argc, __attribute__((unused)) char *argv[], __attribute__((unused)) char *envp[])
{
}
extern "C" void _M2_mcStack_fini (__attribute__((unused)) int argc, __attribute__((unused)) char *argv[], __attribute__((unused)) char *envp[])
{
}
|
