/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Inode.cpp | 403 BTree* tree = path->Tree(); local 413 status_t status = tree->InsertEntries(transaction, path, &item, data, 1); 426 BTree* tree = path->Tree(); local 431 status_t status = tree->RemoveEntries(transaction, path, key, NULL, 1); 446 BTree* tree = fVolume->FSTree(); local 464 status_t status = tree->InsertEntries(transaction, path, &entry, 490 status = tree->InsertEntries(transaction, path, &entry, 501 status = tree->InsertEntries(transaction, path, &entry, 518 BTree* tree = path->Tree(); local 526 status_t status = tree [all...] |
H A D | BTree.cpp | 300 BTree::Path::Path(BTree* tree) argument 302 fTree(tree) 515 mutex_init(&fIteratorLock, "btrfs b+tree iterator"); 525 mutex_init(&fIteratorLock, "btrfs b+tree iterator"); 534 mutex_init(&fIteratorLock, "btrfs b+tree iterator"); 541 // (can happen when the tree's inode gets deleted while 542 // traversing the tree - a TreeIterator doesn't lock the inode) 889 TreeIterator::TreeIterator(BTree* tree, const btrfs_key& key) argument 891 fTree(tree), 895 tree [all...] |
H A D | ExtentAllocator.cpp | 56 const char* extentType = "allocated tree block"; 58 extentType = "free tree block"; 104 * created by existed allocated extents in the tree 430 BlockGroup::LoadExtent(CachedExtentTree* tree, bool inverse) argument 476 _InsertExtent(tree, insert); 481 _InsertExtent(tree, start, End() - start, flags); 488 BlockGroup::_InsertExtent(CachedExtentTree* tree, uint64 start, uint64 length, argument 492 return _InsertExtent(tree, extent); 497 BlockGroup::_InsertExtent(CachedExtentTree* tree, CachedExtent* extent) argument 502 status_t status = tree [all...] |
/haiku/src/kits/interface/ |
H A D | OutlineListView.cpp | 659 // This method is quite complicated: basically, it creates a real tree 665 BList* tree = _BuildTree(superItem, lastIndex); local 667 _SortTree(tree, oneLevelOnly, compareFunc); 670 _PopulateTree(tree, fFullList, firstIndex, false); 677 _PopulateTree(tree, fList, lastIndex, true); 693 _DestructTree(tree); 979 BOutlineListView::_PopulateTree(BList* tree, BList& target, argument 983 int32 count = tree->CountItems(); 986 BListItem* item = (BListItem*)tree->ItemAtFast(index); 999 BOutlineListView::_SortTree(BList* tree, boo argument 1019 _DestructTree(BList* tree) argument [all...] |
/haiku/headers/os/interface/ |
H A D | OutlineListView.h | 125 void _PopulateTree(BList* tree, BList& target, 127 void _SortTree(BList* tree, bool oneLevelOnly, 130 void _DestructTree(BList* tree);
|
/haiku/src/libs/compat/openbsd_wlan/net80211/ |
H A D | ieee80211_node.c | 45 #include <sys/tree.h> 1551 * ic_bss to check HT. The nodes tree was re-populated 3276 * Compare nodes in the tree by lladdr 3286 * Compare nodes in the tree by essid 3296 * Generate red-black tree function logic
|
H A D | ieee80211_node.h | 36 #include <sys/tree.h>
|
H A D | ieee80211_ioctl.c | 42 #include <sys/tree.h>
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Inode.cpp | 240 BPlusTree* tree = new(std::nothrow) BPlusTree(*fTransaction, fInode); local 241 if (tree == NULL) 244 status_t status = tree->InitCheck(); 246 delete tree; 250 fInode->fTree = tree; 253 if (tree->Insert(*fTransaction, ".", fInode->ID()) < B_OK 254 || tree->Insert(*fTransaction, "..", 448 // inodes that have a B+tree 454 FATAL(("inode tree at block %" B_PRIdOFF " corrupt!\n", 964 doesn't change it in the parent directory's b+tree 1323 BPlusTree* tree = attributes->Tree(); local 2628 BPlusTree* tree = NULL; local 2936 BPlusTree* tree = fAttributes->Tree(); local [all...] |
H A D | BPlusTree.cpp | 130 TreeCheck(BPlusTree* tree) argument 134 fNodeSize(tree->NodeSize()), 135 fMaxLevels(tree->fHeader.MaxNumberOfLevels()), 137 fVisited(tree->Stream()->Size() / tree->NodeSize()), 138 fVisitedFragment(tree->Stream()->Size() / tree->NodeSize()) 141 sizeof(off_t) * tree->fHeader.MaxNumberOfLevels()); 274 // The B+tree header has been updated - we need to update the 308 // even access the b+tree heade 2559 TreeIterator(BPlusTree* tree) argument [all...] |
H A D | kernel_interface.cpp | 601 BPlusTree* tree = directory->Tree(); local 602 if (tree == NULL) 605 status = tree->Find((uint8*)file, (uint16)strlen(file), _vnodeID); 1196 // Get the directory's tree, and a pointer to the inode which should be 1198 BPlusTree* tree = oldDirectory->Tree(); 1199 if (tree == NULL) 1203 status = tree->Find((const uint8*)oldName, strlen(oldName), &id); 1241 BPlusTree* newTree = tree; 1300 status = tree->Remove(transaction, (const uint8*)oldName, 1306 // in its tree i 1717 BPlusTree* tree = inode->Tree(); local [all...] |
H A D | CheckVisitor.cpp | 211 // check if the inode's name is the same as in the b+tree 225 FATAL(("Names differ: tree \"%s\", inode \"%s\"\n", treeName, 300 // Check the B+tree as well 353 // Remove inode from the tree if we can 371 FATAL(("Could not open b+tree from inode at %" B_PRIdOFF "\n", 380 // Iterating over the B+tree failed - we let the checkfs run 390 CheckVisitor::_RemoveInvalidNode(Inode* parent, BPlusTree* tree, argument 409 status = tree->Find((uint8*)name, (uint16)strlen(name), &id); 411 status = tree->Remove(transaction, name, id); 692 BPlusTree* tree local 738 BPlusTree* tree = index->inode->Tree(); local [all...] |
/haiku/ |
H A D | configure | 584 echo Additionally, if the source tree was cloned with a too-restrictive umask, 629 echo "The source tree was cloned with a umask > 0022. It seems you" 631 echo source tree. Try running:
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/ |
H A D | test.cpp | 85 // dump the tree 89 // in any case, write the tree back to disk 322 checkTreeContents(BPlusTree* tree) argument 328 TreeIterator iterator(tree); 338 printf("\ninvalid value %lld in tree: ", value); 350 printf("\nkeys don't match (key index = %lld, %ld times in tree, " 383 checkTreeIntegrity(BPlusTree* tree) argument 385 TreeIterator iterator(tree); 402 checkTree(BPlusTree* tree) argument 405 printf("* Check tree 423 addAllKeys(Transaction& transaction, BPlusTree* tree) argument 443 removeAllKeys(Transaction& transaction, BPlusTree* tree) argument 467 duplicateTest(Transaction& transaction, BPlusTree* tree) argument 538 addRandomSet(Transaction& transaction, BPlusTree* tree, int32 num) argument 571 removeRandomSet(Transaction& transaction, BPlusTree* tree, int32 num) argument [all...] |
/haiku/src/bin/bfs_tools/lib/ |
H A D | Inode.cpp | 1297 Directory::GetTree(BPlusTree **tree) argument 1304 *tree = fTree;
|
/haiku/src/bin/bfs_tools/ |
H A D | recover.cpp | 616 BPlusTree *tree; local 617 if (directory->GetTree(&tree) == B_OK && tree->Validate(gVerbose) == B_OK) { 670 BPlusTree *tree; local 671 if (dir->GetTree(&tree) < B_OK) 677 while (tree->GetNextEntry(name, &length, B_FILE_NAME_LENGTH, 687 //tree->WriteTo(dir);
|
H A D | chkindex.cpp | 145 checkIndexForNonExistingFiles(Disk &disk,BPlusTree &tree) argument 151 while (tree.GetNextEntry(name,&length,B_FILE_NAME_LENGTH,&offset) == B_OK) 158 switch (tree.Type()) 189 checkFiles(Disk &disk,BPlusTree &tree,char *attribute) argument 278 if (tree.Find((uint8 *)key,keyLength,&value) < B_OK) 335 tree.Rewind(); 336 while (tree.GetNextEntry(name,&length,B_FILE_NAME_LENGTH,&offset) == B_OK) 378 BPlusTree *tree; local 379 if (index->GetTree(&tree) < B_OK || tree 494 BPlusTree *tree; local [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.cpp | 43 \brief Represents a path in the tree. 133 \brief Store information about one element in a tree path. 164 A TreeIterator is usually initialized to the root node of the tree 165 and can be used to navigate and search in the tree. 169 TreeIterator::TreeIterator(Tree *tree) argument 174 SetTo(tree); 185 TreeIterator::SetTo(Tree *tree) argument 188 fTree = tree; 195 fPath = new(nothrow) TreePath(tree->GetTreeHeight()); 423 index pushed onto the tree pat 538 ItemIterator(Tree *tree) argument 546 SetTo(Tree *tree) argument 828 ObjectItemIterator(Tree *tree, uint32 dirID, uint32 objectID, uint64 startOffset) argument 853 SetTo(Tree *tree, uint32 dirID, uint32 objectID, uint64 startOffset) argument 1057 DirEntryIterator(Tree *tree, uint32 dirID, uint32 objectID, uint64 startOffset, bool fixedHash) argument 1084 SetTo(Tree *tree, uint32 dirID, uint32 objectID, uint64 startOffset, bool fixedHash) argument 1262 StreamReader(Tree *tree, uint32 dirID, uint32 objectID) argument 1285 SetTo(Tree *tree, uint32 dirID, uint32 objectID) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/websearchfs/ |
H A D | query.c | 103 static const char *parse_qs_r(const char *query, query_exp *tree) 110 status_t query_parse(const char *query, query_exp **tree) argument 143 void dump_query_tree(query_exp *tree, int indent) argument 146 if (!tree) 148 if (tree->op >= B_AND) { 150 printf(": %s {\n", strqop(tree->op)); 151 dump_query_tree(tree->lv.exp, indent+1); 152 dump_query_tree(tree->rv.exp, indent+1); 157 printf(": {%s} %s {%s}\n", tree->lv.str, strqop(tree 164 query_exp *tree; local [all...] |
H A D | query.h | 59 extern status_t query_parse(const char *query, query_exp **tree);
|
/haiku/src/add-ons/kernel/drivers/network/ether/intel22x/dev/igc/ |
H A D | if_igc.c | 2452 struct sysctl_oid *tree = device_get_sysctl_tree(dev); local 2453 struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);
|
/haiku/src/add-ons/kernel/drivers/network/ether/nforce/dev/nfe/ |
H A D | if_nfe.c | 3122 struct sysctl_oid *tree; local 3151 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD, 3153 parent = SYSCTL_CHILDREN(tree); 3156 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD, 3158 child = SYSCTL_CHILDREN(tree); 3194 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD, 3196 child = SYSCTL_CHILDREN(tree);
|
/haiku/src/libs/compat/openbsd_wlan/ |
H A D | subr_tree.c | 44 #include <sys/tree.h>
|
/haiku/src/add-ons/kernel/drivers/network/ether/atheros813x/dev/alc/ |
H A D | if_alc.c | 1744 struct sysctl_oid *tree; local 1802 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", 1804 parent = SYSCTL_CHILDREN(tree); 1807 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", 1809 child = SYSCTL_CHILDREN(tree); 1861 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", 1863 child = SYSCTL_CHILDREN(tree);
|
/haiku/src/add-ons/kernel/drivers/network/ether/ipro1000/dev/e1000/ |
H A D | if_em.c | 4229 struct sysctl_oid *tree = device_get_sysctl_tree(dev); local 4230 struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree);
|