Patch 14 (#27)

* Update README.md

* Patch 13 (#13)

* Update README.md

* Patch 12 (#11)

* Update README.md

* Patch 13 (#10)

* Update README.md

* Patch 12 (#9)

* Update memchr.cpp

* Patch 10 (#6)

* Optimize string functions

* Update string_utils.h

* Update memrchr.cpp

* Patch 11 (#8)

* Update README.md

* Patch 10 (#5)

* Update CMakeLists.txt

* Patch 9 (#4)

* Update strchr.cpp

* Add explicit cast (#3)

We need to have the most efficient c++ casting

* Update strchr.cpp

* Update CMakeLists.txt

* Update strrchr.cpp

* Update README.md

* Update string_utils.h

* Update string_utils.h

* Update memchr.cpp

* Update README.md

* Update string_utils.h

* Update README.md

* Update README.md

* Update memcpy.cpp

* Update memmove.cpp

* Update memmove.cpp

* Update strcpy.cpp

* Update strcpy.cpp

* Update strcpy.cpp

* Update memcpy.cpp

* Update memmove.cpp

* Update memmove.cpp

* Update memcpy.cpp

* Update memmove.cpp

* Update README.md

* Update memmove.cpp

* Update strcpy.cpp

* Update strcpy.cpp

* Update memmove.cpp

* Update strcpy.cpp

* Update strcpy.cpp

* Update memmove.cpp

* Fix

* Fix

* Update elements.h

* Update elements.h

* Oh

* j

* D

* Update memcpy.cpp

* fix

* Update memmove.cpp

* No except time

* Update strspn.cpp

* Update memmove.cpp

Co-authored-by: Radical Dweamer <[email protected]>

Author: AZero13

libc/src/string/aarch64/memcmp.cpp

@@ -14,20 +14,21 @@
 namespace __llvm_libc {
 namespace aarch64 {
 
-static int memcmp_impl(const char *lhs, const char *rhs, size_t count) {
+static int memcmp_impl(const char *lhs, const char *rhs,
+                       size_t count) noexcept {
   if (count == 0)
     return 0;
   if (count == 1)
     return ThreeWayCompare<_1>(lhs, rhs);
-  else if (count == 2)
+  if (count == 2)
     return ThreeWayCompare<_2>(lhs, rhs);
-  else if (count == 3)
+  if (count == 3)
     return ThreeWayCompare<_3>(lhs, rhs);
-  else if (count < 8)
+  if (count < 8)
     return ThreeWayCompare<HeadTail<_4>>(lhs, rhs, count);
-  else if (count < 16)
+  if (count < 16)
     return ThreeWayCompare<HeadTail<_8>>(lhs, rhs, count);
-  else if (count < 128) {
+  if (count < 128) {
     if (Equals<_16>(lhs, rhs)) {
       if (count < 32)
         return ThreeWayCompare<Tail<_16>>(lhs, rhs, count);
@@ -49,11 +50,11 @@ static int memcmp_impl(const char *lhs, const char *rhs, size_t count) {
 } // namespace aarch64
 
 LLVM_LIBC_FUNCTION(int, memcmp,
-                   (const void *lhs, const void *rhs, size_t count)) {
+                   (const void *lhs, const void *rhs, size_t count))
+noexcept {
 
-  const char *_lhs = reinterpret_cast<const char *>(lhs);
-  const char *_rhs = reinterpret_cast<const char *>(rhs);
-  return aarch64::memcmp_impl(_lhs, _rhs, count);
+  return aarch64::memcmp_impl(reinterpret_cast<const char *>(lhs),
+                              reinterpret_cast<const char *>(rhs), count);
 }
 
 } // namespace __llvm_libc

libc/src/string/aarch64/memcpy.cpp

@@ -42,7 +42,7 @@ using _64 = Repeated<scalar::UINT64, 8>;
 //   with little change on the code side.
 // This implementation has been tuned for Neoverse-N1.
 static void memcpy_aarch64(char *__restrict dst, const char *__restrict src,
-                           size_t count) {
+                           size_t count) noexcept {
   if (count == 0)
     return;
   if (count == 1)
@@ -68,7 +68,8 @@ static void memcpy_aarch64(char *__restrict dst, const char *__restrict src,
 
 LLVM_LIBC_FUNCTION(void *, memcpy,
                    (void *__restrict dst, const void *__restrict src,
-                    size_t size)) {
+                    size_t size))
+noexcept {
   memcpy_aarch64(reinterpret_cast<char *>(dst),
                  reinterpret_cast<const char *>(src), size);
   return dst;

libc/src/string/memchr.cpp

@@ -15,9 +15,10 @@
 namespace __llvm_libc {
 
 // TODO: Look at performance benefits of comparing words.
-LLVM_LIBC_FUNCTION(void *, memchr, (const void *src, int c, size_t n)) {
+LLVM_LIBC_FUNCTION(void *, memchr, (const void *src, int c, size_t n)) noexcept{
   return internal::find_first_character(
-      reinterpret_cast<const unsigned char *>(src), c, n);
+      reinterpret_cast<const unsigned char *>(src),
+      static_cast<unsigned char>(c), n);
 }
 
 } // namespace __llvm_libc

libc/src/string/memcmp.cpp

@@ -14,7 +14,7 @@ namespace __llvm_libc {
 
 // TODO: It is a simple implementation, an optimized version is preparing.
 LLVM_LIBC_FUNCTION(int, memcmp,
-                   (const void *lhs, const void *rhs, size_t count)) {
+                   (const void *lhs, const void *rhs, size_t count)) noexcept {
   const unsigned char *_lhs = reinterpret_cast<const unsigned char *>(lhs);
   const unsigned char *_rhs = reinterpret_cast<const unsigned char *>(rhs);
   for (size_t i = 0; i < count; ++i)

libc/src/string/memcpy.cpp

@@ -31,7 +31,7 @@ namespace __llvm_libc {
 // - As compilers and processors get better, the generated code is improved
 //   with little change on the code side.
 static void memcpy_impl(char *__restrict dst, const char *__restrict src,
-                        size_t count) {
+                        size_t count) noexcept {
   // Use scalar strategies (_1, _2, _3 ...)
   using namespace __llvm_libc::scalar;
 
@@ -60,7 +60,7 @@ static void memcpy_impl(char *__restrict dst, const char *__restrict src,
 
 LLVM_LIBC_FUNCTION(void *, memcpy,
                    (void *__restrict dst, const void *__restrict src,
-                    size_t size)) {
+                    size_t size)) noexcept {
   memcpy_impl(reinterpret_cast<char *>(dst),
               reinterpret_cast<const char *>(src), size);
   return dst;

libc/src/string/memmove.cpp

@@ -15,22 +15,24 @@
 
 namespace __llvm_libc {
 
-static inline void move_byte_forward(char *dest_m, const char *src_m,
-                                     size_t count) {
-  for (size_t offset = 0; count; --count, ++offset)
+static inline void move_byte_forward(unsigned char *dest_m,
+                                     const unsigned char *src_m,
+                                     size_t count) noexcept {
+  for (size_t offset = 0; offset != count; ++offset)
     dest_m[offset] = src_m[offset];
 }
 
-static inline void move_byte_backward(char *dest_m, const char *src_m,
-                                      size_t count) {
-  for (size_t offset = count - 1; count; --count, --offset)
-    dest_m[offset] = src_m[offset];
+static inline void move_byte_backward(unsigned char *dest_m,
+                                      const unsigned char *src_m,
+                                      size_t count) noexcept {
+  for (size_t offset = count; offset != 0; --offset)
+    dest_m[offset - 1] = src_m[offset - 1];
 }
 
-LLVM_LIBC_FUNCTION(void *, memmove,
-                   (void *dest, const void *src, size_t count)) {
-  char *dest_c = reinterpret_cast<char *>(dest);
-  const char *src_c = reinterpret_cast<const char *>(src);
+LLVM_LIBC_FUNCTION(void *, memmove, (void *dest, const void *src, size_t count))
+noexcept {
+  unsigned char *dest_c = reinterpret_cast<unsigned char *>(dest);
+  const unsigned char *src_c = reinterpret_cast<const unsigned char *>(src);
 
   // If the distance between src_c and dest_c is equal to or greater
   // than count (integerAbs(src_c - dest_c) >= count), they would not overlap.
@@ -58,7 +60,7 @@ LLVM_LIBC_FUNCTION(void *, memmove,
   // TODO: Optimize `move_byte_xxx(...)` functions.
   if (dest_c < src_c)
     move_byte_forward(dest_c, src_c, count);
-  if (dest_c > src_c)
+  else if (dest_c > src_c)
     move_byte_backward(dest_c, src_c, count);
   return dest;
 }