libs/ck-libs/ampi/romio/adio/include/heap-sort.h File Reference

Go to the source code of this file.

Data Structures
struct	heap_node_t
struct	heap_t
Functions
void	ADIOI_Heap_free (heap_t *heap)
int	ADIOI_Heap_create (heap_t *heap, int size)
void	ADIOI_Heap_insert (heap_t *heap, ADIO_Offset offset, int proc, ADIO_Offset reg_max_len)
void	ADIOI_Heap_extract_min (heap_t *heap, ADIO_Offset *key, int *proc, ADIO_Offset *reg_max_len)

---

Function Documentation

void ADIOI_Heap_free

(

heap_t *

heap

)

Definition at line 41 of file heap-sort.c.

References heap_t::nodes.

Referenced by ADIOI_Build_agg_reqs().

Here is the caller graph for this function:

int ADIOI_Heap_create	(	heap_t *	heap,
		int	size
	)

Definition at line 32 of file heap-sort.c.

References heap_t::nodes, and heap_t::size.

Referenced by ADIOI_Build_agg_reqs().

Here is the caller graph for this function:

void ADIOI_Heap_insert	(	heap_t *	heap,
		ADIO_Offset	offset,
		int	proc,
		ADIO_Offset	reg_max_len
	)

Definition at line 81 of file heap-sort.c.

References heap_t::nodes, heap_node_t::offset, parent(), heap_node_t::proc, heap_node_t::reg_max_len, and heap_t::size.

Referenced by ADIOI_Build_agg_reqs(), and run_test().

Here is the call graph for this function:

Here is the caller graph for this function:

void ADIOI_Heap_extract_min	(	heap_t *	heap,
		ADIO_Offset *	key,
		int *	proc,
		ADIO_Offset *	reg_max_len
	)

Definition at line 96 of file heap-sort.c.

References assert, heapify(), heap_t::nodes, heap_node_t::offset, heap_node_t::proc, heap_node_t::reg_max_len, and heap_t::size.

Referenced by ADIOI_Build_agg_reqs().

Here is the call graph for this function:

Here is the caller graph for this function: