path-util: make path_compare() and path_hash_func() ignore "."
This also makes path_compare() may return arbitrary integer as it now simply pass the result of strcmp() or memcmp(). This changes the behavior of path_extract_filename/directory() when e.g. "/." or "/./" are input. But the change should be desired.
This commit is contained in:
+21
-20
@@ -17,7 +17,7 @@ DEFINE_HASH_OPS_FULL(string_hash_ops_free_free,
|
||||
void, free);
|
||||
|
||||
void path_hash_func(const char *q, struct siphash *state) {
|
||||
size_t n;
|
||||
bool add_slash = false;
|
||||
|
||||
assert(q);
|
||||
assert(state);
|
||||
@@ -27,30 +27,31 @@ void path_hash_func(const char *q, struct siphash *state) {
|
||||
* similar checks and also doesn't care for trailing slashes. Note that relative and absolute paths (i.e. those
|
||||
* which begin in a slash or not) will hash differently though. */
|
||||
|
||||
n = strspn(q, "/");
|
||||
if (n > 0) { /* Eat up initial slashes, and add one "/" to the hash for all of them */
|
||||
siphash24_compress(q, 1, state);
|
||||
q += n;
|
||||
}
|
||||
/* if path is absolute, add one "/" to the hash. */
|
||||
if (path_is_absolute(q))
|
||||
siphash24_compress("/", 1, state);
|
||||
|
||||
for (;;) {
|
||||
/* Determine length of next component */
|
||||
n = strcspn(q, "/");
|
||||
if (n == 0) /* Reached the end? */
|
||||
break;
|
||||
const char *e;
|
||||
int r;
|
||||
|
||||
/* Add this component to the hash and skip over it */
|
||||
siphash24_compress(q, n, state);
|
||||
q += n;
|
||||
r = path_find_first_component(&q, true, &e);
|
||||
if (r == 0)
|
||||
return;
|
||||
|
||||
/* How many slashes follow this component? */
|
||||
n = strspn(q, "/");
|
||||
if (q[n] == 0) /* Is this a trailing slash? If so, we are at the end, and don't care about the slashes anymore */
|
||||
break;
|
||||
if (add_slash)
|
||||
siphash24_compress_byte('/', state);
|
||||
|
||||
/* We are not add the end yet. Hash exactly one slash for all of the ones we just encountered. */
|
||||
siphash24_compress(q, 1, state);
|
||||
q += n;
|
||||
if (r < 0) {
|
||||
/* if a component is invalid, then add remaining part as a string. */
|
||||
string_hash_func(q, state);
|
||||
return;
|
||||
}
|
||||
|
||||
/* Add this component to the hash. */
|
||||
siphash24_compress(e, r, state);
|
||||
|
||||
add_slash = true;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
+28
-23
@@ -474,7 +474,7 @@ char *path_startswith_full(const char *path, const char *prefix, bool accept_dot
|
||||
}
|
||||
|
||||
int path_compare(const char *a, const char *b) {
|
||||
int d;
|
||||
int r;
|
||||
|
||||
assert(a);
|
||||
assert(b);
|
||||
@@ -482,40 +482,45 @@ int path_compare(const char *a, const char *b) {
|
||||
/* A relative path and an absolute path must not compare as equal.
|
||||
* Which one is sorted before the other does not really matter.
|
||||
* Here a relative path is ordered before an absolute path. */
|
||||
d = (a[0] == '/') - (b[0] == '/');
|
||||
if (d != 0)
|
||||
return d;
|
||||
r = CMP(path_is_absolute(a), path_is_absolute(b));
|
||||
if (r != 0)
|
||||
return r;
|
||||
|
||||
for (;;) {
|
||||
size_t j, k;
|
||||
const char *aa, *bb;
|
||||
int j, k;
|
||||
|
||||
a += strspn(a, "/");
|
||||
b += strspn(b, "/");
|
||||
j = path_find_first_component(&a, true, &aa);
|
||||
k = path_find_first_component(&b, true, &bb);
|
||||
|
||||
if (*a == 0 && *b == 0)
|
||||
return 0;
|
||||
if (j < 0 || k < 0) {
|
||||
/* When one of paths is invalid, order invalid path after valid one. */
|
||||
r = CMP(j < 0, k < 0);
|
||||
if (r != 0)
|
||||
return r;
|
||||
|
||||
/* fallback to use strcmp() if both paths are invalid. */
|
||||
return strcmp(a, b);
|
||||
}
|
||||
|
||||
/* Order prefixes first: "/foo" before "/foo/bar" */
|
||||
if (*a == 0)
|
||||
if (j == 0) {
|
||||
if (k == 0)
|
||||
return 0;
|
||||
return -1;
|
||||
if (*b == 0)
|
||||
}
|
||||
if (k == 0)
|
||||
return 1;
|
||||
|
||||
j = strcspn(a, "/");
|
||||
k = strcspn(b, "/");
|
||||
|
||||
/* Alphabetical sort: "/foo/aaa" before "/foo/b" */
|
||||
d = memcmp(a, b, MIN(j, k));
|
||||
if (d != 0)
|
||||
return (d > 0) - (d < 0); /* sign of d */
|
||||
r = memcmp(aa, bb, MIN(j, k));
|
||||
if (r != 0)
|
||||
return r;
|
||||
|
||||
/* Sort "/foo/a" before "/foo/aaa" */
|
||||
d = (j > k) - (j < k); /* sign of (j - k) */
|
||||
if (d != 0)
|
||||
return d;
|
||||
|
||||
a += j;
|
||||
b += k;
|
||||
r = CMP(j, k);
|
||||
if (r != 0)
|
||||
return r;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user