2 * Copyright (C) 2004, OGAWA Hirofumi
3 * Released under GPL v2.
6 #include <linux/module.h>
8 #include <linux/msdos_fs.h>
9 #include <linux/blkdev.h>
12 struct fatent_operations
{
13 void (*ent_blocknr
)(struct super_block
*, int, int *, sector_t
*);
14 void (*ent_set_ptr
)(struct fat_entry
*, int);
15 int (*ent_bread
)(struct super_block
*, struct fat_entry
*,
17 int (*ent_get
)(struct fat_entry
*);
18 void (*ent_put
)(struct fat_entry
*, int);
19 int (*ent_next
)(struct fat_entry
*);
22 static DEFINE_SPINLOCK(fat12_entry_lock
);
24 static void fat12_ent_blocknr(struct super_block
*sb
, int entry
,
25 int *offset
, sector_t
*blocknr
)
27 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
28 int bytes
= entry
+ (entry
>> 1);
29 WARN_ON(entry
< FAT_START_ENT
|| sbi
->max_cluster
<= entry
);
30 *offset
= bytes
& (sb
->s_blocksize
- 1);
31 *blocknr
= sbi
->fat_start
+ (bytes
>> sb
->s_blocksize_bits
);
34 static void fat_ent_blocknr(struct super_block
*sb
, int entry
,
35 int *offset
, sector_t
*blocknr
)
37 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
38 int bytes
= (entry
<< sbi
->fatent_shift
);
39 WARN_ON(entry
< FAT_START_ENT
|| sbi
->max_cluster
<= entry
);
40 *offset
= bytes
& (sb
->s_blocksize
- 1);
41 *blocknr
= sbi
->fat_start
+ (bytes
>> sb
->s_blocksize_bits
);
44 static void fat12_ent_set_ptr(struct fat_entry
*fatent
, int offset
)
46 struct buffer_head
**bhs
= fatent
->bhs
;
47 if (fatent
->nr_bhs
== 1) {
48 WARN_ON(offset
>= (bhs
[0]->b_size
- 1));
49 fatent
->u
.ent12_p
[0] = bhs
[0]->b_data
+ offset
;
50 fatent
->u
.ent12_p
[1] = bhs
[0]->b_data
+ (offset
+ 1);
52 WARN_ON(offset
!= (bhs
[0]->b_size
- 1));
53 fatent
->u
.ent12_p
[0] = bhs
[0]->b_data
+ offset
;
54 fatent
->u
.ent12_p
[1] = bhs
[1]->b_data
;
58 static void fat16_ent_set_ptr(struct fat_entry
*fatent
, int offset
)
60 WARN_ON(offset
& (2 - 1));
61 fatent
->u
.ent16_p
= (__le16
*)(fatent
->bhs
[0]->b_data
+ offset
);
64 static void fat32_ent_set_ptr(struct fat_entry
*fatent
, int offset
)
66 WARN_ON(offset
& (4 - 1));
67 fatent
->u
.ent32_p
= (__le32
*)(fatent
->bhs
[0]->b_data
+ offset
);
70 static int fat12_ent_bread(struct super_block
*sb
, struct fat_entry
*fatent
,
71 int offset
, sector_t blocknr
)
73 struct buffer_head
**bhs
= fatent
->bhs
;
75 WARN_ON(blocknr
< MSDOS_SB(sb
)->fat_start
);
76 fatent
->fat_inode
= MSDOS_SB(sb
)->fat_inode
;
78 bhs
[0] = sb_bread(sb
, blocknr
);
82 if ((offset
+ 1) < sb
->s_blocksize
)
85 /* This entry is block boundary, it needs the next block */
87 bhs
[1] = sb_bread(sb
, blocknr
);
92 fat12_ent_set_ptr(fatent
, offset
);
98 printk(KERN_ERR
"FAT: FAT read failed (blocknr %llu)\n", (llu
)blocknr
);
102 static int fat_ent_bread(struct super_block
*sb
, struct fat_entry
*fatent
,
103 int offset
, sector_t blocknr
)
105 struct fatent_operations
*ops
= MSDOS_SB(sb
)->fatent_ops
;
107 WARN_ON(blocknr
< MSDOS_SB(sb
)->fat_start
);
108 fatent
->fat_inode
= MSDOS_SB(sb
)->fat_inode
;
109 fatent
->bhs
[0] = sb_bread(sb
, blocknr
);
110 if (!fatent
->bhs
[0]) {
111 printk(KERN_ERR
"FAT: FAT read failed (blocknr %llu)\n",
116 ops
->ent_set_ptr(fatent
, offset
);
120 static int fat12_ent_get(struct fat_entry
*fatent
)
122 u8
**ent12_p
= fatent
->u
.ent12_p
;
125 spin_lock(&fat12_entry_lock
);
126 if (fatent
->entry
& 1)
127 next
= (*ent12_p
[0] >> 4) | (*ent12_p
[1] << 4);
129 next
= (*ent12_p
[1] << 8) | *ent12_p
[0];
130 spin_unlock(&fat12_entry_lock
);
133 if (next
>= BAD_FAT12
)
138 static int fat16_ent_get(struct fat_entry
*fatent
)
140 int next
= le16_to_cpu(*fatent
->u
.ent16_p
);
141 WARN_ON((unsigned long)fatent
->u
.ent16_p
& (2 - 1));
142 if (next
>= BAD_FAT16
)
147 static int fat32_ent_get(struct fat_entry
*fatent
)
149 int next
= le32_to_cpu(*fatent
->u
.ent32_p
) & 0x0fffffff;
150 WARN_ON((unsigned long)fatent
->u
.ent32_p
& (4 - 1));
151 if (next
>= BAD_FAT32
)
156 static void fat12_ent_put(struct fat_entry
*fatent
, int new)
158 u8
**ent12_p
= fatent
->u
.ent12_p
;
160 if (new == FAT_ENT_EOF
)
163 spin_lock(&fat12_entry_lock
);
164 if (fatent
->entry
& 1) {
165 *ent12_p
[0] = (new << 4) | (*ent12_p
[0] & 0x0f);
166 *ent12_p
[1] = new >> 4;
168 *ent12_p
[0] = new & 0xff;
169 *ent12_p
[1] = (*ent12_p
[1] & 0xf0) | (new >> 8);
171 spin_unlock(&fat12_entry_lock
);
173 mark_buffer_dirty_inode(fatent
->bhs
[0], fatent
->fat_inode
);
174 if (fatent
->nr_bhs
== 2)
175 mark_buffer_dirty_inode(fatent
->bhs
[1], fatent
->fat_inode
);
178 static void fat16_ent_put(struct fat_entry
*fatent
, int new)
180 if (new == FAT_ENT_EOF
)
183 *fatent
->u
.ent16_p
= cpu_to_le16(new);
184 mark_buffer_dirty_inode(fatent
->bhs
[0], fatent
->fat_inode
);
187 static void fat32_ent_put(struct fat_entry
*fatent
, int new)
189 if (new == FAT_ENT_EOF
)
192 WARN_ON(new & 0xf0000000);
193 new |= le32_to_cpu(*fatent
->u
.ent32_p
) & ~0x0fffffff;
194 *fatent
->u
.ent32_p
= cpu_to_le32(new);
195 mark_buffer_dirty_inode(fatent
->bhs
[0], fatent
->fat_inode
);
198 static int fat12_ent_next(struct fat_entry
*fatent
)
200 u8
**ent12_p
= fatent
->u
.ent12_p
;
201 struct buffer_head
**bhs
= fatent
->bhs
;
202 u8
*nextp
= ent12_p
[1] + 1 + (fatent
->entry
& 1);
205 if (fatent
->nr_bhs
== 1) {
206 WARN_ON(ent12_p
[0] > (u8
*)(bhs
[0]->b_data
+ (bhs
[0]->b_size
- 2)));
207 WARN_ON(ent12_p
[1] > (u8
*)(bhs
[0]->b_data
+ (bhs
[0]->b_size
- 1)));
208 if (nextp
< (u8
*)(bhs
[0]->b_data
+ (bhs
[0]->b_size
- 1))) {
209 ent12_p
[0] = nextp
- 1;
214 WARN_ON(ent12_p
[0] != (u8
*)(bhs
[0]->b_data
+ (bhs
[0]->b_size
- 1)));
215 WARN_ON(ent12_p
[1] != (u8
*)bhs
[1]->b_data
);
216 ent12_p
[0] = nextp
- 1;
228 static int fat16_ent_next(struct fat_entry
*fatent
)
230 const struct buffer_head
*bh
= fatent
->bhs
[0];
232 if (fatent
->u
.ent16_p
< (__le16
*)(bh
->b_data
+ (bh
->b_size
- 2))) {
236 fatent
->u
.ent16_p
= NULL
;
240 static int fat32_ent_next(struct fat_entry
*fatent
)
242 const struct buffer_head
*bh
= fatent
->bhs
[0];
244 if (fatent
->u
.ent32_p
< (__le32
*)(bh
->b_data
+ (bh
->b_size
- 4))) {
248 fatent
->u
.ent32_p
= NULL
;
252 static struct fatent_operations fat12_ops
= {
253 .ent_blocknr
= fat12_ent_blocknr
,
254 .ent_set_ptr
= fat12_ent_set_ptr
,
255 .ent_bread
= fat12_ent_bread
,
256 .ent_get
= fat12_ent_get
,
257 .ent_put
= fat12_ent_put
,
258 .ent_next
= fat12_ent_next
,
261 static struct fatent_operations fat16_ops
= {
262 .ent_blocknr
= fat_ent_blocknr
,
263 .ent_set_ptr
= fat16_ent_set_ptr
,
264 .ent_bread
= fat_ent_bread
,
265 .ent_get
= fat16_ent_get
,
266 .ent_put
= fat16_ent_put
,
267 .ent_next
= fat16_ent_next
,
270 static struct fatent_operations fat32_ops
= {
271 .ent_blocknr
= fat_ent_blocknr
,
272 .ent_set_ptr
= fat32_ent_set_ptr
,
273 .ent_bread
= fat_ent_bread
,
274 .ent_get
= fat32_ent_get
,
275 .ent_put
= fat32_ent_put
,
276 .ent_next
= fat32_ent_next
,
279 static inline void lock_fat(struct msdos_sb_info
*sbi
)
281 mutex_lock(&sbi
->fat_lock
);
284 static inline void unlock_fat(struct msdos_sb_info
*sbi
)
286 mutex_unlock(&sbi
->fat_lock
);
289 void fat_ent_access_init(struct super_block
*sb
)
291 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
293 mutex_init(&sbi
->fat_lock
);
295 switch (sbi
->fat_bits
) {
297 sbi
->fatent_shift
= 2;
298 sbi
->fatent_ops
= &fat32_ops
;
301 sbi
->fatent_shift
= 1;
302 sbi
->fatent_ops
= &fat16_ops
;
305 sbi
->fatent_shift
= -1;
306 sbi
->fatent_ops
= &fat12_ops
;
311 static inline int fat_ent_update_ptr(struct super_block
*sb
,
312 struct fat_entry
*fatent
,
313 int offset
, sector_t blocknr
)
315 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
316 struct fatent_operations
*ops
= sbi
->fatent_ops
;
317 struct buffer_head
**bhs
= fatent
->bhs
;
319 /* Is this fatent's blocks including this entry? */
320 if (!fatent
->nr_bhs
|| bhs
[0]->b_blocknr
!= blocknr
)
322 if (sbi
->fat_bits
== 12) {
323 if ((offset
+ 1) < sb
->s_blocksize
) {
324 /* This entry is on bhs[0]. */
325 if (fatent
->nr_bhs
== 2) {
330 /* This entry needs the next block. */
331 if (fatent
->nr_bhs
!= 2)
333 if (bhs
[1]->b_blocknr
!= (blocknr
+ 1))
337 ops
->ent_set_ptr(fatent
, offset
);
341 int fat_ent_read(struct inode
*inode
, struct fat_entry
*fatent
, int entry
)
343 struct super_block
*sb
= inode
->i_sb
;
344 struct msdos_sb_info
*sbi
= MSDOS_SB(inode
->i_sb
);
345 struct fatent_operations
*ops
= sbi
->fatent_ops
;
349 if (entry
< FAT_START_ENT
|| sbi
->max_cluster
<= entry
) {
350 fatent_brelse(fatent
);
351 fat_fs_error(sb
, "invalid access to FAT (entry 0x%08x)", entry
);
355 fatent_set_entry(fatent
, entry
);
356 ops
->ent_blocknr(sb
, entry
, &offset
, &blocknr
);
358 if (!fat_ent_update_ptr(sb
, fatent
, offset
, blocknr
)) {
359 fatent_brelse(fatent
);
360 err
= ops
->ent_bread(sb
, fatent
, offset
, blocknr
);
364 return ops
->ent_get(fatent
);
367 /* FIXME: We can write the blocks as more big chunk. */
368 static int fat_mirror_bhs(struct super_block
*sb
, struct buffer_head
**bhs
,
371 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
372 struct buffer_head
*c_bh
;
376 for (copy
= 1; copy
< sbi
->fats
; copy
++) {
377 sector_t backup_fat
= sbi
->fat_length
* copy
;
379 for (n
= 0; n
< nr_bhs
; n
++) {
380 c_bh
= sb_getblk(sb
, backup_fat
+ bhs
[n
]->b_blocknr
);
385 memcpy(c_bh
->b_data
, bhs
[n
]->b_data
, sb
->s_blocksize
);
386 set_buffer_uptodate(c_bh
);
387 mark_buffer_dirty_inode(c_bh
, sbi
->fat_inode
);
388 if (sb
->s_flags
& MS_SYNCHRONOUS
)
389 err
= sync_dirty_buffer(c_bh
);
399 int fat_ent_write(struct inode
*inode
, struct fat_entry
*fatent
,
402 struct super_block
*sb
= inode
->i_sb
;
403 struct fatent_operations
*ops
= MSDOS_SB(sb
)->fatent_ops
;
406 ops
->ent_put(fatent
, new);
408 err
= fat_sync_bhs(fatent
->bhs
, fatent
->nr_bhs
);
412 return fat_mirror_bhs(sb
, fatent
->bhs
, fatent
->nr_bhs
);
415 static inline int fat_ent_next(struct msdos_sb_info
*sbi
,
416 struct fat_entry
*fatent
)
418 if (sbi
->fatent_ops
->ent_next(fatent
)) {
419 if (fatent
->entry
< sbi
->max_cluster
)
425 static inline int fat_ent_read_block(struct super_block
*sb
,
426 struct fat_entry
*fatent
)
428 struct fatent_operations
*ops
= MSDOS_SB(sb
)->fatent_ops
;
432 fatent_brelse(fatent
);
433 ops
->ent_blocknr(sb
, fatent
->entry
, &offset
, &blocknr
);
434 return ops
->ent_bread(sb
, fatent
, offset
, blocknr
);
437 static void fat_collect_bhs(struct buffer_head
**bhs
, int *nr_bhs
,
438 struct fat_entry
*fatent
)
442 for (n
= 0; n
< fatent
->nr_bhs
; n
++) {
443 for (i
= 0; i
< *nr_bhs
; i
++) {
444 if (fatent
->bhs
[n
] == bhs
[i
])
448 get_bh(fatent
->bhs
[n
]);
449 bhs
[i
] = fatent
->bhs
[n
];
455 int fat_alloc_clusters(struct inode
*inode
, int *cluster
, int nr_cluster
)
457 struct super_block
*sb
= inode
->i_sb
;
458 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
459 struct fatent_operations
*ops
= sbi
->fatent_ops
;
460 struct fat_entry fatent
, prev_ent
;
461 struct buffer_head
*bhs
[MAX_BUF_PER_PAGE
];
462 int i
, count
, err
, nr_bhs
, idx_clus
;
464 BUG_ON(nr_cluster
> (MAX_BUF_PER_PAGE
/ 2)); /* fixed limit */
467 if (sbi
->free_clusters
!= -1 && sbi
->free_clus_valid
&&
468 sbi
->free_clusters
< nr_cluster
) {
473 err
= nr_bhs
= idx_clus
= 0;
474 count
= FAT_START_ENT
;
475 fatent_init(&prev_ent
);
476 fatent_init(&fatent
);
477 fatent_set_entry(&fatent
, sbi
->prev_free
+ 1);
478 while (count
< sbi
->max_cluster
) {
479 if (fatent
.entry
>= sbi
->max_cluster
)
480 fatent
.entry
= FAT_START_ENT
;
481 fatent_set_entry(&fatent
, fatent
.entry
);
482 err
= fat_ent_read_block(sb
, &fatent
);
486 /* Find the free entries in a block */
488 if (ops
->ent_get(&fatent
) == FAT_ENT_FREE
) {
489 int entry
= fatent
.entry
;
491 /* make the cluster chain */
492 ops
->ent_put(&fatent
, FAT_ENT_EOF
);
494 ops
->ent_put(&prev_ent
, entry
);
496 fat_collect_bhs(bhs
, &nr_bhs
, &fatent
);
498 sbi
->prev_free
= entry
;
499 if (sbi
->free_clusters
!= -1)
500 sbi
->free_clusters
--;
503 cluster
[idx_clus
] = entry
;
505 if (idx_clus
== nr_cluster
)
509 * fat_collect_bhs() gets ref-count of bhs,
510 * so we can still use the prev_ent.
515 if (count
== sbi
->max_cluster
)
517 } while (fat_ent_next(sbi
, &fatent
));
520 /* Couldn't allocate the free entries */
521 sbi
->free_clusters
= 0;
522 sbi
->free_clus_valid
= 1;
528 fatent_brelse(&fatent
);
530 if (inode_needs_sync(inode
))
531 err
= fat_sync_bhs(bhs
, nr_bhs
);
533 err
= fat_mirror_bhs(sb
, bhs
, nr_bhs
);
535 for (i
= 0; i
< nr_bhs
; i
++)
539 fat_free_clusters(inode
, cluster
[0]);
544 int fat_free_clusters(struct inode
*inode
, int cluster
)
546 struct super_block
*sb
= inode
->i_sb
;
547 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
548 struct fatent_operations
*ops
= sbi
->fatent_ops
;
549 struct fat_entry fatent
;
550 struct buffer_head
*bhs
[MAX_BUF_PER_PAGE
];
552 int first_cl
= cluster
;
555 fatent_init(&fatent
);
558 cluster
= fat_ent_read(inode
, &fatent
, cluster
);
562 } else if (cluster
== FAT_ENT_FREE
) {
563 fat_fs_error(sb
, "%s: deleting FAT entry beyond EOF",
569 if (sbi
->options
.discard
) {
571 * Issue discard for the sectors we no longer
572 * care about, batching contiguous clusters
575 if (cluster
!= fatent
.entry
+ 1) {
576 int nr_clus
= fatent
.entry
- first_cl
+ 1;
579 fat_clus_to_blknr(sbi
, first_cl
),
580 nr_clus
* sbi
->sec_per_clus
);
586 ops
->ent_put(&fatent
, FAT_ENT_FREE
);
587 if (sbi
->free_clusters
!= -1) {
588 sbi
->free_clusters
++;
592 if (nr_bhs
+ fatent
.nr_bhs
> MAX_BUF_PER_PAGE
) {
593 if (sb
->s_flags
& MS_SYNCHRONOUS
) {
594 err
= fat_sync_bhs(bhs
, nr_bhs
);
598 err
= fat_mirror_bhs(sb
, bhs
, nr_bhs
);
601 for (i
= 0; i
< nr_bhs
; i
++)
605 fat_collect_bhs(bhs
, &nr_bhs
, &fatent
);
606 } while (cluster
!= FAT_ENT_EOF
);
608 if (sb
->s_flags
& MS_SYNCHRONOUS
) {
609 err
= fat_sync_bhs(bhs
, nr_bhs
);
613 err
= fat_mirror_bhs(sb
, bhs
, nr_bhs
);
615 fatent_brelse(&fatent
);
616 for (i
= 0; i
< nr_bhs
; i
++)
623 EXPORT_SYMBOL_GPL(fat_free_clusters
);
625 /* 128kb is the whole sectors for FAT12 and FAT16 */
626 #define FAT_READA_SIZE (128 * 1024)
628 static void fat_ent_reada(struct super_block
*sb
, struct fat_entry
*fatent
,
629 unsigned long reada_blocks
)
631 struct fatent_operations
*ops
= MSDOS_SB(sb
)->fatent_ops
;
635 ops
->ent_blocknr(sb
, fatent
->entry
, &offset
, &blocknr
);
637 for (i
= 0; i
< reada_blocks
; i
++)
638 sb_breadahead(sb
, blocknr
+ i
);
641 int fat_count_free_clusters(struct super_block
*sb
)
643 struct msdos_sb_info
*sbi
= MSDOS_SB(sb
);
644 struct fatent_operations
*ops
= sbi
->fatent_ops
;
645 struct fat_entry fatent
;
646 unsigned long reada_blocks
, reada_mask
, cur_block
;
650 if (sbi
->free_clusters
!= -1 && sbi
->free_clus_valid
)
653 reada_blocks
= FAT_READA_SIZE
>> sb
->s_blocksize_bits
;
654 reada_mask
= reada_blocks
- 1;
658 fatent_init(&fatent
);
659 fatent_set_entry(&fatent
, FAT_START_ENT
);
660 while (fatent
.entry
< sbi
->max_cluster
) {
661 /* readahead of fat blocks */
662 if ((cur_block
& reada_mask
) == 0) {
663 unsigned long rest
= sbi
->fat_length
- cur_block
;
664 fat_ent_reada(sb
, &fatent
, min(reada_blocks
, rest
));
668 err
= fat_ent_read_block(sb
, &fatent
);
673 if (ops
->ent_get(&fatent
) == FAT_ENT_FREE
)
675 } while (fat_ent_next(sbi
, &fatent
));
677 sbi
->free_clusters
= free
;
678 sbi
->free_clus_valid
= 1;
680 fatent_brelse(&fatent
);