-
Notifications
You must be signed in to change notification settings - Fork 13
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
Add SIGINT handling to Ares #105
Changes from all commits
7676823
fc3df95
e5e0fad
95083f7
0072e09
ae674c1
5c436a8
2d1296c
19cdaaa
65bd2f1
6d414e9
d9bd4d7
df67782
2ad506d
6bbd114
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -104,7 +104,7 @@ impl<T: Copy> MutHamt<T> { | |
mug >>= 5; | ||
match (*stem).entry(chunk) { | ||
None => { | ||
let new_leaf_buffer = stack.struct_alloc(1); | ||
let new_leaf_buffer = stack.struct_alloc::<(Noun, T)>(1); | ||
*new_leaf_buffer = (*n, t); | ||
(*stem).bitmap |= chunk_to_bit(chunk); | ||
(*stem).typemap &= !chunk_to_bit(chunk); | ||
|
@@ -480,7 +480,7 @@ impl<T: Copy + Preserve> Preserve for Hamt<T> { | |
}; | ||
*(stem.buffer.add(idx) as *mut Entry<T>) = Entry { stem: new_stem }; | ||
assert!(traversal_depth <= 5); // will increment | ||
traversal_stack[traversal_depth - 1].unwrap().1 = position + 1; | ||
traversal_stack[traversal_depth - 1] = Some((stem, position + 1)); | ||
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. Marker for synchronous review: question about this change. 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 is fixing a logical error that was not causing a bug due to safety logic up above (we discovered it together during the very first pairing session for the memory seniority bug): The |
||
traversal_stack[traversal_depth] = Some((new_stem, 0)); | ||
traversal_depth += 1; | ||
continue 'preserve; | ||
|
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.
was this reordering done by some automated tool? Or just manually alphabetized?
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.
This was manual (because of the 'tism).