search for: head_ref

...> #include <stdlib.h> // A linked list node struct Node { int data; struct Node* next; struct Node* prev; }; struct Node* head; /* Given a reference (pointer to pointer) to the head of a list and an int, inserts a new node on the front of the list. */ void push(struct Node** head_ref, int new_data) { struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = (*head_ref); new_node->prev = NULL; if ((*head_ref) != NULL) (*head_ref)->prev = new_node; (*head_ref) = new_node; } // T...

...; >> >> }; >> >> >> >> *struct Node* head;* >> >> >> >> /* Given a reference (pointer to pointer) to the head of a list >> >> and an int, inserts a new node on the front of the list. */ >> >> void push(struct Node** head_ref, int new_data) >> >> { >> >> struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); >> >> >> >> new_node->data = new_data; >> >> >> >> new_node->next = (*head_ref); >> >> new_node-&...

...> #include <stdlib.h> // A linked list node struct Node { int data; struct Node* next; struct Node* prev; }; struct Node* head; /* Given a reference (pointer to pointer) to the head of a list and an int, inserts a new node on the front of the list. */ void push(struct Node** head_ref, int new_data) { struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = (*head_ref); new_node->prev = NULL; if ((*head_ref) != NULL) (*head_ref)->prev = new_node; (*head_ref) = new_node; } // T...

...> #include <stdlib.h> // A linked list node struct Node { int data; struct Node* next; struct Node* prev; }; struct Node* head; /* Given a reference (pointer to pointer) to the head of a list and an int, inserts a new node on the front of the list. */ void push(struct Node** head_ref, int new_data) { struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = (*head_ref); new_node->prev = NULL; if ((*head_ref) != NULL) (*head_ref)->prev = new_node; (*head_ref) = new_node; } // T...

...; >> >> }; >> >> >> >> *struct Node* head;* >> >> >> >> /* Given a reference (pointer to pointer) to the head of a list >> >> and an int, inserts a new node on the front of the list. */ >> >> void push(struct Node** head_ref, int new_data) >> >> { >> >> struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); >> >> >> >> new_node->data = new_data; >> >> >> >> new_node->next = (*head_ref); >> >> new_node-&...

...ine int add_ra_bio_pages(struct inode *inode, next: last_offset += PAGE_CACHE_SIZE; } - return 0; } /* diff --git a/fs/btrfs/delayed-ref.c b/fs/btrfs/delayed-ref.c index 125cf76..0aae23c 100644 --- a/fs/btrfs/delayed-ref.c +++ b/fs/btrfs/delayed-ref.c @@ -390,10 +390,10 @@ update_existing_head_ref(struct btrfs_delayed_ref_node *existing, * this does all the dirty work in terms of maintaining the correct * overall modification count. */ -static noinline int add_delayed_ref_head(struct btrfs_trans_handle *trans, - struct btrfs_delayed_ref_node *ref, - u64 bytenr, u64 num_bytes, -...

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

This is a first draft of a subvolume quota implementation. It is possible to limit subvolumes and any group of subvolumes and also to track the amount of space that will get freed when deleting snapshots. The current version is functionally incomplete, with the main missing feature being the initial scan and rescan of an existing filesystem. I put some effort into writing an introduction into

...path, make sure diff --git a/fs/btrfs/delayed-ref.c b/fs/btrfs/delayed-ref.c index e807b14..ee1cf82 100644 --- a/fs/btrfs/delayed-ref.c +++ b/fs/btrfs/delayed-ref.c @@ -644,11 +644,11 @@ int btrfs_add_delayed_tree_ref(struct btrfs_trans_handle *trans, */ ret = add_delayed_ref_head(trans, &head_ref->node, bytenr, num_bytes, action, 0); - BUG_ON(ret); + btrfs_fixable_bug_on(ret); ret = add_delayed_tree_ref(trans, &ref->node, bytenr, num_bytes, parent, ref_root, level, action); - BUG_ON(ret); + btrfs_fixable_bug_on(ret); spin_unlock(&delayed_refs->lock);...