2010-10-27 06:38:25 -05:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2001-04-18 03:11:00 -05:00
|
|
|
/* $XConsortium: pr.c,v 1.17 94/04/17 20:10:38 gildea Exp $ */
|
|
|
|
/*
|
|
|
|
|
|
|
|
Copyright (c) 1993, 1994 X Consortium
|
|
|
|
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
|
|
in the Software without restriction, including without limitation the rights
|
|
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
|
|
all copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
|
|
|
|
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
|
|
|
|
Except as contained in this notice, the name of the X Consortium shall not be
|
|
|
|
used in advertising or otherwise to promote the sale, use or other dealings
|
|
|
|
in this Software without prior written authorization from the X Consortium.
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "def.h"
|
2004-04-21 07:27:34 -05:00
|
|
|
#include <string.h>
|
2012-03-21 15:50:07 -05:00
|
|
|
size_t pr( struct inclist *ip, char *file,char *base);
|
2001-04-18 03:11:00 -05:00
|
|
|
|
|
|
|
extern struct inclist inclist[ MAXFILES ],
|
|
|
|
*inclistp;
|
|
|
|
extern char *objprefix;
|
|
|
|
extern char *objsuffix;
|
|
|
|
extern int width;
|
|
|
|
extern boolean printed;
|
|
|
|
extern boolean verbose;
|
|
|
|
extern boolean show_where_not;
|
|
|
|
|
2011-10-17 16:13:51 -05:00
|
|
|
void add_include(struct filepointer *filep, struct inclist *file, struct inclist *file_red, char *include, boolean dot, boolean failOK, struct IncludesCollection* incCollection, struct symhash *symbols)
|
2001-04-18 03:11:00 -05:00
|
|
|
{
|
|
|
|
register struct inclist *newfile;
|
|
|
|
register struct filepointer *content;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* First decide what the pathname of this include file really is.
|
|
|
|
*/
|
2006-09-22 02:57:51 -05:00
|
|
|
newfile = inc_path(file->i_file, include, dot, incCollection);
|
2001-04-18 03:11:00 -05:00
|
|
|
if (newfile == NULL) {
|
|
|
|
if (failOK)
|
|
|
|
return;
|
|
|
|
if (file != file_red)
|
|
|
|
warning("%s (reading %s, line %d): ",
|
|
|
|
file_red->i_file, file->i_file, filep->f_line);
|
|
|
|
else
|
|
|
|
warning("%s, line %d: ", file->i_file, filep->f_line);
|
|
|
|
warning1("cannot find include file \"%s\"\n", include);
|
|
|
|
show_where_not = TRUE;
|
2006-09-22 02:57:51 -05:00
|
|
|
newfile = inc_path(file->i_file, include, dot, incCollection);
|
2001-04-18 03:11:00 -05:00
|
|
|
show_where_not = FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (newfile) {
|
|
|
|
|
|
|
|
/* Only add new dependency files if they don't have "/usr/include" in them. */
|
|
|
|
if (!(newfile && newfile->i_file && strstr(newfile->i_file, "/usr/"))) {
|
|
|
|
included_by(file, newfile);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!newfile->i_searched) {
|
|
|
|
newfile->i_searched = TRUE;
|
|
|
|
content = getfile(newfile->i_file);
|
2008-04-10 12:06:39 -05:00
|
|
|
find_includes(content, newfile, file_red, 0, failOK, incCollection, symbols);
|
2001-04-18 03:11:00 -05:00
|
|
|
freefile(content);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-04-21 07:27:34 -05:00
|
|
|
void recursive_pr_include(head, file, base)
|
2001-04-18 03:11:00 -05:00
|
|
|
register struct inclist *head;
|
|
|
|
register char *file, *base;
|
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
|
|
|
|
if (head->i_marked)
|
|
|
|
return;
|
|
|
|
head->i_marked = TRUE;
|
|
|
|
if (head->i_file != file)
|
|
|
|
pr(head, file, base);
|
|
|
|
for (i=0; i<head->i_listlen; i++)
|
|
|
|
recursive_pr_include(head->i_list[ i ], file, base);
|
|
|
|
}
|
|
|
|
|
2012-03-21 15:50:07 -05:00
|
|
|
size_t pr(ip, file, base)
|
2001-04-18 03:11:00 -05:00
|
|
|
register struct inclist *ip;
|
|
|
|
char *file, *base;
|
|
|
|
{
|
2012-03-21 15:50:07 -05:00
|
|
|
size_t ret;
|
2001-04-18 03:11:00 -05:00
|
|
|
static char *lastfile;
|
|
|
|
static int current_len;
|
|
|
|
register int len, i;
|
|
|
|
char buf[ BUFSIZ ];
|
|
|
|
|
|
|
|
printed = TRUE;
|
2011-02-02 16:43:44 -06:00
|
|
|
len = (int)strlen(ip->i_file)+1;
|
2001-04-18 03:11:00 -05:00
|
|
|
if (current_len + len > width || file != lastfile) {
|
|
|
|
lastfile = file;
|
|
|
|
sprintf(buf, "\n%s%s%s: %s", objprefix, base, objsuffix,
|
|
|
|
ip->i_file);
|
2011-02-02 16:43:44 -06:00
|
|
|
len = current_len = (int)strlen(buf);
|
2001-04-18 03:11:00 -05:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
buf[0] = ' ';
|
|
|
|
strcpy(buf+1, ip->i_file);
|
|
|
|
current_len += len;
|
|
|
|
}
|
2012-03-21 15:50:07 -05:00
|
|
|
ret = fwrite(buf, len, 1, stdout);
|
2001-04-18 03:11:00 -05:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If verbose is set, then print out what this file includes.
|
|
|
|
*/
|
|
|
|
if (! verbose || ip->i_list == NULL || ip->i_notified)
|
2012-03-21 15:50:07 -05:00
|
|
|
return ret;
|
2001-04-18 03:11:00 -05:00
|
|
|
ip->i_notified = TRUE;
|
|
|
|
lastfile = NULL;
|
|
|
|
printf("\n# %s includes:", ip->i_file);
|
|
|
|
for (i=0; i<ip->i_listlen; i++)
|
|
|
|
printf("\n#\t%s", ip->i_list[ i ]->i_incstring);
|
2012-03-21 15:50:07 -05:00
|
|
|
return ret;
|
2001-04-18 03:11:00 -05:00
|
|
|
}
|
2010-10-27 06:38:25 -05:00
|
|
|
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|