CbC/CbC_gcc: gcc/ggc.h comparison

comparison gcc/ggc.h @ 111:04ced10e8804

gcc 7

author	kono
date	Fri, 27 Oct 2017 22:46:09 +0900
parents	f6334be47118
children	84e7813d76e9

comparison

equal deleted inserted replaced

-:561a7518be6b
+:04ced10e8804
 /* Garbage collection for the GNU compiler.
-Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007,
+Copyright (C) 1998-2017 Free Software Foundation, Inc.
-2008, 2009, 2010 Free Software Foundation, Inc.
 This file is part of GCC.
 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
 along with GCC; see the file COPYING3.  If not see
 <http://www.gnu.org/licenses/>.  */
 #ifndef GCC_GGC_H
 #define GCC_GGC_H
-#include "statistics.h"
 /* Symbols are marked with `ggc' for `gcc gc' so as not to interfere with
 an external gc library that might be linked in.  */
-/* Constants for general use.  */
-extern const char empty_string[];	/* empty string */
 /* Internal functions and data structures used by the GTY
 machinery, including the generated gt*.[hc] files.  */
-/* The first parameter is a pointer to a pointer, the second a cookie.  */
-typedef void (*gt_pointer_operator) (void *, void *);
 #include "gtype-desc.h"
 /* One of these applies its third parameter (with cookie in the fourth
 parameter) to each pointer in the object pointed to by the first
 the fourth parameter.  */
 typedef void (*gt_handle_reorder) (void *, void *, gt_pointer_operator,
 				   void *);
 /* Used by the gt_pch_n_* routines.  Register an object in the hash table.  */
-extern int gt_pch_note_object (void *, void *, gt_note_pointers,
+extern int gt_pch_note_object (void *, void *, gt_note_pointers);
-			       enum gt_types_enum);
 /* Used by the gt_pch_n_* routines.  Register that an object has a reorder
 function.  */
 extern void gt_pch_note_reorder (void *, void *, gt_handle_reorder);
+/* generated function to clear caches in gc memory.  */
+extern void gt_clear_caches ();
 /* Mark the object in the first parameter and anything it points to.  */
 typedef void (*gt_pointer_walker) (void *);
 /* Structures for the easy way to mark roots.
 };
 #define LAST_GGC_ROOT_TAB { NULL, 0, 0, NULL, NULL }
 /* Pointers to arrays of ggc_root_tab, terminated by NULL.  */
 extern const struct ggc_root_tab * const gt_ggc_rtab[];
 extern const struct ggc_root_tab * const gt_ggc_deletable_rtab[];
-extern const struct ggc_root_tab * const gt_pch_cache_rtab[];
 extern const struct ggc_root_tab * const gt_pch_scalar_rtab[];
-/* Structure for hash table cache marking.  */
-struct htab;
-struct ggc_cache_tab {
-struct htab * *base;
-size_t nelt;
-size_t stride;
-gt_pointer_walker cb;
-gt_pointer_walker pchw;
-int (*marked_p) (const void *);
-};
-#define LAST_GGC_CACHE_TAB { NULL, 0, 0, NULL, NULL, NULL }
-/* Pointers to arrays of ggc_cache_tab, terminated by NULL.  */
-extern const struct ggc_cache_tab * const gt_ggc_cache_rtab[];
 /* If EXPR is not NULL and previously unmarked, mark it and evaluate
 to true.  Otherwise evaluate to false.  */
 #define ggc_test_and_set_mark(EXPR) \
 ((EXPR) != NULL && ((void *) (EXPR)) != (void *) 1 && ! ggc_set_mark (EXPR))
 extern void gt_pch_n_S (const void *);
 extern void gt_ggc_m_S (const void *);
 /* End of GTY machinery API.  */
-struct alloc_zone;
 /* Initialize the string pool.  */
 extern void init_stringpool (void);
 /* Initialize the garbage collector.  */
 extern void init_ggc (void);
 /* Allocation.  */
 /* The internal primitive.  */
-extern void *ggc_internal_alloc_stat (size_t MEM_STAT_DECL);
+extern void *ggc_internal_alloc (size_t, void (*)(void *), size_t,
+				 size_t CXX_MEM_STAT_INFO)
-#define ggc_internal_alloc(s) ggc_internal_alloc_stat (s MEM_STAT_INFO)
+ATTRIBUTE_MALLOC;
-/* Allocate an object of the specified type and size.  */
+inline void *
-extern void *ggc_alloc_typed_stat (enum gt_types_enum, size_t MEM_STAT_DECL);
+ggc_internal_alloc (size_t s CXX_MEM_STAT_INFO)
+{
-#define ggc_alloc_typed(s, z) ggc_alloc_typed_stat (s, z MEM_STAT_INFO)
+return ggc_internal_alloc (s, NULL, 0, 1 PASS_MEM_STAT);
+}
+extern size_t ggc_round_alloc_size (size_t requested_size);
 /* Allocates cleared memory.  */
-extern void *ggc_internal_cleared_alloc_stat (size_t MEM_STAT_DECL);
+extern void *ggc_internal_cleared_alloc (size_t, void (*)(void *),
+					 size_t, size_t
+					 CXX_MEM_STAT_INFO) ATTRIBUTE_MALLOC;
+inline void *
+ggc_internal_cleared_alloc (size_t s CXX_MEM_STAT_INFO)
+{
+return ggc_internal_cleared_alloc (s, NULL, 0, 1 PASS_MEM_STAT);
+}
 /* Resize a block.  */
-extern void *ggc_realloc_stat (void *, size_t MEM_STAT_DECL);
+extern void *ggc_realloc (void *, size_t CXX_MEM_STAT_INFO);
 /* Free a block.  To be used when known for certain it's not reachable.  */
 extern void ggc_free (void *);
-extern void ggc_record_overhead (size_t, size_t, void * MEM_STAT_DECL);
-extern void ggc_free_overhead (void *);
-extern void ggc_prune_overhead_list (void);
 extern void dump_ggc_loc_statistics (bool);
-/* Reallocators.  */
+/* Reallocator.  */
 #define GGC_RESIZEVEC(T, P, N) \
-((T *) ggc_realloc_stat ((P), (N) * sizeof (T) MEM_STAT_INFO))
+((T *) ggc_realloc ((P), (N) * sizeof (T) MEM_STAT_INFO))
-#define GGC_RESIZEVAR(T, P, N)                          \
+template<typename T>
-((T *) ggc_realloc_stat ((P), (N) MEM_STAT_INFO))
+void
+finalize (void *p)
-static inline void *
+{
-ggc_internal_vec_alloc_stat (size_t s, size_t c MEM_STAT_DECL)
+static_cast<T *> (p)->~T ();
-{
+}
-return ggc_internal_alloc_stat (c * s PASS_MEM_STAT);
-}
+template<typename T>
+inline bool
-static inline void *
+need_finalization_p ()
-ggc_internal_cleared_vec_alloc_stat (size_t s, size_t c MEM_STAT_DECL)
+{
-{
+#if GCC_VERSION >= 4003
-return ggc_internal_cleared_alloc_stat (c * s PASS_MEM_STAT);
+return !__has_trivial_destructor (T);
-}
+#else
+return true;
-#define ggc_internal_cleared_vec_alloc(s, c) \
+#endif
-(ggc_internal_cleared_vec_alloc_stat ((s), (c) MEM_STAT_INFO))
+}
-static inline void *
+template<typename T>
-ggc_alloc_atomic_stat (size_t s MEM_STAT_DECL)
+inline T *
-{
+ggc_alloc (ALONE_CXX_MEM_STAT_INFO)
-return ggc_internal_alloc_stat (s PASS_MEM_STAT);
+{
-}
+if (need_finalization_p<T> ())
+return static_cast<T *> (ggc_internal_alloc (sizeof (T), finalize<T>, 0, 1
-#define ggc_alloc_atomic(S)  (ggc_alloc_atomic_stat ((S) MEM_STAT_INFO))
+						 PASS_MEM_STAT));
+else
-#define ggc_alloc_cleared_atomic(S)             \
+return static_cast<T *> (ggc_internal_alloc (sizeof (T), NULL, 0, 1
-(ggc_internal_cleared_alloc_stat ((S) MEM_STAT_INFO))
+						 PASS_MEM_STAT));
+}
-extern void * ggc_cleared_alloc_htab_ignore_args (size_t, size_t);
+template<typename T>
-extern void * ggc_cleared_alloc_ptr_array_two_args (size_t, size_t);
+inline T *
+ggc_cleared_alloc (ALONE_CXX_MEM_STAT_INFO)
-#define htab_create_ggc(SIZE, HASH, EQ, DEL) \
+{
-htab_create_typed_alloc (SIZE, HASH, EQ, DEL,	\
+if (need_finalization_p<T> ())
-			   ggc_cleared_alloc_htab_ignore_args,		\
+return static_cast<T *> (ggc_internal_cleared_alloc (sizeof (T),
-			   ggc_cleared_alloc_ptr_array_two_args,	\
+							 finalize<T>, 0, 1
-			   ggc_free)
+							 PASS_MEM_STAT));
+else
-#define splay_tree_new_ggc(COMPARE, ALLOC_TREE, ALLOC_NODE)		     \
+return static_cast<T *> (ggc_internal_cleared_alloc (sizeof (T), NULL, 0, 1
-splay_tree_new_typed_alloc (COMPARE, NULL, NULL, &ALLOC_TREE, &ALLOC_NODE, \
+							 PASS_MEM_STAT));
-			      &ggc_splay_dont_free, NULL)
+}
-extern void *ggc_splay_alloc (enum gt_types_enum, int, void *);
+template<typename T>
+inline T *
-extern void ggc_splay_dont_free (void *, void *);
+ggc_vec_alloc (size_t c CXX_MEM_STAT_INFO)
+{
+if (need_finalization_p<T> ())
+return static_cast<T *> (ggc_internal_alloc (c * sizeof (T), finalize<T>,
+						 sizeof (T), c PASS_MEM_STAT));
+else
+return static_cast<T *> (ggc_internal_alloc (c * sizeof (T), NULL, 0, 0
+						 PASS_MEM_STAT));
+}
+template<typename T>
+inline T *
+ggc_cleared_vec_alloc (size_t c CXX_MEM_STAT_INFO)
+{
+if (need_finalization_p<T> ())
+return static_cast<T *> (ggc_internal_cleared_alloc (c * sizeof (T),
+							 finalize<T>,
+							 sizeof (T), c
+							 PASS_MEM_STAT));
+else
+return static_cast<T *> (ggc_internal_cleared_alloc (c * sizeof (T), NULL,
+							 0, 0 PASS_MEM_STAT));
+}
+inline void *
+ggc_alloc_atomic (size_t s CXX_MEM_STAT_INFO)
+{
+return ggc_internal_alloc (s PASS_MEM_STAT);
+}
 /* Allocate a gc-able string, and fill it with LENGTH bytes from CONTENTS.
 If LENGTH is -1, then CONTENTS is assumed to be a
 null-terminated string and the memory sized accordingly.  */
-extern const char *ggc_alloc_string_stat (const char *contents, int length
+extern const char *ggc_alloc_string (const char *contents, int length
-MEM_STAT_DECL);
+CXX_MEM_STAT_INFO);
-#define ggc_alloc_string(c, l) ggc_alloc_string_stat (c, l MEM_STAT_INFO)
 /* Make a copy of S, in GC-able memory.  */
-#define ggc_strdup(S) ggc_alloc_string_stat ((S), -1 MEM_STAT_INFO)
+#define ggc_strdup(S) ggc_alloc_string ((S), -1 MEM_STAT_INFO)
 /* Invoke the collector.  Garbage collection occurs only when this
 function is called, not during allocations.  */
 extern void ggc_collect	(void);
+/* Assume that all GGC memory is reachable and grow the limits for next collection. */
+extern void ggc_grow (void);
 /* Register an additional root table.  This can be useful for some
 plugins.  Does nothing if the passed pointer is NULL. */
 extern void ggc_register_root_tab (const struct ggc_root_tab *);
-/* Register an additional cache table.  This can be useful for some
-plugins.  Does nothing if the passed pointer is NULL. */
-extern void ggc_register_cache_tab (const struct ggc_cache_tab *);
 /* Read objects previously saved with gt_pch_save from F.  */
 extern void gt_pch_restore (FILE *f);
 /* Statistics.  */
 extern void stringpool_statistics (void);
 /* Heuristics.  */
 extern void init_ggc_heuristics (void);
-/* Zone collection.  */
+#define ggc_alloc_rtvec_sized(NELT)				\
+(rtvec_def *) ggc_internal_alloc (sizeof (struct rtvec_def)		\
-/* For regular rtl allocations.  */
+		       + ((NELT) - 1) * sizeof (rtx))		\
-extern struct alloc_zone rtl_zone;
-/* For regular tree allocations.  */
-extern struct alloc_zone tree_zone;
-/* For IDENTIFIER_NODE allocations.  */
-extern struct alloc_zone tree_id_zone;
-#define ggc_alloc_rtvec_sized(NELT)                                     \
-(ggc_alloc_zone_vec_rtvec_def (sizeof (rtx),                        \
-sizeof (struct rtvec_def) + ((NELT) - 1), \
-&rtl_zone))
-#if defined (GGC_ZONE) && !defined (GENERATOR_FILE)
-/* Allocate an object into the specified allocation zone.  */
-extern void *ggc_internal_alloc_zone_stat (size_t,
-					  struct alloc_zone * MEM_STAT_DECL);
-extern void *ggc_internal_cleared_alloc_zone_stat (size_t,
-					  struct alloc_zone * MEM_STAT_DECL);
-static inline void *
-ggc_internal_zone_alloc_stat (struct alloc_zone * z, size_t s MEM_STAT_DECL)
-{
-return ggc_internal_alloc_zone_stat (s, z PASS_MEM_STAT);
-}
-static inline void *
-ggc_internal_zone_cleared_alloc_stat (struct alloc_zone * z, size_t s
-MEM_STAT_DECL)
-{
-return ggc_internal_cleared_alloc_zone_stat (s, z PASS_MEM_STAT);
-}
-static inline void *
-ggc_internal_zone_vec_alloc_stat (struct alloc_zone * z, size_t s, size_t n
-MEM_STAT_DECL)
-{
-return ggc_internal_alloc_zone_stat (s * n, z PASS_MEM_STAT);
-}
-#else
-static inline void *
-ggc_internal_zone_alloc_stat (struct alloc_zone * z ATTRIBUTE_UNUSED,
-size_t s MEM_STAT_DECL)
-{
-return ggc_internal_alloc_stat (s PASS_MEM_STAT);
-}
-static inline void *
-ggc_internal_zone_cleared_alloc_stat (struct alloc_zone * z ATTRIBUTE_UNUSED,
-size_t s MEM_STAT_DECL)
-{
-return ggc_internal_cleared_alloc_stat (s PASS_MEM_STAT);
-}
-static inline void *
-ggc_internal_zone_vec_alloc_stat (struct alloc_zone * z ATTRIBUTE_UNUSED,
-size_t s, size_t n MEM_STAT_DECL)
-{
-return ggc_internal_vec_alloc_stat (s, n PASS_MEM_STAT);
-}
-#endif
 /* Memory statistics passing versions of some allocators.  Too few of them to
 make gengtype produce them, so just define the needed ones here.  */
-static inline struct rtx_def *
+inline struct rtx_def *
-ggc_alloc_zone_rtx_def_stat (struct alloc_zone * z, size_t s MEM_STAT_DECL)
+ggc_alloc_rtx_def_stat (size_t s CXX_MEM_STAT_INFO)
 {
-return (struct rtx_def *) ggc_internal_zone_alloc_stat (z, s PASS_MEM_STAT);
+return (struct rtx_def *) ggc_internal_alloc (s PASS_MEM_STAT);
 }
-static inline union tree_node *
+inline union tree_node *
-ggc_alloc_zone_tree_node_stat (struct alloc_zone * z, size_t s MEM_STAT_DECL)
+ggc_alloc_tree_node_stat (size_t s CXX_MEM_STAT_INFO)
 {
-return (union tree_node *) ggc_internal_zone_alloc_stat (z, s PASS_MEM_STAT);
+return (union tree_node *) ggc_internal_alloc (s PASS_MEM_STAT);
 }
-static inline union tree_node *
+inline union tree_node *
-ggc_alloc_zone_cleared_tree_node_stat (struct alloc_zone * z, size_t s
+ggc_alloc_cleared_tree_node_stat (size_t s CXX_MEM_STAT_INFO)
-MEM_STAT_DECL)
+{
-{
+return (union tree_node *) ggc_internal_cleared_alloc (s PASS_MEM_STAT);
-return (union tree_node *)
+}
-ggc_internal_zone_cleared_alloc_stat (z, s PASS_MEM_STAT);
-}
+inline gimple *
+ggc_alloc_cleared_gimple_statement_stat (size_t s CXX_MEM_STAT_INFO)
-static inline union gimple_statement_d *
+{
-ggc_alloc_cleared_gimple_statement_d_stat (size_t s MEM_STAT_DECL)
+return (gimple *) ggc_internal_cleared_alloc (s PASS_MEM_STAT);
-{
+}
-return (union gimple_statement_d *)
-ggc_internal_cleared_alloc_stat (s PASS_MEM_STAT);
+inline void
+gt_ggc_mx (const char *s)
+{
+ggc_test_and_set_mark (const_cast<char *> (s));
+}
+inline void
+gt_pch_nx (const char *)
+{
+}
+inline void
+gt_ggc_mx (int)
+{
+}
+inline void
+gt_pch_nx (int)
+{
+}
+inline void
+gt_pch_nx (unsigned int)
+{
 }
 #endif

Mercurial > hg > CbC > CbC_gcc

comparison gcc/ggc.h @ 111:04ced10e8804