Searched refs:leaf (Results 1 - 25 of 39) sorted by path

12

/haiku/headers/build/private/kernel/
H A Dsyscalls.h53 const char *leaf, char *userPath, size_t pathLength);
/haiku/headers/os/storage/
H A DPath.h26 BPath(const char* dir, const char* leaf = NULL,
29 const char* leaf = NULL,
38 status_t SetTo(const char* path, const char* leaf = NULL,
41 const char* leaf = NULL,
/haiku/headers/posix/
H A Dsearch.h26 leaf enumerator in enum:__anon2
/haiku/headers/private/storage/
H A Dstorage_support.h35 status_t parse_path(const char *fullPath, char *dirPath, char *leaf);
37 //! splits a path name into directory path and leaf name
38 status_t split_path(const char *fullPath, char *&path, char *&leaf);
40 //! splits a path name into directory path and leaf name
41 status_t split_path(const char *fullPath, char **path, char **leaf);
/haiku/headers/private/system/
H A Dsyscalls.h252 const char *leaf, char *userPath, size_t pathLength);
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DPath.cpp26 Path::SetTo(const char* path, const char* leaf) argument
36 // get leaf len and check, if a separator needs to be inserted
39 if (leaf) {
40 leafLen = strlen(leaf);
42 insertSeparator = (path[len - 1] != '/' && leaf[0] != '/');
58 // append leaf
60 memcpy(fBuffer + len, leaf, leafLen);
70 Path::Append(const char* leaf) argument
72 if (!leaf)
76 return SetTo(leaf);
[all...]
H A DPath.h14 const char* leaf = NULL);
15 status_t Append(const char* leaf);
/haiku/src/add-ons/kernel/network/stack/
H A Dradix.c72 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
105 * a key satisfies a normal route, and also in remembering the unique leaf
217 rn_satisfies_leaf(char *trial, register struct radix_node *leaf, int skip) argument
219 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
236 * Whenever we add a new leaf to the tree, we also add a parent node,
238 * the leaf (see RNTORT() in route.c), the second one is the parent.
240 * the leaf is the left child of the parent node, and both nodes have
370 * in which case last == rn, or we reached a leaf, in which
418 /* Find the next *leaf* sinc
[all...]
/haiku/src/add-ons/translators/raw/
H A DRAW.cpp50 int32 leaf; member in struct:decode
2132 3-bit, etc. Bytes after that are the leaf values.
2181 current->leaf = source[16 + fDecodeLeaf++];
2290 int length = dindex->leaf;
2507 int leaf = dindex->leaf;
2509 if (leaf == 0 && i)
2511 if (leaf == 0xff)
2513 i += leaf >> 4;
2515 int len = leaf
[all...]
/haiku/src/bin/
H A Dcheckitout.cpp146 BString leaf(url.Path());
147 if (leaf.FindLast('/') > -1)
148 leaf.Remove(0, leaf.FindLast('/') + 1);
149 PRINT(("leaf %s\n", leaf.String()));
150 _FilePanel(B_DIRECTORY_NODE, leaf);
/haiku/src/build/libroot/
H A Dfs.cpp356 // found a slash: decompose into dir path and leaf name
372 // catch special case: no leaf, or leaf is a directory
381 // append the leaf name
506 _kern_entry_ref_to_path(dev_t device, ino_t node, const char *leaf, argument
511 status_t error = get_path(device, node, leaf, path);
/haiku/src/kits/mail/
H A Dnumailkit.cpp65 BString leaf = name; local
66 leaf << ".tmp";
85 ret = settings_entry.SetTo(&account_dir,leaf.String());
89 path.Path(), leaf.String(), strerror(ret));
162 path.Path(), leaf.String(), (float)timeout/1e6, strerror(ret));
179 path.Path(), leaf.String(), (float)timeout/1e6, strerror(ret));
194 path.Path(), leaf.String(), strerror(ret));
203 path.Path(), leaf.String(), strerror(ret));
/haiku/src/kits/network/libnetapi/
H A DNetworkSettings.cpp662 BNetworkSettings::_Path(BPath& parent, const char* leaf) argument
664 return BPath(parent.Path(), leaf);
/haiku/src/kits/storage/disk_device/
H A DPartition.cpp335 const char* leaf = path->Leaf(); local
336 if (!leaf || strcmp(leaf, "raw") != B_OK)
/haiku/src/kits/storage/
H A Dstorage_support.cpp36 /*! \brief Parses the supplied path and returns the position of the leaf name
40 function always returns a non-empty directory path part. The leaf name
48 the leaf name part shall be written. The index is inclusive.
50 the leaf name part shall be written. The index is exclusive.
63 // find then end of the leaf name (skip trailing '/')
73 // find the start of the leaf name
92 /*! \brief Parses the supplied path and returns the leaf name part of the path
96 function always returns a non-empty directory path part. The leaf name
104 \param leaf Pointer to a character array of size \c B_FILE_NAME_LENGTH
105 or greater, into which the leaf nam
111 parse_path(const char *fullPath, char *dirPath, char *leaf) argument
186 split_path(const char *fullPath, char *&path, char *&leaf) argument
200 split_path(const char *fullPath, char **path, char **leaf) argument
[all...]
/haiku/src/libs/libcxxrt/
H A Ddynamic_cast.cc37 /** Offset of the leaf object. */
208 void *leaf = ADD_TO_PTR(const_cast<void *>(sub), header->leaf_offset); local
209 return header->type->cast_to(leaf, dst);
/haiku/src/system/boot/loader/file_systems/tarfs/
H A Dtarfs.cpp511 char* leaf = strrchr(header->name, '/'); local
513 if (leaf) {
515 *leaf = '\0';
516 leaf++;
518 leaf = header->name;
531 entry = new(nothrow) TarFS::File(header, leaf);
533 entry = new(nothrow) TarFS::Symlink(header, leaf);
/haiku/src/system/kernel/device_manager/
H A Ddevfs.cpp661 // we are not at the leaf of the path, so as long as
669 // we are at the leaf and hit another node
761 struct devfs_vnode* leaf = vnode; local
772 for (vnode = leaf; vnode->parent && vnode->parent != vnode;
779 if (vnode != leaf)
/haiku/src/system/kernel/fs/
H A DKPath.cpp286 const char* leaf = Leaf(); local
287 if (leaf == NULL)
290 int32 leafIndex = leaf - fBuffer;
291 // chop off the current leaf (don't replace "/", though)
298 // if a leaf was given, append it
308 // get the leaf -- bail out, if not initialized or only the "/" is left
309 const char* leaf = Leaf(); local
310 if (leaf == NULL || leaf == fBuffer || leaf[
[all...]
/haiku/src/system/kernel/util/
H A DRadixBitmap.cpp37 * involved: One for the bitmaps contained in the leaf nodes (typically
38 * 32), and one for the meta nodes (typically 16). Both meta and leaf
111 // leaf node
123 // not leaf node
197 radix_leaf_alloc(radix_node *leaf, radix_slot_t slotIndex, int32 count)
200 bitmap_t bitmap = ~leaf->u.bitmap;
205 leaf->u.bitmap |= mask;
213 if (leaf->big_hint >= count)
214 leaf->big_hint = count - 1;
273 radix_leaf_dealloc(radix_node *leaf, radix_slot_
[all...]
/haiku/src/system/libroot/posix/glibc/misc/
H A Dsearch.h124 leaf enumerator in enum:__anon5492
150 or leaf. */
158 /* Destroy the whole tree, call FREEFCT for each node or leaf. */
H A Dtsearch.c32 1. The number of black edges on every path from the root to a leaf is
53 necessary to restore the invariants. Adding a new red leaf may violate
455 leaf in the tree, but we will be able to recognize one
601 (*action) (root, leaf, level);
/haiku/src/tests/add-ons/kernel/kernelland_emu/
H A DKPath.cpp273 const char* leaf = Leaf(); local
274 if (leaf == NULL)
277 int32 leafIndex = leaf - fBuffer;
278 // chop off the current leaf (don't replace "/", though)
285 // if a leaf was given, append it
295 // get the leaf -- bail out, if not initialized or only the "/" is left
296 const char* leaf = Leaf(); local
297 if (leaf == NULL || leaf == fBuffer || leaf[
[all...]
/haiku/src/tests/kits/storage/
H A DEntryTest.cpp699 // OBOS: Fails, because the implementation concatenates the dir and leaf
747 // OBOS: Fails, because the implementation concatenates the dir and leaf
1171 // OBOS: Fails, because the implementation concatenates the dir and leaf
1219 // OBOS: Fails, because the implementation concatenates the dir and leaf
1332 // OBOS: Fails, because the implementation concatenates the dir and leaf
1734 // arguments. At this time we only pass the leaf name and the
2131 get_entry_ref_for_entry(const char *dir, const char *leaf, entry_ref *ref) argument
2133 status_t error = (dir && leaf ? B_OK : B_BAD_VALUE);
2138 ref->set_name(leaf);
H A DQueryTest.cpp392 string operator+(string leaf) const
394 return path + "/" + leaf;

Completed in 222 milliseconds

12