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