+++ /dev/null
-/* Copyright (c) Mark Harmstone 2016-17
- *
- * This file is part of WinBtrfs.
- *
- * WinBtrfs is free software: you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public Licence as published by
- * the Free Software Foundation, either version 3 of the Licence, or
- * (at your option) any later version.
- *
- * WinBtrfs is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU Lesser General Public Licence for more details.
- *
- * You should have received a copy of the GNU Lesser General Public Licence
- * along with WinBtrfs. If not, see <http://www.gnu.org/licenses/>. */
-
-#include "btrfs_drv.h"
-
-NTSTATUS load_tree(device_extension* Vcb, UINT64 addr, root* r, tree** pt, UINT64 generation, PIRP Irp) {
- UINT8* buf;
- NTSTATUS Status;
- tree_header* th;
- tree* t;
- tree_data* td;
- chunk* c;
- UINT8 h;
- BOOL inserted;
- LIST_ENTRY* le;
-
- buf = ExAllocatePoolWithTag(PagedPool, Vcb->superblock.node_size, ALLOC_TAG);
- if (!buf) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- Status = read_data(Vcb, addr, Vcb->superblock.node_size, NULL, TRUE, buf, NULL, &c, Irp, generation, FALSE, NormalPagePriority);
- if (!NT_SUCCESS(Status)) {
- ERR("read_data returned 0x%08x\n", Status);
- ExFreePool(buf);
- return Status;
- }
-
- th = (tree_header*)buf;
-
- t = ExAllocatePoolWithTag(PagedPool, sizeof(tree), ALLOC_TAG);
- if (!t) {
- ERR("out of memory\n");
- ExFreePool(buf);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- RtlCopyMemory(&t->header, th, sizeof(tree_header));
- t->hash = calc_crc32c(0xffffffff, (UINT8*)&addr, sizeof(UINT64));
- t->has_address = TRUE;
- t->Vcb = Vcb;
- t->parent = NULL;
- t->root = r;
- t->paritem = NULL;
- t->size = 0;
- t->new_address = 0;
- t->has_new_address = FALSE;
- t->updated_extents = FALSE;
- t->write = FALSE;
- t->uniqueness_determined = FALSE;
-
- InitializeListHead(&t->itemlist);
-
- if (t->header.level == 0) { // leaf node
- leaf_node* ln = (leaf_node*)(buf + sizeof(tree_header));
- unsigned int i;
-
- if ((t->header.num_items * sizeof(leaf_node)) + sizeof(tree_header) > Vcb->superblock.node_size) {
- ERR("tree at %llx has more items than expected (%x)\n", t->header.num_items);
- ExFreePool(buf);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- for (i = 0; i < t->header.num_items; i++) {
- td = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td) {
- ERR("out of memory\n");
- ExFreePool(buf);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td->key = ln[i].key;
-
- if (ln[i].size > 0)
- td->data = buf + sizeof(tree_header) + ln[i].offset;
- else
- td->data = NULL;
-
- if (ln[i].size + sizeof(tree_header) + sizeof(leaf_node) > Vcb->superblock.node_size) {
- ERR("overlarge item in tree %llx: %u > %u\n", addr, ln[i].size, Vcb->superblock.node_size - sizeof(tree_header) - sizeof(leaf_node));
- ExFreePool(buf);
- return STATUS_INTERNAL_ERROR;
- }
-
- td->size = (UINT16)ln[i].size;
- td->ignore = FALSE;
- td->inserted = FALSE;
-
- InsertTailList(&t->itemlist, &td->list_entry);
-
- t->size += ln[i].size;
- }
-
- t->size += t->header.num_items * sizeof(leaf_node);
- t->buf = buf;
- } else {
- internal_node* in = (internal_node*)(buf + sizeof(tree_header));
- unsigned int i;
-
- if ((t->header.num_items * sizeof(internal_node)) + sizeof(tree_header) > Vcb->superblock.node_size) {
- ERR("tree at %llx has more items than expected (%x)\n", t->header.num_items);
- ExFreePool(buf);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- for (i = 0; i < t->header.num_items; i++) {
- td = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td) {
- ERR("out of memory\n");
- ExFreePool(buf);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td->key = in[i].key;
-
- td->treeholder.address = in[i].address;
- td->treeholder.generation = in[i].generation;
- td->treeholder.tree = NULL;
- td->ignore = FALSE;
- td->inserted = FALSE;
-
- InsertTailList(&t->itemlist, &td->list_entry);
- }
-
- t->size = t->header.num_items * sizeof(internal_node);
- t->buf = NULL;
- ExFreePool(buf);
- }
-
- InsertTailList(&Vcb->trees, &t->list_entry);
-
- h = t->hash >> 24;
-
- if (!Vcb->trees_ptrs[h]) {
- UINT8 h2 = h;
-
- le = Vcb->trees_hash.Flink;
-
- if (h2 > 0) {
- h2--;
- do {
- if (Vcb->trees_ptrs[h2]) {
- le = Vcb->trees_ptrs[h2];
- break;
- }
-
- h2--;
- } while (h2 > 0);
- }
- } else
- le = Vcb->trees_ptrs[h];
-
- inserted = FALSE;
- while (le != &Vcb->trees_hash) {
- tree* t2 = CONTAINING_RECORD(le, tree, list_entry_hash);
-
- if (t2->hash >= t->hash) {
- InsertHeadList(le->Blink, &t->list_entry_hash);
- inserted = TRUE;
- break;
- }
-
- le = le->Flink;
- }
-
- if (!inserted)
- InsertTailList(&Vcb->trees_hash, &t->list_entry_hash);
-
- if (!Vcb->trees_ptrs[h] || t->list_entry_hash.Flink == Vcb->trees_ptrs[h])
- Vcb->trees_ptrs[h] = &t->list_entry_hash;
-
- TRACE("returning %p\n", t);
-
- *pt = t;
-
- return STATUS_SUCCESS;
-}
-
-static tree* free_tree2(tree* t) {
- tree* par;
- root* r = t->root;
-
- par = t->parent;
-
- if (r && r->treeholder.tree != t)
- r = NULL;
-
- if (par) {
- if (t->paritem)
- t->paritem->treeholder.tree = NULL;
- }
-
- while (!IsListEmpty(&t->itemlist)) {
- tree_data* td = CONTAINING_RECORD(RemoveHeadList(&t->itemlist), tree_data, list_entry);
-
- if (t->header.level == 0 && td->data && td->inserted)
- ExFreePool(td->data);
-
- ExFreeToPagedLookasideList(&t->Vcb->tree_data_lookaside, td);
- }
-
- RemoveEntryList(&t->list_entry);
-
- if (r)
- r->treeholder.tree = NULL;
-
- if (t->list_entry_hash.Flink) {
- UINT8 h = t->hash >> 24;
- if (t->Vcb->trees_ptrs[h] == &t->list_entry_hash) {
- if (t->list_entry_hash.Flink != &t->Vcb->trees_hash) {
- tree* t2 = CONTAINING_RECORD(t->list_entry_hash.Flink, tree, list_entry_hash);
-
- if ((t2->hash >> 24) == h)
- t->Vcb->trees_ptrs[h] = &t2->list_entry_hash;
- else
- t->Vcb->trees_ptrs[h] = NULL;
- } else
- t->Vcb->trees_ptrs[h] = NULL;
- }
-
- RemoveEntryList(&t->list_entry_hash);
- }
-
- if (t->buf)
- ExFreePool(t->buf);
-
- ExFreePool(t);
-
- return NULL;
-}
-
-NTSTATUS do_load_tree(device_extension* Vcb, tree_holder* th, root* r, tree* t, tree_data* td, BOOL* loaded, PIRP Irp) {
- BOOL ret;
-
- ExAcquireResourceExclusiveLite(&r->nonpaged->load_tree_lock, TRUE);
-
- if (!th->tree) {
- NTSTATUS Status;
- tree* nt;
-
- Status = load_tree(Vcb, th->address, r, &nt, th->generation, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("load_tree returned %08x\n", Status);
- ExReleaseResourceLite(&r->nonpaged->load_tree_lock);
- return Status;
- }
-
- nt->parent = t;
-
-#ifdef DEBUG_PARANOID
- if (t && t->header.level <= nt->header.level) int3;
-#endif
-
- nt->paritem = td;
-
- th->tree = nt;
-
- ret = TRUE;
- } else
- ret = FALSE;
-
- ExReleaseResourceLite(&r->nonpaged->load_tree_lock);
-
- *loaded = ret;
-
- return STATUS_SUCCESS;
-}
-
-tree* free_tree(tree* t) {
- tree* ret;
- root* r = t->root;
-
- ExAcquireResourceExclusiveLite(&r->nonpaged->load_tree_lock, TRUE);
-
- ret = free_tree2(t);
-
- ExReleaseResourceLite(&r->nonpaged->load_tree_lock);
-
- return ret;
-}
-
-static __inline tree_data* first_item(tree* t) {
- LIST_ENTRY* le = t->itemlist.Flink;
-
- if (le == &t->itemlist)
- return NULL;
-
- return CONTAINING_RECORD(le, tree_data, list_entry);
-}
-
-static __inline tree_data* prev_item(tree* t, tree_data* td) {
- LIST_ENTRY* le = td->list_entry.Blink;
-
- if (le == &t->itemlist)
- return NULL;
-
- return CONTAINING_RECORD(le, tree_data, list_entry);
-}
-
-static __inline tree_data* next_item(tree* t, tree_data* td) {
- LIST_ENTRY* le = td->list_entry.Flink;
-
- if (le == &t->itemlist)
- return NULL;
-
- return CONTAINING_RECORD(le, tree_data, list_entry);
-}
-
-static NTSTATUS next_item2(device_extension* Vcb, tree* t, tree_data* td, traverse_ptr* tp) {
- tree_data* td2 = next_item(t, td);
- tree* t2;
-
- if (td2) {
- tp->tree = t;
- tp->item = td2;
- return STATUS_SUCCESS;
- }
-
- t2 = t;
-
- do {
- td2 = t2->paritem;
- t2 = t2->parent;
- } while (td2 && !next_item(t2, td2));
-
- if (!td2)
- return STATUS_NOT_FOUND;
-
- td2 = next_item(t2, td2);
-
- return find_item_to_level(Vcb, t2->root, tp, &td2->key, FALSE, t->header.level, NULL);
-}
-
-NTSTATUS skip_to_difference(device_extension* Vcb, traverse_ptr* tp, traverse_ptr* tp2, BOOL* ended1, BOOL* ended2) {
- NTSTATUS Status;
- tree *t1, *t2;
- tree_data *td1, *td2;
-
- t1 = tp->tree;
- t2 = tp2->tree;
-
- do {
- td1 = t1->paritem;
- td2 = t2->paritem;
- t1 = t1->parent;
- t2 = t2->parent;
- } while (t1 && t2 && t1->header.address == t2->header.address);
-
- while (TRUE) {
- traverse_ptr tp3, tp4;
-
- Status = next_item2(Vcb, t1, td1, &tp3);
- if (Status == STATUS_NOT_FOUND)
- *ended1 = TRUE;
- else if (!NT_SUCCESS(Status)) {
- ERR("next_item2 returned %08x\n", Status);
- return Status;
- }
-
- Status = next_item2(Vcb, t2, td2, &tp4);
- if (Status == STATUS_NOT_FOUND)
- *ended2 = TRUE;
- else if (!NT_SUCCESS(Status)) {
- ERR("next_item2 returned %08x\n", Status);
- return Status;
- }
-
- if (*ended1 || *ended2) {
- if (!*ended1) {
- Status = find_item(Vcb, t1->root, tp, &tp3.item->key, FALSE, NULL);
- if (!NT_SUCCESS(Status)) {
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
- } else if (!*ended2) {
- Status = find_item(Vcb, t2->root, tp2, &tp4.item->key, FALSE, NULL);
- if (!NT_SUCCESS(Status)) {
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
- }
-
- return STATUS_SUCCESS;
- }
-
- if (tp3.tree->header.address != tp4.tree->header.address) {
- Status = find_item(Vcb, t1->root, tp, &tp3.item->key, FALSE, NULL);
- if (!NT_SUCCESS(Status)) {
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
-
- Status = find_item(Vcb, t2->root, tp2, &tp4.item->key, FALSE, NULL);
- if (!NT_SUCCESS(Status)) {
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
-
- return STATUS_SUCCESS;
- }
-
- t1 = tp3.tree;
- td1 = tp3.item;
- t2 = tp4.tree;
- td2 = tp4.item;
- }
-}
-
-static NTSTATUS find_item_in_tree(device_extension* Vcb, tree* t, traverse_ptr* tp, const KEY* searchkey, BOOL ignore, UINT8 level, PIRP Irp) {
- int cmp;
- tree_data *td, *lasttd;
- KEY key2;
-
- cmp = 1;
- td = first_item(t);
- lasttd = NULL;
-
- if (!td) return STATUS_NOT_FOUND;
-
- key2 = *searchkey;
-
- do {
- cmp = keycmp(key2, td->key);
-
- if (cmp == 1) {
- lasttd = td;
- td = next_item(t, td);
- }
-
- if (t->header.level == 0 && cmp == 0 && !ignore && td && td->ignore) {
- tree_data* origtd = td;
-
- while (td && td->ignore)
- td = next_item(t, td);
-
- if (td) {
- cmp = keycmp(key2, td->key);
-
- if (cmp != 0) {
- td = origtd;
- cmp = 0;
- }
- } else
- td = origtd;
- }
- } while (td && cmp == 1);
-
- if ((cmp == -1 || !td) && lasttd)
- td = lasttd;
-
- if (t->header.level == 0) {
- if (td->ignore && !ignore) {
- traverse_ptr oldtp;
-
- oldtp.tree = t;
- oldtp.item = td;
-
- while (find_prev_item(Vcb, &oldtp, tp, Irp)) {
- if (!tp->item->ignore)
- return STATUS_SUCCESS;
-
- oldtp = *tp;
- }
-
- // if no valid entries before where item should be, look afterwards instead
-
- oldtp.tree = t;
- oldtp.item = td;
-
- while (find_next_item(Vcb, &oldtp, tp, TRUE, Irp)) {
- if (!tp->item->ignore)
- return STATUS_SUCCESS;
-
- oldtp = *tp;
- }
-
- return STATUS_NOT_FOUND;
- } else {
- tp->tree = t;
- tp->item = td;
- }
-
- return STATUS_SUCCESS;
- } else {
- NTSTATUS Status;
- BOOL loaded;
-
- while (td && td->treeholder.tree && IsListEmpty(&td->treeholder.tree->itemlist)) {
- td = prev_item(t, td);
- }
-
- if (!td)
- return STATUS_NOT_FOUND;
-
- if (t->header.level <= level) {
- tp->tree = t;
- tp->item = td;
- return STATUS_SUCCESS;
- }
-
- if (!td->treeholder.tree) {
- Status = do_load_tree(Vcb, &td->treeholder, t->root, t, td, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return Status;
- }
- }
-
- Status = find_item_in_tree(Vcb, td->treeholder.tree, tp, searchkey, ignore, level, Irp);
-
- return Status;
- }
-}
-
-NTSTATUS find_item(_In_ _Requires_lock_held_(_Curr_->tree_lock) device_extension* Vcb, _In_ root* r, _Out_ traverse_ptr* tp,
- _In_ const KEY* searchkey, _In_ BOOL ignore, _In_opt_ PIRP Irp) {
- NTSTATUS Status;
- BOOL loaded;
-
- if (!r->treeholder.tree) {
- Status = do_load_tree(Vcb, &r->treeholder, r, NULL, NULL, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return Status;
- }
- }
-
- Status = find_item_in_tree(Vcb, r->treeholder.tree, tp, searchkey, ignore, 0, Irp);
- if (!NT_SUCCESS(Status) && Status != STATUS_NOT_FOUND) {
- ERR("find_item_in_tree returned %08x\n", Status);
- }
-
- return Status;
-}
-
-NTSTATUS find_item_to_level(device_extension* Vcb, root* r, traverse_ptr* tp, const KEY* searchkey, BOOL ignore, UINT8 level, PIRP Irp) {
- NTSTATUS Status;
- BOOL loaded;
-
- if (!r->treeholder.tree) {
- Status = do_load_tree(Vcb, &r->treeholder, r, NULL, NULL, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return Status;
- }
- }
-
- Status = find_item_in_tree(Vcb, r->treeholder.tree, tp, searchkey, ignore, level, Irp);
- if (!NT_SUCCESS(Status) && Status != STATUS_NOT_FOUND) {
- ERR("find_item_in_tree returned %08x\n", Status);
- }
-
- if (Status == STATUS_NOT_FOUND) {
- tp->tree = r->treeholder.tree;
- tp->item = NULL;
- }
-
- return Status;
-}
-
-BOOL find_next_item(_Requires_lock_held_(_Curr_->tree_lock) device_extension* Vcb, const traverse_ptr* tp, traverse_ptr* next_tp, BOOL ignore, PIRP Irp) {
- tree* t;
- tree_data *td = NULL, *next;
- NTSTATUS Status;
- BOOL loaded;
-
- next = next_item(tp->tree, tp->item);
-
- if (!ignore) {
- while (next && next->ignore)
- next = next_item(tp->tree, next);
- }
-
- if (next) {
- next_tp->tree = tp->tree;
- next_tp->item = next;
-
-#ifdef DEBUG_PARANOID
- if (!ignore && next_tp->item->ignore) {
- ERR("error - returning ignored item\n");
- int3;
- }
-#endif
-
- return TRUE;
- }
-
- if (!tp->tree->parent)
- return FALSE;
-
- t = tp->tree;
- do {
- if (t->parent) {
- td = next_item(t->parent, t->paritem);
-
- if (td) break;
- }
-
- t = t->parent;
- } while (t);
-
- if (!t)
- return FALSE;
-
- Status = do_load_tree(Vcb, &td->treeholder, t->parent->root, t->parent, td, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return FALSE;
- }
-
- t = td->treeholder.tree;
-
- while (t->header.level != 0) {
- tree_data* fi;
-
- fi = first_item(t);
-
- Status = do_load_tree(Vcb, &fi->treeholder, t->parent->root, t, fi, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return FALSE;
- }
-
- t = fi->treeholder.tree;
- }
-
- next_tp->tree = t;
- next_tp->item = first_item(t);
-
- if (!ignore && next_tp->item->ignore) {
- traverse_ptr ntp2;
- BOOL b;
-
- while ((b = find_next_item(Vcb, next_tp, &ntp2, TRUE, Irp))) {
- *next_tp = ntp2;
-
- if (!next_tp->item->ignore)
- break;
- }
-
- if (!b)
- return FALSE;
- }
-
-#ifdef DEBUG_PARANOID
- if (!ignore && next_tp->item->ignore) {
- ERR("error - returning ignored item\n");
- int3;
- }
-#endif
-
- return TRUE;
-}
-
-static __inline tree_data* last_item(tree* t) {
- LIST_ENTRY* le = t->itemlist.Blink;
-
- if (le == &t->itemlist)
- return NULL;
-
- return CONTAINING_RECORD(le, tree_data, list_entry);
-}
-
-BOOL find_prev_item(_Requires_lock_held_(_Curr_->tree_lock) device_extension* Vcb, const traverse_ptr* tp, traverse_ptr* prev_tp, PIRP Irp) {
- tree* t;
- tree_data* td;
- NTSTATUS Status;
- BOOL loaded;
-
- // FIXME - support ignore flag
- if (prev_item(tp->tree, tp->item)) {
- prev_tp->tree = tp->tree;
- prev_tp->item = prev_item(tp->tree, tp->item);
-
- return TRUE;
- }
-
- if (!tp->tree->parent)
- return FALSE;
-
- t = tp->tree;
- while (t && (!t->parent || !prev_item(t->parent, t->paritem))) {
- t = t->parent;
- }
-
- if (!t)
- return FALSE;
-
- td = prev_item(t->parent, t->paritem);
-
- Status = do_load_tree(Vcb, &td->treeholder, t->parent->root, t->parent, td, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return FALSE;
- }
-
- t = td->treeholder.tree;
-
- while (t->header.level != 0) {
- tree_data* li;
-
- li = last_item(t);
-
- Status = do_load_tree(Vcb, &li->treeholder, t->parent->root, t, li, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return FALSE;
- }
-
- t = li->treeholder.tree;
- }
-
- prev_tp->tree = t;
- prev_tp->item = last_item(t);
-
- return TRUE;
-}
-
-void free_trees_root(device_extension* Vcb, root* r) {
- LIST_ENTRY* le;
- ULONG level;
-
- for (level = 0; level <= 255; level++) {
- BOOL empty = TRUE;
-
- le = Vcb->trees.Flink;
-
- while (le != &Vcb->trees) {
- LIST_ENTRY* nextle = le->Flink;
- tree* t = CONTAINING_RECORD(le, tree, list_entry);
-
- if (t->root == r) {
- if (t->header.level == level) {
- BOOL top = !t->paritem;
-
- empty = FALSE;
-
- free_tree2(t);
- if (top && r->treeholder.tree == t)
- r->treeholder.tree = NULL;
-
- if (IsListEmpty(&Vcb->trees))
- return;
- } else if (t->header.level > level)
- empty = FALSE;
- }
-
- le = nextle;
- }
-
- if (empty)
- break;
- }
-}
-
-void free_trees(device_extension* Vcb) {
- LIST_ENTRY* le;
- ULONG level;
-
- for (level = 0; level <= 255; level++) {
- BOOL empty = TRUE;
-
- le = Vcb->trees.Flink;
-
- while (le != &Vcb->trees) {
- LIST_ENTRY* nextle = le->Flink;
- tree* t = CONTAINING_RECORD(le, tree, list_entry);
- root* r = t->root;
-
- if (t->header.level == level) {
- BOOL top = !t->paritem;
-
- empty = FALSE;
-
- free_tree2(t);
- if (top && r->treeholder.tree == t)
- r->treeholder.tree = NULL;
-
- if (IsListEmpty(&Vcb->trees))
- return;
- } else if (t->header.level > level)
- empty = FALSE;
-
- le = nextle;
- }
-
- if (empty)
- break;
- }
-}
-
-#ifdef _MSC_VER
-#pragma warning(push)
-#pragma warning(suppress: 28194)
-#endif
-void add_rollback(_In_ LIST_ENTRY* rollback, _In_ enum rollback_type type, _In_ __drv_aliasesMem void* ptr) {
- rollback_item* ri;
-
- ri = ExAllocatePoolWithTag(PagedPool, sizeof(rollback_item), ALLOC_TAG);
- if (!ri) {
- ERR("out of memory\n");
- return;
- }
-
- ri->type = type;
- ri->ptr = ptr;
- InsertTailList(rollback, &ri->list_entry);
-}
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-
-#ifdef _MSC_VER
-#pragma warning(push)
-#pragma warning(suppress: 28194)
-#endif
-NTSTATUS insert_tree_item(_In_ _Requires_exclusive_lock_held_(_Curr_->tree_lock) device_extension* Vcb, _In_ root* r, _In_ UINT64 obj_id,
- _In_ UINT8 obj_type, _In_ UINT64 offset, _In_reads_bytes_opt_(size) _When_(return >= 0, __drv_aliasesMem) void* data,
- _In_ UINT16 size, _Out_opt_ traverse_ptr* ptp, _In_opt_ PIRP Irp) {
- traverse_ptr tp;
- KEY searchkey;
- int cmp;
- tree_data *td, *paritem;
- tree* t;
-#ifdef _DEBUG
- LIST_ENTRY* le;
- KEY firstitem = {0xcccccccccccccccc,0xcc,0xcccccccccccccccc};
-#endif
- NTSTATUS Status;
-
- TRACE("(%p, %p, %llx, %x, %llx, %p, %x, %p)\n", Vcb, r, obj_id, obj_type, offset, data, size, ptp);
-
- searchkey.obj_id = obj_id;
- searchkey.obj_type = obj_type;
- searchkey.offset = offset;
-
- Status = find_item(Vcb, r, &tp, &searchkey, TRUE, Irp);
- if (Status == STATUS_NOT_FOUND) {
- if (r) {
- if (!r->treeholder.tree) {
- BOOL loaded;
-
- Status = do_load_tree(Vcb, &r->treeholder, r, NULL, NULL, &loaded, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("do_load_tree returned %08x\n", Status);
- return Status;
- }
- }
-
- if (r->treeholder.tree && r->treeholder.tree->header.num_items == 0) {
- tp.tree = r->treeholder.tree;
- tp.item = NULL;
- } else {
- ERR("error: unable to load tree for root %llx\n", r->id);
- return STATUS_INTERNAL_ERROR;
- }
- } else {
- ERR("error: find_item returned %08x\n", Status);
- return Status;
- }
- } else if (!NT_SUCCESS(Status)) {
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
-
- TRACE("tp.item = %p\n", tp.item);
-
- if (tp.item) {
- TRACE("tp.item->key = %p\n", &tp.item->key);
- cmp = keycmp(searchkey, tp.item->key);
-
- if (cmp == 0 && !tp.item->ignore) {
- ERR("error: key (%llx,%x,%llx) already present\n", obj_id, obj_type, offset);
-#ifdef DEBUG_PARANOID
- int3;
-#endif
- return STATUS_INTERNAL_ERROR;
- }
- } else
- cmp = -1;
-
- td = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td->key = searchkey;
- td->size = size;
- td->data = data;
- td->ignore = FALSE;
- td->inserted = TRUE;
-
-#ifdef _DEBUG
- le = tp.tree->itemlist.Flink;
- while (le != &tp.tree->itemlist) {
- tree_data* td2 = CONTAINING_RECORD(le, tree_data, list_entry);
- firstitem = td2->key;
- break;
- }
-
- TRACE("inserting %llx,%x,%llx into tree beginning %llx,%x,%llx (num_items %x)\n", obj_id, obj_type, offset, firstitem.obj_id, firstitem.obj_type, firstitem.offset, tp.tree->header.num_items);
-#endif
-
- if (cmp == -1) { // very first key in root
- InsertHeadList(&tp.tree->itemlist, &td->list_entry);
-
- paritem = tp.tree->paritem;
- while (paritem) {
- if (!keycmp(paritem->key, tp.item->key)) {
- paritem->key = searchkey;
- } else
- break;
-
- paritem = paritem->treeholder.tree->paritem;
- }
- } else if (cmp == 0)
- InsertHeadList(tp.item->list_entry.Blink, &td->list_entry); // make sure non-deleted item is before deleted ones
- else
- InsertHeadList(&tp.item->list_entry, &td->list_entry);
-
- tp.tree->header.num_items++;
- tp.tree->size += size + sizeof(leaf_node);
-
- if (!tp.tree->write) {
- tp.tree->write = TRUE;
- Vcb->need_write = TRUE;
- }
-
- if (ptp)
- *ptp = tp;
-
- t = tp.tree;
- while (t) {
- if (t->paritem && t->paritem->ignore) {
- t->paritem->ignore = FALSE;
- t->parent->header.num_items++;
- t->parent->size += sizeof(internal_node);
- }
-
- t->header.generation = Vcb->superblock.generation;
- t = t->parent;
- }
-
- return STATUS_SUCCESS;
-}
-#ifdef _MSC_VER
-#pragma warning(pop)
-#endif
-
-NTSTATUS delete_tree_item(_In_ _Requires_exclusive_lock_held_(_Curr_->tree_lock) device_extension* Vcb, _Inout_ traverse_ptr* tp) {
- tree* t;
- UINT64 gen;
-
- TRACE("deleting item %llx,%x,%llx (ignore = %s)\n", tp->item->key.obj_id, tp->item->key.obj_type, tp->item->key.offset, tp->item->ignore ? "TRUE" : "FALSE");
-
-#ifdef DEBUG_PARANOID
- if (tp->item->ignore) {
- ERR("trying to delete already-deleted item %llx,%x,%llx\n", tp->item->key.obj_id, tp->item->key.obj_type, tp->item->key.offset);
- int3;
- return STATUS_INTERNAL_ERROR;
- }
-#endif
-
- tp->item->ignore = TRUE;
-
- if (!tp->tree->write) {
- tp->tree->write = TRUE;
- Vcb->need_write = TRUE;
- }
-
- tp->tree->header.num_items--;
-
- if (tp->tree->header.level == 0)
- tp->tree->size -= sizeof(leaf_node) + tp->item->size;
- else
- tp->tree->size -= sizeof(internal_node);
-
- gen = tp->tree->Vcb->superblock.generation;
-
- t = tp->tree;
- while (t) {
- t->header.generation = gen;
- t = t->parent;
- }
-
- return STATUS_SUCCESS;
-}
-
-void clear_rollback(LIST_ENTRY* rollback) {
- while (!IsListEmpty(rollback)) {
- LIST_ENTRY* le = RemoveHeadList(rollback);
- rollback_item* ri = CONTAINING_RECORD(le, rollback_item, list_entry);
-
- switch (ri->type) {
- case ROLLBACK_ADD_SPACE:
- case ROLLBACK_SUBTRACT_SPACE:
- case ROLLBACK_INSERT_EXTENT:
- case ROLLBACK_DELETE_EXTENT:
- ExFreePool(ri->ptr);
- break;
-
- default:
- break;
- }
-
- ExFreePool(ri);
- }
-}
-
-void do_rollback(device_extension* Vcb, LIST_ENTRY* rollback) {
- NTSTATUS Status;
- rollback_item* ri;
-
- while (!IsListEmpty(rollback)) {
- LIST_ENTRY* le = RemoveTailList(rollback);
- ri = CONTAINING_RECORD(le, rollback_item, list_entry);
-
- switch (ri->type) {
- case ROLLBACK_INSERT_EXTENT:
- {
- rollback_extent* re = ri->ptr;
-
- re->ext->ignore = TRUE;
-
- if (re->ext->extent_data.type == EXTENT_TYPE_REGULAR || re->ext->extent_data.type == EXTENT_TYPE_PREALLOC) {
- EXTENT_DATA2* ed2 = (EXTENT_DATA2*)re->ext->extent_data.data;
-
- if (ed2->size != 0) {
- chunk* c = get_chunk_from_address(Vcb, ed2->address);
-
- if (c) {
- Status = update_changed_extent_ref(Vcb, c, ed2->address, ed2->size, re->fcb->subvol->id,
- re->fcb->inode, re->ext->offset - ed2->offset, -1,
- re->fcb->inode_item.flags & BTRFS_INODE_NODATASUM, FALSE, NULL);
-
- if (!NT_SUCCESS(Status))
- ERR("update_changed_extent_ref returned %08x\n", Status);
- }
-
- re->fcb->inode_item.st_blocks -= ed2->num_bytes;
- }
- }
-
- ExFreePool(re);
- break;
- }
-
- case ROLLBACK_DELETE_EXTENT:
- {
- rollback_extent* re = ri->ptr;
-
- re->ext->ignore = FALSE;
-
- if (re->ext->extent_data.type == EXTENT_TYPE_REGULAR || re->ext->extent_data.type == EXTENT_TYPE_PREALLOC) {
- EXTENT_DATA2* ed2 = (EXTENT_DATA2*)re->ext->extent_data.data;
-
- if (ed2->size != 0) {
- chunk* c = get_chunk_from_address(Vcb, ed2->address);
-
- if (c) {
- Status = update_changed_extent_ref(Vcb, c, ed2->address, ed2->size, re->fcb->subvol->id,
- re->fcb->inode, re->ext->offset - ed2->offset, 1,
- re->fcb->inode_item.flags & BTRFS_INODE_NODATASUM, FALSE, NULL);
-
- if (!NT_SUCCESS(Status))
- ERR("update_changed_extent_ref returned %08x\n", Status);
- }
-
- re->fcb->inode_item.st_blocks += ed2->num_bytes;
- }
- }
-
- ExFreePool(re);
- break;
- }
-
- case ROLLBACK_ADD_SPACE:
- case ROLLBACK_SUBTRACT_SPACE:
- {
- rollback_space* rs = ri->ptr;
-
- if (rs->chunk)
- ExAcquireResourceExclusiveLite(&rs->chunk->lock, TRUE);
-
- if (ri->type == ROLLBACK_ADD_SPACE)
- space_list_subtract2(rs->list, rs->list_size, rs->address, rs->length, NULL, NULL);
- else
- space_list_add2(rs->list, rs->list_size, rs->address, rs->length, NULL, NULL);
-
- if (rs->chunk) {
- if (ri->type == ROLLBACK_ADD_SPACE)
- rs->chunk->used += rs->length;
- else
- rs->chunk->used -= rs->length;
- }
-
- if (rs->chunk) {
- LIST_ENTRY* le2 = le->Blink;
-
- while (le2 != rollback) {
- LIST_ENTRY* le3 = le2->Blink;
- rollback_item* ri2 = CONTAINING_RECORD(le2, rollback_item, list_entry);
-
- if (ri2->type == ROLLBACK_ADD_SPACE || ri2->type == ROLLBACK_SUBTRACT_SPACE) {
- rollback_space* rs2 = ri2->ptr;
-
- if (rs2->chunk == rs->chunk) {
- if (ri2->type == ROLLBACK_ADD_SPACE) {
- space_list_subtract2(rs2->list, rs2->list_size, rs2->address, rs2->length, NULL, NULL);
- rs->chunk->used += rs2->length;
- } else {
- space_list_add2(rs2->list, rs2->list_size, rs2->address, rs2->length, NULL, NULL);
- rs->chunk->used -= rs2->length;
- }
-
- ExFreePool(rs2);
- RemoveEntryList(&ri2->list_entry);
- ExFreePool(ri2);
- }
- }
-
- le2 = le3;
- }
-
- ExReleaseResourceLite(&rs->chunk->lock);
- }
-
- ExFreePool(rs);
-
- break;
- }
- }
-
- ExFreePool(ri);
- }
-}
-
-static void find_tree_end(tree* t, KEY* tree_end, BOOL* no_end) {
- tree* p;
-
- p = t;
- do {
- tree_data* pi;
-
- if (!p->parent) {
- *no_end = TRUE;
- return;
- }
-
- pi = p->paritem;
-
- if (pi->list_entry.Flink != &p->parent->itemlist) {
- tree_data* td = CONTAINING_RECORD(pi->list_entry.Flink, tree_data, list_entry);
-
- *tree_end = td->key;
- *no_end = FALSE;
- return;
- }
-
- p = p->parent;
- } while (p);
-}
-
-void clear_batch_list(device_extension* Vcb, LIST_ENTRY* batchlist) {
- while (!IsListEmpty(batchlist)) {
- LIST_ENTRY* le = RemoveHeadList(batchlist);
- batch_root* br = CONTAINING_RECORD(le, batch_root, list_entry);
-
- while (!IsListEmpty(&br->items)) {
- LIST_ENTRY* le2 = RemoveHeadList(&br->items);
- batch_item* bi = CONTAINING_RECORD(le2, batch_item, list_entry);
-
- ExFreeToPagedLookasideList(&Vcb->batch_item_lookaside, bi);
- }
-
- ExFreePool(br);
- }
-}
-
-static void add_delete_inode_extref(device_extension* Vcb, batch_item* bi, LIST_ENTRY* listhead) {
- batch_item* bi2;
- LIST_ENTRY* le;
- INODE_REF* delir = (INODE_REF*)bi->data;
- INODE_EXTREF* ier;
-
- TRACE("entry in INODE_REF not found, adding Batch_DeleteInodeExtRef entry\n");
-
- bi2 = ExAllocateFromPagedLookasideList(&Vcb->batch_item_lookaside);
- if (!bi2) {
- ERR("out of memory\n");
- return;
- }
-
- ier = ExAllocatePoolWithTag(PagedPool, sizeof(INODE_EXTREF) - 1 + delir->n, ALLOC_TAG);
- if (!ier) {
- ERR("out of memory\n");
- ExFreePool(bi2);
- return;
- }
-
- ier->dir = bi->key.offset;
- ier->index = delir->index;
- ier->n = delir->n;
- RtlCopyMemory(ier->name, delir->name, delir->n);
-
- bi2->key.obj_id = bi->key.obj_id;
- bi2->key.obj_type = TYPE_INODE_EXTREF;
- bi2->key.offset = calc_crc32c((UINT32)bi->key.offset, (UINT8*)ier->name, ier->n);
- bi2->data = ier;
- bi2->datalen = sizeof(INODE_EXTREF) - 1 + ier->n;
- bi2->operation = Batch_DeleteInodeExtRef;
-
- le = bi->list_entry.Flink;
- while (le != listhead) {
- batch_item* bi3 = CONTAINING_RECORD(le, batch_item, list_entry);
-
- if (keycmp(bi3->key, bi2->key) != -1) {
- InsertHeadList(le->Blink, &bi2->list_entry);
- return;
- }
-
- le = le->Flink;
- }
-
- InsertTailList(listhead, &bi2->list_entry);
-}
-
-static NTSTATUS handle_batch_collision(device_extension* Vcb, batch_item* bi, tree* t, tree_data* td, tree_data* newtd, LIST_ENTRY* listhead, BOOL* ignore) {
- if (bi->operation == Batch_Delete || bi->operation == Batch_SetXattr || bi->operation == Batch_DirItem || bi->operation == Batch_InodeRef ||
- bi->operation == Batch_InodeExtRef || bi->operation == Batch_DeleteDirItem || bi->operation == Batch_DeleteInodeRef ||
- bi->operation == Batch_DeleteInodeExtRef || bi->operation == Batch_DeleteXattr) {
- UINT16 maxlen = (UINT16)(Vcb->superblock.node_size - sizeof(tree_header) - sizeof(leaf_node));
-
- switch (bi->operation) {
- case Batch_SetXattr: {
- if (td->size < sizeof(DIR_ITEM)) {
- ERR("(%llx,%x,%llx) was %u bytes, expected at least %u\n", bi->key.obj_id, bi->key.obj_type, bi->key.offset, td->size, sizeof(DIR_ITEM));
- } else {
- UINT8* newdata;
- ULONG size = td->size;
- DIR_ITEM* newxa = (DIR_ITEM*)bi->data;
- DIR_ITEM* xa = (DIR_ITEM*)td->data;
-
- while (TRUE) {
- ULONG oldxasize;
-
- if (size < sizeof(DIR_ITEM) || size < sizeof(DIR_ITEM) - 1 + xa->m + xa->n) {
- ERR("(%llx,%x,%llx) was truncated\n", bi->key.obj_id, bi->key.obj_type, bi->key.offset);
- break;
- }
-
- oldxasize = sizeof(DIR_ITEM) - 1 + xa->m + xa->n;
-
- if (xa->n == newxa->n && RtlCompareMemory(newxa->name, xa->name, xa->n) == xa->n) {
- UINT64 pos;
-
- // replace
-
- if (td->size + bi->datalen - oldxasize > maxlen)
- ERR("DIR_ITEM would be over maximum size, truncating (%u + %u - %u > %u)\n", td->size, bi->datalen, oldxasize, maxlen);
-
- newdata = ExAllocatePoolWithTag(PagedPool, td->size + bi->datalen - oldxasize, ALLOC_TAG);
- if (!newdata) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- pos = (UINT8*)xa - td->data;
- if (pos + oldxasize < td->size) // copy after changed xattr
- RtlCopyMemory(newdata + pos + bi->datalen, td->data + pos + oldxasize, (ULONG)(td->size - pos - oldxasize));
-
- if (pos > 0) { // copy before changed xattr
- RtlCopyMemory(newdata, td->data, (ULONG)pos);
- xa = (DIR_ITEM*)(newdata + pos);
- } else
- xa = (DIR_ITEM*)newdata;
-
- RtlCopyMemory(xa, bi->data, bi->datalen);
-
- bi->datalen = (UINT16)min(td->size + bi->datalen - oldxasize, maxlen);
-
- ExFreePool(bi->data);
- bi->data = newdata;
-
- break;
- }
-
- if ((UINT8*)xa - (UINT8*)td->data + oldxasize >= size) {
- // not found, add to end of data
-
- if (td->size + bi->datalen > maxlen)
- ERR("DIR_ITEM would be over maximum size, truncating (%u + %u > %u)\n", td->size, bi->datalen, maxlen);
-
- newdata = ExAllocatePoolWithTag(PagedPool, td->size + bi->datalen, ALLOC_TAG);
- if (!newdata) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- RtlCopyMemory(newdata, td->data, td->size);
-
- xa = (DIR_ITEM*)((UINT8*)newdata + td->size);
- RtlCopyMemory(xa, bi->data, bi->datalen);
-
- bi->datalen = min(bi->datalen + td->size, maxlen);
-
- ExFreePool(bi->data);
- bi->data = newdata;
-
- break;
- } else {
- xa = (DIR_ITEM*)&xa->name[xa->m + xa->n];
- size -= oldxasize;
- }
- }
- }
- break;
- }
-
- case Batch_DirItem: {
- UINT8* newdata;
-
- if (td->size + bi->datalen > maxlen) {
- ERR("DIR_ITEM would be over maximum size (%u + %u > %u)\n", td->size, bi->datalen, maxlen);
- return STATUS_INTERNAL_ERROR;
- }
-
- newdata = ExAllocatePoolWithTag(PagedPool, td->size + bi->datalen, ALLOC_TAG);
- if (!newdata) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- RtlCopyMemory(newdata, td->data, td->size);
-
- RtlCopyMemory(newdata + td->size, bi->data, bi->datalen);
-
- bi->datalen += td->size;
-
- ExFreePool(bi->data);
- bi->data = newdata;
-
- break;
- }
-
- case Batch_InodeRef: {
- UINT8* newdata;
-
- if (td->size + bi->datalen > maxlen) {
- if (Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- INODE_REF* ir = (INODE_REF*)bi->data;
- INODE_EXTREF* ier;
- UINT16 ierlen;
- batch_item* bi2;
- LIST_ENTRY* le;
- BOOL inserted = FALSE;
-
- TRACE("INODE_REF would be too long, adding INODE_EXTREF instead\n");
-
- ierlen = (UINT16)(offsetof(INODE_EXTREF, name[0]) + ir->n);
-
- ier = ExAllocatePoolWithTag(PagedPool, ierlen, ALLOC_TAG);
- if (!ier) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- ier->dir = bi->key.offset;
- ier->index = ir->index;
- ier->n = ir->n;
- RtlCopyMemory(ier->name, ir->name, ier->n);
-
- bi2 = ExAllocateFromPagedLookasideList(&Vcb->batch_item_lookaside);
- if (!bi2) {
- ERR("out of memory\n");
- ExFreePool(ier);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- bi2->key.obj_id = bi->key.obj_id;
- bi2->key.obj_type = TYPE_INODE_EXTREF;
- bi2->key.offset = calc_crc32c((UINT32)ier->dir, (UINT8*)ier->name, ier->n);
- bi2->data = ier;
- bi2->datalen = ierlen;
- bi2->operation = Batch_InodeExtRef;
-
- le = bi->list_entry.Flink;
- while (le != listhead) {
- batch_item* bi3 = CONTAINING_RECORD(le, batch_item, list_entry);
-
- if (keycmp(bi3->key, bi2->key) != -1) {
- InsertHeadList(le->Blink, &bi2->list_entry);
- inserted = TRUE;
- }
-
- le = le->Flink;
- }
-
- if (!inserted)
- InsertTailList(listhead, &bi2->list_entry);
-
- *ignore = TRUE;
- return STATUS_SUCCESS;
- } else {
- ERR("INODE_REF would be over maximum size (%u + %u > %u)\n", td->size, bi->datalen, maxlen);
- return STATUS_INTERNAL_ERROR;
- }
- }
-
- newdata = ExAllocatePoolWithTag(PagedPool, td->size + bi->datalen, ALLOC_TAG);
- if (!newdata) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- RtlCopyMemory(newdata, td->data, td->size);
-
- RtlCopyMemory(newdata + td->size, bi->data, bi->datalen);
-
- bi->datalen += td->size;
-
- ExFreePool(bi->data);
- bi->data = newdata;
-
- break;
- }
-
- case Batch_InodeExtRef: {
- UINT8* newdata;
-
- if (td->size + bi->datalen > maxlen) {
- ERR("INODE_EXTREF would be over maximum size (%u + %u > %u)\n", td->size, bi->datalen, maxlen);
- return STATUS_INTERNAL_ERROR;
- }
-
- newdata = ExAllocatePoolWithTag(PagedPool, td->size + bi->datalen, ALLOC_TAG);
- if (!newdata) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- RtlCopyMemory(newdata, td->data, td->size);
-
- RtlCopyMemory(newdata + td->size, bi->data, bi->datalen);
-
- bi->datalen += td->size;
-
- ExFreePool(bi->data);
- bi->data = newdata;
-
- break;
- }
-
- case Batch_DeleteDirItem: {
- if (td->size < sizeof(DIR_ITEM)) {
- ERR("DIR_ITEM was %u bytes, expected at least %u\n", td->size, sizeof(DIR_ITEM));
- return STATUS_INTERNAL_ERROR;
- } else {
- DIR_ITEM *di, *deldi;
- LONG len;
-
- deldi = (DIR_ITEM*)bi->data;
- di = (DIR_ITEM*)td->data;
- len = td->size;
-
- do {
- if (di->m == deldi->m && di->n == deldi->n && RtlCompareMemory(di->name, deldi->name, di->n + di->m) == di->n + di->m) {
- UINT16 newlen = td->size - (sizeof(DIR_ITEM) - sizeof(char) + di->n + di->m);
-
- if (newlen == 0) {
- TRACE("deleting DIR_ITEM\n");
- } else {
- UINT8 *newdi = ExAllocatePoolWithTag(PagedPool, newlen, ALLOC_TAG), *dioff;
- tree_data* td2;
-
- if (!newdi) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- TRACE("modifying DIR_ITEM\n");
-
- if ((UINT8*)di > td->data) {
- RtlCopyMemory(newdi, td->data, (UINT8*)di - td->data);
- dioff = newdi + ((UINT8*)di - td->data);
- } else {
- dioff = newdi;
- }
-
- if ((UINT8*)&di->name[di->n + di->m] < td->data + td->size)
- RtlCopyMemory(dioff, &di->name[di->n + di->m], td->size - ((UINT8*)&di->name[di->n + di->m] - td->data));
-
- td2 = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td2) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td2->key = bi->key;
- td2->size = newlen;
- td2->data = newdi;
- td2->ignore = FALSE;
- td2->inserted = TRUE;
-
- InsertHeadList(td->list_entry.Blink, &td2->list_entry);
-
- t->header.num_items++;
- t->size += newlen + sizeof(leaf_node);
- t->write = TRUE;
- }
-
- break;
- }
-
- len -= sizeof(DIR_ITEM) - sizeof(char) + di->n + di->m;
- di = (DIR_ITEM*)&di->name[di->n + di->m];
-
- if (len == 0) {
- TRACE("could not find DIR_ITEM to delete\n");
- *ignore = TRUE;
- return STATUS_SUCCESS;
- }
- } while (len > 0);
- }
- break;
- }
-
- case Batch_DeleteInodeRef: {
- if (td->size < sizeof(INODE_REF)) {
- ERR("INODE_REF was %u bytes, expected at least %u\n", td->size, sizeof(INODE_REF));
- return STATUS_INTERNAL_ERROR;
- } else {
- INODE_REF *ir, *delir;
- ULONG len;
- BOOL changed = FALSE;
-
- delir = (INODE_REF*)bi->data;
- ir = (INODE_REF*)td->data;
- len = td->size;
-
- do {
- UINT16 itemlen;
-
- if (len < sizeof(INODE_REF) || len < offsetof(INODE_REF, name[0]) + ir->n) {
- ERR("INODE_REF was truncated\n");
- break;
- }
-
- itemlen = (UINT16)offsetof(INODE_REF, name[0]) + ir->n;
-
- if (ir->n == delir->n && RtlCompareMemory(ir->name, delir->name, ir->n) == ir->n) {
- UINT16 newlen = td->size - itemlen;
-
- changed = TRUE;
-
- if (newlen == 0)
- TRACE("deleting INODE_REF\n");
- else {
- UINT8 *newir = ExAllocatePoolWithTag(PagedPool, newlen, ALLOC_TAG), *iroff;
- tree_data* td2;
-
- if (!newir) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- TRACE("modifying INODE_REF\n");
-
- if ((UINT8*)ir > td->data) {
- RtlCopyMemory(newir, td->data, (UINT8*)ir - td->data);
- iroff = newir + ((UINT8*)ir - td->data);
- } else {
- iroff = newir;
- }
-
- if ((UINT8*)&ir->name[ir->n] < td->data + td->size)
- RtlCopyMemory(iroff, &ir->name[ir->n], td->size - ((UINT8*)&ir->name[ir->n] - td->data));
-
- td2 = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td2) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td2->key = bi->key;
- td2->size = newlen;
- td2->data = newir;
- td2->ignore = FALSE;
- td2->inserted = TRUE;
-
- InsertHeadList(td->list_entry.Blink, &td2->list_entry);
-
- t->header.num_items++;
- t->size += newlen + sizeof(leaf_node);
- t->write = TRUE;
- }
-
- break;
- }
-
- if (len > itemlen) {
- len -= itemlen;
- ir = (INODE_REF*)&ir->name[ir->n];
- } else
- break;
- } while (len > 0);
-
- if (!changed) {
- if (Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- TRACE("entry in INODE_REF not found, adding Batch_DeleteInodeExtRef entry\n");
-
- add_delete_inode_extref(Vcb, bi, listhead);
-
- *ignore = TRUE;
- return STATUS_SUCCESS;
- } else
- WARN("entry not found in INODE_REF\n");
- }
- }
-
- break;
- }
-
- case Batch_DeleteInodeExtRef: {
- if (td->size < sizeof(INODE_EXTREF)) {
- ERR("INODE_EXTREF was %u bytes, expected at least %u\n", td->size, sizeof(INODE_EXTREF));
- return STATUS_INTERNAL_ERROR;
- } else {
- INODE_EXTREF *ier, *delier;
- ULONG len;
-
- delier = (INODE_EXTREF*)bi->data;
- ier = (INODE_EXTREF*)td->data;
- len = td->size;
-
- do {
- UINT16 itemlen;
-
- if (len < sizeof(INODE_EXTREF) || len < offsetof(INODE_EXTREF, name[0]) + ier->n) {
- ERR("INODE_REF was truncated\n");
- break;
- }
-
- itemlen = (UINT16)offsetof(INODE_EXTREF, name[0]) + ier->n;
-
- if (ier->dir == delier->dir && ier->n == delier->n && RtlCompareMemory(ier->name, delier->name, ier->n) == ier->n) {
- UINT16 newlen = td->size - itemlen;
-
- if (newlen == 0)
- TRACE("deleting INODE_EXTREF\n");
- else {
- UINT8 *newier = ExAllocatePoolWithTag(PagedPool, newlen, ALLOC_TAG), *ieroff;
- tree_data* td2;
-
- if (!newier) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- TRACE("modifying INODE_EXTREF\n");
-
- if ((UINT8*)ier > td->data) {
- RtlCopyMemory(newier, td->data, (UINT8*)ier - td->data);
- ieroff = newier + ((UINT8*)ier - td->data);
- } else {
- ieroff = newier;
- }
-
- if ((UINT8*)&ier->name[ier->n] < td->data + td->size)
- RtlCopyMemory(ieroff, &ier->name[ier->n], td->size - ((UINT8*)&ier->name[ier->n] - td->data));
-
- td2 = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td2) {
- ERR("out of memory\n");
- ExFreePool(newier);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td2->key = bi->key;
- td2->size = newlen;
- td2->data = newier;
- td2->ignore = FALSE;
- td2->inserted = TRUE;
-
- InsertHeadList(td->list_entry.Blink, &td2->list_entry);
-
- t->header.num_items++;
- t->size += newlen + sizeof(leaf_node);
- t->write = TRUE;
- }
-
- break;
- }
-
- if (len > itemlen) {
- len -= itemlen;
- ier = (INODE_EXTREF*)&ier->name[ier->n];
- } else
- break;
- } while (len > 0);
- }
- break;
- }
-
- case Batch_DeleteXattr: {
- if (td->size < sizeof(DIR_ITEM)) {
- ERR("XATTR_ITEM was %u bytes, expected at least %u\n", td->size, sizeof(DIR_ITEM));
- return STATUS_INTERNAL_ERROR;
- } else {
- DIR_ITEM *di, *deldi;
- LONG len;
-
- deldi = (DIR_ITEM*)bi->data;
- di = (DIR_ITEM*)td->data;
- len = td->size;
-
- do {
- if (di->n == deldi->n && RtlCompareMemory(di->name, deldi->name, di->n) == di->n) {
- UINT16 newlen = td->size - ((UINT16)offsetof(DIR_ITEM, name[0]) + di->n + di->m);
-
- if (newlen == 0)
- TRACE("deleting XATTR_ITEM\n");
- else {
- UINT8 *newdi = ExAllocatePoolWithTag(PagedPool, newlen, ALLOC_TAG), *dioff;
- tree_data* td2;
-
- if (!newdi) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- TRACE("modifying XATTR_ITEM\n");
-
- if ((UINT8*)di > td->data) {
- RtlCopyMemory(newdi, td->data, (UINT8*)di - td->data);
- dioff = newdi + ((UINT8*)di - td->data);
- } else
- dioff = newdi;
-
- if ((UINT8*)&di->name[di->n + di->m] < td->data + td->size)
- RtlCopyMemory(dioff, &di->name[di->n + di->m], td->size - ((UINT8*)&di->name[di->n + di->m] - td->data));
-
- td2 = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td2) {
- ERR("out of memory\n");
- ExFreePool(newdi);
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td2->key = bi->key;
- td2->size = newlen;
- td2->data = newdi;
- td2->ignore = FALSE;
- td2->inserted = TRUE;
-
- InsertHeadList(td->list_entry.Blink, &td2->list_entry);
-
- t->header.num_items++;
- t->size += newlen + sizeof(leaf_node);
- t->write = TRUE;
- }
-
- break;
- }
-
- len -= sizeof(DIR_ITEM) - sizeof(char) + di->n + di->m;
- di = (DIR_ITEM*)&di->name[di->n + di->m];
-
- if (len == 0) {
- TRACE("could not find DIR_ITEM to delete\n");
- *ignore = TRUE;
- return STATUS_SUCCESS;
- }
- } while (len > 0);
- }
- break;
- }
-
- case Batch_Delete:
- break;
-
- default:
- ERR("unexpected batch operation type\n");
- return STATUS_INTERNAL_ERROR;
- }
-
- // delete old item
- if (!td->ignore) {
- td->ignore = TRUE;
-
- t->header.num_items--;
- t->size -= sizeof(leaf_node) + td->size;
- t->write = TRUE;
- }
-
- if (newtd) {
- newtd->data = bi->data;
- newtd->size = bi->datalen;
- InsertHeadList(td->list_entry.Blink, &newtd->list_entry);
- }
- } else {
- ERR("(%llx,%x,%llx) already exists\n", bi->key.obj_id, bi->key.obj_type, bi->key.offset);
- return STATUS_INTERNAL_ERROR;
- }
-
- *ignore = FALSE;
- return STATUS_SUCCESS;
-}
-
-static NTSTATUS commit_batch_list_root(_Requires_exclusive_lock_held_(_Curr_->tree_lock) device_extension* Vcb, batch_root* br, PIRP Irp) {
- LIST_ENTRY* le;
- NTSTATUS Status;
-
- TRACE("root: %llx\n", br->r->id);
-
- le = br->items.Flink;
- while (le != &br->items) {
- batch_item* bi = CONTAINING_RECORD(le, batch_item, list_entry);
- LIST_ENTRY *le2;
- traverse_ptr tp;
- KEY tree_end;
- BOOL no_end;
- tree_data *td, *listhead;
- int cmp;
- tree* t;
- BOOL ignore = FALSE;
-
- TRACE("(%llx,%x,%llx)\n", bi->key.obj_id, bi->key.obj_type, bi->key.offset);
-
- Status = find_item(Vcb, br->r, &tp, &bi->key, TRUE, Irp);
- if (!NT_SUCCESS(Status)) { // FIXME - handle STATUS_NOT_FOUND
- ERR("find_item returned %08x\n", Status);
- return Status;
- }
-
- find_tree_end(tp.tree, &tree_end, &no_end);
-
- if (bi->operation == Batch_DeleteInode) {
- if (tp.item->key.obj_id == bi->key.obj_id) {
- BOOL ended = FALSE;
-
- td = tp.item;
-
- if (!tp.item->ignore) {
- tp.item->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= tp.item->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
-
- le2 = tp.item->list_entry.Flink;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id == bi->key.obj_id) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
-
- while (!ended) {
- traverse_ptr next_tp;
-
- tp.item = td;
-
- if (!find_next_item(Vcb, &tp, &next_tp, FALSE, Irp))
- break;
-
- tp = next_tp;
-
- le2 = &tp.item->list_entry;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id == bi->key.obj_id) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
- }
- }
- } else if (bi->operation == Batch_DeleteExtentData) {
- if (tp.item->key.obj_id < bi->key.obj_id || (tp.item->key.obj_id == bi->key.obj_id && tp.item->key.obj_type < bi->key.obj_type)) {
- traverse_ptr tp2;
-
- if (find_next_item(Vcb, &tp, &tp2, FALSE, Irp)) {
- if (tp2.item->key.obj_id == bi->key.obj_id && tp2.item->key.obj_type == bi->key.obj_type) {
- tp = tp2;
- find_tree_end(tp.tree, &tree_end, &no_end);
- }
- }
- }
-
- if (tp.item->key.obj_id == bi->key.obj_id && tp.item->key.obj_type == bi->key.obj_type) {
- BOOL ended = FALSE;
-
- td = tp.item;
-
- if (!tp.item->ignore) {
- tp.item->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= tp.item->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
-
- le2 = tp.item->list_entry.Flink;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id == bi->key.obj_id && td->key.obj_type == bi->key.obj_type) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
-
- while (!ended) {
- traverse_ptr next_tp;
-
- tp.item = td;
-
- if (!find_next_item(Vcb, &tp, &next_tp, FALSE, Irp))
- break;
-
- tp = next_tp;
-
- le2 = &tp.item->list_entry;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id == bi->key.obj_id && td->key.obj_type == bi->key.obj_type) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
- }
- }
- } else if (bi->operation == Batch_DeleteFreeSpace) {
- if (tp.item->key.obj_id >= bi->key.obj_id && tp.item->key.obj_id < bi->key.obj_id + bi->key.offset) {
- BOOL ended = FALSE;
-
- td = tp.item;
-
- if (!tp.item->ignore) {
- tp.item->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= tp.item->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
-
- le2 = tp.item->list_entry.Flink;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id >= bi->key.obj_id && td->key.obj_id < bi->key.obj_id + bi->key.offset) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
-
- while (!ended) {
- traverse_ptr next_tp;
-
- tp.item = td;
-
- if (!find_next_item(Vcb, &tp, &next_tp, FALSE, Irp))
- break;
-
- tp = next_tp;
-
- le2 = &tp.item->list_entry;
- while (le2 != &tp.tree->itemlist) {
- td = CONTAINING_RECORD(le2, tree_data, list_entry);
-
- if (td->key.obj_id >= bi->key.obj_id && td->key.obj_id < bi->key.obj_id + bi->key.offset) {
- if (!td->ignore) {
- td->ignore = TRUE;
- tp.tree->header.num_items--;
- tp.tree->size -= td->size + sizeof(leaf_node);
- tp.tree->write = TRUE;
- }
- } else {
- ended = TRUE;
- break;
- }
-
- le2 = le2->Flink;
- }
- }
- }
- } else {
- if (bi->operation == Batch_Delete || bi->operation == Batch_DeleteDirItem || bi->operation == Batch_DeleteInodeRef ||
- bi->operation == Batch_DeleteInodeExtRef || bi->operation == Batch_DeleteXattr)
- td = NULL;
- else {
- td = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td->key = bi->key;
- td->size = bi->datalen;
- td->data = bi->data;
- td->ignore = FALSE;
- td->inserted = TRUE;
- }
-
- cmp = keycmp(bi->key, tp.item->key);
-
- if (cmp == -1) { // very first key in root
- if (td) {
- tree_data* paritem;
-
- InsertHeadList(&tp.tree->itemlist, &td->list_entry);
-
- paritem = tp.tree->paritem;
- while (paritem) {
- if (!keycmp(paritem->key, tp.item->key)) {
- paritem->key = bi->key;
- } else
- break;
-
- paritem = paritem->treeholder.tree->paritem;
- }
- }
- } else if (cmp == 0) { // item already exists
- if (tp.item->ignore) {
- if (td)
- InsertHeadList(tp.item->list_entry.Blink, &td->list_entry);
- } else {
- Status = handle_batch_collision(Vcb, bi, tp.tree, tp.item, td, &br->items, &ignore);
- if (!NT_SUCCESS(Status)) {
- ERR("handle_batch_collision returned %08x\n", Status);
-
- if (td)
- ExFreeToPagedLookasideList(&Vcb->tree_data_lookaside, td);
-
- return Status;
- }
- }
- } else if (td) {
- InsertHeadList(&tp.item->list_entry, &td->list_entry);
- }
-
- if (bi->operation == Batch_DeleteInodeRef && cmp != 0 && Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- add_delete_inode_extref(Vcb, bi, &br->items);
- }
-
- if (!ignore && td) {
- tp.tree->header.num_items++;
- tp.tree->size += bi->datalen + sizeof(leaf_node);
- tp.tree->write = TRUE;
-
- listhead = td;
- } else
- listhead = tp.item;
-
- while (listhead->list_entry.Blink != &tp.tree->itemlist) {
- tree_data* prevtd = CONTAINING_RECORD(listhead->list_entry.Blink, tree_data, list_entry);
-
- if (!keycmp(prevtd->key, listhead->key))
- listhead = prevtd;
- else
- break;
- }
-
- le2 = le->Flink;
- while (le2 != &br->items) {
- batch_item* bi2 = CONTAINING_RECORD(le2, batch_item, list_entry);
-
- if (bi2->operation == Batch_DeleteInode || bi2->operation == Batch_DeleteExtentData || bi2->operation == Batch_DeleteFreeSpace)
- break;
-
- if (no_end || keycmp(bi2->key, tree_end) == -1) {
- LIST_ENTRY* le3;
- BOOL inserted = FALSE;
-
- ignore = FALSE;
-
- if (bi2->operation == Batch_Delete || bi2->operation == Batch_DeleteDirItem || bi2->operation == Batch_DeleteInodeRef ||
- bi2->operation == Batch_DeleteInodeExtRef || bi2->operation == Batch_DeleteXattr)
- td = NULL;
- else {
- td = ExAllocateFromPagedLookasideList(&Vcb->tree_data_lookaside);
- if (!td) {
- ERR("out of memory\n");
- return STATUS_INSUFFICIENT_RESOURCES;
- }
-
- td->key = bi2->key;
- td->size = bi2->datalen;
- td->data = bi2->data;
- td->ignore = FALSE;
- td->inserted = TRUE;
- }
-
- le3 = &listhead->list_entry;
- while (le3 != &tp.tree->itemlist) {
- tree_data* td2 = CONTAINING_RECORD(le3, tree_data, list_entry);
-
- cmp = keycmp(bi2->key, td2->key);
-
- if (cmp == 0) {
- if (td2->ignore) {
- if (td) {
- InsertHeadList(le3->Blink, &td->list_entry);
- inserted = TRUE;
- } else if (bi2->operation == Batch_DeleteInodeRef && Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- add_delete_inode_extref(Vcb, bi2, &br->items);
- }
- } else {
- Status = handle_batch_collision(Vcb, bi2, tp.tree, td2, td, &br->items, &ignore);
- if (!NT_SUCCESS(Status)) {
- ERR("handle_batch_collision returned %08x\n", Status);
- return Status;
- }
- }
-
- inserted = TRUE;
- break;
- } else if (cmp == -1) {
- if (td) {
- InsertHeadList(le3->Blink, &td->list_entry);
- inserted = TRUE;
- } else if (bi2->operation == Batch_DeleteInodeRef && Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- add_delete_inode_extref(Vcb, bi2, &br->items);
- }
- break;
- }
-
- le3 = le3->Flink;
- }
-
- if (td) {
- if (!inserted)
- InsertTailList(&tp.tree->itemlist, &td->list_entry);
-
- if (!ignore) {
- tp.tree->header.num_items++;
- tp.tree->size += bi2->datalen + sizeof(leaf_node);
-
- listhead = td;
- }
- } else if (!inserted && bi2->operation == Batch_DeleteInodeRef && Vcb->superblock.incompat_flags & BTRFS_INCOMPAT_FLAGS_EXTENDED_IREF) {
- add_delete_inode_extref(Vcb, bi2, &br->items);
- }
-
- while (listhead->list_entry.Blink != &tp.tree->itemlist) {
- tree_data* prevtd = CONTAINING_RECORD(listhead->list_entry.Blink, tree_data, list_entry);
-
- if (!keycmp(prevtd->key, listhead->key))
- listhead = prevtd;
- else
- break;
- }
-
- le = le2;
- } else
- break;
-
- le2 = le2->Flink;
- }
-
- t = tp.tree;
- while (t) {
- if (t->paritem && t->paritem->ignore) {
- t->paritem->ignore = FALSE;
- t->parent->header.num_items++;
- t->parent->size += sizeof(internal_node);
- }
-
- t->header.generation = Vcb->superblock.generation;
- t = t->parent;
- }
- }
-
- le = le->Flink;
- }
-
- // FIXME - remove as we are going along
- while (!IsListEmpty(&br->items)) {
- batch_item* bi = CONTAINING_RECORD(RemoveHeadList(&br->items), batch_item, list_entry);
-
- if ((bi->operation == Batch_DeleteDirItem || bi->operation == Batch_DeleteInodeRef ||
- bi->operation == Batch_DeleteInodeExtRef || bi->operation == Batch_DeleteXattr) && bi->data)
- ExFreePool(bi->data);
-
- ExFreeToPagedLookasideList(&Vcb->batch_item_lookaside, bi);
- }
-
- return STATUS_SUCCESS;
-}
-
-NTSTATUS commit_batch_list(_Requires_exclusive_lock_held_(_Curr_->tree_lock) device_extension* Vcb, LIST_ENTRY* batchlist, PIRP Irp) {
- NTSTATUS Status;
-
- while (!IsListEmpty(batchlist)) {
- LIST_ENTRY* le = RemoveHeadList(batchlist);
- batch_root* br2 = CONTAINING_RECORD(le, batch_root, list_entry);
-
- Status = commit_batch_list_root(Vcb, br2, Irp);
- if (!NT_SUCCESS(Status)) {
- ERR("commit_batch_list_root returned %08x\n", Status);
- return Status;
- }
-
- ExFreePool(br2);
- }
-
- return STATUS_SUCCESS;
-}
projects / reactos.git / blobdiff