1999-04-16 03:35:26 +02:00
|
|
|
/* Support for complaint handling during symbol reading in GDB.
|
2002-09-19 02:42:41 +02:00
|
|
|
|
|
|
|
Copyright 1990, 1991, 1992, 1993, 1995, 1998, 1999, 2000, 2002 Free
|
|
|
|
Software Foundation, Inc.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
This file is part of GDB.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
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.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
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.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
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. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
#include "defs.h"
|
|
|
|
#include "complaints.h"
|
2002-09-19 02:42:41 +02:00
|
|
|
#include "gdb_assert.h"
|
|
|
|
#include "command.h"
|
1999-04-16 03:35:26 +02:00
|
|
|
#include "gdbcmd.h"
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
extern void _initialize_complaints (void);
|
1999-05-25 20:09:09 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* Should each complaint message be self explanatory, or should we assume that
|
|
|
|
a series of complaints is being produced? */
|
|
|
|
|
|
|
|
/* case 1: First message of a series that must
|
|
|
|
start off with explanation. case 2: Subsequent message of a series
|
|
|
|
that needs no explanation (the user already knows we have a problem
|
|
|
|
so we can just state our piece). */
|
|
|
|
enum complaint_series {
|
|
|
|
/* Isolated self explanatory message. */
|
|
|
|
ISOLATED_MESSAGE,
|
|
|
|
/* First message of a series, includes an explanation. */
|
|
|
|
FIRST_MESSAGE,
|
|
|
|
/* First message of a series, but does not need to include any sort
|
|
|
|
of explanation. */
|
|
|
|
SHORT_FIRST_MESSAGE,
|
|
|
|
/* Subsequent message of a series that needs no explanation (the
|
|
|
|
user already knows we have a problem so we can just state our
|
|
|
|
piece). */
|
|
|
|
SUBSEQUENT_MESSAGE
|
|
|
|
};
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
/* Structure to manage complaints about symbol file contents. */
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
struct complain
|
1999-07-07 22:19:36 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
const char *file;
|
|
|
|
int line;
|
|
|
|
const char *fmt;
|
|
|
|
int counter;
|
|
|
|
struct complain *next;
|
1999-04-16 03:35:26 +02:00
|
|
|
};
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
struct complaints
|
|
|
|
{
|
|
|
|
struct complain *root;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* Should each complaint be self explanatory, or should we assume
|
|
|
|
that a series of complaints is being produced? case 0: Isolated
|
|
|
|
self explanatory message. case 1: First message of a series that
|
|
|
|
must start off with explanation. case 2: Subsequent message of a
|
|
|
|
series that needs no explanation (the user already knows we have
|
|
|
|
a problem so we can just state our piece). */
|
|
|
|
int series;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* The explanatory messages that should accompany the complaint.
|
|
|
|
NOTE: cagney/2002-08-14: In a desperate attempt at being vaguely
|
|
|
|
i18n friendly, this is an array of two messages. When present,
|
|
|
|
EXPLANATION[SERIES] is used to wrap the message. */
|
|
|
|
const char **explanation;
|
|
|
|
};
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
static struct complain complaint_sentinel;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* The symbol table complaint table. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
static const char *symfile_explanations[] = {
|
|
|
|
"During symbol reading, %s.\n",
|
|
|
|
"During symbol reading...%s...",
|
|
|
|
"%s...",
|
|
|
|
"%s...",
|
|
|
|
NULL
|
|
|
|
};
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
static struct complaints symfile_complaint_book = {
|
|
|
|
&complaint_sentinel,
|
|
|
|
0,
|
|
|
|
symfile_explanations
|
|
|
|
};
|
|
|
|
struct complaints *symfile_complaints = &symfile_complaint_book;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* Wrapper function to, on-demand, fill in a complaints object. */
|
|
|
|
|
|
|
|
static struct complaints *
|
|
|
|
get_complaints (struct complaints **c)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
if ((*c) != NULL)
|
|
|
|
return (*c);
|
|
|
|
(*c) = XMALLOC (struct complaints);
|
|
|
|
(*c)->root = &complaint_sentinel;
|
|
|
|
(*c)->series = ISOLATED_MESSAGE;
|
|
|
|
(*c)->explanation = NULL;
|
|
|
|
return (*c);
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
static struct complain *
|
|
|
|
find_complaint (struct complaints *complaints, const char *file,
|
|
|
|
int line, const char *fmt)
|
|
|
|
{
|
|
|
|
struct complain *complaint;
|
|
|
|
|
|
|
|
/* Find the complaint in the table. A more efficient search
|
|
|
|
algorithm (based on hash table or something) could be used. But
|
|
|
|
that can wait until someone shows evidence that this lookup is
|
|
|
|
a real bottle neck. */
|
|
|
|
for (complaint = complaints->root;
|
|
|
|
complaint != NULL;
|
|
|
|
complaint = complaint->next)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
if (complaint->fmt == fmt
|
|
|
|
&& complaint->file == file
|
|
|
|
&& complaint->line == line)
|
|
|
|
return complaint;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
2002-09-19 02:42:41 +02:00
|
|
|
|
|
|
|
/* Oops not seen before, fill in a new complaint. */
|
|
|
|
complaint = XMALLOC (struct complain);
|
|
|
|
complaint->fmt = fmt;
|
|
|
|
complaint->file = file;
|
|
|
|
complaint->line = line;
|
|
|
|
complaint->counter = 0;
|
|
|
|
complaint->next = NULL;
|
|
|
|
|
|
|
|
/* File it, return it. */
|
|
|
|
complaint->next = complaints->root;
|
|
|
|
complaints->root = complaint;
|
|
|
|
return complaint;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* How many complaints about a particular thing should be printed
|
|
|
|
before we stop whining about it? Default is no whining at all,
|
|
|
|
since so many systems have ill-constructed symbol files. */
|
|
|
|
|
|
|
|
static unsigned int stop_whining = 0;
|
|
|
|
|
|
|
|
/* Print a complaint, and link the complaint block into a chain for
|
|
|
|
later handling. */
|
|
|
|
|
|
|
|
static void
|
|
|
|
vcomplaint (struct complaints **c, const char *file, int line, const char *fmt,
|
|
|
|
va_list args)
|
|
|
|
{
|
|
|
|
struct complaints *complaints = get_complaints (c);
|
|
|
|
struct complain *complaint = find_complaint (complaints, file, line, fmt);
|
|
|
|
enum complaint_series series;
|
|
|
|
gdb_assert (complaints != NULL);
|
|
|
|
|
|
|
|
complaint->counter++;
|
1999-07-07 22:19:36 +02:00
|
|
|
if (complaint->counter > stop_whining)
|
2002-09-19 02:42:41 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
if (info_verbose)
|
|
|
|
series = SUBSEQUENT_MESSAGE;
|
|
|
|
else
|
|
|
|
series = complaints->series;
|
|
|
|
|
|
|
|
if (complaint->file != NULL)
|
|
|
|
internal_vwarning (complaint->file, complaint->line, complaint->fmt, args);
|
|
|
|
else if (warning_hook)
|
|
|
|
(*warning_hook) (complaint->fmt, args);
|
|
|
|
else
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
if (complaints->explanation == NULL)
|
|
|
|
vwarning (complaint->fmt, args);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
char *msg;
|
|
|
|
struct cleanup *cleanups;
|
|
|
|
xvasprintf (&msg, complaint->fmt, args);
|
|
|
|
cleanups = make_cleanup (xfree, msg);
|
|
|
|
wrap_here ("");
|
|
|
|
if (series != SUBSEQUENT_MESSAGE)
|
|
|
|
begin_line ();
|
|
|
|
fprintf_filtered (gdb_stderr,
|
|
|
|
complaints->explanation[series],
|
|
|
|
msg);
|
|
|
|
wrap_here ("");
|
|
|
|
do_cleanups (cleanups);
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
switch (series)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
case ISOLATED_MESSAGE:
|
1999-07-07 22:19:36 +02:00
|
|
|
break;
|
2002-09-19 02:42:41 +02:00
|
|
|
case FIRST_MESSAGE:
|
|
|
|
complaints->series = SUBSEQUENT_MESSAGE;
|
|
|
|
break;
|
|
|
|
case SUBSEQUENT_MESSAGE:
|
|
|
|
case SHORT_FIRST_MESSAGE:
|
|
|
|
complaints->series = SUBSEQUENT_MESSAGE;
|
1999-07-07 22:19:36 +02:00
|
|
|
break;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
2002-09-19 02:42:41 +02:00
|
|
|
|
|
|
|
/* If GDB dumps core, we'd like to see the complaints first.
|
|
|
|
Presumably GDB will not be sending so many complaints that this
|
|
|
|
becomes a performance hog. */
|
|
|
|
|
1999-09-28 23:55:21 +02:00
|
|
|
gdb_flush (gdb_stderr);
|
2002-09-19 02:42:41 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
complaint (struct complaints **complaints, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
va_start (args, fmt);
|
|
|
|
vcomplaint (complaints, NULL/*file*/, 0/*line*/, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
internal_complaint (struct complaints **complaints, const char *file,
|
|
|
|
int line, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
va_start (args, fmt);
|
|
|
|
vcomplaint (complaints, file, line, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
complain (struct complaint *complaint, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
va_start (args, complaint);
|
|
|
|
vcomplaint (&symfile_complaints, NULL/*file*/, 0/*line*/,
|
|
|
|
complaint->message, args);
|
1999-04-16 03:35:26 +02:00
|
|
|
va_end (args);
|
|
|
|
}
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
/* Clear out / initialize all complaint counters that have ever been
|
|
|
|
incremented. If LESS_VERBOSE is 1, be less verbose about
|
|
|
|
successive complaints, since the messages are appearing all
|
|
|
|
together during a command that is reporting a contiguous block of
|
|
|
|
complaints (rather than being interleaved with other messages). If
|
|
|
|
noisy is 1, we are in a noisy command, and our caller will print
|
|
|
|
enough context for the user to figure it out. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
void
|
2002-09-19 02:42:41 +02:00
|
|
|
clear_complaints (struct complaints **c, int less_verbose, int noisy)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
struct complaints *complaints = get_complaints (c);
|
|
|
|
struct complain *p;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
for (p = complaints->root; p != NULL; p = p->next)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
p->counter = 0;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
if (complaints->series > 1 && !warning_hook)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
|
|
|
/* Terminate previous series, since caller won't. */
|
|
|
|
puts_filtered ("\n");
|
|
|
|
}
|
|
|
|
|
2002-09-19 02:42:41 +02:00
|
|
|
if (!less_verbose)
|
|
|
|
complaints->series = ISOLATED_MESSAGE;
|
|
|
|
else if (!noisy)
|
|
|
|
complaints->series = FIRST_MESSAGE;
|
|
|
|
else
|
|
|
|
complaints->series = SHORT_FIRST_MESSAGE;
|
1999-04-16 03:35:26 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
_initialize_complaints (void)
|
1999-04-16 03:35:26 +02:00
|
|
|
{
|
2002-09-19 02:42:41 +02:00
|
|
|
add_setshow_cmd ("complaints", class_support, var_zinteger,
|
|
|
|
&stop_whining,
|
|
|
|
"Set max number of complaints about incorrect symbols.",
|
|
|
|
"Show max number of complaints about incorrect symbols.",
|
|
|
|
NULL, NULL,
|
|
|
|
&setlist, &showlist);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
}
|