GCC Middle and Back End API Reference
cgraph_edge_hasher Struct Reference

#include <cgraph.h>

Inheritance diagram for cgraph_edge_hasher:
Inheritance graph
[legend]
Collaboration diagram for cgraph_edge_hasher:
Collaboration graph
[legend]

Public Types

typedef gimple * compare_type
typedef cgraph_edge * value_type

Static Public Member Functions

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

Static Public Attributes

static const bool empty_zero_p

Member Typedef Documentation

◆ compare_type

typedef gimple* cgraph_edge_hasher::compare_type

◆ value_type

typedef cgraph_edge* pointer_hash< cgraph_edge >::value_type
inherited

Member Function Documentation

◆ equal() [1/2]

bool cgraph_edge_hasher::equal ( cgraph_edge * x,
gimple * y )
inlinestatic 
Return nonzero if the call_stmt of cgraph_edge X is stmt *Y.

References cgraph_edge::call_stmt, and y.

◆ equal() [2/2]

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

◆ ggc_maybe_mx()

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

◆ ggc_mx()

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

◆ hash() [1/3]

hashval_t cgraph_edge_hasher::hash ( cgraph_edge * e)
static 
Returns a hash value for X (which really is a cgraph_edge).

Referenced by cgraph_add_edge_to_call_site_hash(), cgraph_update_edge_in_call_site_hash(), cgraph_node::get_edge(), cgraph_edge::remove_caller(), and cgraph_edge::set_call_stmt().

◆ hash() [2/3]

hashval_t cgraph_edge_hasher::hash ( gimple * call_stmt)
static 
Returns a hash value for X (which really is a cgraph_edge).

◆ hash() [3/3]

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

◆ is_deleted()

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

◆ is_empty()

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

◆ mark_deleted()

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

◆ mark_empty()

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

◆ pch_nx()

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

◆ remove()

void ggc_remove< cgraph_edge * >::remove ( cgraph_edge * & )
inlinestaticinherited

Field Documentation

◆ empty_zero_p

const bool pointer_hash< cgraph_edge >::empty_zero_p
staticinherited
The documentation for this struct was generated from the following files: