)]}' { "log": [ { "commit": "6bef4d317193d3badbbfa3f3c593758ace84a629", "tree": "8aa9fcf3297c69033b9a9a83a27ecccaab0f9d7d", "parents": [ "3f6fae9559225741c91f1320090b285da1413290" ], "author": { "name": "Eric Paris", "email": "eparis@redhat.com", "time": "Tue Feb 23 19:43:04 2010 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Mon Mar 08 16:26:50 2010 -0500" }, "message": "Btrfs: use RB_ROOT to intialize rb_trees instead of setting rb_node to NULL\n\nbtrfs inialize rb trees in quite a number of places by settin rb_node \u003d\nNULL; The problem with this is that 17d9ddc72fb8bba0d4f678 in the\nlinux-next tree adds a new field to that struct which needs to be NULL for\nthe new rbtree library code to work properly. This patch uses RB_ROOT as\nthe intializer so all of the relevant fields will be NULL\u0027d. Without the\npatch I get a panic.\n\nSigned-off-by: Eric Paris \u003ceparis@redhat.com\u003e\nAcked-by: Venkatesh Pallipadi \u003cvenkatesh.pallipadi@intel.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "d7ce5843bb28ada6845ab2ae8510ba3f12d33154", "tree": "c7468abdcaa1d59d789af027984abfdc1bda5248", "parents": [ "014e4ac4f7d9c981750491fa40ea35efadc9ed49" ], "author": { "name": "Miao Xie", "email": "miaox@cn.fujitsu.com", "time": "Tue Feb 02 08:46:44 2010 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Feb 04 11:31:44 2010 -0500" }, "message": "Btrfs: remove BUG_ON() due to mounting bad filesystem\n\nMounting a bad filesystem caused a BUG_ON(). The following is steps to\nreproduce it.\n # mkfs.btrfs /dev/sda2\n # mount /dev/sda2 /mnt\n # mkfs.btrfs /dev/sda1 /dev/sda2\n (the program says that /dev/sda2 was mounted, and then exits. )\n # umount /mnt\n # mount /dev/sda1 /mnt\n\nAt the third step, mkfs.btrfs exited in the way of make filesystem. So the\ninitialization of the filesystem didn\u0027t finish. So the filesystem was bad, and\nit caused BUG_ON() when mounting it. But BUG_ON() should be called by the wrong\ncode, not user\u0027s operation, so I think it is a bug of btrfs.\n\nThis patch fixes it.\n\nSigned-off-by: Miao Xie \u003cmiaox@cn.fujitsu.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "2423fdfb96e3f9ff3baeb6c4c78d74145547891d", "tree": "a47f7712849dd9ab5c4a1c3371511e072abcdb29", "parents": [ "a038fab0cb873c75d6675e2bcffce8a3935bdce7" ], "author": { "name": "Jiri Slaby", "email": "jslaby@suse.cz", "time": "Wed Jan 06 16:57:22 2010 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Sun Jan 17 20:40:20 2010 -0500" }, "message": "Btrfs, fix memory leaks in error paths\n\nStanse found 2 memory leaks in relocate_block_group and\n__btrfs_map_block. cluster and multi are not freed/assigned on all\npaths. Fix that.\n\nSigned-off-by: Jiri Slaby \u003cjslaby@suse.cz\u003e\nCc: linux-btrfs@vger.kernel.org\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "24bbcf0442ee04660a5a030efdbb6d03f1c275cb", "tree": "aa57d77d29cc5150b272cc3f6465f10262fcbaac", "parents": [ "f34f57a3ab4e73304d78c125682f1a53cd3975f2" ], "author": { "name": "Yan, Zheng", "email": "zheng.yan@oracle.com", "time": "Thu Nov 12 09:36:34 2009 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Dec 17 12:33:35 2009 -0500" }, "message": "Btrfs: Add delayed iput\n\niput() can trigger new transactions if we are dropping the\nfinal reference, so calling it in btrfs_commit_transaction\nmay end up deadlock. This patch adds delayed iput to avoid\nthe issue.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "8082510e7124cc50d728f1b875639cb4e22312cc", "tree": "e9f0a0a4504a87689b4765368b508fff5ae2ddf8", "parents": [ "5a303d5d4b8055d2e5a03e92d04745bfc5881a22" ], "author": { "name": "Yan, Zheng", "email": "zheng.yan@oracle.com", "time": "Thu Nov 12 09:35:36 2009 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Dec 17 12:33:34 2009 -0500" }, "message": "Btrfs: Make truncate(2) more ENOSPC friendly\n\ntruncating and deleting regular files are unbound operations,\nso it\u0027s not good to do them in a single transaction. This\npatch makes btrfs_truncate and btrfs_delete_inode start a\nnew transaction after all items in a tree leaf are deleted.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "c71bf099abddf3e0fdc27f251ba76fca1461d49a", "tree": "0b682ad2b49aeaf9ac774c40be4b7549c1d079fe", "parents": [ "c216775458a2ee345d9412a2770c2916acfb5d30" ], "author": { "name": "Yan, Zheng", "email": "zheng.yan@oracle.com", "time": "Thu Nov 12 09:34:40 2009 +0000" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Dec 17 12:33:33 2009 -0500" }, "message": "Btrfs: Avoid orphan inodes cleanup while replaying log\n\nWe do log replay in a single transaction, so it\u0027s not good to do unbound\noperations. This patch cleans up orphan inodes cleanup after replaying\nthe log. It also avoids doing other unbound operations such as truncating\na file during replaying log. These unbound operations are postponed to\nthe orphan inode cleanup stage.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "61d92c328c16419fc96dc50dd16f8b8c695409ec", "tree": "e9cd82eb56ff5f38f64d9f35229d15496e5d53de", "parents": [ "fbf190874407f23d2891b53ffdf7d3c6be8d47ff" ], "author": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Fri Oct 02 19:11:56 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Mon Oct 05 09:44:45 2009 -0400" }, "message": "Btrfs: fix deadlock on async thread startup\n\nThe btrfs async worker threads are used for a wide variety of things,\nincluding processing bio end_io functions. This means that when\nthe endio threads aren\u0027t running, the rest of the FS isn\u0027t\nable to do the final processing required to clear PageWriteback.\n\nThe endio threads also try to exit as they become idle and\nstart more as the work piles up. The problem is that starting more\nthreads means kthreadd may need to allocate ram, and that allocation\nmay wait until the global number of writeback pages on the system is\nbelow a certain limit.\n\nThe result of that throttling is that end IO threads wait on\nkthreadd, who is waiting on IO to end, which will never happen.\n\nThis commit fixes the deadlock by handing off thread startup to a\ndedicated thread. It also fixes a bug where the on-demand thread\ncreation was creating far too many threads because it didn\u0027t take into\naccount threads being started by other procs.\n\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "0257bb82d21bedff26541bcf12f1461c23f9ed61", "tree": "0b79fd9bf377094f6fa6f5f923fe192515672af3", "parents": [ "f679a84034be6f7da123be786bbd8838bf3e9207" ], "author": { "name": "Yan, Zheng", "email": "zheng.yan@oracle.com", "time": "Thu Sep 24 09:17:31 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Sep 24 09:17:31 2009 -0400" }, "message": "Btrfs: relocate file extents in clusters\n\nThe extent relocation code copy file extents one by one when\nrelocating data block group. This is inefficient if file\nextents are small. This patch makes the relocation code copy\nfile extents in clusters. So we can can make better use of\nread-ahead.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "76dda93c6ae2c1dc3e6cde34569d6aca26b0c918", "tree": "f5ca46ec89d4ae2c762952d5f35e2c6f95ac046a", "parents": [ "4df27c4d5cc1dda54ed7d0a8389347f2df359cf9" ], "author": { "name": "Yan, Zheng", "email": "zheng.yan@oracle.com", "time": "Mon Sep 21 16:00:26 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Mon Sep 21 16:00:26 2009 -0400" }, "message": "Btrfs: add snapshot/subvolume destroy ioctl\n\nThis patch adds snapshot/subvolume destroy ioctl. A subvolume that isn\u0027t being\nused and doesn\u0027t contains links to other subvolumes can be destroyed.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "9655d2982b53fdb38a9e0f2f11315b99b92d66e2", "tree": "e1271f2f2a3c2c356e0692b36a2d4742b5d651d8", "parents": [ "d5550c6315fe0647b7ac21a6a736bf4a42620eac" ], "author": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Wed Sep 02 15:22:30 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Fri Sep 11 13:31:07 2009 -0400" }, "message": "Btrfs: use a cached state for extent state operations during delalloc\n\nThis changes the btrfs code to find delalloc ranges in the extent state\ntree to use the new state caching code from set/test bit. It reduces\none of the biggest causes of rbtree searches in the writeback path.\n\ntest_range_bit is also modified to take the cached state as a starting\npoint while searching.\n\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "890871be854b5f5e43e7ba2475f706209906cc24", "tree": "9d087adf7a28bb910992d07d93ea2a992e394110", "parents": [ "57fd5a5ff8b48b99e90b22fc143082aba755c6c0" ], "author": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Wed Sep 02 16:24:52 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Fri Sep 11 13:31:05 2009 -0400" }, "message": "Btrfs: switch extent_map to a rw lock\n\nThere are two main users of the extent_map tree. The\nfirst is regular file inodes, where it is evenly spread\nbetween readers and writers.\n\nThe second is the chunk allocation tree, which maps blocks from\nlogical addresses to phyiscal ones, and it is 99.99% reads.\n\nThe mapping tree is a point of lock contention during heavy IO\nworkloads, so this commit switches things to a rw lock.\n\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "ceab36edd3d3ad3ffd01d41d6d1e05ac1ff8357e", "tree": "a6d899030878d52ae6d7932e459deece3524c787", "parents": [ "60f2e8f8a07331097a57ec4abcdc680405579377" ], "author": { "name": "Yan Zheng", "email": "zheng.yan@oracle.com", "time": "Fri Aug 07 13:51:33 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Fri Aug 07 13:51:33 2009 -0400" }, "message": "Btrfs: fix balancing oops when invalidate_inode_pages2 returns EBUSY\n\ninvalidate_inode_pages2_range may return -EBUSY occasionally\nwhich results Oops. This patch fixes the issue by moving\ninvalidate_inode_pages2_range into a loop and keeping calling\nit until the return value is not -EBUSY.\n\nThe EBUSY return is temporary, and can happen when the btrfs release page\nfunction is unable to release a page because the EXTENT_LOCK\nbit is set.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "33c66f430bfa3a033e70470e4c93f967156b696d", "tree": "5af7edc4564aa3f32033b364495828eb32b690a7", "parents": [ "e457afec60fdbd86b963d36f4a8a9285088c6043" ], "author": { "name": "Yan Zheng", "email": "zheng.yan@oracle.com", "time": "Wed Jul 22 09:59:00 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Wed Jul 22 09:59:00 2009 -0400" }, "message": "Btrfs: fix locking issue in btrfs_find_next_key\n\nWhen walking up the tree, btrfs_find_next_key assumes the upper level tree\nblock is properly locked. This isn\u0027t always true even path-\u003ekeep_locks is 1.\nThis is because btrfs_find_next_key may advance path-\u003eslots[] several times\ninstead of only once.\n\nWhen \u0027path-\u003eslots[level] \u003e\u003d btrfs_header_nritems(path-\u003enodes[level])\u0027 is found,\nwe can\u0027t guarantee the original value of \u0027path-\u003eslots[level]\u0027 is\n\u0027btrfs_header_nritems(path-\u003enodes[level]) - 1\u0027. If it\u0027s not, the tree block at\n\u0027level + 1\u0027 isn\u0027t locked.\n\nThis patch fixes the issue by explicitly checking the locking state,\nre-searching the tree if it\u0027s not locked.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "2c47e605a91dde6b0514f689645e7ab336c8592a", "tree": "d541e61440f06f37d17e2d14cbaa78fc0cd41ff2", "parents": [ "a970b0a16cc416a509d5ae8b1d70978664e6f4fe" ], "author": { "name": "Yan Zheng", "email": "zheng.yan@oracle.com", "time": "Sat Jun 27 21:07:35 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Thu Jul 02 13:41:17 2009 -0400" }, "message": "Btrfs: update backrefs while dropping snapshot\n\nThe new backref format has restriction on type of backref item. If a tree\nblock isn\u0027t referenced by its owner tree, full backrefs must be used for the\npointers in it. When a tree block loses its owner tree\u0027s reference, backrefs\nfor the pointers in it should be updated to full backrefs. Current\nbtrfs_drop_snapshot misses the code that updates backrefs, so it\u0027s unsafe for\ngeneral use.\n\nThis patch adds backrefs update code to btrfs_drop_snapshot. It isn\u0027t a\nproblem in the restricted form btrfs_drop_snapshot is used today, but for\ngeneral snapshot deletion this update is required.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" }, { "commit": "5d4f98a28c7d334091c1b7744f48a1acdd2a4ae0", "tree": "c611d7d824cbcdb777dd2d8e33e2ed1c5df8a9c6", "parents": [ "5c939df56c3ea018b58e5aa76181284c2053d699" ], "author": { "name": "Yan Zheng", "email": "zheng.yan@oracle.com", "time": "Wed Jun 10 10:45:14 2009 -0400" }, "committer": { "name": "Chris Mason", "email": "chris.mason@oracle.com", "time": "Wed Jun 10 11:29:46 2009 -0400" }, "message": "Btrfs: Mixed back reference (FORWARD ROLLING FORMAT CHANGE)\n\nThis commit introduces a new kind of back reference for btrfs metadata.\nOnce a filesystem has been mounted with this commit, IT WILL NO LONGER\nBE MOUNTABLE BY OLDER KERNELS.\n\nWhen a tree block in subvolume tree is cow\u0027d, the reference counts of all\nextents it points to are increased by one. At transaction commit time,\nthe old root of the subvolume is recorded in a \"dead root\" data structure,\nand the btree it points to is later walked, dropping reference counts\nand freeing any blocks where the reference count goes to 0.\n\nThe increments done during cow and decrements done after commit cancel out,\nand the walk is a very expensive way to go about freeing the blocks that\nare no longer referenced by the new btree root. This commit reduces the\ntransaction overhead by avoiding the need for dead root records.\n\nWhen a non-shared tree block is cow\u0027d, we free the old block at once, and the\nnew block inherits old block\u0027s references. When a tree block with reference\ncount \u003e 1 is cow\u0027d, we increase the reference counts of all extents\nthe new block points to by one, and decrease the old block\u0027s reference count by\none.\n\nThis dead tree avoidance code removes the need to modify the reference\ncounts of lower level extents when a non-shared tree block is cow\u0027d.\nBut we still need to update back ref for all pointers in the block.\nThis is because the location of the block is recorded in the back ref\nitem.\n\nWe can solve this by introducing a new type of back ref. The new\nback ref provides information about pointer\u0027s key, level and in which\ntree the pointer lives. This information allow us to find the pointer\nby searching the tree. The shortcoming of the new back ref is that it\nonly works for pointers in tree blocks referenced by their owner trees.\n\nThis is mostly a problem for snapshots, where resolving one of these\nfuzzy back references would be O(number_of_snapshots) and quite slow.\nThe solution used here is to use the fuzzy back references in the common\ncase where a given tree block is only referenced by one root,\nand use the full back references when multiple roots have a reference\non a given block.\n\nThis commit adds per subvolume red-black tree to keep trace of cached\ninodes. The red-black tree helps the balancing code to find cached\ninodes whose inode numbers within a given range.\n\nThis commit improves the balancing code by introducing several data\nstructures to keep the state of balancing. The most important one\nis the back ref cache. It caches how the upper level tree blocks are\nreferenced. This greatly reduce the overhead of checking back ref.\n\nThe improved balancing code scales significantly better with a large\nnumber of snapshots.\n\nThis is a very large commit and was written in a number of\npieces. But, they depend heavily on the disk format change and were\nsquashed together to make sure git bisect didn\u0027t end up in a\nbad state wrt space balancing or the format change.\n\nSigned-off-by: Yan Zheng \u003czheng.yan@oracle.com\u003e\nSigned-off-by: Chris Mason \u003cchris.mason@oracle.com\u003e\n" } ] }