You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@trafficserver.apache.org by bn...@apache.org on 2024/03/19 18:26:11 UTC
(trafficserver-libswoc) 02/06: restore IntrusiveHashMap insert code to tscore (#10992)
This is an automated email from the ASF dual-hosted git repository.
bneradt pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/trafficserver-libswoc.git
commit 208af5fc6c67cd1648db4e4cf3a3cf9284482976
Author: Brian Neradt <br...@gmail.com>
AuthorDate: Tue Mar 19 17:55:02 2024 +0000
restore IntrusiveHashMap insert code to tscore (#10992)
(cherry picked from commit dc8d761352ef6aecb106d4b160d2583a5591d36e)
---
code/include/swoc/IntrusiveHashMap.h | 9 ---------
1 file changed, 9 deletions(-)
diff --git a/code/include/swoc/IntrusiveHashMap.h b/code/include/swoc/IntrusiveHashMap.h
index 4bbe3b6..201f093 100644
--- a/code/include/swoc/IntrusiveHashMap.h
+++ b/code/include/swoc/IntrusiveHashMap.h
@@ -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.