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
fa0ac78a
Commit
fa0ac78a
authored
Feb 24, 2004
by
Kazu Hirata
Committed by
Kazu Hirata
Feb 24, 2004
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* et-forest.c: Replace et_occurences with et_occurrences.
From-SVN: r78351
parent
6d4e0ecc
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
10 additions
and
6 deletions
+10
-6
gcc/ChangeLog
+4
-0
gcc/et-forest.c
+6
-6
No files found.
gcc/ChangeLog
View file @
fa0ac78a
2004-02-23 Kazu Hirata <kazu@cs.umass.edu>
* et-forest.c: Replace et_occurences with et_occurrences.
2004-02-23 Kazu Hirata <kazu@cs.umass.edu>
* cfgloop.h, loop-iv.c, loop-unswitch.c: Replace iv_analyse
with iv_analyze.
...
...
gcc/et-forest.c
View file @
fa0ac78a
...
...
@@ -56,7 +56,7 @@ struct et_occ
};
static
alloc_pool
et_nodes
;
static
alloc_pool
et_occurences
;
static
alloc_pool
et_occur
r
ences
;
/* Changes depth of OCC to D. */
...
...
@@ -459,9 +459,9 @@ et_new_occ (struct et_node *node)
{
struct
et_occ
*
nw
;
if
(
!
et_occurences
)
et_occurences
=
create_alloc_pool
(
"et_occ pool"
,
sizeof
(
struct
et_occ
),
300
);
nw
=
pool_alloc
(
et_occurences
);
if
(
!
et_occur
r
ences
)
et_occur
r
ences
=
create_alloc_pool
(
"et_occ pool"
,
sizeof
(
struct
et_occ
),
300
);
nw
=
pool_alloc
(
et_occur
r
ences
);
nw
->
of
=
node
;
nw
->
parent
=
NULL
;
...
...
@@ -509,7 +509,7 @@ et_free_tree (struct et_node *t)
if
(
t
->
father
)
et_split
(
t
);
pool_free
(
et_occurences
,
t
->
rightmost_occ
);
pool_free
(
et_occur
r
ences
,
t
->
rightmost_occ
);
pool_free
(
et_nodes
,
t
);
}
...
...
@@ -602,7 +602,7 @@ et_split (struct et_node *t)
rmost
->
depth
=
0
;
rmost
->
min
=
0
;
pool_free
(
et_occurences
,
p_occ
);
pool_free
(
et_occur
r
ences
,
p_occ
);
/* Update the tree. */
if
(
father
->
son
==
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