📄 kademliaudplistener.cpp
字号:
}
}
// Used in Kad2.0 only
void CKademliaUDPListener::Process_KADEMLIA2_SEARCH_RES (const byte *pbyPacketData, uint32 uLenPacket)
{
CByteIO byteIO(pbyPacketData, uLenPacket);
// What search does this relate to
CUInt128 uTarget;
byteIO.ReadUInt128(&uTarget);
// Who sent this packet.
CUInt128 uSource;
byteIO.ReadUInt128(&uSource);
// Total results.
uint16 uCount = byteIO.ReadUInt16();
CUInt128 uAnswer;
while( uCount > 0 )
{
// What is the answer
byteIO.ReadUInt128(&uAnswer);
// Get info about answer
// NOTE: this is the one and only place in Kad where we allow string conversion to local code page in
// case we did not receive an UTF8 string. this is for backward compatibility for search results which are
// supposed to be 'viewed' by user only and not feed into the Kad engine again!
// If that tag list is once used for something else than for viewing, special care has to be taken for any
// string conversion!
TagList* pTags = new TagList;
try
{
byteIO.ReadTagList(pTags, true);
}
catch(...)
{
deleteTagListEntries(pTags);
delete pTags;
pTags = NULL;
throw;
}
CSearchManager::ProcessResult(uTarget, uAnswer, pTags);
uCount--;
}
}
// Used in Kad1.0 only
void CKademliaUDPListener::Process_KADEMLIA_PUBLISH_REQ (const byte *pbyPacketData, uint32 uLenPacket, uint32 uIP, uint16 uUDPPort)
{
//There are different types of publishing..
//Keyword and File are Stored..
// Verify packet is expected size
if (uLenPacket < 37)
{
CString strError;
strError.Format(_T("***NOTE: Received wrong size (%u) packet in %hs"), uLenPacket, __FUNCTION__);
throw strError;
}
//Used Pointers
CIndexed *pIndexed = CKademlia::GetIndexed();
if( CKademlia::GetPrefs()->GetFirewalled() )
//We are firewalled. We should not index this entry and give publisher a false report.
return;
CByteIO byteIO(pbyPacketData, uLenPacket);
CUInt128 uFile;
byteIO.ReadUInt128(&uFile);
CUInt128 uDistance(CKademlia::GetPrefs()->GetKadID());
uDistance.Xor(uFile);
if( thePrefs.FilterLANIPs() && uDistance.Get32BitChunk(0) > SEARCHTOLERANCE)
return;
bool bDbgInfo = (thePrefs.GetDebugClientKadUDPLevel() > 0);
CString sInfo;
uint16 uCount = byteIO.ReadUInt16();
bool bFlag = false;
uint8 uLoad = 0;
CUInt128 uTarget;
while( uCount > 0 )
{
sInfo.Empty();
byteIO.ReadUInt128(&uTarget);
CEntry* pEntry = new Kademlia::CEntry();
try
{
pEntry->m_uIP = uIP;
pEntry->m_uUDPPort = uUDPPort;
pEntry->m_uKeyID.SetValue(uFile);
pEntry->m_uSourceID.SetValue(uTarget);
uint32 uTags = byteIO.ReadByte();
while(uTags > 0)
{
CKadTag* pTag = byteIO.ReadTag();
if(pTag)
{
if (!pTag->m_name.Compare(TAG_SOURCETYPE) && pTag->m_type == TAGTYPE_UINT8)
{
if( pEntry->m_bSource == false )
{
pEntry->m_listTag.push_back(new CKadTagUInt(TAG_SOURCEIP, pEntry->m_uIP));
pEntry->m_listTag.push_back(new CKadTagUInt(TAG_SOURCEUPORT, pEntry->m_uUDPPort));
}
else
{
//More then one sourcetype tag found.
delete pTag;
}
pEntry->m_bSource = true;
}
if (!pTag->m_name.Compare(TAG_FILENAME))
{
if ( pEntry->m_fileName.IsEmpty() )
{
pEntry->m_fileName = pTag->GetStr();
KadTagStrMakeLower(pEntry->m_fileName); // make lowercase, the search code expects lower case strings!
if (bDbgInfo)
sInfo.AppendFormat(_T(" Name=\"%ls\""), pEntry->m_fileName);
// NOTE: always add the 'name' tag, even if it's stored separately in 'fileName'. the tag is still needed for answering search request
pEntry->m_listTag.push_back(pTag);
}
else
{
//More then one Name tag found.
delete pTag;
}
}
else if (!pTag->m_name.Compare(TAG_FILESIZE))
{
if( pEntry->m_uSize == 0 )
{
if(pTag->IsBsob() && pTag->GetBsobSize() == 8)
{
pEntry->m_uSize = *((uint64*)pTag->GetBsob());
delete pTag;
pTag = new CKadTagUInt(TAG_FILESIZE, pEntry->m_uSize);
}
else
pEntry->m_uSize = pTag->GetInt();
if (bDbgInfo)
sInfo.AppendFormat(_T(" Size=%u"), pEntry->m_uSize);
// NOTE: always add the 'size' tag, even if it's stored separately in 'size'. the tag is still needed for answering search request
pEntry->m_listTag.push_back(pTag);
}
else
{
//More then one size tag found
delete pTag;
}
}
else if (!pTag->m_name.Compare(TAG_SOURCEPORT))
{
if( pEntry->m_uTCPPort == 0 )
{
pEntry->m_uTCPPort = (uint16)pTag->GetInt();
pEntry->m_listTag.push_back(pTag);
}
else
{
//More then one port tag found
delete pTag;
}
}
else
{
//TODO: Filter tags
pEntry->m_listTag.push_back(pTag);
}
}
uTags--;
}
if (bDbgInfo && !sInfo.IsEmpty())
Debug(_T("%s\n"), sInfo);
}
catch(...)
{
delete pEntry;
throw;
}
if( pEntry->m_bSource == true )
{
pEntry->m_tLifetime = (uint32)time(NULL)+KADEMLIAREPUBLISHTIMES;
if( pIndexed->AddSources(uFile, uTarget, pEntry, uLoad ) )
bFlag = true;
else
{
delete pEntry;
pEntry = NULL;
}
}
else
{
pEntry->m_tLifetime = (uint32)time(NULL)+KADEMLIAREPUBLISHTIMEK;
if( pIndexed->AddKeyword(uFile, uTarget, pEntry, uLoad) )
{
//This makes sure we send a publish response.. This also makes sure we index all the files for this keyword.
bFlag = true;
}
else
{
//We already indexed the maximum number of keywords.
//We do not index anymore but we still send a success..
//Reason: Because if a VERY busy node tells the publisher it failed,
//this busy node will spread to all the surrounding nodes causing popular
//keywords to be stored on MANY nodes..
//So, once we are full, we will periodically clean our list until we can
//begin storing again..
bFlag = true;
delete pEntry;
pEntry = NULL;
}
}
uCount--;
}
if( bFlag )
{
CSafeMemFile fileIO2(17);
fileIO2.WriteUInt128(&uFile);
fileIO2.WriteUInt8(uLoad);
if (thePrefs.GetDebugClientKadUDPLevel() > 0)
DebugSend("KADEMLIA_PUBLISH_RES", uIP, uUDPPort);
SendPacket( &fileIO2, KADEMLIA_PUBLISH_RES, uIP, uUDPPort);
}
}
// Used in Kad2.0 only
void CKademliaUDPListener::Process_KADEMLIA2_PUBLISH_KEY_REQ (const byte *pbyPacketData, uint32 uLenPacket, uint32 uIP, uint16 uUDPPort)
{
//Used Pointers
CIndexed *pIndexed = CKademlia::GetIndexed();
if( CKademlia::GetPrefs()->GetFirewalled() )
//We are firewalled. We should not index this entry and give publisher a false report.
return;
CByteIO byteIO(pbyPacketData, uLenPacket);
CUInt128 uFile;
byteIO.ReadUInt128(&uFile);
CUInt128 uDistance(CKademlia::GetPrefs()->GetKadID());
uDistance.Xor(uFile);
// Shouldn't LAN IPs already be filtered?
if( thePrefs.FilterLANIPs() && uDistance.Get32BitChunk(0) > SEARCHTOLERANCE)
return;
bool bDbgInfo = (thePrefs.GetDebugClientKadUDPLevel() > 0);
CString sInfo;
uint16 uCount = byteIO.ReadUInt16();
uint8 uLoad = 0;
CUInt128 uTarget;
while( uCount > 0 )
{
sInfo.Empty();
byteIO.ReadUInt128(&uTarget);
CEntry* pEntry = new Kademlia::CEntry();
try
{
pEntry->m_uIP = uIP;
pEntry->m_uUDPPort = uUDPPort;
pEntry->m_uKeyID.SetValue(uFile);
pEntry->m_uSourceID.SetValue(uTarget);
pEntry->m_tLifetime = (uint32)time(NULL)+KADEMLIAREPUBLISHTIMEK;
pEntry->m_bSource = false;
uint32 uTags = byteIO.ReadByte();
while(uTags > 0)
{
CKadTag* pTag = byteIO.ReadTag();
if(pTag)
{
if (!pTag->m_name.Compare(TAG_FILENAME))
{
if ( pEntry->m_fileName.IsEmpty() )
{
pEntry->m_fileName = pTag->GetStr();
KadTagStrMakeLower(pEntry->m_fileName); // make lowercase, the search code expects lower case strings!
if (bDbgInfo)
sInfo.AppendFormat(_T(" Name=\"%ls\""), pEntry->m_fileName);
// NOTE: always add the 'name' tag, even if it's stored separately in 'fileName'. the tag is still needed for answering search request
pEntry->m_listTag.push_back(pTag);
}
else
{
//More then one Name tag found.
delete pTag;
}
}
else if (!pTag->m_name.Compare(TAG_FILESIZE))
{
if( pEntry->m_uSize == 0 )
{
pEntry->m_uSize = pTag->GetInt();
if (bDbgInfo)
sInfo.AppendFormat(_T(" Size=%u"), pEntry->m_uSize);
// NOTE: always add the 'size' tag, even if it's stored separately in 'size'. the tag is still needed for answering search request
pEntry->m_listTag.push_back(pTag);
}
else
{
//More then one size tag found
delete pTag;
}
}
else
{
//TODO: Filter tags
pEntry->m_listTag.push_back(pTag);
}
}
uTags--;
}
if (bDbgInfo && !sInfo.IsEmpty())
Debug(_T("%s\n"), sInfo);
}
catch(...)
{
delete pEntry;
throw;
}
if( !pIndexed->AddKeyword(uFile, uTarget, pEntry, uLoad) )
{
//We already indexed the maximum number of keywords.
//We do not index anymore but we still send a success..
//Reason: Because if a VERY busy node tells the publisher it failed,
//this busy node will spread to all the surrounding nodes causing popular
//keywords to be stored on MANY nodes..
//So, once we are full, we will periodically clean our list until we can
//begin storing again..
delete pEntry;
pEntry = NULL;
}
uCount--;
}
CSafeMemFile fileIO2(17);
fileIO2.WriteUInt128(&uFile);
fileIO2.WriteUInt8(uLoad);
if (thePrefs.GetDebugClientKadUDPLevel() > 0)
DebugSend("KADEMLIA2_PUBLISH_RES", uIP, uUDPPort);
SendPacket( &fileIO2, KADEMLIA2_PUBLISH_RES, uIP, uUDPPort);
}
// Used in Kad2.0 only
void CKademliaUDPListener::Process_KADEMLIA2_PUBLISH_SOURCE_REQ (const byte *pbyPacketData, uint32 uLenPacket, uint32 uIP, uint16 uUDPPort)
{
//Used Pointers
CIndexed *pIndexed = CKademlia::GetIndexed();
if( CKademlia::GetPrefs()->GetFirewalled() )
//We are firewalled. We should not index this entry and give publisher a false report.
return;
CByteIO byteIO(pbyPacketData, uLenPacket);
CUInt128 uFile;
byteIO.ReadUInt128(&uFile);
CUInt128 uDistance(CKademlia::GetPrefs()->GetKadID());
uDistance.Xor(uFile);
if( thePrefs.FilterLANIPs() && uDistance.Get32BitChunk(0) > SEARCHTOLERANCE)
return;
bool bDbgInfo = (thePrefs.GetDebugClientKadUDPLevel() > 0);
CString sInfo;
sInfo.Empty();
uint8 uLoad = 0;
bool bFlag = false;
CUInt128 uTarget;
byteIO.ReadUInt128(&uTarget);
CEntry* pEntry = new Kademlia::CEntry();
try
{
pEntry->m_uIP = uIP;
pEntry->m_uUDPPort = uUDPPort;
pEntry->m_uKeyID.SetValue(uFile);
pEntry->m_uSourceID.SetValue(uTarget);
pEntry->m_bSource = false;
pEntry->m_tLifetime = (uint32)time(NULL)+KADEMLIAREPUBLISHTIMES;
uint32 uTags = byteIO.ReadByte();
while(uTags > 0)
{
CKadTag* pTag = byteIO.ReadTag();
if(pTag)
{
if (!pTag->m_name.Compare(TAG_SOURCETYPE))
{
if( pEntry->m_bSource == false )
{
pEntry->m_listTag.push_back(new CKadTagUInt(TAG_SOURCEIP, pEntry->m_uIP));
pEntry->m_listTag.push_back(new CKadTagUInt(TAG_SOURCEUPORT, pEntry->m_uUDPPort));
pEntry->m_listTag.push_back(pTag);
pEntry->m_bSource = true;
}
else
{
//More then one sourcetype tag found.
delete pTag;
}
}
else if (!pTag->m_name.Compare(TAG_FILESIZE))
{
if( pEntry->m_uSize == 0 )
{
pEntry->m_uSize = pTag->GetInt();
if (bDbgInfo)
sInfo.AppendFormat(_T(" Size=%u"), pEntry->m_uSize);
// NOTE: always add the 'size' tag, even if it's stored separately in 'size'. the tag is still needed for answering search request
pEntry->m_listTag.push_back(pTag);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -