Skip to content

Feature/1279 #764

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.

Sign up for GitHub

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

Merged
wskozlowski merged 2 commits into from
May 22, 2026
Merged

Feature/1279 #764

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ce4d04f
unreferencing immutable / embedded instances
May 22, 2026
b60ba5d
tagging and untagging of embedded / immutable and nested instances
May 22, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions design/IMMUTABLE_OBJECTS_DESIGN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -111,6 +111,7 @@ Implementation requirements:
- The embedded member is identified by its own address, but that address is inside the allocation and is not the allocation start.
- The allocator must be able to recover allocation metadata from an inner address. This allows embedded object addresses to use the same 50-bit representation as regular object addresses.
- A parent object can still be referenced by the parent allocation address.
- Strong references to embedded objects increment the root allocation's reference count, and deleting the holding object must decrement that same root reference by resolving the embedded address back to its allocation base.
- Root immutable objects store an exact compact index of valid nested embedded-object offsets. Lookup by offset must validate against this index and raise a bad-address error for invalid, out-of-range, or non-object offsets.
- The offset index uses packed integer encoding grouped by packed size class so offsets remain compact while supporting logarithmic exact membership checks. Most offsets are expected to fit in 3-4 packed bytes, but the representation must support larger offsets.

Expand Down
Loading
Loading