/*
Copyright (C) 2002-2007 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of version 2 of the GNU AFFERO GENERAL PUBLIC LICENSE as
published by the Free Software Foundation.
There are special exceptions to the terms and conditions of the GPL
as it is applied to this software. View the full text of the
exception in file EXCEPTIONS-CONNECTOR-J in the directory of this
software distribution.
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 AFFERO GENERAL PUBLIC LICENSE for more details.
You should have received a copy of the GNU AFFERO GENERAL PUBLIC LICENSE
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* This program is free software; you can redistribute it and/or modify it under the terms of
* the GNU AFFERO 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 AFFERO GENERAL PUBLIC LICENSE for more details.
* You should have received a copy of the GNU AFFERO GENERAL PUBLIC LICENSE along with this program;
* if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
package com.meidusa.amoeba.mysql.util;
import java.io.ObjectInputStream;
import java.util.TimeZone;
/**
* Various utility methods for the driver.
*
* @author Mark Matthews
*/
public class Util {
// cache this ourselves, as the method call is statically-synchronized in
// all but JDK6!
private static final TimeZone DEFAULT_TIMEZONE = TimeZone.getDefault();
static final TimeZone getDefaultTimeZone() {
return (TimeZone) DEFAULT_TIMEZONE.clone();
}
class RandStructcture {
long maxValue;
double maxValueDbl;
long seed1;
long seed2;
}
private static Util enclosingInstance = new Util();
private static boolean isJdbc4 = false;
private static boolean isColdFusion = false;
static {
try {
Class.forName("java.sql.NClob");
isJdbc4 = true;
} catch (Throwable t) {
isJdbc4 = false;
}
}
// ~ Methods
// ----------------------------------------------------------------
public static boolean isJdbc4() {
return isJdbc4;
}
public static boolean isColdFusion() {
return isColdFusion;
}
// Right from Monty's code
public static String newCrypt(String password, String seed) {
byte b;
double d;
if ((password == null) || (password.length() == 0)) {
return password;
}
long[] pw = newHash(seed);
long[] msg = newHash(password);
long max = 0x3fffffffL;
long seed1 = (pw[0] ^ msg[0]) % max;
long seed2 = (pw[1] ^ msg[1]) % max;
char[] chars = new char[seed.length()];
for (int i = 0; i < seed.length(); i++) {
seed1 = ((seed1 * 3) + seed2) % max;
seed2 = (seed1 + seed2 + 33) % max;
d = (double) seed1 / (double) max;
b = (byte) java.lang.Math.floor((d * 31) + 64);
chars[i] = (char) b;
}
seed1 = ((seed1 * 3) + seed2) % max;
seed2 = (seed1 + seed2 + 33) % max;
d = (double) seed1 / (double) max;
b = (byte) java.lang.Math.floor(d * 31);
for (int i = 0; i < seed.length(); i++) {
chars[i] ^= (char) b;
}
return new String(chars);
}
static long[] newHash(String password) {
long nr = 1345345333L;
long add = 7;
long nr2 = 0x12345671L;
long tmp;
for (int i = 0; i < password.length(); ++i) {
if ((password.charAt(i) == ' ') || (password.charAt(i) == '\t')) {
continue; // skip spaces
}
tmp = (0xff & password.charAt(i));
nr ^= ((((nr & 63) + add) * tmp) + (nr << 8));
nr2 += ((nr2 << 8) ^ nr);
add += tmp;
}
long[] result = new long[2];
result[0] = nr & 0x7fffffffL;
result[1] = nr2 & 0x7fffffffL;
return result;
}
static String oldCrypt(String password, String seed) {
long hp;
long hm;
long s1;
long s2;
long max = 0x01FFFFFF;
double d;
byte b;
if ((password == null) || (password.length() == 0)) {
return password;
}
hp = oldHash(seed);
hm = oldHash(password);
long nr = hp ^ hm;
nr %= max;
s1 = nr;
s2 = nr / 2;
char[] chars = new char[seed.length()];
for (int i = 0; i < seed.length(); i++) {
s1 = ((s1 * 3) + s2) % max;
s2 = (s1 + s2 + 33) % max;
d = (double) s1 / max;
b = (byte) java.lang.Math.floor((d * 31) + 64);
chars[i] = (char) b;
}
return new String(chars);
}
static long oldHash(String password) {
long nr = 1345345333;
long nr2 = 7;
long tmp;
for (int i = 0; i < password.length(); i++) {
if ((password.charAt(i) == ' ') || (password.charAt(i) == '\t')) {
continue;
}
tmp = password.charAt(i);
nr ^= ((((nr & 63) + nr2) * tmp) + (nr << 8));
nr2 += tmp;
}
return nr & ((1L << 31) - 1L);
}
private static RandStructcture randomInit(long seed1, long seed2) {
RandStructcture randStruct = enclosingInstance.new RandStructcture();
randStruct.maxValue = 0x3FFFFFFFL;
randStruct.maxValueDbl = randStruct.maxValue;
randStruct.seed1 = seed1 % randStruct.maxValue;
randStruct.seed2 = seed2 % randStruct.maxValue;
return randStruct;
}
/**
* Given a ResultSet and an index into the columns of that ResultSet, read
* binary data from the column which represents a serialized object, and
* re-create the object.
*
* @param resultSet
* the ResultSet to use.
* @param index
* an index into the ResultSet.
* @return the object if it can be de-serialized
* @throws Exception
* if an error occurs
*/
public static Object readObject(java.sql.ResultSet resultSet, int index)
throws Exception {
ObjectInputStream objIn = new ObjectInputStream(resultSet
.getBinaryStream(index));
Object obj = objIn.readObject();
objIn.close();
return obj;
}
private static double rnd(RandStructcture randStruct) {
randStruct.seed1 = ((randStruct.seed1 * 3) + randStruct.seed2)
% randStruct.maxValue;
randStruct.seed2 = (randStruct.seed1 + randStruct.seed2 + 33)
% randStruct.maxValue;
return ((randStruct.seed1) / randStruct.maxValueDbl);
}
/**
* DOCUMENT ME!
*
* @param message
* DOCUMENT ME!
* @param password
* DOCUMENT ME!
*
* @return DOCUMENT ME!
*/
public static String scramble(String message, String password) {
long[] hashPass;
long[] hashMessage;
byte[] to = new byte[8];
String val = ""; //$NON-NLS-1$
message = message.substring(0, 8);
if ((password != null) && (password.length() > 0)) {
hashPass = newHash(password);
hashMessage = newHash(message);
RandStructcture randStruct = randomInit(hashPass[0]
^ hashMessage[0], hashPass[1] ^ hashMessage[1]);
int msgPos = 0;
int msgLength = message.length();
int toPos = 0;
while (msgPos++ < msgLength) {
to[toPos++] = (byte) (Math.floor(rnd(randStruct) * 31) + 64);
}
/* Make it harder to break */
byte extra = (byte) (Math.floor(rnd(randStruct) * 31));
for (int i = 0; i < to.length; i++) {
to[i] ^= extra;
}
val = new String(to);
}
return val;
}
}