protocol: add calls to reserve where appropriate
This commit is contained in:
parent
b7425c14c8
commit
dd5e689533
|
@ -546,6 +546,7 @@ namespace cryptonote
|
|||
}
|
||||
|
||||
std::vector<tx_blob_entry> have_tx;
|
||||
have_tx.reserve(new_block.tx_hashes.size());
|
||||
|
||||
// Instead of requesting missing transactions by hash like BTC,
|
||||
// we do it by index (thanks to a suggestion from moneromooo) because
|
||||
|
@ -554,6 +555,7 @@ namespace cryptonote
|
|||
// Also, remember to pepper some whitespace changes around to bother
|
||||
// moneromooo ... only because I <3 him.
|
||||
std::vector<uint64_t> need_tx_indices;
|
||||
need_tx_indices.reserve(new_block.tx_hashes.size());
|
||||
|
||||
transaction tx;
|
||||
crypto::hash tx_hash;
|
||||
|
@ -825,6 +827,7 @@ namespace cryptonote
|
|||
}
|
||||
|
||||
std::vector<crypto::hash> txids;
|
||||
txids.reserve(b.tx_hashes.size());
|
||||
NOTIFY_NEW_FLUFFY_BLOCK::request fluffy_response;
|
||||
fluffy_response.b.block = t_serializable_object_to_blob(b);
|
||||
fluffy_response.current_blockchain_height = arg.current_blockchain_height;
|
||||
|
@ -2149,6 +2152,7 @@ skip:
|
|||
if (span.second > 0)
|
||||
{
|
||||
is_next = true;
|
||||
req.blocks.reserve(hashes.size());
|
||||
for (const auto &hash: hashes)
|
||||
{
|
||||
req.blocks.push_back(hash);
|
||||
|
@ -2197,6 +2201,7 @@ skip:
|
|||
if (span.second > 0)
|
||||
{
|
||||
is_next = true;
|
||||
req.blocks.reserve(hashes.size());
|
||||
for (const auto &hash: hashes)
|
||||
{
|
||||
req.blocks.push_back(hash);
|
||||
|
@ -2230,6 +2235,7 @@ skip:
|
|||
return false;
|
||||
}
|
||||
|
||||
req.blocks.reserve(req.blocks.size() + span.second);
|
||||
for (size_t n = 0; n < span.second; ++n)
|
||||
{
|
||||
req.blocks.push_back(context.m_needed_objects[n].first);
|
||||
|
@ -2531,6 +2537,7 @@ skip:
|
|||
}
|
||||
|
||||
context.m_needed_objects.clear();
|
||||
context.m_needed_objects.reserve(arg.m_block_ids.size());
|
||||
uint64_t added = 0;
|
||||
for (size_t i = 0; i < arg.m_block_ids.size(); ++i)
|
||||
{
|
||||
|
|
Loading…
Reference in New Issue