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
//! Everything related to types in our intermediate representation.
use clang::{self, Cursor};
use parse::{ClangItemParser, ParseError, ParseResult};
use super::comp::CompInfo;
use super::context::{BindgenContext, ItemId};
use super::derive::{CanDeriveCopy, CanDeriveDebug};
use super::enum_ty::Enum;
use super::function::FunctionSig;
use super::int::IntKind;
use super::item::Item;
use super::layout::Layout;
use super::type_collector::{ItemSet, TypeCollector};
/// The base representation of a type in bindgen.
///
/// A type has an optional name, which if present cannot be empty, a `layout`
/// (size, alignment and packedness) if known, a `Kind`, which determines which
/// kind of type it is, and whether the type is const.
#[derive(Debug)]
pub struct Type {
/// The name of the type, or None if it was an unnamed struct or union.
name: Option<String>,
/// The layout of the type, if known.
layout: Option<Layout>,
/// The inner kind of the type
kind: TypeKind,
/// Whether this type is const-qualified.
is_const: bool,
}
/// The maximum number of items in an array for which Rust implements common
/// traits, and so if we have a type containing an array with more than this
/// many items, we won't be able to derive common traits on that type.
///
/// We need type-level integers yesterday :'(
pub const RUST_DERIVE_IN_ARRAY_LIMIT: usize = 32;
impl Type {
/// Get the underlying `CompInfo` for this type, or `None` if this is some
/// other kind of type.
pub fn as_comp(&self) -> Option<&CompInfo> {
match self.kind {
TypeKind::Comp(ref ci) => Some(ci),
_ => None,
}
}
/// Construct a new `Type`.
pub fn new(name: Option<String>,
layout: Option<Layout>,
kind: TypeKind,
is_const: bool)
-> Self {
Type {
name: name,
layout: layout,
kind: kind,
is_const: is_const,
}
}
/// Which kind of type is this?
pub fn kind(&self) -> &TypeKind {
&self.kind
}
/// Overrides the kind of the item. This is mostly a template alias
/// implementation detail, and debug assertions guard it like so.
pub fn set_kind(&mut self, kind: TypeKind) {
if cfg!(debug_assertions) {
match (&self.kind, &kind) {
(&TypeKind::Alias(ref alias_name, alias_inner),
&TypeKind::TemplateAlias(ref name, inner, _)) => {
assert_eq!(alias_name, name);
assert_eq!(alias_inner, inner);
}
_ => panic!("Unexpected kind in `set_kind`!"),
};
}
self.kind = kind;
}
/// Get a mutable reference to this type's kind.
pub fn kind_mut(&mut self) -> &mut TypeKind {
&mut self.kind
}
/// Get this type's name.
pub fn name(&self) -> Option<&str> {
self.name.as_ref().map(|name| &**name)
}
/// Is this a compound type?
pub fn is_comp(&self) -> bool {
match self.kind {
TypeKind::Comp(..) => true,
_ => false,
}
}
/// Is this a named type?
pub fn is_named(&self) -> bool {
match self.kind {
TypeKind::Named(..) => true,
_ => false,
}
}
/// Is this a template alias type?
pub fn is_template_alias(&self) -> bool {
match self.kind {
TypeKind::TemplateAlias(..) => true,
_ => false,
}
}
/// Is this a function type?
pub fn is_function(&self) -> bool {
match self.kind {
TypeKind::Function(..) => true,
_ => false,
}
}
/// Is this an enum type?
pub fn is_enum(&self) -> bool {
match self.kind {
TypeKind::Enum(..) => true,
_ => false,
}
}
/// Is this either a builtin or named type?
pub fn is_builtin_or_named(&self) -> bool {
match self.kind {
TypeKind::Void |
TypeKind::NullPtr |
TypeKind::Function(..) |
TypeKind::Array(..) |
TypeKind::Reference(..) |
TypeKind::Pointer(..) |
TypeKind::BlockPointer |
TypeKind::Int(..) |
TypeKind::Float(..) |
TypeKind::Named(..) => true,
_ => false,
}
}
/// Creates a new named type, with name `name`.
pub fn named(name: String) -> Self {
assert!(!name.is_empty());
// TODO: stop duplicating the name, it's stupid.
let kind = TypeKind::Named(name.clone());
Self::new(Some(name), None, kind, false)
}
/// Is this a floating point type?
pub fn is_float(&self) -> bool {
match self.kind {
TypeKind::Float(..) => true,
_ => false,
}
}
/// Is this a boolean type?
pub fn is_bool(&self) -> bool {
match self.kind {
TypeKind::Int(IntKind::Bool) => true,
_ => false,
}
}
/// Is this an integer type?
pub fn is_integer(&self) -> bool {
match self.kind {
TypeKind::Int(..) => true,
_ => false,
}
}
/// Is this a `const` qualified type?
pub fn is_const(&self) -> bool {
self.is_const
}
/// Is this a reference to another type?
pub fn is_type_ref(&self) -> bool {
match self.kind {
TypeKind::ResolvedTypeRef(_) |
TypeKind::UnresolvedTypeRef(_, _, _) => true,
_ => false,
}
}
/// What is the layout of this type?
pub fn layout(&self, ctx: &BindgenContext) -> Option<Layout> {
use std::mem;
self.layout.or_else(|| {
match self.kind {
TypeKind::Comp(ref ci) => ci.layout(ctx),
// FIXME(emilio): This is a hack for anonymous union templates.
// Use the actual pointer size!
TypeKind::Pointer(..) |
TypeKind::BlockPointer => {
Some(Layout::new(mem::size_of::<*mut ()>(),
mem::align_of::<*mut ()>()))
}
TypeKind::ResolvedTypeRef(inner) => {
ctx.resolve_type(inner).layout(ctx)
}
_ => None,
}
})
}
/// Whether this type has a vtable.
pub fn has_vtable(&self, ctx: &BindgenContext) -> bool {
// FIXME: Can we do something about template parameters? Huh...
match self.kind {
TypeKind::TemplateRef(t, _) |
TypeKind::TemplateAlias(_, t, _) |
TypeKind::Alias(_, t) |
TypeKind::ResolvedTypeRef(t) => ctx.resolve_type(t).has_vtable(ctx),
TypeKind::Comp(ref info) => info.has_vtable(ctx),
_ => false,
}
}
/// Returns whether this type has a destructor.
pub fn has_destructor(&self, ctx: &BindgenContext) -> bool {
match self.kind {
TypeKind::TemplateRef(t, _) |
TypeKind::TemplateAlias(_, t, _) |
TypeKind::Alias(_, t) |
TypeKind::ResolvedTypeRef(t) => {
ctx.resolve_type(t).has_destructor(ctx)
}
TypeKind::Comp(ref info) => info.has_destructor(ctx),
_ => false,
}
}
/// See the comment in `Item::signature_contains_named_type`.
pub fn signature_contains_named_type(&self,
ctx: &BindgenContext,
ty: &Type)
-> bool {
let name = match *ty.kind() {
TypeKind::Named(ref name) => name,
ref other @ _ => unreachable!("Not a named type: {:?}", other),
};
match self.kind {
TypeKind::Named(ref this_name) => this_name == name,
TypeKind::ResolvedTypeRef(t) |
TypeKind::Array(t, _) |
TypeKind::Pointer(t) |
TypeKind::Alias(_, t) => {
ctx.resolve_type(t)
.signature_contains_named_type(ctx, ty)
}
TypeKind::Function(ref sig) => {
sig.argument_types().iter().any(|&(_, arg)| {
ctx.resolve_type(arg)
.signature_contains_named_type(ctx, ty)
}) ||
ctx.resolve_type(sig.return_type())
.signature_contains_named_type(ctx, ty)
}
TypeKind::TemplateAlias(_, _, ref template_args) |
TypeKind::TemplateRef(_, ref template_args) => {
template_args.iter().any(|arg| {
ctx.resolve_type(*arg)
.signature_contains_named_type(ctx, ty)
})
}
TypeKind::Comp(ref ci) => ci.signature_contains_named_type(ctx, ty),
_ => false,
}
}
/// See safe_canonical_type.
pub fn canonical_type<'tr>(&'tr self,
ctx: &'tr BindgenContext)
-> &'tr Type {
self.safe_canonical_type(ctx)
.expect("Should have been resolved after parsing!")
}
/// Returns the canonical type of this type, that is, the "inner type".
///
/// For example, for a `typedef`, the canonical type would be the
/// `typedef`ed type, for a template specialization, would be the template
/// its specializing, and so on. Return None if the type is unresolved.
pub fn safe_canonical_type<'tr>(&'tr self,
ctx: &'tr BindgenContext)
-> Option<&'tr Type> {
match self.kind {
TypeKind::Named(..) |
TypeKind::Array(..) |
TypeKind::Comp(..) |
TypeKind::Int(..) |
TypeKind::Float(..) |
TypeKind::Complex(..) |
TypeKind::Function(..) |
TypeKind::Enum(..) |
TypeKind::Reference(..) |
TypeKind::Void |
TypeKind::NullPtr |
TypeKind::BlockPointer |
TypeKind::Pointer(..) => Some(self),
TypeKind::ResolvedTypeRef(inner) |
TypeKind::Alias(_, inner) |
TypeKind::TemplateAlias(_, inner, _) |
TypeKind::TemplateRef(inner, _) => {
ctx.resolve_type(inner).safe_canonical_type(ctx)
}
TypeKind::UnresolvedTypeRef(..) => None,
}
}
/// There are some types we don't want to stop at when finding an opaque
/// item, so we can arrive to the proper item that needs to be generated.
pub fn should_be_traced_unconditionally(&self) -> bool {
match self.kind {
TypeKind::Function(..) |
TypeKind::Pointer(..) |
TypeKind::Array(..) |
TypeKind::Reference(..) |
TypeKind::TemplateRef(..) |
TypeKind::ResolvedTypeRef(..) => true,
_ => false,
}
}
}
impl CanDeriveDebug for Type {
type Extra = ();
fn can_derive_debug(&self, ctx: &BindgenContext, _: ()) -> bool {
match self.kind {
TypeKind::Array(t, len) => {
len <= RUST_DERIVE_IN_ARRAY_LIMIT && t.can_derive_debug(ctx, ())
}
TypeKind::ResolvedTypeRef(t) |
TypeKind::TemplateAlias(_, t, _) |
TypeKind::Alias(_, t) => t.can_derive_debug(ctx, ()),
TypeKind::Comp(ref info) => {
info.can_derive_debug(ctx, self.layout(ctx))
}
_ => true,
}
}
}
impl<'a> CanDeriveCopy<'a> for Type {
type Extra = &'a Item;
fn can_derive_copy(&self, ctx: &BindgenContext, item: &Item) -> bool {
match self.kind {
TypeKind::Array(t, len) => {
len <= RUST_DERIVE_IN_ARRAY_LIMIT &&
t.can_derive_copy_in_array(ctx, ())
}
TypeKind::ResolvedTypeRef(t) |
TypeKind::TemplateAlias(_, t, _) |
TypeKind::TemplateRef(t, _) |
TypeKind::Alias(_, t) => t.can_derive_copy(ctx, ()),
TypeKind::Comp(ref info) => {
info.can_derive_copy(ctx, (item, self.layout(ctx)))
}
_ => true,
}
}
fn can_derive_copy_in_array(&self,
ctx: &BindgenContext,
item: &Item)
-> bool {
match self.kind {
TypeKind::ResolvedTypeRef(t) |
TypeKind::TemplateAlias(_, t, _) |
TypeKind::Alias(_, t) |
TypeKind::Array(t, _) => t.can_derive_copy_in_array(ctx, ()),
TypeKind::Named(..) => false,
_ => self.can_derive_copy(ctx, item),
}
}
}
/// The kind of float this type represents.
#[derive(Debug, Copy, Clone, PartialEq)]
pub enum FloatKind {
/// A `float`.
Float,
/// A `double`.
Double,
/// A `long double`.
LongDouble,
/// A `__float128`.
Float128,
}
/// The different kinds of types that we can parse.
#[derive(Debug)]
pub enum TypeKind {
/// The void type.
Void,
/// The `nullptr_t` type.
NullPtr,
/// A compound type, that is, a class, struct, or union.
Comp(CompInfo),
/// An integer type, of a given kind. `bool` and `char` are also considered
/// integers.
Int(IntKind),
/// A floating point type.
Float(FloatKind),
/// A complex floating point type.
Complex(FloatKind),
/// A type alias, with a name, that points to another type.
Alias(String, ItemId),
/// A templated alias, pointing to an inner type, just as `Alias`, but with
/// template parameters.
TemplateAlias(String, ItemId, Vec<ItemId>),
/// An array of a type and a lenght.
Array(ItemId, usize),
/// A function type, with a given signature.
Function(FunctionSig),
/// An `enum` type.
Enum(Enum),
/// A pointer to a type. The bool field represents whether it's const or
/// not.
Pointer(ItemId),
/// A pointer to an Apple block.
BlockPointer,
/// A reference to a type, as in: int& foo().
Reference(ItemId),
/// A reference to a template, with different template parameter names. To
/// see why this is needed, check out the creation of this variant in
/// `Type::from_clang_ty`.
TemplateRef(ItemId, Vec<ItemId>),
/// A reference to a yet-to-resolve type. This stores the clang cursor
/// itself, and postpones its resolution.
///
/// These are gone in a phase after parsing where these are mapped to
/// already known types, and are converted to ResolvedTypeRef.
///
/// see tests/headers/typeref.hpp to see somewhere where this is a problem.
UnresolvedTypeRef(clang::Type,
Option<clang::Cursor>,
/* parent_id */
Option<ItemId>),
/// An indirection to another type.
///
/// These are generated after we resolve a forward declaration, or when we
/// replace one type with another.
ResolvedTypeRef(ItemId),
/// A named type, that is, a template parameter.
Named(String),
}
impl Type {
/// Whether this type is unsized, that is, has no members. This is used to
/// derive whether we should generate a dummy `_address` field for structs,
/// to comply to the C and C++ layouts, that specify that every type needs
/// to be addressable.
pub fn is_unsized(&self, ctx: &BindgenContext) -> bool {
debug_assert!(ctx.in_codegen_phase(), "Not yet");
match self.kind {
TypeKind::Void => true,
TypeKind::Comp(ref ci) => ci.is_unsized(ctx),
TypeKind::Array(inner, size) => {
size == 0 || ctx.resolve_type(inner).is_unsized(ctx)
}
TypeKind::ResolvedTypeRef(inner) |
TypeKind::Alias(_, inner) |
TypeKind::TemplateAlias(_, inner, _) |
TypeKind::TemplateRef(inner, _) => {
ctx.resolve_type(inner).is_unsized(ctx)
}
TypeKind::Named(..) |
TypeKind::Int(..) |
TypeKind::Float(..) |
TypeKind::Complex(..) |
TypeKind::Function(..) |
TypeKind::Enum(..) |
TypeKind::Reference(..) |
TypeKind::NullPtr |
TypeKind::BlockPointer |
TypeKind::Pointer(..) => false,
TypeKind::UnresolvedTypeRef(..) => {
unreachable!("Should have been resolved after parsing!");
}
}
}
/// This is another of the nasty methods. This one is the one that takes
/// care of the core logic of converting a clang type to a `Type`.
///
/// It's sort of nasty and full of special-casing, but hopefully the
/// comments in every special case justify why they're there.
pub fn from_clang_ty(potential_id: ItemId,
ty: &clang::Type,
location: Option<Cursor>,
parent_id: Option<ItemId>,
ctx: &mut BindgenContext)
-> Result<ParseResult<Self>, ParseError> {
use clang_sys::*;
{
let already_resolved =
ctx.builtin_or_resolved_ty(potential_id,
parent_id,
ty,
location);
if let Some(ty) = already_resolved {
debug!("{:?} already resolved: {:?}", ty, location);
return Ok(ParseResult::AlreadyResolved(ty));
}
}
let layout = ty.fallible_layout().ok();
let cursor = ty.declaration();
let mut name = cursor.spelling();
debug!("from_clang_ty: {:?}, ty: {:?}, loc: {:?}",
potential_id,
ty,
location);
debug!("currently_parsed_types: {:?}", ctx.currently_parsed_types);
let canonical_ty = ty.canonical_type();
let kind = match ty.kind() {
CXType_Unexposed if *ty != canonical_ty &&
canonical_ty.kind() != CXType_Invalid => {
debug!("Looking for canonical type: {:?}", canonical_ty);
return Self::from_clang_ty(potential_id,
&canonical_ty,
location,
parent_id,
ctx);
}
CXType_Unexposed | CXType_Invalid => {
// For some reason Clang doesn't give us any hint in some
// situations where we should generate a function pointer (see
// tests/headers/func_ptr_in_struct.h), so we do a guess here
// trying to see if it has a valid return type.
if ty.ret_type().is_some() {
let signature = try!(FunctionSig::from_ty(ty,
&location.unwrap_or(cursor),
ctx));
TypeKind::Function(signature)
// Same here, with template specialisations we can safely
// assume this is a Comp(..)
} else if ty.is_fully_specialized_template() {
debug!("Template specialization: {:?}", ty);
let complex =
CompInfo::from_ty(potential_id, ty, location, ctx)
.expect("C'mon");
TypeKind::Comp(complex)
} else if let Some(location) = location {
match location.kind() {
CXCursor_ClassTemplatePartialSpecialization |
CXCursor_CXXBaseSpecifier |
CXCursor_ClassTemplate => {
if location.kind() == CXCursor_CXXBaseSpecifier {
// In the case we're parsing a base specifier
// inside an unexposed or invalid type, it means
// that we're parsing one of two things:
//
// * A template parameter.
// * A complex class that isn't exposed.
//
// This means, unfortunately, that there's no
// good way to differentiate between them.
//
// Probably we could try to look at the
// declaration and complicate more this logic,
// but we'll keep it simple... if it's a valid
// C++ identifier, we'll consider it as a
// template parameter.
//
// This is because:
//
// * We expect every other base that is a
// proper identifier (that is, a simple
// struct/union declaration), to be exposed,
// so this path can't be reached in that
// case.
//
// * Quite conveniently, complex base
// specifiers preserve their full names (that
// is: Foo<T> instead of Foo). We can take
// advantage of this.
//
// If we find some edge case where this doesn't
// work (which I guess is unlikely, see the
// different test cases[1][2][3][4]), we'd need
// to find more creative ways of differentiating
// these two cases.
//
// [1]: inherit_named.hpp
// [2]: forward-inherit-struct-with-fields.hpp
// [3]: forward-inherit-struct.hpp
// [4]: inherit-namespaced.hpp
if location.spelling()
.chars()
.all(|c| c.is_alphanumeric() || c == '_') {
return Err(ParseError::Recurse);
}
} else {
name = location.spelling();
}
let complex = CompInfo::from_ty(potential_id,
ty,
Some(location),
ctx)
.expect("C'mon");
TypeKind::Comp(complex)
}
CXCursor_TypeAliasTemplateDecl => {
debug!("TypeAliasTemplateDecl");
// We need to manually unwind this one.
let mut inner = Err(ParseError::Continue);
let mut args = vec![];
location.visit(|cur| {
match cur.kind() {
CXCursor_TypeAliasDecl => {
let current = cur.cur_type();
debug_assert!(current.kind() ==
CXType_Typedef);
name = current.spelling();
let inner_ty = cur.typedef_type()
.expect("Not valid Type?");
inner =
Item::from_ty(&inner_ty,
Some(cur),
Some(potential_id),
ctx);
}
CXCursor_TemplateTypeParameter => {
// See the comment in src/ir/comp.rs
// about the same situation.
if cur.spelling().is_empty() {
return CXChildVisit_Continue;
}
let param =
Item::named_type(cur.spelling(),
potential_id,
ctx);
args.push(param);
}
_ => {}
}
CXChildVisit_Continue
});
let inner_type = match inner {
Ok(inner) => inner,
Err(..) => {
error!("Failed to parse template alias \
{:?}",
location);
return Err(ParseError::Continue);
}
};
TypeKind::TemplateAlias(name.clone(),
inner_type,
args)
}
CXCursor_TemplateRef => {
let referenced = location.referenced().unwrap();
let referenced_ty = referenced.cur_type();
debug!("TemplateRef: location = {:?}; referenced = \
{:?}; referenced_ty = {:?}",
location,
referenced,
referenced_ty);
return Self::from_clang_ty(potential_id,
&referenced_ty,
Some(referenced),
parent_id,
ctx);
}
CXCursor_TypeRef => {
let referenced = location.referenced().unwrap();
let referenced_ty = referenced.cur_type();
let declaration = referenced_ty.declaration();
debug!("TypeRef: location = {:?}; referenced = \
{:?}; referenced_ty = {:?}",
location,
referenced,
referenced_ty);
let item =
Item::from_ty_or_ref_with_id(potential_id,
referenced_ty,
Some(declaration),
parent_id,
ctx);
return Ok(ParseResult::AlreadyResolved(item));
}
CXCursor_NamespaceRef => {
return Err(ParseError::Continue);
}
_ => {
if ty.kind() == CXType_Unexposed {
warn!("Unexposed type {:?}, recursing inside, \
loc: {:?}",
ty,
location);
return Err(ParseError::Recurse);
}
// If the type name is empty we're probably
// over-recursing to find a template parameter name
// or something like that, so just don't be too
// noisy with it since it causes confusion, see for
// example the discussion in:
//
// https://github.com/jamesmunns/teensy3-rs/issues/9
if !ty.spelling().is_empty() {
warn!("invalid type {:?}", ty);
} else {
warn!("invalid type {:?}", ty);
}
return Err(ParseError::Continue);
}
}
} else {
// TODO: Don't duplicate this!
if ty.kind() == CXType_Unexposed {
warn!("Unexposed type {:?}, recursing inside", ty);
return Err(ParseError::Recurse);
}
if !ty.spelling().is_empty() {
warn!("invalid type {:?}", ty);
} else {
warn!("invalid type {:?}", ty);
}
return Err(ParseError::Continue);
}
}
CXType_Auto => {
if canonical_ty == *ty {
debug!("Couldn't find deduced type: {:?}", ty);
return Err(ParseError::Continue);
}
return Self::from_clang_ty(potential_id,
&canonical_ty,
location,
parent_id,
ctx);
}
// NOTE: We don't resolve pointers eagerly because the pointee type
// might not have been parsed, and if it contains templates or
// something else we might get confused, see the comment inside
// TypeRef.
//
// We might need to, though, if the context is already in the
// process of resolving them.
CXType_MemberPointer |
CXType_Pointer => {
let inner = Item::from_ty_or_ref(ty.pointee_type().unwrap(),
location,
parent_id,
ctx);
TypeKind::Pointer(inner)
}
CXType_BlockPointer => TypeKind::BlockPointer,
// XXX: RValueReference is most likely wrong, but I don't think we
// can even add bindings for that, so huh.
CXType_RValueReference |
CXType_LValueReference => {
let inner = Item::from_ty_or_ref(ty.pointee_type().unwrap(),
location,
parent_id,
ctx);
TypeKind::Reference(inner)
}
// XXX DependentSizedArray is wrong
CXType_VariableArray |
CXType_DependentSizedArray |
CXType_IncompleteArray => {
let inner = Item::from_ty(ty.elem_type().as_ref().unwrap(),
location,
parent_id,
ctx)
.expect("Not able to resolve array element?");
TypeKind::Pointer(inner)
}
CXType_FunctionNoProto |
CXType_FunctionProto => {
let signature = try!(FunctionSig::from_ty(ty,
&location.unwrap_or(cursor),
ctx));
TypeKind::Function(signature)
}
CXType_Typedef => {
let inner = cursor.typedef_type().expect("Not valid Type?");
let inner =
Item::from_ty_or_ref(inner, location, parent_id, ctx);
TypeKind::Alias(ty.spelling(), inner)
}
CXType_Enum => {
let enum_ = Enum::from_ty(ty, ctx).expect("Not an enum?");
TypeKind::Enum(enum_)
}
CXType_Record => {
let complex =
CompInfo::from_ty(potential_id, ty, location, ctx)
.expect("Not a complex type?");
TypeKind::Comp(complex)
}
// FIXME: We stub vectors as arrays since in 99% of the cases the
// layout is going to be correct, and there's no way we can generate
// vector types properly in Rust for now.
//
// That being said, that should be fixed eventually.
CXType_Vector |
CXType_ConstantArray => {
let inner = Item::from_ty(ty.elem_type().as_ref().unwrap(),
location,
parent_id,
ctx)
.expect("Not able to resolve array element?");
TypeKind::Array(inner, ty.num_elements().unwrap())
}
CXType_Elaborated => {
return Self::from_clang_ty(potential_id,
&ty.named(),
location,
parent_id,
ctx);
}
_ => {
error!("unsupported type: kind = {:?}; ty = {:?}; at {:?}",
ty.kind(),
ty,
location);
return Err(ParseError::Continue);
}
};
let name = if name.is_empty() { None } else { Some(name) };
let is_const = ty.is_const();
let ty = Type::new(name, layout, kind, is_const);
// TODO: maybe declaration.canonical()?
Ok(ParseResult::New(ty, Some(cursor.canonical())))
}
}
impl TypeCollector for Type {
type Extra = Item;
fn collect_types(&self,
context: &BindgenContext,
types: &mut ItemSet,
item: &Item) {
match *self.kind() {
TypeKind::Pointer(inner) |
TypeKind::Reference(inner) |
TypeKind::Array(inner, _) |
TypeKind::Alias(_, inner) |
TypeKind::ResolvedTypeRef(inner) => {
types.insert(inner);
}
TypeKind::TemplateAlias(_, inner, ref template_args) |
TypeKind::TemplateRef(inner, ref template_args) => {
types.insert(inner);
for &item in template_args {
types.insert(item);
}
}
TypeKind::Comp(ref ci) => ci.collect_types(context, types, item),
TypeKind::Function(ref sig) => {
sig.collect_types(context, types, item)
}
TypeKind::Enum(ref en) => {
if let Some(repr) = en.repr() {
types.insert(repr);
}
}
TypeKind::UnresolvedTypeRef(_, _, Some(id)) => {
types.insert(id);
}
// None of these variants have edges to other items and types.
TypeKind::UnresolvedTypeRef(_, _, None) |
TypeKind::Named(_) |
TypeKind::Void |
TypeKind::NullPtr |
TypeKind::Int(_) |
TypeKind::Float(_) |
TypeKind::Complex(_) |
TypeKind::BlockPointer => {}
}
}
}