1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
#-*- perl -*-
#
# Copyright (C) 2001 Ken'ichi Fukamachi
# All rights reserved. This program is free software; you can
# redistribute it and/or modify it under the same terms as Perl itself.
#
# $Id$
# $FML$
#
package FML::Checksum;
use strict;
use vars qw(@ISA @EXPORT @EXPORT_OK $AUTOLOAD);
use Carp;
use FML::Log qw(Log);
=head1 NAME
FML::Checksum - utilities for check sum
=head1 SYNOPSIS
use FML::Checksum;
$cksum = new FML::Checksum;
$md5sum = $cksum->md5( \$string );
=head1 METHODS
=head2 C<new()>
the constructor.
It checks we can use MD5 perl module or we need to use some programs
e.g. C<md5>, C<cksum>, et.al.
=cut
require Exporter;
@ISA = qw(Exporter);
sub new
{
my ($self, $args) = @_;
my ($type) = ref($self) || $self;
my $me = {};
_init($me, $args);
return bless $me, $type;
}
sub _init
{
my ($self, $args) = @_;
if (defined $args->{ program }) {
$self->{ _program } = $args->{ program };
}
my $pkg = 'MD5';
eval qq{ require $pkg; $pkg->import();};
unless ($@) {
$self->{ _type } = 'native';
}
else {
eval qq{ require File::Utils; import File::Utils qw(search_program);};
my $prog = search_program('md5') || search_program('md5sum');
if (defined $prog) {
$self->{ _program } = $prog;
}
}
}
=head2 C<md5(\$string)>
return the md5 checksum of C<$string>.
=cut
sub md5
{
my ($self, $r_data) = @_;
if ($self->{ _type } eq 'native') {
$self->_md5_native($r_data);
}
else {
$self->_md5_by_program($r_data);
}
}
sub _md5_native
{
my ($self, $r_data) = @_;
my ($buf, $p, $pe);
$pe = length($$r_data);
my $md5;
eval q{ $md5 = new MD5;};
$md5->reset();
$p = 0;
while (1) {
last if $p > $pe;
$_ = substr($$r_data, $p, 128);
$p += 128;
$md5->add($_);
}
$md5->hexdigest();
}
sub _md5_by_program
{
my ($self, $r_data) = @_;
if (defined $self->{ _program }) {
my $program = $self->{ _program };
use FileHandle;
my ($rh, $wh) = FileHandle::pipe;
eval qq{ require IPC::Open2; IPC::Open2->import();};
my $pid = open2($rh, $wh, $self->{ _program });
if (defined $pid) {
print $wh $$r_data;
close($wh);
my $cksum = 0;
sysread($rh, $cksum, 1024);
$cksum =~ s/[\s\n]*$//;
close($rh);
return $cksum if $cksum;
}
}
undef;
}
=head2 C<cksum1($file)>
C<not implemented>.
This is a 16-bit checksum. The algorithm used by historic BSD systems
as the sum(1) algorithm and by historic AT&T System V UNIX systems as
the sum algorithm when using the C<-r> option.
=head2 C<cksum2($file)>
return the traditional checksum of the given C<$file>.
This is a 32-bit checksum. The algorithm used by historic AT&T System
V UNIX systems as the default sum algorithm.
See POSIX 1003.2 for more details.
=cut
sub cksum2
{
my ($self, $f) = @_;
my ($crc, $total, $nr, $buf, $r);
$crc = $total = 0;
if (open($f, $f)) {
while (($nr = sysread($f, $buf, 1024)) > 0) {
my ($i) = 0;
$total += $nr;
for ($i = 0; $i < $nr; $i++) {
$r = substr($buf, $i, 1);
$crc += ord($r);
}
}
close($f);
$crc = ($crc & 0xffff) + ($crc >> 16);
$crc = ($crc & 0xffff) + ($crc >> 16);
}
else {
Log("ERROR: no such file $f");
}
($crc, $total);
}
=head2 C<crc($file)>
C<not implemented>.
The default CRC used is based on the polynomial used for CRC error
checking in the networking standard ISO 8802-3:1989 The CRC checksum
encoding is defined by the generating polynomial:
G(x) = x^32 + x^26 + x^23 + x^22 + x^16 + x^12 +
x^11 + x^10 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1
Mathematically, the CRC value corresponding to a given file is defined
by the following procedure:
The n bits to be evaluated are considered to be the coefficients of
a mod 2 polynomial M(x) of degree n-1. These n bits are the bits
from the file, with the most significant bit being the most signif-
icant bit of the first octet of the file and the last bit being the
least significant bit of the last octet, padded with zero bits (if
necessary) to achieve an integral number of octets, followed by one
or more octets representing the length of the file as a binary val-
ue, least significant octet first. The smallest number of octets
capable of representing this integer are used.
M(x) is multiplied by x^32 (i.e., shifted left 32 bits) and divided
by G(x) using mod 2 division, producing a remainder R(x) of degree
<= 31.
The coefficients of R(x) are considered to be a 32-bit sequence.
The bit sequence is complemented and the result is the CRC.
=head1 AUTHOR
Ken'ichi Fukamachi
=head1 COPYRIGHT
Copyright (C) 2001 Ken'ichi Fukamachi
All rights reserved. This program is free software; you can
redistribute it and/or modify it under the same terms as Perl itself.
=head1 HISTORY
FML::Checksum appeared in fml5 mailing list driver package.
See C<http://www.fml.org/> for more details.
=cut
1;
|
