1 /* Block-related functions for the GNU debugger, GDB.
3 Copyright (C) 2003, 2007, 2008 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_obstack.h"
25 #include "cp-support.h"
28 /* This is used by struct block to store namespace-related info for
29 C++ files, namely using declarations and the current namespace in
32 struct block_namespace_info
35 struct using_direct
*using;
38 static void block_initialize_namespace (struct block
*block
,
39 struct obstack
*obstack
);
41 /* Return Nonzero if block a is lexically nested within block b,
42 or if a and b have the same pc range.
43 Return zero otherwise. */
46 contained_in (const struct block
*a
, const struct block
*b
)
50 return BLOCK_START (a
) >= BLOCK_START (b
)
51 && BLOCK_END (a
) <= BLOCK_END (b
);
55 /* Return the symbol for the function which contains a specified
56 lexical block, described by a struct block BL. */
59 block_function (const struct block
*bl
)
61 while (BLOCK_FUNCTION (bl
) == 0 && BLOCK_SUPERBLOCK (bl
) != 0)
62 bl
= BLOCK_SUPERBLOCK (bl
);
64 return BLOCK_FUNCTION (bl
);
67 /* Return the blockvector immediately containing the innermost lexical
68 block containing the specified pc value and section, or 0 if there
69 is none. PBLOCK is a pointer to the block. If PBLOCK is NULL, we
70 don't pass this information back to the caller. */
73 blockvector_for_pc_sect (CORE_ADDR pc
, struct bfd_section
*section
,
74 struct block
**pblock
, struct symtab
*symtab
)
78 struct blockvector
*bl
;
80 if (symtab
== 0) /* if no symtab specified by caller */
82 /* First search all symtabs for one whose file contains our pc */
83 symtab
= find_pc_sect_symtab (pc
, section
);
88 bl
= BLOCKVECTOR (symtab
);
90 /* Then search that symtab for the smallest block that wins. */
92 /* If we have an addrmap mapping code addresses to blocks, then use
94 if (BLOCKVECTOR_MAP (bl
))
96 b
= addrmap_find (BLOCKVECTOR_MAP (bl
), pc
);
108 /* Otherwise, use binary search to find the last block that starts
111 top
= BLOCKVECTOR_NBLOCKS (bl
);
113 while (top
- bot
> 1)
115 half
= (top
- bot
+ 1) >> 1;
116 b
= BLOCKVECTOR_BLOCK (bl
, bot
+ half
);
117 if (BLOCK_START (b
) <= pc
)
123 /* Now search backward for a block that ends after PC. */
127 b
= BLOCKVECTOR_BLOCK (bl
, bot
);
128 if (BLOCK_END (b
) > pc
)
139 /* Return the blockvector immediately containing the innermost lexical block
140 containing the specified pc value, or 0 if there is none.
141 Backward compatibility, no section. */
144 blockvector_for_pc (CORE_ADDR pc
, struct block
**pblock
)
146 return blockvector_for_pc_sect (pc
, find_pc_mapped_section (pc
),
150 /* Return the innermost lexical block containing the specified pc value
151 in the specified section, or 0 if there is none. */
154 block_for_pc_sect (CORE_ADDR pc
, struct bfd_section
*section
)
156 struct blockvector
*bl
;
159 bl
= blockvector_for_pc_sect (pc
, section
, &b
, NULL
);
165 /* Return the innermost lexical block containing the specified pc value,
166 or 0 if there is none. Backward compatibility, no section. */
169 block_for_pc (CORE_ADDR pc
)
171 return block_for_pc_sect (pc
, find_pc_mapped_section (pc
));
174 /* Now come some functions designed to deal with C++ namespace issues.
175 The accessors are safe to use even in the non-C++ case. */
177 /* This returns the namespace that BLOCK is enclosed in, or "" if it
178 isn't enclosed in a namespace at all. This travels the chain of
179 superblocks looking for a scope, if necessary. */
182 block_scope (const struct block
*block
)
184 for (; block
!= NULL
; block
= BLOCK_SUPERBLOCK (block
))
186 if (BLOCK_NAMESPACE (block
) != NULL
187 && BLOCK_NAMESPACE (block
)->scope
!= NULL
)
188 return BLOCK_NAMESPACE (block
)->scope
;
194 /* Set BLOCK's scope member to SCOPE; if needed, allocate memory via
195 OBSTACK. (It won't make a copy of SCOPE, however, so that already
196 has to be allocated correctly.) */
199 block_set_scope (struct block
*block
, const char *scope
,
200 struct obstack
*obstack
)
202 block_initialize_namespace (block
, obstack
);
204 BLOCK_NAMESPACE (block
)->scope
= scope
;
207 /* This returns the first using directives associated to BLOCK, if
210 /* FIXME: carlton/2003-04-23: This uses the fact that we currently
211 only have using directives in static blocks, because we only
212 generate using directives from anonymous namespaces. Eventually,
213 when we support using directives everywhere, we'll want to replace
214 this by some iterator functions. */
216 struct using_direct
*
217 block_using (const struct block
*block
)
219 const struct block
*static_block
= block_static_block (block
);
221 if (static_block
== NULL
222 || BLOCK_NAMESPACE (static_block
) == NULL
)
225 return BLOCK_NAMESPACE (static_block
)->using;
228 /* Set BLOCK's using member to USING; if needed, allocate memory via
229 OBSTACK. (It won't make a copy of USING, however, so that already
230 has to be allocated correctly.) */
233 block_set_using (struct block
*block
,
234 struct using_direct
*using,
235 struct obstack
*obstack
)
237 block_initialize_namespace (block
, obstack
);
239 BLOCK_NAMESPACE (block
)->using = using;
242 /* If BLOCK_NAMESPACE (block) is NULL, allocate it via OBSTACK and
243 ititialize its members to zero. */
246 block_initialize_namespace (struct block
*block
, struct obstack
*obstack
)
248 if (BLOCK_NAMESPACE (block
) == NULL
)
250 BLOCK_NAMESPACE (block
)
251 = obstack_alloc (obstack
, sizeof (struct block_namespace_info
));
252 BLOCK_NAMESPACE (block
)->scope
= NULL
;
253 BLOCK_NAMESPACE (block
)->using = NULL
;
257 /* Return the static block associated to BLOCK. Return NULL if block
258 is NULL or if block is a global block. */
261 block_static_block (const struct block
*block
)
263 if (block
== NULL
|| BLOCK_SUPERBLOCK (block
) == NULL
)
266 while (BLOCK_SUPERBLOCK (BLOCK_SUPERBLOCK (block
)) != NULL
)
267 block
= BLOCK_SUPERBLOCK (block
);
272 /* Return the static block associated to BLOCK. Return NULL if block
276 block_global_block (const struct block
*block
)
281 while (BLOCK_SUPERBLOCK (block
) != NULL
)
282 block
= BLOCK_SUPERBLOCK (block
);
287 /* Allocate a block on OBSTACK, and initialize its elements to
288 zero/NULL. This is useful for creating "dummy" blocks that don't
289 correspond to actual source files.
291 Warning: it sets the block's BLOCK_DICT to NULL, which isn't a
292 valid value. If you really don't want the block to have a
293 dictionary, then you should subsequently set its BLOCK_DICT to
294 dict_create_linear (obstack, NULL). */
297 allocate_block (struct obstack
*obstack
)
299 struct block
*bl
= obstack_alloc (obstack
, sizeof (struct block
));
301 BLOCK_START (bl
) = 0;
303 BLOCK_FUNCTION (bl
) = NULL
;
304 BLOCK_SUPERBLOCK (bl
) = NULL
;
305 BLOCK_DICT (bl
) = NULL
;
306 BLOCK_NAMESPACE (bl
) = NULL
;
This page took 0.034869 seconds and 4 git commands to generate.