4 * Written 1992,1993 by Werner Almesberger
6 * Mar 1999. AV. Changed cache, so that it uses the starting cluster instead
8 * May 1999. AV. Fixed the bogosity with FAT32 (read "FAT28"). Fscking lusers.
11 #include <linux/slab.h>
14 /* this must be > 0. */
15 #define FAT_MAX_CACHE 8
18 struct list_head cache_list;
19 int nr_contig; /* number of contiguous clusters */
20 int fcluster; /* cluster number in the file. */
21 int dcluster; /* cluster number on disk. */
31 static inline int fat_max_cache(struct inode *inode)
36 static struct kmem_cache *fat_cache_cachep;
38 static void init_once(void *foo)
40 struct fat_cache *cache = (struct fat_cache *)foo;
42 INIT_LIST_HEAD(&cache->cache_list);
45 int __init fat_cache_init(void)
47 fat_cache_cachep = kmem_cache_create("fat_cache",
48 sizeof(struct fat_cache),
49 0, SLAB_RECLAIM_ACCOUNT|SLAB_MEM_SPREAD,
51 if (fat_cache_cachep == NULL)
56 void fat_cache_destroy(void)
58 kmem_cache_destroy(fat_cache_cachep);
61 static inline struct fat_cache *fat_cache_alloc(struct inode *inode)
63 return kmem_cache_alloc(fat_cache_cachep, GFP_NOFS);
66 static inline void fat_cache_free(struct fat_cache *cache)
68 BUG_ON(!list_empty(&cache->cache_list));
69 kmem_cache_free(fat_cache_cachep, cache);
72 static inline void fat_cache_update_lru(struct inode *inode,
73 struct fat_cache *cache)
75 if (MSDOS_I(inode)->cache_lru.next != &cache->cache_list)
76 list_move(&cache->cache_list, &MSDOS_I(inode)->cache_lru);
79 static int fat_cache_lookup(struct inode *inode, int fclus,
80 struct fat_cache_id *cid,
81 int *cached_fclus, int *cached_dclus)
83 static struct fat_cache nohit = { .fcluster = 0, };
85 struct fat_cache *hit = &nohit, *p;
88 spin_lock(&MSDOS_I(inode)->cache_lru_lock);
89 list_for_each_entry(p, &MSDOS_I(inode)->cache_lru, cache_list) {
90 /* Find the cache of "fclus" or nearest cache. */
91 if (p->fcluster <= fclus && hit->fcluster < p->fcluster) {
93 if ((hit->fcluster + hit->nr_contig) < fclus) {
94 offset = hit->nr_contig;
96 offset = fclus - hit->fcluster;
102 fat_cache_update_lru(inode, hit);
104 cid->id = MSDOS_I(inode)->cache_valid_id;
105 cid->nr_contig = hit->nr_contig;
106 cid->fcluster = hit->fcluster;
107 cid->dcluster = hit->dcluster;
108 *cached_fclus = cid->fcluster + offset;
109 *cached_dclus = cid->dcluster + offset;
111 spin_unlock(&MSDOS_I(inode)->cache_lru_lock);
116 static struct fat_cache *fat_cache_merge(struct inode *inode,
117 struct fat_cache_id *new)
121 list_for_each_entry(p, &MSDOS_I(inode)->cache_lru, cache_list) {
122 /* Find the same part as "new" in cluster-chain. */
123 if (p->fcluster == new->fcluster) {
124 BUG_ON(p->dcluster != new->dcluster);
125 if (new->nr_contig > p->nr_contig)
126 p->nr_contig = new->nr_contig;
133 static void fat_cache_add(struct inode *inode, struct fat_cache_id *new)
135 struct fat_cache *cache, *tmp;
137 if (new->fcluster == -1) /* dummy cache */
140 spin_lock(&MSDOS_I(inode)->cache_lru_lock);
141 if (new->id != FAT_CACHE_VALID &&
142 new->id != MSDOS_I(inode)->cache_valid_id)
143 goto out; /* this cache was invalidated */
145 cache = fat_cache_merge(inode, new);
147 if (MSDOS_I(inode)->nr_caches < fat_max_cache(inode)) {
148 MSDOS_I(inode)->nr_caches++;
149 spin_unlock(&MSDOS_I(inode)->cache_lru_lock);
151 tmp = fat_cache_alloc(inode);
153 spin_lock(&MSDOS_I(inode)->cache_lru_lock);
154 MSDOS_I(inode)->nr_caches--;
155 spin_unlock(&MSDOS_I(inode)->cache_lru_lock);
159 spin_lock(&MSDOS_I(inode)->cache_lru_lock);
160 cache = fat_cache_merge(inode, new);
162 MSDOS_I(inode)->nr_caches--;
168 struct list_head *p = MSDOS_I(inode)->cache_lru.prev;
169 cache = list_entry(p, struct fat_cache, cache_list);
171 cache->fcluster = new->fcluster;
172 cache->dcluster = new->dcluster;
173 cache->nr_contig = new->nr_contig;
176 fat_cache_update_lru(inode, cache);
178 spin_unlock(&MSDOS_I(inode)->cache_lru_lock);
182 * Cache invalidation occurs rarely, thus the LRU chain is not updated. It
183 * fixes itself after a while.
185 static void __fat_cache_inval_inode(struct inode *inode)
187 struct msdos_inode_info *i = MSDOS_I(inode);
188 struct fat_cache *cache;
190 while (!list_empty(&i->cache_lru)) {
191 cache = list_entry(i->cache_lru.next,
192 struct fat_cache, cache_list);
193 list_del_init(&cache->cache_list);
195 fat_cache_free(cache);
197 /* Update. The copy of caches before this id is discarded. */
199 if (i->cache_valid_id == FAT_CACHE_VALID)
203 void fat_cache_inval_inode(struct inode *inode)
205 spin_lock(&MSDOS_I(inode)->cache_lru_lock);
206 __fat_cache_inval_inode(inode);
207 spin_unlock(&MSDOS_I(inode)->cache_lru_lock);
210 static inline int cache_contiguous(struct fat_cache_id *cid, int dclus)
213 return ((cid->dcluster + cid->nr_contig) == dclus);
216 static inline void cache_init(struct fat_cache_id *cid, int fclus, int dclus)
218 cid->id = FAT_CACHE_VALID;
219 cid->fcluster = fclus;
220 cid->dcluster = dclus;
224 int fat_get_cluster(struct inode *inode, int cluster, int *fclus, int *dclus)
226 struct super_block *sb = inode->i_sb;
227 const int limit = sb->s_maxbytes >> MSDOS_SB(sb)->cluster_bits;
228 struct fat_entry fatent;
229 struct fat_cache_id cid;
232 BUG_ON(MSDOS_I(inode)->i_start == 0);
235 *dclus = MSDOS_I(inode)->i_start;
239 if (fat_cache_lookup(inode, cluster, &cid, fclus, dclus) < 0) {
241 * dummy, always not contiguous
242 * This is reinitialized by cache_init(), later.
244 cache_init(&cid, -1, -1);
247 fatent_init(&fatent);
248 while (*fclus < cluster) {
249 /* prevent the infinite loop of cluster chain */
250 if (*fclus > limit) {
251 fat_fs_error_ratelimit(sb,
252 "%s: detected the cluster chain loop"
253 " (i_pos %lld)", __func__,
254 MSDOS_I(inode)->i_pos);
259 nr = fat_ent_read(inode, &fatent, *dclus);
262 else if (nr == FAT_ENT_FREE) {
263 fat_fs_error_ratelimit(sb,
264 "%s: invalid cluster chain (i_pos %lld)",
266 MSDOS_I(inode)->i_pos);
269 } else if (nr == FAT_ENT_EOF) {
270 fat_cache_add(inode, &cid);
275 if (!cache_contiguous(&cid, *dclus))
276 cache_init(&cid, *fclus, *dclus);
279 fat_cache_add(inode, &cid);
281 fatent_brelse(&fatent);
285 static int fat_bmap_cluster(struct inode *inode, int cluster)
287 struct super_block *sb = inode->i_sb;
288 int ret, fclus, dclus;
290 if (MSDOS_I(inode)->i_start == 0)
293 ret = fat_get_cluster(inode, cluster, &fclus, &dclus);
296 else if (ret == FAT_ENT_EOF) {
297 fat_fs_error(sb, "%s: request beyond EOF (i_pos %lld)",
298 __func__, MSDOS_I(inode)->i_pos);
304 int fat_get_mapped_cluster(struct inode *inode, sector_t sector,
306 unsigned long *mapped_blocks, sector_t *bmap)
308 struct super_block *sb = inode->i_sb;
309 struct msdos_sb_info *sbi = MSDOS_SB(sb);
312 cluster = sector >> (sbi->cluster_bits - sb->s_blocksize_bits);
313 offset = sector & (sbi->sec_per_clus - 1);
314 cluster = fat_bmap_cluster(inode, cluster);
318 *bmap = fat_clus_to_blknr(sbi, cluster) + offset;
319 *mapped_blocks = sbi->sec_per_clus - offset;
320 if (*mapped_blocks > last_block - sector)
321 *mapped_blocks = last_block - sector;
327 static int is_exceed_eof(struct inode *inode, sector_t sector,
328 sector_t *last_block, int create)
330 struct super_block *sb = inode->i_sb;
331 const unsigned long blocksize = sb->s_blocksize;
332 const unsigned char blocksize_bits = sb->s_blocksize_bits;
334 *last_block = (i_size_read(inode) + (blocksize - 1)) >> blocksize_bits;
335 if (sector >= *last_block) {
340 * ->mmu_private can access on only allocation path.
341 * (caller must hold ->i_mutex)
343 *last_block = (MSDOS_I(inode)->mmu_private + (blocksize - 1))
345 if (sector >= *last_block)
352 int fat_bmap(struct inode *inode, sector_t sector, sector_t *phys,
353 unsigned long *mapped_blocks, int create, bool from_bmap)
355 struct msdos_sb_info *sbi = MSDOS_SB(inode->i_sb);
360 if ((sbi->fat_bits != 32) && (inode->i_ino == MSDOS_ROOT_INO)) {
361 if (sector < (sbi->dir_entries >> sbi->dir_per_block_bits)) {
362 *phys = sector + sbi->dir_start;
369 if (is_exceed_eof(inode, sector, &last_block, create))
372 last_block = inode->i_blocks >>
373 (inode->i_sb->s_blocksize_bits - 9);
374 if (sector >= last_block)
378 return fat_get_mapped_cluster(inode, sector, last_block, mapped_blocks,