index
:
litmus-rt.git
archive/unc-master-3.0
archived-2013.1
archived-private-master
archived-semi-part
demo
ecrts-pgm-final
ecrts14-pgm-final
gpusync-rtss12
gpusync/staging
linux-tip
litmus2008-patch-series
master
pgm
prop/litmus-signals
prop/robust-tie-break
staging
test
tracing-devel
v2.6.34-with-arm-patches
v2015.1
wip-2011.2-bbb
wip-2011.2-bbb-trace
wip-2012.3-gpu
wip-2012.3-gpu-preport
wip-2012.3-gpu-rtss13
wip-2012.3-gpu-sobliv-budget-w-kshark
wip-aedzl-final
wip-aedzl-revised
wip-arbit-deadline
wip-aux-tasks
wip-bbb
wip-bbb-prio-don
wip-better-break
wip-binary-heap
wip-budget
wip-color
wip-color-jlh
wip-d10-hz1000
wip-default-clustering
wip-dissipation-jerickso
wip-dissipation2-jerickso
wip-ecrts14-pgm
wip-edf-hsb
wip-edf-os
wip-edf-tie-break
wip-edzl-critique
wip-edzl-final
wip-edzl-revised
wip-events
wip-extra-debug
wip-fix-switch-jerickso
wip-fix3
wip-fmlp-dequeue
wip-ft-irq-flag
wip-gpu-cleanup
wip-gpu-interrupts
wip-gpu-rtas12
wip-gpu-rtss12
wip-gpu-rtss12-srp
wip-gpusync-merge
wip-ikglp
wip-k-fmlp
wip-kernel-coloring
wip-kernthreads
wip-klmirqd-to-aux
wip-kshark
wip-litmus-3.2
wip-litmus2011.2
wip-litmus3.0-2011.2
wip-master-2.6.33-rt
wip-mc
wip-mc-bipasa
wip-mc-jerickso
wip-mc2-cache-slack
wip-mcrit-mac
wip-merge-3.0
wip-merge-v3.0
wip-migration-affinity
wip-mmap-uncache
wip-modechange
wip-nested-locking
wip-omlp-gedf
wip-pai
wip-percore-lib
wip-performance
wip-pgm
wip-pgm-split
wip-pm-ovd
wip-prio-inh
wip-prioq-dgl
wip-refactored-gedf
wip-release-master-fix
wip-robust-tie-break
wip-rt-kshark
wip-rtas12-pgm
wip-semi-part
wip-semi-part-edfos-jerickso
wip-shared-lib
wip-shared-lib2
wip-shared-mem
wip-splitting-jerickso
wip-splitting-omlp-jerickso
wip-stage-binheap
wip-sun-port
wip-timer-trace
wip-tracepoints
The LITMUS^RT kernel.
Bjoern Brandenburg
about
summary
refs
log
tree
commit
diff
stats
log msg
author
committer
range
path:
root
/
fs
/
nilfs2
/
btree.c
Commit message (
Expand
)
Author
Age
*
nilfs2: record used amount of each checkpoint in checkpoint list
Ryusuke Konishi
2011-03-08
*
nilfs2: apply read-ahead for nilfs_btree_lookup_contig
Ryusuke Konishi
2010-07-22
*
nilfs2: introduce check flag to btree node buffer
Ryusuke Konishi
2010-07-22
*
nilfs2: add btree get block function with readahead option
Ryusuke Konishi
2010-07-22
*
nilfs2: add read ahead mode to nilfs_btnode_submit_block
Ryusuke Konishi
2010-07-22
*
nilfs2: eliminate inline keywords in btree implementation
Ryusuke Konishi
2010-07-22
*
nilfs2: get maximum number of child nodes from bmap object
Ryusuke Konishi
2010-07-22
*
nilfs2: reduce repetitive calculation of max number of child nodes
Ryusuke Konishi
2010-07-22
*
nilfs2: optimize calculation of min/max number of btree node children
Ryusuke Konishi
2010-07-22
*
nilfs2: remove redundant pointer checks in bmap lookup functions
Ryusuke Konishi
2010-07-22
*
nilfs2: unify bmap set_target_v operations
Ryusuke Konishi
2010-07-22
*
nilfs2: get rid of nilfs_btree uses
Ryusuke Konishi
2010-07-22
*
nilfs2: remove constant qualifier from argument of bmap propagate
Ryusuke Konishi
2010-07-22
*
nilfs2: get rid of private conversion macros on bmap key and pointer
Ryusuke Konishi
2010-07-22
*
nilfs2: verify btree node after reading
Ryusuke Konishi
2010-07-22
*
nilfs2: add sanity check in nilfs_btree_add_dirty_buffer
Ryusuke Konishi
2010-07-22
*
nilfs2: cleanup multi kmem_cache_{create,destroy} code
Li Hong
2010-05-09
*
nilfs2: Combine nilfs_btree_release_path() and nilfs_btree_free_path()
Li Hong
2010-05-09
*
nilfs2: Combine nilfs_btree_alloc_path() and nilfs_btree_init_path()
Li Hong
2010-05-09
*
nilfs2: Remove an uninitialization warning in nilfs_btree_propagate_v()
Li Hong
2010-04-02
*
nilfs2: use list_splice_tail or list_splice_tail_init
Ryusuke Konishi
2009-11-28
*
nilfs2: eliminate nilfs_btnode_get function
Ryusuke Konishi
2009-11-19
*
nilfs2: use nilfs_btnode_create_block function
Ryusuke Konishi
2009-11-19
*
nilfs2: remove buffer locking from btree code
Ryusuke Konishi
2009-11-19
*
nilfs2: get rid of BUG_ON use in btree lookup routines
Ryusuke Konishi
2009-11-19
*
nilfs2: allow btree code to directly call dat operations
Ryusuke Konishi
2009-09-14
*
nilfs2: stop zero-fill of btree path just before free it
Ryusuke Konishi
2009-09-14
*
nilfs2: remove unused btree argument from btree functions
Ryusuke Konishi
2009-09-14
*
nilfs2: support contiguous lookup of blocks
Ryusuke Konishi
2009-06-10
*
nilfs2: remove nilfs_btree_operations from btree mapping
Ryusuke Konishi
2009-06-10
*
nilfs2: remove bmap pointer operations
Ryusuke Konishi
2009-06-10
*
nilfs2: remove useless b_low and b_high fields from nilfs_bmap struct
Ryusuke Konishi
2009-06-10
*
nilfs2: remove pointless NULL check of bpop_commit_alloc_ptr function
Ryusuke Konishi
2009-06-10
*
nilfs2: move get block functions in bmap.c into btree codes
Ryusuke Konishi
2009-06-10
*
nilfs2: remove nilfs_bmap_delete_block
Ryusuke Konishi
2009-06-10
*
nilfs2: remove nilfs_bmap_put_block
Ryusuke Konishi
2009-06-10
*
nilfs2: unify bmap operations starting use of indirect block address
Ryusuke Konishi
2009-06-10
*
nilfs2: replace BUG_ON and BUG calls triggerable from ioctl
Ryusuke Konishi
2009-04-07
*
nilfs2: clean up indirect function calling conventions
Pekka Enberg
2009-04-07
*
nilfs2: B-tree based block mapping
Koji Sato
2009-04-07