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
8e42ace1
Commit
8e42ace1
authored
Jan 03, 2002
by
Kazu Hirata
Committed by
Kazu Hirata
Jan 03, 2002
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* gcse.c: Fix formatting.
From-SVN: r48502
parent
22e85ed4
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
17 additions
and
12 deletions
+17
-12
gcc/ChangeLog
+4
-0
gcc/gcse.c
+13
-12
No files found.
gcc/ChangeLog
View file @
8e42ace1
2002
-
01
-
03
Kazu
Hirata
<
kazu
@hxi
.
com
>
*
gcse
.
c
:
Fix
formatting
.
2002
-
01
-
03
Graham
Stott
<
grahams
@redhat
.
com
>
2002
-
01
-
03
Graham
Stott
<
grahams
@redhat
.
com
>
*
mkconfig
.
sh
:
Output
to
config
.
h
,
hconfig
.
h
and
tconfig
.
h
*
mkconfig
.
sh
:
Output
to
config
.
h
,
hconfig
.
h
and
tconfig
.
h
...
...
gcc/gcse.c
View file @
8e42ace1
/* Global common subexpression elimination/Partial redundancy elimination
/* Global common subexpression elimination/Partial redundancy elimination
and global constant/copy propagation for GNU compiler.
and global constant/copy propagation for GNU compiler.
Copyright (C) 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002
Free Software Foundation, Inc.
This file is part of GCC.
This file is part of GCC.
...
@@ -917,7 +918,7 @@ compute_can_copy ()
...
@@ -917,7 +918,7 @@ compute_can_copy ()
{
{
int
i
;
int
i
;
#ifndef AVOID_CCMODE_COPIES
#ifndef AVOID_CCMODE_COPIES
rtx
reg
,
insn
;
rtx
reg
,
insn
;
#endif
#endif
memset
(
can_copy_p
,
0
,
NUM_MACHINE_MODES
);
memset
(
can_copy_p
,
0
,
NUM_MACHINE_MODES
);
...
@@ -982,7 +983,7 @@ static void
...
@@ -982,7 +983,7 @@ static void
alloc_gcse_mem
(
f
)
alloc_gcse_mem
(
f
)
rtx
f
;
rtx
f
;
{
{
int
i
,
n
;
int
i
,
n
;
rtx
insn
;
rtx
insn
;
/* Find the largest UID and create a mapping from UIDs to CUIDs.
/* Find the largest UID and create a mapping from UIDs to CUIDs.
...
@@ -1580,7 +1581,7 @@ hash_string_1 (ps)
...
@@ -1580,7 +1581,7 @@ hash_string_1 (ps)
const
char
*
ps
;
const
char
*
ps
;
{
{
unsigned
hash
=
0
;
unsigned
hash
=
0
;
const
unsigned
char
*
p
=
(
const
unsigned
char
*
)
ps
;
const
unsigned
char
*
p
=
(
const
unsigned
char
*
)
ps
;
if
(
p
)
if
(
p
)
while
(
*
p
)
while
(
*
p
)
...
@@ -2414,7 +2415,7 @@ record_last_mem_set_info (insn)
...
@@ -2414,7 +2415,7 @@ record_last_mem_set_info (insn)
bitmap_set_bit
(
canon_modify_mem_list_set
,
BLOCK_NUM
(
insn
));
bitmap_set_bit
(
canon_modify_mem_list_set
,
BLOCK_NUM
(
insn
));
}
}
else
else
note_stores
(
PATTERN
(
insn
),
canon_list_insert
,
(
void
*
)
insn
);
note_stores
(
PATTERN
(
insn
),
canon_list_insert
,
(
void
*
)
insn
);
}
}
/* Called from compute_hash_table via note_stores to handle one
/* Called from compute_hash_table via note_stores to handle one
...
@@ -4103,7 +4104,7 @@ cprop_cc0_jump (bb, insn, reg_used, src)
...
@@ -4103,7 +4104,7 @@ cprop_cc0_jump (bb, insn, reg_used, src)
delete_insn
(
insn
);
delete_insn
(
insn
);
return
1
;
return
1
;
}
}
#endif
#endif
/* Perform constant and copy propagation on INSN.
/* Perform constant and copy propagation on INSN.
...
@@ -4536,7 +4537,7 @@ pre_expr_reaches_here_p (occr_bb, expr, bb)
...
@@ -4536,7 +4537,7 @@ pre_expr_reaches_here_p (occr_bb, expr, bb)
int
rval
;
int
rval
;
char
*
visited
=
(
char
*
)
xcalloc
(
n_basic_blocks
,
1
);
char
*
visited
=
(
char
*
)
xcalloc
(
n_basic_blocks
,
1
);
rval
=
pre_expr_reaches_here_p_work
(
occr_bb
,
expr
,
bb
,
visited
);
rval
=
pre_expr_reaches_here_p_work
(
occr_bb
,
expr
,
bb
,
visited
);
free
(
visited
);
free
(
visited
);
return
rval
;
return
rval
;
...
@@ -6023,7 +6024,7 @@ invalidate_any_buried_refs (x)
...
@@ -6023,7 +6024,7 @@ invalidate_any_buried_refs (x)
rtx
x
;
rtx
x
;
{
{
const
char
*
fmt
;
const
char
*
fmt
;
int
i
,
j
;
int
i
,
j
;
struct
ls_expr
*
ptr
;
struct
ls_expr
*
ptr
;
/* Invalidate it in the list. */
/* Invalidate it in the list. */
...
@@ -6457,7 +6458,7 @@ find_loads (x, store_pattern)
...
@@ -6457,7 +6458,7 @@ find_loads (x, store_pattern)
rtx
x
,
store_pattern
;
rtx
x
,
store_pattern
;
{
{
const
char
*
fmt
;
const
char
*
fmt
;
int
i
,
j
;
int
i
,
j
;
int
ret
=
0
;
int
ret
=
0
;
if
(
!
x
)
if
(
!
x
)
...
@@ -6638,7 +6639,7 @@ build_store_vectors ()
...
@@ -6638,7 +6639,7 @@ build_store_vectors ()
{
{
rtx
r
=
gen_reg_rtx
(
GET_MODE
(
ptr
->
pattern
));
rtx
r
=
gen_reg_rtx
(
GET_MODE
(
ptr
->
pattern
));
if
(
gcse_file
)
if
(
gcse_file
)
fprintf
(
gcse_file
,
"Removing redundant store:
\n
"
);
fprintf
(
gcse_file
,
"Removing redundant store:
\n
"
);
replace_store_insn
(
r
,
XEXP
(
st
,
0
),
bb
);
replace_store_insn
(
r
,
XEXP
(
st
,
0
),
bb
);
XEXP
(
st
,
0
)
=
insn
;
XEXP
(
st
,
0
)
=
insn
;
continue
;
continue
;
...
@@ -6828,9 +6829,9 @@ replace_store_insn (reg, del, bb)
...
@@ -6828,9 +6829,9 @@ replace_store_insn (reg, del, bb)
fprintf
(
gcse_file
,
fprintf
(
gcse_file
,
"STORE_MOTION delete insn in BB %d:
\n
"
,
bb
->
index
);
"STORE_MOTION delete insn in BB %d:
\n
"
,
bb
->
index
);
print_inline_rtx
(
gcse_file
,
del
,
6
);
print_inline_rtx
(
gcse_file
,
del
,
6
);
fprintf
(
gcse_file
,
"
\n
STORE MOTION replaced with insn:
\n
"
);
fprintf
(
gcse_file
,
"
\n
STORE MOTION replaced with insn:
\n
"
);
print_inline_rtx
(
gcse_file
,
insn
,
6
);
print_inline_rtx
(
gcse_file
,
insn
,
6
);
fprintf
(
gcse_file
,
"
\n
"
);
fprintf
(
gcse_file
,
"
\n
"
);
}
}
delete_insn
(
del
);
delete_insn
(
del
);
...
...
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