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
ec748ec8
Commit
ec748ec8
authored
Nov 18, 2002
by
Kazu Hirata
Committed by
Kazu Hirata
Nov 18, 2002
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* df.c: Fix formatting.
From-SVN: r59203
parent
cf0cec73
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
24 additions
and
18 deletions
+24
-18
gcc/ChangeLog
+4
-0
gcc/df.c
+20
-18
No files found.
gcc/ChangeLog
View file @
ec748ec8
2002
-
11
-
17
Kazu
Hirata
<
kazu
@cs
.
umass
.
edu
>
*
df
.
c
:
Fix
formatting
.
2002
-
11
-
17
Kazu
Hirata
<
kazu
@cs
.
umass
.
edu
>
*
config
/
h8300
/
h8300
.
md
(
two
anonymous
patterns
)
:
Fix
insn
lengths
.
...
...
gcc/df.c
View file @
ec748ec8
...
...
@@ -170,10 +170,13 @@ Perhaps there should be a bitmap argument to df_analyse to specify
#include "fibheap.h"
#define FOR_EACH_BB_IN_BITMAP(BITMAP, MIN, BB, CODE) \
do { \
do \
{ \
unsigned int node_; \
EXECUTE_IF_SET_IN_BITMAP (BITMAP, MIN, node_, \
{(BB) = BASIC_BLOCK (node_); CODE;});} while (0)
{(BB) = BASIC_BLOCK (node_); CODE;}); \
} \
while (0)
static
struct
obstack
df_ref_obstack
;
static
struct
df
*
ddf
;
...
...
@@ -375,7 +378,7 @@ df_def_table_realloc (df, size)
/* Link all the new refs together, overloading the chain field. */
for (i = 0; i < size - 1; i++)
refs[i].chain = (struct df_link *)
(refs + i + 1);
refs[i].chain = (struct df_link *)
(refs + i + 1);
refs[size - 1].chain = 0;
}
#endif
...
...
@@ -392,7 +395,7 @@ df_bitmaps_alloc (df, flags)
basic_block
bb
;
/* Free the bitmaps if they need resizing. */
if
((
flags
&
DF_LR
)
&&
df
->
n_regs
<
(
unsigned
int
)
max_reg_num
())
if
((
flags
&
DF_LR
)
&&
df
->
n_regs
<
(
unsigned
int
)
max_reg_num
())
dflags
|=
DF_LR
|
DF_RU
;
if
((
flags
&
DF_RU
)
&&
df
->
n_uses
<
df
->
use_id
)
dflags
|=
DF_RU
;
...
...
@@ -2040,16 +2043,16 @@ df_analyse_1 (df, blocks, flags, update)
df_reg_use_chain_create
(
df
,
blocks
);
}
df
->
dfs_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
rc_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
rts_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
inverse_dfs_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
df
->
inverse_rc_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
df
->
inverse_rts_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
df
->
dfs_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
rc_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
rts_order
=
xmalloc
(
sizeof
(
int
)
*
n_basic_blocks
);
df
->
inverse_dfs_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
df
->
inverse_rc_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
df
->
inverse_rts_map
=
xmalloc
(
sizeof
(
int
)
*
last_basic_block
);
flow_depth_first_order_compute
(
df
->
dfs_order
,
df
->
rc_order
);
flow_reverse_top_sort_order_compute
(
df
->
rts_order
);
for
(
i
=
0
;
i
<
n_basic_blocks
;
i
++
)
for
(
i
=
0
;
i
<
n_basic_blocks
;
i
++
)
{
df
->
inverse_dfs_map
[
df
->
dfs_order
[
i
]]
=
i
;
df
->
inverse_rc_map
[
df
->
rc_order
[
i
]]
=
i
;
...
...
@@ -2274,7 +2277,7 @@ df_refs_update (df)
basic_block
bb
;
int
count
=
0
;
if
((
unsigned
int
)
max_reg_num
()
>=
df
->
reg_size
)
if
((
unsigned
int
)
max_reg_num
()
>=
df
->
reg_size
)
df_reg_table_realloc
(
df
,
0
);
df_refs_queue
(
df
);
...
...
@@ -2497,8 +2500,7 @@ df_insn_modify (df, bb, insn)
}
typedef
struct
replace_args
{
typedef
struct
replace_args
{
rtx
match
;
rtx
replacement
;
rtx
insn
;
...
...
@@ -3637,7 +3639,7 @@ hybrid_search_bitmap (block, in, out, gen, kill, dir,
int
changed
;
int
i
=
block
->
index
;
edge
e
;
basic_block
bb
=
block
;
basic_block
bb
=
block
;
SET_BIT
(
visited
,
block
->
index
);
if
(
TEST_BIT
(
pending
,
block
->
index
))
{
...
...
@@ -3663,7 +3665,7 @@ hybrid_search_bitmap (block, in, out, gen, kill, dir,
else
{
/* Calculate <conf_op> of successor ins */
bitmap_zero
(
out
[
i
]);
bitmap_zero
(
out
[
i
]);
for
(
e
=
bb
->
succ
;
e
!=
0
;
e
=
e
->
succ_next
)
{
if
(
e
->
dest
==
EXIT_BLOCK_PTR
)
...
...
@@ -3748,7 +3750,7 @@ hybrid_search_sbitmap (block, in, out, gen, kill, dir,
int
changed
;
int
i
=
block
->
index
;
edge
e
;
basic_block
bb
=
block
;
basic_block
bb
=
block
;
SET_BIT
(
visited
,
block
->
index
);
if
(
TEST_BIT
(
pending
,
block
->
index
))
{
...
...
@@ -3774,7 +3776,7 @@ hybrid_search_sbitmap (block, in, out, gen, kill, dir,
else
{
/* Calculate <conf_op> of successor ins */
sbitmap_zero
(
out
[
i
]);
sbitmap_zero
(
out
[
i
]);
for
(
e
=
bb
->
succ
;
e
!=
0
;
e
=
e
->
succ_next
)
{
if
(
e
->
dest
==
EXIT_BLOCK_PTR
)
...
...
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