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

12

/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/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...]
H A DPath.cpp72 BPath::BPath(const char* dir, const char* leaf, bool normalize) argument
77 SetTo(dir, leaf, normalize);
83 BPath::BPath(const BDirectory* dir, const char* leaf, bool normalize) argument
88 SetTo(dir, leaf, normalize);
146 // leaf combination.
148 BPath::SetTo(const char* path, const char* leaf, bool normalize) argument
151 if (error == B_OK && leaf && BPrivate::Storage::is_absolute_path(leaf))
157 // build a new path from path and leaf
164 // append leaf, i
[all...]
/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/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/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/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/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/headers/posix/
H A Dsearch.h26 leaf enumerator in enum:__anon2
/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...]
H A Dvfs.cpp2016 /*! \brief Gets the directory path and leaf name for a given path.
2020 the leaf name of the original entry is written.
2021 Neither the returned path nor the leaf name can be expected to be
2026 \param filename The buffer into which the leaf name will be written.
2028 \return \c B_OK, if everything went fine, \c B_NAME_TOO_LONG, if the leaf
2063 // rewind to the start of the leaf before the '/'
2066 // normal leaf: replace the leaf portion of the path with a '.'
2402 /*! \brief Retrieves the directory vnode and the leaf name of an entry referred
2421 the leaf nam
2893 char leaf[B_FILE_NAME_LENGTH]; local
4603 char* leaf = NULL; local
4908 vfs_entry_ref_to_path(dev_t device, ino_t inode, const char* leaf, bool kernel, char* path, size_t pathLength) argument
6137 char* leaf = lastSlash + 1; local
9014 _user_entry_ref_to_path(dev_t device, ino_t inode, const char* leaf, char* userPath, size_t pathLength) argument
[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/tools/fs_shell/
H A DKPath.cpp186 const char *leaf = Leaf(); local
187 if (!leaf)
190 int32_t leafIndex = leaf - fBuffer;
191 // chop off the current leaf (don't replace "/", though)
198 // if a leaf was given, append it
H A Dsyscalls.h29 const char *leaf, char *userPath, fssh_size_t pathLength);
H A Dvfs.cpp994 /** \brief Gets the directory path and leaf name for a given path.
998 * the leaf name of the original entry is written.
999 * Neither the returned path nor the leaf name can be expected to be
1004 * \param filename The buffer into which the leaf name will be written.
1006 * \return \c FSSH_B_OK, if everything went fine, \c FSSH_B_NAME_TOO_LONG, if the leaf
1030 // normal leaf: replace the leaf portion of the path with a '.'
1296 /** \brief Retrieves the directory vnode and the leaf name of an entry referred
1315 * the leaf name of the specified entry will be written.
2629 * directory, that is chopping off the leaf componen
2669 char leaf[FSSH_B_FILE_NAME_LENGTH]; local
2774 vfs_entry_ref_to_path(fssh_dev_t device, fssh_ino_t inode, const char *leaf, bool kernel, char *path, fssh_size_t pathLength) argument
3523 char *leaf = lastSlash + 1; local
5773 _kern_entry_ref_to_path(fssh_dev_t device, fssh_ino_t inode, const char *leaf, char* path, fssh_size_t pathLength) argument
[all...]
H A Dfssh.cpp333 // construct path, if a leaf name is given
837 // get source leaf
838 char leaf[FSSH_B_FILE_NAME_LENGTH]; local
839 error = get_last_path_component(source, leaf, sizeof(leaf));
841 fprintf(stderr, "Error: Failed to get leaf name of source "
847 int len = strlen(target) + 1 + strlen(leaf);
855 strcat(targetBuffer, leaf);
/haiku/src/tools/
H A Drm_attrs.cpp50 bool PushLeaf(const char* leaf) argument
52 size_t leafLen = strlen(leaf);
61 strcpy(fPath + fPathLen, leaf);
/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/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. */
/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/headers/build/private/kernel/
H A Dsyscalls.h53 const char *leaf, char *userPath, size_t pathLength);
/haiku/src/apps/haikudepot/model/
H A DModel.h158 status_t _LocalDataPath(const BString leaf,
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp373 BTree::Node* leaf = fNodes[0]; local
374 if (slot < 0 || slot >= leaf->ItemCount())
378 *_key = leaf->Item(slot)->key;
380 uint32 itemSize = leaf->Item(slot)->Size();
386 memcpy(*_value, leaf->ItemData(slot), itemSize);
393 *_offset = leaf->Item(slot)->Offset();
775 // the current leaf is already the left most leaf or
814 // the current leaf is already the right most leaf o
[all...]
/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...]

Completed in 346 milliseconds

12