# Enum rustc_codegen_ssa::back::lto::LtoModuleCodegen

source ·

    pub enum LtoModuleCodegen<B: WriteBackendMethods> {
        Fat {
            module: ModuleCodegen<B::Module>,
            _serialized_bitcode: Vec<SerializedModule<B::ModuleBuffer>>,
        },
        Thin(ThinModule<B>),
    }

## Variants§

§

### Fat

#### Fields

§`module: ModuleCodegen<B::Module>`
§`_serialized_bitcode: Vec<SerializedModule<B::ModuleBuffer>>`
§

### Thin(ThinModule<B>)

## Implementations§

source§

### impl<B: WriteBackendMethods> LtoModuleCodegen<B>

source

#### pub fn name(&self) -> &str

source

#### pub unsafe fn optimize( self, cgcx: &CodegenContext<B> ) -> Result<ModuleCodegen<B::Module>, FatalError>

Optimize this module within the given codegen context.

This function is unsafe as it’ll return a `ModuleCodegen` still points to LLVM data structures owned by this `LtoModuleCodegen`. It’s intended that the module returned is immediately code generated and dropped, and then this LTO module is dropped.

source

#### pub fn cost(&self) -> u64

A “gauge” of how costly it is to optimize this module, used to sort biggest modules first.

## Auto Trait Implementations§

§

### impl<B> RefUnwindSafe for LtoModuleCodegen<B>
where <B as WriteBackendMethods>::Module: RefUnwindSafe, <B as WriteBackendMethods>::ModuleBuffer: RefUnwindSafe, <B as WriteBackendMethods>::ThinBuffer: RefUnwindSafe, <B as WriteBackendMethods>::ThinData: RefUnwindSafe,

§

### impl<B> Send for LtoModuleCodegen<B>

§

### impl<B> Sync for LtoModuleCodegen<B>

§

### impl<B> Unpin for LtoModuleCodegen<B>
where <B as WriteBackendMethods>::Module: Unpin, <B as WriteBackendMethods>::ModuleBuffer: Unpin,

§

### impl<B> UnwindSafe for LtoModuleCodegen<B>
where <B as WriteBackendMethods>::Module: UnwindSafe, <B as WriteBackendMethods>::ModuleBuffer: UnwindSafe + RefUnwindSafe, <B as WriteBackendMethods>::ThinBuffer: RefUnwindSafe, <B as WriteBackendMethods>::ThinData: RefUnwindSafe,

## Blanket Implementations§

source§

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

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

### impl<T> Borrow<T> for T
where T: ?Sized,

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T, U> Into<U> for T
where 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<T, U> TryFrom<U> for T
where 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 T
where 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.

## Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.