X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=include%2Fpartition.h;h=5234279dc2b6af5183d608caa961710eed5d5fa5;hb=4762f10bd5ccd005a3a2e8d04168ecddd37f323a;hp=091655ac01d06d188b4e7cad34dfb4f5adb4890a;hpb=e05c6d27bff97cd9080cdc554482e128c9e6f6e7;p=external%2Fbinutils.git diff --git a/include/partition.h b/include/partition.h index 091655a..5234279 100644 --- a/include/partition.h +++ b/include/partition.h @@ -1,23 +1,23 @@ /* List implementation of a partition of consecutive integers. - Copyright (C) 2000, 2001 Free Software Foundation, Inc. + Copyright (C) 2000-2019 Free Software Foundation, Inc. Contributed by CodeSourcery, LLC. - This file is part of GNU CC. + This file is part of GCC. - GNU CC is free software; you can redistribute it and/or modify + GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. - GNU CC is distributed in the hope that it will be useful, + GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License - along with GNU CC; see the file COPYING. If not, write to - the Free Software Foundation, 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ + along with GCC; see the file COPYING. If not, write to + the Free Software Foundation, 51 Franklin Street - Fifth Floor, + Boston, MA 02110-1301, USA. */ /* This package implements a partition of consecutive integers. The elements are partitioned into classes. Each class is represented @@ -40,17 +40,17 @@ extern "C" { #endif /* __cplusplus */ -#include +#include "ansidecl.h" #include struct partition_elem { - /* The canonical element that represents the class containing this - element. */ - int class_element; /* The next element in this class. Elements in each class form a circular list. */ struct partition_elem* next; + /* The canonical element that represents the class containing this + element. */ + int class_element; /* The number of elements in this class. Valid only if this is the canonical element for its class. */ unsigned class_count; @@ -64,13 +64,10 @@ typedef struct partition_def struct partition_elem elements[1]; } *partition; -extern partition partition_new PARAMS((int)); -extern void partition_delete PARAMS((partition)); -extern int partition_union PARAMS((partition, - int, - int)); -extern void partition_print PARAMS((partition, - FILE*)); +extern partition partition_new (int); +extern void partition_delete (partition); +extern int partition_union (partition, int, int); +extern void partition_print (partition, FILE*); /* Returns the canonical element corresponding to the class containing ELEMENT__ in PARTITION__. */ @@ -78,4 +75,8 @@ extern void partition_print PARAMS((partition, #define partition_find(partition__, element__) \ ((partition__)->elements[(element__)].class_element) +#ifdef __cplusplus +} +#endif /* __cplusplus */ + #endif /* _PARTITION_H */