Skip to content

Restore IntrusiveHashMap insert code from tscore (ats92) #10992

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
traeak merged 1 commit into from
Jan 24, 2024
Merged

Restore IntrusiveHashMap insert code from tscore (ats92) #10992

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
9 changes: 0 additions & 9 deletions lib/swoc/include/swoc/IntrusiveHashMap.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -514,15 +514,6 @@ IntrusiveHashMap<H>::insert(value_type *v) {
if (spot != bucket->_v) {
mixed_p = true; // found some other key, it's going to be mixed.
}
if (spot != limit) {
// If an equal key was found, walk past those to insert at the upper end of the range.
do {
spot = H::next_ptr(spot);
} while (spot != limit && H::equal(key, H::key_of(spot)));
if (spot != limit) { // something not equal past last equivalent, it's going to be mixed.
mixed_p = true;
}
}

_list.insert_before(spot, v);
if (spot == bucket->_v) { // added before the bucket start, update the start.
Expand Down