brokenmd5hasher.java

java 文件下载器。可自定义

// Decompiled by Jad v1.5.8e2. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://kpdus.tripod.com/jad.html
// Decompiler options: packimports(3) fieldsfirst ansi space 
// Source File Name:   BrokenMd5Hasher.java

package org.gudy.azureus2.core3.util;

import java.nio.ByteBuffer;
import java.nio.ByteOrder;

public final class BrokenMd5Hasher
{

	private ByteBuffer buffer;
	private int stateA;
	private int stateB;
	private int stateC;
	private int stateD;
	private long count;

	public BrokenMd5Hasher()
	{
		buffer = ByteBuffer.allocate(64).order(ByteOrder.LITTLE_ENDIAN);
		stateA = 0x67452301;
		stateB = 0xefcdab89;
		stateC = 0x98badcfe;
		stateD = 0x10325476;
		count = 0L;
	}

	public byte[] calculateHash(byte data[])
	{
		ByteBuffer input_buffer = ByteBuffer.wrap(data);
		reset();
		update(input_buffer);
		ByteBuffer result_buffer = ByteBuffer.allocate(16);
		finalDigest(result_buffer);
		byte result[] = new byte[16];
		result_buffer.position(0);
		for (int i = 0; i < result.length; i++)
			result[i] = result_buffer.get();

		return result;
	}

	public void reset()
	{
		stateA = 0x67452301;
		stateB = 0xefcdab89;
		stateC = 0x98badcfe;
		stateD = 0x10325476;
		count = 0L;
		buffer.rewind();
		for (int i = 0; i < 64; i++)
			buffer.put((byte)0);

		buffer.rewind();
	}

	public void update(ByteBuffer input)
	{
		int inputLen = input.remaining();
		int index = (int)count & 0x3f;
		count += inputLen;
		int partLen = 64 - index;
		int i = 0;
		if (inputLen >= partLen)
		{
			if (index > 0)
			{
				int t = input.limit();
				input.limit(input.position() + partLen);
				buffer.put(input);
				buffer.rewind();
				input.limit(t);
				transform(buffer);
				buffer.rewind();
				i = partLen;
				index = partLen;
			}
			for (; i + 63 < inputLen; i += 64)
				transform(input);

		}
		if (i < inputLen)
			buffer.put(input);
	}

	public void update(byte data[])
	{
		update(ByteBuffer.wrap(data));
	}

	public byte[] getDigest()
	{
		ByteBuffer result_buffer = ByteBuffer.allocate(16);
		finalDigest(result_buffer);
		byte result[] = new byte[16];
		result_buffer.position(0);
		for (int i = 0; i < result.length; i++)
			result[i] = result_buffer.get();

		return result;
	}

	public void finalDigest(ByteBuffer digest)
	{
		int index = (int)count & 0x3f;
		if (index < 56)
		{
			buffer.put((byte)-128);
			for (int i = index; i < 55; i++)
				buffer.put((byte)0);

			buffer.putLong(count << 3);
			buffer.rewind();
			transform(buffer);
			buffer.rewind();
		} else
		{
			buffer.put((byte)-128);
			for (int i = index; i < 63; i++)
				buffer.put((byte)0);

			buffer.rewind();
			transform(buffer);
			buffer.rewind();
			for (int i = 0; i < 56; i++)
				buffer.put((byte)0);

			buffer.putLong(count << 3);
			buffer.rewind();
			transform(buffer);
			buffer.rewind();
		}
		digest.putInt(stateA);
		digest.putInt(stateB);
		digest.putInt(stateC);
		digest.putInt(stateD);
		reset();
	}

	private void transform(ByteBuffer block)
	{
		int a = stateA;
		int b = stateB;
		int c = stateC;
		int d = stateD;
		long e = block.getLong();
		long f = block.getLong();
		long g = block.getLong();
		long h = block.getLong();
		long i = block.getLong();
		long j = block.getLong();
		long k = block.getLong();
		long l = block.getLong();
		a = FF(a, b, c, d, (int)e, 7, 0xd76aa478);
		d = FF(d, a, b, c, (int)(e >>> 32), 12, 0xe8c7b756);
		c = FF(c, d, a, b, (int)f, 17, 0x242070db);
		b = FF(b, c, d, a, (int)(f >>> 32), 22, 0xc1bdceee);
		a = FF(a, b, c, d, (int)g, 7, 0xf57c0faf);
		d = FF(d, a, b, c, (int)(g >>> 32), 12, 0x4787c62a);
		c = FF(c, d, a, b, (int)h, 17, 0xa8304613);
		b = FF(b, c, d, a, (int)(h >>> 32), 22, 0xfd469501);
		a = FF(a, b, c, d, (int)i, 7, 0x698098d8);
		d = FF(d, a, b, c, (int)(i >>> 32), 12, 0x8b44f7af);
		c = FF(c, d, a, b, (int)j, 17, -42063);
		b = FF(b, c, d, a, (int)(j >>> 32), 22, 0x895cd7be);
		a = FF(a, b, c, d, (int)k, 7, 0x6b901122);
		d = FF(d, a, b, c, (int)(k >>> 32), 12, 0xfd987193);
		c = FF(c, d, a, b, (int)l, 17, 0xa679438e);
		b = FF(b, c, d, a, (int)(l >>> 32), 22, 0x49b40821);
		a = GG(a, b, c, d, (int)(e >>> 32), 5, 0xf61e2562);
		d = GG(d, a, b, c, (int)h, 9, 0xc040b340);
		c = GG(c, d, a, b, (int)(j >>> 32), 14, 0x265e5a51);
		b = GG(b, c, d, a, (int)e, 20, 0xe9b6c7aa);
		a = GG(a, b, c, d, (int)(g >>> 32), 5, 0xd62f105d);
		d = GG(d, a, b, c, (int)j, 9, 0x2441453);
		c = GG(c, d, a, b, (int)(l >>> 32), 14, 0xd8a1e681);
		b = GG(b, c, d, a, (int)g, 20, 0xe7d3fbc8);
		a = GG(a, b, c, d, (int)(i >>> 32), 5, 0x21e1cde6);
		d = GG(d, a, b, c, (int)l, 9, 0xc33707d6);
		c = GG(c, d, a, b, (int)(f >>> 32), 14, 0xf4d50d87);
		b = GG(b, c, d, a, (int)i, 20, 0x455a14ed);
		a = GG(a, b, c, d, (int)(k >>> 32), 5, 0xa9e3e905);
		d = GG(d, a, b, c, (int)f, 9, 0xfcefa3f8);
		c = GG(c, d, a, b, (int)(h >>> 32), 14, 0x676f02d9);
		b = GG(b, c, d, a, (int)k, 20, 0x8d2a4c8a);
		a = HH(a, b, c, d, (int)(g >>> 32), 4, 0xfffa3942);
		d = HH(d, a, b, c, (int)i, 11, 0x8771f681);
		c = HH(c, d, a, b, (int)(j >>> 32), 16, 0x6d9d6122);
		b = HH(b, c, d, a, (int)l, 23, 0xfde5380c);
		a = HH(a, b, c, d, (int)(e >>> 32), 4, 0xa4beea44);
		d = HH(d, a, b, c, (int)g, 11, 0x4bdecfa9);
		c = HH(c, d, a, b, (int)(h >>> 32), 16, 0xf6bb4b60);
		b = HH(b, c, d, a, (int)j, 23, 0xbebfbc70);
		a = HH(a, b, c, d, (int)(k >>> 32), 4, 0x289b7ec6);
		d = HH(d, a, b, c, (int)e, 11, 0xeaa127fa);
		c = HH(c, d, a, b, (int)(f >>> 32), 16, 0xd4ef3085);
		b = HH(b, c, d, a, (int)h, 23, 0x4881d05);
		a = HH(a, b, c, d, (int)(i >>> 32), 4, 0xd9d4d039);
		d = HH(d, a, b, c, (int)k, 11, 0xe6db99e5);
		c = HH(c, d, a, b, (int)(l >>> 32), 16, 0x1fa27cf8);
		b = HH(b, c, d, a, (int)f, 23, 0xc4ac5665);
		a = II(a, b, c, d, (int)e, 6, 0xf4292244);
		d = II(d, a, b, c, (int)(h >>> 32), 10, 0x432aff97);
		c = II(c, d, a, b, (int)l, 15, 0xab9423a7);
		b = II(b, c, d, a, (int)(g >>> 32), 21, 0xfc93a039);
		a = II(a, b, c, d, (int)k, 6, 0x655b59c3);
		d = II(d, a, b, c, (int)(f >>> 32), 10, 0x8f0ccc92);
		c = II(c, d, a, b, (int)j, 15, 0xffeff47d);
		b = II(b, c, d, a, (int)(e >>> 32), 21, 0x85845dd1);
		a = II(a, b, c, d, (int)i, 6, 0x6fa87e4f);
		d = II(d, a, b, c, (int)(l >>> 32), 10, 0xfe2ce6e0);
		c = II(c, d, a, b, (int)h, 15, 0xa3014314);
		b = II(b, c, d, a, (int)(k >>> 32), 21, 0x4e0811a1);
		a = II(a, b, c, d, (int)g, 6, 0xf7537e82);
		d = II(d, a, b, c, (int)(j >>> 32), 10, 0xbd3af235);
		c = II(c, d, a, b, (int)f, 15, 0x2ad7d2bb);
		b = II(b, c, d, a, (int)(i >>> 32), 21, 0xeb86d391);
		stateA += a;
		stateB += b;
		stateC += c;
		stateD += d;
	}

	private static int FF(int a, int b, int c, int d, int x, int s, int t)
	{
		int r = a + x + t + (d ^ b & (c ^ d));
		return (r << s | r >>> 32 - s) + b;
	}

	private static int GG(int a, int b, int c, int d, int x, int s, int t)
	{
		int r = a + x + t + (c ^ d & (b ^ c));
		return (r << s | r >>> 32 - s) + b;
	}

	private static int HH(int a, int b, int c, int d, int x, int s, int t)
	{
		int r = a + x + t + (b ^ c ^ d);
		return (r << s | r >>> 32 - s) + b;
	}

	private static int II(int a, int b, int c, int d, int x, int s, int t)
	{
		int r = a + x + t + (c ^ (b | ~d));
		return (r << s | r >>> 32 - s) + b;
	}
}