1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
|
/* $calcurse: args.c,v 1.8 2006/10/16 15:48:30 culot Exp $ */
/*
* Calcurse - text-based organizer
* Copyright (c) 2004-2006 Frederic Culot
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*
* Send your feedback or comments to : calcurse@culot.org
* Calcurse home page : http://culot.org/calcurse
*
*/
#include <ncurses.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <stdbool.h>
#include <sys/types.h>
#include <unistd.h>
#include <time.h>
#include "i18n.h"
#include "utils.h"
#include "args.h"
#include "vars.h"
#include "event.h"
#include "apoint.h"
#include "recur.h"
#include "day.h"
#include "todo.h"
#include "io.h"
#include "notify.h"
/*
* Parse the command-line arguments and call the appropriate
* routines to handle those arguments. Also initialize the data paths.
*/
int parse_args(int argc, char **argv, int colr)
{
int ch, add_line = 0;
int unknown_flag = 0, app_found = 0;
int aflag = 0, cflag = 0, dflag = 0, vflag = 0;
int hflag = 0, tflag = 0, nflag = 0;
int non_interactive = 0, multiple_flag = 0, load_data = 0;
int no_file = 1;
char *ddate = "", *cfile = NULL, *tnum = NULL;
while ((ch = getopt(argc, argv, "hvnat:d:c:")) != -1) {
switch (ch) {
case 'a':
aflag = 1;
multiple_flag++;
load_data++;
break;
case 'd':
dflag = 1;
multiple_flag++;
load_data++;
ddate = optarg;
break;
case 'c':
cflag = 1;
multiple_flag++;
load_data++;
cfile = optarg;
break;
case 'h':
hflag = 1;
break;
case 'n':
nflag = 1;
multiple_flag++;
load_data++;
break;
case 't':
tflag = 1;
multiple_flag++;
load_data++;
add_line = 1;
tnum = optarg;
break;
case 'v':
vflag = 1;
break;
default:
usage();
usage_try();
unknown_flag = 1;
non_interactive = 1;
}
}
argc -= optind;
argv += optind;
if (argc >= 1) { /* incorrect arguments */
usage();
usage_try();
return EXIT_FAILURE;
} else {
if (unknown_flag) {
non_interactive = 1;
} else if (hflag) {
help_arg();
non_interactive = 1;
} else if (vflag) {
version_arg();
non_interactive = 1;
} else if (multiple_flag) {
if (load_data) {
io_init(cfile);
no_file = check_data_files();
if (dflag || aflag || nflag)
load_app(colr);
}
if (tflag) {
todo_arg(atoi(tnum), colr);
non_interactive = 1;
}
if (nflag) {
next_arg();
non_interactive = 1;
}
if (dflag) {
date_arg(ddate, add_line);
non_interactive = 1;
} else if (aflag) {
app_found = app_arg(add_line,0,0,0,0);
non_interactive = 1;
}
} else {
non_interactive = 0;
io_init(cfile);
no_file = check_data_files();
}
return non_interactive;
}
}
/*
* Print Calcurse version with a short copyright text and exit.
*/
void version_arg()
{
char vtitle[50];
char *vtext =
_("\nCopyright (c) 2004-2006 Frederic Culot.\n"
"This is free software; see the source for copying conditions.\n");
sprintf(vtitle, _("Calcurse %s - text-based organizer\n"), VERSION);
fputs(vtitle, stdout);
fputs(vtext, stdout);
}
/*
* Print the command line options and exit.
*/
void help_arg()
{
char htitle[50];
char *htext =
_("\nMiscellaneous:\n"
" -h print this help and exit.\n"
" -v print calcurse version and exit.\n"
"\nOptions:\n"
" -c <file> specify the calendar <file> to use.\n"
"\nNon-interactive:\n"
" -a print events and appointments for current day and exit.\n"
" -d <date|num> print events and appointments for <date> "
"or <num> upcoming\n\t\tdays and exit. Possible formats are: "
"'mm/dd/yyyy' or 'n'.\n"
" -n print next appointment within upcoming 24 hours "
"and exit.\n"
" -t [num] print todo list and exit. "
"If the optional number [num] is \n"
"\t\tgiven, then only the todos having a priority equal to [num]\n"
"\t\twill be returned.\n"
"\t\tnote: the priority number must be between 1 (highest) and\n"
"\t\t9 (lowest)\n"
"\nFor more information, type '?' from within Calcurse, "
"or read the manpage.\n"
"Mail bug reports and suggestions to <calcurse@culot.org>.\n");
sprintf(htitle, _("Calcurse %s - text-based organizer\n"), VERSION);
fputs(htitle, stdout);
usage();
fputs(htext, stdout);
}
/*
* Print todo list and exit. If a priority number is given (say not equal to
* zero), then only todo items that have this priority will be displayed.
*/
int todo_arg(int priority, int colr)
{
struct todo_s *i;
int nb_tod, title = 1;
char priority_str[MAX_LENGTH] = "";
if (priority >= 9 || priority <= 0) {
usage();
usage_try();
return EXIT_FAILURE;
} else {
nb_tod = load_todo(colr);
for (i = todolist; i != 0; i = i->next) {
if (priority == 0 || i->id == priority) {
if (title) {
fputs(_("to do:\n"),stdout);
title = 0;
}
sprintf(priority_str, "%d. ", i->id);
fputs(priority_str,stdout);
fputs(i->mesg,stdout);
fputs("\n",stdout);
}
}
}
}
/* Print the next appointment within the upcoming 24 hours. */
void next_arg(void)
{
struct notify_app_s *next_app;
long current_time;
int time_left, hours_left, min_left;
char mesg[MAX_LENGTH];
current_time = now();
next_app = (struct notify_app_s *) malloc(sizeof(struct notify_app_s));
next_app->time = current_time + DAYINSEC;
next_app->got_app = 0;
next_app = recur_apoint_check_next(next_app, current_time, today());
next_app = apoint_check_next(next_app, current_time);
time_left = next_app->time - current_time;
if (time_left > 0 && time_left < DAYINSEC) {
hours_left = (time_left / 3600);
min_left = (time_left - hours_left*3600) / 60;
fputs(_("next appointment:\n"), stdout);
sprintf(mesg, " [%02d:%02d] %s\n", hours_left, min_left,
next_app->txt);
fputs(mesg, stdout);
fputs("\n", stdout);
}
}
/*
* Print appointments for given day and exit.
* If no year, month, and day is given, the given date is used.
* If there is also no date given, current date is considered.
*/
int app_arg(int add_line, int year, int month, int day, long date)
{
struct recur_event_s *re;
struct event_s *j;
recur_apoint_llist_node_t *ra;
apoint_llist_node_t *i;
long today;
bool print_date = true;
int app_found = 0;
char apoint_start_time[100];
char apoint_end_time[100];
if (date == 0) {
today = get_sec_date(year, month, day);
} else today = date;
/*
* Calculate and print the selected date if there is an event for
* that date and it is the first one, and then print all the events for
* that date.
*/
for (re = recur_elist; re != 0; re = re->next) {
if (recur_item_inday(re->day, re->exc, re->rpt->type,
re->rpt->freq, re->rpt->until, today)) {
app_found = 1;
if (add_line) {
fputs("\n", stdout);
add_line = 0;
}
if (print_date) {
arg_print_date(today);
print_date = false;
}
fputs(" o ", stdout);
fputs(re->mesg, stdout); fputs("\n", stdout);
}
}
for (j = eventlist; j != 0; j = j->next) {
if (event_inday(j, today)) {
app_found = 1;
if (add_line) {
fputs("\n",stdout);
add_line = 0;
}
if (print_date) {
arg_print_date(today);
print_date = false;
}
fputs(" o ",stdout);
fputs(j->mesg,stdout); fputs("\n",stdout);
}
}
/* Same process is performed but this time on the appointments. */
pthread_mutex_lock(&(recur_alist_p->mutex));
for (ra = recur_alist_p->root; ra != 0; ra = ra->next) {
if (recur_item_inday(ra->start, ra->exc, ra->rpt->type,
ra->rpt->freq, ra->rpt->until, today)) {
app_found = 1;
if (add_line) {
fputs("\n",stdout);
add_line = 0;
}
if (print_date) {
arg_print_date(today);
print_date = false;
}
apoint_sec2str(apoint_recur_s2apoint_s(ra),
RECUR_APPT, today, apoint_start_time,
apoint_end_time);
fputs(" - ",stdout);
fputs(apoint_start_time,stdout);
fputs(" -> ",stdout);
fputs(apoint_end_time,stdout); fputs("\n\t",stdout);
fputs(ra->mesg,stdout); fputs("\n",stdout);
}
}
pthread_mutex_unlock(&(recur_alist_p->mutex));
pthread_mutex_lock(&(alist_p->mutex));
for (i = alist_p->root; i != 0; i = i->next) {
if (apoint_inday(i, today)) {
app_found = 1;
if (add_line) {
fputs("\n",stdout);
add_line = 0;
}
if (print_date) {
arg_print_date(today);
print_date = false;
}
apoint_sec2str(i, APPT, today, apoint_start_time,
apoint_end_time);
fputs(" - ",stdout);
fputs(apoint_start_time,stdout);
fputs(" -> ",stdout);
fputs(apoint_end_time,stdout); fputs("\n\t",stdout);
fputs(i->mesg,stdout); fputs("\n",stdout);
}
}
pthread_mutex_unlock(&(alist_p->mutex));
return app_found;
}
/*
* Print appointment for the given date or for the given n upcoming
* days.
*/
void date_arg(char *ddate, int add_line)
{
int i;
int year = 0, month = 0, day = 0;
int numdays = 0, num_digit = 0;
int arg_len = 0, app_found = 0;
int date_valid = 0;
long today, ind;
int sec_in_day = 86400;
/*
* Check (with the argument length) if a date or a number of days
* was entered, and then call app_arg() to print appointments
*/
arg_len = strlen(ddate);
if (arg_len <= 4) { /* a number of days was entered */
for (i = 0; i <= arg_len-1; i++) {
if (isdigit(ddate[i])) num_digit++;
}
if (num_digit == arg_len) numdays = atoi(ddate);
/*
* Get current date, and print appointments for each day
* in the chosen interval. app_found and add_line are used
* to format the output correctly.
*/
today = get_sec_date(year, month, day);
ind = today;
for (i = 0; i < numdays; i++) {
app_found = app_arg(add_line, 0, 0, 0, ind);
add_line = app_found;
ind = ind + sec_in_day;
}
} else { /* a date was entered */
date_valid = check_date(ddate);
if (date_valid) {
sscanf(ddate, "%d / %d / %d", &month, &day, &year);
app_found = app_arg(add_line, year, month, day, 0);
} else {
fputs(_("Argument to the '-d' flag is not valid\n"),stdout);
fputs(_("Possible argument formats are : 'mm/dd/yyyy' or 'n'\n"),stdout);
fputs(_("\nFor more information, type '?' from within Calcurse, or read the manpage.\n"),stdout);
fputs
(_("Mail bug reports and suggestions to <calcurse@culot.org>.\n"),
stdout);
}
}
}
/*
* Check if the entered date is of a valid format.
* First check the format by itself, and then check the
* numbers correctness.
*/
int
check_date(char *date)
{
int ok = 0;
char month[3] = "";
char day[3] = "";
char year[5] = "";
if (
(strlen(date) == 10) &
(isdigit(date[0]) != 0) &
(isdigit(date[1]) != 0) &
(date[2] == '/') &
(isdigit(date[3]) != 0) &
(isdigit(date[4]) != 0) &
(date[5] == '/') &
(isdigit(date[6])!=0) & (isdigit(date[7])!=0) &
(isdigit(date[8])!=0) & (isdigit(date[9])!=0)
) {
strncpy(month, date, 2);
strncpy(day, date + 3, 2);
strncpy(year, date + 6, 4);
if ( (atoi(month) <= 12) &
(atoi(month) >= 1) &
(atoi(day) <= 31) &
(atoi(day) >= 1) &
(atoi(year) <= 9999) &
(atoi(year) > 1))
ok = 1;
}
return ok;
}
/*
* Print the date on stdout.
*/
void arg_print_date(long date)
{
char date_str[30];
time_t t;
struct tm *lt;
t = date;
lt = localtime(&t);
sprintf(date_str,"%02u/%02u/%04u",lt->tm_mon+1,
lt->tm_mday, 1900+lt->tm_year);
fputs(date_str,stdout);
fputs(":\n",stdout);
}
/*
* Print Calcurse usage and exit.
*/
void usage()
{
char *arg_usage =
_("Usage: calcurse [-h | -v] [-an] [-t [num]] [-d date|num] [-c file]\n");
fputs(arg_usage, stdout);
}
void usage_try()
{
char *arg_usage_try =
_("Try 'calcurse -h' for more information.\n");
fputs(arg_usage_try, stdout);
}
|