moo_chksum() - calculates md5sum
Yevgen Muntyan
parent
bc319c28f2
commit
290b9fae7c
|
|
@ -54,6 +54,8 @@ mooutils_sources = \
|
|||
$(mooutils)/mooaction.c \
|
||||
$(mooutils)/mooactiongroup.c \
|
||||
$(mooutils)/moobigpaned.c \
|
||||
$(mooutils)/moocksum.h \
|
||||
$(mooutils)/moocksum.c \
|
||||
$(mooutils)/mooclosure.c \
|
||||
$(mooutils)/moocmd.c \
|
||||
$(mooutils)/moocombo.c \
|
||||
|
|
|
|||
|
|
@ -0,0 +1,351 @@
|
|||
/*
|
||||
md5.c found on the web and in gazillion projects out there
|
||||
glibified a bit
|
||||
*/
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "mooutils/moocksum.h"
|
||||
#include <string.h>
|
||||
|
||||
|
||||
typedef struct _MD5Context MD5Context;
|
||||
|
||||
struct _MD5Context {
|
||||
guint32 buf[4];
|
||||
guint32 bits[2];
|
||||
guchar in[64];
|
||||
};
|
||||
|
||||
|
||||
static void MD5Init (MD5Context *context);
|
||||
static void MD5Update (MD5Context *context,
|
||||
guchar const *buf,
|
||||
guint len);
|
||||
static void MD5Final (guchar digest[16],
|
||||
MD5Context *context);
|
||||
static void MD5Transform (guint32 buf[4],
|
||||
guint32 const in[16]);
|
||||
|
||||
|
||||
#if G_BYTE_ORDER == G_BIG_ENDIAN
|
||||
void byteReverse(guchar *buf, unsigned longs);
|
||||
#else
|
||||
#define byteReverse(buf, len) /* Nothing */
|
||||
#endif
|
||||
|
||||
|
||||
#if G_BYTE_ORDER == G_BIG_ENDIAN
|
||||
void
|
||||
byteReverse (guchar *buf, unsigned longs)
|
||||
{
|
||||
guint32 t;
|
||||
do {
|
||||
t = (guint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
|
||||
((unsigned) buf[1] << 8 | buf[0]);
|
||||
*(guint32 *) buf = t;
|
||||
buf += 4;
|
||||
} while (--longs);
|
||||
}
|
||||
#endif
|
||||
|
||||
/*
|
||||
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
|
||||
* initialization constants.
|
||||
*/
|
||||
void
|
||||
MD5Init (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;
|
||||
}
|
||||
|
||||
/*
|
||||
* Update context to reflect the concatenation of another buffer full
|
||||
* of bytes.
|
||||
*/
|
||||
void
|
||||
MD5Update (MD5Context *ctx,
|
||||
guchar const *buf,
|
||||
unsigned len)
|
||||
{
|
||||
guint32 t;
|
||||
|
||||
/* Update bitcount */
|
||||
|
||||
t = ctx->bits[0];
|
||||
if ((ctx->bits[0] = t + ((guint32) 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)
|
||||
{
|
||||
guchar *p = (guchar *) ctx->in + t;
|
||||
|
||||
t = 64 - t;
|
||||
if (len < t)
|
||||
{
|
||||
memcpy(p, buf, len);
|
||||
return;
|
||||
}
|
||||
memcpy(p, buf, t);
|
||||
byteReverse(ctx->in, 16);
|
||||
MD5Transform(ctx->buf, (guint32 *) ctx->in);
|
||||
buf += t;
|
||||
len -= t;
|
||||
}
|
||||
/* Process data in 64-byte chunks */
|
||||
|
||||
while (len >= 64)
|
||||
{
|
||||
memcpy(ctx->in, buf, 64);
|
||||
byteReverse(ctx->in, 16);
|
||||
MD5Transform(ctx->buf, (guint32 *) 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 (guchar digest[16],
|
||||
MD5Context *ctx)
|
||||
{
|
||||
unsigned count;
|
||||
guchar *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);
|
||||
byteReverse(ctx->in, 16);
|
||||
MD5Transform(ctx->buf, (guint32 *) 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);
|
||||
}
|
||||
byteReverse(ctx->in, 14);
|
||||
|
||||
/* Append length in bits and transform */
|
||||
((guint32 *) ctx->in)[14] = ctx->bits[0];
|
||||
((guint32 *) ctx->in)[15] = ctx->bits[1];
|
||||
|
||||
MD5Transform(ctx->buf, (guint32 *) ctx->in);
|
||||
byteReverse((guchar *) ctx->buf, 4);
|
||||
memcpy(digest, ctx->buf, 16);
|
||||
memset((char *) ctx, 0, sizeof(ctx)); /* In case it's sensitive */
|
||||
}
|
||||
|
||||
/* The four core functions - F1 is optimized somewhat */
|
||||
|
||||
/* #define F1(x, y, z) (x & y | ~x & z) */
|
||||
#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<<s | w>>(32-s), w += x )
|
||||
|
||||
/*
|
||||
* 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 (guint32 buf[4],
|
||||
guint32 const in[16])
|
||||
{
|
||||
register guint32 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;
|
||||
}
|
||||
|
||||
|
||||
char *
|
||||
moo_cksum_for_buffer (const char *input,
|
||||
int length)
|
||||
{
|
||||
MD5Context context;
|
||||
guchar digest[16];
|
||||
char *string;
|
||||
int i;
|
||||
char print[16] = {
|
||||
'0', '1', '2', '3', '4', '5', '6', '7',
|
||||
'8', '9', 'a', 'b', 'c', 'd', 'e', 'f',
|
||||
};
|
||||
|
||||
g_return_val_if_fail (input != NULL, NULL);
|
||||
|
||||
if (length < 0)
|
||||
length = strlen (input);
|
||||
|
||||
MD5Init (&context);
|
||||
MD5Update (&context, (const guchar *) input, length);
|
||||
MD5Final (digest, &context);
|
||||
|
||||
string = g_new (char, 33);
|
||||
string[32] = 0;
|
||||
|
||||
for (i = 0; i < 16; ++i)
|
||||
{
|
||||
string[2*i] = print[digest[i] >> 4];
|
||||
string[2*i+1] = print[digest[i] & (guchar)0x0f];
|
||||
}
|
||||
|
||||
return string;
|
||||
}
|
||||
|
||||
|
||||
char *
|
||||
moo_cksum (const char *path)
|
||||
{
|
||||
GMappedFile *file;
|
||||
char *sum;
|
||||
int len;
|
||||
|
||||
g_return_val_if_fail (path != NULL, NULL);
|
||||
|
||||
file = g_mapped_file_new (path, FALSE, NULL);
|
||||
|
||||
if (!file)
|
||||
return NULL;
|
||||
|
||||
if (g_mapped_file_get_length (file) > G_MAXINT)
|
||||
{
|
||||
g_warning ("%s: file '%s' too big", G_STRLOC, path);
|
||||
len = G_MAXINT;
|
||||
}
|
||||
else
|
||||
{
|
||||
len = g_mapped_file_get_length (file);
|
||||
}
|
||||
|
||||
sum = moo_cksum_for_buffer (g_mapped_file_get_contents (file), len);
|
||||
|
||||
g_mapped_file_free (file);
|
||||
return sum;
|
||||
}
|
||||
|
|
@ -0,0 +1,30 @@
|
|||
/*
|
||||
* moocksum.h
|
||||
*
|
||||
* Copyright (C) 2004-2006 by Yevgen Muntyan <muntyan@math.tamu.edu>
|
||||
*
|
||||
* 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 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* See COPYING file that comes with this distribution.
|
||||
*/
|
||||
|
||||
#ifndef __MOO_CKSUM_H__
|
||||
#define __MOO_CKSUM_H__
|
||||
|
||||
#include <glib.h>
|
||||
|
||||
G_BEGIN_DECLS
|
||||
|
||||
|
||||
/* md5sum */
|
||||
char *moo_cksum_for_buffer (const char *input,
|
||||
gssize length);
|
||||
char *moo_cksum (const char *path);
|
||||
|
||||
|
||||
G_END_DECLS
|
||||
|
||||
#endif /* __MOO_CKSUM_H__ */
|
||||
|
|
@ -1,4 +1,4 @@
|
|||
EXTRA_PROGRAMS += testhtml testtext medit mterm markup termbuffer testfileview testpaned testpanedfileview miniglade langparser testobject testfold ms
|
||||
EXTRA_PROGRAMS += testhtml testtext medit mterm markup termbuffer testfileview testpaned testpanedfileview miniglade langparser testobject testfold ms testcksum
|
||||
bin_PROGRAMS =
|
||||
|
||||
all-tests: $(EXTRA_PROGRAMS)
|
||||
|
|
@ -74,6 +74,8 @@ ldflags += -mwindows
|
|||
endif MOO_OS_MINGW
|
||||
|
||||
|
||||
all_moo_sources = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
|
||||
##############################################################################
|
||||
## medit
|
||||
##
|
||||
|
|
@ -97,7 +99,7 @@ testfold_LDFLAGS = $(ldflags)
|
|||
testfold_LDADD = $(ldadd)
|
||||
testfold_SOURCES = tests/testfold.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_testfold_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testfold_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -105,7 +107,7 @@ testtext_LDFLAGS = $(ldflags)
|
|||
testtext_LDADD = $(ldadd)
|
||||
testtext_SOURCES = tests/testtext.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_testtext_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testtext_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -113,21 +115,21 @@ langparser_LDFLAGS = $(ldflags)
|
|||
langparser_LDADD = $(ldadd)
|
||||
langparser_SOURCES = tests/testparser.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_langparser_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_langparser_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
ms_LDFLAGS = $(ldflags)
|
||||
ms_LDADD = $(ldadd) -lreadline
|
||||
ms_SOURCES = tests/mscript.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_ms_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_ms_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
testhtml_LDFLAGS = $(ldflags)
|
||||
testhtml_LDADD = $(ldadd)
|
||||
testhtml_SOURCES = tests/testhtml.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_testhtml_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testhtml_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -135,14 +137,14 @@ mterm_LDFLAGS = $(ldflags)
|
|||
mterm_LDADD = $(ldadd)
|
||||
mterm_SOURCES = tests/mterm.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_mterm_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_mterm_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
termbuffer_LDFLAGS = $(ldflags)
|
||||
termbuffer_LDADD = $(ldadd)
|
||||
termbuffer_SOURCES = tests/termbuffer.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_termbuffer_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_termbuffer_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -154,7 +156,7 @@ markup_LDADD = $(ldadd)
|
|||
|
||||
markup_SOURCES = tests/markup.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_markup_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_markup_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -166,7 +168,7 @@ miniglade_LDADD = $(ldadd)
|
|||
|
||||
miniglade_SOURCES = tests/miniglade.c
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_miniglade_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_miniglade_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
||||
|
||||
|
|
@ -188,9 +190,14 @@ testobject_LDFLAGS = $(ldflags)
|
|||
testobject_LDADD = $(ldadd)
|
||||
testobject_SOURCES = tests/testobject.c
|
||||
|
||||
testcksum_LDFLAGS = $(ldflags)
|
||||
testcksum_LDADD = $(ldadd)
|
||||
testcksum_SOURCES = tests/testcksum.c
|
||||
|
||||
if !MOO_BUILD_LIB
|
||||
nodist_testpaned_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testfileview_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testpanedfileview_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testobject_SOURCES = $(libmoo_sources) $(nodist_libmoo_sources)
|
||||
nodist_testpaned_SOURCES = $(all_moo_sources)
|
||||
nodist_testfileview_SOURCES = $(all_moo_sources)
|
||||
nodist_testpanedfileview_SOURCES = $(all_moo_sources)
|
||||
nodist_testobject_SOURCES = $(all_moo_sources)
|
||||
nodist_testcksum_SOURCES = $(all_moo_sources)
|
||||
endif
|
||||
|
|
|
|||
|
|
@ -0,0 +1,24 @@
|
|||
#include "mooutils/moocksum.h"
|
||||
#include <gtk/gtk.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
|
||||
int main (int argc, char *argv[])
|
||||
{
|
||||
int i;
|
||||
|
||||
if (argc < 2)
|
||||
{
|
||||
g_print ("usage: %s <file> [<file2> ...]\n", argv[0]);
|
||||
exit (1);
|
||||
}
|
||||
|
||||
for (i = 1; i < argc; ++i)
|
||||
{
|
||||
char *sum = moo_cksum (argv[i]);
|
||||
g_print ("%s %s\n", sum ? sum : "*** ERROR ***", argv[i]);
|
||||
g_free (sum);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
Loading…
Reference in New Issue