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
dc700f49
Commit
dc700f49
authored
Aug 26, 2004
by
Richard Henderson
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Update comment for staticp.
From-SVN: r86652
parent
ee8a6a3e
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
8 additions
and
3 deletions
+8
-3
gcc/tree.c
+8
-3
No files found.
gcc/tree.c
View file @
dc700f49
...
...
@@ -1363,8 +1363,9 @@ array_type_nelts (tree type)
:
fold
(
build2
(
MINUS_EXPR
,
TREE_TYPE
(
max
),
max
,
min
)));
}
/* Return true if arg is static -- a reference to an object in
static storage. This is not the same as the C meaning of `static'. */
/* If arg is static -- a reference to an object in static storage -- then
return the object. This is not the same as the C meaning of `static'.
If arg isn't static, return NULL. */
tree
staticp
(
tree
arg
)
...
...
@@ -2270,7 +2271,11 @@ do { tree _node = (NODE); \
address of a volatile variable is not volatile.) If it's a constant,
the address is both invariant and constant. Otherwise it's neither. */
if
(
TREE_CODE
(
node
)
==
INDIRECT_REF
)
UPDATE_TITCSE
(
node
);
{
/* If this is &((T*)0)->field, then this is a form of addition. */
if
(
TREE_CODE
(
TREE_OPERAND
(
node
,
0
))
!=
INTEGER_CST
)
UPDATE_TITCSE
(
node
);
}
else
if
(
DECL_P
(
node
))
{
if
(
staticp
(
node
))
...
...
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