/// <summary>
/// Writes Int64 value to out buffer
/// </summary>
/// <param name="x"></param>
public void WriteLongInt(Int64 x)
{
byte[] data = new byte[8];
if (x <= 0x7FFFFFFF)
{
writeInt((int)x);
return;
}
writeUInt(0xFFFFFFFF);
CheckSum.SIVAL(ref data, 0, (UInt32)(x & 0xFFFFFFFF));
CheckSum.SIVAL(ref data, 4, (UInt32)((x >> 32) & 0xFFFFFFFF));
Write(data, 0, 8);
}
public void GenerateAndSendSums(Stream fd, long len, IOStream f, Stream fCopy)
{
long i;
MapFile mapBuf;
SumStruct sum = new SumStruct();
long offset = 0;
SumSizesSqroot(sum, (UInt64)len);
if (len > 0)
{
mapBuf = new MapFile(fd, (int)len, Options.MAX_MAP_SIZE, (int)sum.bLength);
}
else
{
mapBuf = null;
}
WriteSumHead(f, sum);
for (i = 0; i < sum.count; i++)
{
UInt32 n1 = (UInt32)Math.Min(len, sum.bLength);
int off = mapBuf.MapPtr((int)offset, (int)n1);
byte[] map = mapBuf.p;
UInt32 sum1 = CheckSum.GetChecksum1(map, off, (int)n1);
byte[] sum2 = new byte[CheckSum.SUM_LENGTH];
sum2 = checkSum.GetChecksum2(map, off, (int)n1);
if (options.verbose > 3)
{
Log.WriteLine("chunk[" + i + "] offset=" + offset + " len=" + n1 + " sum1=" + sum1);
}
f.writeInt((int)sum1);
f.Write(sum2, 0, sum.s2Length);
len -= n1;
offset += n1;
}
if (mapBuf != null)
{
mapBuf = null;
}
}
public void GenerateAndSendSums(Stream fd, long len, IoStream f, Stream fCopy)
{
long i;
MapFile mapBuf;
var sum = new SumStruct();
long offset = 0;
SumSizesSqroot(sum, (UInt64)len);
if (len > 0)
{
mapBuf = new MapFile(fd, (int)len, Options.MaxMapSize, (int)sum.BLength);
}
else
{
mapBuf = null;
}
WriteSumHead(f, sum);
for (i = 0; i < sum.Count; i++)
{
var n1 = (UInt32)Math.Min(len, sum.BLength);
var off = mapBuf.MapPtr((int)offset, (int)n1);
var map = mapBuf.P;
var sum1 = CheckSum.GetChecksum1(map, off, (int)n1);
var sum2 = new byte[CheckSum.SumLength];
sum2 = _checkSum.GetChecksum2(map, off, (int)n1);
if (_options.Verbose > 3)
{
Log.WriteLine("chunk[" + i + "] offset=" + offset + " len=" + n1 + " sum1=" + sum1);
}
f.WriteInt((int)sum1);
f.Write(sum2, 0, sum.S2Length);
len -= n1;
offset += n1;
}
if (mapBuf != null)
{
mapBuf = null;
}
}
/// <summary>
///
/// </summary>
/// <param name="code"></param>
/// <param name="buffer"></param>
/// <param name="count"></param>
public void MultiplexWrite(MsgCode code, byte[] buffer, int count)
{
var localBuffer = new byte[4096];
var n = count;
CheckSum.Sival(ref localBuffer, 0, (UInt32)(((MplexBase + (int)code) << 24) + count));
if (n > localBuffer.Length - 4)
{
n = localBuffer.Length - 4;
}
Util.MemoryCopy(localBuffer, 4, buffer, 0, n);
_socketOut.Write(localBuffer, 0, n + 4);
count -= n;
if (count > 0)
{
_socketOut.Write(buffer, n, count);
}
}
public void MplexWrite(MsgCode code, byte[] buf, int len)
{
byte[] buffer = new byte[4096];
int n = len;
CheckSum.SIVAL(ref buffer, 0, (UInt32)(((MPLEX_BASE + (int)code) << 24) + len));
if (n > buffer.Length - 4)
{
n = buffer.Length - 4;
}
Util.MemCpy(buffer, 4, buf, 0, n);
sockOut.Write(buffer, 0, n + 4);
len -= n;
if (len > 0)
{
sockOut.Write(buf, n, len);
}
}
/// <summary>
///
/// </summary>
/// <param name="code"></param>
/// <param name="buffer"></param>
/// <param name="count"></param>
public void MultiplexWrite(MsgCode code, byte[] buffer, int count)
{
byte[] localBuffer = new byte[4096];
int n = count;
CheckSum.SIVAL(ref localBuffer, 0, (UInt32)(((MPLEX_BASE + (int)code) << 24) + count));
if (n > localBuffer.Length - 4)
{
n = localBuffer.Length - 4;
}
Util.MemoryCopy(localBuffer, 4, buffer, 0, n);
socketOut.Write(localBuffer, 0, n + 4);
count -= n;
if (count > 0)
{
socketOut.Write(buffer, n, count);
}
}
/// <summary>
/// Generates challenge using time as vector
/// </summary>
/// <param name="addr"></param>
/// <param name="opt"></param>
/// <returns></returns>
public static string GenerateChallenge(string addr, Options opt)
{
var challenge = String.Empty;
var input = new byte[32];
var timeVector = DateTime.Now;
for (var i = 0; i < addr.Length; i++)
{
input[i] = Convert.ToByte(addr[i]);
}
CheckSum.Sival(ref input, 16, (UInt32)timeVector.Second);
CheckSum.Sival(ref input, 20, (UInt32)timeVector.Hour);
CheckSum.Sival(ref input, 24, (UInt32)timeVector.Day);
var sum = new Sum(opt);
sum.Init(0);
sum.Update(input, 0, input.Length);
challenge = Encoding.ASCII.GetString(sum.End());
return(challenge);
}
public static string gen_challenge(string addr, Options opt)
{
string challenge = "";
byte[] input = new byte[32];
DateTime tv = DateTime.Now;
for (int i = 0; i < addr.Length; i++)
{
input[i] = Convert.ToByte(addr[i]);
}
CheckSum.SIVAL(ref input, 16, (UInt32)tv.Second);
CheckSum.SIVAL(ref input, 20, (UInt32)tv.Hour);
CheckSum.SIVAL(ref input, 24, (UInt32)tv.Day);
Sum sum = new Sum(opt);
sum.Init(0);
sum.Update(input, 0, input.Length);
challenge = Encoding.ASCII.GetString(sum.End());
return(challenge);
}
public FileList(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Receiver(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Sender(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Sender(Options opt)
{
_options = opt;
_checkSum = new CheckSum(_options);
}
public void HashSearch(IoStream f, SumStruct s, MapFile buf, int len, Sum _sum)
{
int offset, end, backup;
UInt32 k;
int wantI;
var sum2 = new byte[CheckSum.SumLength];
UInt32 s1, s2, sum;
int more;
byte[] map;
wantI = 0;
if (_options.Verbose > 2)
{
Log.WriteLine("hash search ob=" + s.BLength + " len=" + len);
}
k = (UInt32)Math.Min(len, s.BLength);
var off = buf.MapPtr(0, (int)k);
map = buf.P;
var g = s.Sums[0].Sum1;
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
if (_options.Verbose > 3)
{
Log.WriteLine("sum=" + sum + " k=" + k);
}
offset = 0;
end = (int)(len + 1 - s.Sums[s.Count - 1].Len);
if (_options.Verbose > 3)
{
Log.WriteLine("hash search s.bLength=" + s.BLength + " len=" + len + " count=" + s.Count);
}
do
{
var t = GetTag2(s1, s2);
var doneCsum2 = false;
var j = _tagTable[t];
if (_options.Verbose > 4)
{
Log.WriteLine("offset=" + offset + " sum=" + sum);
}
if (j == NullTag)
{
goto null_tag;
}
sum = (s1 & 0xffff) | (s2 << 16);
_tagHits++;
do
{
UInt32 l;
var i = _targets[j].I;
if (sum != s.Sums[i].Sum1)
{
continue;
}
l = (UInt32)Math.Min(s.BLength, len - offset);
if (l != s.Sums[i].Len)
{
continue;
}
if (_options.Verbose > 3)
{
Log.WriteLine("potential match at " + offset + " target=" + j + " " + i + " sum=" + sum);
}
if (!doneCsum2)
{
off = buf.MapPtr(offset, (int)l);
map = buf.P;
var cs = new CheckSum(_options);
sum2 = cs.GetChecksum2(map, off, (int)l);
doneCsum2 = true;
}
if (Util.MemoryCompare(sum2, 0, s.Sums[i].Sum2, 0, s.S2Length) != 0)
{
_falseAlarms++;
continue;
}
if (i != wantI && wantI < s.Count &&
(!_options.Inplace || _options.MakeBackups || s.Sums[wantI].Offset >= offset ||
(s.Sums[wantI].Flags & SumflgSameOffset) != 0) &&
sum == s.Sums[wantI].Sum1 &&
Util.MemoryCompare(sum2, 0, s.Sums[wantI].Sum2, 0, s.S2Length) == 0)
{
i = wantI;
}
//set_want_i:
wantI = i + 1;
Matched(f, s, buf, offset, i, _sum);
offset += (int)(s.Sums[i].Len - 1);
k = (UInt32)Math.Min(s.BLength, len - offset);
off = buf.MapPtr(offset, (int)k);
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
_matches++;
break;
} while (++j < s.Count && _targets[j].T == t);
null_tag:
backup = offset - _lastMatch;
if (backup < 0)
{
backup = 0;
}
more = (offset + k) < len ? 1 : 0;
off = buf.MapPtr(offset - backup, (int)(k + more + backup)) + backup;
s1 -= (UInt32)(CheckSum.ToInt(map[off]) + CheckSum.CharOffset);
s2 -= (UInt32)(k * CheckSum.ToInt(map[off]) + CheckSum.CharOffset);
off = (k + off >= map.Length) ? (int)(map.Length - k - 1) : off;
if (more != 0)
{
s1 += (UInt32)(CheckSum.ToInt(map[k + off]) + CheckSum.CharOffset);
s2 += s1;
}
else
{
--k;
}
if (backup >= ChunkSize + s.BLength && end - offset > ChunkSize)
{
Matched(f, s, buf, (int)(offset - s.BLength), -2, _sum);
}
} while (++offset < end);
Matched(f, s, buf, len, -1, _sum);
buf.MapPtr(len - 1, 1);
}
public FileList(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Generator(Options opt)
{
_options = opt;
_checkSum = new CheckSum(_options);
}
public Receiver(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Generator(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public Generator(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public FileList(Options opt)
{
_options = opt;
_checkSum = new CheckSum(_options);
}
public void HashSearch(IOStream f,SumStruct s, MapFile buf, int len, Sum _sum)
{
int offset, end, backup;
UInt32 k;
int wantI;
byte[] sum2 = new byte[CheckSum.SUM_LENGTH];
UInt32 s1, s2, sum;
int more;
byte[] map;
wantI = 0;
if (options.verbose > 2)
Log.WriteLine("hash search ob=" + s.bLength +" len=" + len);
k = (UInt32)Math.Min(len, s.bLength);
int off = buf.MapPtr(0, (int)k);
map = buf.p;
UInt32 g = s.sums[0].sum1;
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
if (options.verbose > 3)
Log.WriteLine("sum=" + sum +" k=" + k);
offset = 0;
end = (int)(len + 1 - s.sums[s.count-1].len);
if (options.verbose > 3)
Log.WriteLine("hash search s.bLength=" + s.bLength +" len=" + len +" count=" + s.count);
do
{
UInt32 t = GetTag2(s1,s2);
bool doneCsum2 = false;
int j = tagTable[t];
if (options.verbose > 4)
Log.WriteLine("offset=" + offset + " sum=" + sum);
if (j == NULL_TAG)
goto null_tag;
sum = (s1 & 0xffff) | (s2 << 16);
tagHits++;
do
{
UInt32 l;
int i = ((Target)targets[j]).i;
if (sum != s.sums[i].sum1)
continue;
l = (UInt32)Math.Min(s.bLength, len-offset);
if (l != s.sums[i].len)
continue;
if (options.verbose > 3)
Log.WriteLine("potential match at " + offset + " target=" + j +" " + i + " sum=" + sum);
if (!doneCsum2)
{
off = buf.MapPtr(offset, (int)l);
map = buf.p;
CheckSum cs = new CheckSum(options);
sum2 = cs.GetChecksum2(map, off, (int)l);
doneCsum2 = true;
}
if (Util.MemCmp(sum2, 0, s.sums[i].sum2, 0, s.s2Length) != 0)
{
falseAlarms++;
continue;
}
if (i != wantI && wantI < s.count
&& (!options.inplace || options.makeBackups || s.sums[wantI].offset >= offset
|| (s.sums[wantI].flags & SUMFLG_SAME_OFFSET) != 0)
&& sum == s.sums[wantI].sum1
&& Util.MemCmp(sum2, 0, s.sums[wantI].sum2, 0, s.s2Length) == 0)
{
i = wantI;
}
set_want_i:
wantI = i + 1;
Matched(f,s,buf,offset,i,_sum);
offset += (int)(s.sums[i].len - 1);
k = (UInt32)Math.Min(s.bLength, len-offset);
off = buf.MapPtr(offset, (int)k);
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
matches++;
break;
} while (++j < s.count && ((Target)targets[j]).t == t);
null_tag:
backup = offset - lastMatch;
if (backup < 0)
backup = 0;
more = (offset + k) < len ? 1 : 0;
off = buf.MapPtr(offset - backup, (int)(k + more + backup))+ backup;
s1 -= (UInt32)(CheckSum.ToInt(map[off]) + CheckSum.CHAR_OFFSET);
s2 -= (UInt32)(k * CheckSum.ToInt(map[off]) + CheckSum.CHAR_OFFSET);
off = (k + off >= map.Length) ? (int)(map.Length-k-1) : off;
if (more != 0)
{
s1 += (UInt32)(CheckSum.ToInt(map[k + off]) + CheckSum.CHAR_OFFSET);
s2 += s1;
}
else
--k;
if (backup >= CHUNK_SIZE + s.bLength && end - offset > CHUNK_SIZE)
Matched(f,s,buf,(int)(offset - s.bLength), -2, _sum);
} while (++offset < end);
Matched(f,s,buf,len,-1, _sum);
buf.MapPtr(len-1,1);
}
public Sender(Options opt)
{
options = opt;
checkSum = new CheckSum(options);
}
public void HashSearch(IOStream f, SumStruct s, MapFile buf, int len, Sum _sum)
{
int offset, end, backup;
UInt32 k;
int wantI;
byte[] sum2 = new byte[CheckSum.SUM_LENGTH];
UInt32 s1, s2, sum;
int more;
byte[] map;
wantI = 0;
if (options.verbose > 2)
{
Log.WriteLine("hash search ob=" + s.bLength + " len=" + len);
}
k = (UInt32)Math.Min(len, s.bLength);
int off = buf.MapPtr(0, (int)k);
map = buf.p;
UInt32 g = s.sums[0].sum1;
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
if (options.verbose > 3)
{
Log.WriteLine("sum=" + sum + " k=" + k);
}
offset = 0;
end = (int)(len + 1 - s.sums[s.count - 1].len);
if (options.verbose > 3)
{
Log.WriteLine("hash search s.bLength=" + s.bLength + " len=" + len + " count=" + s.count);
}
do
{
UInt32 t = GetTag2(s1, s2);
bool doneCsum2 = false;
int j = tagTable[t];
if (options.verbose > 4)
{
Log.WriteLine("offset=" + offset + " sum=" + sum);
}
if (j == NULL_TAG)
{
goto null_tag;
}
sum = (s1 & 0xffff) | (s2 << 16);
tagHits++;
do
{
UInt32 l;
int i = ((Target)targets[j]).i;
if (sum != s.sums[i].sum1)
{
continue;
}
l = (UInt32)Math.Min(s.bLength, len - offset);
if (l != s.sums[i].len)
{
continue;
}
if (options.verbose > 3)
{
Log.WriteLine("potential match at " + offset + " target=" + j + " " + i + " sum=" + sum);
}
if (!doneCsum2)
{
off = buf.MapPtr(offset, (int)l);
map = buf.p;
CheckSum cs = new CheckSum(options);
sum2 = cs.GetChecksum2(map, off, (int)l);
doneCsum2 = true;
}
if (Util.MemCmp(sum2, 0, s.sums[i].sum2, 0, s.s2Length) != 0)
{
falseAlarms++;
continue;
}
if (i != wantI && wantI < s.count &&
(!options.inplace || options.makeBackups || s.sums[wantI].offset >= offset ||
(s.sums[wantI].flags & SUMFLG_SAME_OFFSET) != 0) &&
sum == s.sums[wantI].sum1 &&
Util.MemCmp(sum2, 0, s.sums[wantI].sum2, 0, s.s2Length) == 0)
{
i = wantI;
}
set_want_i:
wantI = i + 1;
Matched(f, s, buf, offset, i, _sum);
offset += (int)(s.sums[i].len - 1);
k = (UInt32)Math.Min(s.bLength, len - offset);
off = buf.MapPtr(offset, (int)k);
sum = CheckSum.GetChecksum1(map, off, (int)k);
s1 = sum & 0xFFFF;
s2 = sum >> 16;
matches++;
break;
} while (++j < s.count && ((Target)targets[j]).t == t);
null_tag:
backup = offset - lastMatch;
if (backup < 0)
{
backup = 0;
}
more = (offset + k) < len ? 1 : 0;
off = buf.MapPtr(offset - backup, (int)(k + more + backup)) + backup;
s1 -= (UInt32)(CheckSum.ToInt(map[off]) + CheckSum.CHAR_OFFSET);
s2 -= (UInt32)(k * CheckSum.ToInt(map[off]) + CheckSum.CHAR_OFFSET);
off = (k + off >= map.Length) ? (int)(map.Length - k - 1) : off;
if (more != 0)
{
s1 += (UInt32)(CheckSum.ToInt(map[k + off]) + CheckSum.CHAR_OFFSET);
s2 += s1;
}
else
{
--k;
}
if (backup >= CHUNK_SIZE + s.bLength && end - offset > CHUNK_SIZE)
{
Matched(f, s, buf, (int)(offset - s.bLength), -2, _sum);
}
} while (++offset < end);
Matched(f, s, buf, len, -1, _sum);
buf.MapPtr(len - 1, 1);
}
public Receiver(Options opt)
{
_options = opt;
_checkSum = new CheckSum(_options);
}