libs/ck-libs/metis/libmetis/debug.c File Reference

Go to the source code of this file.

Functions
idx_t	ComputeCut (graph_t *graph, idx_t *where)
idx_t	ComputeVolume (graph_t *graph, idx_t *where)
idx_t	ComputeMaxCut (graph_t *graph, idx_t nparts, idx_t *where)
idx_t	CheckBnd (graph_t *graph)
idx_t	CheckBnd2 (graph_t *graph)
idx_t	CheckNodeBnd (graph_t *graph, idx_t onbnd)
idx_t	CheckRInfo (ctrl_t *ctrl, ckrinfo_t *rinfo)
idx_t	CheckNodePartitionParams (graph_t *graph)
idx_t	IsSeparable (graph_t *graph)
void	CheckKWayVolPartitionParams (ctrl_t *ctrl, graph_t *graph)

---

Function Documentation

idx_t ComputeCut	(	graph_t *	graph,
		idx_t *	where
	)

This function computes the total edgecut

Definition at line 21 of file debug.c.

References graph_t::adjncy, graph_t::adjwgt, graph_t::nvtxs, xadj, and graph_t::xadj.

Referenced by Bnd2WayBalance(), ComputePartitionInfo(), ComputePartitionInfoBipartite(), FM_2WayCutRefine(), FM_Mc2WayCutRefine(), General2WayBalance(), Greedy_KWayCutOptimize(), Greedy_McKWayCutOptimize(), McGeneral2WayBalance(), MoveGroupContigForVol(), MoveGroupMinConnForCut(), and MoveGroupMinConnForVol().

Here is the caller graph for this function:

idx_t ComputeVolume	(	graph_t *	graph,
		idx_t *	where
	)

This function computes the total volume

Definition at line 48 of file debug.c.

References graph_t::adjncy, adjncy, gk_free(), nparts, graph_t::nvtxs, graph_t::vsize, vsize, graph_t::xadj, and xadj.

Referenced by ComputeKWayPartitionParams(), ComputePartitionInfo(), ComputePartitionInfoBipartite(), Greedy_KWayCutOptimize(), Greedy_KWayVolOptimize(), Greedy_McKWayCutOptimize(), Greedy_McKWayVolOptimize(), InitKWayPartitioning(), MoveGroupContigForVol(), MoveGroupMinConnForVol(), and ProjectKWayPartition().

Here is the call graph for this function:

Here is the caller graph for this function:

idx_t ComputeMaxCut	(	graph_t *	graph,
		idx_t	nparts,
		idx_t *	where
	)

This function computes the cut given the graph and a where vector

Definition at line 85 of file debug.c.

References graph_t::adjncy, graph_t::adjwgt, gk_free(), graph_t::nvtxs, xadj, and graph_t::xadj.

Here is the call graph for this function:

idx_t CheckBnd

(

graph_t *

graph

)

This function checks whether or not the boundary information is correct

Definition at line 121 of file debug.c.

References graph_t::adjncy, adjncy, graph_t::bndind, graph_t::bndptr, graph_t::nbnd, graph_t::nvtxs, graph_t::where, where, graph_t::xadj, and xadj.

Referenced by Bnd2WayBalance(), FM_2WayCutRefine(), FM_Mc2WayCutRefine(), General2WayBalance(), McGeneral2WayBalance(), and Refine2Way().

Here is the caller graph for this function:

idx_t CheckBnd2

(

graph_t *

graph

)

This function checks whether or not the boundary information is correct

Definition at line 158 of file debug.c.

References graph_t::adjncy, adjncy, graph_t::adjwgt, graph_t::bndind, graph_t::bndptr, graph_t::nbnd, graph_t::nvtxs, graph_t::where, where, graph_t::xadj, and xadj.

Referenced by ComputeKWayPartitionParams(), and ProjectKWayPartition().

Here is the caller graph for this function:

idx_t CheckNodeBnd	(	graph_t *	graph,
		idx_t	onbnd
	)

This function checks whether or not the boundary information is correct

Definition at line 195 of file debug.c.

References graph_t::adjncy, adjncy, graph_t::bndind, graph_t::bndptr, graph_t::nvtxs, graph_t::where, where, graph_t::xadj, and xadj.

Referenced by Compute2WayNodePartitionParams(), FM_2WayNodeBalance(), FM_2WayNodeRefine1Sided(), FM_2WayNodeRefine1SidedP(), FM_2WayNodeRefine2Sided(), and FM_2WayNodeRefine2SidedP().

Here is the caller graph for this function:

idx_t CheckRInfo	(	ctrl_t *	ctrl,
		ckrinfo_t *	rinfo
	)

This function checks whether or not the rinfo of a vertex is consistent

Definition at line 232 of file debug.c.

References ctrl_t::cnbrpool, ckrinfo_t::inbr, and ckrinfo_t::nnbrs.

Referenced by MoveGroupContigForCut().

Here is the caller graph for this function:

idx_t CheckNodePartitionParams

(

graph_t *

graph

)

This function checks the correctness of the NodeFM data structures

Definition at line 255 of file debug.c.

References graph_t::adjncy, adjncy, graph_t::adjwgt, adjwgt, nrinfo_t::edegrees, PUP::l, graph_t::nrinfo, graph_t::nvtxs, graph_t::pwgts, graph_t::vwgt, vwgt, graph_t::where, where, graph_t::xadj, and xadj.

Referenced by ConstructMinCoverSeparator(), ConstructSeparator(), FM_2WayNodeBalance(), FM_2WayNodeRefine1Sided(), FM_2WayNodeRefine1SidedP(), FM_2WayNodeRefine2Sided(), FM_2WayNodeRefine2SidedP(), and Refine2WayNode().

Here is the caller graph for this function:

idx_t IsSeparable

(

graph_t *

graph

)

This function checks if the separator is indeed a separator

Definition at line 309 of file debug.c.

References graph_t::adjncy, adjncy, graph_t::nvtxs, graph_t::where, where, graph_t::xadj, and xadj.

Referenced by ConstructMinCoverSeparator(), and ConstructSeparator().

Here is the caller graph for this function:

void CheckKWayVolPartitionParams	(	ctrl_t *	ctrl,
		graph_t *	graph
	)

This function recomputes the vrinfo fields and checks them against those in the graph->vrinfo structure

Definition at line 339 of file debug.c.

References graph_t::adjncy, adjncy, vnbr_t::gv, vkrinfo_t::inbr, PUP::l, vkrinfo_t::ned, vkrinfo_t::nid, vkrinfo_t::nnbrs, ctrl_t::nparts, graph_t::nvtxs, vnbr_t::pid, graph_t::vkrinfo, ctrl_t::vnbrpool, graph_t::vsize, vsize, graph_t::where, where, wspacemalloc(), graph_t::xadj, and xadj.

Here is the call graph for this function: