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
|
/* Functions related to mangling class names for the GNU compiler
for the Java(TM) language.
Copyright (C) 1998, 1999 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"
/* 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. */
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 < '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. */
void
emit_unicode_mangled_name (obstack, name, len)
struct obstack *obstack;
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 == (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 (obstack, buf, 5);
}
else
{
obstack_1grow (obstack, ch);
}
}
}
/* Assuming (NAME, LEN) is a Utf8-encoding string, emit the string
appropriately mangled (with Unicode escapes if needed) to OBSTACK. */
void
append_gpp_mangled_name (obstack, name, len)
struct obstack *obstack;
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 (obstack, buf, strlen(buf));
emit_unicode_mangled_name (obstack, name, len);
}
else
{
sprintf (buf, "%d", len);
obstack_grow (obstack, buf, strlen(buf));
obstack_grow (obstack, name, len);
}
}
/* Append the mangled name of a class named CLASSNAME onto OBSTACK. */
void
append_gpp_mangled_classtype (obstack, class_name)
struct obstack *obstack;
const char *class_name;
{
const char *ptr;
int qualifications = 0;
for (ptr = class_name; *ptr != '\0'; ptr++)
{
if (*ptr == '.')
qualifications++;
}
if (qualifications)
{
char buf[8];
if (qualifications >= 9)
sprintf (buf, "Q_%d_", qualifications + 1);
else
sprintf (buf, "Q%d", qualifications + 1);
obstack_grow (obstack, buf, strlen (buf));
}
for (ptr = class_name; ; ptr++)
{
if (ptr[0] == '.' || ptr[0] == '\0')
{
append_gpp_mangled_name (obstack, class_name, ptr - class_name);
if (ptr[0] == '\0')
break;
class_name = ptr + 1;
}
}
}
|
