fergalmoran/DnsServer
1
0
Fork 0
mirror of https://github.com/fergalmoran/DnsServer.git synced 2026-01-06 08:45:32 +00:00
Code Issues Packages Projects Releases Wiki Activity

minor refactoring done.

Browse Source
This commit is contained in:
Shreyas Zare
2022-01-16 19:58:42 +05:30
parent e1f5a97b93
commit e8a7353075
6 changed files with 11 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

206
DnsServerCore/Dns/Trees/DomainTree.cs Normal file
View File

@@ -0,0 +1,206 @@
/*
Technitium DNS Server
Copyright (C) 2022 Shreyas Zare (shreyas@technitium.com)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
using System;
using System.Text;
using TechnitiumLibrary.ByteTree;
namespace DnsServerCore.Dns.Trees
{
class DomainTree<T> : ByteTree<string, T> where T : class
{
#region variables
readonly static byte[] _keyMap;
readonly static byte[] _reverseKeyMap;
#endregion
#region constructor
static DomainTree()
{
_keyMap = new byte[256];
_reverseKeyMap = new byte[40];
int keyCode;
for (int i = 0; i < _keyMap.Length; i++)
{
if (i == 46) //[.]
{
keyCode = 0;
_keyMap[i] = (byte)keyCode;
_reverseKeyMap[keyCode] = (byte)i;
}
else if (i == 42) //[*]
{
keyCode = 1;
_keyMap[i] = 0xff; //skipped value for optimization
_reverseKeyMap[keyCode] = (byte)i;
}
else if (i == 45) //[-]
{
keyCode = 2;
_keyMap[i] = (byte)keyCode;
_reverseKeyMap[keyCode] = (byte)i;
}
else if ((i >= 48) && (i <= 57)) //[0-9]
{
keyCode = i - 45; //3 - 12
_keyMap[i] = (byte)keyCode;
_reverseKeyMap[keyCode] = (byte)i;
}
else if (i == 95) //[_]
{
keyCode = 13;
_keyMap[i] = (byte)keyCode;
_reverseKeyMap[keyCode] = (byte)i;
}
else if ((i >= 97) && (i <= 122)) //[a-z]
{
keyCode = i - 83; //14 - 39
_keyMap[i] = (byte)keyCode;
_reverseKeyMap[keyCode] = (byte)i;
}
else if ((i >= 65) && (i <= 90)) //[A-Z]
{
keyCode = i - 51; //14 - 39
_keyMap[i] = (byte)keyCode;
}
else
{
_keyMap[i] = 0xff;
}
}
}
public DomainTree()
: base(40)
{ }
#endregion
#region protected
protected override byte[] ConvertToByteKey(string domain)
{
if (domain.Length == 0)
return Array.Empty<byte>();
if (domain.Length > 255)
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: length cannot exceed 255 bytes.");
byte[] key = new byte[domain.Length + 1];
int keyOffset = 0;
int labelStart;
int labelEnd = domain.Length - 1;
int labelLength;
int labelChar;
byte labelKeyCode;
int i;
do
{
if (labelEnd < 0)
labelEnd = 0;
labelStart = domain.LastIndexOf('.', labelEnd);
labelLength = labelEnd - labelStart;
if (labelLength == 0)
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: label length cannot be 0 byte.");
if (labelLength > 63)
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: label length cannot exceed 63 bytes.");
if (domain[labelStart + 1] == '-')
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: label cannot start with hyphen.");
if (domain[labelEnd] == '-')
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: label cannot end with hyphen.");
if ((labelLength == 1) && (domain[labelStart + 1] == '*')) //[*]
{
key[keyOffset++] = 1;
}
else
{
for (i = labelStart + 1; i <= labelEnd; i++)
{
labelChar = domain[i];
if (labelChar >= _keyMap.Length)
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: invalid character [" + labelChar + "] was found.");
labelKeyCode = _keyMap[labelChar];
if (labelKeyCode == 0xff)
throw new InvalidDomainNameException("Invalid domain name [" + domain + "]: invalid character [" + labelChar + "] was found.");
key[keyOffset++] = labelKeyCode;
}
}
key[keyOffset++] = 0; //[.]
labelEnd = labelStart - 1;
}
while (labelStart > -1);
return key;
}
protected static string ConvertKeyToLabel(byte[] key, int startIndex)
{
int length = key.Length - startIndex;
if (length < 1)
return null;
byte[] domain = new byte[length];
int i;
int k;
for (i = 0; i < domain.Length; i++)
{
k = key[i + startIndex];
if (k == 0) //[.]
break;
domain[i] = _reverseKeyMap[k];
}
return Encoding.ASCII.GetString(domain, 0, i);
}
#endregion
#region public
public override bool TryRemove(string key, out T value)
{
if (TryRemove(key, out value, out Node closestNode))
{
closestNode.CleanThisBranch();
return true;
}
return false;
}
#endregion
}
}