diff options
| author | Linus Torvalds <torvalds@linux-foundation.org> | 2024-06-16 13:06:56 -0700 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2024-06-19 12:35:57 -0700 |
| commit | ba848a77c90800cb686a5c8cf725e9bdfdcccfc2 (patch) | |
| tree | 6c196ff73b114e4b57d0fd95c7d3c3eca36e862d /drivers/misc/ibmasm/module.c | |
| parent | 631e1a710c0489e083d4f1276f6de787a5cf08fb (diff) | |
| download | linux-ba848a77c90800cb686a5c8cf725e9bdfdcccfc2.tar.gz linux-ba848a77c90800cb686a5c8cf725e9bdfdcccfc2.tar.bz2 linux-ba848a77c90800cb686a5c8cf725e9bdfdcccfc2.zip | |
vfs: link_path_walk: do '.' and '..' detection while hashing
Instead of loading the name again to detect '.' and '..', just use the
fact that we already had the masked last word available when as we
created the name hash. Which is exactly what we'd then test for.
Dealing with big-endian word ordering needs a bit of care, particularly
since we have the byte-at-a-time loop as a fallback that doesn't do BE
word loads. But not a big deal.
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'drivers/misc/ibmasm/module.c')
0 files changed, 0 insertions, 0 deletions