OpenCores
URL https://opencores.org/ocsvn/or1k/or1k/trunk

Subversion Repositories or1k

[/] [or1k/] [trunk/] [newlib-1.10.0/] [newlib/] [libc/] [string/] [memcpy.c] - Diff between revs 1010 and 1765

Go to most recent revision | Only display areas with differences | Details | Blame | View Log

Rev 1010 Rev 1765
/*
/*
FUNCTION
FUNCTION
        <<memcpy>>---copy memory regions
        <<memcpy>>---copy memory regions
 
 
ANSI_SYNOPSIS
ANSI_SYNOPSIS
        #include <string.h>
        #include <string.h>
        void* memcpy(void *<[out]>, const void *<[in]>, size_t <[n]>);
        void* memcpy(void *<[out]>, const void *<[in]>, size_t <[n]>);
 
 
TRAD_SYNOPSIS
TRAD_SYNOPSIS
        void *memcpy(<[out]>, <[in]>, <[n]>
        void *memcpy(<[out]>, <[in]>, <[n]>
        void *<[out]>;
        void *<[out]>;
        void *<[in]>;
        void *<[in]>;
        size_t <[n]>;
        size_t <[n]>;
 
 
DESCRIPTION
DESCRIPTION
        This function copies <[n]> bytes from the memory region
        This function copies <[n]> bytes from the memory region
        pointed to by <[in]> to the memory region pointed to by
        pointed to by <[in]> to the memory region pointed to by
        <[out]>.
        <[out]>.
 
 
        If the regions overlap, the behavior is undefined.
        If the regions overlap, the behavior is undefined.
 
 
RETURNS
RETURNS
        <<memcpy>> returns a pointer to the first byte of the <[out]>
        <<memcpy>> returns a pointer to the first byte of the <[out]>
        region.
        region.
 
 
PORTABILITY
PORTABILITY
<<memcpy>> is ANSI C.
<<memcpy>> is ANSI C.
 
 
<<memcpy>> requires no supporting OS subroutines.
<<memcpy>> requires no supporting OS subroutines.
 
 
QUICKREF
QUICKREF
        memcpy ansi pure
        memcpy ansi pure
        */
        */
 
 
#include <_ansi.h>
#include <_ansi.h>
#include <stddef.h>
#include <stddef.h>
#include <limits.h>
#include <limits.h>
 
 
/* Nonzero if either X or Y is not aligned on a "long" boundary.  */
/* Nonzero if either X or Y is not aligned on a "long" boundary.  */
#define UNALIGNED(X, Y) \
#define UNALIGNED(X, Y) \
  (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
  (((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
 
 
/* How many bytes are copied each iteration of the 4X unrolled loop.  */
/* How many bytes are copied each iteration of the 4X unrolled loop.  */
#define BIGBLOCKSIZE    (sizeof (long) << 2)
#define BIGBLOCKSIZE    (sizeof (long) << 2)
 
 
/* How many bytes are copied each iteration of the word copy loop.  */
/* How many bytes are copied each iteration of the word copy loop.  */
#define LITTLEBLOCKSIZE (sizeof (long))
#define LITTLEBLOCKSIZE (sizeof (long))
 
 
/* Threshhold for punting to the byte copier.  */
/* Threshhold for punting to the byte copier.  */
#define TOO_SMALL(LEN)  ((LEN) < BIGBLOCKSIZE)
#define TOO_SMALL(LEN)  ((LEN) < BIGBLOCKSIZE)
 
 
_PTR
_PTR
_DEFUN (memcpy, (dst0, src0, len0),
_DEFUN (memcpy, (dst0, src0, len0),
        _PTR dst0 _AND
        _PTR dst0 _AND
        _CONST _PTR src0 _AND
        _CONST _PTR src0 _AND
        size_t len0)
        size_t len0)
{
{
#if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
#if defined(PREFER_SIZE_OVER_SPEED) || defined(__OPTIMIZE_SIZE__)
  char *dst = (char *) dst0;
  char *dst = (char *) dst0;
  char *src = (char *) src0;
  char *src = (char *) src0;
 
 
  _PTR save = dst0;
  _PTR save = dst0;
 
 
  while (len0--)
  while (len0--)
    {
    {
      *dst++ = *src++;
      *dst++ = *src++;
    }
    }
 
 
  return save;
  return save;
#else
#else
  char *dst = dst0;
  char *dst = dst0;
  _CONST char *src = src0;
  _CONST char *src = src0;
  long *aligned_dst;
  long *aligned_dst;
  _CONST long *aligned_src;
  _CONST long *aligned_src;
  int   len =  len0;
  int   len =  len0;
 
 
  /* If the size is small, or either SRC or DST is unaligned,
  /* If the size is small, or either SRC or DST is unaligned,
     then punt into the byte copy loop.  This should be rare.  */
     then punt into the byte copy loop.  This should be rare.  */
  if (!TOO_SMALL(len) && !UNALIGNED (src, dst))
  if (!TOO_SMALL(len) && !UNALIGNED (src, dst))
    {
    {
      aligned_dst = (long*)dst;
      aligned_dst = (long*)dst;
      aligned_src = (long*)src;
      aligned_src = (long*)src;
 
 
      /* Copy 4X long words at a time if possible.  */
      /* Copy 4X long words at a time if possible.  */
      while (len >= BIGBLOCKSIZE)
      while (len >= BIGBLOCKSIZE)
        {
        {
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          len -= BIGBLOCKSIZE;
          len -= BIGBLOCKSIZE;
        }
        }
 
 
      /* Copy one long word at a time if possible.  */
      /* Copy one long word at a time if possible.  */
      while (len >= LITTLEBLOCKSIZE)
      while (len >= LITTLEBLOCKSIZE)
        {
        {
          *aligned_dst++ = *aligned_src++;
          *aligned_dst++ = *aligned_src++;
          len -= LITTLEBLOCKSIZE;
          len -= LITTLEBLOCKSIZE;
        }
        }
 
 
       /* Pick up any residual with a byte copier.  */
       /* Pick up any residual with a byte copier.  */
      dst = (char*)aligned_dst;
      dst = (char*)aligned_dst;
      src = (char*)aligned_src;
      src = (char*)aligned_src;
    }
    }
 
 
  while (len--)
  while (len--)
    *dst++ = *src++;
    *dst++ = *src++;
 
 
  return dst0;
  return dst0;
#endif /* not PREFER_SIZE_OVER_SPEED */
#endif /* not PREFER_SIZE_OVER_SPEED */
}
}
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.