tree-browser.c (TB_history_stack): Convert to a VEC.
* tree-browser.c (TB_history_stack): Convert to a VEC. (TB_SET_HEAD): Adjust for new type of TB_history_stack. (TB_history_prev): Likewise. From-SVN: r161490
This commit is contained in:
parent
9062f848ce
commit
4052358138
2 changed files with 12 additions and 6 deletions
|
@ -1,3 +1,9 @@
|
|||
2010-06-28 Nathan Froyd <froydnj@codesourcery.com>
|
||||
|
||||
* tree-browser.c (TB_history_stack): Convert to a VEC.
|
||||
(TB_SET_HEAD): Adjust for new type of TB_history_stack.
|
||||
(TB_history_prev): Likewise.
|
||||
|
||||
2010-06-28 Nathan Froyd <froydnj@codesourcery.com>
|
||||
|
||||
* vec.h (vec_heap_free): Add parentheses around free.
|
||||
|
|
|
@ -108,7 +108,7 @@ void browse_tree (tree);
|
|||
|
||||
/* Static variables. */
|
||||
static htab_t TB_up_ht;
|
||||
static tree TB_history_stack = NULL_TREE;
|
||||
static VEC(tree,gc) *TB_history_stack;
|
||||
static int TB_verbose = 1;
|
||||
|
||||
|
||||
|
@ -126,7 +126,7 @@ browse_tree (tree begin)
|
|||
fprintf (TB_OUT_FILE, "\nTree Browser\n");
|
||||
|
||||
#define TB_SET_HEAD(N) do { \
|
||||
TB_history_stack = tree_cons (NULL_TREE, (N), TB_history_stack); \
|
||||
VEC_safe_push (tree, gc, TB_history_stack, N); \
|
||||
head = N; \
|
||||
if (TB_verbose) \
|
||||
if (head) \
|
||||
|
@ -876,11 +876,11 @@ find_node_with_code (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
|
|||
static tree
|
||||
TB_history_prev (void)
|
||||
{
|
||||
if (TB_history_stack)
|
||||
if (!VEC_empty (tree, TB_history_stack))
|
||||
{
|
||||
TB_history_stack = TREE_CHAIN (TB_history_stack);
|
||||
if (TB_history_stack)
|
||||
return TREE_VALUE (TB_history_stack);
|
||||
tree last = VEC_last (tree, TB_history_stack);
|
||||
VEC_pop (tree, TB_history_stack);
|
||||
return last;
|
||||
}
|
||||
return NULL_TREE;
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue