1 |
/* $XConsortium: pr.c,v 1.17 94/04/17 20:10:38 gildea Exp $ */ |
2 |
/* |
3 |
* Copyright (c) 1998-2003 Carnegie Mellon University. All rights reserved. |
4 |
* |
5 |
* Redistribution and use in source and binary forms, with or without |
6 |
* modification, are permitted provided that the following conditions |
7 |
* are met: |
8 |
* |
9 |
* 1. Redistributions of source code must retain the above copyright |
10 |
* notice, this list of conditions and the following disclaimer. |
11 |
* |
12 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
* notice, this list of conditions and the following disclaimer in |
14 |
* the documentation and/or other materials provided with the |
15 |
* distribution. |
16 |
* |
17 |
* 3. The name "Carnegie Mellon University" must not be used to |
18 |
* endorse or promote products derived from this software without |
19 |
* prior written permission. For permission or any other legal |
20 |
* details, please contact |
21 |
* Office of Technology Transfer |
22 |
* Carnegie Mellon University |
23 |
* 5000 Forbes Avenue |
24 |
* Pittsburgh, PA 15213-3890 |
25 |
* (412) 268-4387, fax: (412) 268-7395 |
26 |
* tech-transfer@andrew.cmu.edu |
27 |
* |
28 |
* 4. Redistributions of any form whatsoever must retain the following |
29 |
* acknowledgment: |
30 |
* "This product includes software developed by Computing Services |
31 |
* at Carnegie Mellon University (http://www.cmu.edu/computing/)." |
32 |
* |
33 |
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO |
34 |
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY |
35 |
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE |
36 |
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
37 |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN |
38 |
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING |
39 |
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
40 |
* |
41 |
*/ |
42 |
/* |
43 |
|
44 |
Copyright (c) 1993, 1994 X Consortium |
45 |
|
46 |
Permission is hereby granted, free of charge, to any person obtaining a copy |
47 |
of this software and associated documentation files (the "Software"), to deal |
48 |
in the Software without restriction, including without limitation the rights |
49 |
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
50 |
copies of the Software, and to permit persons to whom the Software is |
51 |
furnished to do so, subject to the following conditions: |
52 |
|
53 |
The above copyright notice and this permission notice shall be included in |
54 |
all copies or substantial portions of the Software. |
55 |
|
56 |
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
57 |
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
58 |
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
59 |
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN |
60 |
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
61 |
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
62 |
|
63 |
Except as contained in this notice, the name of the X Consortium shall not be |
64 |
used in advertising or otherwise to promote the sale, use or other dealings |
65 |
in this Software without prior written authorization from the X Consortium. |
66 |
|
67 |
*/ |
68 |
|
69 |
#include "def.h" |
70 |
|
71 |
extern struct inclist inclist[ MAXFILES ], |
72 |
*inclistp; |
73 |
extern char *objprefix; |
74 |
extern char *objsuffix; |
75 |
extern int width; |
76 |
extern boolean printed; |
77 |
extern boolean verbose; |
78 |
extern boolean show_where_not; |
79 |
|
80 |
add_include(filep, file, file_red, include, dot, failOK) |
81 |
struct filepointer *filep; |
82 |
struct inclist *file, *file_red; |
83 |
char *include; |
84 |
boolean dot; |
85 |
{ |
86 |
register struct inclist *newfile; |
87 |
register struct filepointer *content; |
88 |
|
89 |
/* |
90 |
* First decide what the pathname of this include file really is. |
91 |
*/ |
92 |
newfile = inc_path(file->i_file, include, dot); |
93 |
if (newfile == NULL) { |
94 |
if (failOK) |
95 |
return; |
96 |
if (file != file_red) |
97 |
warning("%s (reading %s, line %d): ", |
98 |
file_red->i_file, file->i_file, filep->f_line); |
99 |
else |
100 |
warning("%s, line %d: ", file->i_file, filep->f_line); |
101 |
warning1("cannot find include file \"%s\"\n", include); |
102 |
show_where_not = TRUE; |
103 |
newfile = inc_path(file->i_file, include, dot); |
104 |
show_where_not = FALSE; |
105 |
} |
106 |
|
107 |
if (newfile) { |
108 |
included_by(file, newfile); |
109 |
if (!newfile->i_searched) { |
110 |
newfile->i_searched = TRUE; |
111 |
content = getfile(newfile->i_file); |
112 |
find_includes(content, newfile, file_red, 0, failOK); |
113 |
freefile(content); |
114 |
} |
115 |
} |
116 |
} |
117 |
|
118 |
recursive_pr_include(head, file, base) |
119 |
register struct inclist *head; |
120 |
register char *file, *base; |
121 |
{ |
122 |
register int i; |
123 |
|
124 |
if (head->i_marked) |
125 |
return; |
126 |
head->i_marked = TRUE; |
127 |
if (head->i_file != file) |
128 |
pr(head, file, base); |
129 |
for (i=0; i<head->i_listlen; i++) |
130 |
recursive_pr_include(head->i_list[ i ], file, base); |
131 |
} |
132 |
|
133 |
pr(ip, file, base) |
134 |
register struct inclist *ip; |
135 |
char *file, *base; |
136 |
{ |
137 |
static char *lastfile; |
138 |
static int current_len; |
139 |
register int len, i; |
140 |
char buf[ BUFSIZ ]; |
141 |
|
142 |
printed = TRUE; |
143 |
len = strlen(ip->i_file)+1; |
144 |
if (current_len + len > width || file != lastfile) { |
145 |
lastfile = file; |
146 |
sprintf(buf, "\n%s%s%s: %s", objprefix, base, objsuffix, |
147 |
ip->i_file); |
148 |
len = current_len = strlen(buf); |
149 |
} |
150 |
else { |
151 |
buf[0] = ' '; |
152 |
strcpy(buf+1, ip->i_file); |
153 |
current_len += len; |
154 |
} |
155 |
fwrite(buf, len, 1, stdout); |
156 |
|
157 |
/* |
158 |
* If verbose is set, then print out what this file includes. |
159 |
*/ |
160 |
if (! verbose || ip->i_list == NULL || ip->i_notified) |
161 |
return; |
162 |
ip->i_notified = TRUE; |
163 |
lastfile = NULL; |
164 |
printf("\n# %s includes:", ip->i_file); |
165 |
for (i=0; i<ip->i_listlen; i++) |
166 |
printf("\n#\t%s", ip->i_list[ i ]->i_incstring); |
167 |
} |