/* Block-related functions for the GNU debugger, GDB.
|
/* Block-related functions for the GNU debugger, GDB.
|
|
|
Copyright (C) 2003, 2007, 2008 Free Software Foundation, Inc.
|
Copyright (C) 2003, 2007, 2008 Free Software Foundation, Inc.
|
|
|
This file is part of GDB.
|
This file is part of GDB.
|
|
|
This program is free software; you can redistribute it and/or modify
|
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
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
#include "defs.h"
|
#include "defs.h"
|
#include "block.h"
|
#include "block.h"
|
#include "symtab.h"
|
#include "symtab.h"
|
#include "symfile.h"
|
#include "symfile.h"
|
#include "gdb_obstack.h"
|
#include "gdb_obstack.h"
|
#include "cp-support.h"
|
#include "cp-support.h"
|
#include "addrmap.h"
|
#include "addrmap.h"
|
|
|
/* This is used by struct block to store namespace-related info for
|
/* This is used by struct block to store namespace-related info for
|
C++ files, namely using declarations and the current namespace in
|
C++ files, namely using declarations and the current namespace in
|
scope. */
|
scope. */
|
|
|
struct block_namespace_info
|
struct block_namespace_info
|
{
|
{
|
const char *scope;
|
const char *scope;
|
struct using_direct *using;
|
struct using_direct *using;
|
};
|
};
|
|
|
static void block_initialize_namespace (struct block *block,
|
static void block_initialize_namespace (struct block *block,
|
struct obstack *obstack);
|
struct obstack *obstack);
|
|
|
/* Return Nonzero if block a is lexically nested within block b,
|
/* Return Nonzero if block a is lexically nested within block b,
|
or if a and b have the same pc range.
|
or if a and b have the same pc range.
|
Return zero otherwise. */
|
Return zero otherwise. */
|
|
|
int
|
int
|
contained_in (const struct block *a, const struct block *b)
|
contained_in (const struct block *a, const struct block *b)
|
{
|
{
|
if (!a || !b)
|
if (!a || !b)
|
return 0;
|
return 0;
|
return BLOCK_START (a) >= BLOCK_START (b)
|
return BLOCK_START (a) >= BLOCK_START (b)
|
&& BLOCK_END (a) <= BLOCK_END (b);
|
&& BLOCK_END (a) <= BLOCK_END (b);
|
}
|
}
|
|
|
|
|
/* Return the symbol for the function which contains a specified
|
/* Return the symbol for the function which contains a specified
|
lexical block, described by a struct block BL. */
|
lexical block, described by a struct block BL. */
|
|
|
struct symbol *
|
struct symbol *
|
block_function (const struct block *bl)
|
block_function (const struct block *bl)
|
{
|
{
|
while (BLOCK_FUNCTION (bl) == 0 && BLOCK_SUPERBLOCK (bl) != 0)
|
while (BLOCK_FUNCTION (bl) == 0 && BLOCK_SUPERBLOCK (bl) != 0)
|
bl = BLOCK_SUPERBLOCK (bl);
|
bl = BLOCK_SUPERBLOCK (bl);
|
|
|
return BLOCK_FUNCTION (bl);
|
return BLOCK_FUNCTION (bl);
|
}
|
}
|
|
|
/* Return the blockvector immediately containing the innermost lexical
|
/* Return the blockvector immediately containing the innermost lexical
|
block containing the specified pc value and section, or 0 if there
|
block containing the specified pc value and section, or 0 if there
|
is none. PBLOCK is a pointer to the block. If PBLOCK is NULL, we
|
is none. PBLOCK is a pointer to the block. If PBLOCK is NULL, we
|
don't pass this information back to the caller. */
|
don't pass this information back to the caller. */
|
|
|
struct blockvector *
|
struct blockvector *
|
blockvector_for_pc_sect (CORE_ADDR pc, struct bfd_section *section,
|
blockvector_for_pc_sect (CORE_ADDR pc, struct bfd_section *section,
|
struct block **pblock, struct symtab *symtab)
|
struct block **pblock, struct symtab *symtab)
|
{
|
{
|
struct block *b;
|
struct block *b;
|
int bot, top, half;
|
int bot, top, half;
|
struct blockvector *bl;
|
struct blockvector *bl;
|
|
|
if (symtab == 0) /* if no symtab specified by caller */
|
if (symtab == 0) /* if no symtab specified by caller */
|
{
|
{
|
/* First search all symtabs for one whose file contains our pc */
|
/* First search all symtabs for one whose file contains our pc */
|
symtab = find_pc_sect_symtab (pc, section);
|
symtab = find_pc_sect_symtab (pc, section);
|
if (symtab == 0)
|
if (symtab == 0)
|
return 0;
|
return 0;
|
}
|
}
|
|
|
bl = BLOCKVECTOR (symtab);
|
bl = BLOCKVECTOR (symtab);
|
|
|
/* Then search that symtab for the smallest block that wins. */
|
/* Then search that symtab for the smallest block that wins. */
|
|
|
/* If we have an addrmap mapping code addresses to blocks, then use
|
/* If we have an addrmap mapping code addresses to blocks, then use
|
that. */
|
that. */
|
if (BLOCKVECTOR_MAP (bl))
|
if (BLOCKVECTOR_MAP (bl))
|
{
|
{
|
b = addrmap_find (BLOCKVECTOR_MAP (bl), pc);
|
b = addrmap_find (BLOCKVECTOR_MAP (bl), pc);
|
if (b)
|
if (b)
|
{
|
{
|
if (pblock)
|
if (pblock)
|
*pblock = b;
|
*pblock = b;
|
return bl;
|
return bl;
|
}
|
}
|
else
|
else
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Otherwise, use binary search to find the last block that starts
|
/* Otherwise, use binary search to find the last block that starts
|
before PC. */
|
before PC. */
|
bot = 0;
|
bot = 0;
|
top = BLOCKVECTOR_NBLOCKS (bl);
|
top = BLOCKVECTOR_NBLOCKS (bl);
|
|
|
while (top - bot > 1)
|
while (top - bot > 1)
|
{
|
{
|
half = (top - bot + 1) >> 1;
|
half = (top - bot + 1) >> 1;
|
b = BLOCKVECTOR_BLOCK (bl, bot + half);
|
b = BLOCKVECTOR_BLOCK (bl, bot + half);
|
if (BLOCK_START (b) <= pc)
|
if (BLOCK_START (b) <= pc)
|
bot += half;
|
bot += half;
|
else
|
else
|
top = bot + half;
|
top = bot + half;
|
}
|
}
|
|
|
/* Now search backward for a block that ends after PC. */
|
/* Now search backward for a block that ends after PC. */
|
|
|
while (bot >= 0)
|
while (bot >= 0)
|
{
|
{
|
b = BLOCKVECTOR_BLOCK (bl, bot);
|
b = BLOCKVECTOR_BLOCK (bl, bot);
|
if (BLOCK_END (b) > pc)
|
if (BLOCK_END (b) > pc)
|
{
|
{
|
if (pblock)
|
if (pblock)
|
*pblock = b;
|
*pblock = b;
|
return bl;
|
return bl;
|
}
|
}
|
bot--;
|
bot--;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Return the blockvector immediately containing the innermost lexical block
|
/* Return the blockvector immediately containing the innermost lexical block
|
containing the specified pc value, or 0 if there is none.
|
containing the specified pc value, or 0 if there is none.
|
Backward compatibility, no section. */
|
Backward compatibility, no section. */
|
|
|
struct blockvector *
|
struct blockvector *
|
blockvector_for_pc (CORE_ADDR pc, struct block **pblock)
|
blockvector_for_pc (CORE_ADDR pc, struct block **pblock)
|
{
|
{
|
return blockvector_for_pc_sect (pc, find_pc_mapped_section (pc),
|
return blockvector_for_pc_sect (pc, find_pc_mapped_section (pc),
|
pblock, NULL);
|
pblock, NULL);
|
}
|
}
|
|
|
/* Return the innermost lexical block containing the specified pc value
|
/* Return the innermost lexical block containing the specified pc value
|
in the specified section, or 0 if there is none. */
|
in the specified section, or 0 if there is none. */
|
|
|
struct block *
|
struct block *
|
block_for_pc_sect (CORE_ADDR pc, struct bfd_section *section)
|
block_for_pc_sect (CORE_ADDR pc, struct bfd_section *section)
|
{
|
{
|
struct blockvector *bl;
|
struct blockvector *bl;
|
struct block *b;
|
struct block *b;
|
|
|
bl = blockvector_for_pc_sect (pc, section, &b, NULL);
|
bl = blockvector_for_pc_sect (pc, section, &b, NULL);
|
if (bl)
|
if (bl)
|
return b;
|
return b;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Return the innermost lexical block containing the specified pc value,
|
/* Return the innermost lexical block containing the specified pc value,
|
or 0 if there is none. Backward compatibility, no section. */
|
or 0 if there is none. Backward compatibility, no section. */
|
|
|
struct block *
|
struct block *
|
block_for_pc (CORE_ADDR pc)
|
block_for_pc (CORE_ADDR pc)
|
{
|
{
|
return block_for_pc_sect (pc, find_pc_mapped_section (pc));
|
return block_for_pc_sect (pc, find_pc_mapped_section (pc));
|
}
|
}
|
|
|
/* Now come some functions designed to deal with C++ namespace issues.
|
/* Now come some functions designed to deal with C++ namespace issues.
|
The accessors are safe to use even in the non-C++ case. */
|
The accessors are safe to use even in the non-C++ case. */
|
|
|
/* This returns the namespace that BLOCK is enclosed in, or "" if it
|
/* This returns the namespace that BLOCK is enclosed in, or "" if it
|
isn't enclosed in a namespace at all. This travels the chain of
|
isn't enclosed in a namespace at all. This travels the chain of
|
superblocks looking for a scope, if necessary. */
|
superblocks looking for a scope, if necessary. */
|
|
|
const char *
|
const char *
|
block_scope (const struct block *block)
|
block_scope (const struct block *block)
|
{
|
{
|
for (; block != NULL; block = BLOCK_SUPERBLOCK (block))
|
for (; block != NULL; block = BLOCK_SUPERBLOCK (block))
|
{
|
{
|
if (BLOCK_NAMESPACE (block) != NULL
|
if (BLOCK_NAMESPACE (block) != NULL
|
&& BLOCK_NAMESPACE (block)->scope != NULL)
|
&& BLOCK_NAMESPACE (block)->scope != NULL)
|
return BLOCK_NAMESPACE (block)->scope;
|
return BLOCK_NAMESPACE (block)->scope;
|
}
|
}
|
|
|
return "";
|
return "";
|
}
|
}
|
|
|
/* Set BLOCK's scope member to SCOPE; if needed, allocate memory via
|
/* Set BLOCK's scope member to SCOPE; if needed, allocate memory via
|
OBSTACK. (It won't make a copy of SCOPE, however, so that already
|
OBSTACK. (It won't make a copy of SCOPE, however, so that already
|
has to be allocated correctly.) */
|
has to be allocated correctly.) */
|
|
|
void
|
void
|
block_set_scope (struct block *block, const char *scope,
|
block_set_scope (struct block *block, const char *scope,
|
struct obstack *obstack)
|
struct obstack *obstack)
|
{
|
{
|
block_initialize_namespace (block, obstack);
|
block_initialize_namespace (block, obstack);
|
|
|
BLOCK_NAMESPACE (block)->scope = scope;
|
BLOCK_NAMESPACE (block)->scope = scope;
|
}
|
}
|
|
|
/* This returns the first using directives associated to BLOCK, if
|
/* This returns the first using directives associated to BLOCK, if
|
any. */
|
any. */
|
|
|
/* FIXME: carlton/2003-04-23: This uses the fact that we currently
|
/* FIXME: carlton/2003-04-23: This uses the fact that we currently
|
only have using directives in static blocks, because we only
|
only have using directives in static blocks, because we only
|
generate using directives from anonymous namespaces. Eventually,
|
generate using directives from anonymous namespaces. Eventually,
|
when we support using directives everywhere, we'll want to replace
|
when we support using directives everywhere, we'll want to replace
|
this by some iterator functions. */
|
this by some iterator functions. */
|
|
|
struct using_direct *
|
struct using_direct *
|
block_using (const struct block *block)
|
block_using (const struct block *block)
|
{
|
{
|
const struct block *static_block = block_static_block (block);
|
const struct block *static_block = block_static_block (block);
|
|
|
if (static_block == NULL
|
if (static_block == NULL
|
|| BLOCK_NAMESPACE (static_block) == NULL)
|
|| BLOCK_NAMESPACE (static_block) == NULL)
|
return NULL;
|
return NULL;
|
else
|
else
|
return BLOCK_NAMESPACE (static_block)->using;
|
return BLOCK_NAMESPACE (static_block)->using;
|
}
|
}
|
|
|
/* Set BLOCK's using member to USING; if needed, allocate memory via
|
/* Set BLOCK's using member to USING; if needed, allocate memory via
|
OBSTACK. (It won't make a copy of USING, however, so that already
|
OBSTACK. (It won't make a copy of USING, however, so that already
|
has to be allocated correctly.) */
|
has to be allocated correctly.) */
|
|
|
void
|
void
|
block_set_using (struct block *block,
|
block_set_using (struct block *block,
|
struct using_direct *using,
|
struct using_direct *using,
|
struct obstack *obstack)
|
struct obstack *obstack)
|
{
|
{
|
block_initialize_namespace (block, obstack);
|
block_initialize_namespace (block, obstack);
|
|
|
BLOCK_NAMESPACE (block)->using = using;
|
BLOCK_NAMESPACE (block)->using = using;
|
}
|
}
|
|
|
/* If BLOCK_NAMESPACE (block) is NULL, allocate it via OBSTACK and
|
/* If BLOCK_NAMESPACE (block) is NULL, allocate it via OBSTACK and
|
ititialize its members to zero. */
|
ititialize its members to zero. */
|
|
|
static void
|
static void
|
block_initialize_namespace (struct block *block, struct obstack *obstack)
|
block_initialize_namespace (struct block *block, struct obstack *obstack)
|
{
|
{
|
if (BLOCK_NAMESPACE (block) == NULL)
|
if (BLOCK_NAMESPACE (block) == NULL)
|
{
|
{
|
BLOCK_NAMESPACE (block)
|
BLOCK_NAMESPACE (block)
|
= obstack_alloc (obstack, sizeof (struct block_namespace_info));
|
= obstack_alloc (obstack, sizeof (struct block_namespace_info));
|
BLOCK_NAMESPACE (block)->scope = NULL;
|
BLOCK_NAMESPACE (block)->scope = NULL;
|
BLOCK_NAMESPACE (block)->using = NULL;
|
BLOCK_NAMESPACE (block)->using = NULL;
|
}
|
}
|
}
|
}
|
|
|
/* Return the static block associated to BLOCK. Return NULL if block
|
/* Return the static block associated to BLOCK. Return NULL if block
|
is NULL or if block is a global block. */
|
is NULL or if block is a global block. */
|
|
|
const struct block *
|
const struct block *
|
block_static_block (const struct block *block)
|
block_static_block (const struct block *block)
|
{
|
{
|
if (block == NULL || BLOCK_SUPERBLOCK (block) == NULL)
|
if (block == NULL || BLOCK_SUPERBLOCK (block) == NULL)
|
return NULL;
|
return NULL;
|
|
|
while (BLOCK_SUPERBLOCK (BLOCK_SUPERBLOCK (block)) != NULL)
|
while (BLOCK_SUPERBLOCK (BLOCK_SUPERBLOCK (block)) != NULL)
|
block = BLOCK_SUPERBLOCK (block);
|
block = BLOCK_SUPERBLOCK (block);
|
|
|
return block;
|
return block;
|
}
|
}
|
|
|
/* Return the static block associated to BLOCK. Return NULL if block
|
/* Return the static block associated to BLOCK. Return NULL if block
|
is NULL. */
|
is NULL. */
|
|
|
const struct block *
|
const struct block *
|
block_global_block (const struct block *block)
|
block_global_block (const struct block *block)
|
{
|
{
|
if (block == NULL)
|
if (block == NULL)
|
return NULL;
|
return NULL;
|
|
|
while (BLOCK_SUPERBLOCK (block) != NULL)
|
while (BLOCK_SUPERBLOCK (block) != NULL)
|
block = BLOCK_SUPERBLOCK (block);
|
block = BLOCK_SUPERBLOCK (block);
|
|
|
return block;
|
return block;
|
}
|
}
|
|
|
/* Allocate a block on OBSTACK, and initialize its elements to
|
/* Allocate a block on OBSTACK, and initialize its elements to
|
zero/NULL. This is useful for creating "dummy" blocks that don't
|
zero/NULL. This is useful for creating "dummy" blocks that don't
|
correspond to actual source files.
|
correspond to actual source files.
|
|
|
Warning: it sets the block's BLOCK_DICT to NULL, which isn't a
|
Warning: it sets the block's BLOCK_DICT to NULL, which isn't a
|
valid value. If you really don't want the block to have a
|
valid value. If you really don't want the block to have a
|
dictionary, then you should subsequently set its BLOCK_DICT to
|
dictionary, then you should subsequently set its BLOCK_DICT to
|
dict_create_linear (obstack, NULL). */
|
dict_create_linear (obstack, NULL). */
|
|
|
struct block *
|
struct block *
|
allocate_block (struct obstack *obstack)
|
allocate_block (struct obstack *obstack)
|
{
|
{
|
struct block *bl = obstack_alloc (obstack, sizeof (struct block));
|
struct block *bl = obstack_alloc (obstack, sizeof (struct block));
|
|
|
BLOCK_START (bl) = 0;
|
BLOCK_START (bl) = 0;
|
BLOCK_END (bl) = 0;
|
BLOCK_END (bl) = 0;
|
BLOCK_FUNCTION (bl) = NULL;
|
BLOCK_FUNCTION (bl) = NULL;
|
BLOCK_SUPERBLOCK (bl) = NULL;
|
BLOCK_SUPERBLOCK (bl) = NULL;
|
BLOCK_DICT (bl) = NULL;
|
BLOCK_DICT (bl) = NULL;
|
BLOCK_NAMESPACE (bl) = NULL;
|
BLOCK_NAMESPACE (bl) = NULL;
|
|
|
return bl;
|
return bl;
|
}
|
}
|
|
|
