summaryrefslogtreecommitdiff
path: root/node/Multicaster.cpp
diff options
context:
space:
mode:
authorMoritz Warning <moritzwarning@web.de>2015-06-19 00:24:17 +0200
committerMoritz Warning <moritzwarning@web.de>2015-06-19 00:28:51 +0200
commit0073d0f694f925d925db96d25e2a504abda99722 (patch)
tree05dd5eedd9653656d6ceb2942027dd151a377544 /node/Multicaster.cpp
parentbd7e4ab6955f838c3119fe1262901875345d8d43 (diff)
downloadinfinitytier-0073d0f694f925d925db96d25e2a504abda99722.tar.gz
infinitytier-0073d0f694f925d925db96d25e2a504abda99722.zip
replace txQueue list by vector for faster memory access and less allocations
Diffstat (limited to 'node/Multicaster.cpp')
-rw-r--r--node/Multicaster.cpp20
1 files changed, 12 insertions, 8 deletions
diff --git a/node/Multicaster.cpp b/node/Multicaster.cpp
index 7da2b14c..40be2441 100644
--- a/node/Multicaster.cpp
+++ b/node/Multicaster.cpp
@@ -320,10 +320,12 @@ void Multicaster::clean(uint64_t now)
{
Mutex::Lock _l(_groups_m);
for(std::map< std::pair<uint64_t,MulticastGroup>,MulticastGroupStatus >::iterator mm(_groups.begin());mm!=_groups.end();) {
- for(std::list<OutboundMulticast>::iterator tx(mm->second.txQueue.begin());tx!=mm->second.txQueue.end();) {
- if ((tx->expired(now))||(tx->atLimit()))
- mm->second.txQueue.erase(tx++);
- else ++tx;
+ for(std::vector<OutboundMulticast>::iterator tx(mm->second.txQueue.begin());tx!=mm->second.txQueue.end();) {
+ if ((tx->expired(now))||(tx->atLimit())) {
+ // erase element (replace by last)
+ *tx = mm->second.txQueue.back();
+ mm->second.txQueue.pop_back();
+ } else ++tx;
}
unsigned long count = 0;
@@ -371,14 +373,16 @@ void Multicaster::_add(uint64_t now,uint64_t nwid,const MulticastGroup &mg,Multi
//TRACE("..MC %s joined multicast group %.16llx/%s via %s",member.toString().c_str(),nwid,mg.toString().c_str(),((learnedFrom) ? learnedFrom.toString().c_str() : "(direct)"));
- for(std::list<OutboundMulticast>::iterator tx(gs.txQueue.begin());tx!=gs.txQueue.end();) {
+ for(std::vector<OutboundMulticast>::iterator tx(gs.txQueue.begin());tx!=gs.txQueue.end();) {
if (tx->atLimit()) {
gs.txQueue.erase(tx++);
} else {
tx->sendIfNew(RR,member);
- if (tx->atLimit())
- gs.txQueue.erase(tx++);
- else ++tx;
+ if (tx->atLimit()) {
+ // erase element (replace by last)
+ *tx = gs.txQueue.back();
+ gs.txQueue.pop_back();
+ } else ++tx;
}
}
}