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
|
/* CIL evaluation stack
Copyright (C) 2006 Free Software Foundation, Inc.
This program 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 2, or (at your option) any
later version.
This program 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 this program; if not, write to the Free Software
Foundation, 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
In other words, you are welcome to use, share and improve this program.
You are forbidden to forbid anyone else to use, share and improve
what you give them. Help stamp out software-hoarding!
Author:
Ricardo Fernandez Pascual <ricardof@um.es>
*/
#ifndef GCC_CIL_STACK_H
#include "system.h"
#include "coretypes.h"
#include "tree.h"
typedef enum
{
CIL_STACK_TYPE_INT32,
CIL_STACK_TYPE_INT64,
CIL_STACK_TYPE_NATIVE_INT,
CIL_STACK_TYPE_F,
CIL_STACK_TYPE_MANAGED_POINTER,
CIL_STACK_TYPE_OBJECT,
CIL_STACK_TYPE_ERROR
}
CilStackType;
tree cil_stack_get_tree_type_for_cil_stack_type (CilStackType ct);
void cil_stack_init (void);
void cil_stack_push (tree item, CilStackType type);
void cil_stack_push_infer_type (tree item);
tree cil_stack_pop (CilStackType *type);
tree cil_stack_peek (unsigned int depth, CilStackType *type);
bool cil_stack_is_empty (void);
void cil_stack_debug_dump (void);
#endif /* GCC_CIL_STACK_H */
|
