summaryrefslogtreecommitdiff
path: root/fs/nilfs2/btree.c
AgeCommit message (Expand)AuthorFilesLines
2011-03-08nilfs2: record used amount of each checkpoint in checkpoint listRyusuke Konishi1-3/+3
2010-07-23nilfs2: apply read-ahead for nilfs_btree_lookup_contigRyusuke Konishi1-17/+33
2010-07-23nilfs2: introduce check flag to btree node bufferRyusuke Konishi1-1/+9
2010-07-23nilfs2: add btree get block function with readahead optionRyusuke Konishi1-26/+68
2010-07-23nilfs2: add read ahead mode to nilfs_btnode_submit_blockRyusuke Konishi1-1/+2
2010-07-23nilfs2: eliminate inline keywords in btree implementationRyusuke Konishi1-22/+19
2010-07-23nilfs2: get maximum number of child nodes from bmap objectRyusuke Konishi1-1/+5
2010-07-23nilfs2: reduce repetitive calculation of max number of child nodesRyusuke Konishi1-157/+182
2010-07-23nilfs2: optimize calculation of min/max number of btree node childrenRyusuke Konishi1-18/+18
2010-07-23nilfs2: remove redundant pointer checks in bmap lookup functionsRyusuke Konishi1-5/+1
2010-07-23nilfs2: unify bmap set_target_v operationsRyusuke Konishi1-9/+2
2010-07-23nilfs2: get rid of nilfs_btree usesRyusuke Konishi1-176/+140
2010-07-23nilfs2: remove constant qualifier from argument of bmap propagateRyusuke Konishi1-2/+2
2010-07-23nilfs2: get rid of private conversion macros on bmap key and pointerRyusuke Konishi1-18/+16
2010-07-23nilfs2: verify btree node after readingRyusuke Konishi1-3/+47
2010-07-23nilfs2: add sanity check in nilfs_btree_add_dirty_bufferRyusuke Konishi1-0/+12
2010-05-10nilfs2: cleanup multi kmem_cache_{create,destroy} codeLi Hong1-40/+0
2010-05-10nilfs2: Combine nilfs_btree_release_path() and nilfs_btree_free_path()Li Hong1-17/+5
2010-05-10nilfs2: Combine nilfs_btree_alloc_path() and nilfs_btree_init_path()Li Hong1-22/+17
2010-04-02nilfs2: Remove an uninitialization warning in nilfs_btree_propagate_v()Li Hong1-1/+1
2009-11-28nilfs2: use list_splice_tail or list_splice_tail_initRyusuke Konishi1-1/+1
2009-11-20nilfs2: eliminate nilfs_btnode_get functionRyusuke Konishi1-1/+12
2009-11-20nilfs2: use nilfs_btnode_create_block functionRyusuke Konishi1-5/+8
2009-11-20nilfs2: remove buffer locking from btree codeRyusuke Konishi1-60/+0
2009-11-20nilfs2: get rid of BUG_ON use in btree lookup routinesRyusuke Konishi1-2/+16
2009-09-14nilfs2: allow btree code to directly call dat operationsRyusuke Konishi1-67/+84
2009-09-14nilfs2: stop zero-fill of btree path just before free itRyusuke Konishi1-24/+12
2009-09-14nilfs2: remove unused btree argument from btree functionsRyusuke Konishi1-248/+208
2009-06-10nilfs2: support contiguous lookup of blocksRyusuke Konishi1-0/+84
2009-06-10nilfs2: remove nilfs_btree_operations from btree mappingRyusuke Konishi1-37/+15
2009-06-10nilfs2: remove bmap pointer operationsRyusuke Konishi1-54/+46
2009-06-10nilfs2: remove useless b_low and b_high fields from nilfs_bmap structRyusuke Konishi1-15/+7
2009-06-10nilfs2: remove pointless NULL check of bpop_commit_alloc_ptr functionRyusuke Konishi1-10/+5
2009-06-10nilfs2: move get block functions in bmap.c into btree codesRyusuke Konishi1-22/+35
2009-06-10nilfs2: remove nilfs_bmap_delete_blockRyusuke Konishi1-4/+4
2009-06-10nilfs2: remove nilfs_bmap_put_blockRyusuke Konishi1-17/+16
2009-06-10nilfs2: unify bmap operations starting use of indirect block addressRyusuke Konishi1-5/+2
2009-04-07nilfs2: replace BUG_ON and BUG calls triggerable from ioctlRyusuke Konishi1-17/+10
2009-04-07nilfs2: clean up indirect function calling conventionsPekka Enberg1-31/+31
2009-04-07nilfs2: B-tree based block mappingKoji Sato1-0/+2276