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
|
#ifndef _COLM_STRUCT_H
#define _COLM_STRUCT_H
#if defined(__cplusplus)
extern "C" {
#endif
typedef struct _StreamImpl StreamImpl;
typedef void (*colm_destructor_t)( struct colm_program *prg,
Tree **sp, struct colm_struct *s );
struct colm_struct
{
short id;
struct colm_struct *prev, *next;
};
/* Must overlay colm_struct. */
struct colm_inbuilt
{
short id;
struct colm_struct *prev, *next;
colm_destructor_t destructor;
};
/* Must overlay colm_inbuilt. */
typedef struct colm_parser
{
short id;
struct colm_struct *prev, *next;
colm_destructor_t destructor;
void *buffer[10];
struct _PdaRun *pdaRun;
struct colm_stream *input;
Tree *result;
} Parser;
/* Must overlay colm_inbuilt. */
typedef struct colm_stream
{
short id;
struct colm_struct *prev, *next;
colm_destructor_t destructor;
void *buffer[8];
StreamImpl *impl;
} Stream;
/* Must overlay colm_inbuilt. */
typedef struct colm_list
{
short id;
struct colm_struct *prev, *next;
colm_destructor_t destructor;
void *buffer[8];
ListEl *head, *tail;
long listLen;
GenericInfo *genericInfo;
} List;
typedef struct _MapEl
{
/* Must overlay Kid. */
Tree *tree;
struct _MapEl *next;
struct _MapEl *prev;
struct _MapEl *left, *right, *parent;
long height;
Tree *key;
} MapEl;
typedef struct colm_map
{
short id;
struct colm_struct *prev, *next;
colm_destructor_t destructor;
void *buffer[8];
MapEl *head;
MapEl *tail;
MapEl *root;
long treeSize;
GenericInfo *genericInfo;
} Map;
struct colm_struct *colm_struct_new( struct colm_program *prg, int id );
void colm_struct_delete( struct colm_program *prg, struct colm_tree **sp,
struct colm_struct *el );
struct colm_struct *colm_struct_inbuilt( struct colm_program *prg, int size,
colm_destructor_t destructor );
#define colm_struct_get_field( obj, field ) \
((struct colm_tree**)(((struct colm_struct*)obj)+1))[field]
#define colm_struct_set_field( obj, field, val ) \
((struct colm_tree**)(((struct colm_struct*)obj)+1))[field] = val
#define colm_struct_get_field_type( obj, type, field ) \
((type*)(((struct colm_struct*)obj)+1))[field]
#define colm_struct_set_field_type( obj, type, field, val ) \
((type*)(((struct colm_struct*)obj)+1))[field] = val
Parser *colm_parser_new( struct colm_program *prg, GenericInfo *gi );
Stream *colm_stream_new( struct colm_program *prg );
Stream *colm_stream_new2( struct colm_program *prg );
List *colm_list_new( struct colm_program *prg );
Map *colm_map_new( struct colm_program *prg );
#if defined(__cplusplus)
}
#endif
#endif
|
