static bool allocatable_size_p (tree, bool);
static bool initial_value_needs_conversion (tree, tree);
static tree update_n_elem (tree, tree, tree);
-static int compare_field_bitpos (const PTR, const PTR);
+static int compare_field_bitpos (const void *, const void *);
static bool components_to_record (Node_Id, Entity_Id, tree, tree, int, bool,
bool, bool, bool, bool, bool, bool, tree,
tree *);
/* qsort comparer for the bit positions of two record components. */
static int
-compare_field_bitpos (const PTR rt1, const PTR rt2)
+compare_field_bitpos (const void *rt1, const void *rt2)
{
const_tree const field1 = * (const_tree const *) rt1;
const_tree const field2 = * (const_tree const *) rt2;
for record components. */
static int
-compare_elmt_bitpos (const PTR rt1, const PTR rt2)
+compare_elmt_bitpos (const void *rt1, const void *rt2)
{
const constructor_elt * const elmt1 = (const constructor_elt *) rt1;
const constructor_elt * const elmt2 = (const constructor_elt *) rt2;
} insns;
/* Auxiliary info specific to a pass. */
- PTR aux;
+ void *aux;
/* Location of any goto implicit in the edge. */
location_t goto_locus;
vec<edge, va_gc> *succs;
/* Auxiliary info specific to a pass. */
- PTR GTY ((skip (""))) aux;
+ void *GTY ((skip (""))) aux;
/* Innermost loop containing the block. */
class loop *loop_father;
class loop *next;
/* Auxiliary info specific to a pass. */
- PTR GTY ((skip (""))) aux;
+ void *GTY ((skip (""))) aux;
/* The number of times the latch of the loop is executed. This can be an
INTEGER_CST, or a symbolic expression representing the number of
/* File stream where this node is being written to. */
struct lto_file_decl_data * lto_file_data;
- PTR GTY ((skip)) aux;
+ void *GTY ((skip)) aux;
/* Comdat group the symbol is in. Can be private if GGC allowed that. */
tree x_comdat_group;
/* Additional information about an indirect call. Not cleared when an edge
becomes direct. */
cgraph_indirect_call_info *indirect_info;
- PTR GTY ((skip (""))) aux;
+ void *GTY ((skip (""))) aux;
/* When equal to CIF_OK, inline this call. Otherwise, points to the
explanation why function was not inlined. */
enum cgraph_inline_failed_t inline_failed;
static struct state_ident_st *
state_ident_by_name (const char *name, enum insert_option optins)
{
- PTR *slot = NULL;
+ void **slot = NULL;
int namlen = 0;
struct state_ident_st *stid = NULL;
static void
record_type (type_p type)
{
- PTR *slot;
+ void **slot;
slot = htab_find_slot (state_seen_types, type, INSERT);
gcc_assert (slot);
if (state_token_kind (t0) == STOK_INTEGER)
{
- PTR *slot = NULL;
+ void **slot = NULL;
struct type loctype = { TYPE_SCALAR, 0, 0, 0, GC_UNUSED, {0} };
loctype.state_number = t0->stok_un.stok_num;
static void
dump_type (int indent, type_p t)
{
- PTR *slot;
+ void **slot;
printf ("%*cType at %p: ", indent, ' ', (void *) t);
if (t->kind == TYPE_UNDEFINED)
input_file*
input_file_by_name (const char* name)
{
- PTR* slot;
+ void ** slot;
input_file* f = NULL;
int namlen = 0;
if (!name)
POS_HERE (do_scalar_typedef ("machine_mode", &pos));
POS_HERE (do_scalar_typedef ("fixed_size_mode", &pos));
POS_HERE (do_scalar_typedef ("CONSTEXPR", &pos));
- POS_HERE (do_typedef ("PTR",
+ POS_HERE (do_typedef ("void *",
create_pointer (resolve_typedef ("void", &pos)),
&pos));
#undef POS_HERE
void *
ggc_cleared_alloc_ptr_array_two_args (size_t c, size_t n)
{
- gcc_assert (sizeof (PTR *) == n);
- return ggc_cleared_vec_alloc<PTR *> (c);
+ gcc_assert (sizeof (void **) == n);
+ return ggc_cleared_vec_alloc<void **> (c);
}
/* These are for splay_tree_new_ggc. */
bool new_node;
bool on_stack;
struct cgraph_node* next_cycle;
- PTR aux;
+ void *aux;
};
structure to be inserted into the hash table. */
static hashval_t
-htab_hash_plugin (const PTR p)
+htab_hash_plugin (const void *p)
{
const struct plugin_name_args *plugin = (const struct plugin_name_args *) p;
return htab_hash_string (plugin->base_name);