mirror of
https://mirror.ghproxy.com/https://github.com/dexyfex/CodeWalker
synced 2026-05-16 14:54:45 +08:00
R26_dev8 - First public commit
This commit is contained in:
dexyfex
@@ -0,0 +1,251 @@
|
||||
/*
|
||||
Copyright(c) 2015 Neodymium
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to deal
|
||||
in the Software without restriction, including without limitation the rights
|
||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is
|
||||
furnished to do so, subject to the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in
|
||||
all copies or substantial portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||
THE SOFTWARE.
|
||||
*/
|
||||
|
||||
//shamelessly stolen
|
||||
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.Linq;
|
||||
using System.Security.Cryptography;
|
||||
using System.Text;
|
||||
using System.Threading.Tasks;
|
||||
|
||||
namespace CodeWalker.GameFiles
|
||||
{
|
||||
public class GTACrypto
|
||||
{
|
||||
|
||||
|
||||
public static byte[] DecryptAES(byte[] data)
|
||||
{
|
||||
return DecryptAESData(data, GTA5Keys.PC_AES_KEY);
|
||||
}
|
||||
|
||||
public static byte[] DecryptAESData(byte[] data, byte[] key, int rounds = 1)
|
||||
{
|
||||
var rijndael = Rijndael.Create();
|
||||
rijndael.KeySize = 256;
|
||||
rijndael.Key = key;
|
||||
rijndael.BlockSize = 128;
|
||||
rijndael.Mode = CipherMode.ECB;
|
||||
rijndael.Padding = PaddingMode.None;
|
||||
|
||||
var buffer = (byte[])data.Clone();
|
||||
var length = data.Length - data.Length % 16;
|
||||
|
||||
// decrypt...
|
||||
if (length > 0)
|
||||
{
|
||||
var decryptor = rijndael.CreateDecryptor();
|
||||
for (var roundIndex = 0; roundIndex < rounds; roundIndex++)
|
||||
decryptor.TransformBlock(buffer, 0, length, buffer, 0);
|
||||
}
|
||||
|
||||
return buffer;
|
||||
}
|
||||
public static byte[] EncryptAESData(byte[] data, byte[] key, int rounds = 1)
|
||||
{
|
||||
var rijndael = Rijndael.Create();
|
||||
rijndael.KeySize = 256;
|
||||
rijndael.Key = key;
|
||||
rijndael.BlockSize = 128;
|
||||
rijndael.Mode = CipherMode.ECB;
|
||||
rijndael.Padding = PaddingMode.None;
|
||||
|
||||
var buffer = (byte[])data.Clone();
|
||||
var length = data.Length - data.Length % 16;
|
||||
|
||||
// encrypt...
|
||||
if (length > 0)
|
||||
{
|
||||
var encryptor = rijndael.CreateEncryptor();
|
||||
for (var roundIndex = 0; roundIndex < rounds; roundIndex++)
|
||||
encryptor.TransformBlock(buffer, 0, length, buffer, 0);
|
||||
}
|
||||
|
||||
return buffer;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
public static byte[] GetNGKey(string name, uint length)
|
||||
{
|
||||
uint hash = GTA5Hash.CalculateHash(name);
|
||||
uint keyidx = (hash + length + (101 - 40)) % 0x65;
|
||||
return GTA5Keys.PC_NG_KEYS[keyidx];
|
||||
}
|
||||
|
||||
|
||||
public static byte[] DecryptNG(byte[] data, string name, uint length)
|
||||
{
|
||||
byte[] key = GetNGKey(name, length);
|
||||
return DecryptNG(data, key);
|
||||
}
|
||||
|
||||
public static byte[] DecryptNG(byte[] data, byte[] key)
|
||||
{
|
||||
var decryptedData = new byte[data.Length];
|
||||
|
||||
var keyuints = new uint[key.Length / 4];
|
||||
Buffer.BlockCopy(key, 0, keyuints, 0, key.Length);
|
||||
|
||||
for (int blockIndex = 0; blockIndex < data.Length / 16; blockIndex++)
|
||||
{
|
||||
var encryptedBlock = new byte[16];
|
||||
Array.Copy(data, 16 * blockIndex, encryptedBlock, 0, 16);
|
||||
var decryptedBlock = DecryptNGBlock(encryptedBlock, keyuints);
|
||||
Array.Copy(decryptedBlock, 0, decryptedData, 16 * blockIndex, 16);
|
||||
}
|
||||
|
||||
if (data.Length % 16 != 0)
|
||||
{
|
||||
var left = data.Length % 16;
|
||||
Buffer.BlockCopy(data, data.Length - left, decryptedData, data.Length - left, left);
|
||||
}
|
||||
|
||||
return decryptedData;
|
||||
}
|
||||
|
||||
public static byte[] DecryptNGBlock(byte[] data, uint[] key)
|
||||
{
|
||||
var buffer = data;
|
||||
|
||||
// prepare key...
|
||||
var subKeys = new uint[17][];
|
||||
for (int i = 0; i < 17; i++)
|
||||
{
|
||||
subKeys[i] = new uint[4];
|
||||
subKeys[i][0] = key[4 * i + 0];
|
||||
subKeys[i][1] = key[4 * i + 1];
|
||||
subKeys[i][2] = key[4 * i + 2];
|
||||
subKeys[i][3] = key[4 * i + 3];
|
||||
}
|
||||
|
||||
buffer = DecryptNGRoundA(buffer, subKeys[0], GTA5Keys.PC_NG_DECRYPT_TABLES[0]);
|
||||
buffer = DecryptNGRoundA(buffer, subKeys[1], GTA5Keys.PC_NG_DECRYPT_TABLES[1]);
|
||||
for (int k = 2; k <= 15; k++)
|
||||
buffer = DecryptNGRoundB(buffer, subKeys[k], GTA5Keys.PC_NG_DECRYPT_TABLES[k]);
|
||||
buffer = DecryptNGRoundA(buffer, subKeys[16], GTA5Keys.PC_NG_DECRYPT_TABLES[16]);
|
||||
|
||||
return buffer;
|
||||
}
|
||||
|
||||
|
||||
// round 1,2,16
|
||||
public static byte[] DecryptNGRoundA(byte[] data, uint[] key, uint[][] table)
|
||||
{
|
||||
var x1 =
|
||||
table[0][data[0]] ^
|
||||
table[1][data[1]] ^
|
||||
table[2][data[2]] ^
|
||||
table[3][data[3]] ^
|
||||
key[0];
|
||||
var x2 =
|
||||
table[4][data[4]] ^
|
||||
table[5][data[5]] ^
|
||||
table[6][data[6]] ^
|
||||
table[7][data[7]] ^
|
||||
key[1];
|
||||
var x3 =
|
||||
table[8][data[8]] ^
|
||||
table[9][data[9]] ^
|
||||
table[10][data[10]] ^
|
||||
table[11][data[11]] ^
|
||||
key[2];
|
||||
var x4 =
|
||||
table[12][data[12]] ^
|
||||
table[13][data[13]] ^
|
||||
table[14][data[14]] ^
|
||||
table[15][data[15]] ^
|
||||
key[3];
|
||||
|
||||
var result = new byte[16];
|
||||
Array.Copy(BitConverter.GetBytes(x1), 0, result, 0, 4);
|
||||
Array.Copy(BitConverter.GetBytes(x2), 0, result, 4, 4);
|
||||
Array.Copy(BitConverter.GetBytes(x3), 0, result, 8, 4);
|
||||
Array.Copy(BitConverter.GetBytes(x4), 0, result, 12, 4);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
|
||||
// round 3-15
|
||||
public static byte[] DecryptNGRoundB(byte[] data, uint[] key, uint[][] table)
|
||||
{
|
||||
var x1 =
|
||||
table[0][data[0]] ^
|
||||
table[7][data[7]] ^
|
||||
table[10][data[10]] ^
|
||||
table[13][data[13]] ^
|
||||
key[0];
|
||||
var x2 =
|
||||
table[1][data[1]] ^
|
||||
table[4][data[4]] ^
|
||||
table[11][data[11]] ^
|
||||
table[14][data[14]] ^
|
||||
key[1];
|
||||
var x3 =
|
||||
table[2][data[2]] ^
|
||||
table[5][data[5]] ^
|
||||
table[8][data[8]] ^
|
||||
table[15][data[15]] ^
|
||||
key[2];
|
||||
var x4 =
|
||||
table[3][data[3]] ^
|
||||
table[6][data[6]] ^
|
||||
table[9][data[9]] ^
|
||||
table[12][data[12]] ^
|
||||
key[3];
|
||||
|
||||
//var result = new byte[16];
|
||||
//Array.Copy(BitConverter.GetBytes(x1), 0, result, 0, 4);
|
||||
//Array.Copy(BitConverter.GetBytes(x2), 0, result, 4, 4);
|
||||
//Array.Copy(BitConverter.GetBytes(x3), 0, result, 8, 4);
|
||||
//Array.Copy(BitConverter.GetBytes(x4), 0, result, 12, 4);
|
||||
//return result;
|
||||
|
||||
var result = new byte[16];
|
||||
result[0] = (byte)((x1 >> 0) & 0xFF);
|
||||
result[1] = (byte)((x1 >> 8) & 0xFF);
|
||||
result[2] = (byte)((x1 >> 16) & 0xFF);
|
||||
result[3] = (byte)((x1 >> 24) & 0xFF);
|
||||
result[4] = (byte)((x2 >> 0) & 0xFF);
|
||||
result[5] = (byte)((x2 >> 8) & 0xFF);
|
||||
result[6] = (byte)((x2 >> 16) & 0xFF);
|
||||
result[7] = (byte)((x2 >> 24) & 0xFF);
|
||||
result[8] = (byte)((x3 >> 0) & 0xFF);
|
||||
result[9] = (byte)((x3 >> 8) & 0xFF);
|
||||
result[10] = (byte)((x3 >> 16) & 0xFF);
|
||||
result[11] = (byte)((x3 >> 24) & 0xFF);
|
||||
result[12] = (byte)((x4 >> 0) & 0xFF);
|
||||
result[13] = (byte)((x4 >> 8) & 0xFF);
|
||||
result[14] = (byte)((x4 >> 16) & 0xFF);
|
||||
result[15] = (byte)((x4 >> 24) & 0xFF);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,254 @@
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.IO;
|
||||
using System.Linq;
|
||||
using System.Text;
|
||||
using System.Threading.Tasks;
|
||||
|
||||
namespace CodeWalker.GameFiles
|
||||
{
|
||||
|
||||
public class JenkHash
|
||||
{
|
||||
public JenkHashInputEncoding Encoding { get; set; }
|
||||
public string Text { get; set; }
|
||||
public int HashInt { get; set; }
|
||||
public uint HashUint { get; set; }
|
||||
public string HashHex { get; set; }
|
||||
|
||||
public JenkHash(string text, JenkHashInputEncoding encoding)
|
||||
{
|
||||
Encoding = encoding;
|
||||
Text = text;
|
||||
HashUint = GenHash(text, encoding);
|
||||
HashInt = (int)HashUint;
|
||||
HashHex = "0x" + HashUint.ToString("X");
|
||||
}
|
||||
|
||||
|
||||
public static uint GenHash(string text, JenkHashInputEncoding encoding)
|
||||
{
|
||||
uint h = 0;
|
||||
byte[] chars;
|
||||
|
||||
switch (encoding)
|
||||
{
|
||||
default:
|
||||
case JenkHashInputEncoding.UTF8:
|
||||
chars = UTF8Encoding.UTF8.GetBytes(text);
|
||||
break;
|
||||
case JenkHashInputEncoding.ASCII:
|
||||
chars = ASCIIEncoding.ASCII.GetBytes(text);
|
||||
break;
|
||||
}
|
||||
|
||||
for (uint i = 0; i < chars.Length; i++)
|
||||
{
|
||||
h += chars[i];
|
||||
h += (h << 10);
|
||||
h ^= (h >> 6);
|
||||
}
|
||||
h += (h << 3);
|
||||
h ^= (h >> 11);
|
||||
h += (h << 15);
|
||||
|
||||
return h;
|
||||
}
|
||||
|
||||
public static uint GenHash(string text)
|
||||
{
|
||||
uint h = 0;
|
||||
for (int i = 0; i < text.Length; i++)
|
||||
{
|
||||
h += (byte)text[i];
|
||||
h += (h << 10);
|
||||
h ^= (h >> 6);
|
||||
}
|
||||
h += (h << 3);
|
||||
h ^= (h >> 11);
|
||||
h += (h << 15);
|
||||
|
||||
return h;
|
||||
}
|
||||
|
||||
public static uint GenHash(byte[] data)
|
||||
{
|
||||
uint h = 0;
|
||||
for (uint i = 0; i < data.Length; i++)
|
||||
{
|
||||
h += data[i];
|
||||
h += (h << 10);
|
||||
h ^= (h >> 6);
|
||||
}
|
||||
h += (h << 3);
|
||||
h ^= (h >> 11);
|
||||
h += (h << 15);
|
||||
return h;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
public enum JenkHashInputEncoding
|
||||
{
|
||||
UTF8 = 0,
|
||||
ASCII = 1,
|
||||
}
|
||||
|
||||
|
||||
public class JenkIndMatch
|
||||
{
|
||||
public string Hash { get; set; }
|
||||
public string Value { get; set; }
|
||||
public double Score { get; set; }
|
||||
|
||||
public JenkIndMatch(string hash, string val)
|
||||
{
|
||||
Hash = hash;
|
||||
Value = val;
|
||||
CalculateScore();
|
||||
}
|
||||
|
||||
public void CalculateScore()
|
||||
{
|
||||
|
||||
int wordlength = 0;
|
||||
int wordrank = 0;
|
||||
|
||||
string okwordsymbs = " _-.";
|
||||
string goodwordsymbs = "_";
|
||||
|
||||
for (int i = 0; i < Value.Length; i++)
|
||||
{
|
||||
char c = Value[i];
|
||||
|
||||
bool wordchar = (char.IsLetter(c) || char.IsDigit(c) || goodwordsymbs.Contains(c));
|
||||
|
||||
if (wordchar)
|
||||
{
|
||||
wordlength++;
|
||||
}
|
||||
else if (okwordsymbs.Contains(c))
|
||||
{
|
||||
//wordlength++; //don't add this to the score, but allow it to continue the chain
|
||||
}
|
||||
else
|
||||
{
|
||||
if (wordlength > 2)
|
||||
{
|
||||
wordrank += wordlength; //linear word increment, ignoring 1-2char matches
|
||||
}
|
||||
wordlength = 0;
|
||||
}
|
||||
|
||||
//wordrank += wordlength; //each sequential letter in a word contributes more to the rank, ie. 1+2+3+4+...
|
||||
}
|
||||
if (wordlength > 2)
|
||||
{
|
||||
wordrank += wordlength; //linear word increment, ignoring 1-2char matches
|
||||
}
|
||||
|
||||
|
||||
if (Value.Length > 0)
|
||||
{
|
||||
//the max value for a given length when 1+2+3+4+5+..n = n(n+1)/2
|
||||
//double n = (double)Value.Length;
|
||||
//double maxscore = n * (n + 1.0) * 0.5;
|
||||
|
||||
double n = (double)Value.Length;
|
||||
Score = (((double)wordrank) / n);
|
||||
//Score = (((double)wordrank));
|
||||
}
|
||||
else
|
||||
{
|
||||
Score = 0.0;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
public override string ToString()
|
||||
{
|
||||
return string.Format("{0} -> {1} ({2:0.##})", Hash, Value, Score);
|
||||
}
|
||||
}
|
||||
|
||||
public class JenkIndProblem
|
||||
{
|
||||
public string Filename { get; set; }
|
||||
public string Excuse { get; set; }
|
||||
public int Line { get; set; }
|
||||
|
||||
public JenkIndProblem(string filepath, string excuse, int line)
|
||||
{
|
||||
Filename = Path.GetFileName(filepath);
|
||||
Excuse = excuse;
|
||||
Line = line;
|
||||
}
|
||||
public override string ToString()
|
||||
{
|
||||
return string.Format("{0} : {1} at line {2}", Filename, Excuse, Line);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
public static class JenkIndex
|
||||
{
|
||||
public static Dictionary<uint, string> Index = new Dictionary<uint, string>();
|
||||
private static object syncRoot = new object();
|
||||
|
||||
public static void Clear()
|
||||
{
|
||||
lock (syncRoot)
|
||||
{
|
||||
Index.Clear();
|
||||
}
|
||||
}
|
||||
|
||||
public static bool Ensure(string str)
|
||||
{
|
||||
uint hash = JenkHash.GenHash(str);
|
||||
if (hash == 0) return true;
|
||||
lock (syncRoot)
|
||||
{
|
||||
if (!Index.ContainsKey(hash))
|
||||
{
|
||||
Index.Add(hash, str);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
public static string GetString(uint hash)
|
||||
{
|
||||
string res;
|
||||
lock (syncRoot)
|
||||
{
|
||||
if (!Index.TryGetValue(hash, out res))
|
||||
{
|
||||
res = hash.ToString();
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
public static string TryGetString(uint hash)
|
||||
{
|
||||
string res;
|
||||
lock (syncRoot)
|
||||
{
|
||||
if (!Index.TryGetValue(hash, out res))
|
||||
{
|
||||
res = string.Empty;
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user