GCC Middle and Back End API Reference
cl_option_hasher Struct Reference
Inheritance diagram for cl_option_hasher:
Collaboration diagram for cl_option_hasher:

Public Types

typedef tree_node * value_type
 
typedef tree_node * compare_type
 

Static Public Member Functions

static hashval_t hash (tree t)
 
static bool equal (tree x, tree y)
 
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 ggc_maybe_mx (tree_node *&)
 
static int keep_cache_entry (tree_node *&e)
 
static void remove (tree_node *&)
 
static void ggc_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
 

Member Typedef Documentation

◆ compare_type

tree_node* pointer_hash< tree_node >::compare_type
inherited

◆ value_type

tree_node* pointer_hash< tree_node >::value_type
inherited

Member Function Documentation

◆ equal() [1/2]

bool cl_option_hasher::equal ( tree x,
tree y )
static
Return nonzero if the value represented by *X (an OPTIMIZATION or
TARGET_OPTION tree node) is the same as that given by *Y, which is the
same.   

References gcc_unreachable, TREE_CODE, TREE_OPTIMIZATION, TREE_TARGET_OPTION, and y.

◆ equal() [2/2]

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

◆ ggc_maybe_mx()

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

◆ ggc_mx()

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

◆ hash() [1/2]

hashval_t cl_option_hasher::hash ( tree x)
static
These are the hash table functions for the hash table of OPTIMIZATION_NODE
nodes.   
Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code.   

References gcc_unreachable, TREE_CODE, TREE_OPTIMIZATION, and TREE_TARGET_OPTION.

◆ hash() [2/2]

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

◆ 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

◆ keep_cache_entry()

static int ggc_cache_remove< tree_node * >::keep_cache_entry ( 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: