bitcraft 1.0.0

A zero-cost, hardware-aligned bitfield and enumeration generator.
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
use bitcraft::Ordering;
use bitcraft::{atomic_bitarray, atomic_bitenum, atomic_bitstruct, bitenum};

bitenum! {
    pub enum State(2) {
        A = 0,
        B = 1,
        C = 2,
    }
}

atomic_bitstruct! {
    pub struct ConcurrentTest(AtomicU32) {
        pub flag: bool = 1,
        pub value: u8 = 4,
        pub signed_val: i16 = 12,
        pub state: State = 2,
    }
}

#[test]
fn test_atomic_bitstruct_api() {
    let f = ConcurrentTest::new(0);

    // Initial State
    assert_eq!(f.flag(Ordering::Relaxed), false);
    assert_eq!(f.value(Ordering::Relaxed), 0);
    assert_eq!(f.signed_val(Ordering::Relaxed), 0);
    assert_eq!(f.state(Ordering::Relaxed), State::A);

    // Setters
    f.set_flag(true, Ordering::SeqCst);
    assert_eq!(f.flag(Ordering::SeqCst), true);

    f.set_value(15, Ordering::SeqCst);
    assert_eq!(f.value(Ordering::SeqCst), 15);

    f.set_signed_val(-2000, Ordering::SeqCst);
    assert_eq!(f.signed_val(Ordering::SeqCst), -2000);

    f.set_state(State::C, Ordering::SeqCst);
    assert_eq!(f.state(Ordering::SeqCst), State::C);

    // Try Setters
    assert!(f.try_set_flag(false, Ordering::SeqCst).is_ok());
    assert_eq!(f.flag(Ordering::SeqCst), false);

    assert!(f.try_set_value(20, Ordering::SeqCst).is_err());
    assert!(f.try_set_signed_val(2048, Ordering::SeqCst).is_err());

    assert!(f.try_set_state(State::B, Ordering::SeqCst).is_ok());
    assert_eq!(f.state(Ordering::SeqCst), State::B);

    // Validate underlying load
    assert!(f.load(Ordering::SeqCst) > 0);
}

atomic_bitstruct! {
    pub struct SignedConcurrentTest(AtomicI32) {
        pub flag: bool = 1,
        pub value: i16 = 12,
    }
}

#[test]
fn test_signed_atomic_bitstruct() {
    let f = SignedConcurrentTest::new(-1);
    assert_eq!(f.flag(Ordering::Relaxed), true);
    assert_eq!(f.value(Ordering::Relaxed), -1);

    f.set_value(-2000, Ordering::SeqCst);
    assert_eq!(f.value(Ordering::SeqCst), -2000);

    // Test get()
    let current_val = f.get(Ordering::SeqCst);
    assert_eq!(current_val.flag(), true);
    assert_eq!(current_val.value(), -2000);

    let final_val = f.update(Ordering::SeqCst, Ordering::Relaxed, |v| {
        v.set_flag(false);
        v.set_value(500);
    });

    assert_eq!(final_val.flag(), true);
    assert_eq!(final_val.value(), -2000);

    assert_eq!(f.flag(Ordering::Relaxed), false);
    assert_eq!(f.value(Ordering::Relaxed), 500);
    // Test update_or_abort aborting
    let try_abort_result = f.update_or_abort(Ordering::SeqCst, Ordering::Relaxed, |v| {
        if v.flag() == false {
            return None; // Abort!
        }
        v.set_flag(true);
        Some(())
    });

    // It should have aborted and returned the unmodified state
    assert!(try_abort_result.is_err());
    assert_eq!(try_abort_result.unwrap_err().value(), 500);
    assert_eq!(f.value(Ordering::SeqCst), 500);

    // Test update_or_abort succeeding
    let try_success_result = f.update_or_abort(Ordering::SeqCst, Ordering::Relaxed, |v| {
        if v.flag() == false {
            v.set_value(999);
            return Some(()); // Commit!
        }
        None
    });

    assert!(try_success_result.is_ok());
    assert_eq!(f.value(Ordering::SeqCst), 999);

    // Test try_setters inside the closure
    let try_inner = f.update_or_abort(Ordering::SeqCst, Ordering::Relaxed, |v| {
        // flag is boolean, so try_set always succeeds
        let _ = v.try_set_flag(false);

        if v.try_set_value(30000).is_err() {
            // It correctly blocked the overflow
            // let's do a valid try_set and return
            let _ = v.try_set_value(1234);
            return Some(());
        }
        None
    });

    assert!(try_inner.is_ok());
    assert_eq!(f.value(Ordering::SeqCst), 1234);
    assert_eq!(f.flag(Ordering::SeqCst), false);
}

#[test]
fn test_threaded_concurrent_updates() {
    use std::sync::Arc;
    use std::thread;

    let shared = Arc::new(ConcurrentTest::new(0));
    let mut handles = vec![];

    for _ in 0..10 {
        let f = Arc::clone(&shared);
        handles.push(thread::spawn(move || {
            for _ in 0..100 {
                // Safely update the value atomically using the closure batch updater
                f.update(Ordering::SeqCst, Ordering::Relaxed, |v| {
                    let current = v.value();
                    v.set_value(current.wrapping_add(1) % 16);
                });
            }
        }));
    }

    for h in handles {
        h.join().unwrap();
    }

    // Since we wrapped by 16 and did 1000 increments, 1000 % 16 = 8.
    // 0 + 1000 = 1000. 1000 % 16 = 8. Wait! 1000 increments each adding 1 and wrapping at 16.
    // So the final value should be (1000 % 16) = 8.
    assert_eq!(shared.value(Ordering::SeqCst), 8);
}

atomic_bitenum! {
    pub enum ConcurrentMode(AtomicU8, 2) {
        STANDBY = 0,
        ACTIVE = 1,
        ERROR = 2,
    }
}

#[test]
fn test_atomic_bitenum() {
    let mode = ConcurrentMode::new(ConcurrentModeValue::STANDBY);
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::STANDBY);

    mode.store(ConcurrentModeValue::ACTIVE, Ordering::SeqCst);
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::ACTIVE);

    let prev = mode.swap(ConcurrentModeValue::ERROR, Ordering::SeqCst);
    assert_eq!(prev, ConcurrentModeValue::ACTIVE);
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::ERROR);

    let res = mode.compare_exchange(
        ConcurrentModeValue::ERROR,
        ConcurrentModeValue::STANDBY,
        Ordering::SeqCst,
        Ordering::Relaxed,
    );
    assert!(res.is_ok());
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::STANDBY);

    let bad_res = mode.compare_exchange(
        ConcurrentModeValue::ERROR,
        ConcurrentModeValue::ACTIVE,
        Ordering::SeqCst,
        Ordering::Relaxed,
    );
    assert!(bad_res.is_err());

    let fetch_res = mode.update_or_abort(Ordering::SeqCst, Ordering::Relaxed, |v| {
        if v == ConcurrentModeValue::STANDBY {
            Some(ConcurrentModeValue::ACTIVE)
        } else {
            None
        }
    });
    assert!(fetch_res.is_ok());
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::ACTIVE);

    mode.update(Ordering::SeqCst, Ordering::Relaxed, |v| {
        assert_eq!(v, ConcurrentModeValue::ACTIVE);
        ConcurrentModeValue::STANDBY
    });
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::STANDBY);

    let mut current = mode.load(Ordering::SeqCst);
    loop {
        match mode.compare_exchange_weak(
            current,
            ConcurrentModeValue::ERROR,
            Ordering::SeqCst,
            Ordering::Relaxed,
        ) {
            Ok(_) => break,
            Err(actual) => current = actual,
        }
    }
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentModeValue::ERROR);

    assert_eq!(ConcurrentMode::BITS, 2);

    let def_mode = ConcurrentMode::default();
    assert_eq!(
        def_mode.load(Ordering::SeqCst),
        ConcurrentModeValue::STANDBY
    );

    let debug_str = format!("{:?}", mode);
    assert!(debug_str.contains("ConcurrentMode(ConcurrentModeValue(2)::ERROR)"));
}

atomic_bitstruct! {
    pub struct ConcurrentTest128(AtomicU128) {
        pub flag: bool = 1,
        pub value: u64 = 64,
        pub status: State = 2,
        pub extra: u32 = 32,
    }
}

#[test]
fn test_atomic_u128_bitstruct() {
    let f = ConcurrentTest128::new(0);
    f.set_flag(true, Ordering::SeqCst);
    f.set_value(0xDEADBEEFCAFEBABE, Ordering::SeqCst);
    f.set_status(State::C, Ordering::SeqCst);
    f.set_extra(0x12345678, Ordering::SeqCst);

    assert_eq!(f.flag(Ordering::SeqCst), true);
    assert_eq!(f.value(Ordering::SeqCst), 0xDEADBEEFCAFEBABE);
    assert_eq!(f.status(Ordering::SeqCst), State::C);
    assert_eq!(f.extra(Ordering::SeqCst), 0x12345678);

    f.update(Ordering::SeqCst, Ordering::Relaxed, |v| {
        v.set_value(0x1122334455667788);
    });
    assert_eq!(f.value(Ordering::SeqCst), 0x1122334455667788);
}

atomic_bitstruct! {
    pub struct SignedConcurrentTest128(AtomicI128) {
        pub flag: bool = 1,
        pub value: i64 = 64,
        pub extra: i32 = 32,
    }
}

#[test]
fn test_atomic_i128_bitstruct() {
    let f = SignedConcurrentTest128::new(0);
    f.set_value(-1234567890123456789, Ordering::SeqCst);
    f.set_extra(-999999, Ordering::SeqCst);

    assert_eq!(f.value(Ordering::SeqCst), -1234567890123456789);
    assert_eq!(f.extra(Ordering::SeqCst), -999999);

    f.update(Ordering::SeqCst, Ordering::Relaxed, |v| {
        let current = v.value();
        v.set_value(current + 1);
    });
    assert_eq!(f.value(Ordering::SeqCst), -1234567890123456788);
}

atomic_bitenum! {
    pub enum ConcurrentMode128(AtomicU128, 128) {
        MIN = 0,
        MAX = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF,
    }
}

#[test]
fn test_atomic_u128_bitenum() {
    let mode = ConcurrentMode128::new(ConcurrentMode128Value::MIN);
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentMode128Value::MIN);

    mode.store(ConcurrentMode128Value::MAX, Ordering::SeqCst);
    assert_eq!(mode.load(Ordering::SeqCst), ConcurrentMode128Value::MAX);
}

atomic_bitarray! {
    pub struct AtomicNibbles(u 4, 8); // 32 bits total
}

#[test]
fn test_atomic_bitarray() {
    let a = AtomicNibbles::new(0);
    assert_eq!(a.get(0, Ordering::Relaxed), 0);

    a.set(0, 15, Ordering::SeqCst);
    a.set(7, 9, Ordering::SeqCst);

    assert_eq!(a.get(0, Ordering::SeqCst), 15);
    assert_eq!(a.get(7, Ordering::SeqCst), 9);
    assert_eq!(a.get(3, Ordering::SeqCst), 0);

    // Test update CAS loop
    a.update(Ordering::SeqCst, Ordering::Relaxed, |snap| {
        let val = snap.get(0);
        snap.set(0, val - 1);
        snap.set(1, 5);
    });

    assert_eq!(a.get(0, Ordering::SeqCst), 14);
    assert_eq!(a.get(1, Ordering::SeqCst), 5);
    assert_eq!(a.get(7, Ordering::SeqCst), 9);
}

atomic_bitarray! {
    pub struct AtomicFlags128(bool, 128);
}

#[test]
fn test_atomic_bitarray_128() {
    let f = AtomicFlags128::new(0);
    f.set(0, true, Ordering::SeqCst);
    f.set(127, true, Ordering::SeqCst);

    assert_eq!(f.get(0, Ordering::SeqCst), true);
    assert_eq!(f.get(127, Ordering::SeqCst), true);
    assert_eq!(f.get(64, Ordering::SeqCst), false);

    let snap = f.get_snapshot(Ordering::SeqCst);
    assert_eq!(snap.get(0), true);
    assert_eq!(snap.get(127), true);
}

atomic_bitarray! {
    pub struct AtomicSigned(i 4, 8); // 32 bits
}

#[test]
fn test_atomic_bitarray_signed() {
    let a = AtomicSigned::new(0);
    a.set(0, -1, Ordering::SeqCst);
    a.set(1, 7, Ordering::SeqCst);
    a.set(2, -8, Ordering::SeqCst);

    assert_eq!(a.get(0, Ordering::SeqCst), -1);
    assert_eq!(a.get(1, Ordering::SeqCst), 7);
    assert_eq!(a.get(2, Ordering::SeqCst), -8);
}

#[test]
fn test_atomic_bitarray_update_abort() {
    let a = AtomicNibbles::new(10);

    // Abort if value is even
    let res = a.update_or_abort(Ordering::SeqCst, Ordering::SeqCst, |snap| {
        let val = snap.get(0);
        if val % 2 == 0 {
            None // Abort
        } else {
            snap.set(0, val + 1);
            Some(())
        }
    });

    assert!(res.is_err());
    assert_eq!(a.get(0, Ordering::SeqCst), 10);

    // Succeed if value is 10
    let res = a.update_or_abort(Ordering::SeqCst, Ordering::SeqCst, |snap| {
        let val = snap.get(0);
        if val == 10 {
            snap.set(0, 11);
            Some(())
        } else {
            None
        }
    });

    assert!(res.is_ok());
    assert_eq!(a.get(0, Ordering::SeqCst), 11);
}

#[test]
fn test_atomic_bitarray_debug() {
    let a = AtomicNibbles::new(0);
    a.set(0, 1, Ordering::Relaxed);
    a.set(1, 2, Ordering::Relaxed);
    let debug_str = format!("{:?}", a);
    // Should look like a list of values
    assert!(debug_str.contains("1, 2, 0, 0"));
}

#[test]
fn test_atomic_bitarray_alignment_padding() {
    atomic_bitarray! {
        struct OddPadding(u 3, 5); // 15 bits total, fits in AtomicU16 (16 bits)
    }
    let a = OddPadding::new(0);
    a.set(4, 7, Ordering::SeqCst);
    assert_eq!(a.get(4, Ordering::SeqCst), 7);
    assert_eq!(a.load(Ordering::Relaxed), 7 << (4 * 3));
}

atomic_bitarray! {
    struct AtomicSigned1(i 1, 8);
}

#[test]
fn test_atomic_signed_1bit() {
    let a = AtomicSigned1::new(0);
    a.set(0, -1, Ordering::SeqCst);
    a.set(1, 0, Ordering::SeqCst);
    assert_eq!(a.get(0, Ordering::SeqCst), -1);
    assert_eq!(a.get(1, Ordering::SeqCst), 0);
}

atomic_bitarray! {
    struct AtomicU128Single(u 128, 1);
}

#[test]
fn test_atomic_u128_single() {
    let a = AtomicU128Single::new(0);
    let val = 0x12345678_90ABCDEF_12345678_90ABCDEF_u128;
    a.set(0, val, Ordering::SeqCst);
    assert_eq!(a.get(0, Ordering::SeqCst), val);
}

atomic_bitarray! {
    struct LargeArray(u 8, 16); // 128 bits
}

#[test]
fn test_large_array_snapshot_roundtrip() {
    let a = LargeArray::new(0);
    for i in 0..16 {
        a.set(i, (i as u128) + 10, Ordering::Relaxed);
    }

    let snap = a.get_snapshot(Ordering::SeqCst);
    for i in 0..16 {
        assert_eq!(snap.get(i), (i as u128) + 10);
    }

    let mut snap2 = snap;
    snap2.set(0, 255);
    a.set_snapshot(snap2, Ordering::SeqCst);
    assert_eq!(a.get(0, Ordering::Relaxed), 255);
    assert_eq!(a.get(1, Ordering::Relaxed), 11);
}