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
c67b2a58
Commit
c67b2a58
authored
Jul 31, 2003
by
Richard Kenner
Committed by
Richard Kenner
Jul 31, 2003
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* dwarf2out.c (loc_descriptor_from_tree, case CONSTRUCTOR): New case.
From-SVN: r70013
parent
40e941af
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
24 additions
and
0 deletions
+24
-0
gcc/ChangeLog
+4
-0
gcc/dwarf2out.c
+20
-0
No files found.
gcc/ChangeLog
View file @
c67b2a58
2003-07-31 Richard Kenner <kenner@vlsi1.ultra.nyu.edu>
* dwarf2out.c (loc_descriptor_from_tree, case CONSTRUCTOR): New case.
2003-07-31 Per Bothner <pbothner@apple.com>
* opts.c (in_fnames, num_in_fnames): Moved here from c-opts.
...
...
gcc/dwarf2out.c
View file @
c67b2a58
...
...
@@ -8558,6 +8558,26 @@ loc_descriptor_from_tree (tree loc, int addressp)
return
0
;
break
;
case
CONSTRUCTOR
:
{
/* If this is already in memory and at a constant address, we can
support it. */
rtx
rtl
=
TREE_CST_RTL
(
loc
);
#ifdef ASM_SIMPLIFY_DWARF_ADDR
if
(
rtl
)
rtl
=
ASM_SIMPLIFY_DWARF_ADDR
(
rtl
);
#endif
if
(
rtl
==
NULL_RTX
||
GET_CODE
(
rtl
)
!=
MEM
||
!
CONSTANT_P
(
XEXP
(
rtl
,
0
)))
return
0
;
indirect_p
=
1
;
ret
=
mem_loc_descriptor
(
XEXP
(
rtl
,
0
),
GET_MODE
(
rtl
));
break
;
}
case
TRUTH_AND_EXPR
:
case
TRUTH_ANDIF_EXPR
:
case
BIT_AND_EXPR
:
...
...
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