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
370d199d
Commit
370d199d
authored
Dec 14, 2004
by
Diego Novillo
Committed by
Diego Novillo
Dec 14, 2004
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* tree-gimple.c (get_base_address): Update documentation.
From-SVN: r92134
parent
0b16f8f4
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
12 additions
and
1 deletions
+12
-1
gcc/ChangeLog
+4
-0
gcc/tree-gimple.c
+8
-1
No files found.
gcc/ChangeLog
View file @
370d199d
2004
-
12
-
14
Diego
Novillo
<
dnovillo
@
redhat
.
com
>
*
tree
-
gimple
.
c
(
get_base_address
):
Update
documentation
.
2004
-
12
-
13
Richard
Henderson
<
rth
@
redhat
.
com
>
PR
middle
-
end
/
17930
...
...
gcc/tree-gimple.c
View file @
370d199d
...
...
@@ -419,7 +419,14 @@ get_call_expr_in (tree t)
return
NULL_TREE
;
}
/* Given a memory reference expression T, return its base address. */
/* Given a memory reference expression T, return its base address.
The base address of a memory reference expression is the main
object being referenced. For instance, the base address for
'array[i].fld[j]' is 'array'. You can think of this as stripping
away the offset part from a memory address.
This function calls handled_component_p to strip away all the inner
parts of the memory reference until it reaches the base object. */
tree
get_base_address
(
tree
t
)
...
...
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