// Copyright 2012-2016 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. use astencode; use index; use rustc::hir; use rustc::hir::def::{self, CtorKind}; use rustc::hir::def_id::{DefIndex, DefId}; use rustc::middle::cstore::{DepKind, LinkagePreference, NativeLibrary}; use rustc::middle::lang_items; use rustc::middle::resolve_lifetime::ObjectLifetimeDefault; use rustc::mir; use rustc::ty::{self, Ty}; use rustc_back::PanicStrategy; use rustc_serialize as serialize; use syntax::{ast, attr}; use syntax::symbol::Symbol; use syntax_pos::{self, Span}; use std::marker::PhantomData; pub fn rustc_version() -> String { format!("rustc {}", option_env!("CFG_VERSION").unwrap_or("unknown version")) } /// Metadata encoding version. /// NB: increment this if you change the format of metadata such that /// the rustc version can't be found to compare with `rustc_version()`. pub const METADATA_VERSION: u8 = 4; /// Metadata header which includes `METADATA_VERSION`. /// To get older versions of rustc to ignore this metadata, /// there are 4 zero bytes at the start, which are treated /// as a length of 0 by old compilers. /// /// This header is followed by the position of the `CrateRoot`, /// which is encoded as a 32-bit big-endian unsigned integer, /// and further followed by the rustc version string. pub const METADATA_HEADER: &'static [u8; 12] = &[0, 0, 0, 0, b'r', b'u', b's', b't', 0, 0, 0, METADATA_VERSION]; /// The shorthand encoding uses an enum's variant index `usize` /// and is offset by this value so it never matches a real variant. /// This offset is also chosen so that the first byte is never < 0x80. pub const SHORTHAND_OFFSET: usize = 0x80; /// A value of type T referred to by its absolute position /// in the metadata, and which can be decoded lazily. /// /// Metadata is effective a tree, encoded in post-order, /// and with the root's position written next to the header. /// That means every single `Lazy` points to some previous /// location in the metadata and is part of a larger node. /// /// The first `Lazy` in a node is encoded as the backwards /// distance from the position where the containing node /// starts and where the `Lazy` points to, while the rest /// use the forward distance from the previous `Lazy`. /// Distances start at 1, as 0-byte nodes are invalid. /// Also invalid are nodes being referred in a different /// order than they were encoded in. #[must_use] pub struct Lazy { pub position: usize, _marker: PhantomData, } impl Lazy { pub fn with_position(position: usize) -> Lazy { Lazy { position: position, _marker: PhantomData, } } /// Returns the minimum encoded size of a value of type `T`. // FIXME(eddyb) Give better estimates for certain types. pub fn min_size() -> usize { 1 } } impl Copy for Lazy {} impl Clone for Lazy { fn clone(&self) -> Self { *self } } impl serialize::UseSpecializedEncodable for Lazy {} impl serialize::UseSpecializedDecodable for Lazy {} /// A sequence of type T referred to by its absolute position /// in the metadata and length, and which can be decoded lazily. /// The sequence is a single node for the purposes of `Lazy`. /// /// Unlike `Lazy>`, the length is encoded next to the /// position, not at the position, which means that the length /// doesn't need to be known before encoding all the elements. /// /// If the length is 0, no position is encoded, but otherwise, /// the encoding is that of `Lazy`, with the distinction that /// the minimal distance the length of the sequence, i.e. /// it's assumed there's no 0-byte element in the sequence. #[must_use] pub struct LazySeq { pub len: usize, pub position: usize, _marker: PhantomData, } impl LazySeq { pub fn empty() -> LazySeq { LazySeq::with_position_and_length(0, 0) } pub fn with_position_and_length(position: usize, len: usize) -> LazySeq { LazySeq { len: len, position: position, _marker: PhantomData, } } /// Returns the minimum encoded size of `length` values of type `T`. pub fn min_size(length: usize) -> usize { length } } impl Copy for LazySeq {} impl Clone for LazySeq { fn clone(&self) -> Self { *self } } impl serialize::UseSpecializedEncodable for LazySeq {} impl serialize::UseSpecializedDecodable for LazySeq {} /// Encoding / decoding state for `Lazy` and `LazySeq`. #[derive(Copy, Clone, PartialEq, Eq, Debug)] pub enum LazyState { /// Outside of a metadata node. NoNode, /// Inside a metadata node, and before any `Lazy` or `LazySeq`. /// The position is that of the node itself. NodeStart(usize), /// Inside a metadata node, with a previous `Lazy` or `LazySeq`. /// The position is a conservative estimate of where that /// previous `Lazy` / `LazySeq` would end (see their comments). Previous(usize), } #[derive(RustcEncodable, RustcDecodable)] pub struct CrateRoot { pub name: Symbol, pub triple: String, pub hash: hir::svh::Svh, pub disambiguator: Symbol, pub panic_strategy: PanicStrategy, pub plugin_registrar_fn: Option, pub macro_derive_registrar: Option, pub crate_deps: LazySeq, pub dylib_dependency_formats: LazySeq>, pub lang_items: LazySeq<(DefIndex, usize)>, pub lang_items_missing: LazySeq, pub native_libraries: LazySeq, pub codemap: LazySeq, pub def_path_table: Lazy, pub impls: LazySeq, pub exported_symbols: LazySeq, pub index: LazySeq, } #[derive(RustcEncodable, RustcDecodable)] pub struct CrateDep { pub name: ast::Name, pub hash: hir::svh::Svh, pub kind: DepKind, } #[derive(RustcEncodable, RustcDecodable)] pub struct TraitImpls { pub trait_id: (u32, DefIndex), pub impls: LazySeq, } #[derive(RustcEncodable, RustcDecodable)] pub struct Entry<'tcx> { pub kind: EntryKind<'tcx>, pub visibility: Lazy, pub span: Lazy, pub attributes: LazySeq, pub children: LazySeq, pub stability: Option>, pub deprecation: Option>, pub ty: Option>>, pub inherent_impls: LazySeq, pub variances: LazySeq, pub generics: Option>>, pub predicates: Option>>, pub ast: Option>>, pub mir: Option>>, } #[derive(Copy, Clone, RustcEncodable, RustcDecodable)] pub enum EntryKind<'tcx> { Const, ImmStatic, MutStatic, ForeignImmStatic, ForeignMutStatic, ForeignMod, Type, Enum, Field, Variant(Lazy), Struct(Lazy), Union(Lazy), Fn(Lazy), ForeignFn(Lazy), Mod(Lazy), MacroDef(Lazy), Closure(Lazy>), Trait(Lazy>), Impl(Lazy>), DefaultImpl(Lazy>), Method(Lazy), AssociatedType(AssociatedContainer), AssociatedConst(AssociatedContainer), } /// A copy of `ty::Generics` which allows lazy decoding of /// `regions` and `types` (e.g. knowing the number of type /// and lifetime parameters before `TyCtxt` is created). #[derive(RustcEncodable, RustcDecodable)] pub struct Generics<'tcx> { pub parent: Option, pub parent_regions: u32, pub parent_types: u32, pub regions: LazySeq, pub types: LazySeq>, pub has_self: bool, pub object_lifetime_defaults: LazySeq, } #[derive(RustcEncodable, RustcDecodable)] pub struct ModData { pub reexports: LazySeq, } #[derive(RustcEncodable, RustcDecodable)] pub struct MacroDef { pub body: String, } #[derive(RustcEncodable, RustcDecodable)] pub struct FnData { pub constness: hir::Constness, pub arg_names: LazySeq, } #[derive(RustcEncodable, RustcDecodable)] pub struct VariantData { pub ctor_kind: CtorKind, pub disr: u128, /// If this is a struct's only variant, this /// is the index of the "struct ctor" item. pub struct_ctor: Option, } #[derive(RustcEncodable, RustcDecodable)] pub struct TraitData<'tcx> { pub unsafety: hir::Unsafety, pub paren_sugar: bool, pub has_default_impl: bool, pub super_predicates: Lazy>, } #[derive(RustcEncodable, RustcDecodable)] pub struct ImplData<'tcx> { pub polarity: hir::ImplPolarity, pub parent_impl: Option, pub coerce_unsized_kind: Option, pub trait_ref: Option>>, } /// Describes whether the container of an associated item /// is a trait or an impl and whether, in a trait, it has /// a default, or an in impl, whether it's marked "default". #[derive(Copy, Clone, RustcEncodable, RustcDecodable)] pub enum AssociatedContainer { TraitRequired, TraitWithDefault, ImplDefault, ImplFinal, } impl AssociatedContainer { pub fn with_def_id(&self, def_id: DefId) -> ty::AssociatedItemContainer { match *self { AssociatedContainer::TraitRequired | AssociatedContainer::TraitWithDefault => ty::TraitContainer(def_id), AssociatedContainer::ImplDefault | AssociatedContainer::ImplFinal => ty::ImplContainer(def_id), } } pub fn defaultness(&self) -> hir::Defaultness { match *self { AssociatedContainer::TraitRequired => hir::Defaultness::Default { has_value: false, }, AssociatedContainer::TraitWithDefault | AssociatedContainer::ImplDefault => hir::Defaultness::Default { has_value: true, }, AssociatedContainer::ImplFinal => hir::Defaultness::Final, } } } #[derive(RustcEncodable, RustcDecodable)] pub struct MethodData { pub fn_data: FnData, pub container: AssociatedContainer, pub has_self: bool, } #[derive(RustcEncodable, RustcDecodable)] pub struct ClosureData<'tcx> { pub kind: ty::ClosureKind, pub ty: Lazy>, }