GCC Middle and Back End API Reference
tree_operand_hash Struct Reference

#include <tree-hash-traits.h>

Inheritance diagram for tree_operand_hash:
Collaboration diagram for tree_operand_hash:

Public Types

typedef tree_node * value_type
 
typedef tree_node * compare_type
 

Static Public Member Functions

static hashval_t hash (const value_type &)
 
static bool equal (const value_type &, const compare_type &)
 
static hashval_t hash (const value_type &)
 
static bool equal (const value_type &existing, const compare_type &candidate)
 
static void mark_deleted (tree_node *&)
 
static void mark_empty (tree_node *&)
 
static bool is_deleted (tree_node *)
 
static bool is_empty (tree_node *)
 
static void remove (tree_node *&)
 
static void ggc_mx (tree_node *&p)
 
static void ggc_maybe_mx (tree_node *&p)
 
static void pch_nx (tree_node *&p)
 
static void pch_nx (tree_node *&p, gt_pointer_operator op, void *cookie)
 

Static Public Attributes

static const bool empty_zero_p
 

Detailed Description

Traits for hashing trees.
   Copyright (C) 2014-2024 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
Software Foundation; either version 3, or (at your option) any later
version.

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 GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.   
Hash for trees based on operand_equal_p.   

Member Typedef Documentation

◆ compare_type

typedef tree_node* pointer_hash< tree_node >::compare_type
inherited

◆ value_type

typedef tree_node* pointer_hash< tree_node >::value_type
inherited

Member Function Documentation

◆ equal() [1/2]

bool pointer_hash< tree_node >::equal ( const value_type & existing,
const compare_type & candidate )
inlinestaticinherited

◆ equal() [2/2]

bool tree_operand_hash::equal ( const value_type & t1,
const compare_type & t2 )
inlinestatic

References operand_equal_p().

◆ ggc_maybe_mx()

static void ggc_remove< tree_node * >::ggc_maybe_mx ( tree_node * & p)
inlinestaticinherited

◆ ggc_mx()

static void ggc_remove< tree_node * >::ggc_mx ( tree_node * & p)
inlinestaticinherited

◆ hash() [1/2]

hashval_t pointer_hash< tree_node >::hash ( const value_type & candidate)
inlinestaticinherited

◆ hash() [2/2]

hashval_t tree_operand_hash::hash ( const value_type & t)
inlinestatic

References iterative_hash_expr().

◆ is_deleted()

bool pointer_hash< tree_node >::is_deleted ( tree_node * e)
inlinestaticinherited

◆ is_empty()

bool pointer_hash< tree_node >::is_empty ( tree_node * e)
inlinestaticinherited

◆ mark_deleted()

void pointer_hash< tree_node >::mark_deleted ( tree_node *& e)
inlinestaticinherited

◆ mark_empty()

void pointer_hash< tree_node >::mark_empty ( tree_node *& e)
inlinestaticinherited

◆ pch_nx() [1/2]

static void ggc_remove< tree_node * >::pch_nx ( tree_node * & p)
inlinestaticinherited

◆ pch_nx() [2/2]

static void ggc_remove< tree_node * >::pch_nx ( tree_node * & p,
gt_pointer_operator op,
void * cookie )
inlinestaticinherited

◆ remove()

static void ggc_remove< tree_node * >::remove ( tree_node * & )
inlinestaticinherited

Field Documentation

◆ empty_zero_p

const bool pointer_hash< tree_node >::empty_zero_p
staticinherited

The documentation for this struct was generated from the following file: