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
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
|
/* $OpenBSD: cal.c,v 1.24 2009/01/01 21:07:17 otto Exp $ */
/* $NetBSD: cal.c,v 1.6 1995/03/26 03:10:24 glass Exp $ */
/*
* Copyright (c) 1989, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Kim Letkeman.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
static const char copyright[] =
"@(#) Copyright (c) 1989, 1993, 1994\n\
The Regents of the University of California. All rights reserved.\n";
#if 0
static char sccsid[] = "@(#)cal.c 8.4 (Berkeley) 4/2/94";
#else
static const char rcsid[] = "$OpenBSD: cal.c,v 1.24 2009/01/01 21:07:17 otto Exp $";
#endif
#endif /* not lint */
#include <sys/types.h>
#include <ctype.h>
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <tzfile.h>
#include <unistd.h>
#define THURSDAY 4 /* for reformation */
#define SATURDAY 6 /* 1 Jan 1 was a Saturday */
#define FIRST_MISSING_DAY 639799 /* 3 Sep 1752 */
#define NUMBER_MISSING_DAYS 11 /* 11 day correction */
#define MAXDAYS 42 /* max slots in a month array */
#define SPACE -1 /* used in day array */
static const int days_in_month[2][13] = {
{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
{0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
};
const int sep1752s[MAXDAYS] = {
SPACE, SPACE, 1, 2, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23,
24, 25, 26, 27, 28, 29, 30,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, sep1752m[MAXDAYS] = {
SPACE, 1, 2, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, sep1752js[MAXDAYS] = {
SPACE, SPACE, 245, 246, 258, 259, 260,
261, 262, 263, 264, 265, 266, 267,
268, 269, 270, 271, 272, 273, 274,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, sep1752jm[MAXDAYS] = {
SPACE, 245, 246, 258, 259, 260, 261,
262, 263, 264, 265, 266, 267, 268,
269, 270, 271, 272, 273, 274, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, empty[MAXDAYS] = {
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
};
const char *month_names[12] = {
"January", "February", "March", "April", "May", "June",
"July", "August", "September", "October", "November", "December",
};
#define DAY_HEADINGS_S "Su Mo Tu We Th Fr Sa"
#define DAY_HEADINGS_M "Mo Tu We Th Fr Sa Su"
#define DAY_HEADINGS_JS " Su Mo Tu We Th Fr Sa"
#define DAY_HEADINGS_JM " Mo Tu We Th Fr Sa Su"
const int *sep1752 = NULL;
const char *day_headings = NULL;
/* leap year -- account for gregorian reformation in 1752 */
#define leap_year(yr) \
((yr) <= 1752 ? !((yr) % 4) : \
(!((yr) % 4) && ((yr) % 100)) || !((yr) % 400))
/* number of centuries since 1700, not inclusive */
#define centuries_since_1700(yr) \
((yr) > 1700 ? (yr) / 100 - 17 : 0)
/* number of centuries since 1700 whose modulo of 400 is 0 */
#define quad_centuries_since_1700(yr) \
((yr) > 1600 ? ((yr) - 1600) / 400 : 0)
/* number of leap years between year 1 and this year, not inclusive */
#define leap_years_since_year_1(yr) \
((yr) / 4 - centuries_since_1700(yr) + quad_centuries_since_1700(yr))
int julian;
int mflag = 0;
int wflag = 0;
void ascii_day(char *, int);
void center(const char *, int, int);
void day_array(int, int, int *);
int day_in_week(int, int, int);
int day_in_year(int, int, int);
int week(int, int, int);
int isoweek(int, int, int);
void j_yearly(int);
void monthly(int, int);
void trim_trailing_spaces(char *);
void usage(void);
void yearly(int);
int parsemonth(const char *);
int
main(int argc, char *argv[])
{
struct tm *local_time;
time_t now;
int ch, month, year, yflag;
const char *errstr;
yflag = year = 0;
while ((ch = getopt(argc, argv, "jmwy")) != -1)
switch(ch) {
case 'j':
julian = 1;
break;
case 'm':
mflag = 1;
break;
case 'w':
wflag = 1;
break;
case 'y':
yflag = 1;
break;
case '?':
default:
usage();
}
argc -= optind;
argv += optind;
if (julian && wflag)
usage();
day_headings = DAY_HEADINGS_S;
sep1752 = sep1752s;
if (mflag && julian) {
sep1752 = sep1752jm;
day_headings = DAY_HEADINGS_JM;
} else if (mflag) {
sep1752 = sep1752m;
day_headings = DAY_HEADINGS_M;
} else if (julian) {
sep1752 = sep1752js;
day_headings = DAY_HEADINGS_JS;
}
month = 0;
switch(argc) {
case 2:
month = parsemonth(*argv++);
if (!month)
errx(1, "Unable to parse month");
/* FALLTHROUGH */
case 1:
if (argc == 1 && !isdigit(*argv[0])) {
month = parsemonth(*argv);
if (!month)
errx(1, "illegal year value: use 1-9999");
(void)time(&now);
local_time = localtime(&now);
year = local_time->tm_year + TM_YEAR_BASE;
} else {
year = strtonum(*argv, 1, 9999, &errstr);
if (errstr)
errx(1, "illegal year value: use 1-9999");
}
break;
case 0:
(void)time(&now);
local_time = localtime(&now);
year = local_time->tm_year + TM_YEAR_BASE;
if (!yflag)
month = local_time->tm_mon + 1;
break;
default:
usage();
}
if (month)
monthly(month, year);
else if (julian)
j_yearly(year);
else
yearly(year);
exit(0);
}
#define DAY_LEN 3 /* 3 spaces per day */
#define J_DAY_LEN 4 /* 4 spaces per day */
#define WEEK_LEN 20 /* 7 * 3 - one space at the end */
#define WEEKNUMBER_LEN 5 /* 5 spaces per week number */
#define J_WEEK_LEN 27 /* 7 * 4 - one space at the end */
#define HEAD_SEP 2 /* spaces between day headings */
#define J_HEAD_SEP 2
int
week(int day, int month, int year)
{
int yearday;
int firstweekday;
int weekday;
int firstday;
int firstsunday;
int shift;
if (mflag)
return isoweek(day, month, year);
yearday = day_in_year(day, month, year);
firstweekday = day_in_week(1, 1, year) + 1;
weekday = day_in_week(day, month, year) + 1;
firstday = day_in_year(1, 1, year);
firstsunday = firstday + (8 - firstweekday);
shift = 1;
if (yearday < firstsunday)
return (1);
if (firstweekday > THURSDAY - 1)
shift = 2;
return ((((yearday + 1) - (weekday - 1)) / 7) + shift);
}
int
isoweek(int day, int month, int year)
{
/* http://www.tondering.dk/claus/cal/node8.html */
int a, b, c, s, e, f, g, d, n;
a = month <= 2 ? year - 1 : year;
b = a/4 - a/100 + a/400;
c = (a-1)/4 - (a-1)/100 + (a-1)/400;
s = b - c;
if (month <= 2) {
e = 0;
f = day - 1 + 31 * (month-1);
} else {
e = s + 1;
f = day + ((153 * (month-3) + 2) / 5) + 58 + s;
}
g = (a + b) % 7;
d = (f + g - e) % 7;
n = f + 3 - d;
if (n < 0)
return 53 - (g - s) / 5;
else if (n > 364 + s)
return 1;
else
return n/7 + 1;
}
void
monthly(int month, int year)
{
int col, row, len, days[MAXDAYS], firstday;
char *p, lineout[30];
day_array(month, year, days);
(void)snprintf(lineout, sizeof(lineout), "%s %d",
month_names[month - 1], year);
len = strlen(lineout);
(void)printf("%*s%s\n%s\n",
((julian ? J_WEEK_LEN : WEEK_LEN) - len) / 2, "",
lineout, day_headings);
for (row = 0; row < 6; row++) {
firstday = SPACE;
for (col = 0, p = lineout; col < 7; col++,
p += julian ? J_DAY_LEN : DAY_LEN) {
if (firstday == SPACE && days[row * 7 + col] != SPACE)
firstday = days[row * 7 + col];
ascii_day(p, days[row * 7 + col]);
}
*p = '\0';
trim_trailing_spaces(lineout);
(void)printf("%-20s", lineout);
if (wflag && firstday != SPACE)
printf(" [%2d]", week(firstday, month, year));
printf("\n");
}
}
void
j_yearly(int year)
{
int col, *dp, i, month, row, which_cal;
int days[12][MAXDAYS];
char *p, lineout[80];
(void)snprintf(lineout, sizeof(lineout), "%d", year);
center(lineout, J_WEEK_LEN * 2 + J_HEAD_SEP, 0);
(void)printf("\n\n");
for (i = 0; i < 12; i++)
day_array(i + 1, year, days[i]);
(void)memset(lineout, ' ', sizeof(lineout) - 1);
lineout[sizeof(lineout) - 1] = '\0';
for (month = 0; month < 12; month += 2) {
center(month_names[month], J_WEEK_LEN, J_HEAD_SEP);
center(month_names[month + 1], J_WEEK_LEN, 0);
(void)printf("\n%s%*s%s\n", day_headings,
J_HEAD_SEP, "", day_headings);
for (row = 0; row < 6; row++) {
for (which_cal = 0; which_cal < 2; which_cal++) {
p = lineout + which_cal * (J_WEEK_LEN + 2);
dp = &days[month + which_cal][row * 7];
for (col = 0; col < 7; col++, p += J_DAY_LEN)
ascii_day(p, *dp++);
}
*p = '\0';
trim_trailing_spaces(lineout);
(void)printf("%s\n", lineout);
}
}
(void)printf("\n");
}
void
yearly(int year)
{
int col, *dp, i, month, row, which_cal, week_len, wn, firstday;
int days[12][MAXDAYS];
char *p, lineout[81];
week_len = WEEK_LEN;
if (wflag)
week_len += WEEKNUMBER_LEN;
(void)snprintf(lineout, sizeof(lineout), "%d", year);
center(lineout, week_len * 3 + HEAD_SEP * 2, 0);
(void)printf("\n\n");
for (i = 0; i < 12; i++)
day_array(i + 1, year, days[i]);
(void)memset(lineout, ' ', sizeof(lineout) - 1);
lineout[sizeof(lineout) - 1] = '\0';
for (month = 0; month < 12; month += 3) {
center(month_names[month], week_len, HEAD_SEP);
center(month_names[month + 1], week_len, HEAD_SEP);
center(month_names[month + 2], week_len, 0);
(void)printf("\n%s%*s%s%*s%s\n", day_headings,
HEAD_SEP + (wflag ? WEEKNUMBER_LEN : 0), "", day_headings,
HEAD_SEP + (wflag ? WEEKNUMBER_LEN : 0), "", day_headings);
for (row = 0; row < 6; row++) {
for (which_cal = 0; which_cal < 3; which_cal++) {
p = lineout + which_cal * (week_len + 2);
dp = &days[month + which_cal][row * 7];
firstday = SPACE;
for (col = 0; col < 7; col++, p += DAY_LEN) {
if (firstday == SPACE && *dp != SPACE)
firstday = *dp;
ascii_day(p, *dp++);
}
if (wflag && firstday != SPACE) {
wn = week(firstday,
month + which_cal + 1, year);
(void)snprintf(p, 5, "[%2d]", wn);
p += strlen(p);
*p = ' ';
} else
memset(p, ' ', 4);
}
*p = '\0';
trim_trailing_spaces(lineout);
(void)printf("%s\n", lineout);
}
}
(void)printf("\n");
}
/*
* day_array --
* Fill in an array of 42 integers with a calendar. Assume for a moment
* that you took the (maximum) 6 rows in a calendar and stretched them
* out end to end. You would have 42 numbers or spaces. This routine
* builds that array for any month from Jan. 1 through Dec. 9999.
*/
void
day_array(int month, int year, int *days)
{
int day, dw, dm;
if (month == 9 && year == 1752) {
memmove(days, sep1752, MAXDAYS * sizeof(int));
return;
}
memmove(days, empty, MAXDAYS * sizeof(int));
dm = days_in_month[leap_year(year)][month];
dw = day_in_week(mflag?0:1, month, year);
day = julian ? day_in_year(1, month, year) : 1;
while (dm--)
days[dw++] = day++;
}
/*
* day_in_year --
* return the 1 based day number within the year
*/
int
day_in_year(int day, int month, int year)
{
int i, leap;
leap = leap_year(year);
for (i = 1; i < month; i++)
day += days_in_month[leap][i];
return (day);
}
/*
* day_in_week
* return the 0 based day number for any date from 1 Jan. 1 to
* 31 Dec. 9999. Assumes the Gregorian reformation eliminates
* 3 Sep. 1752 through 13 Sep. 1752. Returns Thursday for all
* missing days.
*/
int
day_in_week(int day, int month, int year)
{
long temp;
temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
+ day_in_year(day, month, year);
if (temp < FIRST_MISSING_DAY)
return ((temp - 1 + SATURDAY) % 7);
if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS))
return (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7);
return (THURSDAY);
}
void
ascii_day(char *p, int day)
{
int display, val;
static const char *aday[] = {
"",
" 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",
};
if (day == SPACE) {
memset(p, ' ', julian ? J_DAY_LEN : DAY_LEN);
return;
}
if (julian) {
val = day / 100;
if (val) {
day %= 100;
*p++ = val + '0';
display = 1;
} else {
*p++ = ' ';
display = 0;
}
val = day / 10;
if (val || display)
*p++ = val + '0';
else
*p++ = ' ';
*p++ = day % 10 + '0';
} else {
*p++ = aday[day][0];
*p++ = aday[day][1];
}
*p = ' ';
}
void
trim_trailing_spaces(char *s)
{
char *p;
for (p = s; *p; ++p)
continue;
while (p > s && isspace(*--p))
continue;
if (p > s)
++p;
*p = '\0';
}
void
center(const char *str, int len, int separate)
{
len -= strlen(str);
(void)printf("%*s%s%*s", len / 2, "", str,
len / 2 + len % 2 + separate, "");
}
void
usage(void)
{
(void)fprintf(stderr, "usage: cal [-jmwy] [month] [year]\n");
exit(1);
}
int
parsemonth(const char *s)
{
struct tm tm;
char *cp;
int v;
v = (int)strtol(s, &cp, 10);
if (*cp != '\0') { /* s wasn't purely numeric */
v = 0;
if ((cp = strptime(s, "%b", &tm)) != NULL && *cp == '\0')
v = tm.tm_mon + 1;
}
if (v <= 0 || v > 12)
errx(1, "invalid month: use 1-12 or a name");
return (v);
}
|