Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Positive coverage: loan_not_required_by_live_place_prefix / prefix

prefix
LineCoverageSource
1448✗(if let Some(prefix) = live_place.prefix())
1449✗(loan_not_required_by_live_place(env, assumptions, outlives, loan, prefix) => ())
──────── ("prefix")
14516(loan_not_required_by_live_place_prefix(env, assumptions, outlives, loan, live_place) => ())

6 tests exercised this rule:


Source location: tests/borrowck.rs:4612 (all coverage from this test)

fn conditional_with_indirection() -> u32 {
    exists<'r0, 'r1, 'r2, 'r3> {
        let b: X = X { value: 0_u32 };
        let p: &'r0 mut X = &'r1 mut b;
        'l: loop {
            let now: &'r2 mut X = &'r2 mut *p;
            if true {
                if true {
                    let next: &'r3 mut X = next_of::<'r3>(&'r3 mut *p);
                    p = next;
                } else {
                }
            } else {
                break 'l;
            }
        }
        return 0_u32;
    }
}
Proof tree
… (200 of 2796 nodes shown)

Source location: tests/borrowck.rs:4789 (all coverage from this test)

fn next<'a>(d: &'a mut Decoder) -> &'a u32 {
    exists<'r0, 'r1> {
        'l: loop {
            let buf: &'r0 u32 = fill_buf::<'r0>(&'r0 mut (*d).buf_read);
            let s: &'r1 u32 = decode::<'r1>(buf);
            if true {
                return s;
            } else {
            }
        }
    }
}
Proof tree
… (200 of 1952 nodes shown)

Source location: tests/borrowck.rs:4912 (all coverage from this test)

fn next<'s>(f: &'s mut Filter) -> &'s mut u32 {
    exists<'r0, 'r1, 'r2> {
        'l: loop {
            let item: &'r0 mut u32 = iter_next::<'r0>(&'r0 mut (*f).iter);
            if true {
                let keep: bool = call_predicate::<'r1, 'r2>(&'r1 mut (*f).predicate, &'r2 *item);
                if keep {
                    return item;
                } else {
                }
            } else {
                break 'l;
            }
        }
        return no_item::<'s>();
    }
}
Proof tree
… (200 of 3367 nodes shown)

Source location: tests/codegen.rs:1820 (all coverage from this test)

fn main() -> () {
    let p: Pair = Pair { left: 8_u32, right: 16_u32 };
    exists<'a> {
        let r: &'a mut Pair = &'a mut p;
        p.left %= update::<'a>(r);
    }
    println!(p.left);
    println!(p.right);
}
Proof tree
… (200 of 1652 nodes shown)

Source location: tests/pr531_review_probes.rs:39 (all coverage from this test)

fn main() -> () {
    let p: Pair = Pair { left: 2_u32, right: 16_u32 };
    exists<'a> {
        let r: &'a mut Pair = &'a mut p;
        p.left |= update::<'a>(r);
    }
    println!(p.left);
    println!(p.right);
}
Proof tree
… (200 of 1652 nodes shown)

Source location: tests/pr539_review_probes.rs:39 (all coverage from this test)

fn main() -> () {
    let p: Pair = Pair { left: 1_u32, right: 16_u32 };
    exists<'a> {
        let r: &'a mut Pair = &'a mut p;
        p.left &= update::<'a>(r);
    }
    println!(p.left);
    println!(p.right);
}
Proof tree
… (200 of 1652 nodes shown)

How to read this page