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
df44f2b0
Commit
df44f2b0
authored
Aug 23, 1998
by
Martin v. Löwis
Committed by
Jason Merrill
Aug 23, 1998
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* search.c (my_tree_cons): Reimplement.
From-SVN: r21927
parent
31928556
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
7 deletions
+8
-7
gcc/cp/ChangeLog
+3
-1
gcc/cp/search.c
+5
-6
No files found.
gcc/cp/ChangeLog
View file @
df44f2b0
...
@@ -3,11 +3,13 @@
...
@@ -3,11 +3,13 @@
* lex.c (real_yylex): Don't warn about long long constants if
* lex.c (real_yylex): Don't warn about long long constants if
we're allowing long long.
we're allowing long long.
1998-08-2
3
Martin von Lwis <loewis@informatik.hu-berlin.de>
1998-08-2
4
Martin von Lwis <loewis@informatik.hu-berlin.de>
* decl.c (pushdecl): Use IDENTIFIER_NAMESPACE_VALUE instead of
* decl.c (pushdecl): Use IDENTIFIER_NAMESPACE_VALUE instead of
accessing bindings directly.
accessing bindings directly.
* search.c (my_tree_cons): Reimplement.
* lang-specs.h: Remove __HONOR_STD.
* lang-specs.h: Remove __HONOR_STD.
* inc/exception, inc/new, inc/new.h, inc/typeinfo: Likewise.
* inc/exception, inc/new, inc/new.h, inc/typeinfo: Likewise.
...
...
gcc/cp/search.c
View file @
df44f2b0
...
@@ -261,13 +261,12 @@ static tree
...
@@ -261,13 +261,12 @@ static tree
my_tree_cons
(
purpose
,
value
,
chain
)
my_tree_cons
(
purpose
,
value
,
chain
)
tree
purpose
,
value
,
chain
;
tree
purpose
,
value
,
chain
;
{
{
tree
p
=
(
tree
)
obstack_alloc
(
&
type_obstack_entries
,
sizeof
(
struct
tree_list
));
tree
p
;
bzero
((
char
*
)
p
,
sizeof
(
struct
tree_list
));
struct
obstack
*
ambient_obstack
=
current_obstack
;
current_obstack
=
&
type_obstack_entries
;
p
=
tree_cons
(
purpose
,
value
,
chain
);
current_obstack
=
ambient_obstack
;
++
my_tree_node_counter
;
++
my_tree_node_counter
;
TREE_SET_CODE
(
p
,
TREE_LIST
);
TREE_PURPOSE
(
p
)
=
purpose
;
TREE_VALUE
(
p
)
=
value
;
TREE_CHAIN
(
p
)
=
chain
;
return
p
;
return
p
;
}
}
...
...
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