1 /* Block-related functions for the GNU debugger, GDB.
3 Copyright (C) 2003, 2007, 2008, 2009, 2010 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
)
55 /* If A is a function block, then A cannot be contained in B,
56 except if A was inlined. */
57 if (BLOCK_FUNCTION (a
) != NULL
&& !block_inlined_p (a
))
59 a
= BLOCK_SUPERBLOCK (a
);
67 /* Return the symbol for the function which contains a specified
68 lexical block, described by a struct block BL. The return value
69 will not be an inlined function; the containing function will be
73 block_linkage_function (const struct block
*bl
)
75 while ((BLOCK_FUNCTION (bl
) == NULL
|| block_inlined_p (bl
))
76 && BLOCK_SUPERBLOCK (bl
) != NULL
)
77 bl
= BLOCK_SUPERBLOCK (bl
);
79 return BLOCK_FUNCTION (bl
);
82 /* Return one if BL represents an inlined function. */
85 block_inlined_p (const struct block
*bl
)
87 return BLOCK_FUNCTION (bl
) != NULL
&& SYMBOL_INLINED (BLOCK_FUNCTION (bl
));
90 /* Return the blockvector immediately containing the innermost lexical
91 block containing the specified pc value and section, or 0 if there
92 is none. PBLOCK is a pointer to the block. If PBLOCK is NULL, we
93 don't pass this information back to the caller. */
96 blockvector_for_pc_sect (CORE_ADDR pc
, struct obj_section
*section
,
97 struct block
**pblock
, struct symtab
*symtab
)
101 struct blockvector
*bl
;
103 if (symtab
== 0) /* if no symtab specified by caller */
105 /* First search all symtabs for one whose file contains our pc */
106 symtab
= find_pc_sect_symtab (pc
, section
);
111 bl
= BLOCKVECTOR (symtab
);
113 /* Then search that symtab for the smallest block that wins. */
115 /* If we have an addrmap mapping code addresses to blocks, then use
117 if (BLOCKVECTOR_MAP (bl
))
119 b
= addrmap_find (BLOCKVECTOR_MAP (bl
), pc
);
131 /* Otherwise, use binary search to find the last block that starts
134 top
= BLOCKVECTOR_NBLOCKS (bl
);
136 while (top
- bot
> 1)
138 half
= (top
- bot
+ 1) >> 1;
139 b
= BLOCKVECTOR_BLOCK (bl
, bot
+ half
);
140 if (BLOCK_START (b
) <= pc
)
146 /* Now search backward for a block that ends after PC. */
150 b
= BLOCKVECTOR_BLOCK (bl
, bot
);
151 if (BLOCK_END (b
) > pc
)
162 /* Return the blockvector immediately containing the innermost lexical block
163 containing the specified pc value, or 0 if there is none.
164 Backward compatibility, no section. */
167 blockvector_for_pc (CORE_ADDR pc
, struct block
**pblock
)
169 return blockvector_for_pc_sect (pc
, find_pc_mapped_section (pc
),
173 /* Return the innermost lexical block containing the specified pc value
174 in the specified section, or 0 if there is none. */
177 block_for_pc_sect (CORE_ADDR pc
, struct obj_section
*section
)
179 struct blockvector
*bl
;
182 bl
= blockvector_for_pc_sect (pc
, section
, &b
, NULL
);
188 /* Return the innermost lexical block containing the specified pc value,
189 or 0 if there is none. Backward compatibility, no section. */
192 block_for_pc (CORE_ADDR pc
)
194 return block_for_pc_sect (pc
, find_pc_mapped_section (pc
));
197 /* Now come some functions designed to deal with C++ namespace issues.
198 The accessors are safe to use even in the non-C++ case. */
200 /* This returns the namespace that BLOCK is enclosed in, or "" if it
201 isn't enclosed in a namespace at all. This travels the chain of
202 superblocks looking for a scope, if necessary. */
205 block_scope (const struct block
*block
)
207 for (; block
!= NULL
; block
= BLOCK_SUPERBLOCK (block
))
209 if (BLOCK_NAMESPACE (block
) != NULL
210 && BLOCK_NAMESPACE (block
)->scope
!= NULL
)
211 return BLOCK_NAMESPACE (block
)->scope
;
217 /* Set BLOCK's scope member to SCOPE; if needed, allocate memory via
218 OBSTACK. (It won't make a copy of SCOPE, however, so that already
219 has to be allocated correctly.) */
222 block_set_scope (struct block
*block
, const char *scope
,
223 struct obstack
*obstack
)
225 block_initialize_namespace (block
, obstack
);
227 BLOCK_NAMESPACE (block
)->scope
= scope
;
230 /* This returns the using directives list associated with BLOCK, if
233 struct using_direct
*
234 block_using (const struct block
*block
)
236 if (block
== NULL
|| BLOCK_NAMESPACE (block
) == NULL
)
239 return BLOCK_NAMESPACE (block
)->using;
242 /* Set BLOCK's using member to USING; if needed, allocate memory via
243 OBSTACK. (It won't make a copy of USING, however, so that already
244 has to be allocated correctly.) */
247 block_set_using (struct block
*block
,
248 struct using_direct
*using,
249 struct obstack
*obstack
)
251 block_initialize_namespace (block
, obstack
);
253 BLOCK_NAMESPACE (block
)->using = using;
256 /* If BLOCK_NAMESPACE (block) is NULL, allocate it via OBSTACK and
257 ititialize its members to zero. */
260 block_initialize_namespace (struct block
*block
, struct obstack
*obstack
)
262 if (BLOCK_NAMESPACE (block
) == NULL
)
264 BLOCK_NAMESPACE (block
)
265 = obstack_alloc (obstack
, sizeof (struct block_namespace_info
));
266 BLOCK_NAMESPACE (block
)->scope
= NULL
;
267 BLOCK_NAMESPACE (block
)->using = NULL
;
271 /* Return the static block associated to BLOCK. Return NULL if block
272 is NULL or if block is a global block. */
275 block_static_block (const struct block
*block
)
277 if (block
== NULL
|| BLOCK_SUPERBLOCK (block
) == NULL
)
280 while (BLOCK_SUPERBLOCK (BLOCK_SUPERBLOCK (block
)) != NULL
)
281 block
= BLOCK_SUPERBLOCK (block
);
286 /* Return the static block associated to BLOCK. Return NULL if block
290 block_global_block (const struct block
*block
)
295 while (BLOCK_SUPERBLOCK (block
) != NULL
)
296 block
= BLOCK_SUPERBLOCK (block
);
301 /* Allocate a block on OBSTACK, and initialize its elements to
302 zero/NULL. This is useful for creating "dummy" blocks that don't
303 correspond to actual source files.
305 Warning: it sets the block's BLOCK_DICT to NULL, which isn't a
306 valid value. If you really don't want the block to have a
307 dictionary, then you should subsequently set its BLOCK_DICT to
308 dict_create_linear (obstack, NULL). */
311 allocate_block (struct obstack
*obstack
)
313 struct block
*bl
= obstack_alloc (obstack
, sizeof (struct block
));
315 BLOCK_START (bl
) = 0;
317 BLOCK_FUNCTION (bl
) = NULL
;
318 BLOCK_SUPERBLOCK (bl
) = NULL
;
319 BLOCK_DICT (bl
) = NULL
;
320 BLOCK_NAMESPACE (bl
) = NULL
;
This page took 0.036965 seconds and 4 git commands to generate.