search for: next_node

...com> --- fs/btrfs/extent_io.c | 3 +-- 1 files changed, 1 insertions(+), 2 deletions(-) diff --git a/fs/btrfs/extent_io.c b/fs/btrfs/extent_io.c index fcf77e1..e941cc4 100644 --- a/fs/btrfs/extent_io.c +++ b/fs/btrfs/extent_io.c @@ -577,8 +577,7 @@ hit_next: if (start <= end && next_node) { state = rb_entry(next_node, struct extent_state, rb_node); - if (state->start == start) - goto hit_next; + goto hit_next; } goto search_again; -- 1.6.5.2 -- To unsubscribe from this list: send the line "unsubscribe linux-btrfs" in the body of a message to majord...

...used_lock); + spin_unlock_irqrestore(&mm->unused_lock, flags); return 0; } EXPORT_SYMBOL(drm_mm_pre_get); @@ -277,6 +279,7 @@ void drm_mm_put_block(struct drm_mm_node *cur) struct list_head *root_head = &mm->ml_entry; struct drm_mm_node *prev_node = NULL; struct drm_mm_node *next_node; + unsigned long flags; int merged = 0; @@ -296,14 +299,14 @@ void drm_mm_put_block(struct drm_mm_node *cur) prev_node->size += next_node->size; list_del(&next_node->ml_entry); list_del(&next_node->fl_entry); - spin_lock(&mm->unused_lock); + spi...

...D_CHILDREN(s); in the following section from src/main/memory.c #ifndef EXPEL_OLD_TO_NEW /* scan nodes in uncollected old generations with old-to-new pointers */ for (gen = num_old_gens_to_collect; gen < NUM_OLD_GENERATIONS; gen++) for (i = 0; i < NUM_NODE_CLASSES; i++) for (s = NEXT_NODE(R_GenHeap[i].OldToNew[gen]); s != R_GenHeap[i].OldToNew[gen]; s = NEXT_NODE(s)) FORWARD_CHILDREN(s); #endif I'm using > version _ platform sparc-sun-solaris2.6 arch sparc os solaris2.6 system sparc, solaris2.6 status Patched major 1 minor 2.1 year 2...

...} if ((node->flags & MAILBOX_LIST_INDEX_FLAG_NONEXISTENT) != 0) ctx->info.flags |= MAILBOX_NONEXISTENT; @@ -126,6 +131,14 @@ mailbox_list_index_update_next(struct mailbox_list_index_iterate_context *ctx, { struct mailbox_list_index_node *node = ctx->next_node; + if (!ctx->prefix_inbox_list && ctx->ctx.list->ns->prefix_len > 0 && + strcmp(node->name, "INBOX") == 0 && node->parent == NULL && + node->children != NULL) { + /* prefix/INBOX has children...

...gt;flags & MAILBOX_LIST_INDEX_FLAG_NONEXISTENT) != 0) > ctx->info.flags |= MAILBOX_NONEXISTENT; > @@ -126,6 +131,14 @@ mailbox_list_index_update_next(struct > mailbox_list_index_iterate_context *ctx, > { > struct mailbox_list_index_node *node = ctx->next_node; > > + if (!ctx->prefix_inbox_list && ctx->ctx.list->ns->prefix_len > 0 > && > + strcmp(node->name, "INBOX") == 0 && node->parent == NULL && > + node->children != NULL) { > +...

...(argConverters[nargs]) { > 1864 PROTECT(s = CPtrToRObj(cargs[nargs], > CAR(pargs), > which)); > > Program received signal SIGSEGV, Segmentation fault. > 0x080ddc6a in RunGenCollect (size_needed=1515400) at memory.c:1133 > 1133 SEXP next = NEXT_NODE(s); > > This is obtained on Linux (Mandrake 8.2 w/enterprise kernel > 2.4.8) running > on dual P3-866 Xeon with 2GB RAM, using R-1.5.0 compiled from source. > > Any help/hints/comments are greatly appreciated! > > Regards, > Andy > > Andy I. Liaw, PhD > Biom...

...CDR(pargs)) { 1855 if(argConverters[nargs]) { 1864 PROTECT(s = CPtrToRObj(cargs[nargs], CAR(pargs), which)); Program received signal SIGSEGV, Segmentation fault. 0x080ddc6a in RunGenCollect (size_needed=1515400) at memory.c:1133 1133 SEXP next = NEXT_NODE(s); This is obtained on Linux (Mandrake 8.2 w/enterprise kernel 2.4.8) running on dual P3-866 Xeon with 2GB RAM, using R-1.5.0 compiled from source. Any help/hints/comments are greatly appreciated! Regards, Andy Andy I. Liaw, PhD Biometrics Research Phone: (732) 594-0820 Merck & Co...

...CDR(pargs)) { 1855 if(argConverters[nargs]) { 1864 PROTECT(s = CPtrToRObj(cargs[nargs], CAR(pargs), which)); Program received signal SIGSEGV, Segmentation fault. 0x080ddc6a in RunGenCollect (size_needed=1515400) at memory.c:1133 1133 SEXP next = NEXT_NODE(s); This is obtained on Linux (Mandrake 8.2 w/enterprise kernel 2.4.8) running on dual P3-866 Xeon with 2GB RAM, using R-1.5.0 compiled from source. Any help/hints/comments are greatly appreciated! Regards, Andy Andy I. Liaw, PhD Biometrics Research Phone: (732) 594-0820 Merck & Co...

...</div> <div> @@ -126,6 +131,14 @@ mailbox_list_index_update_next(struct mailbox_list_index_iterate_context *ctx, </div> <div> { </div> <div> struct mailbox_list_index_node *node = ctx->next_node; </div> <div> <br> </div> <div> + if (!ctx->prefix_inbox_list && ctx->ctx.list->ns->prefix_len > 0 && </div> <div> + strcmp(node->name, &quot...

Just hoping to get some dev eyes on this. I'm incredibly reluctant to throw the word 'bug' around (since 99 times out of 100, it's not -- it's almost always the config), but I can't think of any way that this could be a config issue, esp when the pre-2.2.34 version works as expected. I noticed during troubleshooting that dovecot errors out if I try to create a subfolder

...- * > - * Lazy destroys the notifier from a work item > - */ > -static void amdgpu_mn_destroy(struct work_struct *work) > -{ > - struct amdgpu_mn *amn = container_of(work, struct amdgpu_mn, work); > - struct amdgpu_device *adev = amn->adev; > - struct amdgpu_mn_node *node, *next_node; > - struct amdgpu_bo *bo, *next_bo; > - > - mutex_lock(&adev->mn_lock); > - down_write(&amn->lock); > - hash_del(&amn->node); > - rbtree_postorder_for_each_entry_safe(node, next_node, > - &amn->objects.rb_root, it.rb) { > - list_for_eac...

...- * > - * Lazy destroys the notifier from a work item > - */ > -static void amdgpu_mn_destroy(struct work_struct *work) > -{ > - struct amdgpu_mn *amn = container_of(work, struct amdgpu_mn, work); > - struct amdgpu_device *adev = amn->adev; > - struct amdgpu_mn_node *node, *next_node; > - struct amdgpu_bo *bo, *next_bo; > - > - mutex_lock(&adev->mn_lock); > - down_write(&amn->lock); > - hash_del(&amn->node); > - rbtree_postorder_for_each_entry_safe(node, next_node, > - &amn->objects.rb_root, it.rb) { > - list_for_eac...

...work: previously sheduled work item - * - * Lazy destroys the notifier from a work item - */ -static void amdgpu_mn_destroy(struct work_struct *work) -{ - struct amdgpu_mn *amn = container_of(work, struct amdgpu_mn, work); - struct amdgpu_device *adev = amn->adev; - struct amdgpu_mn_node *node, *next_node; - struct amdgpu_bo *bo, *next_bo; - - mutex_lock(&adev->mn_lock); - down_write(&amn->lock); - hash_del(&amn->node); - rbtree_postorder_for_each_entry_safe(node, next_node, - &amn->objects.rb_root, it.rb) { - list_for_each_entry_safe(bo, next_bo, &node->...

...se); > (gdb) So CLASS_GET_FREE_NODE is #defined in memory.c as: > #define CLASS_GET_FREE_NODE(c,s) do { \ > SEXP __n__ = R_GenHeap[c].Free; \ > if (__n__ == R_GenHeap[c].New) { \ > GetNewPage(c); \ > __n__ = R_GenHeap[c].Free; \ > } \ > R_GenHeap[c].Free = NEXT_NODE(__n__); \ > R_NodesInUse++; \ > (s) = __n__; \ > } while (0) and we here have a call to GetNewPage. > yziquel at seldon:~/git/ocaml-finquote$ gdb -silent -d /home/yziquel/src/r-base-2.10.1/src/main/ _build/test/test.native > Reading symbols from /home/yziquel/git/ocaml-finquote...

...> 1864 PROTECT(s = > CPtrToRObj(cargs[nargs], CAR(pargs), > > which)); > > > > Program received signal SIGSEGV, Segmentation fault. > > 0x080ddc6a in RunGenCollect (size_needed=1515400) at memory.c:1133 > > 1133 SEXP next = NEXT_NODE(s); > > > > This is obtained on Linux (Mandrake 8.2 w/enterprise kernel > 2.4.8) running > > on dual P3-866 Xeon with 2GB RAM, using R-1.5.0 compiled > from source. > > > > Any help/hints/comments are greatly appreciated! > > > > Regards, > >...

...ark ZwLoadKey2 export as private. ole32: Call GetClipboardFormatName with the correct parameters. server: Fix handling of MAXIMUM_ALLOWED in token_access_check. Vincent Povirk (4): hhctrl.ocx: Also take basename of folders when searching. hhctrl.ocx: Don't skip a tag in next_node. kernel32: DETACHED_PROCESS prevents automatic std handle inheritance. kernel32: DETACHED_PROCESS doesn't affect STARTUPINFO console handles. Young Chung (1): ucrtbase: Add __conio_common_vcprintf()/_vcwprintf(). Zebediah Figura (12): ws2_32/tests: Fix memcmp size in t...

From: Jason Gunthorpe <jgg at mellanox.com> 8 of the mmu_notifier using drivers (i915_gem, radeon_mn, umem_odp, hfi1, scif_dma, vhost, gntdev, hmm) drivers are using a common pattern where they only use invalidate_range_start/end and immediately check the invalidating range against some driver data structure to tell if the driver is interested. Half of them use an interval_tree, the others

...); btrfs_release_path(root, path); btrfs_i_size_write(dir, dir->i_size - name_len * 2); dir->i_mtime = dir->i_ctime = CURRENT_TIME; ret = btrfs_update_inode(trans, root, dir); - BUG_ON(ret); + btrfs_fixable_bug_on(ret); btrfs_free_path(path); return 0; @@ -3118,7 +3118,7 @@ next_node: * csum items from this inode at an offset >= new_size */ ret = btrfs_del_leaf(trans, root, path, leaf_start); - BUG_ON(ret); + btrfs_fixable_bug_on(ret); if (root->ref_cows && leaf_gen < trans->transid) { ref = btrfs_alloc_leaf_ref(root, 0); @@ -3321,7 +3321,7 @@...

From: Jason Gunthorpe <jgg at mellanox.com> 8 of the mmu_notifier using drivers (i915_gem, radeon_mn, umem_odp, hfi1, scif_dma, vhost, gntdev, hmm) drivers are using a common pattern where they only use invalidate_range_start/end and immediately check the invalidating range against some driver data structure to tell if the driver is interested. Half of them use an interval_tree, the others