From 6224148fdd809170d138216d72b8e6180d626aec Mon Sep 17 00:00:00 2001
From: xleroy <xleroy@fca1b0fc-160b-0410-b1d3-a4f43f01ea2e>
Date: Wed, 17 Feb 2010 13:44:32 +0000
Subject: Reorganization test directory

git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1253 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e
---
 test/ccured_olden/bisort/README | 22 ----------------------
 1 file changed, 22 deletions(-)
 delete mode 100644 test/ccured_olden/bisort/README

(limited to 'test/ccured_olden/bisort/README')

diff --git a/test/ccured_olden/bisort/README b/test/ccured_olden/bisort/README
deleted file mode 100644
index 7b12c4bb..00000000
--- a/test/ccured_olden/bisort/README
+++ /dev/null
@@ -1,22 +0,0 @@
-/* For copyright information, see olden_v1.0/COPYRIGHT */
-******************
-olden_v1.0/benchmarks/bisort/README
-January 3, 1995
-Martin C. Carlisle
-
-this directory contains the Bitonic Sort benchmark:
-G. Bilardi and A. Nicolau.  "Adaptive Bitonic Sorting:  An optimal
-parallel algorithm for shared-memory machines."  SIAM J. Comput.
-18(2):216-228, 1989.
-
-as implemented for Olden by Martin C. Carlisle
-******************
-
-Makefile - "make bisort" makes executable
-
-args.c - handle command line arguments
-bitonic.c - main routines
-swap.c - used to swap subtrees
-node.h - declarations
-code.h - prototypes
-
-- 
cgit