merge from gcc
This commit is contained in:
		| @@ -1,3 +1,12 @@ | ||||
| 2002-06-25  Alan Modra  <amodra@bigpond.net.au> | ||||
|  | ||||
| 	* demangle.h: #include "ansidecl.h" rather than #include <ansidecl.h>. | ||||
| 	* fibheap.h: Likewise. | ||||
| 	* hashtab.h: Likewise. | ||||
| 	* partition.h: Likewise. | ||||
| 	* sort.h: Likewise. | ||||
| 	* splay-tree.h: Likewise. | ||||
|  | ||||
| 2002-06-24  Alan Modra  <amodra@bigpond.net.au> | ||||
|  | ||||
| 	* libiberty.h (basename): Don't declare if HAVE_DECL_BASENAME. | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* Defs for interface to demanglers. | ||||
|    Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2000, 2001 | ||||
|    Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2000, 2001, 2002 | ||||
|    Free Software Foundation, Inc. | ||||
|     | ||||
|    This program is free software; you can redistribute it and/or modify | ||||
| @@ -21,7 +21,7 @@ | ||||
| #if !defined (DEMANGLE_H) | ||||
| #define DEMANGLE_H | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
|  | ||||
| /* Options passed to cplus_demangle (in 2nd parameter). */ | ||||
|  | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* A Fibonacci heap datatype. | ||||
|    Copyright 1998, 1999, 2000, 2001 Free Software Foundation, Inc. | ||||
|    Copyright 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc. | ||||
|    Contributed by Daniel Berlin (dan@cgsoftware.com). | ||||
|  | ||||
| This file is part of GCC. | ||||
| @@ -40,7 +40,7 @@ Boston, MA 02111-1307, USA.  */ | ||||
| #ifndef _FIBHEAP_H_ | ||||
| #define _FIBHEAP_H_ | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
|  | ||||
| typedef long fibheapkey_t; | ||||
|  | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* An expandable hash tables datatype.   | ||||
|    Copyright (C) 1999, 2000 Free Software Foundation, Inc. | ||||
|    Copyright (C) 1999, 2000, 2002 Free Software Foundation, Inc. | ||||
|    Contributed by Vladimir Makarov (vmakarov@cygnus.com). | ||||
|  | ||||
| This program is free software; you can redistribute it and/or modify | ||||
| @@ -36,7 +36,7 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */ | ||||
| extern "C" { | ||||
| #endif /* __cplusplus */ | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
|  | ||||
| #ifndef GTY | ||||
| #define GTY(X) | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* List implementation of a partition of consecutive integers. | ||||
|    Copyright (C) 2000, 2001 Free Software Foundation, Inc. | ||||
|    Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc. | ||||
|    Contributed by CodeSourcery, LLC. | ||||
|  | ||||
|    This file is part of GCC. | ||||
| @@ -40,7 +40,7 @@ | ||||
| extern "C" { | ||||
| #endif /* __cplusplus */ | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
| #include <stdio.h> | ||||
|  | ||||
| struct partition_elem | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* Sorting algorithms. | ||||
|    Copyright (C) 2000 Free Software Foundation, Inc. | ||||
|    Copyright (C) 2000, 2002 Free Software Foundation, Inc. | ||||
|    Contributed by Mark Mitchell <mark@codesourcery.com>. | ||||
|  | ||||
| This file is part of GCC. | ||||
| @@ -31,7 +31,7 @@ Boston, MA 02111-1307, USA.  */ | ||||
| extern "C" { | ||||
| #endif /* __cplusplus */ | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
|  | ||||
| /* Sort an array of pointers.  */ | ||||
|  | ||||
|   | ||||
| @@ -1,5 +1,5 @@ | ||||
| /* A splay-tree datatype.   | ||||
|    Copyright 1998, 1999, 2000 Free Software Foundation, Inc. | ||||
|    Copyright 1998, 1999, 2000, 2002 Free Software Foundation, Inc. | ||||
|    Contributed by Mark Mitchell (mark@markmitchell.com). | ||||
|  | ||||
| This file is part of GCC. | ||||
| @@ -34,7 +34,7 @@ Boston, MA 02111-1307, USA.  */ | ||||
| extern "C" { | ||||
| #endif /* __cplusplus */ | ||||
|  | ||||
| #include <ansidecl.h> | ||||
| #include "ansidecl.h" | ||||
|  | ||||
| /* Use typedefs for the key and data types to facilitate changing | ||||
|    these types, if necessary.  These types should be sufficiently wide | ||||
|   | ||||
		Reference in New Issue
	
	Block a user