2 * Calendar implementation for busybox
4 * See original copyright at the end of this file
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 /* BB_AUDIT SUSv3 compliant with -j and -y extensions (from util-linux). */
23 /* BB_AUDIT BUG: The output of 'cal -j 1752' is incorrect. The upstream
24 * BB_AUDIT BUG: version in util-linux seems to be broken as well. */
25 /* http://www.opengroup.org/onlinepubs/007904975/utilities/cal.html */
27 /* Mar 16, 2003 Manuel Novoa III (mjn3@codepoet.org)
29 * Major size reduction... over 50% (>1.5k) on i386.
32 #include <sys/types.h>
43 #ifdef CONFIG_LOCALE_SUPPORT
47 #define THURSDAY 4 /* for reformation */
48 #define SATURDAY 6 /* 1 Jan 1 was a Saturday */
50 #define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */
51 #define NUMBER_MISSING_DAYS 11 /* 11 day correction */
53 #define MAXDAYS 42 /* max slots in a month array */
54 #define SPACE -1 /* used in day array */
56 static const char days_in_month[] = {
57 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
60 static const char sep1752[] = {
62 17, 18, 19, 20, 21, 22, 23,
63 24, 25, 26, 27, 28, 29, 30
68 /* leap year -- account for Gregorian reformation in 1752 */
69 #define leap_year(yr) \
70 ((yr) <= 1752 ? !((yr) % 4) : \
71 (!((yr) % 4) && ((yr) % 100)) || !((yr) % 400))
73 static int is_leap_year(int year)
75 return leap_year(year);
78 #define leap_year(yr) is_leap_year(yr)
80 /* number of centuries since 1700, not inclusive */
81 #define centuries_since_1700(yr) \
82 ((yr) > 1700 ? (yr) / 100 - 17 : 0)
84 /* number of centuries since 1700 whose modulo of 400 is 0 */
85 #define quad_centuries_since_1700(yr) \
86 ((yr) > 1600 ? ((yr) - 1600) / 400 : 0)
88 /* number of leap years between year 1 and this year, not inclusive */
89 #define leap_years_since_year_1(yr) \
90 ((yr) / 4 - centuries_since_1700(yr) + quad_centuries_since_1700(yr))
92 static void center __P((char *, int, int));
93 static void day_array __P((int, int, int *));
94 static void trim_trailing_spaces_and_print __P((char *));
96 static void blank_string(char *buf, size_t buflen);
97 static char *build_row(char *p, int *dp);
99 #define DAY_LEN 3 /* 3 spaces per day */
100 #define J_DAY_LEN (DAY_LEN + 1)
101 #define WEEK_LEN 20 /* 7 * 3 - one space at the end */
102 #define J_WEEK_LEN (WEEK_LEN + 7)
103 #define HEAD_SEP 2 /* spaces between day headings */
105 int cal_main(int argc, char **argv)
107 struct tm *local_time;
110 int month, year, flags, i;
111 char *month_names[12];
112 char day_headings[28]; /* 28 for julian, 21 for nonjulian */
115 #ifdef CONFIG_LOCALE_SUPPORT
116 setlocale(LC_TIME, "");
119 flags = bb_getopt_ulflags(argc, argv, "jy");
127 if ((argc -= optind) > 2) {
133 local_time = localtime(&now);
134 year = local_time->tm_year + 1900;
136 month = local_time->tm_mon + 1;
140 month = bb_xgetularg10_bnd(*argv++, 1, 12);
142 year = bb_xgetularg10_bnd(*argv, 1, 9999);
145 blank_string(day_headings, sizeof(day_headings) - 7 + 7*julian);
150 strftime(buf, sizeof(buf), "%B", &zero_tm);
151 month_names[i] = bb_xstrdup(buf);
155 strftime(buf, sizeof(buf), "%a", &zero_tm);
156 strncpy(day_headings + i * (3+julian) + julian, buf, 2);
161 int row, len, days[MAXDAYS];
165 day_array(month, year, dp);
166 len = sprintf(lineout, "%s %d", month_names[month - 1], year);
167 bb_printf("%*s%s\n%s\n",
168 ((7*julian + WEEK_LEN) - len) / 2, "",
169 lineout, day_headings);
170 for (row = 0; row < 6; row++) {
171 build_row(lineout, dp)[0] = '\0';
173 trim_trailing_spaces_and_print(lineout);
176 int row, which_cal, week_len, days[12][MAXDAYS];
180 sprintf(lineout, "%d", year);
182 (WEEK_LEN * 3 + HEAD_SEP * 2)
183 + julian * (J_WEEK_LEN * 2 + HEAD_SEP
184 - (WEEK_LEN * 3 + HEAD_SEP * 2)),
186 puts("\n"); /* two \n's */
187 for (i = 0; i < 12; i++) {
188 day_array(i + 1, year, days[i]);
190 blank_string(lineout, sizeof(lineout));
191 week_len = WEEK_LEN + julian * (J_WEEK_LEN - WEEK_LEN);
192 for (month = 0; month < 12; month += 3-julian) {
193 center(month_names[month], week_len, HEAD_SEP);
195 center(month_names[month + 1], week_len, HEAD_SEP);
197 center(month_names[month + 2 - julian], week_len, 0);
198 bb_printf("\n%s%*s%s", day_headings, HEAD_SEP, "", day_headings);
200 bb_printf("%*s%s", HEAD_SEP, "", day_headings);
203 for (row = 0; row < (6*7); row += 7) {
204 for (which_cal = 0; which_cal < 3-julian; which_cal++) {
205 dp = days[month + which_cal] + row;
206 build_row(lineout + which_cal * (week_len + 2), dp);
208 /* blank_string took care of nul termination. */
209 trim_trailing_spaces_and_print(lineout);
214 bb_fflush_stdout_and_exit(0);
219 * Fill in an array of 42 integers with a calendar. Assume for a moment
220 * that you took the (maximum) 6 rows in a calendar and stretched them
221 * out end to end. You would have 42 numbers or spaces. This routine
222 * builds that array for any month from Jan. 1 through Dec. 9999.
224 static void day_array(int month, int year, int *days)
231 memset(days, SPACE, MAXDAYS * sizeof(int));
233 if ((month == 9) && (year == 1752)) {
236 j_offset = julian * 244;
238 days[oday+2] = sep1752[oday] + j_offset;
239 } while (++oday < sizeof(sep1752));
245 * return the 1 based day number within the year
248 if ((month > 2) && leap_year(year)) {
254 day += days_in_month[--i];
258 * return the 0 based day number for any date from 1 Jan. 1 to
259 * 31 Dec. 9999. Assumes the Gregorian reformation eliminates
260 * 3 Sep. 1752 through 13 Sep. 1752. Returns Thursday for all
264 temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
266 if (temp < FIRST_MISSING_DAY) {
267 dw = ((temp - 1 + SATURDAY) % 7);
268 } else if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS)) {
269 dw = (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7);
276 dm = days_in_month[month];
277 if ((month == 2) && leap_year(year)) {
287 static void trim_trailing_spaces_and_print(char *s)
296 if (!(isspace)(*p)) { /* We want the function... not the inline. */
305 static void center(char *str, int len, int separate)
309 bb_printf("%*s%*s", (len/2) + n, str, (len/2) + (len % 2) + separate, "");
312 static void blank_string(char *buf, size_t buflen)
314 memset(buf, ' ', buflen);
315 buf[buflen-1] = '\0';
318 static char *build_row(char *p, int *dp)
322 memset(p, ' ', (julian + DAY_LEN) * 7);
326 if ((day = *dp++) != SPACE) {
331 p[-1] = (day / 100) + '0';
335 if ((val = day / 10) > 0) {
338 *++p = day % 10 + '0';
341 p += DAY_LEN + julian;
349 * Copyright (c) 1989, 1993, 1994
350 * The Regents of the University of California. All rights reserved.
352 * This code is derived from software contributed to Berkeley by
355 * Redistribution and use in source and binary forms, with or without
356 * modification, are permitted provided that the following conditions
358 * 1. Redistributions of source code must retain the above copyright
359 * notice, this list of conditions and the following disclaimer.
360 * 2. Redistributions in binary form must reproduce the above copyright
361 * notice, this list of conditions and the following disclaimer in the
362 * documentation and/or other materials provided with the distribution.
363 * 3. Neither the name of the University nor the names of its contributors
364 * may be used to endorse or promote products derived from this software
365 * without specific prior written permission.
367 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
368 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
369 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
370 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
371 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
372 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
373 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
374 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
375 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
376 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF