conv-ldb/generate.C File Reference

Go to the source code of this file.

Functions
void	addEdge (VerticesListType *graph, EdgeListType *l, int fm, int to)
void	addspEdge (VerticesListType *graph, EdgeListType *, int, int)
int	edgeExists (VerticesListType *graph, int fm, int to)
static Q *	makeQueue (void)
static int	isEmpty (Q *)
static int	dequeue (Q *)
VerticesListType *	InitVertices (EdgeListType *EdgeList, int V, int E)
void	gengraph (int, int, int, int *, int *, int)
static void	printOut (VerticesListType *vertices)
static void	copyOut (VerticesListType *vertices, int *npe, int *pes)
static void	initGraph (VerticesListType *graph)
static void	diameter (VerticesListType *graph)
static void	AddEdges (VerticesListType *graph, EdgeListType *EdgeList, int V, int n)
static void	AddEdges (EdgeListType *EdgeList, int V, int n)
void	fillAdjArray (Edge *edges, VerticesListType *vlist, int V, int E)
void	sortAdjArrays (VerticesListType *vlist)
static void	sort (int *adj, int fromIndex, int toIndex)
void	countDegrees (Edge *edges, Vertex *vertRecs, int V, int E)
static void	enqueue (Q *q, int i)
Variables
int	V
int	E
int	C

---

Function Documentation

void addEdge	(	VerticesListType *	graph,
		EdgeListType *	l,
		int	fm,
		int	to
	)

Definition at line 20 of file edgelist.C.

References VerticesListType::adjArray, Vertex::degree, EdgeListType::edges, index, n, Vertex::next, EdgeListType::next, and VerticesListType::vertexArray.

Referenced by AddEdges().

Here is the caller graph for this function:

void addspEdge	(	VerticesListType *	graph,
		EdgeListType *	,
		int	,
		int
	)

Definition at line 65 of file edgelist.C.

References VerticesListType::adjArray, Vertex::adjListInd, Vertex::degree, EdgeListType::edges, index, n, Vertex::next, EdgeListType::next, VerticesListType::vertexArray, and x.

Referenced by AddEdges().

Here is the caller graph for this function:

int edgeExists	(	VerticesListType *	graph,
		int	fm,
		int	to
	)

Definition at line 48 of file edgelist.C.

References VerticesListType::adjArray, Vertex::adjListInd, Vertex::degree, and VerticesListType::vertexArray.

Referenced by AddEdges().

Here is the caller graph for this function:

static Q * makeQueue

(

void

)

[static]

Definition at line 529 of file generate.C.

References Q::buf, Q::head, malloc(), Q::numElements, Q::size, and Q::tail.

Referenced by diameter().

Here is the call graph for this function:

Here is the caller graph for this function:

static int isEmpty

(

Q *

q

)

[static]

Definition at line 557 of file generate.C.

References Q::numElements.

Referenced by LV3D0_ClientManager_toClient::checkEmpty(), diameter(), LV3D0_ClientManager_toClient::getViews(), chunkList::length(), and LV3D0_ClientManager_toMaster::progress().

Here is the caller graph for this function:

static int dequeue

(

Q *

q

)

[static]

Definition at line 549 of file generate.C.

References Q::buf, Q::head, Q::numElements, r, and Q::size.

Referenced by diameter().

Here is the caller graph for this function:

VerticesListType * InitVertices	(	EdgeListType *	EdgeList,
		int	V,
		int	E
	)

Definition at line 293 of file generate.C.

References VerticesListType::adjArray, countDegrees(), EdgeListType::edges, fillAdjArray(), malloc(), VerticesListType::numVertices, sortAdjArrays(), and VerticesListType::vertexArray.

Here is the call graph for this function:

void gengraph	(	int	pV,
		int	pC,
		int	pseed,
		int *	pes,
		int *	npe,
		int	tofile
	)

Definition at line 48 of file generate.C.

References AddEdges(), C, CmiAbort(), CmiMyPe(), CmiPrintf(), copyOut(), CrnRand(), diameter(), E, InitEdgeList(), initGraph(), printOut(), and V.

Here is the call graph for this function:

static void printOut

(

VerticesListType *

vertices

)

[static]

Definition at line 435 of file generate.C.

References adj(), VerticesListType::adjArray, Vertex::degree, VerticesListType::numVertices, and VerticesListType::vertexArray.

Referenced by gengraph().

Here is the call graph for this function:

Here is the caller graph for this function:

static void copyOut	(	VerticesListType *	vertices,
		int *	npe,
		int *	pes
	)			[static]

Definition at line 415 of file generate.C.

References adj(), VerticesListType::adjArray, Vertex::adjListInd, CmiMyPe(), Vertex::degree, and VerticesListType::vertexArray.

Referenced by gengraph().

Here is the call graph for this function:

Here is the caller graph for this function:

static void initGraph

(

VerticesListType *

graph

)

[static]

Definition at line 458 of file generate.C.

References VerticesListType::adjArray, Vertex::adjListInd, C, Vertex::degree, E, malloc(), Vertex::next, VerticesListType::numVertices, V, and VerticesListType::vertexArray.

Referenced by gengraph().

Here is the call graph for this function:

Here is the caller graph for this function:

static void diameter

(

VerticesListType *

graph

)

[static]

Definition at line 475 of file generate.C.

References VerticesListType::adjArray, Vertex::adjListInd, calloc(), Vertex::degree, dequeue(), std::distance(), enqueue(), free(), isEmpty(), makeQueue(), V, VerticesListType::vertexArray, and PUP::w.

Referenced by gengraph().

Here is the call graph for this function:

Here is the caller graph for this function:

static void AddEdges	(	VerticesListType *	graph,
		EdgeListType *	EdgeList,
		int	V,
		int	n
	)			[static]

Definition at line 125 of file generate.C.

References addEdge(), addspEdge(), C, calloc(), count, edgeExists(), flag, free(), max(), maxi(), PUP::w, and x.

Referenced by gengraph().

Here is the call graph for this function:

Here is the caller graph for this function:

static void AddEdges	(	EdgeListType *	EdgeList,
		int	V,
		int	n
	)			[static]

Definition at line 91 of file generate.C.

References addEdge(), C, CrnRand(), edgeExists(), PUP::w, and x.

Here is the call graph for this function:

void fillAdjArray	(	Edge *	edges,
		VerticesListType *	vlist,
		int	V,
		int	E
	)

Definition at line 339 of file generate.C.

References adj(), VerticesListType::adjArray, Vertex::adjListInd, Vertex::next, Edge::node1, Edge::node2, VerticesListType::vertexArray, and x.

Referenced by InitVertices().

Here is the call graph for this function:

Here is the caller graph for this function:

void sortAdjArrays

(

VerticesListType *

vlist

)

Definition at line 357 of file generate.C.

References adj(), VerticesListType::adjArray, Vertex::adjListInd, Vertex::degree, E, PUP::m, n, VerticesListType::numVertices, sort(), V, and VerticesListType::vertexArray.

Referenced by InitVertices().

Here is the call graph for this function:

Here is the caller graph for this function:

static void sort	(	int *	adj,
		int	fromIndex,
		int	toIndex
	)			[static]

Definition at line 397 of file generate.C.

Referenced by topo::impl::TreeBoundingBoxOn3dTorus< Iterator >::bisect(), getPossiblePes(), instrumentedPhase::medianTime(), CpuTopology::numUniqNodes(), refine(), refineSwap(), sortAdjArrays(), TopoManager::sortRanksByHops(), sortVec(), topo::impl::TreeBoundingBoxOn3dTorus< Iterator >::trisect(), TreeMatchLB::work(), TempAwareGreedyLB::work(), GreedyRefineLB::work(), and GreedyLB::work().

Here is the caller graph for this function:

void countDegrees	(	Edge *	edges,
		Vertex *	vertRecs,
		int	V,
		int	E
	)

Definition at line 317 of file generate.C.

References Vertex::adjListInd, count, Vertex::degree, Vertex::next, Edge::node1, and Edge::node2.

Referenced by InitVertices().

Here is the caller graph for this function:

static void enqueue	(	Q *	q,
		int	i
	)			[static]

Definition at line 542 of file generate.C.

References Q::buf, Q::numElements, Q::size, and Q::tail.

Referenced by diameter().

Here is the caller graph for this function:

---

Variable Documentation

int V

Definition at line 26 of file generate.C.

Referenced by RecBisectBfLB::addToQ(), RecBisectBfLB::convertGraph(), diameter(), gengraph(), initGraph(), PUP::operator|(), and sortAdjArrays().

int E

Definition at line 27 of file generate.C.

Referenced by RecBisectBfLB::convertGraph(), gengraph(), initGraph(), and sortAdjArrays().

int C

Definition at line 28 of file generate.C.

Referenced by AddEdges(), checkConn(), FEM_REFINE2D_Split(), FEM_Refine_Operation(), gengraph(), getCoarsenResults(), getResults(), initGraph(), randTet(), REFINE2D_Coarsen(), REFINE2D_Split(), and sumArrayClipT().