Skip to content

TB: Track permissions on the byte-level #4314

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

Open
wants to merge 12 commits into
base: master
Choose a base branch
from

Conversation

yoctocell
Copy link

This makes the tracking of permissions on the byte-level, like in Stacked Borrows, which makes the tracking of interior mutable data more fine-grained.

cc @RalfJung @JoJoDeveloping

@JoJoDeveloping
Copy link
Contributor

So, how does adding a new node work (and why do we need to call visit_freeze_sensitive three times:

  • First, you do a read access at the parent node
  • Then, you add the new node. Note that adding a new node is a per-block operation, not per-access
  • Then you set the correct permissions for the new node
  • Then you reset the SIFA thingy (also per-block)
  • Then you call into the data race model

For Stacked Borrows, there are no per-block operations: each stack at each offset its own stack and completely independent from the other ones at different offsets in the same allocation. So there, more (basically everything) can be moved into the per-offset function.

So what do we do for Tree Borrows? One answer is to combine parent reading, permission setting and data race notifying together. This would be somewhat ugly, because you're constructing a node, while also accessing the tree, and this would only be fine because you're careful to not actually add the node into the children array of its parent so that it's not visited when walking the tree.

Should we do this?

@RalfJung
Copy link
Member

Ignoring the SIFA thingy since I already forgot how it works, what I think would make sense is to do a single visit_freeze_sensitive where you

  • do the parent access
  • do the data race access
  • prepare a RangeMap<LocationState> of per-location initial states that will later be passed to Tree::new_child

Does that makes sense or is it too ugly as well?

@JoJoDeveloping
Copy link
Contributor

JoJoDeveloping commented May 12, 2025

That would work. It has to construct an extra RangeMap but presumably this is cheaper than calling visit_freeze_sensitive thrice.
And it requires moving some logic for retags around quite a bit.

@RalfJung
Copy link
Member

presumably this is cheaper than calling visit_freeze_sensitive thrice.

I'm not sure, but that's at least plausible. I also prefer it conceptually.

Xinglu Chen added 3 commits May 13, 2025 17:17
Previously, the assert would cause an error if the `RangeMap` was
empty.
Copy link
Member

@RalfJung RalfJung left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks! This is a lot better.

I don't fully understand the logic around the new perms_map though. It seems like the map is created to cover all the bytes from the beginning of the allocation to the end of the retagged place, which is odd -- it should be either the entire allocation, or just the place. And given that we do not want to actually put anything into the perms map outside the place, I think it should be just the place.

let mut tree_borrows = alloc_extra.borrow_tracker_tb().borrow_mut();
let prot = new_perm.protector.is_some();

// Store initialized permissions and their corresponding range.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
// Store initialized permissions and their corresponding range.
// Store initial permissions and their corresponding range.

Comment on lines +329 to +330
let NewPermission { freeze_perm, freeze_access, nonfreeze_perm, nonfreeze_access, .. } =
new_perm;
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Why do you destruct the NewPermission like this here? Seems a bit more clear to say new_perm.<field> everywhere below.

@@ -31,7 +33,7 @@ mod tests;

/// Data for a single *location*.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub(super) struct LocationState {
pub(crate) struct LocationState {
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Why does the entire crate now need access to this?

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Because the compiler would complain about the visibility of
LocationState being private than new_child. But seems like super
should be enough for new_child, so I will change both of the to super.

@@ -0,0 +1,32 @@
//@compile-flags: -Zmiri-tree-borrows
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
//@compile-flags: -Zmiri-tree-borrows
//! A version of `cell_inside_struct` that dumps the tree so that we can see what is happening.
//@compile-flags: -Zmiri-tree-borrows

for (_perms_range, perms) in
self.rperms.iter_mut(Size::from_bytes(start), Size::from_bytes(end - start))
{
perms.insert(idx, perm);
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

So this will insert a bunch of Disabled, won't it?

Comment on lines +321 to +327
let mut perms_map: RangeMap<LocationState> = RangeMap::new(
base_offset + ptr_size,
LocationState::new_uninit(
Permission::new_disabled(),
foreign_access_skipping::IdempotentForeignAccess::None,
),
);
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think this should be initialized with size ptr_size, and only cover the place we are retagging. That way we can avoid introducing some disabled states here that I don't think we actually want.

let idx = self.tag_mapping.insert(new_tag);
let parent_idx = self.tag_mapping.get(&parent_tag).unwrap();
let default_initial_perm = perm.freeze_perm;
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't think this is obviously the right choice. There's an interesting decision to be made here: if I have an &Cell<i32>, should I be allowed to lazily write to surrounding memory? The general consensus, I think, is that the answer is "yes" -- the permission of an &T should default to frozen only if T: Freeze, and should default to non-frozen otherwise.

This should also be covered by a test.

Copy link
Author

@yoctocell yoctocell May 20, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What do you mean with "lazily write to surrounding memory"? Do you have an example in mind?

Copy link
Member

@RalfJung RalfJung May 20, 2025

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

fn foo(x: &Cell<i32>) {
  let ptr = x as *const Cell<i32> as *mut _  as *mut i32;
  ptr.offset(1).write(0);
}

let arr = [Cell::new(1), Cell::new(1)];
foo(&arr[0]);

This code should be accepted without UB.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants