- 25 Sep, 2008 21 commits
-
-
Chris Mason authored
The multi-bio code is responsible for duplicating blocks in raid1 and single spindle duplication. It has counters to make sure all of the locations for a given extent are properly written before io completion is returned to the higher layers. But, it didn't always complete the same bio it was given, sometimes a clone was completed instead. This lead to problems with the async work queues because they saved a pointer to the bio in a struct off bi_private. The fix is to remember the original bio and only complete that one. Signed-off-by:Chris Mason <chris.mason@oracle.com>
-
Chris Mason authored
Btrfs has been using workqueues to spread the checksumming load across other CPUs in the system. But, workqueues only schedule work on the same CPU that queued the work, giving them a limited benefit for systems with higher CPU counts. This code adds a generic facility to schedule work with pools of kthreads, and changes the bio submission code to queue bios up. The queueing is important to make sure large numbers of procs on the system don't turn streaming workloads into random workloads by sending IO down concurrently. The end result of all of this is much higher performance (and CPU usage) when doing checksumming on large machines. Two worker pools are created, one for writes and one for endio processing. The two could deadlock if we tried to service both from a single pool. Signed-off-by: -
Chris Mason authored
Devices can change after the scan ioctls are done, and btrfs_open_devices needs to be able to verify them as they are opened and used by the FS. Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
This required a few structural changes to the code that manages bdev pointers: The VFS super block now gets an anon-bdev instead of a pointer to the lowest bdev. This allows us to avoid swapping the super block bdev pointer around at run time. The code to read in the super block no longer goes through the extent buffer interface. Things got ugly keeping the mapping constant. Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
This allows other code that needs to walk every device in the FS to do so without locking against allocations. Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Block headers now store the chunk tree uuid Chunk items records the device uuid for each stripes Device extent items record better back refs to the chunk tree Block groups record better back refs to the chunk tree The chunk tree format has also changed. The objectid of BTRFS_CHUNK_ITEM_KEY used to be the logical offset of the chunk. Now it is a chunk tree id, with the logical offset being stored in the offset field of the key. This allows a single chunk tree to record multiple logical address spaces, upping the number of bytes indexed by a chunk tree from 2^64 to 2^128. Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by: -
Chris Mason authored
Signed-off-by:
-
