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
  
229
  
230
  
231
  
232
  
233
  
234
  
235
  
236
  
237
  
238
  
239
  
240
  
241
  
242
  
243
  
244
  
245
  
246
  
247
  
248
  
249
  
250
  
251
  
252
  
253
  
254
  
255
  
256
  
257
  
258
  
259
  
260
  
261
  
262
  
263
  
264
  
265
  
266
  
267
  
268
  
269
  
270
  
271
  
272
  
273
  
274
  
275
  
276
  
277
  
278
  
279
  
280
  
281
  
282
  
283
  
284
  
285
  
286
  
287
  
288
  
289
  
290
  
291
  
292
  
293
  
294
  
295
  
296
  
297
  
298
  
299
  
300
  
301
  
302
  
303
  
304
  
305
  
306
  
307
  
308
  
309
  
310
  
311
  
312
  
313
  
314
  
315
  
316
  
317
  
318
  
319
  
320
  
321
  
322
  
323
  
324
  
325
  
326
  
327
  
328
  
329
  
330
  
331
  
332
  
333
  
334
  
335
  
336
  
337
  
338
  
339
  
340
  
341
  
342
  
343
  
344
  
345
  
346
  
347
  
348
  
349
  
350
  
351
  
352
  
353
  
354
  
355
  
356
  
357
  
358
  
359
  
360
  
361
  
362
  
363
  
364
  
365
  
366
  
367
  
368
  
369
  
370
  
371
  
372
  
373
  
374
  
375
  
376
  
377
  
378
  
379
  
380
  
381
  
382
  
383
  
384
  
385
  
386
  
387
  
388
  
389
  
390
  
391
  
392
  
393
  
394
  
395
  
396
  
397
  
398
  
399
  
400
  
401
  
402
  
403
  
404
  
405
  
406
  
407
  
408
  
/* 
|| This file is part of Pike. For copyright information see COPYRIGHT. 
|| Pike is distributed under GPL, LGPL and MPL. See the file COPYING 
|| for more information. 
*/ 
 
#ifndef LAS_H 
#define LAS_H 
 
#include "global.h" 
#include "svalue.h" 
#include "dynamic_buffer.h" 
#include "block_allocator.h" 
 
#define MAX_GLOBAL_VARIABLES 1000 
typedef void (*c_fun)(INT32); 
 
 
/* Flags used by yytype_error() */ 
#define YYTE_IS_WARNING 1 
 
struct compiler_frame;          /* Avoid gcc warning. */ 
 
int islocal(struct pike_string *str); 
int low_add_local_name(struct compiler_frame *frame, 
                       struct pike_string *str, 
                       struct pike_type *type, 
                       node *def); 
int add_local_name(struct pike_string *str, 
                   struct pike_type *type, 
                   node *def); 
int verify_declared(struct pike_string *str); 
void cleanup_compiler(void); 
 
 
extern int cumulative_parse_error; 
 
 
#ifndef STRUCT_NODE_S_DECLARED 
#define STRUCT_NODE_S_DECLARED 
struct node_s; 
typedef struct node_s node; 
#endif 
 
/* local variable flags */ 
#define LOCAL_VAR_IS_USED               1 
 
struct local_variable 
{ 
  struct pike_string *name; 
  struct pike_type *type; 
  node *def; 
  /* FIXME: Consider moving these two to the def node above? */ 
  struct pike_string *file; 
  int line; 
  unsigned int flags; 
}; 
 
struct compiler_frame 
{ 
  struct compiler_frame *previous; 
 
  struct pike_type *current_type; 
  struct pike_type *current_return_type; 
  int current_number_of_locals; 
  int max_number_of_locals; 
  int min_number_of_locals; 
  int last_block_level; /* used to detect variables declared in same block */ 
  int num_args; 
  int lexical_scope; 
  int current_function_number; 
  int recur_label; 
  int is_inline; 
  unsigned int opt_flags; 
  struct local_variable variable[MAX_LOCAL]; 
}; 
 
/* Also used in struct node_identifier */ 
union node_data 
{ 
  struct 
  { 
    int number; 
    struct program *prog; 
  } id; 
  struct 
  { 
    int ident; 
    struct compiler_frame *frame; 
#ifdef SHARED_NODES 
    struct program *prog; 
#endif 
  } trampoline; 
  struct svalue sval; 
  struct 
  { 
    struct node_s *a, *b; 
  } node; 
  struct 
  { 
    struct node_identifier *a, *b; 
  } node_id; 
  struct 
  { 
    int a, b; 
  } integer; 
}; 
 
struct node_s 
{ 
  unsigned INT32 refs; 
  struct pike_string *current_file; 
  struct pike_type *type; 
  struct pike_string *name; 
  struct node_s *parent; 
  INT_TYPE line_number; 
  unsigned INT16 node_info; 
  unsigned INT16 tree_info; 
  unsigned INT16 pad; 
  /* The stuff from this point on is hashed. */ 
  unsigned INT16 token; 
  union node_data u; 
}; 
 
#define OPT_OPTIMIZED       0x1    /* has been processed by optimize(), 
                                    * only used in node_info 
                                    */ 
#define OPT_NOT_CONST       0x2    /* isn't constant */ 
#define OPT_SIDE_EFFECT     0x4    /* has side effects */ 
#define OPT_ASSIGNMENT      0x8    /* does assignments */ 
#define OPT_TRY_OPTIMIZE    0x10   /* might be worth optimizing */ 
#define OPT_EXTERNAL_DEPEND 0x20   /* the value depends on external 
                                    * influences (such as read_file or so) 
                                    */ 
#define OPT_CASE            0x40   /* contains case(s) */ 
#define OPT_CONTINUE        0x80   /* contains continue(s) */ 
#define OPT_BREAK           0x100  /* contains break(s) */ 
#define OPT_RETURN          0x200  /* contains return(s) */ 
#define OPT_TYPE_NOT_FIXED  0x400  /* type-field might be wrong */ 
#define OPT_WEAK_TYPE       0x800  /* don't warn even if strict types */ 
#define OPT_APPLY           0x1000 /* contains apply */ 
#define OPT_FLAG_NODE       0x2000 /* don't optimize away unless the 
                                    * parent also is optimized away */ 
#define OPT_SAFE            0x4000 /* Known to not throw error (which normally 
                                    * isn't counted as side effect). Only used 
                                    * in tree_info. */ 
 
 
/* This is a statement which got custom break/continue label handling. 
 * Set in compiler_frame. Beware: This is not a node flag! -Hubbe */ 
#define OPT_CUSTOM_LABELS   0x10000 
 
#define SCOPE_LOCAL 1 
#define SCOPE_SCOPED 2 
#define SCOPE_SCOPE_USED 4 
 
void count_memory_in_node_ss(size_t *num, size_t *size); 
 
/* Prototypes begin here */ 
int car_is_node(node *n); 
int cdr_is_node(node *n); 
void check_tree(node *n, int depth); 
INT32 count_args(node *n); 
struct pike_type *find_return_type(node *n); 
int check_tailrecursion(void); 
struct node_chunk; 
void free_all_nodes(void); 
void debug_free_node(node *n); 
node *debug_mknode(int token,node *a,node *b); 
node *debug_mkstrnode(struct pike_string *str); 
node *debug_mkintnode(INT_TYPE nr); 
node *debug_mknewintnode(INT_TYPE nr); 
node *debug_mkfloatnode(FLOAT_TYPE foo); 
node *debug_mkprgnode(struct program *p); 
node *debug_mkapplynode(node *func,node *args); 
node *debug_mkefuncallnode(char *function, node *args); 
node *debug_mkopernode(char *oper_id, node *arg1, node *arg2); 
node *debug_mkversionnode(int major, int minor); 
node *debug_mklocalnode(int var, int depth); 
node *debug_mkidentifiernode(int i); 
node *debug_mktrampolinenode(int i, struct compiler_frame *depth); 
node *debug_mkexternalnode(struct program *prog, int i); 
node *debug_mkthisnode(struct program *parent_prog, int inherit_num); 
node *debug_mkcastnode(struct pike_type *type, node *n); 
node *debug_mksoftcastnode(struct pike_type *type, node *n); 
void resolv_constant(node *n); 
void resolv_class(node *n); 
void resolv_class(node *n); 
node *index_node(node *n, char *node_name, struct pike_string *id); 
int node_is_eq(node *a,node *b); 
node *debug_mktypenode(struct pike_type *t); 
node *debug_mkconstantsvaluenode(const struct svalue *s); 
node *debug_mkliteralsvaluenode(const struct svalue *s); 
node *debug_mksvaluenode(struct svalue *s); 
node *copy_node(node *n); 
node *defrost_node(node *n); 
void optimize_node(node *); 
int is_const(node *n); 
int node_is_tossable(node *n); 
int node_is_true(node *n); 
int node_is_false(node *n); 
int node_may_overload(node *n, int lfun); 
node **last_cmd(node **a); 
node **my_get_arg(node **a,int n); 
node **is_call_to(node *n, c_fun f); 
void print_tree(node *n); 
struct used_vars; 
void fix_type_field(node *n); 
struct timer_oflo; 
ptrdiff_t eval_low(node *n,int print_error); 
int dooptcode(struct pike_string *name, 
              node *n, 
              struct pike_type *type, 
              int modifiers); 
void resolv_program(node *n); 
/* Prototypes end here */ 
 
/* Handling of nodes */ 
#define free_node(n)        debug_free_node(dmalloc_touch(node *,n)) 
 
#define mknode(token, a, b) dmalloc_touch(node *, debug_mknode(token, dmalloc_touch(node *, a), dmalloc_touch(node *, b))) 
#define mkstrnode(str)      dmalloc_touch(node *, debug_mkstrnode(str)) 
#define mkintnode(nr)       dmalloc_touch(node *, debug_mkintnode(nr)) 
#define mknewintnode(nr)    dmalloc_touch(node *, debug_mknewintnode(nr)) 
#define mkfloatnode(foo)    dmalloc_touch(node *, debug_mkfloatnode(foo)) 
#define mkprgnode(p)        dmalloc_touch(node *, debug_mkprgnode(p)) 
#define mkapplynode(func, args) dmalloc_touch(node *, debug_mkapplynode(dmalloc_touch(node *, func),dmalloc_touch(node *, args))) 
#define mkefuncallnode(function, args) dmalloc_touch(node *, debug_mkefuncallnode(function, dmalloc_touch(node *, args))) 
#define mkopernode(oper_id, arg1, arg2) dmalloc_touch(node *, debug_mkopernode(oper_id, dmalloc_touch(node *, arg1), dmalloc_touch(node *, arg2))) 
#define mkversionnode(major, minor) dmalloc_touch(node *, debug_mkversionnode(major, minor)) 
#define mklocalnode(var, depth) dmalloc_touch(node *, debug_mklocalnode(var, depth)) 
#define mkidentifiernode(i) dmalloc_touch(node *, debug_mkidentifiernode(i)) 
#define mktrampolinenode(i,f) dmalloc_touch(node *, debug_mktrampolinenode(i, f)) 
#define mkexternalnode(parent_prog, i) dmalloc_touch(node *, debug_mkexternalnode(parent_prog, i)) 
#define mkthisnode(parent_prog, i) dmalloc_touch(node *, debug_mkthisnode(parent_prog, i)) 
#define mkcastnode(type, n) dmalloc_touch(node *, debug_mkcastnode(type, dmalloc_touch(node *, n))) 
#define mksoftcastnode(type, n) dmalloc_touch(node *, debug_mksoftcastnode(type, dmalloc_touch(node *, n))) 
#define mktypenode(t)       dmalloc_touch(node *, debug_mktypenode(t)) 
#define mkconstantsvaluenode(s) dmalloc_touch(node *, debug_mkconstantsvaluenode(dmalloc_touch(struct svalue *, s))) 
#define mkliteralsvaluenode(s) dmalloc_touch(node *, debug_mkliteralsvaluenode(dmalloc_touch(struct svalue *, s))) 
#define mksvaluenode(s)     dmalloc_touch(node *, debug_mksvaluenode(dmalloc_touch(struct svalue *, s))) 
 
#define COPY_LINE_NUMBER_INFO(TO, FROM) do {                            \ 
    node *to_ = (TO), *from_ = (FROM);                                  \ 
    if (from_) {                                                        \ 
      to_->line_number = from_->line_number;                            \ 
      free_string (to_->current_file);                                  \ 
      copy_shared_string (to_->current_file, from_->current_file);      \ 
    }                                                                   \ 
  } while (0) 
 
 
/* lvalue variants of CAR(n) & CDR(n) */ 
#define _CAR(n) (dmalloc_touch(node *,(n))->u.node.a) 
#define _CDR(n) (dmalloc_touch(node *,(n))->u.node.b) 
#define _CAAR(n) _CAR(_CAR(n)) 
#define _CADR(n) _CAR(_CDR(n)) 
#define _CDAR(n) _CDR(_CAR(n)) 
#define _CDDR(n) _CDR(_CDR(n)) 
 
#ifdef SHARED_NODES 
#define ADD_NODE_REF(n) do { if (n) add_ref(n); } while(0) 
#define ADD_NODE_REF2(n, code)  do { ADD_NODE_REF(n); code; } while(0) 
#else /* !SHARED_NODES */ 
#define ADD_NODE_REF(n) (n = 0) 
#define ADD_NODE_REF2(n, code)  do { code; n = 0;} while(0) 
#endif /* SHARED_NODES */ 
 
#define CAR(n) _CAR(n) 
#define CDR(n) _CDR(n) 
#define CAAR(n) CAR(CAR(n)) 
#define CADR(n) CAR(CDR(n)) 
#define CDAR(n) CDR(CAR(n)) 
#define CDDR(n) CDR(CDR(n)) 
#define CAAAR(n) CAR(CAR(CAR(n))) 
#define CAADR(n) CAR(CAR(CDR(n))) 
#define CADAR(n) CAR(CDR(CAR(n))) 
#define CADDR(n) CAR(CDR(CDR(n))) 
#define CDAAR(n) CDR(CAR(CAR(n))) 
#define CDADR(n) CDR(CAR(CDR(n))) 
#define CDDAR(n) CDR(CDR(CAR(n))) 
#define CDDDR(n) CDR(CDR(CDR(n))) 
#define CAAAAR(n) CAR(CAR(CAR(CAR(n)))) 
#define CAAADR(n) CAR(CAR(CAR(CDR(n)))) 
#define CAADAR(n) CAR(CAR(CDR(CAR(n)))) 
#define CAADDR(n) CAR(CAR(CDR(CDR(n)))) 
#define CADAAR(n) CAR(CDR(CAR(CAR(n)))) 
#define CADADR(n) CAR(CDR(CAR(CDR(n)))) 
#define CADDAR(n) CAR(CDR(CDR(CAR(n)))) 
#define CADDDR(n) CAR(CDR(CDR(CDR(n)))) 
#define CDAAAR(n) CDR(CAR(CAR(CAR(n)))) 
#define CDAADR(n) CDR(CAR(CAR(CDR(n)))) 
#define CDADAR(n) CDR(CAR(CDR(CAR(n)))) 
#define CDADDR(n) CDR(CAR(CDR(CDR(n)))) 
#define CDDAAR(n) CDR(CDR(CAR(CAR(n)))) 
#define CDDADR(n) CDR(CDR(CAR(CDR(n)))) 
#define CDDDAR(n) CDR(CDR(CDR(CAR(n)))) 
#define CDDDDR(n) CDR(CDR(CDR(CDR(n)))) 
#define CAAAAAR(n) CAR(CAR(CAR(CAR(CAR(n))))) 
#define CAAAADR(n) CAR(CAR(CAR(CAR(CDR(n))))) 
#define CAAADAR(n) CAR(CAR(CAR(CDR(CAR(n))))) 
#define CAAADDR(n) CAR(CAR(CAR(CDR(CDR(n))))) 
#define CAADAAR(n) CAR(CAR(CDR(CAR(CAR(n))))) 
#define CAADADR(n) CAR(CAR(CDR(CAR(CDR(n))))) 
#define CAADDAR(n) CAR(CAR(CDR(CDR(CAR(n))))) 
#define CAADDDR(n) CAR(CAR(CDR(CDR(CDR(n))))) 
#define CADAAAR(n) CAR(CDR(CAR(CAR(CAR(n))))) 
#define CADAADR(n) CAR(CDR(CAR(CAR(CDR(n))))) 
#define CADADAR(n) CAR(CDR(CAR(CDR(CAR(n))))) 
#define CADADDR(n) CAR(CDR(CAR(CDR(CDR(n))))) 
#define CADDAAR(n) CAR(CDR(CDR(CAR(CAR(n))))) 
#define CADDADR(n) CAR(CDR(CDR(CAR(CDR(n))))) 
#define CADDDAR(n) CAR(CDR(CDR(CDR(CAR(n))))) 
#define CADDDDR(n) CAR(CDR(CDR(CDR(CDR(n))))) 
#define CDAAAAR(n) CDR(CAR(CAR(CAR(CAR(n))))) 
#define CDAAADR(n) CDR(CAR(CAR(CAR(CDR(n))))) 
#define CDAADAR(n) CDR(CAR(CAR(CDR(CAR(n))))) 
#define CDAADDR(n) CDR(CAR(CAR(CDR(CDR(n))))) 
#define CDADAAR(n) CDR(CAR(CDR(CAR(CAR(n))))) 
#define CDADADR(n) CDR(CAR(CDR(CAR(CDR(n))))) 
#define CDADDAR(n) CDR(CAR(CDR(CDR(CAR(n))))) 
#define CDADDDR(n) CDR(CAR(CDR(CDR(CDR(n))))) 
#define CDDAAAR(n) CDR(CDR(CAR(CAR(CAR(n))))) 
#define CDDAADR(n) CDR(CDR(CAR(CAR(CDR(n))))) 
#define CDDADAR(n) CDR(CDR(CAR(CDR(CAR(n))))) 
#define CDDADDR(n) CDR(CDR(CAR(CDR(CDR(n))))) 
#define CDDDAAR(n) CDR(CDR(CDR(CAR(CAR(n))))) 
#define CDDDADR(n) CDR(CDR(CDR(CAR(CDR(n))))) 
#define CDDDDAR(n) CDR(CDR(CDR(CDR(CAR(n))))) 
#define CDDDDDR(n) CDR(CDR(CDR(CDR(CDR(n))))) 
#define CAAAAAAR(n) CAR(CAR(CAR(CAR(CAR(CAR(n)))))) 
#define CAAAAADR(n) CAR(CAR(CAR(CAR(CAR(CDR(n)))))) 
#define CAAAADAR(n) CAR(CAR(CAR(CAR(CDR(CAR(n)))))) 
#define CAAAADDR(n) CAR(CAR(CAR(CAR(CDR(CDR(n)))))) 
#define CAAADAAR(n) CAR(CAR(CAR(CDR(CAR(CAR(n)))))) 
#define CAAADADR(n) CAR(CAR(CAR(CDR(CAR(CDR(n)))))) 
#define CAAADDAR(n) CAR(CAR(CAR(CDR(CDR(CAR(n)))))) 
#define CAAADDDR(n) CAR(CAR(CAR(CDR(CDR(CDR(n)))))) 
#define CAADAAAR(n) CAR(CAR(CDR(CAR(CAR(CAR(n)))))) 
#define CAADAADR(n) CAR(CAR(CDR(CAR(CAR(CDR(n)))))) 
#define CAADADAR(n) CAR(CAR(CDR(CAR(CDR(CAR(n)))))) 
#define CAADADDR(n) CAR(CAR(CDR(CAR(CDR(CDR(n)))))) 
#define CAADDAAR(n) CAR(CAR(CDR(CDR(CAR(CAR(n)))))) 
#define CAADDADR(n) CAR(CAR(CDR(CDR(CAR(CDR(n)))))) 
#define CAADDDAR(n) CAR(CAR(CDR(CDR(CDR(CAR(n)))))) 
#define CAADDDDR(n) CAR(CAR(CDR(CDR(CDR(CDR(n)))))) 
#define CADAAAAR(n) CAR(CDR(CAR(CAR(CAR(CAR(n)))))) 
#define CADAAADR(n) CAR(CDR(CAR(CAR(CAR(CDR(n)))))) 
#define CADAADAR(n) CAR(CDR(CAR(CAR(CDR(CAR(n)))))) 
#define CADAADDR(n) CAR(CDR(CAR(CAR(CDR(CDR(n)))))) 
#define CADADAAR(n) CAR(CDR(CAR(CDR(CAR(CAR(n)))))) 
#define CADADADR(n) CAR(CDR(CAR(CDR(CAR(CDR(n)))))) 
#define CADADDAR(n) CAR(CDR(CAR(CDR(CDR(CAR(n)))))) 
#define CADADDDR(n) CAR(CDR(CAR(CDR(CDR(CDR(n)))))) 
#define CADDAAAR(n) CAR(CDR(CDR(CAR(CAR(CAR(n)))))) 
#define CADDAADR(n) CAR(CDR(CDR(CAR(CAR(CDR(n)))))) 
#define CADDADAR(n) CAR(CDR(CDR(CAR(CDR(CAR(n)))))) 
#define CADDADDR(n) CAR(CDR(CDR(CAR(CDR(CDR(n)))))) 
#define CADDDAAR(n) CAR(CDR(CDR(CDR(CAR(CAR(n)))))) 
#define CADDDADR(n) CAR(CDR(CDR(CDR(CAR(CDR(n)))))) 
#define CADDDDAR(n) CAR(CDR(CDR(CDR(CDR(CAR(n)))))) 
#define CADDDDDR(n) CAR(CDR(CDR(CDR(CDR(CDR(n)))))) 
#define CDAAAAAR(n) CDR(CAR(CAR(CAR(CAR(CAR(n)))))) 
#define CDAAAADR(n) CDR(CAR(CAR(CAR(CAR(CDR(n)))))) 
#define CDAAADAR(n) CDR(CAR(CAR(CAR(CDR(CAR(n)))))) 
#define CDAAADDR(n) CDR(CAR(CAR(CAR(CDR(CDR(n)))))) 
#define CDAADAAR(n) CDR(CAR(CAR(CDR(CAR(CAR(n)))))) 
#define CDAADADR(n) CDR(CAR(CAR(CDR(CAR(CDR(n)))))) 
#define CDAADDAR(n) CDR(CAR(CAR(CDR(CDR(CAR(n)))))) 
#define CDAADDDR(n) CDR(CAR(CAR(CDR(CDR(CDR(n)))))) 
#define CDADAAAR(n) CDR(CAR(CDR(CAR(CAR(CAR(n)))))) 
#define CDADAADR(n) CDR(CAR(CDR(CAR(CAR(CDR(n)))))) 
#define CDADADAR(n) CDR(CAR(CDR(CAR(CDR(CAR(n)))))) 
#define CDADADDR(n) CDR(CAR(CDR(CAR(CDR(CDR(n)))))) 
#define CDADDAAR(n) CDR(CAR(CDR(CDR(CAR(CAR(n)))))) 
#define CDADDADR(n) CDR(CAR(CDR(CDR(CAR(CDR(n)))))) 
#define CDADDDAR(n) CDR(CAR(CDR(CDR(CDR(CAR(n)))))) 
#define CDADDDDR(n) CDR(CAR(CDR(CDR(CDR(CDR(n)))))) 
#define CDDAAAAR(n) CDR(CDR(CAR(CAR(CAR(CAR(n)))))) 
#define CDDAAADR(n) CDR(CDR(CAR(CAR(CAR(CDR(n)))))) 
#define CDDAADAR(n) CDR(CDR(CAR(CAR(CDR(CAR(n)))))) 
#define CDDAADDR(n) CDR(CDR(CAR(CAR(CDR(CDR(n)))))) 
#define CDDADAAR(n) CDR(CDR(CAR(CDR(CAR(CAR(n)))))) 
#define CDDADADR(n) CDR(CDR(CAR(CDR(CAR(CDR(n)))))) 
#define CDDADDAR(n) CDR(CDR(CAR(CDR(CDR(CAR(n)))))) 
#define CDDADDDR(n) CDR(CDR(CAR(CDR(CDR(CDR(n)))))) 
#define CDDDAAAR(n) CDR(CDR(CDR(CAR(CAR(CAR(n)))))) 
#define CDDDAADR(n) CDR(CDR(CDR(CAR(CAR(CDR(n)))))) 
#define CDDDADAR(n) CDR(CDR(CDR(CAR(CDR(CAR(n)))))) 
#define CDDDADDR(n) CDR(CDR(CDR(CAR(CDR(CDR(n)))))) 
#define CDDDDAAR(n) CDR(CDR(CDR(CDR(CAR(CAR(n)))))) 
#define CDDDDADR(n) CDR(CDR(CDR(CDR(CAR(CDR(n)))))) 
#define CDDDDDAR(n) CDR(CDR(CDR(CDR(CDR(CAR(n)))))) 
#define CDDDDDDR(n) CDR(CDR(CDR(CDR(CDR(CDR(n)))))) 
 
#define GAUGE_RUSAGE_INDEX 0 
 
#define add_to_mem_block(N,Data,Size) low_my_binary_strcat(Data,Size,areas+N) 
#define IDENTIFIERP(i) (Pike_compiler->new_program->identifier_references+(i)) 
#define INHERIT(i) (Pike_compiler->new_program->inherits+(i)) 
#define PIKE_PC (Pike_compiler->new_program->num_program) 
 
#ifndef PIKE_DEBUG 
#define check_tree(X,Y) 
#endif 
 
#endif