pub enum Strategy {
Inferred {
algorithm: ConvAlgorithm,
tile_kind: AcceleratedTileKind,
},
Forced {
algorithm: ConvAlgorithm,
blueprint: ConvBlueprint,
},
}Expand description
Top-level user-facing strategy for launch_ref.
Specific selects an algorithm and tile-matmul kind, letting the routine
infer the rest. Forced bypasses inference and uses the supplied blueprint
directly (the algorithm tag must still be provided so the kernel-side
generic dispatch can pick the right reading-strategy implementation).
Variants§
Inferred
User picks the algorithm and tile-matmul kind. Tiling/swizzle/etc. are inferred from the problem.
Forced
User supplies a pre-built blueprint. The algorithm tag tells the launcher which kernel generic to instantiate; the tiling/swizzle/etc. come from the blueprint. The tile-matmul kind comes from the blueprint as well.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Strategy
impl RefUnwindSafe for Strategy
impl Send for Strategy
impl Sync for Strategy
impl Unpin for Strategy
impl UnsafeUnpin for Strategy
impl UnwindSafe for Strategy
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