diff options
author | nobody <nobody@localhost> | 2004-10-13 09:42:10 +0000 |
---|---|---|
committer | nobody <nobody@localhost> | 2004-10-13 09:42:10 +0000 |
commit | 8c59a0bf0e9e2d87b0ff273ea3f0bf05bbbf6373 (patch) | |
tree | 1826706cd4fd009fcd14f4f8021005ec8ec0fa59 /busybox/coreutils/cal.c | |
download | busybox-w32-8c59a0bf0e9e2d87b0ff273ea3f0bf05bbbf6373.tar.gz busybox-w32-8c59a0bf0e9e2d87b0ff273ea3f0bf05bbbf6373.tar.bz2 busybox-w32-8c59a0bf0e9e2d87b0ff273ea3f0bf05bbbf6373.zip |
This commit was manufactured by cvs2svn to create tag 'busybox_1_00'.
Diffstat (limited to 'busybox/coreutils/cal.c')
-rw-r--r-- | busybox/coreutils/cal.c | 379 |
1 files changed, 379 insertions, 0 deletions
diff --git a/busybox/coreutils/cal.c b/busybox/coreutils/cal.c new file mode 100644 index 000000000..93c5692d0 --- /dev/null +++ b/busybox/coreutils/cal.c | |||
@@ -0,0 +1,379 @@ | |||
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 <err.h> | ||
35 | #include <stdio.h> | ||
36 | #include <stdlib.h> | ||
37 | #include <string.h> | ||
38 | #include <time.h> | ||
39 | #include <unistd.h> | ||
40 | |||
41 | #include "busybox.h" | ||
42 | |||
43 | #ifdef CONFIG_LOCALE_SUPPORT | ||
44 | #include <locale.h> | ||
45 | #endif | ||
46 | |||
47 | #define THURSDAY 4 /* for reformation */ | ||
48 | #define SATURDAY 6 /* 1 Jan 1 was a Saturday */ | ||
49 | |||
50 | #define FIRST_MISSING_DAY 639787 /* 3 Sep 1752 */ | ||
51 | #define NUMBER_MISSING_DAYS 11 /* 11 day correction */ | ||
52 | |||
53 | #define MAXDAYS 42 /* max slots in a month array */ | ||
54 | #define SPACE -1 /* used in day array */ | ||
55 | |||
56 | static const char days_in_month[] = { | ||
57 | 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 | ||
58 | }; | ||
59 | |||
60 | static const char sep1752[] = { | ||
61 | 1, 2, 14, 15, 16, | ||
62 | 17, 18, 19, 20, 21, 22, 23, | ||
63 | 24, 25, 26, 27, 28, 29, 30 | ||
64 | }; | ||
65 | |||
66 | static int julian; | ||
67 | |||
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)) | ||
72 | |||
73 | static int is_leap_year(int year) | ||
74 | { | ||
75 | return leap_year(year); | ||
76 | } | ||
77 | #undef leap_year | ||
78 | #define leap_year(yr) is_leap_year(yr) | ||
79 | |||
80 | /* number of centuries since 1700, not inclusive */ | ||
81 | #define centuries_since_1700(yr) \ | ||
82 | ((yr) > 1700 ? (yr) / 100 - 17 : 0) | ||
83 | |||
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) | ||
87 | |||
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)) | ||
91 | |||
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 *)); | ||
95 | |||
96 | static void blank_string(char *buf, size_t buflen); | ||
97 | static char *build_row(char *p, int *dp); | ||
98 | |||
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 */ | ||
104 | |||
105 | int cal_main(int argc, char **argv) | ||
106 | { | ||
107 | struct tm *local_time; | ||
108 | struct tm zero_tm; | ||
109 | time_t now; | ||
110 | int month, year, flags, i; | ||
111 | char *month_names[12]; | ||
112 | char day_headings[28]; /* 28 for julian, 21 for nonjulian */ | ||
113 | char buf[40]; | ||
114 | |||
115 | #ifdef CONFIG_LOCALE_SUPPORT | ||
116 | setlocale(LC_TIME, ""); | ||
117 | #endif | ||
118 | |||
119 | flags = bb_getopt_ulflags(argc, argv, "jy"); | ||
120 | |||
121 | julian = flags & 1; | ||
122 | |||
123 | argv += optind; | ||
124 | |||
125 | month = 0; | ||
126 | |||
127 | if ((argc -= optind) > 2) { | ||
128 | bb_show_usage(); | ||
129 | } | ||
130 | |||
131 | if (!argc) { | ||
132 | time(&now); | ||
133 | local_time = localtime(&now); | ||
134 | year = local_time->tm_year + 1900; | ||
135 | if (!(flags & 2)) { | ||
136 | month = local_time->tm_mon + 1; | ||
137 | } | ||
138 | } else { | ||
139 | if (argc == 2) { | ||
140 | month = bb_xgetularg10_bnd(*argv++, 1, 12); | ||
141 | } | ||
142 | year = bb_xgetularg10_bnd(*argv, 1, 9999); | ||
143 | } | ||
144 | |||
145 | blank_string(day_headings, sizeof(day_headings) - 7 + 7*julian); | ||
146 | |||
147 | i = 0; | ||
148 | do { | ||
149 | zero_tm.tm_mon = i; | ||
150 | strftime(buf, sizeof(buf), "%B", &zero_tm); | ||
151 | month_names[i] = bb_xstrdup(buf); | ||
152 | |||
153 | if (i < 7) { | ||
154 | zero_tm.tm_wday = i; | ||
155 | strftime(buf, sizeof(buf), "%a", &zero_tm); | ||
156 | strncpy(day_headings + i * (3+julian) + julian, buf, 2); | ||
157 | } | ||
158 | } while (++i < 12); | ||
159 | |||
160 | if (month) { | ||
161 | int row, len, days[MAXDAYS]; | ||
162 | int *dp = days; | ||
163 | char lineout[30]; | ||
164 | |||
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'; | ||
172 | dp += 7; | ||
173 | trim_trailing_spaces_and_print(lineout); | ||
174 | } | ||
175 | } else { | ||
176 | int row, which_cal, week_len, days[12][MAXDAYS]; | ||
177 | int *dp; | ||
178 | char lineout[80]; | ||
179 | |||
180 | sprintf(lineout, "%d", year); | ||
181 | center(lineout, | ||
182 | (WEEK_LEN * 3 + HEAD_SEP * 2) | ||
183 | + julian * (J_WEEK_LEN * 2 + HEAD_SEP | ||
184 | - (WEEK_LEN * 3 + HEAD_SEP * 2)), | ||
185 | 0); | ||
186 | puts("\n"); /* two \n's */ | ||
187 | for (i = 0; i < 12; i++) { | ||
188 | day_array(i + 1, year, days[i]); | ||
189 | } | ||
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); | ||
194 | if (!julian) { | ||
195 | center(month_names[month + 1], week_len, HEAD_SEP); | ||
196 | } | ||
197 | center(month_names[month + 2 - julian], week_len, 0); | ||
198 | bb_printf("\n%s%*s%s", day_headings, HEAD_SEP, "", day_headings); | ||
199 | if (!julian) { | ||
200 | bb_printf("%*s%s", HEAD_SEP, "", day_headings); | ||
201 | } | ||
202 | putchar('\n'); | ||
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); | ||
207 | } | ||
208 | /* blank_string took care of nul termination. */ | ||
209 | trim_trailing_spaces_and_print(lineout); | ||
210 | } | ||
211 | } | ||
212 | } | ||
213 | |||
214 | bb_fflush_stdout_and_exit(0); | ||
215 | } | ||
216 | |||
217 | /* | ||
218 | * day_array -- | ||
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. | ||
223 | */ | ||
224 | static void day_array(int month, int year, int *days) | ||
225 | { | ||
226 | long temp; | ||
227 | int i; | ||
228 | int j_offset; | ||
229 | int day, dw, dm; | ||
230 | |||
231 | memset(days, SPACE, MAXDAYS * sizeof(int)); | ||
232 | |||
233 | if ((month == 9) && (year == 1752)) { | ||
234 | j_offset = julian * 244; | ||
235 | i = 0; | ||
236 | do { | ||
237 | days[i+2] = sep1752[i] + j_offset; | ||
238 | } while (++i < 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 | |||
286 | static 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 | |||
304 | static 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 | |||
311 | static void blank_string(char *buf, size_t buflen) | ||
312 | { | ||
313 | memset(buf, ' ', buflen); | ||
314 | buf[buflen-1] = '\0'; | ||
315 | } | ||
316 | |||
317 | static 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 | |||