Ryusuke Konishi
|
39a9dcca61
nilfs2: emit error message when I/O error is detected
|
9 lat temu |
Ryusuke Konishi
|
feee880fa5
nilfs2: reduce bare use of printk() with nilfs_msg()
|
9 lat temu |
Mike Christie
|
2a222ca992
fs: have submit_bh users pass in op and flags separately
|
9 lat temu |
Ryusuke Konishi
|
7f00184e9c
nilfs2: remove unnecessary else after return or break
|
9 lat temu |
Ryusuke Konishi
|
0c6c44cb9f
nilfs2: avoid bare use of 'unsigned'
|
9 lat temu |
Ryusuke Konishi
|
4b420ab4ee
nilfs2: clean up old e-mail addresses
|
9 lat temu |
Ryusuke Konishi
|
5726d0b454
nilfs2: remove FSF mailing address from GPL notices
|
9 lat temu |
Ryusuke Konishi
|
4f05028f8d
nilfs2: fix gcc uninitialized-variable warnings in powerpc build
|
9 lat temu |
Ryusuke Konishi
|
09ef29e0f6
nilfs2: fix gcc unused-but-set-variable warnings
|
9 lat temu |
Ryusuke Konishi
|
d8fd150fe3
nilfs2: fix sanity check of btree level in nilfs_btree_root_broken()
|
10 lat temu |
Ryusuke Konishi
|
5b20384fb3
nilfs2: add bmap function to seek a valid key
|
10 lat temu |
Ryusuke Konishi
|
957ed60b53
nilfs2: fix potential memory overrun on inode
|
10 lat temu |
Ryusuke Konishi
|
d40990537c
nilfs2: fix missing block address termination in btree node shrinking
|
14 lat temu |
Ryusuke Konishi
|
fe744fdb74
nilfs2: fix incorrect block address termination in node concatenation
|
14 lat temu |
Ryusuke Konishi
|
5fc7b14177
nilfs2: use mark_buffer_dirty to mark btnode or meta data dirty
|
14 lat temu |
Ryusuke Konishi
|
be667377a8
nilfs2: record used amount of each checkpoint in checkpoint list
|
14 lat temu |
Ryusuke Konishi
|
03bdb5ac58
nilfs2: apply read-ahead for nilfs_btree_lookup_contig
|
15 lat temu |
Ryusuke Konishi
|
4e13e66bee
nilfs2: introduce check flag to btree node buffer
|
15 lat temu |
Ryusuke Konishi
|
464ece8863
nilfs2: add btree get block function with readahead option
|
15 lat temu |
Ryusuke Konishi
|
26dfdd8e29
nilfs2: add read ahead mode to nilfs_btnode_submit_block
|
15 lat temu |
Ryusuke Konishi
|
7c397a81fe
nilfs2: eliminate inline keywords in btree implementation
|
15 lat temu |
Ryusuke Konishi
|
5ad2686e92
nilfs2: get maximum number of child nodes from bmap object
|
15 lat temu |
Ryusuke Konishi
|
9b7b265c9a
nilfs2: reduce repetitive calculation of max number of child nodes
|
15 lat temu |
Ryusuke Konishi
|
ea64ab87cd
nilfs2: optimize calculation of min/max number of btree node children
|
15 lat temu |
Ryusuke Konishi
|
364ec2d700
nilfs2: remove redundant pointer checks in bmap lookup functions
|
15 lat temu |
Ryusuke Konishi
|
dc935be2a0
nilfs2: unify bmap set_target_v operations
|
15 lat temu |
Ryusuke Konishi
|
e7c274f808
nilfs2: get rid of nilfs_btree uses
|
15 lat temu |
Ryusuke Konishi
|
583ada4761
nilfs2: remove constant qualifier from argument of bmap propagate
|
15 lat temu |
Ryusuke Konishi
|
25b8d7ded0
nilfs2: get rid of private conversion macros on bmap key and pointer
|
15 lat temu |
Ryusuke Konishi
|
1d5385b9f3
nilfs2: verify btree node after reading
|
15 lat temu |