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
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
// SPDX-License-Identifier: MIT OR Apache-2.0
/*!
A non-blocking synchronization primitive for one-time initialization.
`OnceNonLock<T>` provides a thread-safe way to initialize a value exactly once, similar to
`std::sync::OnceLock`, but with a crucial difference: it never blocks waiting threads.
Instead of blocking when initialization is in progress, `OnceNonLock` returns `None`,
allowing the calling thread to continue with other work.
# Key Differences from `std::sync::OnceLock`
- **Non-blocking**: When one thread is initializing the value, other threads receive `None`
instead of blocking and waiting.
- **Try-semantics**: All initialization methods follow try-semantics, returning `None` when
the value is unavailable rather than blocking.
- **Async support**: Provides `init_async` for asynchronous initialization scenarios.
# When to Use
Use `OnceNonLock` when:
- You need lazy initialization but cannot afford to block threads
- Multiple threads might attempt initialization, but only one should succeed
- You want to avoid thread contention and potential deadlocks
- The calling code can handle the value not being immediately available
Prefer `std::sync::OnceLock` when:
- You need guaranteed access to the value after initialization
- Blocking behavior is acceptable or desired
- You need the full `get_or_init` semantics where the value is always returned
# Internal States
The implementation uses three atomic states to coordinate initialization:
- `INITIAL` (0): The value has not been initialized yet
- `IN_PROGRESS` (1): A thread is currently initializing the value
- `DONE` (2): The value has been successfully initialized
# Thread Safety
`OnceNonLock` is thread-safe and can be safely shared between threads:
- Multiple threads can call `try_get_or_init` concurrently
- Only one thread will successfully initialize the value
- Once initialized, all threads can safely read the value
- The implementation uses atomic operations and proper memory ordering
# Examples
## Basic Usage
```
use std::sync::Arc;
use std::thread;
# mod once_nonlock {
# use std::cell::UnsafeCell;
# use std::mem::ManuallyDrop;
# use std::sync::Arc;
# use std::sync::atomic::{AtomicU8, Ordering};
#
# const ONCE_INITIAL: u8 = 0;
# const ONCE_IN_PROGRESS: u8 = 1;
# const ONCE_DONE: u8 = 2;
#
# pub struct OnceNonLock<T> {
# once: AtomicU8,
# value: UnsafeCell<ManuallyDrop<Option<T>>>,
# _marker: std::marker::PhantomData<T>,
# }
#
# impl<T> OnceNonLock<T> {
# pub const fn new() -> Self {
# OnceNonLock {
# once: AtomicU8::new(ONCE_INITIAL),
# value: UnsafeCell::new(ManuallyDrop::new(None)),
# _marker: std::marker::PhantomData,
# }
# }
#
# pub fn try_get_or_init<F>(&self, f: F) -> Option<&T>
# where
# F: FnOnce() -> Option<T>,
# {
# match self.once.compare_exchange(ONCE_INITIAL, ONCE_IN_PROGRESS, Ordering::AcqRel, Ordering::Relaxed) {
# Ok(_) => {
# let value = f();
# unsafe {
# if let Some(value) = value {
# *self.value.get() = ManuallyDrop::new(Some(value));
# self.once.store(ONCE_DONE, Ordering::Release);
# } else {
# self.once.store(ONCE_INITIAL, Ordering::Release);
# }
# }
# unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# }
# }
# Err(ONCE_IN_PROGRESS) => None,
# Err(ONCE_DONE) => unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# },
# Err(_) => panic!("Invalid state"),
# }
# }
#
# pub fn get(&self) -> Option<&T> {
# match self.once.load(Ordering::Acquire) {
# ONCE_INITIAL => None,
# ONCE_IN_PROGRESS => None,
# ONCE_DONE => unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# },
# _ => panic!("Invalid state"),
# }
# }
# }
#
# unsafe impl<T: Send> Send for OnceNonLock<T> {}
# unsafe impl<T: Sync> Sync for OnceNonLock<T> {}
#
# impl<T> Drop for OnceNonLock<T> {
# fn drop(&mut self) {
# match self.once.load(Ordering::Relaxed) {
# ONCE_INITIAL => {},
# ONCE_IN_PROGRESS => panic!("Dropping while in progress"),
# ONCE_DONE => unsafe {
# ManuallyDrop::drop(&mut *self.value.get());
# },
# _ => panic!("Invalid state"),
# }
# }
# }
# }
# use once_nonlock::OnceNonLock;
static CONFIG: OnceNonLock<String> = OnceNonLock::new();
// First thread to call wins the race to initialize
let value = CONFIG.try_get_or_init(|| {
Some("initialized".to_string())
});
// Subsequent calls return the initialized value
assert_eq!(CONFIG.get().map(|s| s.as_str()), Some("initialized"));
```
## Non-blocking Behavior
```
use std::sync::Arc;
use std::thread;
use std::time::Duration;
# mod once_nonlock {
# use std::cell::UnsafeCell;
# use std::mem::ManuallyDrop;
# use std::sync::Arc;
# use std::sync::atomic::{AtomicU8, Ordering};
#
# const ONCE_INITIAL: u8 = 0;
# const ONCE_IN_PROGRESS: u8 = 1;
# const ONCE_DONE: u8 = 2;
#
# pub struct OnceNonLock<T> {
# once: AtomicU8,
# value: UnsafeCell<ManuallyDrop<Option<T>>>,
# _marker: std::marker::PhantomData<T>,
# }
#
# impl<T> OnceNonLock<T> {
# pub const fn new() -> Self {
# OnceNonLock {
# once: AtomicU8::new(ONCE_INITIAL),
# value: UnsafeCell::new(ManuallyDrop::new(None)),
# _marker: std::marker::PhantomData,
# }
# }
#
# pub fn try_get_or_init<F>(&self, f: F) -> Option<&T>
# where
# F: FnOnce() -> Option<T>,
# {
# match self.once.compare_exchange(ONCE_INITIAL, ONCE_IN_PROGRESS, Ordering::AcqRel, Ordering::Relaxed) {
# Ok(_) => {
# let value = f();
# unsafe {
# if let Some(value) = value {
# *self.value.get() = ManuallyDrop::new(Some(value));
# self.once.store(ONCE_DONE, Ordering::Release);
# } else {
# self.once.store(ONCE_INITIAL, Ordering::Release);
# }
# }
# unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# }
# }
# Err(ONCE_IN_PROGRESS) => None,
# Err(ONCE_DONE) => unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# },
# Err(_) => panic!("Invalid state"),
# }
# }
#
# pub fn get(&self) -> Option<&T> {
# match self.once.load(Ordering::Acquire) {
# ONCE_INITIAL => None,
# ONCE_IN_PROGRESS => None,
# ONCE_DONE => unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# },
# _ => panic!("Invalid state"),
# }
# }
# }
#
# unsafe impl<T: Send> Send for OnceNonLock<T> {}
# unsafe impl<T: Sync> Sync for OnceNonLock<T> {}
#
# impl<T> Drop for OnceNonLock<T> {
# fn drop(&mut self) {
# match self.once.load(Ordering::Relaxed) {
# ONCE_INITIAL => {},
# ONCE_IN_PROGRESS => panic!("Dropping while in progress"),
# ONCE_DONE => unsafe {
# ManuallyDrop::drop(&mut *self.value.get());
# },
# _ => panic!("Invalid state"),
# }
# }
# }
# }
# use once_nonlock::OnceNonLock;
let once = Arc::new(OnceNonLock::new());
let once_clone = once.clone();
// Simulate slow initialization in one thread
let handle1 = thread::spawn(move || {
let _result = once_clone.try_get_or_init(|| {
thread::sleep(Duration::from_millis(100));
Some("slow init".to_string())
});
});
// Another thread won't block - it gets None immediately
thread::sleep(Duration::from_millis(10)); // Let first thread start
let result = once.try_get_or_init(|| Some("fast init".to_string()));
// This returns None because initialization is in progress
assert_eq!(result, None);
handle1.join().unwrap();
// Now the value is available
assert_eq!(once.get().map(|s| s.as_str()), Some("slow init"));
```
## Failed Initialization Recovery
```
# mod once_nonlock {
# use std::cell::UnsafeCell;
# use std::mem::ManuallyDrop;
# use std::sync::Arc;
# use std::sync::atomic::{AtomicU8, Ordering};
#
# const ONCE_INITIAL: u8 = 0;
# const ONCE_IN_PROGRESS: u8 = 1;
# const ONCE_DONE: u8 = 2;
#
# pub struct OnceNonLock<T> {
# once: AtomicU8,
# value: UnsafeCell<ManuallyDrop<Option<T>>>,
# _marker: std::marker::PhantomData<T>,
# }
#
# impl<T> OnceNonLock<T> {
# pub const fn new() -> Self {
# OnceNonLock {
# once: AtomicU8::new(ONCE_INITIAL),
# value: UnsafeCell::new(ManuallyDrop::new(None)),
# _marker: std::marker::PhantomData,
# }
# }
#
# pub fn try_get_or_init<F>(&self, f: F) -> Option<&T>
# where
# F: FnOnce() -> Option<T>,
# {
# match self.once.compare_exchange(ONCE_INITIAL, ONCE_IN_PROGRESS, Ordering::AcqRel, Ordering::Relaxed) {
# Ok(_) => {
# let value = f();
# unsafe {
# if let Some(value) = value {
# *self.value.get() = ManuallyDrop::new(Some(value));
# self.once.store(ONCE_DONE, Ordering::Release);
# } else {
# self.once.store(ONCE_INITIAL, Ordering::Release);
# }
# }
# unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# }
# }
# Err(ONCE_IN_PROGRESS) => None,
# Err(ONCE_DONE) => unsafe {
# let f = self.value.get();
# let value = &*f;
# value.as_ref()
# },
# Err(_) => panic!("Invalid state"),
# }
# }
# }
#
# unsafe impl<T: Send> Send for OnceNonLock<T> {}
# unsafe impl<T: Sync> Sync for OnceNonLock<T> {}
# }
# use once_nonlock::OnceNonLock;
let once = OnceNonLock::new();
let mut attempt = 0;
// First attempt fails
let result = once.try_get_or_init(|| {
attempt += 1;
None // Initialization fails
});
assert_eq!(result, None);
// State returns to INITIAL, allowing retry
let result = once.try_get_or_init(|| {
attempt += 1;
Some(42) // Successful initialization
});
assert_eq!(result, Some(&42));
assert_eq!(attempt, 2);
```
*/
use UnsafeCell;
use ManuallyDrop;
use ;
const ONCE_INITIAL: u8 = 0;
const ONCE_IN_PROGRESS: u8 = 1;
const ONCE_DONE: u8 = 2;
/// A non-blocking, thread-safe cell that can be written to only once.
///
/// Unlike `std::sync::OnceLock`, `OnceNonLock` never blocks threads. When initialization
/// is in progress by another thread, methods return `None` instead of waiting. This allows
/// threads to continue with other work rather than blocking on initialization.
///
/// # Type Parameters
///
/// - `T`: The type of value stored in the cell. Must be `Send` to share between threads
/// and `Sync` for concurrent access.
///
/// # Memory Management
///
/// The implementation uses `ManuallyDrop` to ensure proper cleanup of the stored value
/// during drop, preventing double-free issues while maintaining safe memory management.
// SAFETY: OnceNonLock can be sent between threads if T can be sent.
// The atomic state management ensures proper synchronization when the value
// is transferred between threads.
unsafe
// SAFETY: OnceNonLock can be shared between threads if T can be shared.
// The atomic operations and UnsafeCell usage ensure that:
// - Only one thread can initialize the value (via compare_exchange)
// - Once initialized, the value is immutable and can be safely shared
// - Memory ordering (Acquire/Release) ensures proper visibility across threads
unsafe