-
Notifications
You must be signed in to change notification settings - Fork 13.9k
Windows TLS: ManuallyDrop instead of mem::forget #79893
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,4 @@ | ||
| use crate::mem; | ||
| use crate::mem::ManuallyDrop; | ||
| use crate::ptr; | ||
| use crate::sync::atomic::AtomicPtr; | ||
| use crate::sync::atomic::Ordering::SeqCst; | ||
|
|
@@ -111,16 +111,13 @@ struct Node { | |
| } | ||
|
|
||
| unsafe fn register_dtor(key: Key, dtor: Dtor) { | ||
| let mut node = Box::new(Node { key, dtor, next: ptr::null_mut() }); | ||
| let mut node = ManuallyDrop::new(Box::new(Node { key, dtor, next: ptr::null_mut() })); | ||
|
|
||
| let mut head = DTORS.load(SeqCst); | ||
| loop { | ||
| node.next = head; | ||
| match DTORS.compare_exchange(head, &mut *node, SeqCst, SeqCst) { | ||
| Ok(_) => { | ||
| mem::forget(node); | ||
| return; | ||
| } | ||
| match DTORS.compare_exchange(head, &mut **node, SeqCst, SeqCst) { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This isn't really related, but shouldn't we use There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Possible; I don't really have a clear idea for what should be used when. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Fine, I'll do it when this PR is merged. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. @a1phyr Did this end up happening? |
||
| Ok(_) => return, // nothing to drop, we successfully added the node to the list | ||
| Err(cur) => head = cur, | ||
| } | ||
| } | ||
|
|
||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Since we never drop this anyway, couldn't we also just
Box::into_rawhere and thencompare_exchangeing the raw pointer directly? I guess that would meannode.next = headneeds to be(*node).next = headand is now unsafe, so maybe the ManuallyDrop is better, but I am somewhat unhappy with the&mut **node(the previous&mut *nodewas not better imo). I know we can rely on the deref ops on boxes, but it still seems wrong to me to not be usingBox::into_rawwhen this is technically what we want.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I went with
into_rawfirst and decided to useManuallyDropwhen I realized this.