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
|
/*
* UNG's Not GNU
*
* Copyright (c) 2022, Jakob Kaivo <jkk@ung.org>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#define _POSIX_C_SOURCE 200809L
#include <errno.h>
#include <inttypes.h>
#include <libgen.h>
#include <limits.h>
#include <locale.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#define UINT16_BIT (16)
#define BLOCK_SIZE (512)
enum algorithm { UNSPECIFIED, ALTERNATIVE };
struct sum {
uintmax_t size;
uintmax_t sum;
};
static struct sum sum_obsolete(FILE *f, int alt)
{
struct sum sum = { 0 };
int c;
while ((c = fgetc(f)) != EOF) {
sum.size++;
if (alt) {
sum.sum = (sum.sum >> 1) +
((sum.sum & 1) << (UINT16_BIT - 1));
}
sum.sum += c;
if (alt) {
sum.sum &= UINT16_MAX;
}
}
sum.sum = (sum.sum & UINT16_MAX) + (sum.sum >> UINT16_BIT);
/* obsolete sum program prints number of 512 byte blocks */
if (sum.size % BLOCK_SIZE != 0) {
sum.size += BLOCK_SIZE;
}
sum.size /= BLOCK_SIZE;
return sum;
}
static struct sum sum_unspecified(FILE *f)
{
return sum_obsolete(f, 0);
}
static struct sum sum_alternative(FILE *f)
{
return sum_obsolete(f, 1);
}
int cksum(const char *path, enum algorithm alg)
{
FILE *f = stdin;
if (path && strcmp(path, "-")) {
f = fopen(path, "rb");
}
if (f == NULL) {
fprintf(stderr, "sum: %s: %s\n", path, strerror(errno));
return 1;
}
struct sum sum;
switch (alg) {
case UNSPECIFIED:
sum = sum_unspecified(f);
break;
case ALTERNATIVE:
sum = sum_alternative(f);
break;
default:
break;
}
printf("%"PRIuMAX" %"PRIuMAX"", sum.sum, sum.size);
if (f != stdin) {
printf(" %s", path);
fclose(f);
}
putchar('\n');
return 0;
}
int main(int argc, char *argv[])
{
setlocale(LC_ALL, "");
fprintf(stderr, "sum: utility is obsolete; use cksum\n");
enum algorithm alg = UNSPECIFIED;
int c;
while ((c = getopt(argc, argv, "r")) != -1) {
switch (c) {
case 'r':
alg = ALTERNATIVE;
break;
default:
return 1;
}
}
int r = 0;
do {
r |= cksum(argv[optind++], alg);
} while (optind < argc);
return r;
}
|
