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]

1 files changed, 0 insertions, 43 deletions

diff --git a/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/bucketsort.c b/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/bucketsort.c
deleted file mode 100644
index 14aa213..0000000
--- a/benchmarks/CUDA/DG/3rdParty/ParMetis-3.1/METISLib/bucketsort.c
+++ /dev/null
@@ -1,43 +0,0 @@
-/*
- * Copyright 1997, Regents of the University of Minnesota
- *
- * bucketsort.c
- *
- * This file contains code that implement a variety of counting sorting
- * algorithms
- *
- * Started 7/25/97
- * George
- *
- * $Id: bucketsort.c,v 1.1 2003/07/16 15:55:00 karypis Exp $
- *
- */
-
-#include <metis.h>
-
-
-
-/*************************************************************************
-* This function uses simple counting sort to return a permutation array
-* corresponding to the sorted order. The keys are assumed to start from
-* 0 and they are positive.  This sorting is used during matching.
-**************************************************************************/
-void BucketSortKeysInc(int n, int max, idxtype *keys, idxtype *tperm, idxtype *perm)
-{
-  int i, ii;
-  idxtype *counts;
-
-  counts = idxsmalloc(max+2, 0, "BucketSortKeysInc: counts");
-
-  for (i=0; i<n; i++)
-    counts[keys[i]]++;
-  MAKECSR(i, max+1, counts);
-
-  for (ii=0; ii<n; ii++) {
-    i = tperm[ii];
-    perm[counts[keys[i]]++] = i;
-  }
-
-  free(counts);
-}
-