nuttx/lib/string/lib_memset.c
patacongo 073a96bb2c Add a versin of memset() optimized for speed
git-svn-id: svn://svn.code.sf.net/p/nuttx/code/trunk@5242 42af7a65-404d-4744-a932-0658087f49c3
2012-10-21 00:41:44 +00:00

144 lines
4.3 KiB
C

/************************************************************
* lib/string/lib_memset.c
*
* Copyright (C) 2007, 2011 Gregory Nutt. All rights reserved.
* Author: Gregory Nutt <gnutt@nuttx.org>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3. Neither the name NuttX nor the names of its contributors may be
* used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
************************************************************/
/************************************************************
* Compilation Switches
************************************************************/
/************************************************************
* Included Files
************************************************************/
#include <nuttx/config.h>
#include <sys/types.h>
#include <stdint.h>
#include <string.h>
#include <assert.h>
/************************************************************
* Global Functions
************************************************************/
#ifndef CONFIG_ARCH_MEMSET
void *memset(void *s, int c, size_t n)
{
#ifdef CONFIG_MEMSET_OPTSPEED
/* This version is optimized for speed (you could do better
* still by exploiting processor caching or memory burst
* knowledge. 64-bit support might improve performance as
* well.
*/
uintptr_t addr = (uintptr_t)s;
uint16_t val16 = ((uint16_t)c << 8) | (uint16_t)c;
uint32_t val32 = ((uint32_t)val16 << 16) | (uint32_t)val16;
/* Make sure that there is something to be cleared */
if (n > 0)
{
/* Align to a 16-bit boundary */
if ((addr & 1) != 0)
{
*(uint8_t*)addr = (uint8_t)c;
addr += 1;
n -= 1;
}
/* Check if there are at least 16-bits left to be zeroed */
if (n >= 2)
{
/* Align to a 32-bit boundary (we know that the destination
* address is already aligned to at least a 16-bit boundary).
*/
if ((addr & 3) != 0)
{
*(uint16_t*)addr = val16;
addr += 2;
n -= 2;
}
/* Loop while there are at least 32-bits left to be zeroed */
while (n >= 4)
{
*(uint32_t*)addr = val32;
addr += 4;
n -= 4;
}
}
/* We may get here under the following conditions:
*
* n = 0, addr may or may not be aligned
* n = 1, addr may or may not be aligned
* n = 2, addr is aligned to a 32-bit boundary
* n = 3, addr is aligned to a 32-bit boundary
*/
switch (n)
{
default:
case 0:
DEBUGASSERT(n == 0);
break;
case 2:
*(uint16_t*)addr = val16;
break;
case 3:
*(uint16_t*)addr = val16;
addr += 2;
case 1:
*(uint8_t*)addr = (uint8_t)c;
break;
}
}
#else
/* This version is optimized for size */
unsigned char *p = (unsigned char*)s;
while (n-- > 0) *p++ = c;
#endif
return s;
}
#endif