本文整理汇总了C++中CNode::GetId方法的典型用法代码示例。如果您正苦于以下问题：C++ CNode::GetId方法的具体用法？C++ CNode::GetId怎么用？C++ CNode::GetId使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类CNode的用法示例。
在下文中一共展示了CNode::GetId方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: ProcessMerkleBlock
void ProcessMerkleBlock(CNode& pfrom, CDataStream& vRecv,
ThinBlockWorker& worker,
const TxFinder& txfinder) {
CMerkleBlock merkleBlock;
vRecv >> merkleBlock;
uint256 hash = merkleBlock.header.GetHash();
pfrom.AddInventoryKnown(CInv(MSG_BLOCK, hash));
if (!worker.isAvailable() && worker.blockHash() != hash)
LogPrint("thin", "expected peer %d to be working on %s, "
"but received block %s, switching peer to new block\n",
pfrom.id, worker.blockStr(), hash.ToString());
if (HaveBlockData(hash)) {
LogPrint("thin", "already had block %s, "
"ignoring merkleblock (peer %d)\n",
hash.ToString(), pfrom.id);
worker.setAvailable();
return;
}
worker.setToWork(hash);
if (worker.isStubBuilt()) {
LogPrint("thin", "already built thin block stub "
"%s (peer %d)\n", hash.ToString(), pfrom.id);
SendPing(pfrom);
return;
}
LogPrint("thin", "building thin block %s (peer %d) ",
hash.ToString(), pfrom.id);
// Now attempt to reconstruct the block from the state of our memory pool.
// The peer should have already sent us the transactions we need before
// sending us this message. If it didn't, we just ignore the message
// entirely for now.
try {
worker.buildStub(merkleBlock, txfinder);
SendPing(pfrom);
}
catch (const thinblock_error& e) {
pfrom.PushMessage("reject", std::string("merkleblock"),
REJECT_MALFORMED, std::string("bad merkle tree"), hash);
Misbehaving(pfrom.GetId(), 10); // FIXME: Is this DoS policy reasonable? Immediate disconnect is better?
LogPrintf("%s peer=%d", e.what(), pfrom.GetId());
worker.setAvailable();
return;
}
}示例2: FindNodeWithFreeMem
CNode* CMigrationInfo::FindNodeWithFreeMem(CNode* i_sourceNode, CProcess* i_process)
{
i_sourceNode->WriteLog("MIGRATION - MEM ISSUES - Searching for destination node to establish migration");
CNode* returnValue = NULL;
bool found = false;
double maxFreeMem = 0;
uint32_t maxIndex = 0;
// find out which is the process with the greatest free mem that we can migrate to:
if (i_sourceNode->GetAvailableBandwidth() > 0)
{
for (uint32_t i = 0; i < CMasterSingleton::GetInstance()->GetNodeCount(); ++i)
{
CNode* currentNode = CMasterSingleton::GetInstance()->GetNode(i);
double freeMem = currentNode->GetFreeMem();
if (maxFreeMem < freeMem && i_sourceNode->GetId() != currentNode->GetId() && CanBeDestination(currentNode, i_process))
{
maxFreeMem = freeMem;
maxIndex = i;
found = true;
}
}
// if found is false, we will return a null pointer meaning that the migration should not happen
if (found)
returnValue = CMasterSingleton::GetInstance()->GetNode(maxIndex);
}
return returnValue;
}示例3: FindNodeWithFreeCpu
CNode* CMigrationInfo::FindNodeWithFreeCpu(CNode* i_sourceNode, CProcess* i_process)
{
i_sourceNode->WriteLog("MIGRATION - CPU ISSUES - Searching for destination node to establish migration");
CNode* returnValue = NULL;
bool found = false;
uint32_t minIndex = 0;
double minCpu = 1;
if (i_sourceNode->GetAvailableBandwidth() > 0)
{
for (uint32_t i = 0; i < CMasterSingleton::GetInstance()->GetNodeCount(); ++i)
{
CNode* currentNode = CMasterSingleton::GetInstance()->GetNode(i);
double cpuUsage = currentNode->GetCpuUsage();
if (minCpu > cpuUsage && i_sourceNode->GetId() != currentNode->GetId() && CanBeDestination(currentNode, i_process))
{
minCpu = cpuUsage;
minIndex = i;
found = true;
}
}
// if found is false, we will return a null pointer meaning that the migration should not happen
if (found)
returnValue = CMasterSingleton::GetInstance()->GetNode(minIndex);
}
return returnValue;
}