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
1a482881
Commit
1a482881
authored
Apr 04, 2003
by
Nathan Sidwell
Committed by
Nathan Sidwell
Apr 04, 2003
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* gcov.c (accumulate_line_counts): Fix span tree merge bug.
From-SVN: r65245
parent
941747b5
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
13 additions
and
6 deletions
+13
-6
gcc/ChangeLog
+4
-0
gcc/gcov.c
+9
-6
No files found.
gcc/ChangeLog
View file @
1a482881
2003-04-04 Nathan Sidwell <nathan@codesourcery.com>
* gcov.c (accumulate_line_counts): Fix span tree merge bug.
Fri Apr 4 15:58:52 2003 J"orn Rennecke <joern.rennecke@superh.com>
* sh.h (ACTUAL_NORMAL_MODE): New macro, broken out of
...
...
gcc/gcov.c
View file @
1a482881
...
...
@@ -1699,21 +1699,24 @@ accumulate_line_counts (src)
{
block_t
*
root
=
block
->
u
.
span
.
root
;
block_t
*
dst_root
=
dst
->
u
.
span
.
root
;
/* Join spanning trees */
if
(
root
->
u
.
span
.
siblings
&&
!
dst_root
->
u
.
span
.
root
)
if
(
root
->
u
.
span
.
siblings
&&
!
dst_root
->
u
.
span
.
siblings
)
{
root
=
dst
->
u
.
span
.
root
;
dst_root
=
block
->
u
.
span
.
root
;
}
dst
->
u
.
span
.
root
=
root
;
root
->
u
.
span
.
siblings
+=
1
+
dst
->
u
.
span
.
siblings
;
if
(
dst
->
u
.
span
.
siblings
)
dst_root
->
u
.
span
.
root
=
root
;
root
->
u
.
span
.
siblings
+=
1
+
dst_root
->
u
.
span
.
siblings
;
if
(
dst_root
->
u
.
span
.
siblings
)
{
block_t
*
dst_sib
;
dst
->
u
.
span
.
siblings
=
0
;
dst
_root
->
u
.
span
.
siblings
=
0
;
for
(
dst_sib
=
line
->
u
.
blocks
;
dst_sib
;
dst_sib
=
dst_sib
->
chain
)
if
(
dst_sib
->
u
.
span
.
root
==
dst_root
)
...
...
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