pub(crate) struct LinearLowering {
pub(crate) benchmark: &'static str,
pub(crate) iterations: u32,
pub(crate) wall_ns: Stats,
pub(crate) functions: usize,
pub(crate) program: Arc<Program>,
}Expand description
What lowering one benchmark to cove_ir cost, and the program every
vm measurement of that benchmark runs.
One per benchmark rather than one for the package, because that is the
unit cove_ir::lower_entry lowers: it lowers what one entry reaches and
stubs the rest, which is what cove run --backend vm asks for, so the
row is named for the benchmark it lowered rather than for the package.
Fields§
§benchmark: &'static str§iterations: u32§wall_ns: Stats§functions: usizeHow many entries the function table has.
A slice still gives every declaration of the package a table entry, and the ones the entry did not reach are stubs, so this is the count for the thing that was timed rather than a count of what the entry actually calls.
program: Arc<Program>Implementations§
Auto Trait Implementations§
impl Freeze for LinearLowering
impl RefUnwindSafe for LinearLowering
impl Send for LinearLowering
impl Sync for LinearLowering
impl Unpin for LinearLowering
impl UnsafeUnpin for LinearLowering
impl UnwindSafe for LinearLowering
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more