about summary refs log tree commit diff
path: root/REORG.TODO/wcsmbs/wmemcmp.c
diff options
context:
space:
mode:
Diffstat (limited to 'REORG.TODO/wcsmbs/wmemcmp.c')
-rw-r--r--REORG.TODO/wcsmbs/wmemcmp.c83
1 files changed, 83 insertions, 0 deletions
diff --git a/REORG.TODO/wcsmbs/wmemcmp.c b/REORG.TODO/wcsmbs/wmemcmp.c
new file mode 100644
index 0000000000..ee0724cf2b
--- /dev/null
+++ b/REORG.TODO/wcsmbs/wmemcmp.c
@@ -0,0 +1,83 @@
+/* Copyright (C) 1996-2017 Free Software Foundation, Inc.
+   This file is part of the GNU C Library.
+   Contributed by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1996.
+
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2.1 of the License, or (at your option) any later version.
+
+   The GNU C Library is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with the GNU C Library; if not, see
+   <http://www.gnu.org/licenses/>.  */
+
+#include <wchar.h>
+
+#ifndef WMEMCMP
+# define WMEMCMP wmemcmp
+#endif
+
+int
+WMEMCMP (const wchar_t *s1, const wchar_t *s2, size_t n)
+{
+  wchar_t c1;
+  wchar_t c2;
+
+  while (n >= 4)
+    {
+      c1 = s1[0];
+      c2 = s2[0];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      c1 = s1[1];
+      c2 = s2[1];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      c1 = s1[2];
+      c2 = s2[2];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      c1 = s1[3];
+      c2 = s2[3];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      s1 += 4;
+      s2 += 4;
+      n -= 4;
+    }
+
+  if (n > 0)
+    {
+      c1 = s1[0];
+      c2 = s2[0];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      ++s1;
+      ++s2;
+      --n;
+    }
+  if (n > 0)
+    {
+      c1 = s1[0];
+      c2 = s2[0];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+      ++s1;
+      ++s2;
+      --n;
+    }
+  if (n > 0)
+    {
+      c1 = s1[0];
+      c2 = s2[0];
+      if (c1 - c2 != 0)
+	return c1 > c2 ? 1 : -1;
+    }
+
+  return 0;
+}