Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(56)

Unified Diff: fusl/src/string/strverscmp.c

Issue 1714623002: [fusl] clang-format fusl (Closed) Base URL: git@github.com:domokit/mojo.git@master
Patch Set: headers too Created 4 years, 10 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: fusl/src/string/strverscmp.c
diff --git a/fusl/src/string/strverscmp.c b/fusl/src/string/strverscmp.c
index 4daf276d0cfeb0725649141b8a16a52f89794710..fc62d8af63a8121ac2c76fb3f85abd8acbce30ce 100644
--- a/fusl/src/string/strverscmp.c
+++ b/fusl/src/string/strverscmp.c
@@ -2,33 +2,37 @@
#include <ctype.h>
#include <string.h>
-int strverscmp(const char *l0, const char *r0)
-{
- const unsigned char *l = (const void *)l0;
- const unsigned char *r = (const void *)r0;
- size_t i, dp, j;
- int z = 1;
+int strverscmp(const char* l0, const char* r0) {
+ const unsigned char* l = (const void*)l0;
+ const unsigned char* r = (const void*)r0;
+ size_t i, dp, j;
+ int z = 1;
- /* Find maximal matching prefix and track its maximal digit
- * suffix and whether those digits are all zeros. */
- for (dp=i=0; l[i]==r[i]; i++) {
- int c = l[i];
- if (!c) return 0;
- if (!isdigit(c)) dp=i+1, z=1;
- else if (c!='0') z=0;
- }
+ /* Find maximal matching prefix and track its maximal digit
+ * suffix and whether those digits are all zeros. */
+ for (dp = i = 0; l[i] == r[i]; i++) {
+ int c = l[i];
+ if (!c)
+ return 0;
+ if (!isdigit(c))
+ dp = i + 1, z = 1;
+ else if (c != '0')
+ z = 0;
+ }
- if (l[dp]!='0' && r[dp]!='0') {
- /* If we're not looking at a digit sequence that began
- * with a zero, longest digit string is greater. */
- for (j=i; isdigit(l[j]); j++)
- if (!isdigit(r[j])) return 1;
- if (isdigit(r[j])) return -1;
- } else if (z && dp<i && (isdigit(l[i]) || isdigit(r[i]))) {
- /* Otherwise, if common prefix of digit sequence is
- * all zeros, digits order less than non-digits. */
- return (unsigned char)(l[i]-'0') - (unsigned char)(r[i]-'0');
- }
+ if (l[dp] != '0' && r[dp] != '0') {
+ /* If we're not looking at a digit sequence that began
+ * with a zero, longest digit string is greater. */
+ for (j = i; isdigit(l[j]); j++)
+ if (!isdigit(r[j]))
+ return 1;
+ if (isdigit(r[j]))
+ return -1;
+ } else if (z && dp < i && (isdigit(l[i]) || isdigit(r[i]))) {
+ /* Otherwise, if common prefix of digit sequence is
+ * all zeros, digits order less than non-digits. */
+ return (unsigned char)(l[i] - '0') - (unsigned char)(r[i] - '0');
+ }
- return l[i] - r[i];
+ return l[i] - r[i];
}

Powered by Google App Engine
This is Rietveld 408576698