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
42cb11fc
Commit
42cb11fc
authored
Jan 09, 1999
by
Richard Henderson
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Remove now-unused variables.
From-SVN: r24601
parent
5e6a42d9
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
1 additions
and
4 deletions
+1
-4
gcc/tree.c
+1
-4
No files found.
gcc/tree.c
View file @
42cb11fc
...
...
@@ -940,7 +940,6 @@ make_node (code)
register
int
type
=
TREE_CODE_CLASS
(
code
);
register
int
length
=
0
;
register
struct
obstack
*
obstack
=
current_obstack
;
register
int
i
;
#ifdef GATHER_STATISTICS
register
tree_node_kind
kind
;
#endif
...
...
@@ -1134,7 +1133,6 @@ copy_node (node)
register
tree
t
;
register
enum
tree_code
code
=
TREE_CODE
(
node
);
register
int
length
=
0
;
register
int
i
;
switch
(
TREE_CODE_CLASS
(
code
))
{
...
...
@@ -1546,7 +1544,6 @@ make_tree_vec (len)
register
tree
t
;
register
int
length
=
(
len
-
1
)
*
sizeof
(
tree
)
+
sizeof
(
struct
tree_vec
);
register
struct
obstack
*
obstack
=
current_obstack
;
register
int
i
;
#ifdef GATHER_STATISTICS
tree_node_counts
[(
int
)
vec_kind
]
++
;
...
...
@@ -3045,7 +3042,7 @@ build1 (code, type, node)
tree
node
;
{
register
struct
obstack
*
obstack
=
expression_obstack
;
register
int
i
,
length
;
register
int
length
;
#ifdef GATHER_STATISTICS
register
tree_node_kind
kind
;
#endif
...
...
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