Skip to main content

TunableSet

Struct TunableSet 

Source
pub struct TunableSet<K: AutotuneKey, F: TuneInputs, Output: 'static> { /* private fields */ }
Expand description

A set of candidate tunable functions for autotune, sharing a key generator and an input generator. See TuneInputs for the F parameter.

Implementations§

Source§

impl<K: AutotuneKey, F: TuneInputs, Output: 'static> TunableSet<K, F, Output>

Source

pub fn len(&self) -> usize

The number of tunables in the set.

Source

pub fn is_empty(&self) -> bool

Whether this set contains no tunables.

Source

pub fn new( key_gen: impl KeyGenerator<K, F>, input_gen: impl InputGenerator<K, F>, ) -> Self

Create a tunable set from a key generator and an input generator.

Source

pub fn new_cloning_inputs(key_gen: impl KeyGenerator<K, F>) -> Self

Shorthand for new with a [CloneInputGenerator]: benchmarks run on clones of the real call inputs.

Source

pub fn with(self, tunable: Tunable<K, F, Output>) -> Self

Register a tunable with this tunable set.

Source

pub fn with_bounds( self, bounds: Arc<dyn BoundsGenerator<K, F> + Send + Sync>, ) -> Self

Sets the autotune bounds for this set.

Source

pub fn with_short_circuit(self, enabled: bool) -> Self

Set whether bounds-based short-circuiting is enabled.

Source

pub fn is_short_circuit_enabled(&self) -> bool

Whether short-circuiting is enabled for this set.

Source

pub fn autotunables(&self) -> impl Iterator<Item = &TuneFn<F, Output>>

All candidate operations in this set, in registration order.

Source

pub fn fastest(&self, fastest_index: usize) -> &TuneFn<F, Output>

Returns the operation for the given index, matching the order returned by autotunables. Tunables are tried in order, so index 0 should be a good default.

Source

pub fn compute_checksum(&self) -> String

Compute a checksum that invalidates outdated cached auto-tune results when the set of tunable names changes.

Source

pub fn generate_key<'a>(&self, inputs: &F::At<'a>) -> K

Generate a key from a set of inputs

Source

pub fn generate_inputs<'a>(&self, key: &K, inputs: &F::At<'a>) -> F::At<'a>

Generate a set of test inputs from a key and reference inputs.

Source

pub fn bounds(&self, key: &K, inputs: &F::At<'_>) -> Option<Bounds>

The throughput bounds registered on this set, if any.

Auto Trait Implementations§

§

impl<K, F, Output> !RefUnwindSafe for TunableSet<K, F, Output>

§

impl<K, F, Output> !UnwindSafe for TunableSet<K, F, Output>

§

impl<K, F, Output> Freeze for TunableSet<K, F, Output>
where Vec<Tunable<K, F, Output>>: Freeze, Arc<dyn KeyGenerator<K, F> + Sync + Send>: Freeze, Arc<dyn InputGenerator<K, F> + Sync + Send>: Freeze, Option<Arc<dyn BoundsGenerator<K, F> + Sync + Send>>: Freeze,

§

impl<K, F, Output> Send for TunableSet<K, F, Output>
where Vec<Tunable<K, F, Output>>: Send, Arc<dyn KeyGenerator<K, F> + Sync + Send>: Send, Arc<dyn InputGenerator<K, F> + Sync + Send>: Send, Option<Arc<dyn BoundsGenerator<K, F> + Sync + Send>>: Send,

§

impl<K, F, Output> Sync for TunableSet<K, F, Output>
where Vec<Tunable<K, F, Output>>: Sync, Arc<dyn KeyGenerator<K, F> + Sync + Send>: Sync, Arc<dyn InputGenerator<K, F> + Sync + Send>: Sync, Option<Arc<dyn BoundsGenerator<K, F> + Sync + Send>>: Sync,

§

impl<K, F, Output> Unpin for TunableSet<K, F, Output>
where Vec<Tunable<K, F, Output>>: Unpin, Arc<dyn KeyGenerator<K, F> + Sync + Send>: Unpin, Arc<dyn InputGenerator<K, F> + Sync + Send>: Unpin, Option<Arc<dyn BoundsGenerator<K, F> + Sync + Send>>: Unpin,

§

impl<K, F, Output> UnsafeUnpin for TunableSet<K, F, Output>
where Vec<Tunable<K, F, Output>>: UnsafeUnpin, Arc<dyn KeyGenerator<K, F> + Sync + Send>: UnsafeUnpin, Arc<dyn InputGenerator<K, F> + Sync + Send>: UnsafeUnpin, Option<Arc<dyn BoundsGenerator<K, F> + Sync + Send>>: UnsafeUnpin,

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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
Source§

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> DowncastSend for T
where T: Any + Send,

Source§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Sync + Send>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

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

Source§

type Error = !

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>,

Source§

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.