string/testcopy.c

   1 /* Copyright (C) 1990, 1991, 1992 Free Software Foundation, Inc.
   2    Contributed by Torbjorn Granlund (tege@sics.se).
   3
   4 This file is part of the GNU C Library.
   5
   6 The GNU C Library is free software; you can redistribute it and/or
   7 modify it under the terms of the GNU Library General Public License as
   8 published by the Free Software Foundation; either version 2 of the
   9 License, or (at your option) any later version.
  10
  11 The GNU C Library is distributed in the hope that it will be useful,
  12 but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 Library General Public License for more details.
  15
  16 You should have received a copy of the GNU Library General Public
  17 License along with the GNU C Library; see the file COPYING.LIB.  If
  18 not, write to the Free Software Foundation, Inc., 675 Mass Ave,
  19 Cambridge, MA 02139, USA.  */
  20
  21 #include <ansidecl.h>
  22 #include <stdlib.h>
  23 #include <stdio.h>
  24 #include <string.h>
  25 #include <malloc.h>
  26
  27 int
  28 DEFUN(main, (argc, argv),
  29       int argc AND char **argv)
  30 {
  31   char *mem, *memp;
  32   char *rand_mem;
  33   char *lo_around, *hi_around;
  34   int size, max_size;
  35   int src_off, dst_off;
  36   int i;
  37   int space_around = 10;
  38
  39   max_size = 256;
  40
  41   mem = malloc (max_size + 2 * max_size + 2 * space_around);
  42   rand_mem = malloc (max_size);
  43   lo_around = malloc (space_around);
  44   hi_around = malloc (space_around);
  45   memp = mem + space_around;
  46
  47   /* Fill RAND_MEM with random bytes, each non-zero.  */
  48   for (i = 0; i < max_size; i++)
  49     {
  50       int x;
  51       do
  52         x = random ();
  53       while (x == 0);
  54       rand_mem[i] = x;
  55     }
  56
  57   for (size = 0; size < max_size; size++)
  58     {
  59       printf("phase %d\n", size);
  60       for (src_off = 0; src_off <= 16; src_off++)
  61         {
  62           for (dst_off = 0; dst_off <= 16; dst_off++)
  63             {
  64               /* Put zero around the intended destination, to check
  65                  that it's not clobbered.  */
  66               for (i = 1; i < space_around; i++)
  67                 {
  68                   memp[dst_off - i] = 0;
  69                   memp[dst_off + size - 1 + i] = 0;
  70                 }
  71
  72               /* Fill the source area with known contents.  */
  73               for (i = 0; i < size; i++)
  74                 memp[src_off + i] = rand_mem[i];
  75
  76               /* Remember the contents around the destination area.
  77                  (It might not be what we wrote some lines above, since
  78                  the src area and the dst area overlap.)  */
  79               for (i = 1; i < space_around; i++)
  80                 {
  81                   lo_around[i] = memp[dst_off - i];
  82                   hi_around[i] = memp[dst_off + size - 1 + i];
  83                 }
  84
  85               memmove (memp + dst_off, memp + src_off, size);
  86
  87               /* Check that the destination area has the same
  88                  contents we wrote to the source area.  */
  89               for (i = 0; i < size; i++)
  90                 {
  91                   if (memp[dst_off + i] != rand_mem[i])
  92                     abort ();
  93                 }
  94
  95               /* Check that the area around the destination is not
  96                  clobbered.  */
  97               for (i = 1; i < space_around; i++)
  98                 {
  99                   if (memp[dst_off - i] != lo_around[i])
 100                     abort ();
 101                   if (memp[dst_off + size - 1 + i] != hi_around[i])
 102                     abort ();
 103                 }
 104             }
 105         }
 106     }
 107
 108   puts ("Test succeeded.");
 109
 110   return 0;
 111 }