search for: bflag

..._tree, eb, parent_transid, 0)) break; @@ -385,6 +403,7 @@ static int btree_read_extent_buffer_pages(struct btrfs_root *root, * there is no reason to read the other copies, they won''t be * any less wrong. */ +bad: if (test_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags)) break; @@ -416,29 +435,55 @@ static int btree_read_extent_buffer_pages(struct btrfs_root *root, * checksum a dirty tree block before IO. This has extra checks to make sure * we only fill in the checksum field in the first page of a multi-page block */ - -static int csum_dirty_buffer...

.../btrfs/disk-io.c index fa8438f..f4628c7 100644 --- a/fs/btrfs/disk-io.c +++ b/fs/btrfs/disk-io.c @@ -674,10 +674,9 @@ static int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end, if (!ret) set_extent_buffer_uptodate(eb); err: - if (test_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags)) { - clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags); + if (reads_done && + test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags)) btree_readahead_hook(root, eb, eb->start, ret); - } if (ret) { /* -- 1.7.7.6 -- To unsubscribe from this list: send the l...

...lder-Mead", control = list(trace = as.numeric(verbose))) Within the optim function, there is a call to an external C function: .External2(C_optim, par, fn1, gr1, method, con, lower, upper) Where Par = (0.339, 0.339), fn1 = function (diagH) { H <- diag(diagH) %*% diag(diagH) if (default.bflag(d = d, n = n)) scvm <- scv.mat(x.star, H, Gs, binned = binned, verbose = FALSE, bin.par = bin.par.star, deriv.order = r) else scvm <- scv.mat(x.star, H, Gs, binned = binned, verbose = FALSE, deriv.order = r) return(scvm) }, gr1 is Null, method = "Nelder-Mead" con i...

...sample R code: # initializing a <- init_my_ptr(fname) # reading more data: error! df <- read_my_data(a) data structure in C: typedef struct { SEXP ans, ans_nms, R_z, R_a, R_b, R_c; FTYPE *datafile; char *fname; float *a, *b, *c; int f_type; float t, p, l; int st, na, result, bFlags; XXX z; } my_data_ptr; // In a C function initializing the external pointer: my_data_ptr *mydata = Calloc( 1, my_data_ptr ) ; SEXP Rdata; PROTECT(Rdata = R_MakeExternalPtr( mydata, R_fname, R_NilValue )); ... mydata->a = Calloc(mydata->na, float); // same for b and c // initializing names...

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and

This series introduces a generic readahead interface for btrfs trees. The intention is to use it to speed up scrub in a first run, but balance is another hot candidate. In general, every tree walk could be accompanied by a readahead. Deletion of large files comes to mind, where the fetching of the csums takes most of the time. Also the initial build-ups of free-space-caches and

...write_lock_level = 1; + } + + if (!cow) + write_lock_level = -1; + + min_write_lock_level = write_lock_level; +again: + level = btrfs_header_level(cached_eb); + if (level < write_lock_level || level < lowest_level) + return -ERESTART; + + if (test_bit(EXTENT_BUFFER_STALE, &cached_eb->bflags)) + return -ERESTART; + + extent_buffer_get(cached_eb); + + root_lock = 0; + if (!p->skip_locking) { + if (level <= write_lock_level) { + btrfs_tree_lock(cached_eb); + root_lock = BTRFS_WRITE_LOCK; + } else { + btrfs_tree_read_lock(cached_eb); + root_lock = BTRFS_READ_LOCK; + } +...

...reserved += len; + cache->space_info->bytes_may_use += len; } spin_unlock(&cache->lock); spin_unlock(&cache->space_info->lock); @@ -4683,27 +4715,8 @@ void btrfs_free_tree_block(struct btrfs_trans_handle *trans, WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)); btrfs_add_free_space(cache, buf->start, buf->len); - ret = btrfs_update_reserved_bytes(cache, buf->len, 0, 0); - if (ret == -EAGAIN) { - /* block group became read-only */ - btrfs_update_reserved_bytes(cache, buf->len, 0, 1); - goto out; - } - - ret = 1; - spin_lock(...

...reserved += len; + cache->space_info->bytes_may_use += len; } spin_unlock(&cache->lock); spin_unlock(&cache->space_info->lock); @@ -4683,27 +4714,8 @@ void btrfs_free_tree_block(struct btrfs_trans_handle *trans, WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)); btrfs_add_free_space(cache, buf->start, buf->len); - ret = btrfs_update_reserved_bytes(cache, buf->len, 0, 0); - if (ret == -EAGAIN) { - /* block group became read-only */ - btrfs_update_reserved_bytes(cache, buf->len, 0, 1); - goto out; - } - - ret = 1; - spin_lock(...

Hi all - The following 9 patches add more error handling to the btrfs code: - Add btrfs_panic - Catch locking failures in {set,clear}_extent_bit - Push up set_extent_bit errors to callers - Push up lock_extent errors to callers - Push up clear_extent_bit errors to callers - Push up unlock_extent errors to callers - Make pin_down_extent return void - Push up btrfs_pin_extent errors to

Hi all, I was intending on trying out gjournal on a new disk i've added in my desktop. I had a look to see what the most recent patch provided by Pawel and found http://people.freebsd.org/~pjd/patches/gjournal6_20061024.patch I created the directories as per Pawel's original post (http://lists.freebsd.org/pipermail/freebsd-fs/2006-June/001962.html) and the patch succeeded with no failed

Hi all - Here''s my current error handling patchset, against 3.1-rc8. Almost all of this patchset is preparing for actual error handling. Before we start in on that work, I''m trying to reduce the surface we need to worry about. It turns out that there is a ton of code that returns an error code but never actually reports an error. The patchset has grown to 65 patches. 46 of them