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
1aa95df7
Commit
1aa95df7
authored
Jul 21, 2013
by
Ondřej Bílka
Committed by
Mike Stump
Jul 21, 2013
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fix typos.
From-SVN: r201109
parent
c0d18c6c
Hide whitespace changes
Inline
Side-by-side
Showing
11 changed files
with
16 additions
and
12 deletions
+16
-12
gcc/loop-unroll.c
+1
-1
gcc/lra-constraints.c
+1
-1
gcc/lto-streamer-out.c
+1
-1
gcc/lto/ChangeLog
+4
-0
gcc/lto/lto-partition.c
+2
-2
gcc/omp-low.c
+1
-1
gcc/read-md.c
+2
-2
gcc/recog.c
+1
-1
gcc/sched-deps.c
+1
-1
gcc/symtab.c
+1
-1
gcc/tlink.c
+1
-1
No files found.
gcc/loop-unroll.c
View file @
1aa95df7
...
...
@@ -1632,7 +1632,7 @@ unroll_loop_stupid (struct loop *loop)
for a loop to be really simple. We could update the counts, but the
problem is that we are unable to decide which exit will be taken
(not really true in case the number of iterations is constant,
but noone will do anything with this information, so we do not
but no
one will do anything with this information, so we do not
worry about it). */
desc
->
simple_p
=
false
;
}
...
...
gcc/lra-constraints.c
View file @
1aa95df7
...
...
@@ -4203,7 +4203,7 @@ need_for_call_save_p (int regno)
PSEUDO_REGNO_MODE
(
regno
),
reg_renumber
[
regno
])));
}
/* Global registers occuring in the current EBB. */
/* Global registers occur
r
ing in the current EBB. */
static
bitmap_head
ebb_global_regs
;
/* Return true if we need a split for hard register REGNO or pseudo
...
...
gcc/lto-streamer-out.c
View file @
1aa95df7
...
...
@@ -2303,7 +2303,7 @@ produce_symtab (struct output_block *ob)
/* Write the symbol table.
First write everything defined and then all declarations.
This is nec
ce
sary to handle cases where we have duplicated symbols. */
This is nec
es
sary to handle cases where we have duplicated symbols. */
for
(
lsei
=
lsei_start
(
encoder
);
!
lsei_end_p
(
lsei
);
lsei_next
(
&
lsei
))
{
...
...
gcc/lto/ChangeLog
View file @
1aa95df7
2013-07-21 OndÅej BÃlka <neleai@seznam.cz>
* lto-partition.c: Fix typos.
2013-06-20 Jan Hubicka <jh@suse.cz>
* lto-partition.c (lto_balanced_map): Fix -fno-toplevel-reorder
...
...
gcc/lto/lto-partition.c
View file @
1aa95df7
...
...
@@ -852,7 +852,7 @@ may_need_named_section_p (lto_symtab_encoder_t encoder, symtab_node node)
of the same name in partition ENCODER (or in whole compilation unit if
ENCODER is NULL) and if so, mangle the statics. Always mangle all
conflicting statics, so we reduce changes of silently miscompiling
asm statemnets refering to them by symbol name. */
asm statemnets refer
r
ing to them by symbol name. */
static
void
rename_statics
(
lto_symtab_encoder_t
encoder
,
symtab_node
node
)
...
...
@@ -902,7 +902,7 @@ rename_statics (lto_symtab_encoder_t encoder, symtab_node node)
||
lto_symtab_encoder_lookup
(
encoder
,
s
)
!=
LCC_NOT_FOUND
))
{
if
(
privatize_symbol_name
(
s
))
/* Re-start from beg
gi
ning since we do not know how many symbols changed a name. */
/* Re-start from beg
in
ning since we do not know how many symbols changed a name. */
s
=
symtab_node_for_asm
(
name
);
else
s
=
s
->
symbol
.
next_sharing_asm_name
;
}
...
...
gcc/omp-low.c
View file @
1aa95df7
...
...
@@ -4909,7 +4909,7 @@ expand_omp_for (struct omp_region *region)
FALLTHRU_EDGE
(
region
->
cont
)
->
flags
&=
~
EDGE_ABNORMAL
;
}
else
/* If there isnt a continue then this is a degerate case where
/* If there isn
'
t a continue then this is a degerate case where
the introduction of abnormal edges during lowering will prevent
original loops from being detected. Fix that up. */
loops_state_set
(
LOOPS_NEED_FIXUP
);
...
...
gcc/read-md.c
View file @
1aa95df7
...
...
@@ -881,7 +881,7 @@ traverse_enum_types (htab_trav callback, void *info)
/* Process an "include" directive, starting with the optional space
after the "include". Read in the file and use HANDLE_DIRECTIVE
to process each unknown directive. LINENO is the line number on
which the "include" occured. */
which the "include" occur
r
ed. */
static
void
handle_include
(
int
lineno
,
directive_handler_t
handle_directive
)
...
...
@@ -1027,7 +1027,7 @@ parse_include (const char *arg)
}
/* The main routine for reading .md files. Try to process all the .md
files specified on the command line and return true if no error occured.
files specified on the command line and return true if no error occur
r
ed.
ARGC and ARGV are the arguments to main.
...
...
gcc/recog.c
View file @
1aa95df7
...
...
@@ -1651,7 +1651,7 @@ asm_operand_ok (rtx op, const char *constraint, const char **constraints)
case
'0'
:
case
'1'
:
case
'2'
:
case
'3'
:
case
'4'
:
case
'5'
:
case
'6'
:
case
'7'
:
case
'8'
:
case
'9'
:
/* If caller provided constraints pointer, look up
the maching constraint. Otherwise, our caller should have
the ma
t
ching constraint. Otherwise, our caller should have
given us the proper matching constraint, but we can't
actually fail the check if they didn't. Indicate that
results are inconclusive. */
...
...
gcc/sched-deps.c
View file @
1aa95df7
...
...
@@ -4574,7 +4574,7 @@ attempt_change (struct mem_inc_info *mii, rtx new_addr)
rtx
mem
=
*
mii
->
mem_loc
;
rtx
new_mem
;
/* Jump thr
u
a lot of hoops to keep the attributes up to date. We
/* Jump thr
ough
a lot of hoops to keep the attributes up to date. We
do not want to call one of the change address variants that take
an offset even though we know the offset in many cases. These
assume you are changing where the address is pointing by the
...
...
gcc/symtab.c
View file @
1aa95df7
...
...
@@ -874,7 +874,7 @@ symtab_alias_ultimate_target (symtab_node node, enum availability *availability)
/* To determine visibility of the target, we follow ELF semantic of aliases.
Here alias is an alternative assembler name of a given definition. Its
availab
lity prevails the availab
lity of its target (i.e. static alias of
availab
ility prevails the availabi
lity of its target (i.e. static alias of
weak definition is available.
Weakref is a different animal (and not part of ELF per se). It is just
...
...
gcc/tlink.c
View file @
1aa95df7
...
...
@@ -768,7 +768,7 @@ scan_linker_output (const char *fname)
constructor or destructor, there can be several mangled names
that match it, so choose or unchoose all of them. If some are
chosen and some not, leave the later ones that don't match
alone for now; either this will cause the link to suceed, or
alone for now; either this will cause the link to suc
c
eed, or
on the next attempt we will switch all of them the other way
and that will cause it to succeed. */
int
chosen
=
0
;
...
...
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