forked from illumos/gcc
-
Notifications
You must be signed in to change notification settings - Fork 1
/
godump.c
1246 lines (1050 loc) · 30.2 KB
/
godump.c
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
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Output Go language descriptions of types.
Copyright (C) 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
Written by Ian Lance Taylor <iant@google.com>.
This file is part of GCC.
GCC 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 3, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
/* This file is used during the build process to emit Go language
descriptions of declarations from C header files. It uses the
debug info hooks to emit the descriptions. The Go language
descriptions then become part of the Go runtime support
library.
All global names are output with a leading underscore, so that they
are all hidden in Go. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "diagnostic-core.h"
#include "tree.h"
#include "ggc.h"
#include "pointer-set.h"
#include "obstack.h"
#include "debug.h"
/* We dump this information from the debug hooks. This gives us a
stable and maintainable API to hook into. In order to work
correctly when -g is used, we build our own hooks structure which
wraps the hooks we need to change. */
/* Our debug hooks. This is initialized by dump_go_spec_init. */
static struct gcc_debug_hooks go_debug_hooks;
/* The real debug hooks. */
static const struct gcc_debug_hooks *real_debug_hooks;
/* The file where we should write information. */
static FILE *go_dump_file;
/* A queue of decls to output. */
static GTY(()) VEC(tree,gc) *queue;
/* A hash table of macros we have seen. */
static htab_t macro_hash;
/* The type of a value in macro_hash. */
struct macro_hash_value
{
/* The name stored in the hash table. */
char *name;
/* The value of the macro. */
char *value;
};
/* Calculate the hash value for an entry in the macro hash table. */
static hashval_t
macro_hash_hashval (const void *val)
{
const struct macro_hash_value *mhval = (const struct macro_hash_value *) val;
return htab_hash_string (mhval->name);
}
/* Compare values in the macro hash table for equality. */
static int
macro_hash_eq (const void *v1, const void *v2)
{
const struct macro_hash_value *mhv1 = (const struct macro_hash_value *) v1;
const struct macro_hash_value *mhv2 = (const struct macro_hash_value *) v2;
return strcmp (mhv1->name, mhv2->name) == 0;
}
/* Free values deleted from the macro hash table. */
static void
macro_hash_del (void *v)
{
struct macro_hash_value *mhv = (struct macro_hash_value *) v;
XDELETEVEC (mhv->name);
XDELETEVEC (mhv->value);
XDELETE (mhv);
}
/* For the string hash tables. */
static int
string_hash_eq (const void *y1, const void *y2)
{
return strcmp ((const char *) y1, (const char *) y2) == 0;
}
/* A macro definition. */
static void
go_define (unsigned int lineno, const char *buffer)
{
const char *p;
const char *name_end;
size_t out_len;
char *out_buffer;
char *q;
bool saw_operand;
bool need_operand;
struct macro_hash_value *mhval;
char *copy;
hashval_t hashval;
void **slot;
real_debug_hooks->define (lineno, buffer);
/* Skip macro functions. */
for (p = buffer; *p != '\0' && *p != ' '; ++p)
if (*p == '(')
return;
if (*p == '\0')
return;
name_end = p;
++p;
if (*p == '\0')
return;
copy = XNEWVEC (char, name_end - buffer + 1);
memcpy (copy, buffer, name_end - buffer);
copy[name_end - buffer] = '\0';
mhval = XNEW (struct macro_hash_value);
mhval->name = copy;
mhval->value = NULL;
hashval = htab_hash_string (copy);
slot = htab_find_slot_with_hash (macro_hash, mhval, hashval, NO_INSERT);
/* For simplicity, we force all names to be hidden by adding an
initial underscore, and let the user undo this as needed. */
out_len = strlen (p) * 2 + 1;
out_buffer = XNEWVEC (char, out_len);
q = out_buffer;
saw_operand = false;
need_operand = false;
while (*p != '\0')
{
switch (*p)
{
case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
case 'G': case 'H': case 'I': case 'J': case 'K': case 'L':
case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R':
case 'S': case 'T': case 'U': case 'V': case 'W': case 'X':
case 'Y': case 'Z':
case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
case 'g': case 'h': case 'i': case 'j': case 'k': case 'l':
case 'm': case 'n': case 'o': case 'p': case 'q': case 'r':
case 's': case 't': case 'u': case 'v': case 'w': case 'x':
case 'y': case 'z':
case '_':
{
/* The start of an identifier. Technically we should also
worry about UTF-8 identifiers, but they are not a
problem for practical uses of -fdump-go-spec so we
don't worry about them. */
const char *start;
char *n;
struct macro_hash_value idval;
if (saw_operand)
goto unknown;
start = p;
while (ISALNUM (*p) || *p == '_')
++p;
n = XALLOCAVEC (char, p - start + 1);
memcpy (n, start, p - start);
n[p - start] = '\0';
idval.name = n;
idval.value = NULL;
if (htab_find (macro_hash, &idval) == NULL)
{
/* This is a reference to a name which was not defined
as a macro. */
goto unknown;
}
*q++ = '_';
memcpy (q, start, p - start);
q += p - start;
saw_operand = true;
need_operand = false;
}
break;
case '.':
if (!ISDIGIT (p[1]))
goto unknown;
/* Fall through. */
case '0': case '1': case '2': case '3': case '4':
case '5': case '6': case '7': case '8': case '9':
{
const char *start;
bool is_hex;
start = p;
is_hex = false;
if (*p == '0' && (p[1] == 'x' || p[1] == 'X'))
{
p += 2;
is_hex = true;
}
while (ISDIGIT (*p) || *p == '.' || *p == 'e' || *p == 'E'
|| (is_hex
&& ((*p >= 'a' && *p <= 'f')
|| (*p >= 'A' && *p <= 'F'))))
++p;
memcpy (q, start, p - start);
q += p - start;
while (*p == 'u' || *p == 'U' || *p == 'l' || *p == 'L'
|| *p == 'f' || *p == 'F'
|| *p == 'd' || *p == 'D')
{
/* Go doesn't use any of these trailing type
modifiers. */
++p;
}
/* We'll pick up the exponent, if any, as an
expression. */
saw_operand = true;
need_operand = false;
}
break;
case ' ': case '\t':
*q++ = *p++;
break;
case '(':
/* Always OK, not part of an operand, presumed to start an
operand. */
*q++ = *p++;
saw_operand = false;
need_operand = false;
break;
case ')':
/* OK if we don't need an operand, and presumed to indicate
an operand. */
if (need_operand)
goto unknown;
*q++ = *p++;
saw_operand = true;
break;
case '+': case '-':
/* Always OK, but not part of an operand. */
*q++ = *p++;
saw_operand = false;
break;
case '*': case '/': case '%': case '|': case '&': case '^':
/* Must be a binary operator. */
if (!saw_operand)
goto unknown;
*q++ = *p++;
saw_operand = false;
need_operand = true;
break;
case '=':
*q++ = *p++;
if (*p != '=')
goto unknown;
/* Must be a binary operator. */
if (!saw_operand)
goto unknown;
*q++ = *p++;
saw_operand = false;
need_operand = true;
break;
case '!':
*q++ = *p++;
if (*p == '=')
{
/* Must be a binary operator. */
if (!saw_operand)
goto unknown;
*q++ = *p++;
saw_operand = false;
need_operand = true;
}
else
{
/* Must be a unary operator. */
if (saw_operand)
goto unknown;
need_operand = true;
}
break;
case '<': case '>':
/* Must be a binary operand, may be << or >> or <= or >=. */
if (!saw_operand)
goto unknown;
*q++ = *p++;
if (*p == *(p - 1) || *p == '=')
*q++ = *p++;
saw_operand = false;
need_operand = true;
break;
case '~':
/* Must be a unary operand, must be translated for Go. */
if (saw_operand)
goto unknown;
*q++ = '^';
p++;
need_operand = true;
break;
case '"':
case '\'':
{
char quote;
int count;
if (saw_operand)
goto unknown;
quote = *p;
*q++ = *p++;
count = 0;
while (*p != quote)
{
int c;
if (*p == '\0')
goto unknown;
++count;
if (*p != '\\')
{
*q++ = *p++;
continue;
}
*q++ = *p++;
switch (*p)
{
case '0': case '1': case '2': case '3':
case '4': case '5': case '6': case '7':
c = 0;
while (*p >= '0' && *p <= '7')
{
*q++ = *p++;
++c;
}
/* Go octal characters are always 3
digits. */
if (c != 3)
goto unknown;
break;
case 'x':
*q++ = *p++;
c = 0;
while (ISXDIGIT (*p))
{
*q++ = *p++;
++c;
}
/* Go hex characters are always 2 digits. */
if (c != 2)
goto unknown;
break;
case 'a': case 'b': case 'f': case 'n': case 'r':
case 't': case 'v': case '\\': case '\'': case '"':
*q++ = *p++;
break;
default:
goto unknown;
}
}
*q++ = *p++;
if (quote == '\'' && count != 1)
goto unknown;
saw_operand = true;
need_operand = false;
break;
}
default:
goto unknown;
}
}
if (need_operand)
goto unknown;
gcc_assert ((size_t) (q - out_buffer) < out_len);
*q = '\0';
mhval->value = out_buffer;
if (slot == NULL)
{
slot = htab_find_slot_with_hash (macro_hash, mhval, hashval, INSERT);
gcc_assert (slot != NULL && *slot == NULL);
}
else
{
if (*slot != NULL)
macro_hash_del (*slot);
}
*slot = mhval;
return;
unknown:
fprintf (go_dump_file, "// unknowndefine %s\n", buffer);
if (slot != NULL)
htab_clear_slot (macro_hash, slot);
XDELETEVEC (out_buffer);
XDELETEVEC (copy);
}
/* A macro undef. */
static void
go_undef (unsigned int lineno, const char *buffer)
{
struct macro_hash_value mhval;
void **slot;
real_debug_hooks->undef (lineno, buffer);
mhval.name = CONST_CAST (char *, buffer);
mhval.value = NULL;
slot = htab_find_slot (macro_hash, &mhval, NO_INSERT);
if (slot != NULL)
htab_clear_slot (macro_hash, slot);
}
/* A function or variable decl. */
static void
go_decl (tree decl)
{
if (!TREE_PUBLIC (decl)
|| DECL_IS_BUILTIN (decl)
|| DECL_NAME (decl) == NULL_TREE)
return;
VEC_safe_push (tree, gc, queue, decl);
}
/* A function decl. */
static void
go_function_decl (tree decl)
{
real_debug_hooks->function_decl (decl);
go_decl (decl);
}
/* A global variable decl. */
static void
go_global_decl (tree decl)
{
real_debug_hooks->global_decl (decl);
go_decl (decl);
}
/* A type declaration. */
static void
go_type_decl (tree decl, int local)
{
real_debug_hooks->type_decl (decl, local);
if (local || DECL_IS_BUILTIN (decl))
return;
if (DECL_NAME (decl) == NULL_TREE
&& (TYPE_NAME (TREE_TYPE (decl)) == NULL_TREE
|| TREE_CODE (TYPE_NAME (TREE_TYPE (decl))) != IDENTIFIER_NODE)
&& TREE_CODE (TREE_TYPE (decl)) != ENUMERAL_TYPE)
return;
VEC_safe_push (tree, gc, queue, decl);
}
/* A container for the data we pass around when generating information
at the end of the compilation. */
struct godump_container
{
/* DECLs that we have already seen. */
struct pointer_set_t *decls_seen;
/* Types which may potentially have to be defined as dummy
types. */
struct pointer_set_t *pot_dummy_types;
/* Go keywords. */
htab_t keyword_hash;
/* Global type definitions. */
htab_t type_hash;
/* Invalid types. */
htab_t invalid_hash;
/* Obstack used to write out a type definition. */
struct obstack type_obstack;
};
/* Append an IDENTIFIER_NODE to OB. */
static void
go_append_string (struct obstack *ob, tree id)
{
obstack_grow (ob, IDENTIFIER_POINTER (id), IDENTIFIER_LENGTH (id));
}
/* Write the Go version of TYPE to CONTAINER->TYPE_OBSTACK.
USE_TYPE_NAME is true if we can simply use a type name here without
needing to define it. IS_FUNC_OK is true if we can output a func
type here; the "func" keyword will already have been added. Return
true if the type can be represented in Go, false otherwise. */
static bool
go_format_type (struct godump_container *container, tree type,
bool use_type_name, bool is_func_ok)
{
bool ret;
struct obstack *ob;
ret = true;
ob = &container->type_obstack;
if (TYPE_NAME (type) != NULL_TREE
&& (pointer_set_contains (container->decls_seen, type)
|| pointer_set_contains (container->decls_seen, TYPE_NAME (type)))
&& (AGGREGATE_TYPE_P (type)
|| POINTER_TYPE_P (type)
|| TREE_CODE (type) == FUNCTION_TYPE))
{
tree name;
void **slot;
name = TYPE_NAME (type);
if (TREE_CODE (name) == TYPE_DECL)
name = DECL_NAME (name);
slot = htab_find_slot (container->invalid_hash, IDENTIFIER_POINTER (name),
NO_INSERT);
if (slot != NULL)
ret = false;
obstack_1grow (ob, '_');
go_append_string (ob, name);
return ret;
}
pointer_set_insert (container->decls_seen, type);
switch (TREE_CODE (type))
{
case ENUMERAL_TYPE:
obstack_grow (ob, "int", 3);
break;
case TYPE_DECL:
{
void **slot;
slot = htab_find_slot (container->invalid_hash,
IDENTIFIER_POINTER (DECL_NAME (type)),
NO_INSERT);
if (slot != NULL)
ret = false;
obstack_1grow (ob, '_');
go_append_string (ob, DECL_NAME (type));
}
break;
case INTEGER_TYPE:
{
const char *s;
char buf[100];
switch (TYPE_PRECISION (type))
{
case 8:
s = TYPE_UNSIGNED (type) ? "uint8" : "int8";
break;
case 16:
s = TYPE_UNSIGNED (type) ? "uint16" : "int16";
break;
case 32:
s = TYPE_UNSIGNED (type) ? "uint32" : "int32";
break;
case 64:
s = TYPE_UNSIGNED (type) ? "uint64" : "int64";
break;
default:
snprintf (buf, sizeof buf, "INVALID-int-%u%s",
TYPE_PRECISION (type),
TYPE_UNSIGNED (type) ? "u" : "");
s = buf;
ret = false;
break;
}
obstack_grow (ob, s, strlen (s));
}
break;
case REAL_TYPE:
{
const char *s;
char buf[100];
switch (TYPE_PRECISION (type))
{
case 32:
s = "float32";
break;
case 64:
s = "float64";
break;
default:
snprintf (buf, sizeof buf, "INVALID-float-%u",
TYPE_PRECISION (type));
s = buf;
ret = false;
break;
}
obstack_grow (ob, s, strlen (s));
}
break;
case BOOLEAN_TYPE:
obstack_grow (ob, "bool", 4);
break;
case POINTER_TYPE:
if (use_type_name
&& TYPE_NAME (TREE_TYPE (type)) != NULL_TREE
&& (RECORD_OR_UNION_TYPE_P (TREE_TYPE (type))
|| (POINTER_TYPE_P (TREE_TYPE (type))
&& (TREE_CODE (TREE_TYPE (TREE_TYPE (type)))
== FUNCTION_TYPE))))
{
tree name;
void **slot;
name = TYPE_NAME (TREE_TYPE (type));
if (TREE_CODE (name) == TYPE_DECL)
name = DECL_NAME (name);
slot = htab_find_slot (container->invalid_hash,
IDENTIFIER_POINTER (name), NO_INSERT);
if (slot != NULL)
ret = false;
obstack_grow (ob, "*_", 2);
go_append_string (ob, name);
/* The pointer here can be used without the struct or union
definition. So this struct or union is a potential dummy
type. */
if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (type)))
pointer_set_insert (container->pot_dummy_types,
IDENTIFIER_POINTER (name));
return ret;
}
if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
obstack_grow (ob, "func", 4);
else
obstack_1grow (ob, '*');
if (VOID_TYPE_P (TREE_TYPE (type)))
obstack_grow (ob, "byte", 4);
else
{
if (!go_format_type (container, TREE_TYPE (type), use_type_name,
true))
ret = false;
}
break;
case ARRAY_TYPE:
obstack_1grow (ob, '[');
if (TYPE_DOMAIN (type) != NULL_TREE
&& TREE_CODE (TYPE_DOMAIN (type)) == INTEGER_TYPE
&& TYPE_MIN_VALUE (TYPE_DOMAIN (type)) != NULL_TREE
&& TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (type))) == INTEGER_CST
&& tree_int_cst_sgn (TYPE_MIN_VALUE (TYPE_DOMAIN (type))) == 0
&& TYPE_MAX_VALUE (TYPE_DOMAIN (type)) != NULL_TREE
&& TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type))) == INTEGER_CST
&& host_integerp (TYPE_MAX_VALUE (TYPE_DOMAIN (type)), 0))
{
char buf[100];
snprintf (buf, sizeof buf, HOST_WIDE_INT_PRINT_DEC "+1",
tree_low_cst (TYPE_MAX_VALUE (TYPE_DOMAIN (type)), 0));
obstack_grow (ob, buf, strlen (buf));
}
obstack_1grow (ob, ']');
if (!go_format_type (container, TREE_TYPE (type), use_type_name, false))
ret = false;
break;
case UNION_TYPE:
case RECORD_TYPE:
{
tree field;
int i;
obstack_grow (ob, "struct { ", 9);
i = 0;
for (field = TYPE_FIELDS (type);
field != NULL_TREE;
field = TREE_CHAIN (field))
{
struct obstack hold_type_obstack;
bool field_ok;
if (TREE_CODE (type) == UNION_TYPE)
{
hold_type_obstack = container->type_obstack;
obstack_init (&container->type_obstack);
}
field_ok = true;
if (DECL_NAME (field) == NULL)
{
char buf[100];
obstack_grow (ob, "Godump_", 7);
snprintf (buf, sizeof buf, "%d", i);
obstack_grow (ob, buf, strlen (buf));
i++;
}
else
{
const char *var_name;
void **slot;
/* Start variable name with an underscore if a keyword. */
var_name = IDENTIFIER_POINTER (DECL_NAME (field));
slot = htab_find_slot (container->keyword_hash, var_name,
NO_INSERT);
if (slot != NULL)
obstack_1grow (ob, '_');
go_append_string (ob, DECL_NAME (field));
}
obstack_1grow (ob, ' ');
if (DECL_BIT_FIELD (field))
{
obstack_grow (ob, "INVALID-bit-field", 17);
field_ok = false;
}
else
{
/* Do not expand type if a record or union type or a
function pointer. */
if (TYPE_NAME (TREE_TYPE (field)) != NULL_TREE
&& (RECORD_OR_UNION_TYPE_P (TREE_TYPE (field))
|| (POINTER_TYPE_P (TREE_TYPE (field))
&& (TREE_CODE (TREE_TYPE (TREE_TYPE (field)))
== FUNCTION_TYPE))))
{
tree name;
void **slot;
name = TYPE_NAME (TREE_TYPE (field));
if (TREE_CODE (name) == TYPE_DECL)
name = DECL_NAME (name);
slot = htab_find_slot (container->invalid_hash,
IDENTIFIER_POINTER (name),
NO_INSERT);
if (slot != NULL)
field_ok = false;
obstack_1grow (ob, '_');
go_append_string (ob, name);
}
else
{
if (!go_format_type (container, TREE_TYPE (field), true,
false))
field_ok = false;
}
}
obstack_grow (ob, "; ", 2);
/* Only output the first successful field of a union, and
hope for the best. */
if (TREE_CODE (type) == UNION_TYPE)
{
if (!field_ok && TREE_CHAIN (field) == NULL_TREE)
{
field_ok = true;
ret = false;
}
if (field_ok)
{
unsigned int sz;
sz = obstack_object_size (&container->type_obstack);
obstack_grow (&hold_type_obstack,
obstack_base (&container->type_obstack),
sz);
}
obstack_free (&container->type_obstack, NULL);
container->type_obstack = hold_type_obstack;
if (field_ok)
break;
}
else
{
if (!field_ok)
ret = false;
}
}
obstack_1grow (ob, '}');
}
break;
case FUNCTION_TYPE:
{
tree arg_type;
bool is_varargs;
tree result;
function_args_iterator iter;
bool seen_arg;
/* Go has no way to write a type which is a function but not a
pointer to a function. */
if (!is_func_ok)
{
obstack_grow (ob, "func*", 5);
ret = false;
}
obstack_1grow (ob, '(');
is_varargs = stdarg_p (type);
seen_arg = false;
FOREACH_FUNCTION_ARGS (type, arg_type, iter)
{
if (VOID_TYPE_P (arg_type))
break;
if (seen_arg)
obstack_grow (ob, ", ", 2);
if (!go_format_type (container, arg_type, true, false))
ret = false;
seen_arg = true;
}
if (is_varargs)
{
if (prototype_p (type))
obstack_grow (ob, ", ", 2);
obstack_grow (ob, "...interface{}", 14);
}
obstack_1grow (ob, ')');
result = TREE_TYPE (type);
if (!VOID_TYPE_P (result))
{
obstack_1grow (ob, ' ');
if (!go_format_type (container, result, use_type_name, false))
ret = false;
}
}
break;
default:
obstack_grow (ob, "INVALID-type", 12);
ret = false;
break;
}
return ret;
}
/* Output the type which was built on the type obstack, and then free
it. */
static void
go_output_type (struct godump_container *container)
{
struct obstack *ob;
ob = &container->type_obstack;
obstack_1grow (ob, '\0');
fputs (obstack_base (ob), go_dump_file);
obstack_free (ob, obstack_base (ob));
}
/* Output a function declaration. */
static void
go_output_fndecl (struct godump_container *container, tree decl)
{
if (!go_format_type (container, TREE_TYPE (decl), false, true))
fprintf (go_dump_file, "// ");
fprintf (go_dump_file, "func _%s ",
IDENTIFIER_POINTER (DECL_NAME (decl)));
go_output_type (container);
fprintf (go_dump_file, " __asm__(\"%s\")\n",
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
}
/* Output a typedef or something like a struct definition. */
static void
go_output_typedef (struct godump_container *container, tree decl)
{
/* If we have an enum type, output the enum constants
separately. */
if (TREE_CODE (TREE_TYPE (decl)) == ENUMERAL_TYPE
&& TYPE_SIZE (TREE_TYPE (decl)) != 0
&& !pointer_set_contains (container->decls_seen, TREE_TYPE (decl))
&& (TYPE_CANONICAL (TREE_TYPE (decl)) == NULL_TREE
|| !pointer_set_contains (container->decls_seen,
TYPE_CANONICAL (TREE_TYPE (decl)))))
{
tree element;
for (element = TYPE_VALUES (TREE_TYPE (decl));
element != NULL_TREE;
element = TREE_CHAIN (element))
{
const char *name;
struct macro_hash_value *mhval;
void **slot;
char buf[100];
name = IDENTIFIER_POINTER (TREE_PURPOSE (element));
/* Sometimes a name will be defined as both an enum constant
and a macro. Avoid duplicate definition errors by
treating enum constants as macros. */
mhval = XNEW (struct macro_hash_value);
mhval->name = xstrdup (name);
mhval->value = NULL;
slot = htab_find_slot (macro_hash, mhval, INSERT);
if (*slot != NULL)
macro_hash_del (*slot);
if (host_integerp (TREE_VALUE (element), 0))
snprintf (buf, sizeof buf, HOST_WIDE_INT_PRINT_DEC,
tree_low_cst (TREE_VALUE (element), 0));
else if (host_integerp (TREE_VALUE (element), 1))
snprintf (buf, sizeof buf, HOST_WIDE_INT_PRINT_UNSIGNED,
((unsigned HOST_WIDE_INT)
tree_low_cst (TREE_VALUE (element), 1)));
else
snprintf (buf, sizeof buf, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
((unsigned HOST_WIDE_INT)
TREE_INT_CST_HIGH (TREE_VALUE (element))),
TREE_INT_CST_LOW (TREE_VALUE (element)));
mhval->value = xstrdup (buf);
*slot = mhval;
}
pointer_set_insert (container->decls_seen, TREE_TYPE (decl));