branches 0.4.4

Branch hinting prediction and control functions for stable Rust including likely, unlikely, assume and abort, plus read and write cpu prefetch functions to help algorithm optimization
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

use branches::{assume, likely, unlikely};
use core::sync::atomic::{AtomicUsize, Ordering};

#[allow(unused_imports)]
#[test]
fn test_likely_identity() {
    for &b in &[true, false] {
        assert_eq!(likely(b), b);
    }
}

#[test]
fn test_unlikely_identity() {
    for &b in &[true, false] {
        assert_eq!(unlikely(b), b);
    }
}

#[test]
fn test_likely_unlikely_mixed() {
    let data = [true, false, true, true, false];
    let mut c1 = 0usize;
    let mut c2 = 0usize;
    for &b in &data {
        if likely(b) {
            c1 += 1;
        }
        if unlikely(!b) {
            c2 += 1;
        }
    }
    assert_eq!(c1, 3);
    assert_eq!(c2, 2);
}

#[test]
fn test_assume_true_no_effect() {
    static COUNTER: AtomicUsize = AtomicUsize::new(0);
    for i in 0..100 {
        unsafe {
            assume(i < 100);
        }
        COUNTER.fetch_add(1, Ordering::Relaxed);
    }
    assert_eq!(COUNTER.load(Ordering::Relaxed), 100);
}

#[test]
fn test_assume_in_loop_logic_preserved() {
    let mut sum = 0usize;
    for i in 1..=32 {
        unsafe {
            assume(i <= 32);
        }
        sum += i;
    }
    assert_eq!(sum, (32 * 33) / 2);
}