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
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
|
/* Functions related to mangling class names for the GNU compiler
for the Java(TM) language.
Copyright (C) 1998, 1999, 2001 Free Software Foundation, Inc.
This file is part of GNU CC.
GNU CC 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.
GNU CC 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 GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
Java and all Java-based marks are trademarks or registered trademarks
of Sun Microsystems, Inc. in the United States and other countries.
The Free Software Foundation is independent of Sun Microsystems, Inc. */
/* Written by Per Bothner <bothner@cygnus.com> */
#include "config.h"
#include "system.h"
#include "jcf.h"
#include "tree.h"
#include "java-tree.h"
#include "obstack.h"
#include "toplev.h"
#include "obstack.h"
#include "ggc.h"
static void mangle_field_decl PARAMS ((tree));
static void mangle_method_decl PARAMS ((tree));
static void mangle_type PARAMS ((tree));
static void mangle_pointer_type PARAMS ((tree));
static void mangle_array_type PARAMS ((tree));
static int mangle_record_type PARAMS ((tree, int));
static int find_compression_pointer_match PARAMS ((tree));
static int find_compression_array_match PARAMS ((tree));
static int find_compression_record_match PARAMS ((tree, tree *));
static int find_compression_array_template_match PARAMS ((tree));
static void set_type_package_list PARAMS ((tree));
static int entry_match_pointer_p PARAMS ((tree, int));
static void emit_compression_string PARAMS ((int));
static void init_mangling PARAMS ((struct obstack *));
static tree finish_mangling PARAMS ((void));
static void compression_table_add PARAMS ((tree));
static void append_unicode_mangled_name PARAMS ((const char *, int));
static void append_gpp_mangled_name PARAMS ((const char *, int));
static int unicode_mangling_length PARAMS ((const char *, int));
static int mangle_member_name PARAMS ((tree));
/* We use an incoming obstack, always to be provided to the interface
functions. */
struct obstack *mangle_obstack;
#define MANGLE_RAW_STRING(S) \
obstack_grow (mangle_obstack, (S), sizeof (S)-1)
/* This is the mangling interface: a decl, a class field (.class) and
the vtable. */
tree
java_mangle_decl (obstack, decl)
struct obstack *obstack;
tree decl;
{
init_mangling (obstack);
switch (TREE_CODE (decl))
{
case VAR_DECL:
mangle_field_decl (decl);
break;
case FUNCTION_DECL:
mangle_method_decl (decl);
break;
default:
fatal ("Can't mangle `%s\' -- java_mangle_decl",
tree_code_name [TREE_CODE (decl)]);
}
return finish_mangling ();
}
tree
java_mangle_class_field (obstack, type)
struct obstack *obstack;
tree type;
{
init_mangling (obstack);
mangle_record_type (type, /* from_pointer = */ 0);
MANGLE_RAW_STRING ("6class$");
obstack_1grow (mangle_obstack, 'E');
return finish_mangling ();
}
tree
java_mangle_vtable (obstack, type)
struct obstack *obstack;
tree type;
{
init_mangling (obstack);
MANGLE_RAW_STRING ("TV");
mangle_record_type (type, /* from_pointer = */ 0);
obstack_1grow (mangle_obstack, 'E');
return finish_mangling ();
}
/* Beginning of the helper functions */
/* This mangles a field decl */
static void
mangle_field_decl (decl)
tree decl;
{
tree name = DECL_NAME (decl);
int field_name_needs_escapes = 0;
/* Mangle the name of the this the field belongs to */
mangle_record_type (DECL_CONTEXT (decl), /* from_pointer = */ 0);
/* Mangle the name of the field */
field_name_needs_escapes = mangle_member_name (name);
/* Terminate the mangled name */
obstack_1grow (mangle_obstack, 'E');
if (field_name_needs_escapes)
obstack_1grow (mangle_obstack, 'U');
}
/* This mangles a method decl, first mangling its name and then all
its arguments. */
static void
mangle_method_decl (mdecl)
tree mdecl;
{
tree method_name = DECL_NAME (mdecl);
tree arglist;
int method_name_needs_escapes = 0;
/* Mangle the name of the type that contains mdecl */
mangle_record_type (DECL_CONTEXT (mdecl), /* from_pointer = */ 0);
/* Before working on the method name, get to it. It might be burried
in a WFL. */
if (TREE_CODE (method_name) == EXPR_WITH_FILE_LOCATION)
method_name = java_get_real_method_name (mdecl);
/* Mangle the function name. There three cases
- mdecl is java.lang.Object.Object(), use `C2' for its name
(denotes a base object constructor.)
- mdecl is a constructor, use `C1' for its name, (denotes a
complete object constructor.)
- mdecl is not a constructor, standard mangling is performed.
We terminate the mangled function name with a `E'. */
if (ID_INIT_P (method_name))
{
if (DECL_CONTEXT (mdecl) == object_type_node)
obstack_grow (mangle_obstack, "C2", 2);
else
obstack_grow (mangle_obstack, "C1", 2);
}
else
method_name_needs_escapes = mangle_member_name (method_name);
obstack_1grow (mangle_obstack, 'E');
/* We mangled type.methodName. Now onto the arguments. */
arglist = TYPE_ARG_TYPES (TREE_TYPE (mdecl));
if (TREE_CODE (TREE_TYPE (mdecl)) == METHOD_TYPE)
arglist = TREE_CHAIN (arglist);
/* No arguments is easy. We shortcut it. */
if (arglist == end_params_node)
obstack_1grow (mangle_obstack, 'v');
else
{
tree arg;
for (arg = arglist; arg != end_params_node; arg = TREE_CHAIN (arg))
mangle_type (TREE_VALUE (arg));
}
/* Terminate the mangled name */
if (method_name_needs_escapes)
obstack_1grow (mangle_obstack, 'U');
}
/* This mangles a member name, like a function name or a field
name. Handle cases were `name' is a C++ keyword. Return a non zero
value if unicode encoding was required. */
static int
mangle_member_name (name)
tree name;
{
const char * name_string = IDENTIFIER_POINTER (name);
int len = IDENTIFIER_LENGTH (name);
int to_return = 0;
if (unicode_mangling_length (name_string, len) > 0)
{
append_unicode_mangled_name (name_string, len);
to_return = 1;
}
else
append_gpp_mangled_name (name_string, len);
/* If NAME happens to be a C++ keyword, add `$' or `.' or `_'. */
if (cxx_keyword_p (IDENTIFIER_POINTER (name), IDENTIFIER_LENGTH (name)))
{
#ifndef NO_DOLLAR_IN_LABEL
obstack_1grow (mangle_obstack, '$');
#else /* NO_DOLLAR_IN_LABEL */
#ifndef NO_DOT_IN_LABEL
obstack_1grow (mangle_obstack, '.');
#else /* NO_DOT_IN_LABEL */
obstack_1grow (mangle_obstack, '_');
#endif /* NO_DOT_IN_LABEL */
#endif /* NO_DOLLAR_IN_LABEL */
}
return to_return;
}
/* Assuming (NAME, LEN) is a Utf8-encoding string, calculate
the length of the string as mangled (a la g++) including Unicode escapes.
If no escapes are needed, return 0. */
static int
unicode_mangling_length (name, len)
const char *name;
int len;
{
const unsigned char *ptr;
const unsigned char *limit = (const unsigned char *)name + len;
int need_escapes = 0;
int num_chars = 0;
int underscores = 0;
for (ptr = (const unsigned char *) name; ptr < limit; )
{
int ch = UTF8_GET(ptr, limit);
if (ch < 0)
error ("internal error - invalid Utf8 name");
if (ch >= '0' && ch <= '9')
need_escapes += num_chars == 0;
else if (ch == '_')
underscores++;
else if (ch != '$' && (ch < 'a' || ch > 'z') && (ch < 'A' || ch > 'Z'))
need_escapes++;
num_chars++;
}
if (need_escapes)
return num_chars + 4 * (need_escapes + underscores);
else
return 0;
}
/* Assuming (NAME, LEN) is a Utf8-encoding string, emit the string
appropriately mangled (with Unicode escapes) to OBSTACK. */
static void
append_unicode_mangled_name (name, len)
const char *name;
int len;
{
const unsigned char *ptr;
const unsigned char *limit = (const unsigned char *)name + len;
for (ptr = (const unsigned char *) name; ptr < limit; )
{
int ch = UTF8_GET(ptr, limit);
int emit_escape;
if (ch < 0)
{
error ("internal error - bad Utf8 string");
break;
}
if (ch >= '0' && ch <= '9')
emit_escape = (ptr == (const unsigned char *) name);
else
emit_escape = (ch < 'a' || ch > 'z') && (ch < 'A' || ch > 'Z');
if (emit_escape)
{
char buf[6];
sprintf (buf, "_%04x", ch);
obstack_grow (mangle_obstack, buf, 5);
}
else
{
obstack_1grow (mangle_obstack, ch);
}
}
}
/* Assuming (NAME, LEN) is a Utf8-encoding string, emit the string
appropriately mangled (with Unicode escapes if needed) to OBSTACK. */
static void
append_gpp_mangled_name (name, len)
const char *name;
int len;
{
int encoded_len = unicode_mangling_length (name, len);
int needs_escapes = encoded_len > 0;
char buf[6];
if (needs_escapes)
{
sprintf (buf, "U%d", encoded_len);
obstack_grow (mangle_obstack, buf, strlen(buf));
append_unicode_mangled_name (name, len);
}
else
{
sprintf (buf, "%d", len);
obstack_grow (mangle_obstack, buf, strlen(buf));
obstack_grow (mangle_obstack, name, len);
}
}
/* Append the mangled name of TYPE onto OBSTACK. */
static void
mangle_type (type)
tree type;
{
switch (TREE_CODE (type))
{
char code;
case BOOLEAN_TYPE: code = 'b'; goto primitive;
case CHAR_TYPE: code = 'w'; goto primitive;
case VOID_TYPE: code = 'v'; goto primitive;
case INTEGER_TYPE:
/* Get the original type instead of the arguments promoted type.
Avoid symbol name clashes. Should call a function to do that.
FIXME. */
if (type == promoted_short_type_node)
type = short_type_node;
if (type == promoted_byte_type_node)
type = byte_type_node;
switch (TYPE_PRECISION (type))
{
case 8: code = 'c'; goto primitive;
case 16: code = 's'; goto primitive;
case 32: code = 'i'; goto primitive;
case 64: code = 'x'; goto primitive;
default: goto bad_type;
}
primitive:
obstack_1grow (mangle_obstack, code);
break;
case REAL_TYPE:
switch (TYPE_PRECISION (type))
{
case 32: code = 'f'; goto primitive;
case 64: code = 'd'; goto primitive;
default: goto bad_type;
}
case POINTER_TYPE:
if (TYPE_ARRAY_P (TREE_TYPE (type)))
mangle_array_type (type);
else
mangle_pointer_type (type);
break;
bad_type:
default:
fatal ("internal error - trying to mangle unknown type");
}
}
/* The compression table is a vector that keeps track of things we've
already seen, so they can be reused. For example, java.lang.Object
Would generate three entries: two package names and a type. If
java.lang.String is presented next, the java.lang will be matched
against the first two entries (and kept for compression as S_0), and
type String would be added to the table. See mangle_record_type.
COMPRESSION_NEXT is the index to the location of the next insertion
of an element. */
static tree compression_table;
static int compression_next;
/* Find a POINTER_TYPE in the compression table. Use a special
function to match pointer entries and start from the end */
static int
find_compression_pointer_match (type)
tree type;
{
int i;
for (i = compression_next-1; i >= 0; i--)
if (entry_match_pointer_p (type, i))
return i;
return -1;
}
/* Already recorder arrays are handled like pointer as they're always
associated with it. */
static int
find_compression_array_match (type)
tree type;
{
return find_compression_pointer_match (type);
}
/* Match the table of type against STRING. */
static int
find_compression_array_template_match (string)
tree string;
{
int i;
for (i = 0; i < compression_next; i++)
if (TREE_VEC_ELT (compression_table, i) == string)
return i;
return -1;
}
/* We go through the compression table and try to find a complete or
partial match. The function returns the compression table entry
that (evenutally partially) matches TYPE. *NEXT_CURRENT can be set
to the rest of TYPE to be mangled. */
static int
find_compression_record_match (type, next_current)
tree type;
tree *next_current;
{
int i, match;
tree current, saved_current;
/* Search from the beginning for something that matches TYPE, even
partially. */
for (current = TYPE_PACKAGE_LIST (type), i = 0, match = -1; current;
current = TREE_CHAIN (current))
{
int j;
for (j = i; j < compression_next; j++)
if (TREE_VEC_ELT (compression_table, j) == TREE_PURPOSE (current))
{
match = i = j;
saved_current = current;
break;
}
}
if (!next_current)
return match;
/* If we have a match, set next_current to the item next to the last
matched value. */
if (match >= 0)
*next_current = TREE_CHAIN (saved_current);
/* We had no match: we'll have to start from the beginning. */
if (match < 0)
*next_current = TYPE_PACKAGE_LIST (type);
return match;
}
/* Mangle a record type. If a non zero value is returned, it means
that a 'N' was emitted (so that a matching 'E' can be emitted if
necessary.) */
static int
mangle_record_type (type, from_pointer)
tree type;
int from_pointer;
{
tree current;
int match;
int nadded_p = 0;
#define ADD_N() \
do { obstack_1grow (mangle_obstack, 'N'); nadded_p = 1; } while (0)
if (TREE_CODE (type) != RECORD_TYPE)
fatal ("Non RECORD_TYPE argument -- mangle_record_type");
if (!TYPE_PACKAGE_LIST (type))
set_type_package_list (type);
match = find_compression_record_match (type, ¤t);
if (match >= 0)
{
/* If we had a pointer, and there's more, we need to emit
'N' after 'P' (from pointer tells us we already emitted it.) */
if (from_pointer && current)
ADD_N();
emit_compression_string (match);
}
while (current)
{
/* Add the new type to the table */
compression_table_add (TREE_PURPOSE (current));
/* Add 'N' if we never got a chance to. */
if (!nadded_p)
ADD_N();
/* Use the bare type name for the mangle. */
append_gpp_mangled_name (IDENTIFIER_POINTER (TREE_VALUE (current)),
IDENTIFIER_LENGTH (TREE_VALUE (current)));
current = TREE_CHAIN (current);
}
return nadded_p;
#undef ADD_N
}
/* Mangle a pointer type. There are two cases: the pointer is already
in the compression table: the compression is emited sans 'P'
indicator. Otherwise, a 'P' is emitted and, depending on the type,
a partial compression or/plus the rest of the mangling. */
static void
mangle_pointer_type (type)
tree type;
{
int match;
tree pointer_type;
/* Search for the type already in the compression table */
if ((match = find_compression_pointer_match (type)) >= 0)
{
emit_compression_string (match);
return;
}
/* This didn't work. We start by mangling the pointed-to type */
pointer_type = type;
type = TREE_TYPE (type);
if (TREE_CODE (type) != RECORD_TYPE)
fatal ("Double indirection found -- mangle_pointer_type");
obstack_1grow (mangle_obstack, 'P');
if (mangle_record_type (type, /* for_pointer = */ 1))
obstack_1grow (mangle_obstack, 'E');
/* Don't forget to insert the pointer type in the table */
compression_table_add (pointer_type);
}
/* Mangle an array type. Search for an easy solution first, then go
through the process of finding out whether the bare array type or even
the template indicator where already used an compress appropriately.
It handles pointers. */
static void
mangle_array_type (p_type)
tree p_type;
{
/* atms: array template mangled string. */
static tree atms = NULL_TREE;
tree type, elt_type;
int match;
type = TREE_TYPE (p_type);
if (!type)
fatal ("Non pointer array type -- mangle_array_type");
elt_type = TYPE_ARRAY_ELEMENT (type);
/* We cache a bit of the Jarray <> mangle. */
if (!atms)
{
atms = get_identifier ("6JArray");
ggc_add_tree_root (&atms, 1);
}
/* Maybe we have what we're looking in the compression table. */
if ((match = find_compression_array_match (p_type)) >= 0)
{
emit_compression_string (match);
return;
}
/* We know for a fact that all arrays are pointers */
obstack_1grow (mangle_obstack, 'P');
/* Maybe we already have a Jarray<t> somewhere. PSx_ will be enough. */
if ((match = find_compression_record_match (type, NULL)) > 0)
{
emit_compression_string (match);
return;
}
/* Maybe we already have just JArray somewhere */
if ((match = find_compression_array_template_match (atms)) > 0)
emit_compression_string (match);
else
{
/* Start the template mangled name */
obstack_grow (mangle_obstack,
IDENTIFIER_POINTER (atms), IDENTIFIER_LENGTH (atms));
/* Insert in the compression table */
compression_table_add (atms);
}
/* Mangle Jarray <elt_type> */
obstack_1grow (mangle_obstack, 'I');
mangle_type (elt_type);
obstack_1grow (mangle_obstack, 'E');
/* Add `Jarray <elt_type>' and `Jarray <elt_type> *' to the table */
compression_table_add (type);
compression_table_add (p_type);
}
/* Write a substition string for entry I. Substitution string starts a
-1 (encoded S_.) The base is 36, and the code shamlessly taken from
cp/mangle.c. */
static void
emit_compression_string (int i)
{
i -= 1; /* Adjust */
obstack_1grow (mangle_obstack, 'S');
if (i >= 0)
{
static const char digits[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
unsigned HOST_WIDE_INT n;
unsigned HOST_WIDE_INT m=1;
/* How many digits for I in base 36? */
for (n = i; n >= 36; n /= 36, m *=36);
/* Write the digits out */
while (m > 0)
{
int digit = i / m;
obstack_1grow (mangle_obstack, digits [digit]);
i -= digit * m;
m /= 36;
}
}
obstack_1grow (mangle_obstack, '_');
}
/* If search the compression table at index I for a pointer type
equivalent to TYPE (meaning that after all the indirection, which
might all be unique, we find the same RECORD_TYPE.) */
static int
entry_match_pointer_p (type, i)
tree type;
int i;
{
tree t = TREE_VEC_ELT (compression_table, i);
while (TREE_CODE (type) == POINTER_TYPE
&& TREE_CODE (t) == POINTER_TYPE)
{
t = TREE_TYPE (t);
type = TREE_TYPE (type);
}
return (TREE_CODE (type) == RECORD_TYPE
&& TREE_CODE (t) == RECORD_TYPE
&& t == type);
}
/* Go through all qualification of type and build a list of list node
elements containings as a purpose what should be used for a match and
inserted in the compression table; and as it value the raw name of the
part. The result is stored in TYPE_PACKAGE_LIST to be reused. */
static void
set_type_package_list (type)
tree type;
{
int i;
const char *type_string = IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
char *ptr;
int qualifications;
tree list = NULL_TREE, elt;
for (ptr = (char *)type_string, qualifications = 0; *ptr; ptr++)
if (*ptr == '.')
qualifications += 1;
for (ptr = (char *)type_string, i = 0; i < qualifications; ptr++)
{
if (ptr [0] == '.')
{
char c;
tree identifier;
/* Can't use an obstack, we're already using it to
accumulate the mangling. */
c = ptr [0];
ptr [0] = '\0';
identifier = get_identifier (type_string);
ptr [0] = c;
elt = build_tree_list (identifier, identifier);
TREE_CHAIN (elt) = list;
list = elt;
type_string = ptr+1;
i += 1;
}
}
elt = build_tree_list (type, get_identifier (type_string));
TREE_CHAIN (elt) = list;
list = elt;
TYPE_PACKAGE_LIST (type) = nreverse (list);
}
/* Add TYPE as the last element of the compression table. Resize the
compression table if necessary. */
static void
compression_table_add (type)
tree type;
{
if (compression_next == TREE_VEC_LENGTH (compression_table))
{
tree new = make_tree_vec (2*compression_next);
int i;
for (i = 0; i < compression_next; i++)
TREE_VEC_ELT (new, i) = TREE_VEC_ELT (compression_table, i);
ggc_del_root (&compression_table);
compression_table = new;
ggc_add_tree_root (&compression_table, 1);
}
TREE_VEC_ELT (compression_table, compression_next++) = type;
}
/* Mangling initialization routine. */
static void
init_mangling (obstack)
struct obstack *obstack;
{
mangle_obstack = obstack;
if (!compression_table)
compression_table = make_tree_vec (10);
else
fatal ("Mangling already in progress -- init_mangling");
/* Mangled name are to be suffixed */
obstack_grow (mangle_obstack, "_Z", 2);
/* Register the compression table with the GC */
ggc_add_tree_root (&compression_table, 1);
}
/* Mangling finalization routine. The mangled name is returned as a
IDENTIFIER_NODE. */
static tree
finish_mangling ()
{
tree result;
if (!compression_table)
fatal ("Mangling already finished -- finish_mangling");
ggc_del_root (&compression_table);
compression_table = NULL_TREE;
compression_next = 0;
obstack_1grow (mangle_obstack, '\0');
result = get_identifier (obstack_base (mangle_obstack));
obstack_free (mangle_obstack, obstack_base (mangle_obstack));
#if 0
printf ("// %s\n", IDENTIFIER_POINTER (result));
#endif
return result;
}
|