1 files changed, 0 insertions, 44 deletions
diff --git a/src/fftw3/kernel/kbuffered.c b/src/fftw3/kernel/kbuffered.c
deleted file mode 100644
index d20403f..0000000
--- a/src/fftw3/kernel/kbuffered.c
+++ /dev/null
@@ -1,44 +0,0 @@
-/*
- * Copyright (c) 2003 Matteo Frigo
- * Copyright (c) 2003 Massachusetts Institute of Technology
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- *
- */
-
-/* routines shared by the various buffered solvers */
-
-#include "ifftw.h"
-
-int X(compute_nbuf)(int n, int vl, int nbuf, int maxbufsz)
-{
-     int i; 
-
-     if (nbuf * n > maxbufsz)
-          nbuf = X(imax)((int)1, maxbufsz / n);
-
-     /*
-      * Look for a buffer number (not too big) that divides the
-      * vector length, in order that we only need one child plan:
-      */
-     for (i = nbuf; i < vl && i < 2 * nbuf; ++i)
-          if (vl % i == 0)
-               return i;
-
-     /* whatever... */
-     nbuf = X(imin)(nbuf, vl);
-     return nbuf;
-}
-