libs/ck-libs/ampi/romio/adio/common/heap-sort.c File Reference

Go to the source code of this file.

Functions
static void	heapify (heap_t *heap, int i)
static int	parent (int i)
static int	left (int i)
static int	right (int i)
int	ADIOI_Heap_create (heap_t *heap, int size)
void	ADIOI_Heap_free (heap_t *heap)
static void	build_heap (heap_t *heap) ATTRIBUTE((unused
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 *offset, int *proc, ADIO_Offset *reg_max_len)
static void	print_heap (heap_t *heap) ATTRIBUTE((unused
Variables
static void	used

---

Function Documentation

static void heapify	(	heap_t *	heap,
		int	i
	)			[static]

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

References PUP::l, left(), heap_t::nodes, offset, r, right(), and size.

Referenced by ADIOI_Heap_extract_min(), and build_heap().

Here is the call graph for this function:

Here is the caller graph for this function:

static int parent

(

int

i

)

[inline, static]

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

Referenced by ADIOI_Heap_insert(), AMPI_API_IMPL(), ampiInit(), HierarchicalLB::avg_load_reduction(), topo::topo::SpanningTreeStrategy_topoUnaware< Iterator, SpanningTreeVertex >::buildNextGen(), topo::topo::SpanningTreeStrategy_nodeAware_minGens< Iterator, SpanningTreeVertex >::buildNextGen(), topo::topo::SpanningTreeStrategy_nodeAware_minBytes< Iterator, SpanningTreeVertex >::buildNextGen(), topo::impl::buildNextGen_nodeAware_minBytes(), topo::impl::buildNextGen_nodeAware_minGens(), topo::impl::buildNextGen_topoUnaware(), ccd_heap_insert(), ccd_heap_remove(), idaStarWorker::ChildFinished(), final::comm2CommStruct(), cpd_memory_single_pup(), CqsPrioqGetDeq(), HierarchicalLB::distribute_amoung_children(), final::getDDT(), final::getReqs(), final::getWorldRank(), final::handleBlockedReq(), heap_addItem(), TopoCentLB::increaseKey(), ObjectHeap::insert(), maxHeap::insert(), minHeap::insert(), list_all_possible_groups(), makeRednMsg(), final::op2User_function(), final::opIsCommutative(), HbmLB::ProcessAtSync(), HybridBaseLB::ReceiveStats(), HbmLB::ReceiveStats(), Element_Bucket::Remove(), final::resumeThreadIfReady(), SearchNode::SearchNode(), SendSpanningChildren(), HierarchicalLB::setup_tree(), and minHeap::update().

Here is the caller graph for this function:

static int left

(

int

i

)

[inline, static]

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

Referenced by btree_delete_int(), fillblock(), heapify(), TopoCentLB::Heapify(), GreedyAgentLB::Heapify(), link_nfa_nodes(), mempool_free(), GreedyRefineLB::PHeap::min_heapify(), and radial_sort2D().

Here is the caller graph for this function:

static int right

(

int

i

)

[inline, static]

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

Referenced by btree_delete_int(), heapify(), TopoCentLB::Heapify(), GreedyAgentLB::Heapify(), and GreedyRefineLB::PHeap::min_heapify().

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_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:

static void build_heap

(

heap_t *

heap

)

[static]

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

References heapify(), and heap_t::size.

Referenced by run_test().

Here is the call graph for this function:

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 *	offset,
		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:

static void print_heap

(

heap_t *

heap

)

[static]

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

References int, level, heap_t::nodes, heap_node_t::offset, and heap_t::size.

---

Variable Documentation

static void used

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

Referenced by internal_malloc_stats(), and ST_RecursivePartition< Iterator >::maxSpreadDimension().