/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/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/drivers/network/wlan/iprowifi3945/dev/wpi/ |
H A D | if_wpi.c | 588 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local 590 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | CheckVisitor.h | 51 BPlusTree* tree, Inode* inode,
|
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 | 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...] |
/haiku/src/bin/bfs_tools/ |
H A D | bfsinfo.cpp | 226 "\t-b\tdump b+tree\n" 227 "\t-c\tlist b+tree leaves\n" 228 "\t-c\tcount b+tree leaves\n" 229 "\t-v\tvalidate b+tree\n" 422 BPlusTree *tree; local 423 if (((Directory *)inode)->GetTree(&tree) == B_OK) { 424 if (tree->Validate(true) < B_OK)
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | BPlusTree.cpp | 48 NodeCache::NodeCache(BPlusTree *tree) argument 50 fTree(tree) 141 // initialize b+tree header 228 // validates the on-disk b+tree 254 printf(" %" B_PRId32 " B+tree node(s) processed (%" B_PRId32 712 // /* mark all as well with tree */ 1008 // the tree is most likely dead
|
H A D | Inode.h | 175 status_t GetTree(BPlusTree **tree);
|
/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/ |
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/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/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/atheros81xx/dev/ale/ |
H A D | if_ale.c | 786 struct sysctl_oid *tree; local 849 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD, 851 parent = SYSCTL_CHILDREN(tree); 854 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD, 856 child = SYSCTL_CHILDREN(tree); 908 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD, 910 child = SYSCTL_CHILDREN(tree);
|
/haiku/src/add-ons/kernel/drivers/network/ether/broadcom570x/dev/bge/ |
H A D | if_bge.c | 6331 struct sysctl_oid *tree; local 6334 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "stats", 6336 schildren = children = SYSCTL_CHILDREN(tree); 6369 tree = SYSCTL_ADD_NODE(ctx, schildren, OID_AUTO, "rx", 6371 children = SYSCTL_CHILDREN(tree); 6405 tree = SYSCTL_ADD_NODE(ctx, schildren, OID_AUTO, "tx", 6407 children = SYSCTL_CHILDREN(tree); 6460 struct sysctl_oid *tree; local 6465 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "stats", 6467 schild = child = SYSCTL_CHILDREN(tree); [all...] |
/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/ipro100/dev/fxp/ |
H A D | if_fxp.c | 3149 struct sysctl_oid *tree; local 3178 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD, 3180 parent = SYSCTL_CHILDREN(tree); 3183 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD, 3185 child = SYSCTL_CHILDREN(tree); 3211 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD, 3213 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);
|
/haiku/src/add-ons/kernel/drivers/network/ether/jmicron2x0/dev/jme/ |
H A D | if_jme.c | 988 struct sysctl_oid *tree; local 1087 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD, 1089 parent = SYSCTL_CHILDREN(tree); 1092 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "rx", CTLFLAG_RD, 1094 child = SYSCTL_CHILDREN(tree); 1109 tree = SYSCTL_ADD_NODE(ctx, parent, OID_AUTO, "tx", CTLFLAG_RD, 1111 child = SYSCTL_CHILDREN(tree);
|
/haiku/src/add-ons/kernel/drivers/network/ether/marvell_yukon/dev/msk/ |
H A D | if_msk.c | 4509 struct sysctl_oid *tree; local 4514 tree = SYSCTL_ADD_NODE(ctx, child, OID_AUTO, "stats", CTLFLAG_RD, 4516 schild = SYSCTL_CHILDREN(tree); 4517 tree = SYSCTL_ADD_NODE(ctx, schild, OID_AUTO, "rx", CTLFLAG_RD, 4519 child = SYSCTL_CHILDREN(tree); 4555 tree = SYSCTL_ADD_NODE(ctx, schild, OID_AUTO, "tx", CTLFLAG_RD, 4557 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);
|