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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
|
/*
Copyright (C) 1991-2002, The Numerical Algorithms Group Ltd.
All rights reserved.
Copyright (C) 2007-2016, Gabriel Dos Reis.
All rights reverved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
- Neither the name of The Numerical Algorithms Group Ltd. nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "openaxiom-c-macros.h"
#include "debug.h"
#include "halloc.h"
#include "sockio.h"
#include "parse.h"
#include "addfile.h"
#include "lex.h"
#include "hyper.h"
static void read_ht_file(HashTable * page_hash , HashTable * macro_hash , HashTable * patch_hash , FILE * db_fp , char * db_file);
static HyperDocPage * make_special_page(int type , const char * name);
extern int make_input_file;
extern int gverify_dates;
InputBox *rb_list;
InputBox *end_rb_list;
HashTable ht_gFileHashTable;
#define htfhSize 100
/* Hash functions for active link windows */
int
window_equal(Window *w1, Window *w2)
{
return *w1 == *w2;
}
/* hash code for a window */
int
window_code(Window *w, int size)
{
return (*w) % size;
}
char *
window_id(Window w)
{
char *ret;
char buff[32];
int length;
sprintf(buff, "%ld", w);
length = strlen(buff);
ret = (char *) halloc(length * sizeof(char) + 1, "windowid");
strcpy(ret, buff);
return (ret);
}
/*
* This procedure reads the ht database. It makes repeated calls to
* db_file_open, and while the returned pointer is not null, it continues to
* read the presented data base files
*/
void
read_ht_db(HashTable *page_hash, HashTable *macro_hash, HashTable *patch_hash)
{
FILE *db_fp;
char db_file[256];
int i = 0;
gDatabasePath = NULL;
hash_init(
page_hash,
PageHashSize,
(EqualFunction) string_equal,
(HashcodeFunction) string_hash);
hash_init(
macro_hash,
MacroHashSize,
(EqualFunction) string_equal,
(HashcodeFunction) string_hash);
hash_init(
patch_hash,
PatchHashSize,
(EqualFunction) string_equal,
(HashcodeFunction) string_hash);
/* Lets initialize the FileHashTable */
hash_init(
&ht_gFileHashTable,
htfhSize,
(EqualFunction) string_equal,
(HashcodeFunction) string_hash);
while ((db_fp = db_file_open(db_file)) != NULL) {
i++;
read_ht_file(page_hash, macro_hash, patch_hash, db_fp, db_file);
fclose(db_fp);
}
if (!i) {
fprintf(stderr,
"(HyperDoc) read_ht_db: No %s file found\n", db_file_name);
exit(-1);
}
free_hash(&ht_gFileHashTable, (FreeFunction)free_string);
}
/*
* This procedure reads a single HyperDoc database file. It is passed an already
* initilaized file pointer. It reads the whole file, updating the
* page hash, or the macro hash only when a previous entry with the same name
* is not found
*/
static void
read_ht_file(HashTable *page_hash, HashTable *macro_hash,
HashTable *patch_hash, FILE *db_fp, char *db_file)
{
char filename[256];
char *fullname = filename;
UnloadedPage *page;
MacroStore *macro;
PatchStore *patch;
int pages = 0, c, mtime, ret_val;
struct stat fstats;
/*short time_ok = 1;*/
/* fprintf(stderr,"parse_aux:read_ht_file: dp_file=%s\n",db_file);*/
cfile = db_fp;
init_scanner();
ret_val = strlen(db_file) - 1;
for (; ret_val >= 0; ret_val--)
if (db_file[ret_val] == '/') {
db_file[ret_val] = '\0';
break;
}
c = getc(db_fp);
do {
if (c == '\t') {
get_filename();
fullname = alloc_string(token.id);
if (fullname[0] != '/') {
strcpy(filename, db_file);
strcat(filename, "/");
strcat(filename, fullname);
free(fullname);
fullname = alloc_string(filename);
}
/*
* Until I get a filename that I have not seen before, just keep
* reading
*/
while (hash_find(&ht_gFileHashTable, fullname) != NULL) {
do {
c = getc(db_fp);
} while ((c != EOF) && (c != '\t'));
if (c == EOF)
return;
get_filename();
fullname = alloc_string(token.id);
if (fullname[0] != '/') {
strcpy(filename, db_file);
strcat(filename, "/");
strcat(filename, fullname);
free(fullname);
fullname = alloc_string(filename);
}
}
/* fprintf(stderr,"parse_aux:read_ht_file: fullname=%s\n",fullname);*/
/* If I got here, then I must have a good filename */
hash_insert(&ht_gFileHashTable, fullname, fullname);
ret_val = stat(fullname, &fstats);
if (ret_val == -1) {
char buffer[300];
sprintf(buffer, "(HyperDoc) read_ht_db: Unable To Open %s :", fullname);
perror(buffer);
exit(-1);
}
get_token();
mtime = atoi(token.id);
if (gverify_dates & (fstats.st_mtime > mtime)) {
fprintf(stderr, "(HyperDoc) read_ht_file: HyperDoc file %s has been updated\n",
fullname);
fprintf(stderr, "(HyperDoc) Issue htadd %s to update database\n", fullname);
exit(-1);
}
while ((c = getc(db_fp)) != EOF) {
if (c == '\t')
break;
ungetc(c, db_fp);
get_token();
switch (token.type) {
case openaxiom_Page_token:
get_token();
/*
* now check to see if the page has already been
* loaded
*/
page = (UnloadedPage *) halloc(sizeof(UnloadedPage),
"UnloadedPage");
page->fpos.name = alloc_string(fullname);
page->name = alloc_string(token.id);
get_token();
if (hash_find(page_hash, page->name) != NULL) {
fprintf(stderr, "(HyperDoc) Page name %s occurred twice\n", page->name);
fprintf(stderr, "(HyperDoc) The Version in %s is being ignored \n",
page->fpos.name);
free(page);
get_token();
break;
}
page->fpos.pos = atoi(token.id);
get_token();
page->fpos.ln = atoi(token.id);
page->type = UnloadedPageType;
hash_insert(page_hash, (char *)page, page->name);
pages++;
break;
case openaxiom_NewCommand_token:
get_token();
macro = (MacroStore *) halloc(sizeof(MacroStore), "MacroStore");
macro->fpos.name = alloc_string(fullname);
macro->name = alloc_string(token.id);
macro->macro_string = NULL;
get_token();
if (hash_find(macro_hash, macro->name) != NULL) {
if (strcmp(macro->name, "localinfo") != 0) {
fprintf(stderr, "(HyperDoc) Macro name %s occurred twice\n",
macro->name);
fprintf(stderr, "(HyperDoc) The Version in %s is being ignored \n",
macro->fpos.name);
}
get_token();
free(macro);
break;
}
macro->fpos.pos = atoi(token.id);
get_token();
macro->fpos.ln = atoi(token.id);
macro->loaded = 0;
hash_insert(macro_hash, (char *)macro, macro->name);
break;
case openaxiom_Patch_token:
get_token();
patch = (PatchStore *) alloc_patchstore();
patch->fpos.name = alloc_string(fullname);
patch->name = alloc_string(token.id);
get_token();
patch->fpos.pos = atoi(token.id);
get_token();
patch->fpos.ln = atoi(token.id);
if (hash_find(patch_hash, patch->name) != NULL) {
fprintf(stderr, "(HyperDoc) Patch name %s occurred twice\n", patch->name);
fprintf(stderr, "(HyperDoc) The version in %s is being ignored \n",
patch->fpos.name);
free_patch(patch);
break;
}
hash_insert(patch_hash, (char *)patch, patch->name);
break;
default:
fprintf(stderr, "(HyperDoc) read_ht_db: Unknown type %s in ht.db\n", token.id);
exit(-1);
break;
}
}
}
else
c = getc(db_fp);
} while (c != EOF);
/* fprintf(stderr,
"parse_aux:read_ht_file:read %d pages from database\n", pages); */
}
/* create an unmapped input-only window for an active screen area */
HyperLink *
make_link_window(TextNode *link_node, int type, int isSubWin)
{
HyperLink *link;
XSetWindowAttributes at;
if (make_input_file)
switch (type) {
case openaxiom_Downlink_token:
case openaxiom_Memolink_token:
case openaxiom_Windowlink_token: {
char *name;
HyperDocPage *p;
name = print_to_string(link_node);
p = (HyperDocPage *) hash_find(gWindow->fPageHashTable, name);
if (!p)
printf("undefined link to %s\n", name);
break;
}
}
else {
link = (HyperLink *) halloc(sizeof(HyperLink), "HyperLink");
if (link == NULL) {
fprintf(stderr, "(HyperDoc) Ran out of memory allocating a hypertext link!\n");
exit(-1);
}
at.cursor = gActiveCursor;
at.event_mask = ButtonPress;
if (isSubWin)
link->win = XCreateWindow(gXDisplay, gWindow->fDisplayedWindow, 0, 0, 100, 100, 0,
0, InputOnly, CopyFromParent,
CWEventMask | CWCursor, &at);
else
link->win = 0;
link->type = type;
link->x = link->y = 0;
link->reference.node = link_node;
hash_insert(gLinkHashTable, (char *)link,(char *)&link->win);
return link;
}
return 0;
}
HyperLink *
make_paste_window(PasteNode *paste)
{
HyperLink *link;
XSetWindowAttributes at;
if (!make_input_file) {
link = (HyperLink *) halloc(sizeof(HyperLink), "HyperLink");
if (link == NULL) {
fprintf(stderr, "(HyperDoc) Ran out of memory allocating a hypertext link!\n");
exit(-1);
}
at.cursor = gActiveCursor;
at.event_mask = ButtonPress;
link->win = XCreateWindow(gXDisplay, gWindow->fDisplayedWindow,
0, 0, 100, 100, 0,
0, InputOnly, CopyFromParent,
CWEventMask | CWCursor, &at);
link->type = openaxiom_Pastebutton_token;
link->x = link->y = 0;
link->reference.paste = paste;
hash_insert(gLinkHashTable, (char *)link,(char *) &link->win);
return link;
}
return 0;
}
/* create a HyperDoc page structure with the given type and name */
static HyperDocPage *
make_special_page(int type, const char *name)
{
HyperDocPage *page = alloc_page(name);
if (page == NULL) {
fprintf(stderr, "(HyperDoc) Ran out of memory allocating page.\n");
exit(-1);
}
page->type = type;
free(page->fLinkHashTable);
page->fLinkHashTable = NULL;
return page;
}
/* insert the special button page types into the page hash table */
void
make_special_pages(HashTable *pageHashTable)
{
hash_insert(pageHashTable,
(char *)make_special_page(openaxiom_Quitbutton_token,
"QuitPage"),
"QuitPage");
hash_insert(pageHashTable,
(char *)make_special_page(openaxiom_Returnbutton_token,
"ReturnPage"),
"ReturnPage");
hash_insert(pageHashTable,
(char *)make_special_page(openaxiom_Upbutton_token, "UpPage"),
"UpPage");
}
/* Here is where I put the item into the pages linked list */
/* Parse the \bound{varlist} command, and add vars to dependency table */
void
add_dependencies()
{
TextNode *bound_node = curr_node;
TextNode *node;
SpadcomDepend *depend;
if (cur_spadcom == NULL) {
fprintf(stderr, "(HyperDoc) \\bound occuring outside a \\spadcom\n");
print_page_and_filename();
exit(-1);
}
curr_node->type = openaxiom_Bound_token;
curr_node->data.node = alloc_node();
curr_node = curr_node->data.node;
get_expected_token(openaxiom_Lbrace_token);
parse_HyperDoc();
curr_node->type = openaxiom_Endarg_token;
curr_node = bound_node;
if (gPageBeingParsed->depend_hash == NULL) {
gPageBeingParsed->depend_hash =
(HashTable *) halloc(sizeof(HashTable), "Hash Table");
hash_init(
gPageBeingParsed->depend_hash,
DependHashSize,
(EqualFunction) string_equal,
(HashcodeFunction) string_hash);
}
for (node = bound_node->data.node;
node->type != openaxiom_Endarg_token;
node = node->next) {
if (node->type == openaxiom_Word_token) {
depend = (SpadcomDepend *) halloc(sizeof(SpadcomDepend), "SpadcomDepend");
depend->label = alloc_string(node->data.text);
depend->spadcom = cur_spadcom;
depend->executed = 0;
hash_insert(gPageBeingParsed->depend_hash, (char *)depend, depend->label);
}
}
}
/* Returns true iff the TextNode contains a single integer */
int
is_number(const char * str)
{
const char *s;
for (s = str; *s != '\0'; s++) {
if (!(isdigit(*s) || *s == '-'))
return 0;
}
return 1;
}
void
parser_error(char *str)
{
/** this procedure is called by the parser when an error occurs. It prints
the error message, followed by the next 10 tokens to ease finding the
error for the user. *****/
int i, v;
fprintf(stderr, " %s\n", str);
fprintf(stderr, "Here are the next 10 tokens:\n");
for (i = 0; i < 10; i++) {
v = get_token();
if (v == EOF)
break;
print_token();
}
fprintf(stderr, "\n");
exit(-1);
}
#define whitespace(c) ((c) == ' ' || (c) == '\t' || (c) == '\n')
#define delim(c) \
(whitespace(c))
/* advance token to the next token in the input stream. */
int
get_filename()
{
int c, ws;
static int seen_white = 0; /*UNUSED */
static char buffer[256];
char *buf = buffer;
if (last_token) {
last_token = 0;
return 0;
}
do {
keyword_fpos = fpos;
c = get_char();
ws = whitespace(c);
if (ws)
seen_white = 1;
} while (ws);
switch (c) {
case EOF:
fprintf(stderr, "(HyperDoc) Error trying to read %s, unexpected end-of-file.\n",db_file_name);
exit(-1);
case '%':
case '\\':
case '{':
case '}':
fprintf(stderr, "(HyperDoc) Error unexpected character %c.\n",c);
exit(-1);
default:
do {
*buf++ = c;
} while ((c = get_char()) != EOF && !delim(c));
unget_char(c);
*buf = '\0';
token.type = openaxiom_Word_token;
token.id = buffer;
seen_white = 0;
break;
}
return 1;
}
char *
get_input_string()
{
char *string;
TextNode *string_node,*save_node;
save_node = curr_node;
/* Get the nodes that make up the string */
string_node = alloc_node();
curr_node = string_node;
parse_HyperDoc();
curr_node->type = openaxiom_Endarg_token;
/* Once here we print to string to get the actual name */
string = print_to_string(string_node);
free_node(string_node, 0);
curr_node=save_node;
return string;
}
/*
* tries to determine if there is an optional argument for where I should be
* parsing from. If so it then tries to determine which
*/
SourceInputKind
get_where()
{
SourceInputKind tw;
get_token();
if (token.type != openaxiom_Word_token)
return SourceInputKind::Error;
/* Now try to determine if it is a good type */
if (!strcmp(token.id, "lisp")) {
tw = SourceInputKind::SpadSocket;
}
else if (!strcmp(token.id, "unix")) {
tw = SourceInputKind::UnixFD;
}
else if (!strcmp(token.id, "ht")) {
tw = SourceInputKind::File;
}
else {
return SourceInputKind::Error;
}
/* now check to see if I got a closing square brace */
get_token();
if (token.type != openaxiom_Rsquarebrace_token)
return SourceInputKind::Error;
return tw;
}
FILE *
find_fp(FilePosition fp)
{
FILE *lfile;
char fullname[256], addname[256];
int ret_val;
/* find the source file in the file hash table, if not there, open it */
lfile = (FILE *) hash_find(&gFileHashTable, fp.name);
if (lfile == NULL) {
lfile = ht_file_open(fullname, addname, fp.name);
hash_insert(&gFileHashTable, (char *)lfile, fp.name);
}
/* seek to beginning fp.pos */
ret_val = fseek(lfile, fp.pos, 0);
if (ret_val == -1) {
perror("fseeking to a page");
longjmp(jmpbuf, 1);
}
/* now set some global values */
page_start_fpos = fp.pos;
line_number = fp.ln;
return lfile;
}
|