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
d566f6ef
Commit
d566f6ef
authored
Apr 29, 2005
by
Kazu Hirata
Committed by
Kazu Hirata
Apr 29, 2005
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos.
From-SVN: r98994
parent
d198b59a
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
7 additions
and
5 deletions
+7
-5
gcc/ChangeLog
+2
-0
gcc/tree-flow-inline.h
+3
-3
gcc/tree-ssa-operands.c
+2
-2
No files found.
gcc/ChangeLog
View file @
d566f6ef
...
...
@@ -3,6 +3,8 @@
* tree-flow-inline.h: Fix a comment typo.
* doc/tree-ssa.texi: Fix a typo.
* tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos.
2005-04-29 Nathan Sidwell <nathan@codesourcery.com>
* config/fr30/fr30.c (fr30_expand_prologue): Use gcc_assert and
...
...
gcc/tree-flow-inline.h
View file @
d566f6ef
...
...
@@ -314,7 +314,7 @@ first_safe_imm_use (imm_use_iterator *imm, tree var)
return
imm
->
imm_use
;
}
/* Bump IMM to the
n
next use in the list. */
/* Bump IMM to the next use in the list. */
static
inline
use_operand_p
next_safe_imm_use
(
imm_use_iterator
*
imm
)
{
...
...
@@ -332,7 +332,7 @@ next_safe_imm_use (imm_use_iterator *imm)
imm
->
imm_use
=
imm
->
imm_use
->
next
;
if
(
!
end_safe_imm_use_p
(
imm
))
{
/* This isnt the end, link iternode before the next use. */
/* This isn
'
t the end, link iternode before the next use. */
ptr
->
prev
=
imm
->
imm_use
->
prev
;
ptr
->
next
=
imm
->
imm_use
;
imm
->
imm_use
->
prev
->
next
=
ptr
;
...
...
@@ -380,7 +380,7 @@ first_readonly_imm_use (imm_use_iterator *imm, tree var)
return
imm
->
imm_use
;
}
/* Bump IMM to the
n
next use in the list. */
/* Bump IMM to the next use in the list. */
static
inline
use_operand_p
next_readonly_imm_use
(
imm_use_iterator
*
imm
)
{
...
...
gcc/tree-ssa-operands.c
View file @
d566f6ef
...
...
@@ -1198,8 +1198,8 @@ swap_tree_operands (tree *exp0, tree *exp1)
use1
=
x
;
break
;
}
/* If both uses don't have operand entries, there isnt much we can do
at this point. Presumably we dont need to worry about it. */
/* If both uses don't have operand entries, there isn
'
t much we can do
at this point.
Presumably we dont need to worry about it. */
if
(
use0
!=
NUM_USES
(
uses
)
&&
use1
!=
NUM_USES
(
uses
))
{
tree
*
tmp
=
USE_OP_PTR
(
uses
,
use1
)
->
use
;
...
...
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