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
88d599dc
Commit
88d599dc
authored
13 years ago
by
Michael Matz
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
life -> live; one favourite typo of mine.
From-SVN: r182285
parent
f6dbed32
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
4 deletions
+4
-4
gcc/cfgexpand.c
+4
-4
No files found.
gcc/cfgexpand.c
View file @
88d599dc
...
...
@@ -486,8 +486,8 @@ add_scope_conflicts_1 (basic_block bb, bitmap work, bool for_conflict)
&&
visit
==
visit_op
)
{
/* If this is the first real instruction in this BB we need
to add conflicts for everything li
f
e at this point now.
Unlike classical li
f
eness for named objects we can't
to add conflicts for everything li
v
e at this point now.
Unlike classical li
v
eness for named objects we can't
rely on seeing a def/use of the names we're interested in.
There might merely be indirect loads/stores. We'd not add any
conflicts for such partitions. */
...
...
@@ -517,7 +517,7 @@ add_scope_conflicts (void)
bool
changed
;
bitmap
work
=
BITMAP_ALLOC
(
NULL
);
/* We approximate the li
f
e range of a stack variable by taking the first
/* We approximate the li
v
e range of a stack variable by taking the first
mention of its name as starting point(s), and by the end-of-scope
death clobber added by gimplify as ending point(s) of the range.
This overapproximates in the case we for instance moved an address-taken
...
...
@@ -525,7 +525,7 @@ add_scope_conflicts (void)
But it's conservatively correct as a variable never can hold values
before its name is mentioned at least once.
We then do a mostly classical bitmap li
f
eness algorithm. */
We then do a mostly classical bitmap li
v
eness algorithm. */
FOR_ALL_BB
(
bb
)
bb
->
aux
=
BITMAP_ALLOC
(
NULL
);
...
...
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