Commit 834003f4 by Kaveh R. Ghazi Committed by Kaveh Ghazi

cp-tree.h (lvalue_or_else): Qualify a char* with the `const' keyword to match an…

cp-tree.h (lvalue_or_else): Qualify a char* with the `const' keyword to match an analogous change at the...

        * cp-tree.h (lvalue_or_else): Qualify a char* with the `const'
        keyword to match an analogous change at the top level.
        * tree.c (lvalue_or_else): Likewise.

From-SVN: r25297
parent 5d5993dd
Thu Feb 18 23:40:01 1999 Kaveh R. Ghazi <ghazi@caip.rutgers.edu>
* cp-tree.h (lvalue_or_else): Qualify a char* with the `const'
keyword to match an analogous change at the top level.
* tree.c (lvalue_or_else): Likewise.
1999-02-17 Mark Mitchell <mark@markmitchell.com> 1999-02-17 Mark Mitchell <mark@markmitchell.com>
* decl.c (xref_basetypes): Comment. * decl.c (xref_basetypes): Comment.
......
...@@ -3245,7 +3245,7 @@ extern tree build_min PVPROTO((enum tree_code, tree, ...)); ...@@ -3245,7 +3245,7 @@ extern tree build_min PVPROTO((enum tree_code, tree, ...));
extern tree build_min_nt PVPROTO((enum tree_code, ...)); extern tree build_min_nt PVPROTO((enum tree_code, ...));
extern tree min_tree_cons PROTO((tree, tree, tree)); extern tree min_tree_cons PROTO((tree, tree, tree));
extern int lvalue_p PROTO((tree)); extern int lvalue_p PROTO((tree));
extern int lvalue_or_else PROTO((tree, char *)); extern int lvalue_or_else PROTO((tree, const char *));
extern tree build_cplus_new PROTO((tree, tree)); extern tree build_cplus_new PROTO((tree, tree));
extern tree get_target_expr PROTO((tree)); extern tree get_target_expr PROTO((tree));
extern tree break_out_cleanups PROTO((tree)); extern tree break_out_cleanups PROTO((tree));
......
...@@ -171,7 +171,7 @@ lvalue_p (ref) ...@@ -171,7 +171,7 @@ lvalue_p (ref)
int int
lvalue_or_else (ref, string) lvalue_or_else (ref, string)
tree ref; tree ref;
char *string; const char *string;
{ {
int win = lvalue_p (ref); int win = lvalue_p (ref);
if (! win) if (! win)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment