/haiku/headers/cpp/ |
H A D | map.h | 30 #include <tree.h>
|
H A D | multimap.h | 30 #include <tree.h>
|
H A D | multiset.h | 30 #include <tree.h>
|
H A D | set.h | 30 #include <tree.h>
|
/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/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/headers/private/kernel/util/ |
H A D | MinMaxHeap.h | 310 Element** tree = link->fMinTree ? fMinElements : fMaxElements; 312 tree[lastElement] = element; 351 Element** tree = link->fMinTree ? fMinElements : fMaxElements; 357 bool isSmaller = sCompare(link->fKey, sGetLink(tree[parent])->fKey); 359 ASSERT(sGetLink(tree[parent])->fIndex == parent); 360 sGetLink(tree[parent])->fIndex = link->fIndex; 362 Element* element = tree[link->fIndex]; 363 tree[link->fIndex] = tree[parent]; 364 tree[paren [all...] |
H A D | SplayTree.h | 15 SplayTree: A top-down splay tree. 60 Insert into the tree. 123 Remove from the tree. 149 Find the smallest item in the tree. 167 Find the largest item in the tree. 185 Find an item in the tree. 203 Test if the tree is logically empty. 269 If key is in the tree, then the node containing 270 that key becomes the root. If key is not in the tree, 272 < key in the tree, o 372 Iterator(Tree* tree) argument 379 Iterator(Tree* tree, Node* next) argument 446 ConstIterator(const Tree* tree) argument 453 ConstIterator(const Tree* tree, Node* next) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.h | 81 TreeIterator(Tree *tree); 84 status_t SetTo(Tree *tree); 125 ItemIterator(Tree *tree); 127 status_t SetTo(Tree *tree); 154 ObjectItemIterator(Tree *tree, uint32 dirID, uint32 objectID, 157 status_t SetTo(Tree *tree, uint32 dirID, uint32 objectID, 186 DirEntryIterator(Tree *tree, uint32 dirID, uint32 objectID, 189 status_t SetTo(Tree *tree, uint32 dirID, uint32 objectID, 219 StreamReader(Tree *tree, uint32 dirID, uint32 objectID); 221 status_t SetTo(Tree *tree, uint3 [all...] |
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/drivers/network/wlan/atheroswifi/dev/ath/ |
H A D | if_ath_sysctl.c | 787 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 789 struct sysctl_oid_list *child = SYSCTL_CHILDREN(tree); 791 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "alq", 794 child = SYSCTL_CHILDREN(tree); 799 SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 803 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 807 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 817 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 820 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 823 SYSCTL_ADD_UINT(ctx, SYSCTL_CHILDREN(tree), OID_AUT 1029 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1048 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1066 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 1318 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local [all...] |
/haiku/src/bin/bfs_tools/ |
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/system/libroot/posix/glibc/regex/ |
H A D | regcomp.c | 797 /* Parse the regular expression, and build a structure tree. */ 803 /* Analyze the tree and create the nfa. */ 1115 /* Analyze the structure tree, and calculate "first", "next", "edest", 1179 implement parse tree visits. Instead, we use parent pointers and 1189 /* Descend down the tree, preferably to the left (or to the right 1304 bin_tree_t *op, *cls, *tree1, *tree; 1322 tree = create_tree (dfa, op, tree1, CONCAT); 1323 if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0)) 1331 return tree; 1357 /* Pass 2: compute NEXT on the tree 1297 bin_tree_t *op, *cls, *tree1, *tree; local 2069 bin_tree_t *tree, *eor, *root; local 2103 bin_tree_t *tree, *branch = NULL; local 2143 bin_tree_t *tree, *exp; local 2184 bin_tree_t *tree; local 2400 bin_tree_t *tree; local 2437 bin_tree_t *tree = NULL, *old_tree = NULL; local 3554 bin_tree_t *tree; local 3707 bin_tree_t *tree; local [all...] |
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Index.cpp | 77 BPlusTree* tree = indices->Tree(); local 78 if (tree == NULL) 82 status_t status = tree->Find((uint8*)name, (uint16)strlen(name), &id); 214 inserted into the tree. 253 BPlusTree* tree = Node()->Tree(); 254 if (tree == NULL) 257 // remove the old key from the tree 264 status = tree->Remove(transaction, (const uint8*)oldKey, oldLength, 273 // add the new key to the tree 276 status = tree [all...] |
H A D | FileSystemVisitor.cpp | 81 BPlusTree* tree = inode->Tree(); local 82 if (tree == NULL) { 92 fIterator = new(std::nothrow) TreeIterator(tree); 121 // iterating over the B+tree failed 310 /*! Called when opening a b+tree fails.
|
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...] |
H A D | CheckVisitor.h | 51 BPlusTree* tree, Inode* inode,
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | ExtentAllocator.h | 115 status_t LoadExtent(CachedExtentTree* tree, 126 status_t _InsertExtent(CachedExtentTree* tree, 128 status_t _InsertExtent(CachedExtentTree* tree,
|
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 | 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/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/amrr/ |
H A D | amrr.c | 443 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 445 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 449 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 452 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_rate/onoe/ |
H A D | onoe.c | 406 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 408 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 412 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO, 415 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|