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
dd248abd
Commit
dd248abd
authored
Feb 08, 2001
by
Richard Kenner
Committed by
Richard Kenner
Feb 08, 2001
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* rtlanal.c (remove_node_from_expr_list): Correctly update PREV.
From-SVN: r39541
parent
bd0d5d4a
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
9 additions
and
4 deletions
+9
-4
gcc/ChangeLog
+4
-0
gcc/rtlanal.c
+5
-4
No files found.
gcc/ChangeLog
View file @
dd248abd
Thu Feb 8 11:21:28 2001 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* rtlanal.c (remove_node_from_expr_list): Correctly update PREV.
2001-02-08 Bernd Schmidt <bernds@redhat.com>
* final.c (cleanup_subreg_operands): The address of a MEM can
...
...
gcc/rtlanal.c
View file @
dd248abd
...
...
@@ -1596,11 +1596,10 @@ remove_note (insn, note)
abort
();
}
/* Search LISTP (an EXPR_LIST) for
NODE and remove NODE from the list
if it is found.
/* Search LISTP (an EXPR_LIST) for
an entry whose first operand is NODE and
remove that entry from the list
if it is found.
A simple equality test is used to determine if NODE is on the
EXPR_LIST. */
A simple equality test is used to determine if NODE matches. */
void
remove_node_from_expr_list
(
node
,
listp
)
...
...
@@ -1622,6 +1621,8 @@ remove_node_from_expr_list (node, listp)
return
;
}
prev
=
temp
;
temp
=
XEXP
(
temp
,
1
);
}
}
...
...
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