tools/regression/pipe/pipe-wraparound.c

   1 /*
   2 Copyright (C) 2004 Michael J. Silbersack. All rights reserved.
   3
   4 Redistribution and use in source and binary forms, with or without
   5 modification, are permitted provided that the following conditions
   6 are met:
   7 1. Redistributions of source code must retain the above copyright
   8    notice, this list of conditions and the following disclaimer.
   9 2. Redistributions in binary form must reproduce the above copyright
  10    notice, this list of conditions and the following disclaimer in the
  11    documentation and/or other materials provided with the distribution.
  12
  13 THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  14 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  15 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  16 ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
  17 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  18 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  19 OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  20 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  21 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  22 OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  23 SUCH DAMAGE.
  24 */
  25
  26 #include <stdio.h>
  27 #include <unistd.h>
  28 #include <sys/stat.h>
  29
  30 /*
  31  * $FreeBSD$
  32  * This program tests to make sure that wraparound writes and reads
  33  * are working, assuming that 16K socket buffers are used.  In order
  34  * to really stress the pipe code with this test, kernel modifications
  35  * nay be necessary.
  36  */
  37
  38 int main (void)
  39 {
  40 char buffer[32768], buffer2[32768];
  41 int desc[2];
  42 int buggy, error, i, successes, total;
  43 struct stat status;
  44 pid_t new_pid;
  45
  46 buggy = 0;
  47
  48 error = pipe(desc);
  49
  50 if (error)
  51         err(0, "Couldn't allocate fds\n");
  52
  53 buffer[0] = 'A';
  54
  55 for (i = 0; i < 32768; i++) {
  56         buffer[i] = buffer[i - 1] + 1;
  57         if (buffer[i] > 'Z')
  58                 buffer[i] = 'A';
  59         }
  60
  61 new_pid = fork();
  62
  63 if (new_pid == 0) {
  64         error = write(desc[1], &buffer, 4096);
  65         total += error;
  66         error = write(desc[1], &buffer[total], 4096);
  67         total += error;
  68         error = write(desc[1], &buffer[total], 4000);
  69         total += error;
  70         printf("Wrote %d bytes, sleeping\n", total);
  71         usleep(1000000);
  72         error = write(desc[1], &buffer[total], 3000);
  73         total += error;
  74         error = write(desc[1], &buffer[total], 3000);
  75         total += error;
  76         printf("Wrote another 6000 bytes, %d total, done\n", total);
  77 } else {
  78         usleep(500000);
  79         error = read(desc[0], &buffer2, 8192);
  80         total += error;
  81         printf("Read %d bytes, going back to sleep\n", error);
  82         usleep(1000000);
  83         error = read(desc[0], &buffer2[total], 16384);
  84         total += error;
  85         printf("Read %d bytes, done\n", error);
  86
  87         for (i = 0; i < total; i++) {
  88                 if (buffer[i] != buffer2[i]) {
  89                         buggy = 1;
  90                         printf("Location %d input: %hhx output: %hhx\n",
  91                                         i, buffer[i], buffer2[i]);
  92                 }
  93         }
  94
  95 if (buggy)
  96         printf("FAILURE\n");
  97 else
  98         printf("SUCCESS\n");
  99 }
 100
 101
 102 }