3 * Apparently, all "Steven J. Merrifield" did was grab the util-linux cal applet,
4 * spend maybe 5 minutes integrating it into busybox, slapped a copyright on it,
5 * and submitted it. I certainly saw no evidence of any attempt at size reduction.
6 * Not only do I consider his copyright below meaningless, I also consider his
9 * Manuel Novoa III (mjn3@codepoet.org)
13 * Calendar implementation for busybox
15 * Copyright (C) 2001 by Steven J. Merrifield <steve@labyrinth.net.au>
17 * See original copyright at the end of this file
19 * This program is free software; you can redistribute it and/or modify
20 * it under the terms of the GNU General Public License as published by
21 * the Free Software Foundation; either version 2 of the License, or
22 * (at your option) any later version.
24 * This program is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
27 * General Public License for more details.
29 * You should have received a copy of the GNU General Public License
30 * along with this program; if not, write to the Free Software
31 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
35 /* BB_AUDIT SUSv3 compliant with -j and -y extensions (from util-linux). */
36 /* BB_AUDIT BUG: The output of 'cal -j 1752' is incorrect. The upstream
37 * BB_AUDIT BUG: version in util-linux seems to be broken as well. */
38 /* http://www.opengroup.org/onlinepubs/007904975/utilities/cal.html */
40 /* Mar 16, 2003 Manuel Novoa III (mjn3@codepoet.org)
42 * Major size reduction... over 50% (>1.5k) on i386.
45 #include <sys/types.h>
56 #ifdef CONFIG_LOCALE_SUPPORT
60 #define THURSDAY 4 /* for reformation */
61 #define SATURDAY 6 /* 1 Jan 1 was a Saturday */
63 #define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */
64 #define NUMBER_MISSING_DAYS 11 /* 11 day correction */
66 #define MAXDAYS 42 /* max slots in a month array */
67 #define SPACE -1 /* used in day array */
69 static const char days_in_month[] = {
70 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
73 static const char sep1752[] = {
75 17, 18, 19, 20, 21, 22, 23,
76 24, 25, 26, 27, 28, 29, 30
81 /* leap year -- account for gregorian reformation in 1752 */
82 #define leap_year(yr) \
83 ((yr) <= 1752 ? !((yr) % 4) : \
84 (!((yr) % 4) && ((yr) % 100)) || !((yr) % 400))
86 static int is_leap_year(int year)
88 return leap_year(year);
91 #define leap_year(yr) is_leap_year(yr)
93 /* number of centuries since 1700, not inclusive */
94 #define centuries_since_1700(yr) \
95 ((yr) > 1700 ? (yr) / 100 - 17 : 0)
97 /* number of centuries since 1700 whose modulo of 400 is 0 */
98 #define quad_centuries_since_1700(yr) \
99 ((yr) > 1600 ? ((yr) - 1600) / 400 : 0)
101 /* number of leap years between year 1 and this year, not inclusive */
102 #define leap_years_since_year_1(yr) \
103 ((yr) / 4 - centuries_since_1700(yr) + quad_centuries_since_1700(yr))
105 static void center __P((char *, int, int));
106 static void day_array __P((int, int, int *));
107 static void trim_trailing_spaces_and_print __P((char *));
109 static void blank_string(char *buf, size_t buflen);
110 static char *build_row(char *p, int *dp);
112 #define DAY_LEN 3 /* 3 spaces per day */
113 #define J_DAY_LEN (DAY_LEN + 1)
114 #define WEEK_LEN 20 /* 7 * 3 - one space at the end */
115 #define J_WEEK_LEN (WEEK_LEN + 7)
116 #define HEAD_SEP 2 /* spaces between day headings */
118 int cal_main(int argc, char **argv)
120 struct tm *local_time;
123 int month, year, flags, i;
124 char *month_names[12];
125 char day_headings[28]; /* 28 for julian, 21 for nonjulian */
128 #ifdef CONFIG_LOCALE_SUPPORT
129 setlocale(LC_TIME, "");
132 flags = bb_getopt_ulflags(argc, argv, "jy");
140 if ((argc -= optind) > 2) {
146 local_time = localtime(&now);
147 year = local_time->tm_year + 1900;
149 month = local_time->tm_mon + 1;
153 month = bb_xgetularg10_bnd(*argv++, 1, 12);
155 year = bb_xgetularg10_bnd(*argv, 1, 9999);
158 blank_string(day_headings, sizeof(day_headings) - 7 + 7*julian);
163 strftime(buf, sizeof(buf), "%B", &zero_tm);
164 month_names[i] = bb_xstrdup(buf);
168 strftime(buf, sizeof(buf), "%a", &zero_tm);
169 strncpy(day_headings + i * (3+julian) + julian, buf, 2);
174 int row, len, days[MAXDAYS];
178 day_array(month, year, dp);
179 len = sprintf(lineout, "%s %d", month_names[month - 1], year);
180 bb_printf("%*s%s\n%s\n",
181 ((7*julian + WEEK_LEN) - len) / 2, "",
182 lineout, day_headings);
183 for (row = 0; row < 6; row++) {
184 build_row(lineout, dp)[0] = '\0';
186 trim_trailing_spaces_and_print(lineout);
189 int row, which_cal, week_len, days[12][MAXDAYS];
193 sprintf(lineout, "%d", year);
195 (WEEK_LEN * 3 + HEAD_SEP * 2)
196 + julian * (J_WEEK_LEN * 2 + HEAD_SEP
197 - (WEEK_LEN * 3 + HEAD_SEP * 2)),
199 puts("\n"); /* two \n's */
200 for (i = 0; i < 12; i++) {
201 day_array(i + 1, year, days[i]);
203 blank_string(lineout, sizeof(lineout));
204 week_len = WEEK_LEN + julian * (J_WEEK_LEN - WEEK_LEN);
205 for (month = 0; month < 12; month += 3-julian) {
206 center(month_names[month], week_len, HEAD_SEP);
208 center(month_names[month + 1], week_len, HEAD_SEP);
210 center(month_names[month + 2 - julian], week_len, 0);
211 bb_printf("\n%s%*s%s", day_headings, HEAD_SEP, "", day_headings);
213 bb_printf("%*s%s", HEAD_SEP, "", day_headings);
216 for (row = 0; row < (6*7); row += 7) {
217 for (which_cal = 0; which_cal < 3-julian; which_cal++) {
218 dp = days[month + which_cal] + row;
219 build_row(lineout + which_cal * (week_len + 2), dp);
221 /* blank_string took care of nul termination. */
222 trim_trailing_spaces_and_print(lineout);
227 bb_fflush_stdout_and_exit(0);
232 * Fill in an array of 42 integers with a calendar. Assume for a moment
233 * that you took the (maximum) 6 rows in a calendar and stretched them
234 * out end to end. You would have 42 numbers or spaces. This routine
235 * builds that array for any month from Jan. 1 through Dec. 9999.
237 static void day_array(int month, int year, int *days)
244 memset(days, SPACE, MAXDAYS * sizeof(int));
246 if ((month == 9) && (year == 1752)) {
247 j_offset = julian * 244;
250 days[i+2] = sep1752[i] + j_offset;
251 } while (++i < sizeof(sep1752));
257 * return the 1 based day number within the year
260 if ((month > 2) && leap_year(year)) {
266 day += days_in_month[--i];
270 * return the 0 based day number for any date from 1 Jan. 1 to
271 * 31 Dec. 9999. Assumes the Gregorian reformation eliminates
272 * 3 Sep. 1752 through 13 Sep. 1752. Returns Thursday for all
276 temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
278 if (temp < FIRST_MISSING_DAY) {
279 dw = ((temp - 1 + SATURDAY) % 7);
280 } else if (temp >= (FIRST_MISSING_DAY + NUMBER_MISSING_DAYS)) {
281 dw = (((temp - 1 + SATURDAY) - NUMBER_MISSING_DAYS) % 7);
288 dm = days_in_month[month];
289 if ((month == 2) && leap_year(year)) {
299 static void trim_trailing_spaces_and_print(char *s)
308 if (!(isspace)(*p)) { /* We want the function... not the inline. */
317 static void center(char *str, int len, int separate)
321 bb_printf("%*s%*s", (len/2) + n, str, (len/2) + (len % 2) + separate, "");
324 static void blank_string(char *buf, size_t buflen)
326 memset(buf, ' ', buflen);
327 buf[buflen-1] = '\0';
330 static char *build_row(char *p, int *dp)
334 memset(p, ' ', (julian + DAY_LEN) * 7);
338 if ((day = *dp++) != SPACE) {
343 p[-1] = (day / 100) + '0';
347 if ((val = day / 10) > 0) {
350 *++p = day % 10 + '0';
353 p += DAY_LEN + julian;
361 * Copyright (c) 1989, 1993, 1994
362 * The Regents of the University of California. All rights reserved.
364 * This code is derived from software contributed to Berkeley by
367 * Redistribution and use in source and binary forms, with or without
368 * modification, are permitted provided that the following conditions
370 * 1. Redistributions of source code must retain the above copyright
371 * notice, this list of conditions and the following disclaimer.
372 * 2. Redistributions in binary form must reproduce the above copyright
373 * notice, this list of conditions and the following disclaimer in the
374 * documentation and/or other materials provided with the distribution.
375 * 3. Neither the name of the University nor the names of its contributors
376 * may be used to endorse or promote products derived from this software
377 * without specific prior written permission.
379 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
380 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
381 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
382 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
383 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
384 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
385 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
386 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
387 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
388 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF