i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

By Philipp John - changed the application cal. It does not crash anymore, when the month and year parameter is invalid.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/trunk/current@5175 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Phil Greenway
2003-10-27 03:56:12 +00:00
parent 922ec7f318
commit 0edb7e893f
1 changed files with 440 additions and 436 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/apps/bin/cal.c
+440 -436
View File
@@ -1,436 +1,440 @@
/* /*
* Copyright (c) 1989, 1993, 1994 * Copyright (c) 1989, 1993, 1994
* The Regents of the University of California. All rights reserved. * The Regents of the University of California. All rights reserved.
* *
* This code is derived from software contributed to Berkeley by * This code is derived from software contributed to Berkeley by
* Kim Letkeman. * Kim Letkeman.
* *
* Redistribution and use in source and binary forms, with or without * Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions * modification, are permitted provided that the following conditions
* are met: * are met:
* 1. Redistributions of source code must retain the above copyright * 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer. * notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright * 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the * notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution. * documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software * 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement: * must display the following acknowledgement:
* This product includes software developed by the University of * This product includes software developed by the University of
* California, Berkeley and its contributors. * California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors * 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software * may be used to endorse or promote products derived from this software
* without specific prior written permission. * without specific prior written permission.
* *
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * 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 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE. * SUCH DAMAGE.
*/ */
#ifndef lint #ifndef lint
static char copyright[] = "@(#) Copyright (c) 1989, 1993, 1994\n\n static char copyright[] = "@(#) Copyright (c) 1989, 1993, 1994\n\n
The Regents of the University of California. All rights reserved.\n"; The Regents of the University of California. All rights reserved.\n";
#endif /* not lint */ #endif /* not lint */
#ifndef lint #ifndef lint
static char sccsid[] = "@(#)cal.c 8.4 (Berkeley) 4/2/94"; static char sccsid[] = "@(#)cal.c 8.4 (Berkeley) 4/2/94";
#endif /* not lint */ #endif /* not lint */
#include <sys/types.h> #include <sys/types.h>
#include <ctype.h> #include <ctype.h>
//#include <err.h> //#include <err.h>
#include <locale.h> #include <locale.h>
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
#include <string.h> #include <string.h>
#include <time.h> #include <time.h>
#include <unistd.h> #include <unistd.h>
#define THURSDAY 4 /* for reformation */ #define THURSDAY 4 /* for reformation */
#define SATURDAY 6 /* 1 Jan 1 was a Saturday */ #define SATURDAY 6 /* 1 Jan 1 was a Saturday */
#define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */ #define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */
#define NUMBER_MISSING_DAYS 11 /* 11 day correction */ #define NUMBER_MISSING_DAYS 11 /* 11 day correction */
#define MAXDAYS 42 /* max slots in a month array */ #define MAXDAYS 42 /* max slots in a month array */
#define SPACE -1 /* used in day array */ #define SPACE -1 /* used in day array */
static int days_in_month[2][13] = { static int days_in_month[2][13] = {
{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}, {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}, {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
}; };
int sep1752[MAXDAYS] = { int sep1752[MAXDAYS] = {
SPACE, SPACE, 1, 2, 14, 15, 16, SPACE, SPACE, 1, 2, 14, 15, 16,
17, 18, 19, 20, 21, 22, 23, 17, 18, 19, 20, 21, 22, 23,
24, 25, 26, 27, 28, 29, 30, 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, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, j_sep1752[MAXDAYS] = { }, j_sep1752[MAXDAYS] = {
SPACE, SPACE, 245, 246, 258, 259, 260, SPACE, SPACE, 245, 246, 258, 259, 260,
261, 262, 263, 264, 265, 266, 267, 261, 262, 263, 264, 265, 266, 267,
268, 269, 270, 271, 272, 273, 274, 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, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE, SPACE,
}, empty[MAXDAYS] = { }, 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,
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,
}; };
char *month_names[12]; char *month_names[12];
char day_headings[] = " "; char day_headings[] = " ";
char j_day_headings[] = " "; char j_day_headings[] = " ";
/* leap year -- account for gregorian reformation in 1752 */ /* leap year -- account for gregorian reformation in 1752 */
#define leap_year(yr) ((yr) <= 1752 ? !((yr) % 4) : !((yr) % 4) && ((yr) % 100) || !((yr) % 400)) #define leap_year(yr) ((yr) <= 1752 ? !((yr) % 4) : !((yr) % 4) && ((yr) % 100) || !((yr) % 400))
/* number of centuries since 1700, not inclusive */ /* number of centuries since 1700, not inclusive */
#define centuries_since_1700(yr) ((yr) > 1700 ? (yr) / 100 - 17 : 0) #define centuries_since_1700(yr) ((yr) > 1700 ? (yr) / 100 - 17 : 0)
/* number of centuries since 1700 whose modulo of 400 is 0 */ /* number of centuries since 1700 whose modulo of 400 is 0 */
#define quad_centuries_since_1700(yr) ((yr) > 1600 ? ((yr) - 1600) / 400 : 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 */ /* 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)) #define leap_years_since_year_1(yr) ((yr) / 4 - centuries_since_1700(yr) + quad_centuries_since_1700(yr))
int julian; int julian;
void ascii_day __P((char *, int)); void ascii_day __P((char *, int));
void center __P((char *, int, int)); void center __P((char *, int, int));
void day_array __P((int, int, int *)); void day_array __P((int, int, int *));
int day_in_week __P((int, int, int)); int day_in_week __P((int, int, int));
int day_in_year __P((int, int, int)); int day_in_year __P((int, int, int));
void j_yearly __P((int)); void j_yearly __P((int));
void monthly __P((int, int)); void monthly __P((int, int));
void trim_trailing_spaces __P((char *)); void trim_trailing_spaces __P((char *));
void usage __P((void)); void usage __P((void));
void yearly __P((int)); void yearly __P((int));
int int
main(argc, argv) main(argc, argv)
int argc; int argc;
char **argv; char **argv;
{ {
struct tm *local_time; struct tm *local_time;
static struct tm zero_tm; static struct tm zero_tm;
time_t now; time_t now;
int ch, month, year, yflag, i; int ch, month, year, yflag, i;
char buf[40]; char buf[40];
(void) setlocale(LC_TIME, ""); (void) setlocale(LC_TIME, "");
yflag = 0; yflag = 0;
while ((ch = getopt(argc, argv, "jy")) != -1) while ((ch = getopt(argc, argv, "jy")) != -1)
switch(ch) { switch(ch) {
case 'j': case 'j':
julian = 1; julian = 1;
break; break;
case 'y': case 'y':
yflag = 1; yflag = 1;
break; break;
case '?': case '?':
default: default:
usage(); usage();
} }
argc -= optind; argc -= optind;
argv += optind; argv += optind;
month = 0; month = 0;
year = 0; year = 0;
switch(argc) { switch(argc) {
case 2: case 2:
if ((month = atoi(*argv++)) < 1 || month > 12) if ((month = atoi(*argv++)) < 1 || month > 12) {
(void)fprintf(stderr,"illegal month value: use 1-12\n"); (void)fprintf(stderr,"illegal month value: use 1-12\n");
/* FALLTHROUGH */ exit(1);
case 1: }
if ((year = atoi(*argv)) < 1 || year > 9999) /* FALLTHROUGH */
(void)fprintf(stderr,"illegal year value: use 1-9999\n"); case 1:
break; if ((year = atoi(*argv)) < 1 || year > 9999) {
case 0: (void)fprintf(stderr,"illegal year value: use 1-9999\n");
(void)time(&now); exit(1);
local_time = localtime(&now); }
year = local_time->tm_year + 1900; break;
if (!yflag) case 0:
month = local_time->tm_mon + 1; (void)time(&now);
break; local_time = localtime(&now);
default: year = local_time->tm_year + 1900;
usage(); if (!yflag)
} month = local_time->tm_mon + 1;
break;
for (i = 0; i < 12; i++) { default:
zero_tm.tm_mon = i; usage();
strftime(buf, sizeof(buf), "%B", &zero_tm); }
month_names[i] = strdup(buf);
} for (i = 0; i < 12; i++) {
for (i = 0; i < 7; i++) { zero_tm.tm_mon = i;
zero_tm.tm_wday = i; strftime(buf, sizeof(buf), "%B", &zero_tm);
strftime(buf, sizeof(buf), "%a", &zero_tm); month_names[i] = strdup(buf);
strncpy(day_headings + i * 3, buf, 2); }
strncpy(j_day_headings + i * 4 + 1, buf, 2); for (i = 0; i < 7; i++) {
} zero_tm.tm_wday = i;
strftime(buf, sizeof(buf), "%a", &zero_tm);
if (month) strncpy(day_headings + i * 3, buf, 2);
monthly(month, year); strncpy(j_day_headings + i * 4 + 1, buf, 2);
else if (julian) }
j_yearly(year);
else if (month)
yearly(year); monthly(month, year);
exit(0); else if (julian)
} j_yearly(year);
else
#define DAY_LEN 3 /* 3 spaces per day */ yearly(year);
#define J_DAY_LEN 4 /* 4 spaces per day */ exit(0);
#define WEEK_LEN 20 /* 7 * 3 - one space at the end */ }
#define J_WEEK_LEN 27 /* 7 * 4 - one space at the end */
#define HEAD_SEP 2 /* spaces between day headings */ #define DAY_LEN 3 /* 3 spaces per day */
#define J_HEAD_SEP 2 #define J_DAY_LEN 4 /* 4 spaces per day */
#define WEEK_LEN 20 /* 7 * 3 - one space at the end */
void #define J_WEEK_LEN 27 /* 7 * 4 - one space at the end */
monthly(month, year) #define HEAD_SEP 2 /* spaces between day headings */
int month, year; #define J_HEAD_SEP 2
{
int col, row, len, days[MAXDAYS]; void
char *p, lineout[30]; monthly(month, year)
int month, year;
day_array(month, year, days); {
len = sprintf(lineout, "%s %d", month_names[month - 1], year); int col, row, len, days[MAXDAYS];
(void)printf("%*s%s\n%s\n", char *p, lineout[30];
((julian ? J_WEEK_LEN : WEEK_LEN) - len) / 2, "",
lineout, julian ? j_day_headings : day_headings); day_array(month, year, days);
for (row = 0; row < 6; row++) { len = sprintf(lineout, "%s %d", month_names[month - 1], year);
for (col = 0, p = lineout; col < 7; col++, (void)printf("%*s%s\n%s\n",
p += julian ? J_DAY_LEN : DAY_LEN) ((julian ? J_WEEK_LEN : WEEK_LEN) - len) / 2, "",
ascii_day(p, days[row * 7 + col]); lineout, julian ? j_day_headings : day_headings);
*p = '\0'; for (row = 0; row < 6; row++) {
trim_trailing_spaces(lineout); for (col = 0, p = lineout; col < 7; col++,
(void)printf("%s\n", lineout); p += julian ? J_DAY_LEN : DAY_LEN)
} ascii_day(p, days[row * 7 + col]);
} *p = '\0';
trim_trailing_spaces(lineout);
void (void)printf("%s\n", lineout);
j_yearly(year) }
int year; }
{
int col, *dp, i, month, row, which_cal; void
int days[12][MAXDAYS]; j_yearly(year)
char *p, lineout[80]; int year;
{
(void)sprintf(lineout, "%d", year); int col, *dp, i, month, row, which_cal;
center(lineout, J_WEEK_LEN * 2 + J_HEAD_SEP, 0); int days[12][MAXDAYS];
(void)printf("\n\n"); char *p, lineout[80];
for (i = 0; i < 12; i++)
day_array(i + 1, year, days[i]); (void)sprintf(lineout, "%d", year);
(void)memset(lineout, ' ', sizeof(lineout) - 1); center(lineout, J_WEEK_LEN * 2 + J_HEAD_SEP, 0);
lineout[sizeof(lineout) - 1] = '\0'; (void)printf("\n\n");
for (month = 0; month < 12; month += 2) { for (i = 0; i < 12; i++)
center(month_names[month], J_WEEK_LEN, J_HEAD_SEP); day_array(i + 1, year, days[i]);
center(month_names[month + 1], J_WEEK_LEN, 0); (void)memset(lineout, ' ', sizeof(lineout) - 1);
(void)printf("\n%s%*s%s\n", j_day_headings, J_HEAD_SEP, "", lineout[sizeof(lineout) - 1] = '\0';
j_day_headings); for (month = 0; month < 12; month += 2) {
for (row = 0; row < 6; row++) { center(month_names[month], J_WEEK_LEN, J_HEAD_SEP);
for (which_cal = 0; which_cal < 2; which_cal++) { center(month_names[month + 1], J_WEEK_LEN, 0);
p = lineout + which_cal * (J_WEEK_LEN + 2); (void)printf("\n%s%*s%s\n", j_day_headings, J_HEAD_SEP, "",
dp = &days[month + which_cal][row * 7]; j_day_headings);
for (col = 0; col < 7; col++, p += J_DAY_LEN) for (row = 0; row < 6; row++) {
ascii_day(p, *dp++); for (which_cal = 0; which_cal < 2; which_cal++) {
} p = lineout + which_cal * (J_WEEK_LEN + 2);
*p = '\0'; dp = &days[month + which_cal][row * 7];
trim_trailing_spaces(lineout); for (col = 0; col < 7; col++, p += J_DAY_LEN)
(void)printf("%s\n", lineout); ascii_day(p, *dp++);
} }
} *p = '\0';
(void)printf("\n"); trim_trailing_spaces(lineout);
} (void)printf("%s\n", lineout);
}
void }
yearly(year) (void)printf("\n");
int year; }
{
int col, *dp, i, month, row, which_cal; void
int days[12][MAXDAYS]; yearly(year)
char *p, lineout[80]; int year;
{
(void)sprintf(lineout, "%d", year); int col, *dp, i, month, row, which_cal;
center(lineout, WEEK_LEN * 3 + HEAD_SEP * 2, 0); int days[12][MAXDAYS];
(void)printf("\n\n"); char *p, lineout[80];
for (i = 0; i < 12; i++)
day_array(i + 1, year, days[i]); (void)sprintf(lineout, "%d", year);
(void)memset(lineout, ' ', sizeof(lineout) - 1); center(lineout, WEEK_LEN * 3 + HEAD_SEP * 2, 0);
lineout[sizeof(lineout) - 1] = '\0'; (void)printf("\n\n");
for (month = 0; month < 12; month += 3) { for (i = 0; i < 12; i++)
center(month_names[month], WEEK_LEN, HEAD_SEP); day_array(i + 1, year, days[i]);
center(month_names[month + 1], WEEK_LEN, HEAD_SEP); (void)memset(lineout, ' ', sizeof(lineout) - 1);
center(month_names[month + 2], WEEK_LEN, 0); lineout[sizeof(lineout) - 1] = '\0';
(void)printf("\n%s%*s%s%*s%s\n", day_headings, HEAD_SEP, for (month = 0; month < 12; month += 3) {
"", day_headings, HEAD_SEP, "", day_headings); center(month_names[month], WEEK_LEN, HEAD_SEP);
for (row = 0; row < 6; row++) { center(month_names[month + 1], WEEK_LEN, HEAD_SEP);
for (which_cal = 0; which_cal < 3; which_cal++) { center(month_names[month + 2], WEEK_LEN, 0);
p = lineout + which_cal * (WEEK_LEN + 2); (void)printf("\n%s%*s%s%*s%s\n", day_headings, HEAD_SEP,
dp = &days[month + which_cal][row * 7]; "", day_headings, HEAD_SEP, "", day_headings);
for (col = 0; col < 7; col++, p += DAY_LEN) for (row = 0; row < 6; row++) {
ascii_day(p, *dp++); for (which_cal = 0; which_cal < 3; which_cal++) {
} p = lineout + which_cal * (WEEK_LEN + 2);
*p = '\0'; dp = &days[month + which_cal][row * 7];
trim_trailing_spaces(lineout); for (col = 0; col < 7; col++, p += DAY_LEN)
(void)printf("%s\n", lineout); ascii_day(p, *dp++);
} }
} *p = '\0';
(void)printf("\n"); trim_trailing_spaces(lineout);
} (void)printf("%s\n", lineout);
}
/* }
* day_array -- (void)printf("\n");
* 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. * day_array --
*/ * Fill in an array of 42 integers with a calendar. Assume for a moment
void * that you took the (maximum) 6 rows in a calendar and stretched them
day_array(month, year, days) * out end to end. You would have 42 numbers or spaces. This routine
int month, year; * builds that array for any month from Jan. 1 through Dec. 9999.
int *days; */
{ void
int day, dw, dm; day_array(month, year, days)
int month, year;
if (month == 9 && year == 1752) { int *days;
memmove(days, {
julian ? j_sep1752 : sep1752, MAXDAYS * sizeof(int)); int day, dw, dm;
return;
} if (month == 9 && year == 1752) {
memmove(days, empty, MAXDAYS * sizeof(int)); memmove(days,
dm = days_in_month[leap_year(year)][month]; julian ? j_sep1752 : sep1752, MAXDAYS * sizeof(int));
dw = day_in_week(1, month, year); return;
day = julian ? day_in_year(1, month, year) : 1; }
while (dm--) memmove(days, empty, MAXDAYS * sizeof(int));
days[dw++] = day++; dm = days_in_month[leap_year(year)][month];
} dw = day_in_week(1, month, year);
day = julian ? day_in_year(1, month, year) : 1;
/* while (dm--)
* day_in_year -- days[dw++] = day++;
* return the 1 based day number within the year }
*/
int /*
day_in_year(day, month, year) * day_in_year --
int day, month, year; * return the 1 based day number within the year
{ */
int i, leap; int
day_in_year(day, month, year)
leap = leap_year(year); int day, month, year;
for (i = 1; i < month; i++) {
day += days_in_month[leap][i]; int i, leap;
return (day);
} leap = leap_year(year);
for (i = 1; i < month; i++)
/* day += days_in_month[leap][i];
* day_in_week return (day);
* 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. * day_in_week
*/ * return the 0 based day number for any date from 1 Jan. 1 to
int * 31 Dec. 9999. Assumes the Gregorian reformation eliminates
day_in_week(day, month, year) * 3 Sep. 1752 through 13 Sep. 1752. Returns Thursday for all
int day, month, year; * missing days.
{ */
long temp; int
day_in_week(day, month, year)
temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1) int day, month, year;
+ day_in_year(day, month, year); {
if (temp < FIRST_MISSING_DAY) long temp;
return ((temp - 1 + SATURDAY) % 7);
if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS)) temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
return (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7); + day_in_year(day, month, year);
return (THURSDAY); if (temp < FIRST_MISSING_DAY)
} return ((temp - 1 + SATURDAY) % 7);
if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS))
void return (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7);
ascii_day(p, day) return (THURSDAY);
char *p; }
int day;
{ void
int display, val; ascii_day(p, day)
static char *aday[] = { char *p;
"", int day;
" 1", " 2", " 3", " 4", " 5", " 6", " 7", {
" 8", " 9", "10", "11", "12", "13", "14", int display, val;
"15", "16", "17", "18", "19", "20", "21", static char *aday[] = {
"22", "23", "24", "25", "26", "27", "28", "",
"29", "30", "31", " 1", " 2", " 3", " 4", " 5", " 6", " 7",
}; " 8", " 9", "10", "11", "12", "13", "14",
"15", "16", "17", "18", "19", "20", "21",
if (day == SPACE) { "22", "23", "24", "25", "26", "27", "28",
memset(p, ' ', julian ? J_DAY_LEN : DAY_LEN); "29", "30", "31",
return; };
}
if (julian) { if (day == SPACE) {
if ( (val = (day / 100)) ) { memset(p, ' ', julian ? J_DAY_LEN : DAY_LEN);
day %= 100; return;
*p++ = val + '0'; }
display = 1; if (julian) {
} else { if ( (val = (day / 100)) ) {
*p++ = ' '; day %= 100;
display = 0; *p++ = val + '0';
} display = 1;
val = day / 10; } else {
if (val || display) *p++ = ' ';
*p++ = val + '0'; display = 0;
else }
*p++ = ' '; val = day / 10;
*p++ = day % 10 + '0'; if (val || display)
} else { *p++ = val + '0';
*p++ = aday[day][0]; else
*p++ = aday[day][1]; *p++ = ' ';
} *p++ = day % 10 + '0';
*p = ' '; } else {
} *p++ = aday[day][0];
*p++ = aday[day][1];
void }
trim_trailing_spaces(s) *p = ' ';
char *s; }
{
char *p; void
trim_trailing_spaces(s)
for (p = s; *p; ++p) char *s;
continue; {
while (p > s && isspace(*--p)) char *p;
continue;
if (p > s) for (p = s; *p; ++p)
++p; continue;
*p = '\0'; while (p > s && isspace(*--p))
} continue;
if (p > s)
void ++p;
center(str, len, separate) *p = '\0';
char *str; }
int len;
int separate; void
{ center(str, len, separate)
char *str;
len -= strlen(str); int len;
(void)printf("%*s%s%*s", len / 2, "", str, len / 2 + len % 2, ""); int separate;
if (separate) {
(void)printf("%*s", separate, "");
} len -= strlen(str);
(void)printf("%*s%s%*s", len / 2, "", str, len / 2 + len % 2, "");
void if (separate)
usage() (void)printf("%*s", separate, "");
{ }
(void)fprintf(stderr, "usage: cal [-jy] [[month] year]\n"); void
exit(1); usage()
} {
(void)fprintf(stderr, "usage: cal [-jy] [[month] year]\n");
exit(1);
}