archives/linux
1
0
Fork 0
mirror of https://github.com/torvalds/linux.git synced 2026-03-08 03:44:45 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

exfat: return the start of next cache in exfat_cache_lookup

Browse source 
Change exfat_cache_lookup to return the cluster number of the last
cluster before the next cache (i.e., the end of the current cache range)
or the given 'end' if there is no next cache. This allows the caller to
know whether the next cluster after the current cache is cached.

The function signature is changed to accept an 'end' parameter, which
is the upper bound of the search range. The function now stops early
if it finds a cache that starts within the current cache's tail, meaning
caches are contiguous. The return value is the cluster number at which
the next cache starts (minus one) or the original 'end' if no next cache
is found.

The new behavior is illustrated as follows:

cache:  [ccccccc-------ccccccccc]
search: [..................]
return:               ^

Signed-off-by: Chi Zhiling <chizhiling@kylinos.cn>
Reviewed-by: Yuezhang Mo <Yuezhang.Mo@sony.com>
Signed-off-by: Namjae Jeon <linkinjeon@kernel.org>
This commit is contained in:
Chi Zhiling 2026-01-14 20:17:58 +08:00 • committed by Namjae Jeon
parent 8c6bdce0e9
commit 9fb696a10a
1 changed files with 37 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

49
fs/exfat/cache.c
View file

@ -80,41 +80,66 @@ static inline void exfat_cache_update_lru(struct inode *inode,
list_move(&cache->cache_list, &ei->cache_lru);
}
static unsigned int exfat_cache_lookup(struct inode *inode,
unsigned int fclus, struct exfat_cache_id *cid,
/*
* Find the cache that covers or precedes 'fclus' and return the last
* cluster before the next cache range.
*/
static inline unsigned int
exfat_cache_lookup(struct inode *inode, struct exfat_cache_id *cid,
unsigned int fclus, unsigned int end,
unsigned int *cached_fclus, unsigned int *cached_dclus)
{
struct exfat_inode_info *ei = EXFAT_I(inode);
static struct exfat_cache nohit = { .fcluster = 0, };
struct exfat_cache *hit = &nohit, *p;
unsigned int offset = EXFAT_EOF_CLUSTER;
unsigned int tail = 0; /* End boundary of hit cache */
/*
* Search range [fclus, end]. Stop early if:
* 1. Cache covers entire range, or
* 2. Next cache starts at current cache tail
*/
spin_lock(&ei->cache_lru_lock);
list_for_each_entry(p, &ei->cache_lru, cache_list) {
/* Find the cache of "fclus" or nearest cache. */
if (p->fcluster <= fclus && hit->fcluster <= p->fcluster) {
if (p->fcluster <= fclus) {
if (p->fcluster < hit->fcluster)
continue;
hit = p;
if (hit->fcluster + hit->nr_contig < fclus) {
offset = hit->nr_contig;
} else {
offset = fclus - hit->fcluster;
tail = hit->fcluster + hit->nr_contig;
/* Current cache covers [fclus, end] completely */
if (tail >= end)
break;
} else if (p->fcluster <= end) {
end = p->fcluster - 1;
/*
* If we have a hit and next cache starts within/at
* its tail, caches are contiguous, stop searching.
*/
if (tail && tail >= end)
break;
}
}
}
if (hit != &nohit) {
exfat_cache_update_lru(inode, hit);
unsigned int offset;
exfat_cache_update_lru(inode, hit);
cid->id = ei->cache_valid_id;
cid->nr_contig = hit->nr_contig;
cid->fcluster = hit->fcluster;
cid->dcluster = hit->dcluster;
offset = min(cid->nr_contig, fclus - cid->fcluster);
*cached_fclus = cid->fcluster + offset;
*cached_dclus = cid->dcluster + offset;
}
spin_unlock(&ei->cache_lru_lock);
return offset;
/* Return next cache start or 'end' if no more caches */
return end;
}
static struct exfat_cache *exfat_cache_merge(struct inode *inode,
@ -260,7 +285,7 @@ int exfat_get_cluster(struct inode *inode, unsigned int cluster,
return 0;
cache_init(&cid, fclus, *dclus);
exfat_cache_lookup(inode, cluster, &cid, &fclus, dclus);
exfat_cache_lookup(inode, &cid, cluster, cluster, &fclus, dclus);
if (fclus == cluster)
return 0;