/*
* Fixcrc.c - small program to fix the crc of the VPx500 swinfo files
*
* Copyright (C) 2010 Sprite_tm
*
* 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 .
*/
/*
* MD5 routines
*
* This code implements the MD5 message-digest algorithm. The algorithm is due to Ron Rivest. This code was
* written by Colin Plumb in 1993, no copyright is claimed. This code is in the public domain; do with it what you wish.
*
* Equivalent code is available from RSA Data Security, Inc. This code has been tested against that, and is equivalent,
* except that you don't need to include two pages of legalese with every copy.
*
* To compute the message digest of a chunk of bytes, declare an MD5Context structure, pass it to MD5Init, call MD5Update as
* needed on buffers full of bytes, and then call MD5Final, which will fill a supplied 16-byte array with the digest.
*/
/*
* Checksum updater for swinfo file for VPx500 updates.
*
* Contents of swinfo file:
* - full update field (37 bytes)
* - 6 x partial update fields (37 bytes each)
* - checksum (4 bytes)
*
* Every update field contains the following:
* - Filename (16 bytes, zero-padded)
* - Md5-sum of update package file (16 bytes)
* - Version (5 bytes, zero-padded)
*
* The VPx500-updater will download swinfo from the server, then check its checksum. If this is OK, it'll check the version of the partial update
* fields against the versions of these packages installed on the phone itself. If the version on the server is newer, it will start downloading the file
* from the same directory as the swinfo file resides in. As soon as that's done, it'll wait till a few minutes past 02.00AM, run some patch-scripts,
* ttar -zxf the updates to the root of the filesystem and then run some more patchscripts.
*
* How the full update works is unknown at this time. The workings of the patch-scripts are also unknown as of yet. It is, however, known that the patch-
* scripts running for the 5th partial update won't do anything damaging. This is the one replaced by hack.tgz in my version, and I suggest you use this one
* too if you don't need any patch scripts to be run.
*
* If you hack a swinfo file, you'll need its checksum updated before the phone accepts it. Just compile this file (gcc -o fixcrc fixcrc.c) and
* run it with the swinfo file as the first argument.
*/
#include
#include
#include
typedef unsigned long uint32;
typedef struct MD5Context {
uint32 buf[4];
uint32 bits[2];
unsigned char in[64];
} MD5_CTX;
#ifdef __TURBOC__
#pragma pack(1)
#endif
struct {
struct {
char name[16]; // the package file
unsigned char md5sum[16]; // MD5 sum of above file
char version[5]; // file version
} field[7]; // 1x full update, 6x partial update
unsigned char nc; // EOF (end of fields) marker ?
uint32 chks; // checksum for swinfo
} swinfo;
#define LEN sizeof(swinfo)
#ifdef __TURBOC__
#pragma pack()
#endif
unsigned char digest[16];
/* The four core functions - F1 is optimized somewhat */
#define F1(x, y, z) (z ^ (x & (y ^ z)))
#define F2(x, y, z) F1(z, x, y)
#define F3(x, y, z) (x ^ y ^ z)
#define F4(x, y, z) (y ^ (x | ~z))
/* This is the central step in the MD5 algorithm. */
#define MD5STEP(f, w, x, y, z, data, s) ( w += f(x, y, z) + data, w = w<>(32-s), w += x )
/*
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious initialization constants.
*/
void MD5Init( struct MD5Context *ctx )
{
ctx->buf[0] = 0x67452301;
ctx->buf[1] = 0xefcdab89;
ctx->buf[2] = 0x98badcfe;
ctx->buf[3] = 0x10325476;
ctx->bits[0] = 0;
ctx->bits[1] = 0;
}
/*
* The core of the MD5 algorithm, this alters an existing MD5 hash to reflect the addition of 16 longwords of new data.
* MD5Update blocks the data and converts bytes into longwords for this routine.
*/
void MD5Transform( uint32 buf[4], uint32 const in[16] )
{
register uint32 a, b, c, d;
a = buf[0];
b = buf[1];
c = buf[2];
d = buf[3];
MD5STEP( F1, a, b, c, d, in[0] + 0xd76aa478, 7 );
MD5STEP( F1, d, a, b, c, in[1] + 0xe8c7b756, 12 );
MD5STEP( F1, c, d, a, b, in[2] + 0x242070db, 17 );
MD5STEP( F1, b, c, d, a, in[3] + 0xc1bdceee, 22 );
MD5STEP( F1, a, b, c, d, in[4] + 0xf57c0faf, 7 );
MD5STEP( F1, d, a, b, c, in[5] + 0x4787c62a, 12 );
MD5STEP( F1, c, d, a, b, in[6] + 0xa8304613, 17 );
MD5STEP( F1, b, c, d, a, in[7] + 0xfd469501, 22 );
MD5STEP( F1, a, b, c, d, in[8] + 0x698098d8, 7 );
MD5STEP( F1, d, a, b, c, in[9] + 0x8b44f7af, 12 );
MD5STEP( F1, c, d, a, b, in[10] + 0xffff5bb1, 17 );
MD5STEP( F1, b, c, d, a, in[11] + 0x895cd7be, 22 );
MD5STEP( F1, a, b, c, d, in[12] + 0x6b901122, 7 );
MD5STEP( F1, d, a, b, c, in[13] + 0xfd987193, 12 );
MD5STEP( F1, c, d, a, b, in[14] + 0xa679438e, 17 );
MD5STEP( F1, b, c, d, a, in[15] + 0x49b40821, 22 );
MD5STEP( F2, a, b, c, d, in[1] + 0xf61e2562, 5 );
MD5STEP( F2, d, a, b, c, in[6] + 0xc040b340, 9 );
MD5STEP( F2, c, d, a, b, in[11] + 0x265e5a51, 14 );
MD5STEP( F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20 );
MD5STEP( F2, a, b, c, d, in[5] + 0xd62f105d, 5 );
MD5STEP( F2, d, a, b, c, in[10] + 0x02441453, 9 );
MD5STEP( F2, c, d, a, b, in[15] + 0xd8a1e681, 14 );
MD5STEP( F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20 );
MD5STEP( F2, a, b, c, d, in[9] + 0x21e1cde6, 5 );
MD5STEP( F2, d, a, b, c, in[14] + 0xc33707d6, 9 );
MD5STEP( F2, c, d, a, b, in[3] + 0xf4d50d87, 14 );
MD5STEP( F2, b, c, d, a, in[8] + 0x455a14ed, 20 );
MD5STEP( F2, a, b, c, d, in[13] + 0xa9e3e905, 5 );
MD5STEP( F2, d, a, b, c, in[2] + 0xfcefa3f8, 9 );
MD5STEP( F2, c, d, a, b, in[7] + 0x676f02d9, 14 );
MD5STEP( F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20 );
MD5STEP( F3, a, b, c, d, in[5] + 0xfffa3942, 4 );
MD5STEP( F3, d, a, b, c, in[8] + 0x8771f681, 11 );
MD5STEP( F3, c, d, a, b, in[11] + 0x6d9d6122, 16 );
MD5STEP( F3, b, c, d, a, in[14] + 0xfde5380c, 23 );
MD5STEP( F3, a, b, c, d, in[1] + 0xa4beea44, 4 );
MD5STEP( F3, d, a, b, c, in[4] + 0x4bdecfa9, 11 );
MD5STEP( F3, c, d, a, b, in[7] + 0xf6bb4b60, 16 );
MD5STEP( F3, b, c, d, a, in[10] + 0xbebfbc70, 23 );
MD5STEP( F3, a, b, c, d, in[13] + 0x289b7ec6, 4 );
MD5STEP( F3, d, a, b, c, in[0] + 0xeaa127fa, 11 );
MD5STEP( F3, c, d, a, b, in[3] + 0xd4ef3085, 16 );
MD5STEP( F3, b, c, d, a, in[6] + 0x04881d05, 23 );
MD5STEP( F3, a, b, c, d, in[9] + 0xd9d4d039, 4 );
MD5STEP( F3, d, a, b, c, in[12] + 0xe6db99e5, 11 );
MD5STEP( F3, c, d, a, b, in[15] + 0x1fa27cf8, 16 );
MD5STEP( F3, b, c, d, a, in[2] + 0xc4ac5665, 23 );
MD5STEP( F4, a, b, c, d, in[0] + 0xf4292244, 6 );
MD5STEP( F4, d, a, b, c, in[7] + 0x432aff97, 10 );
MD5STEP( F4, c, d, a, b, in[14] + 0xab9423a7, 15 );
MD5STEP( F4, b, c, d, a, in[5] + 0xfc93a039, 21 );
MD5STEP( F4, a, b, c, d, in[12] + 0x655b59c3, 6 );
MD5STEP( F4, d, a, b, c, in[3] + 0x8f0ccc92, 10 );
MD5STEP( F4, c, d, a, b, in[10] + 0xffeff47d, 15 );
MD5STEP( F4, b, c, d, a, in[1] + 0x85845dd1, 21 );
MD5STEP( F4, a, b, c, d, in[8] + 0x6fa87e4f, 6 );
MD5STEP( F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10 );
MD5STEP( F4, c, d, a, b, in[6] + 0xa3014314, 15 );
MD5STEP( F4, b, c, d, a, in[13] + 0x4e0811a1, 21 );
MD5STEP( F4, a, b, c, d, in[4] + 0xf7537e82, 6 );
MD5STEP( F4, d, a, b, c, in[11] + 0xbd3af235, 10 );
MD5STEP( F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15 );
MD5STEP( F4, b, c, d, a, in[9] + 0xeb86d391, 21 );
buf[0] += a;
buf[1] += b;
buf[2] += c;
buf[3] += d;
}
/*
* Update context to reflect the concatenation of another buffer full of bytes.
*/
void MD5Update( struct MD5Context *ctx, unsigned char const *buf, unsigned len )
{
uint32 t;
/* Update bitcount */
t = ctx->bits[0];
if( ( ctx->bits[0] = t + ( (uint32) len << 3 ) ) < t )
ctx->bits[1]++; /* Carry from low to high */
ctx->bits[1] += len >> 29;
t = ( t >> 3 ) & 0x3f; /* Bytes already in shsInfo->data */
/* Handle any leading odd-sized chunks */
if( t )
{
unsigned char *p = (unsigned char*)ctx->in + t;
t = 64 - t;
if( len < t )
{
memcpy( p, buf, len );
return;
}
memcpy( p, buf, t );
MD5Transform( ctx->buf, (uint32*)ctx->in );
buf += t;
len -= t;
}
/* Process data in 64-byte chunks */
while( len >= 64 )
{
memcpy( ctx->in, buf, 64 );
MD5Transform( ctx->buf, (uint32*)ctx->in );
buf += 64;
len -= 64;
}
/* Handle any remaining bytes of data. */
memcpy( ctx->in, buf, len );
}
/*
* Final wrapup - pad to 64-byte boundary with the bit pattern 1 0* (64-bit count of bits processed, MSB-first)
*/
void MD5Final( unsigned char digest[16], struct MD5Context *ctx )
{
unsigned count;
unsigned char *p;
/* Compute number of bytes mod 64 */
count = ( ctx->bits[0] >> 3 ) & 0x3F;
/* Set the first char of padding to 0x80. This is safe since there is always at least one byte free */
p = ctx->in + count;
*p++ = 0x80;
/* Bytes of padding needed to make 64 bytes */
count = 64 - 1 - count;
/* Pad out to 56 mod 64 */
if( count < 8 )
{
/* Two lots of padding: Pad the first block to 64 bytes */
memset( p, 0, count );
MD5Transform( ctx->buf, (uint32*)ctx->in );
/* Now fill the next block with 56 bytes */
memset( ctx->in, 0, 56 );
}
else
{
/* Pad block to 56 bytes */
memset( p, 0, count - 8 );
}
/* Append length in bits and transform */
((uint32*)ctx->in)[14] = ctx->bits[0];
((uint32*)ctx->in)[15] = ctx->bits[1];
MD5Transform( ctx->buf, (uint32*)ctx->in );
memcpy( digest, ctx->buf, 16 );
memset( ctx, 0, sizeof(ctx) ); /* In case it's sensitive */
}
int md5( char *file )
{
unsigned char buf[1024];
MD5_CTX ctx;
FILE *fp;
int n;
if( ( fp = fopen( file, "rb" ) ) == NULL )
return -1;
MD5Init( &ctx );
while( ( n = fread( buf, 1, sizeof(buf), fp ) ) > 0 )
MD5Update( &ctx, buf, n );
MD5Final( digest, &ctx );
if( ferror( fp ) )
{
fclose( fp );
return -2;
}
fclose(fp);
return 0;
}
uint32 getUL( unsigned char *bytes )
{
return ((uint32)bytes[3])
+ (((uint32)bytes[2])<<8)
+ (((uint32)bytes[1])<<16)
+ (((uint32)bytes[0])<<24);
}
volatile void Usage( int retval )
{
printf( "Use: mkswinfo [--format] [-f{1-7}=] [-v{1-6}=]\n" );
exit( retval );
}
int main( int argc, char *argv[] )
{
unsigned char *data = (unsigned char*)&swinfo;
char *fname;
FILE *fp;
int i, x;
uint32 cs;
if( argc < 2 )
Usage(1);
fname = argv[1];
if( ( fp = fopen( fname, "rb" ) ) == NULL )
{
printf( "error opening file\n" );
return( 2 );
}
fread( data, 1, LEN, fp );
fclose( fp );
if( argc > 2 )
{
argc -= 2;
argv += 2;
while( argc-- )
{
char *parm = *argv++;
if( parm[0] == '-' )
{
switch( parm[1] )
{
case 'f':
x = parm[2] - '0';
if( x < 0 || x > 6 || parm[3] != '=' )
Usage( 2 );
if( md5( parm+4 ) == 0 )
{
strncpy( swinfo.field[x].name, parm+4, 15 );
memcpy( swinfo.field[x].md5sum, digest, 16 );
}
else
printf( "File '%s' not found!\n", parm+4 );
break;
case 'v':
x = parm[2] - '0';
if( x < 0 || x > 6 || parm[3] != '=' )
Usage( 2 );
strncpy( swinfo.field[x].version, parm+4, 4 );
break;
case '-':
if( !strcmp( parm+2, "format" ) )
{
memset( (void*)swinfo.field, 0, sizeof(swinfo.field) );
argc = 0;
}
break;
}
}
else
Usage( 1 );
}
/* create new swfile checksum */
cs = 0x8E58C192;
for( x = 0; x < LEN-4; x += 4 )
cs ^= getUL( &data[x] );
data[LEN-4] = (cs>>24) & 0xff;
data[LEN-3] = (cs>>16) & 0xff;
data[LEN-2] = (cs>> 8) & 0xff;
data[LEN-1] = (cs) & 0xff;
if( ( fp = fopen( fname, "wb" ) ) != NULL )
{
fwrite( data, 1, LEN, fp );
fclose( fp );
}
else
{
printf( "error writing file\n" );
return( 3 );
}
}
for( x = 0; x < 7; ++x )
{
if( x == 0 )
printf( "FULL UPDATE FILE '%s'\nMD5=", swinfo.field[x].name );
else
printf( "%d. PARTIAL UPDATE FILE '%s'\nMD5=", x, swinfo.field[x].name );
for( i = 0; i < 16; ++i )
printf( "%02X", swinfo.field[x].md5sum[i] );
if( md5( swinfo.field[x].name ) == 0 )
printf( " %s", memcmp( digest, swinfo.field[x].md5sum, 16 ) ? "(NOT OK!)" : "(OK)" );
else
printf( " (NOT FOUND)" );
printf( "\nVersion: %s\n\n", swinfo.field[x].version );
}
return 0;
}