forked from apache/nuttx
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Separate the code that follows the BSD license into independent files. Signed-off-by: yangguangcai <[email protected]>
- Loading branch information
1 parent
cdccce4
commit f07aba5
Showing
35 changed files
with
1,841 additions
and
1,134 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,140 @@ | ||
| /**************************************************************************** | ||
| * libs/libc/string/lib_bsdmemccpy.c | ||
| * | ||
| * Copyright (c) 1994-2009 Red Hat, Inc. All rights reserved. | ||
| * | ||
| * This copyrighted material is made available to anyone wishing to use, | ||
| * modify, copy, or redistribute it subject to the terms and conditions | ||
| * of the BSD License. This program is distributed in the hope that | ||
| * it will be useful, but WITHOUT ANY WARRANTY expressed or implied, | ||
| * including the implied warranties of MERCHANTABILITY or FITNESS FOR | ||
| * A PARTICULAR PURPOSE. A copy of this license is available at | ||
| * http://www.opensource.org/licenses. Any Red Hat trademarks that are | ||
| * incorporated in the source code or documentation are not subject to | ||
| * the BSD License and may only be used or replicated with the express | ||
| * permission of Red Hat, Inc. | ||
| * | ||
| ****************************************************************************/ | ||
|
|
||
| /**************************************************************************** | ||
| * Included Files | ||
| ****************************************************************************/ | ||
|
|
||
| #include <nuttx/config.h> | ||
| #include <sys/types.h> | ||
| #include <string.h> | ||
|
|
||
| /**************************************************************************** | ||
| * Pre-processor Definitions | ||
| ****************************************************************************/ | ||
|
|
||
| /* Nonzero if either x or y is not aligned on a "long" boundary. */ | ||
|
|
||
| #define UNALIGNED(x, y) \ | ||
| (((long)(uintptr_t)(x) & (sizeof(long) - 1)) | ((long)(uintptr_t)(y) & (sizeof(long) - 1))) | ||
|
|
||
| /* How many bytes are copied each iteration of the word copy loop. */ | ||
|
|
||
| #define LITTLEBLOCKSIZE (sizeof(long)) | ||
|
|
||
| /* Threshhold for punting to the byte copier. */ | ||
|
|
||
| #define TOO_SMALL(len) ((len) < LITTLEBLOCKSIZE) | ||
|
|
||
| /* Macros for detecting endchar */ | ||
|
|
||
| #if LONG_MAX == 2147483647 | ||
| # define DETECTNULL(x) (((x) - 0x01010101) & ~(x) & 0x80808080) | ||
| #elif LONG_MAX == 9223372036854775807 | ||
| /* Nonzero if x (a long int) contains a NULL byte. */ | ||
|
|
||
| # define DETECTNULL(x) (((x) - 0x0101010101010101) & ~(x) & 0x8080808080808080) | ||
| #endif | ||
|
|
||
| /**************************************************************************** | ||
| * Public Functions | ||
| ****************************************************************************/ | ||
|
|
||
| /**************************************************************************** | ||
| * Name: memccpy | ||
| * | ||
| * Description: | ||
| * The memccpy() function copies bytes from memory area s2 into s1, | ||
| * stopping after the first occurrence of byte c (converted to an unsigned | ||
| * char) is copied, or after n bytes are copied, whichever comes first. If | ||
| * copying takes place between objects that overlap, the behavior is | ||
| * undefined. | ||
| * | ||
| * Returned Value: | ||
| * The memccpy() function returns a pointer to the byte after the copy of c | ||
| * in s1, or a null pointer if c was not found in the first n bytes of s2. | ||
| * | ||
| ****************************************************************************/ | ||
|
|
||
| #undef memccpy /* See mm/README.txt */ | ||
| FAR void *memccpy(FAR void *s1, FAR const void *s2, int c, size_t n) | ||
| { | ||
| FAR void *ptr = NULL; | ||
| FAR unsigned char *pout = (FAR unsigned char *)s1; | ||
| FAR const unsigned char *pin = (FAR const unsigned char *)s2; | ||
| FAR long *paligned_out; | ||
| FAR const long *paligned_in; | ||
| unsigned char endchar = c & 0xff; | ||
|
|
||
| /* If the size is small, or either pin or pout is unaligned, | ||
| * then punt into the byte copy loop. This should be rare. | ||
| */ | ||
|
|
||
| if (!TOO_SMALL(n) && !UNALIGNED(pin, pout)) | ||
| { | ||
| unsigned int i; | ||
| unsigned long mask = 0; | ||
|
|
||
| paligned_out = (FAR long *)pout; | ||
| paligned_in = (FAR long *)pin; | ||
|
|
||
| /* The fast code reads the ASCII one word at a time and only | ||
| * performs the bytewise search on word-sized segments if they | ||
| * contain the search character, which is detected by XORing | ||
| * the word-sized segment with a word-sized block of the search | ||
| * character and then detecting for the presence of NULL in the | ||
| * result. | ||
| */ | ||
|
|
||
| for (i = 0; i < LITTLEBLOCKSIZE; i++) | ||
| { | ||
| mask = (mask << 8) + endchar; | ||
| } | ||
|
|
||
| /* Copy one long word at a time if possible. */ | ||
|
|
||
| while (n >= LITTLEBLOCKSIZE) | ||
| { | ||
| unsigned long buffer = (unsigned long)(*paligned_in); | ||
| buffer ^= mask; | ||
| if (DETECTNULL(buffer)) | ||
| { | ||
| break; /* endchar is found, go byte by byte from here */ | ||
| } | ||
|
|
||
| *paligned_out++ = *paligned_in++; | ||
| n -= LITTLEBLOCKSIZE; | ||
| } | ||
|
|
||
| /* Pick up any residual with a byte copier. */ | ||
|
|
||
| pout = (FAR unsigned char *)paligned_out; | ||
| pin = (FAR unsigned char *)paligned_in; | ||
| } | ||
|
|
||
| while (n--) | ||
| { | ||
| if ((*pout++ = *pin++) == endchar) | ||
| { | ||
| ptr = pout; | ||
| break; | ||
| } | ||
| } | ||
|
|
||
| return ptr; | ||
| } |
Oops, something went wrong.