sparseset.h File Reference

Go to the source code of this file.

Data Structures
struct	sparseset_def

Typedefs
typedef struct sparseset_def *	sparseset

Functions
sparseset	sparseset_alloc (SPARSESET_ELT_TYPE n_elms)
void	sparseset_clear_bit (sparseset, SPARSESET_ELT_TYPE)
void	sparseset_copy (sparseset, sparseset)
void	sparseset_and (sparseset, sparseset, sparseset)
void	sparseset_and_compl (sparseset, sparseset, sparseset)
void	sparseset_ior (sparseset, sparseset, sparseset)
bool	sparseset_equal_p (sparseset, sparseset)
static void	sparseset_clear ()
static SPARSESET_ELT_TYPE	sparseset_cardinality ()
static SPARSESET_ELT_TYPE	sparseset_size ()
static bool	sparseset_bit_p ()
static void	sparseset_insert_bit ()
static void	sparseset_set_bit ()
static SPARSESET_ELT_TYPE	sparseset_pop ()
static void	sparseset_iter_init ()
static bool	sparseset_iter_p ()
static SPARSESET_ELT_TYPE	sparseset_iter_elm ()
static void	sparseset_iter_next ()

---

Typedef Documentation

typedef struct sparseset_def * sparseset

---

Function Documentation

sparseset sparseset_alloc

(

SPARSESET_ELT_TYPE

n_elms

)

void sparseset_and	(	sparseset	,
		sparseset	,
		sparseset
	)

void sparseset_and_compl	(	sparseset	,
		sparseset	,
		sparseset
	)

static bool sparseset_bit_p ( )

inlinestatic

   Return true if e is a member of the set S, otherwise return false.  

Referenced by mark_pseudo_regno_live(), mark_regno_live(), process_bb_node_lives(), and sparseset_insert_bit().

static SPARSESET_ELT_TYPE sparseset_cardinality ( )

inlinestatic

   Return the number of elements currently in the set.  

References sparseset_def::size.

static void sparseset_clear ( )

inlinestatic

   Operation: S = {}
   Clear the set of all elements.  

Referenced by find_call_crossed_cheap_reg(), and process_bb_node_lives().

void sparseset_clear_bit	(	sparseset	,
		SPARSESET_ELT_TYPE
	)

void sparseset_copy	(	sparseset	,
		sparseset
	)

bool sparseset_equal_p	(	sparseset	,
		sparseset
	)

static void sparseset_insert_bit ( )

inlinestatic

   Low level insertion routine not meant for use outside of sparseset.[ch].
   Assumes E is valid and not already a member of the set S.  

References sparseset_def::members, and sparseset_bit_p().

void sparseset_ior	(	sparseset	,
		sparseset	,
		sparseset
	)

static SPARSESET_ELT_TYPE sparseset_iter_elm ( )

inlinestatic

static void sparseset_iter_init ( )

inlinestatic

static void sparseset_iter_next ( )

inlinestatic

static bool sparseset_iter_p ( )

inlinestatic

References sparseset_def::dense, and sparseset_def::iter.

static SPARSESET_ELT_TYPE sparseset_pop ( )

inlinestatic

   Return and remove the last member added to the set S.  

References sparseset_def::iter, sparseset_def::iter_inc, and sparseset_def::iterating.

static void sparseset_set_bit ( )

inlinestatic

   Operation: S = S + {e}
   Insert E into the set S, if it isn't already a member.  

References sparseset_def::dense, and sparseset_def::members.

Referenced by lra_intersected_live_ranges_p(), process_bb_node_lives(), sparseset_ior(), and spill_for().

static SPARSESET_ELT_TYPE sparseset_size ( )

inlinestatic

   Return the maximum number of elements this set can hold.  

References sparseset_def::sparse.