OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

dump.c (cp_dump_tree, [...]): New case.

Browse Source 
* dump.c (cp_dump_tree, USING_STMT case): New case.
	* tree.c (cp_statement_code_p): Add USING_STMT.
	* decl2.c (do_using_directive): Add the using directive statement.

	* tree.c (walk_tree): Reformat an if block.

From-SVN: r41783
This commit is contained in:
Nathan Sidwell 2001-05-03 11:02:26 +00:00 committed by Nathan Sidwell
parent 05de394bf9
commit 5158d7eeb7
4 changed files with 29 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
gcc/cp/ChangeLog
View File

@ -1,3 +1,11 @@
2001-05-03 Nathan Sidwell <nathan@codesourcery.com>
* dump.c (cp_dump_tree, USING_STMT case): New case.
* tree.c (cp_statement_code_p): Add USING_STMT.
* decl2.c (do_using_directive): Add the using directive statement.
* tree.c (walk_tree): Reformat an if block.
2001-05-02 Mark Mitchell <mark@codesourcery.com>
* decl.c (compute_array_index_type): Don't try to do anything with

2
gcc/cp/decl2.c
View File

@ -5204,6 +5204,8 @@ do_using_directive (namespace)
{
if (namespace == fake_std_node)
return;
if (building_stmt_tree ())
add_stmt (build_stmt (USING_STMT, namespace));
/* using namespace A::B::C; */
if (TREE_CODE (namespace) == SCOPE_REF)

6
gcc/cp/dump.c
View File

@ -252,6 +252,12 @@ cp_dump_tree (di, t)
dump_next_stmt (di, t);
break;
case USING_STMT:
dump_stmt (di, t);
dump_child ("nmsp", USING_STMT_NAMESPACE (t));
dump_next_stmt (di, t);
break;
default:
break;
}

23
gcc/cp/tree.c
View File

@ -1038,6 +1038,7 @@ cp_statement_code_p (code)
case TRY_BLOCK:
case HANDLER:
case EH_SPEC_BLOCK:
case USING_STMT:
return 1;
default:
@ -1188,16 +1189,18 @@ walk_tree (tp, func, data, htab)
if (!*tp)
return NULL_TREE;
if (htab) {
void **slot;
/* Don't walk the same tree twice, if the user has requested that we
avoid doing so. */
if (htab_find (htab, *tp))
return NULL_TREE;
/* If we haven't already seen this node, add it to the table. */
slot = htab_find_slot (htab, *tp, INSERT);
*slot = *tp;
}
if (htab)
{
void **slot;
/* Don't walk the same tree twice, if the user has requested
that we avoid doing so. */
if (htab_find (htab, *tp))
return NULL_TREE;
/* If we haven't already seen this node, add it to the table. */
slot = htab_find_slot (htab, *tp, INSERT);
*slot = *tp;
}
/* Call the function. */
walk_subtrees = 1;