source: MondoRescue/branches/stable/mindi-busybox/coreutils/cal.c @ 821

Last change on this file since 821 was 821, checked in by Bruno Cornec, 14 years ago

Addition of busybox 1.2.1 as a mindi-busybox new package
This should avoid delivering binary files in mindi not built there (Fedora and Debian are quite serious about that)

File size: 9.8 KB
Line 
1/*
2 * Calendar implementation for busybox
3 *
4 * See original copyright at the end of this file
5 *
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.
10 *
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.
15 *
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
19 *
20*/
21
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 */
26
27/* Mar 16, 2003      Manuel Novoa III   (mjn3@codepoet.org)
28 *
29 * Major size reduction... over 50% (>1.5k) on i386.
30 */
31
32#include <sys/types.h>
33#include <ctype.h>
34#include <stdio.h>
35#include <stdlib.h>
36#include <string.h>
37#include <time.h>
38#include <unistd.h>
39
40#include "busybox.h"
41
42#ifdef CONFIG_LOCALE_SUPPORT
43#include <locale.h>
44#endif
45
46#define THURSDAY        4       /* for reformation */
47#define SATURDAY        6       /* 1 Jan 1 was a Saturday */
48
49#define FIRST_MISSING_DAY   639787      /* 3 Sep 1752 */
50#define NUMBER_MISSING_DAYS 11      /* 11 day correction */
51
52#define MAXDAYS         42      /* max slots in a month array */
53#define SPACE           -1      /* used in day array */
54
55static const char days_in_month[] = {
56    0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
57};
58
59static const char sep1752[] = {
60             1, 2,  14, 15, 16,
61    17, 18, 19, 20, 21, 22, 23,
62    24, 25, 26, 27, 28, 29, 30
63};
64
65static int julian;
66
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))
71
72static int is_leap_year(int year)
73{
74    return leap_year(year);
75}
76#undef leap_year
77#define leap_year(yr) is_leap_year(yr)
78
79/* number of centuries since 1700, not inclusive */
80#define centuries_since_1700(yr) \
81    ((yr) > 1700 ? (yr) / 100 - 17 : 0)
82
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)
86
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))
90
91static void center (char *, int, int);
92static void day_array (int, int, int *);
93static void trim_trailing_spaces_and_print (char *);
94
95static void blank_string(char *buf, size_t buflen);
96static char *build_row(char *p, int *dp);
97
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 */
103
104int cal_main(int argc, char **argv)
105{
106    struct tm *local_time;
107    struct tm zero_tm;
108    time_t now;
109    int month, year, flags, i;
110    char *month_names[12];
111    char day_headings[28];  /* 28 for julian, 21 for nonjulian */
112    char buf[40];
113
114#ifdef CONFIG_LOCALE_SUPPORT
115    setlocale(LC_TIME, "");
116#endif
117
118    flags = bb_getopt_ulflags(argc, argv, "jy");
119
120    julian = flags & 1;
121
122    argv += optind;
123
124    month = 0;
125
126    if ((argc -= optind) > 2) {
127        bb_show_usage();
128    }
129
130    if (!argc) {
131        time(&now);
132        local_time = localtime(&now);
133        year = local_time->tm_year + 1900;
134        if (!(flags & 2)) {
135            month = local_time->tm_mon + 1;
136        }
137    } else {
138        if (argc == 2) {
139            month = bb_xgetularg10_bnd(*argv++, 1, 12);
140        }
141        year = bb_xgetularg10_bnd(*argv, 1, 9999);
142    }
143
144    blank_string(day_headings, sizeof(day_headings) - 7 +  7*julian);
145
146    i = 0;
147    do {
148        zero_tm.tm_mon = i;
149        strftime(buf, sizeof(buf), "%B", &zero_tm);
150        month_names[i] = bb_xstrdup(buf);
151
152        if (i < 7) {
153            zero_tm.tm_wday = i;
154            strftime(buf, sizeof(buf), "%a", &zero_tm);
155            strncpy(day_headings + i * (3+julian) + julian, buf, 2);
156        }
157    } while (++i < 12);
158
159    if (month) {
160        int row, len, days[MAXDAYS];
161        int *dp = days;
162        char lineout[30];
163
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';
171            dp += 7;
172            trim_trailing_spaces_and_print(lineout);
173        }
174    } else {
175        int row, which_cal, week_len, days[12][MAXDAYS];
176        int *dp;
177        char lineout[80];
178
179        sprintf(lineout, "%d", year);
180        center(lineout,
181               (WEEK_LEN * 3 + HEAD_SEP * 2)
182               + julian * (J_WEEK_LEN * 2 + HEAD_SEP
183                           - (WEEK_LEN * 3 + HEAD_SEP * 2)),
184               0);
185        puts("\n");     /* two \n's */
186        for (i = 0; i < 12; i++) {
187            day_array(i + 1, year, days[i]);
188        }
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);
193            if (!julian) {
194                center(month_names[month + 1], week_len, HEAD_SEP);
195            }
196            center(month_names[month + 2 - julian], week_len, 0);
197            bb_printf("\n%s%*s%s", day_headings, HEAD_SEP, "", day_headings);
198            if (!julian) {
199                bb_printf("%*s%s", HEAD_SEP, "", day_headings);
200            }
201            putchar('\n');
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);
206                }
207                /* blank_string took care of nul termination. */
208                trim_trailing_spaces_and_print(lineout);
209            }
210        }
211    }
212
213    bb_fflush_stdout_and_exit(0);
214}
215
216/*
217 * day_array --
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.
222 */
223static void day_array(int month, int year, int *days)
224{
225    long temp;
226    int i;
227    int j_offset;
228    int day, dw, dm;
229
230    memset(days, SPACE, MAXDAYS * sizeof(int));
231
232    if ((month == 9) && (year == 1752)) {
233        size_t oday = 0;
234       
235        j_offset = julian * 244;
236        do {
237            days[oday+2] = sep1752[oday] + j_offset;
238        } while (++oday < sizeof(sep1752));
239
240        return;
241    }
242
243    /* day_in_year
244     *  return the 1 based day number within the year
245     */
246    day = 1;
247    if ((month > 2) && leap_year(year)) {
248        ++day;
249    }
250
251    i = month;
252    while (i) {
253        day += days_in_month[--i];
254    }
255
256    /* day_in_week
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
260     *  missing days.
261     */
262    dw = THURSDAY;
263    temp = (long)(year - 1) * 365 + leap_years_since_year_1(year - 1)
264        + day;
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);
269    }
270
271    if (!julian) {
272        day = 1;
273    }
274
275    dm = days_in_month[month];
276    if ((month == 2) && leap_year(year)) {
277        ++dm;
278    }
279
280    while (dm) {
281        days[dw++] = day++;
282        --dm;
283    }
284}
285
286static void trim_trailing_spaces_and_print(char *s)
287{
288    char *p = s;
289
290    while (*p) {
291        ++p;
292    }
293    while (p > s) {
294        --p;
295        if (!(isspace)(*p)) {   /* We want the function... not the inline. */
296            p[1] = '\0';
297            break;
298        }
299    }
300
301    puts(s);
302}
303
304static void center(char *str, int len, int separate)
305{
306    int n = strlen(str);
307    len -= n;
308    bb_printf("%*s%*s", (len/2) + n, str, (len/2) + (len % 2) + separate, "");
309}
310
311static void blank_string(char *buf, size_t buflen)
312{
313    memset(buf, ' ', buflen);
314    buf[buflen-1] = '\0';
315}
316
317static char *build_row(char *p, int *dp)
318{
319    int col, val, day;
320
321    memset(p, ' ', (julian + DAY_LEN) * 7);
322
323    col = 0;
324    do {
325        if ((day = *dp++) != SPACE) {
326            if (julian) {
327                ++p;
328                if (day >= 100) {
329                    *p = '0';
330                    p[-1] = (day / 100) + '0';
331                    day %= 100;
332                }
333            }
334            if ((val = day / 10) > 0) {
335                *p = val + '0';
336            }
337            *++p = day % 10 + '0';
338            p += 2;
339        } else {
340            p += DAY_LEN + julian;
341        }
342    } while (++col < 7);
343
344    return p;
345}
346
347/*
348 * Copyright (c) 1989, 1993, 1994
349 *  The Regents of the University of California.  All rights reserved.
350 *
351 * This code is derived from software contributed to Berkeley by
352 * Kim Letkeman.
353 *
354 * Redistribution and use in source and binary forms, with or without
355 * modification, are permitted provided that the following conditions
356 * are met:
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.
365 *
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
376 * SUCH DAMAGE.
377 */
378
379
Note: See TracBrowser for help on using the repository browser.