/haiku-fatelf/headers/private/net/ |
H A D | net_routing_info.h | 10 void *root; member in struct:net_routing_info
|
/haiku-fatelf/src/libs/print/libgutenprint/src/main/ |
H A D | xmlppd.h | 24 extern stp_mxml_node_t *stpi_xmlppd_find_group_named(stp_mxml_node_t *root, const char *name); 26 extern stp_mxml_node_t *stpi_xmlppd_find_group_index(stp_mxml_node_t *root, int idx); 28 extern int stpi_xmlppd_find_group_count(stp_mxml_node_t *root); 30 extern stp_mxml_node_t *stpi_xmlppd_find_option_named(stp_mxml_node_t *root, const char *name); 32 extern stp_mxml_node_t *stpi_xmlppd_find_option_index(stp_mxml_node_t *root, int idx); 34 extern int stpi_xmlppd_find_option_count(stp_mxml_node_t *root); 42 extern stp_mxml_node_t *stpi_xmlppd_find_page_size(stp_mxml_node_t *root, const char *name);
|
H A D | xmlppd.c | 52 find_element_named(stp_mxml_node_t *root, const char *name, const char *what) argument 55 if (root && name) 57 for (element = stp_mxmlFindElement(root, root, what, NULL, NULL, 60 element = stp_mxmlFindElement(element, root, what, NULL, NULL, 71 find_element_index(stp_mxml_node_t *root, int idx, const char *what) argument 75 if (root && idx >= 0) 77 for (element = stp_mxmlFindElement(root, root, what, NULL, NULL, 80 element = stp_mxmlFindElement(element, root, wha 91 find_element_count(stp_mxml_node_t *root, const char *what) argument 108 stpi_xmlppd_find_group_named(stp_mxml_node_t *root, const char *name) argument 114 stpi_xmlppd_find_group_index(stp_mxml_node_t *root, int idx) argument 120 stpi_xmlppd_find_group_count(stp_mxml_node_t *root) argument 126 stpi_xmlppd_find_option_named(stp_mxml_node_t *root, const char *name) argument 132 stpi_xmlppd_find_option_index(stp_mxml_node_t *root, int idx) argument 138 stpi_xmlppd_find_option_count(stp_mxml_node_t *root) argument 162 stpi_xmlppd_find_page_size(stp_mxml_node_t *root, const char *name) argument [all...] |
/haiku-fatelf/src/bin/bash/lib/intl/ |
H A D | os2compat.c | 53 char *root = getenv ("UNIXROOT"); local 59 if (root) 61 size_t sl = strlen (root); 63 memcpy (_nlos2_libdir, root, sl); 73 if (root) 75 size_t sl = strlen (root); 77 memcpy (_nlos2_localealiaspath, root, sl); 87 if (root) 89 size_t sl = strlen (root); 91 memcpy (_nlos2_localedir, root, s [all...] |
/haiku-fatelf/src/bin/gawk/intl/ |
H A D | os2compat.c | 51 char *root = getenv ("UNIXROOT"); local 57 if (root) 59 size_t sl = strlen (root); 61 memcpy (_nlos2_libdir, root, sl); 71 if (root) 73 size_t sl = strlen (root); 75 memcpy (_nlos2_localealiaspath, root, sl); 85 if (root) 87 size_t sl = strlen (root); 89 memcpy (_nlos2_localedir, root, s [all...] |
/haiku-fatelf/headers/private/kernel/platform/openfirmware/ |
H A D | devices.h | 15 status_t of_get_next_device(int *_cookie, int root, const char *type,
|
/haiku-fatelf/src/bin/gdb/bfd/ |
H A D | i386linux.c | 155 struct aout_link_hash_entry root; 160 struct aout_link_hash_table root; 235 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 247 return &ret->root.root; 254 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\ 261 (&(table)->root, \ 375 && (h->root.root.type == bfd_link_hash_defined 376 || h->root 154 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry 159 struct aout_link_hash_table root; member in struct:linux_link_hash_table [all...] |
H A D | m68klinux.c | 156 struct aout_link_hash_entry root; 161 struct aout_link_hash_table root; 239 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 251 return &ret->root.root; 258 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\ 265 (&(table)->root, \ 379 && (h->root.root.type == bfd_link_hash_defined 380 || h->root 155 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry 160 struct aout_link_hash_table root; member in struct:linux_link_hash_table [all...] |
H A D | sparclinux.c | 155 struct aout_link_hash_entry root; member in struct:linux_link_hash_entry 160 struct aout_link_hash_table root; member in struct:linux_link_hash_table 235 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 247 return &ret->root.root; 254 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\ 261 (&(table)->root, \ 375 && (h->root.root.type == bfd_link_hash_defined 376 || h->root [all...] |
H A D | genlink.h | 43 struct bfd_link_hash_entry root; member in struct:generic_link_hash_entry 54 struct bfd_link_hash_table root; member in struct:generic_link_hash_table 61 bfd_link_hash_lookup (&(table)->root, (string), (create), (copy), (follow))) 67 (&(table)->root, \
|
H A D | sunos.c | 609 struct aout_link_hash_entry root; 649 struct aout_link_hash_table root; 724 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd, 740 return &ret->root.root; 747 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\ 754 (&(table)->root, \ 1146 && h->root.root.type != bfd_link_hash_new 1147 && h->root 608 struct aout_link_hash_entry root; member in struct:sunos_link_hash_entry 648 struct aout_link_hash_table root; member in struct:sunos_link_hash_table [all...] |
/haiku-fatelf/src/bin/coreutils/man/ |
H A D | chroot.x | 2 chroot \- run command or interactive shell with special root directory
|
/haiku-fatelf/src/system/libroot/posix/glibc/misc/ |
H A D | tsearch.c | 32 1. The number of black edges on every path from the root to a leaf is 44 meaningless for the root node, but we color the root node black for 64 error upwards towards the root, so that the subtree that does not have 130 check_tree (node root) argument 134 if (root == NULL) 136 root->red = 0; 137 for(p = root->left; p; p = p->left) 139 check_tree_recurse (root, 0, cnt); 159 node root local 259 node root = *rootp; local 317 node root = *rootp; variable 340 node root, unchained; local 598 const_node root = (const_node) vroot; local 621 const_node root = (const_node) vroot; local 635 tdestroy_recurse(node root, __free_fn_t freefct) argument 649 node root = (node) vroot; local [all...] |
/haiku-fatelf/src/system/boot/loader/file_systems/fat/ |
H A D | fatfs.cpp | 26 // calculate root block position (it depends on the block size) 37 RootBlock root(buffer, blockSize); 38 if (root.ValidateCheckSum() < B_OK) 41 //printf("primary = %ld, secondary = %ld\n", root.PrimaryType(), root.SecondaryType()); 42 if (!root.IsRootBlock())
|
/haiku-fatelf/src/libs/compat/freebsd_network/ |
H A D | driver.c | 54 device_t root = device_add_child(NULL, NULL, 0); local 55 if (root == NULL) 58 root->softc = malloc(sizeof(struct root_device_softc)); 59 if (root->softc == NULL) { 60 device_delete_child(NULL, root); 64 root->driver = &sRootDriver; 65 root->root = root; 67 child = device_add_child(root, drive 102 device_t child, root; local 192 device_t root, device; local [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
H A D | PackageFSRoot.cpp | 28 mutex PackageFSRoot::sRootListLock = MUTEX_INITIALIZER("packagefs root list"); 39 rw_lock_init(&fLock, "packagefs root"); 90 // Unless the volume is custom mounted, we stat the supposed root directory. 91 // Get the volume mount point relative path to the root directory depending 113 dprintf("packagefs: Failed to get root directory \"%s\": %s\n", 123 dprintf("packagefs: Failed to stat root directory \"%s\": %s\n", 128 // get/create the root 129 PackageFSRoot* root; local 130 error = PackageFSRoot::_GetOrCreateRoot(st.st_dev, st.st_ino, root); 135 error = root 145 PackageFSRoot* root = new(std::nothrow) PackageFSRoot(-1, 0); local 407 PackageFSRoot* root = new(std::nothrow) PackageFSRoot(deviceID, nodeID); local 448 _PutRoot(PackageFSRoot* root) argument [all...] |
/haiku-fatelf/src/bin/gdb/libiberty/ |
H A D | splay-tree.c | 120 /* NODE is the root. We are done. */ 124 *PARENT is the root of the tree.) */ 195 if (sp->root == 0) 198 splay_tree_splay_helper (sp, key, &sp->root, 282 sp->root = 0; 299 splay_tree_delete_helper (sp, sp->root); 317 if (sp->root) 318 comparison = (*sp->comp)(sp->root->key, key); 320 if (sp->root && comparison == 0) 322 /* If the root o [all...] |
/haiku-fatelf/src/bin/coreutils/src/ |
H A D | tsort.c | 124 search_item (struct item *root, const char *str) 129 assert (root); 133 if (root->right == NULL) 134 return (root->right = new_item (str)); 137 t = root; 138 s = p = root->right; 401 recurse_tree (struct item *root, bool (*action) (struct item *)) 403 if (root->left == NULL && root->right == NULL) 404 return (*action) (root); 123 search_item(struct item *root, const char *str) argument 400 recurse_tree(struct item *root, bool (*action) (struct item *)) argument 423 walk_tree(struct item *root, bool (*action) (struct item *)) argument 435 struct item *root; local [all...] |
/haiku-fatelf/src/bin/bc/bc/ |
H A D | util.c | 396 int insert_id_rec (root, new_id) 397 id_rec **root; 402 /* If root is NULL, this where it is to be inserted. */ 403 if (*root == NULL) 405 *root = new_id; 413 if (strcmp (new_id->id, (*root)->id) < 0) 416 if (insert_id_rec (&((*root)->left), new_id)) 419 (*root)->balance --; 421 switch ((*root)->balance) 428 A = *root; [all...] |
/haiku-fatelf/src/system/boot/loader/ |
H A D | RootFileSystem.cpp | 26 entry->root->Release(); 63 entry->root->Acquire(); 64 return entry->root; 74 if (entry->root->GetName(entryName, sizeof(entryName)) != B_OK) 78 entry->root->Acquire(); 79 return entry->root; 95 return entry->root->GetName(name, size); 109 *_node = entry->root; 142 entry->root = volume; 160 entry->root [all...] |
/haiku-fatelf/src/build/libbe/storage/mime/ |
H A D | MimeUpdateThread.cpp | 62 BMessenger managerMessenger, const entry_ref *root, bool recursive, 65 ,*/ fRoot(root ? *root : entry_ref()) 69 , fStatus(root ? B_OK : B_BAD_VALUE) 61 MimeUpdateThread(const char *name, int32 priority, BMessenger managerMessenger, const entry_ref *root, bool recursive, int32 force, BMessage *replyee) argument
|
/haiku-fatelf/src/system/kernel/platform/openfirmware/ |
H A D | openfirmware_devices.cpp | 15 * If a root != 0 is given, the function only traverses the subtree spanned 16 * by the root (inclusively). Otherwise the whole device tree is searched. 21 of_get_next_device(int *_cookie, int root, const char *type, char *path, argument 31 // If a root was supplied, we take that, otherwise the device tree 32 // root. 33 if (root != 0) 34 node = root; 43 // We want to visit the root first. 65 if (next == root || next == 0) {
|
/haiku-fatelf/src/libs/zlib/ |
H A D | inftrees.c | 28 requested root table index bits, and on return it is the actual root 43 unsigned root; /* number of index bits for root table */ local 51 unsigned low; /* low bits for current root entry */ 52 unsigned mask; /* mask for low root bits */ 112 /* bound code lengths, force root to be within code lengths */ 113 root = *bits; 116 if (root > max) root [all...] |
/haiku-fatelf/headers/posix/ |
H A D | search.h | 45 extern void *tfind(const void *key, void *const *root, 49 extern void twalk(const void *root,
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/server-Windows/ |
H A D | ubi_SplayTree.cpp | 202 if( parentp ) /* If no parent, then we're already the root. */
229 * Move the node indicated by SplayWithMe to the root of the tree by
234 * Output: A pointer to the root of the splay tree (i.e., the same as
268 * the root of the tree to which NewNode is to be added.
315 RootPtr->root = Splay( NewNode );
320 RootPtr->root = Splay( (*OldNode) );
342 (void)Splay( DeadNode ); /* Move dead node to root. */
347 p->Link[ubi_trPARENT] = NULL; /* Left subtree node becomes root.*/
353 RootPtr->root = Splay( p ); /* Resplay at p. */
359 p->Link[ubi_trPARENT] = NULL; /* Right subtree root become [all...] |