pub struct CodegenUnit<'tcx> {
    name: Symbol,
    items: FxHashMap<MonoItem<'tcx>, MonoItemData>,
    size_estimate: usize,
    primary: bool,
    is_code_coverage_dead_code_cgu: bool,
}

Fields§

§name: Symbol

A name for this CGU. Incremental compilation requires that name be unique amongst all crates. Therefore, it should contain something unique to this crate (e.g., a module path) as well as the crate name and disambiguator.

§items: FxHashMap<MonoItem<'tcx>, MonoItemData>§size_estimate: usize§primary: bool§is_code_coverage_dead_code_cgu: bool

True if this is CGU is used to hold code coverage information for dead code, false otherwise.

Implementations§

source§

impl<'tcx> CodegenUnit<'tcx>

source

pub fn new(name: Symbol) -> CodegenUnit<'tcx>

source

pub fn name(&self) -> Symbol

source

pub fn set_name(&mut self, name: Symbol)

source

pub fn is_primary(&self) -> bool

source

pub fn make_primary(&mut self)

source

pub fn items(&self) -> &FxHashMap<MonoItem<'tcx>, MonoItemData>

The order of these items is non-determinstic.

source

pub fn items_mut(&mut self) -> &mut FxHashMap<MonoItem<'tcx>, MonoItemData>

The order of these items is non-determinstic.

source

pub fn is_code_coverage_dead_code_cgu(&self) -> bool

source

pub fn make_code_coverage_dead_code_cgu(&mut self)

Marks this CGU as the one used to contain code coverage information for dead code.

source

pub fn mangle_name(human_readable_name: &str) -> String

source

pub fn compute_size_estimate(&mut self)

source

pub fn size_estimate(&self) -> usize

Should only be called if compute_size_estimate has previously been called.

source

pub fn contains_item(&self, item: &MonoItem<'tcx>) -> bool

source

pub fn work_product_id(&self) -> WorkProductId

source

pub fn previous_work_product(&self, tcx: TyCtxt<'_>) -> WorkProduct

source

pub fn items_in_deterministic_order( &self, tcx: TyCtxt<'tcx> ) -> Vec<(MonoItem<'tcx>, MonoItemData)>

source

pub fn codegen_dep_node(&self, tcx: TyCtxt<'tcx>) -> DepNode

Trait Implementations§

source§

impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for CodegenUnit<'tcx>

source§

fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self

source§

fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Self> ) -> &'a mut [Self]

source§

impl<'tcx> Debug for CodegenUnit<'tcx>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for CodegenUnit<'tcx>

source§

fn hash_stable( &self, hcx: &mut StableHashingContext<'a>, hasher: &mut StableHasher )

Auto Trait Implementations§

§

impl<'tcx> !RefUnwindSafe for CodegenUnit<'tcx>

§

impl<'tcx> Send for CodegenUnit<'tcx>

§

impl<'tcx> Sync for CodegenUnit<'tcx>

§

impl<'tcx> Unpin for CodegenUnit<'tcx>

§

impl<'tcx> !UnwindSafe for CodegenUnit<'tcx>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

default fn recover(_: Tcx, _: &DepNode) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> T

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 48 bytes