diff options
Diffstat (limited to 'src/libstd/sync')
| -rw-r--r-- | src/libstd/sync/deque.rs | 2 | ||||
| -rw-r--r-- | src/libstd/sync/spsc_queue.rs | 4 |
2 files changed, 3 insertions, 3 deletions
diff --git a/src/libstd/sync/deque.rs b/src/libstd/sync/deque.rs index e740862fddf..b65feedb2ae 100644 --- a/src/libstd/sync/deque.rs +++ b/src/libstd/sync/deque.rs @@ -45,7 +45,7 @@ // NB: the "buffer pool" strategy is not done for speed, but rather for // correctness. For more info, see the comment on `swap_buffer` -// XXX: all atomic operations in this module use a SeqCst ordering. That is +// FIXME: all atomic operations in this module use a SeqCst ordering. That is // probably overkill use cast; diff --git a/src/libstd/sync/spsc_queue.rs b/src/libstd/sync/spsc_queue.rs index 6f1b887c271..b4b327cc9d1 100644 --- a/src/libstd/sync/spsc_queue.rs +++ b/src/libstd/sync/spsc_queue.rs @@ -43,7 +43,7 @@ use sync::atomics::{AtomicPtr, Relaxed, AtomicUint, Acquire, Release}; // Node within the linked list queue of messages to send struct Node<T> { - // XXX: this could be an uninitialized T if we're careful enough, and + // FIXME: this could be an uninitialized T if we're careful enough, and // that would reduce memory usage (and be a bit faster). // is it worth it? value: Option<T>, // nullable for re-use of nodes @@ -225,7 +225,7 @@ impl<T: Send, P: Send> State<T, P> { if self.cache_bound == 0 { self.tail_prev.store(tail, Release); } else { - // XXX: this is dubious with overflow. + // FIXME: this is dubious with overflow. let additions = self.cache_additions.load(Relaxed); let subtractions = self.cache_subtractions.load(Relaxed); let size = additions - subtractions; |