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
2f145821
Commit
2f145821
authored
Oct 20, 1992
by
Richard Stallman
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
(make_node, copy_node): Don't assume node length is multiple of int.
From-SVN: r2524
parent
71bde1f3
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
7 additions
and
3 deletions
+7
-3
gcc/tree.c
+7
-3
No files found.
gcc/tree.c
View file @
2f145821
...
...
@@ -877,11 +877,12 @@ make_node (code)
tree_node_sizes
[(
int
)
kind
]
+=
length
;
#endif
/* We assume here that the length of a tree node is a multiple of the
size of an int. Rounding up won't work because it would clobber
the next object. */
/* Clear a word at a time. */
for
(
i
=
(
length
/
sizeof
(
int
))
-
1
;
i
>=
0
;
i
--
)
((
int
*
)
t
)[
i
]
=
0
;
/* Clear any extra bytes. */
for
(
i
=
length
/
sizeof
(
int
)
*
sizeof
(
int
);
i
<
length
;
i
++
)
((
char
*
)
t
)[
i
]
=
0
;
TREE_SET_CODE
(
t
,
code
);
if
(
obstack
==
&
permanent_obstack
)
...
...
@@ -978,6 +979,9 @@ copy_node (node)
for
(
i
=
(
length
/
sizeof
(
int
))
-
1
;
i
>=
0
;
i
--
)
((
int
*
)
t
)[
i
]
=
((
int
*
)
node
)[
i
];
/* Clear any extra bytes. */
for
(
i
=
length
/
sizeof
(
int
)
*
sizeof
(
int
);
i
<
length
;
i
++
)
((
char
*
)
t
)[
i
]
=
0
;
TREE_CHAIN
(
t
)
=
0
;
...
...
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