@@ -923,17 +923,16 @@ impl<T> Clone for UnboundedSenderInner<T> {
923923 debug_assert ! ( curr < MAX_BUFFER ) ;
924924
925925 let next = curr + 1 ;
926- let actual = self . inner . num_senders . compare_and_swap ( curr, next, SeqCst ) ;
927-
928- // The ABA problem doesn't matter here. We only care that the
929- // number of senders never exceeds the maximum.
930- if actual == curr {
931- return Self {
932- inner : self . inner . clone ( ) ,
933- } ;
926+ match self . inner . num_senders . compare_exchange ( curr, next, SeqCst , SeqCst ) {
927+ Ok ( _) => {
928+ // The ABA problem doesn't matter here. We only care that the
929+ // number of senders never exceeds the maximum.
930+ return Self {
931+ inner : self . inner . clone ( ) ,
932+ } ;
933+ }
934+ Err ( actual) => curr = actual,
934935 }
935-
936- curr = actual;
937936 }
938937 }
939938}
@@ -954,19 +953,18 @@ impl<T> Clone for BoundedSenderInner<T> {
954953 debug_assert ! ( curr < self . inner. max_senders( ) ) ;
955954
956955 let next = curr + 1 ;
957- let actual = self . inner . num_senders . compare_and_swap ( curr, next, SeqCst ) ;
958-
959- // The ABA problem doesn't matter here. We only care that the
960- // number of senders never exceeds the maximum.
961- if actual == curr {
962- return Self {
963- inner : self . inner . clone ( ) ,
964- sender_task : Arc :: new ( Mutex :: new ( SenderTask :: new ( ) ) ) ,
965- maybe_parked : false ,
966- } ;
956+ match self . inner . num_senders . compare_exchange ( curr, next, SeqCst , SeqCst ) {
957+ Ok ( _) => {
958+ // The ABA problem doesn't matter here. We only care that the
959+ // number of senders never exceeds the maximum.
960+ return Self {
961+ inner : self . inner . clone ( ) ,
962+ sender_task : Arc :: new ( Mutex :: new ( SenderTask :: new ( ) ) ) ,
963+ maybe_parked : false ,
964+ } ;
965+ }
966+ Err ( actual) => curr = actual,
967967 }
968-
969- curr = actual;
970968 }
971969 }
972970}
0 commit comments