Files
TrinityCore/contrib/Connection Patcher/Patcher.cs
2015-07-19 13:37:44 +02:00

131 lines
3.5 KiB
C#

/*
* Copyright (C) 2012-2014 Arctium Emulation <http://arctium.org>
* Copyright (C) 2008-2015 TrinityCore <http://www.trinitycore.org/>
*
* 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 Connection_Patcher.Constants;
using System;
using System.IO;
namespace Connection_Patcher
{
class Patcher : IDisposable
{
public string Binary { get; set; }
public bool Initialized { get; private set; }
public BinaryTypes Type { get; private set; }
public byte[] binary;
bool success;
public Patcher(string file)
{
Initialized = false;
success = false;
using (var stream = new MemoryStream(File.ReadAllBytes(file)))
{
Binary = file;
binary = stream.ToArray();
if (binary != null)
{
Type = Helper.GetBinaryType(binary);
Initialized = true;
}
}
}
public void Patch(byte[] bytes, byte[] pattern, long address = 0)
{
if (Initialized && (address != 0 || binary.Length >= pattern.Length))
{
var offset = pattern == null ? address : SearchOffset(pattern);
Console.WriteLine("Found offset {0}", offset);
if (offset != 0 && binary.Length >= bytes.Length)
{
try
{
for (int i = 0; i < bytes.Length; i++)
binary[offset + i] = bytes[i];
}
catch (Exception ex)
{
throw new NotSupportedException(ex.Message);
}
}
}
}
long SearchOffset(byte[] pattern)
{
var matches = 0;
for (long i = 0; i < binary.Length; i++)
{
matches = 0;
for (int j = 0; j < pattern.Length; j++)
{
if (pattern.Length > (binary.Length - i))
return 0;
if (pattern[j] == 0)
{
matches++;
continue;
}
if (binary[i + j] != pattern[j])
break;
matches++;
}
if (matches == pattern.Length)
return i;
}
return 0;
}
public void Finish()
{
success = true;
}
public void Dispose()
{
try
{
if (File.Exists(Binary))
File.Delete(Binary);
if (success)
File.WriteAllBytes(Binary, binary);
}
catch (UnauthorizedAccessException)
{
}
binary = null;
}
}
}