Struct AffineAccess 

pub struct AffineAccess {
    pub base: String,
    pub coeff: i64,
    pub offset: i64,
    pub is_write: bool,
}

A single affine access of the form base + coeff * loop_var + offset.

Fields

base: String

Base array / variable name.

coeff: i64

Coefficient of the loop induction variable.

offset: i64

Constant offset.

is_write: bool

Whether this is a write access.

Implementations

impl AffineAccess

pub fn independent_from(&self, other: &AffineAccess) -> bool

Two accesses are independent under Bernstein’s conditions when their access sets are provably disjoint, i.e., there is no integer i, j (with i != j for loop-carried deps) satisfying both access functions.

For 1-D affine accesses base + c1*i + o1 vs base + c2*j + o2 we require c1 == c2 (same stride) to get a GCD test: gcd(c1,c2) | (o1-o2).

Trait Implementations

impl Clone for AffineAccess

fn clone(&self) -> AffineAccess

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AffineAccess

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for AffineAccess

fn eq(&self, other: &AffineAccess) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for AffineAccess

impl StructuralPartialEq for AffineAccess