Struct rustc_middle::mir::mono::CodegenUnit
source · pub struct CodegenUnit<'tcx> {
name: Symbol,
items: FxHashMap<MonoItem<'tcx>, (Linkage, Visibility)>,
size_estimate: Option<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>, (Linkage, Visibility)>
§size_estimate: Option<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>
impl<'tcx> CodegenUnit<'tcx>
pub fn new(name: Symbol) -> CodegenUnit<'tcx>
pub fn name(&self) -> Symbol
pub fn set_name(&mut self, name: Symbol)
pub fn is_primary(&self) -> bool
pub fn make_primary(&mut self)
pub fn items(&self) -> &FxHashMap<MonoItem<'tcx>, (Linkage, Visibility)>
pub fn items_mut(
&mut self
) -> &mut FxHashMap<MonoItem<'tcx>, (Linkage, Visibility)>
pub fn is_code_coverage_dead_code_cgu(&self) -> bool
sourcepub fn make_code_coverage_dead_code_cgu(&mut self)
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.
pub fn mangle_name(human_readable_name: &str) -> String
pub fn estimate_size(&mut self, tcx: TyCtxt<'tcx>)
pub fn size_estimate(&self) -> usize
pub fn modify_size_estimate(&mut self, delta: usize)
pub fn contains_item(&self, item: &MonoItem<'tcx>) -> bool
pub fn work_product_id(&self) -> WorkProductId
pub fn previous_work_product(&self, tcx: TyCtxt<'_>) -> WorkProduct
pub fn items_in_deterministic_order(
&self,
tcx: TyCtxt<'tcx>
) -> Vec<(MonoItem<'tcx>, (Linkage, Visibility))>
pub fn codegen_dep_node(&self, tcx: TyCtxt<'tcx>) -> DepNode
Trait Implementations§
source§impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for CodegenUnit<'tcx>
impl<'tcx> ArenaAllocatable<'tcx, IsNotCopy> for CodegenUnit<'tcx>
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut Self
fn allocate_from_iter<'a>(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = Self>
) -> &'a mut [Self] ⓘ
source§impl<'tcx> Debug for CodegenUnit<'tcx>
impl<'tcx> Debug for CodegenUnit<'tcx>
source§impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for CodegenUnit<'tcx>
impl<'a, 'tcx> HashStable<StableHashingContext<'a>> for CodegenUnit<'tcx>
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<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
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). Read more
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
This method tries to recover the query key from the given
DepNode
,
something which is needed when forcing DepNode
s 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. Read moresource§impl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error(tcx: Tcx, _: &[QueryInfo]) -> 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: 56 bytes