From 11b308e7363e937966b035b4891db32b4eece3bf Mon Sep 17 00:00:00 2001
From: Tor Aamodt <aamodt@ece.ubc.ca>
Date: Fri, 1 Oct 2010 08:55:28 -0800
Subject: integrating recent changes from fermi-test into fermi (i'll use
 "fermi" for more disruptive changes to the pipeline model such as updating
 the MSHRs and getting rid of the warp tracker, ripping out DWF, etc...)

[git-p4: depot-paths = "//depot/gpgpu_sim_research/fermi/distribution/": change = 7805]
---
 .../CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c | 239 ---------------------
 1 file changed, 239 deletions(-)
 delete mode 100644 benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c

(limited to 'benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c')

diff --git a/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c b/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c
deleted file mode 100644
index b71fe2f..0000000
--- a/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/debug.c
+++ /dev/null
@@ -1,239 +0,0 @@
-/*
- * Copyright 1997, Regents of the University of Minnesota
- *
- * debug.c
- *
- * This file contains code that performs self debuging
- *
- * Started 7/24/97
- * George
- *
- * $Id: debug.c,v 1.1 2003/07/16 15:55:01 karypis Exp $
- *
- */
-
-#include <metis.h>
-
-/*************************************************************************
-* This function computes the cut given the graph and a where vector
-**************************************************************************/
-int ComputeCut(GraphType *graph, idxtype *where)
-{
-  int i, j, cut;
-
-  if (graph->adjwgt == NULL) {
-    for (cut=0, i=0; i<graph->nvtxs; i++) {
-      for (j=graph->xadj[i]; j<graph->xadj[i+1]; j++)
-        if (where[i] != where[graph->adjncy[j]])
-          cut++;
-    }
-  }
-  else {
-    for (cut=0, i=0; i<graph->nvtxs; i++) {
-      for (j=graph->xadj[i]; j<graph->xadj[i+1]; j++)
-        if (where[i] != where[graph->adjncy[j]])
-          cut += graph->adjwgt[j];
-    }
-  }
-
-  return cut/2;
-}
-
-
-/*************************************************************************
-* This function checks whether or not the boundary information is correct
-**************************************************************************/
-int CheckBnd(GraphType *graph) 
-{
-  int i, j, nvtxs, nbnd;
-  idxtype *xadj, *adjncy, *where, *bndptr, *bndind;
-
-  nvtxs = graph->nvtxs;
-  xadj = graph->xadj;
-  adjncy = graph->adjncy;
-  where = graph->where;
-  bndptr = graph->bndptr;
-  bndind = graph->bndind;
-
-  for (nbnd=0, i=0; i<nvtxs; i++) {
-    if (xadj[i+1]-xadj[i] == 0)
-      nbnd++;   /* Islands are considered to be boundary vertices */
-
-    for (j=xadj[i]; j<xadj[i+1]; j++) {
-      if (where[i] != where[adjncy[j]]) {
-        nbnd++;
-        ASSERT(bndptr[i] != -1);
-        ASSERT(bndind[bndptr[i]] == i);
-        break;
-      }
-    }
-  }
-
-  ASSERTP(nbnd == graph->nbnd, ("%d %d\n", nbnd, graph->nbnd));
-
-  return 1;
-}
-
-
-
-/*************************************************************************
-* This function checks whether or not the boundary information is correct
-**************************************************************************/
-int CheckBnd2(GraphType *graph) 
-{
-  int i, j, nvtxs, nbnd, id, ed;
-  idxtype *xadj, *adjncy, *where, *bndptr, *bndind;
-
-  nvtxs = graph->nvtxs;
-  xadj = graph->xadj;
-  adjncy = graph->adjncy;
-  where = graph->where;
-  bndptr = graph->bndptr;
-  bndind = graph->bndind;
-
-  for (nbnd=0, i=0; i<nvtxs; i++) {
-    id = ed = 0;
-    for (j=xadj[i]; j<xadj[i+1]; j++) {
-      if (where[i] != where[adjncy[j]]) 
-        ed += graph->adjwgt[j];
-      else
-        id += graph->adjwgt[j];
-    }
-    if (ed - id >= 0 && xadj[i] < xadj[i+1]) {
-      nbnd++;
-      ASSERTP(bndptr[i] != -1, ("%d %d %d\n", i, id, ed));
-      ASSERT(bndind[bndptr[i]] == i);
-    }
-  }
-
-  ASSERTP(nbnd == graph->nbnd, ("%d %d\n", nbnd, graph->nbnd));
-
-  return 1;
-}
-
-/*************************************************************************
-* This function checks whether or not the boundary information is correct
-**************************************************************************/
-int CheckNodeBnd(GraphType *graph, int onbnd) 
-{
-  int i, j, nvtxs, nbnd;
-  idxtype *xadj, *adjncy, *where, *bndptr, *bndind;
-
-  nvtxs = graph->nvtxs;
-  xadj = graph->xadj;
-  adjncy = graph->adjncy;
-  where = graph->where;
-  bndptr = graph->bndptr;
-  bndind = graph->bndind;
-
-  for (nbnd=0, i=0; i<nvtxs; i++) {
-    if (where[i] == 2) 
-      nbnd++;   
-  }
-
-  ASSERTP(nbnd == onbnd, ("%d %d\n", nbnd, onbnd));
-
-  for (i=0; i<nvtxs; i++) {
-    if (where[i] != 2) {
-      ASSERTP(bndptr[i] == -1, ("%d %d\n", i, bndptr[i]));
-    }
-    else {
-      ASSERTP(bndptr[i] != -1, ("%d %d\n", i, bndptr[i]));
-    }
-  }
-
-  return 1;
-}
-
-
-
-/*************************************************************************
-* This function checks whether or not the rinfo of a vertex is consistent
-**************************************************************************/
-int CheckRInfo(RInfoType *rinfo)
-{
-  int i, j;
-
-  for (i=0; i<rinfo->ndegrees; i++) {
-    for (j=i+1; j<rinfo->ndegrees; j++)
-      ASSERTP(rinfo->edegrees[i].pid != rinfo->edegrees[j].pid, ("%d %d %d %d\n", i, j, rinfo->edegrees[i].pid, rinfo->edegrees[j].pid));
-  }
-
-  return 1;
-}
-
-
-
-/*************************************************************************
-* This function checks the correctness of the NodeFM data structures
-**************************************************************************/
-int CheckNodePartitionParams(GraphType *graph)
-{
-  int i, j, k, l, nvtxs, me, other;
-  idxtype *xadj, *adjncy, *adjwgt, *vwgt, *where;
-  idxtype edegrees[2], pwgts[3];
-
-  nvtxs = graph->nvtxs;
-  xadj = graph->xadj;
-  vwgt = graph->vwgt;
-  adjncy = graph->adjncy;
-  adjwgt = graph->adjwgt;
-
-  where = graph->where;
-
-  /*------------------------------------------------------------
-  / Compute now the separator external degrees
-  /------------------------------------------------------------*/
-  pwgts[0] = pwgts[1] = pwgts[2] = 0;
-  for (i=0; i<nvtxs; i++) {
-    me = where[i];
-    pwgts[me] += vwgt[i];
-
-    if (me == 2) { /* If it is on the separator do some computations */
-      edegrees[0] = edegrees[1] = 0;
-
-      for (j=xadj[i]; j<xadj[i+1]; j++) {
-        other = where[adjncy[j]];
-        if (other != 2)
-          edegrees[other] += vwgt[adjncy[j]];
-      }
-      if (edegrees[0] != graph->nrinfo[i].edegrees[0] || edegrees[1] != graph->nrinfo[i].edegrees[1]) {
-        printf("Something wrong with edegrees: %d %d %d %d %d\n", i, edegrees[0], edegrees[1], graph->nrinfo[i].edegrees[0], graph->nrinfo[i].edegrees[1]);
-        return 0;
-      }
-    }
-  }
-
-  if (pwgts[0] != graph->pwgts[0] || pwgts[1] != graph->pwgts[1] || pwgts[2] != graph->pwgts[2])
-    printf("Something wrong with part-weights: %d %d %d %d %d %d\n", pwgts[0], pwgts[1], pwgts[2], graph->pwgts[0], graph->pwgts[1], graph->pwgts[2]);
-
-  return 1;
-}
-
-
-/*************************************************************************
-* This function checks if the separator is indeed a separator
-**************************************************************************/
-int IsSeparable(GraphType *graph)
-{
-  int i, j, nvtxs, other;
-  idxtype *xadj, *adjncy, *where;
-
-  nvtxs = graph->nvtxs;
-  xadj = graph->xadj;
-  adjncy = graph->adjncy;
-  where = graph->where;
-
-  for (i=0; i<nvtxs; i++) {
-    if (where[i] == 2)
-      continue;
-    other = (where[i]+1)%2;
-    for (j=xadj[i]; j<xadj[i+1]; j++) {
-      ASSERTP(where[adjncy[j]] != other, ("%d %d %d %d %d %d\n", i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], xadj[adjncy[j]+1]-xadj[adjncy[j]]));
-    }
-  }
-
-  return 1;
-}
-
-
-- 
cgit v1.3