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>
42 #ifdef CONFIG_LOCALE_SUPPORT
46 #define THURSDAY 4 /* for reformation */
47 #define SATURDAY 6 /* 1 Jan 1 was a Saturday */
49 #define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */
50 #define NUMBER_MISSING_DAYS 11 /* 11 day correction */
52 #define MAXDAYS 42 /* max slots in a month array */
53 #define SPACE -1 /* used in day array */
55 static const char days_in_month[] = {
56 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
59 static const char sep1752[] = {
61 17, 18, 19, 20, 21, 22, 23,
62 24, 25, 26, 27, 28, 29, 30
67 /* leap year -- account for Gregorian reformation in 1752 */
68 #define leap_year(yr) \
69 ((yr) <= 1752 ? !((yr) % 4) : \
70 (!((yr) % 4) && ((yr) % 100)) || !((yr) % 400))
72 static int is_leap_year(int year)
74 return leap_year(year);
77 #define leap_year(yr) is_leap_year(yr)
79 /* number of centuries since 1700, not inclusive */
80 #define centuries_since_1700(yr) \
81 ((yr) > 1700 ? (yr) / 100 - 17 : 0)
83 /* number of centuries since 1700 whose modulo of 400 is 0 */
84 #define quad_centuries_since_1700(yr) \
85 ((yr) > 1600 ? ((yr) - 1600) / 400 : 0)
87 /* number of leap years between year 1 and this year, not inclusive */
88 #define leap_years_since_year_1(yr) \
89 ((yr) / 4 - centuries_since_1700(yr) + quad_centuries_since_1700(yr))
91 static void center (char *, int, int);
92 static void day_array (int, int, int *);
93 static void trim_trailing_spaces_and_print (char *);
95 static void blank_string(char *buf, size_t buflen);
96 static char *build_row(char *p, int *dp);
98 #define DAY_LEN 3 /* 3 spaces per day */
99 #define J_DAY_LEN (DAY_LEN + 1)
100 #define WEEK_LEN 20 /* 7 * 3 - one space at the end */
101 #define J_WEEK_LEN (WEEK_LEN + 7)
102 #define HEAD_SEP 2 /* spaces between day headings */
104 int cal_main(int argc, char **argv)
106 struct tm *local_time;
109 int month, year, flags, i;
110 char *month_names[12];
111 char day_headings[28]; /* 28 for julian, 21 for nonjulian */
114 #ifdef CONFIG_LOCALE_SUPPORT
115 setlocale(LC_TIME, "");
118 flags = bb_getopt_ulflags(argc, argv, "jy");
126 if ((argc -= optind) > 2) {
132 local_time = localtime(&now);
133 year = local_time->tm_year + 1900;
135 month = local_time->tm_mon + 1;
139 month = bb_xgetularg10_bnd(*argv++, 1, 12);
141 year = bb_xgetularg10_bnd(*argv, 1, 9999);
144 blank_string(day_headings, sizeof(day_headings) - 7 + 7*julian);
149 strftime(buf, sizeof(buf), "%B", &zero_tm);
150 month_names[i] = bb_xstrdup(buf);
154 strftime(buf, sizeof(buf), "%a", &zero_tm);
155 strncpy(day_headings + i * (3+julian) + julian, buf, 2);
160 int row, len, days[MAXDAYS];
164 day_array(month, year, dp);
165 len = sprintf(lineout, "%s %d", month_names[month - 1], year);
166 bb_printf("%*s%s\n%s\n",
167 ((7*julian + WEEK_LEN) - len) / 2, "",
168 lineout, day_headings);
169 for (row = 0; row < 6; row++) {
170 build_row(lineout, dp)[0] = '\0';
172 trim_trailing_spaces_and_print(lineout);
175 int row, which_cal, week_len, days[12][MAXDAYS];
179 sprintf(lineout, "%d", year);
181 (WEEK_LEN * 3 + HEAD_SEP * 2)
182 + julian * (J_WEEK_LEN * 2 + HEAD_SEP
183 - (WEEK_LEN * 3 + HEAD_SEP * 2)),
185 puts("\n"); /* two \n's */
186 for (i = 0; i < 12; i++) {
187 day_array(i + 1, year, days[i]);
189 blank_string(lineout, sizeof(lineout));
190 week_len = WEEK_LEN + julian * (J_WEEK_LEN - WEEK_LEN);
191 for (month = 0; month < 12; month += 3-julian) {
192 center(month_names[month], week_len, HEAD_SEP);
194 center(month_names[month + 1], week_len, HEAD_SEP);
196 center(month_names[month + 2 - julian], week_len, 0);
197 bb_printf("\n%s%*s%s", day_headings, HEAD_SEP, "", day_headings);
199 bb_printf("%*s%s", HEAD_SEP, "", day_headings);
202 for (row = 0; row < (6*7); row += 7) {
203 for (which_cal = 0; which_cal < 3-julian; which_cal++) {
204 dp = days[month + which_cal] + row;
205 build_row(lineout + which_cal * (week_len + 2), dp);
207 /* blank_string took care of nul termination. */
208 trim_trailing_spaces_and_print(lineout);
213 bb_fflush_stdout_and_exit(0);
218 * Fill in an array of 42 integers with a calendar. Assume for a moment
219 * that you took the (maximum) 6 rows in a calendar and stretched them
220 * out end to end. You would have 42 numbers or spaces. This routine
221 * builds that array for any month from Jan. 1 through Dec. 9999.
223 static void day_array(int month, int year, int *days)
230 memset(days, SPACE, MAXDAYS * sizeof(int));
232 if ((month == 9) && (year == 1752)) {
235 j_offset = julian * 244;
237 days[oday+2] = sep1752[oday] + j_offset;
238 } while (++oday < sizeof(sep1752));
244 * return the 1 based day number within the year
247 if ((month > 2) && leap_year(year)) {
253 day += days_in_month[--i];
257 * return the 0 based day number for any date from 1 Jan. 1 to
258 * 31 Dec. 9999. Assumes the Gregorian reformation eliminates
259 * 3 Sep. 1752 through 13 Sep. 1752. Returns Thursday for all
263 temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
265 if (temp < FIRST_MISSING_DAY) {
266 dw = ((temp - 1 + SATURDAY) % 7);
267 } else if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS)) {
268 dw = (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7);
275 dm = days_in_month[month];
276 if ((month == 2) && leap_year(year)) {
286 static void trim_trailing_spaces_and_print(char *s)
295 if (!(isspace)(*p)) { /* We want the function... not the inline. */
304 static void center(char *str, int len, int separate)
308 bb_printf("%*s%*s", (len/2) + n, str, (len/2) + (len % 2) + separate, "");
311 static void blank_string(char *buf, size_t buflen)
313 memset(buf, ' ', buflen);
314 buf[buflen-1] = '\0';
317 static char *build_row(char *p, int *dp)
321 memset(p, ' ', (julian + DAY_LEN) * 7);
325 if ((day = *dp++) != SPACE) {
330 p[-1] = (day / 100) + '0';
334 if ((val = day / 10) > 0) {
337 *++p = day % 10 + '0';
340 p += DAY_LEN + julian;
348 * Copyright (c) 1989, 1993, 1994
349 * The Regents of the University of California. All rights reserved.
351 * This code is derived from software contributed to Berkeley by
354 * Redistribution and use in source and binary forms, with or without
355 * modification, are permitted provided that the following conditions
357 * 1. Redistributions of source code must retain the above copyright
358 * notice, this list of conditions and the following disclaimer.
359 * 2. Redistributions in binary form must reproduce the above copyright
360 * notice, this list of conditions and the following disclaimer in the
361 * documentation and/or other materials provided with the distribution.
362 * 3. Neither the name of the University nor the names of its contributors
363 * may be used to endorse or promote products derived from this software
364 * without specific prior written permission.
366 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
367 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
368 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
369 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
370 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
371 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
372 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
373 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
374 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
375 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF