|
|
1.1 root 1: NOTE: the preceding context may be different under 2.10.2, but you should
2: be able to figure it out anyway.
3:
4: *** header.old.c Fri Apr 27 11:30:49 1984
5: --- header.c Mon Feb 27 10:44:03 1984
6: ***************
7: *** 107,112
8: #define NUMLINES 19
9: #define KEYWORDS 20
10: #define APPROVED 21
11: #define OTHER 99
12:
13: char *malloc();
14:
15: --- 107,115 -----
16: #define NUMLINES 19
17: #define KEYWORDS 20
18: #define APPROVED 21
19: + #ifdef DOXREFS
20: + #define XREF 98
21: + #endif DOXREFS
22: #define OTHER 99
23:
24: char *malloc();
25: ***************
26: *** 201,206
27: seenrelay = 1;
28: }
29: break;
30: case OTHER:
31: if (unreccnt < NUNREC) {
32: hp->unrec[unreccnt] = malloc(strlen(bfr) + 1);
33:
34: --- 204,214 -----
35: seenrelay = 1;
36: }
37: break;
38: + #ifdef DOXREFS
39: + case XREF:
40: + getfield(hp->xref);
41: + break;
42: + #endif DOXREFS
43: case OTHER:
44: if (unreccnt < NUNREC) {
45: hp->unrec[unreccnt] = malloc(strlen(bfr) + 1);
46: ***************
47: *** 398,403
48: return KEYWORDS;
49: if (its("Approved: "))
50: return APPROVED;
51: return OTHER;
52: }
53:
54:
55: --- 406,415 -----
56: return KEYWORDS;
57: if (its("Approved: "))
58: return APPROVED;
59: + #ifdef DOXREFS
60: + if (its("Xref: "))
61: + return XREF;
62: + #endif DOXREFS
63: return OTHER;
64: }
65:
66: ***************
67: *** 507,512
68: fprintf(fp, "Keywords: %s\n", hp->keywords);
69: if (*hp->approved)
70: fprintf(fp, "Approved: %s\n", hp->approved);
71: for (iu = 0; iu < NUNREC; iu++) {
72: if (hp->unrec[iu])
73: fprintf(fp, "%s", &hp->unrec[iu][0]);
74:
75: --- 519,528 -----
76: fprintf(fp, "Keywords: %s\n", hp->keywords);
77: if (*hp->approved)
78: fprintf(fp, "Approved: %s\n", hp->approved);
79: + #ifdef DOXREFS
80: + if (wr == 1 && *hp->xref)
81: + fprintf(fp, "Xref: %s\n", hp->xref);
82: + #endif DOXREFS
83: for (iu = 0; iu < NUNREC; iu++) {
84: if (hp->unrec[iu])
85: fprintf(fp, "%s", &hp->unrec[iu][0]);
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.