Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
aa4a53af
Commit
aa4a53af
authored
Jun 24, 2004
by
Richard Kenner
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update whitespace and comments
From-SVN: r83632
parent
eb6127a4
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
24 additions
and
29 deletions
+24
-29
gcc/gimplify.c
+10
-10
gcc/tree-dfa.c
+13
-18
gcc/tree-gimple.c
+1
-1
gcc/tree-inline.c
+0
-0
No files found.
gcc/gimplify.c
View file @
aa4a53af
...
...
@@ -77,13 +77,12 @@ static enum gimplify_status gimplify_modify_expr_rhs (tree *, tree *, tree *,
static
enum
gimplify_status
gimplify_compound_expr
(
tree
*
,
tree
*
,
bool
);
/* Return a hash value for a formal temporary table entry. */
static
hashval_t
gimple_tree_hash
(
const
void
*
p
)
{
tree
t
=
((
const
elt_t
*
)
p
)
->
val
;
tree
t
=
((
const
elt_t
*
)
p
)
->
val
;
return
iterative_hash_expr
(
t
,
0
);
}
...
...
@@ -92,8 +91,8 @@ gimple_tree_hash (const void *p)
static
int
gimple_tree_eq
(
const
void
*
p1
,
const
void
*
p2
)
{
tree
t1
=
((
const
elt_t
*
)
p1
)
->
val
;
tree
t2
=
((
const
elt_t
*
)
p2
)
->
val
;
tree
t1
=
((
const
elt_t
*
)
p1
)
->
val
;
tree
t2
=
((
const
elt_t
*
)
p2
)
->
val
;
enum
tree_code
code
=
TREE_CODE
(
t1
);
if
(
TREE_CODE
(
t2
)
!=
code
...
...
@@ -194,6 +193,7 @@ static void
gimple_pop_condition
(
tree
*
pre_p
)
{
int
conds
=
--
(
gimplify_ctxp
->
conditions
);
if
(
conds
==
0
)
{
append_to_statement_list
(
gimplify_ctxp
->
conditional_cleanups
,
pre_p
);
...
...
@@ -281,6 +281,7 @@ tree
create_artificial_label
(
void
)
{
tree
lab
=
build_decl
(
LABEL_DECL
,
NULL_TREE
,
void_type_node
);
DECL_ARTIFICIAL
(
lab
)
=
1
;
DECL_CONTEXT
(
lab
)
=
current_function_decl
;
return
lab
;
...
...
@@ -298,6 +299,7 @@ create_tmp_var_name (const char *prefix)
if
(
prefix
)
{
char
*
preftmp
=
ASTRDUP
(
prefix
);
remove_suffix
(
preftmp
,
strlen
(
preftmp
));
prefix
=
preftmp
;
}
...
...
@@ -486,8 +488,7 @@ is_gimple_tmp_var (tree t)
&&
!
TREE_STATIC
(
t
)
&&
!
DECL_EXTERNAL
(
t
));
}
/* Declares all the variables in VARS in SCOPE. Returns the last
DECL_STMT emitted. */
/* Declares all the variables in VARS in SCOPE. */
void
declare_tmp_vars
(
tree
vars
,
tree
scope
)
...
...
@@ -497,7 +498,7 @@ declare_tmp_vars (tree vars, tree scope)
{
tree
temps
;
/* C99 mode puts the default 'return 0;' for main
()
outside the outer
/* C99 mode puts the default 'return 0;' for main outside the outer
braces. So drill down until we find an actual scope. */
while
(
TREE_CODE
(
scope
)
==
COMPOUND_EXPR
)
scope
=
TREE_OPERAND
(
scope
,
0
);
...
...
@@ -1577,9 +1578,8 @@ canonicalize_component_ref (tree *expr_p)
(T *)&array
==>
&array[L]
where L is the lower bound. Only do this for constant lower bound since
we have no place to put any statements made during gimplification of
the lower bound. */
where L is the lower bound. For simplicity, only do this for constant
lower bound. */
static
void
canonicalize_addr_expr
(
tree
*
expr_p
)
...
...
gcc/tree-dfa.c
View file @
aa4a53af
...
...
@@ -852,24 +852,19 @@ collect_dfa_stats_r (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
static
tree
find_vars_r
(
tree
*
tp
,
int
*
walk_subtrees
,
void
*
data
)
{
tree
t
=
*
tp
;
struct
walk_state
*
walk_state
=
(
struct
walk_state
*
)
data
;
if
(
SSA_VAR_P
(
t
))
{
/* If T is a regular variable that the optimizers are interested
in, add it to the list of variables. */
add_referenced_var
(
t
,
walk_state
);
}
else
if
(
DECL_P
(
t
)
||
TYPE_P
(
t
)
||
TREE_CODE_CLASS
(
TREE_CODE
(
t
))
==
'c'
)
{
/* Type, _DECL and constant nodes have no interesting children.
Ignore them. */
*
walk_subtrees
=
0
;
}
struct
walk_state
*
walk_state
=
(
struct
walk_state
*
)
data
;
/* If T is a regular variable that the optimizers are interested
in, add it to the list of variables. */
if
(
SSA_VAR_P
(
*
tp
))
add_referenced_var
(
*
tp
,
walk_state
);
/* Type, _DECL and constant nodes have no interesting children.
Ignore them. */
else
if
(
DECL_P
(
*
tp
)
||
TYPE_P
(
*
tp
)
||
TREE_CODE_CLASS
(
TREE_CODE
(
*
tp
))
==
'c'
)
*
walk_subtrees
=
0
;
return
NULL_TREE
;
}
...
...
gcc/tree-gimple.c
View file @
aa4a53af
/* Functions to analyze and validate GIMPLE trees.
Copyright (C) 2002, 2003 Free Software Foundation, Inc.
Copyright (C) 2002, 2003
, 2004
Free Software Foundation, Inc.
Contributed by Diego Novillo <dnovillo@redhat.com>
Rewritten by Jason Merrill <jason@redhat.com>
...
...
gcc/tree-inline.c
View file @
aa4a53af
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment