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

12

/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/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/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/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/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/src/tests/kits/storage/
H A DQueryTest.cpp392 string operator+(string leaf) const
394 return path + "/" + 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);
/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/headers/build/private/kernel/
H A Dsyscalls.h55 const char *leaf, char *userPath, size_t pathLength);
/haiku/headers/posix/
H A Dsearch.h26 leaf enumerator in enum:__anon2
/haiku/headers/private/kernel/
H A Dvfs.h124 status_t vfs_entry_ref_to_path(dev_t device, ino_t inode, const char *leaf,
174 status_t _user_entry_ref_to_path(dev_t device, ino_t inode, const char *leaf,
/haiku/headers/private/storage/
H A Dstorage_support.h38 status_t parse_path(const char *fullPath, char *dirPath, 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);
43 //! splits a path name into directory path and leaf name
44 status_t split_path(const char *fullPath, char **path, char **leaf);
/haiku/headers/private/system/
H A Dsyscalls.h266 const char *leaf, char *userPath, size_t pathLength);
/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/file_systems/xfs/
H A DBPlusTree.cpp300 // We should be at the left most leaf node.
304 // Run till you have leaf blocks to checkout
325 TRACE("Next leaf is at: (%" B_PRIu64 ")\n", fileSystemBlockNo);
389 This could be leaf or node block perform check for both
392 ExtentLeafHeader* leaf = ExtentLeafHeader::Create(fInode, fSingleDirBlock); local
393 if (leaf == NULL)
396 if ((leaf->Magic() == XFS_DIR2_LEAFN_MAGIC
397 || leaf->Magic() == XFS_DIR3_LEAFN_MAGIC)
398 && !VerifyHeader<ExtentLeafHeader>(leaf, fSingleDirBlock, fInode,
401 delete leaf;
[all...]
H A DLeafDirectory.cpp63 // check leaf buffer
67 ExtentLeafHeader* leaf = ExtentLeafHeader::Create(fInode, fLeafBuffer);
68 if (leaf == NULL)
70 if (!VerifyHeader<ExtentLeafHeader>(leaf, fLeafBuffer, fInode, 0, fLeafMap, XFS_LEAF)) {
71 ERROR("Invalid leaf header");
72 delete leaf;
75 delete leaf;
168 TRACE("NumberOfEntries in leaf: (%" B_PRIu16 ")\n", header->Count());
437 This Function returns Actual size of leaf header
H A DNode.cpp154 This could be leaf or node block perform check for both
157 ExtentLeafHeader* leaf = ExtentLeafHeader::Create(fInode, fLeafBuffer); local
158 if (leaf == NULL)
161 if ((leaf->Magic() == XFS_DIR2_LEAFN_MAGIC
162 || leaf->Magic() == XFS_DIR3_LEAFN_MAGIC)
163 && !VerifyHeader<ExtentLeafHeader>(leaf, fLeafBuffer, fInode,
166 delete leaf;
169 delete leaf;
170 leaf = NULL;
488 This Function returns Actual size of leaf heade
[all...]
/haiku/src/add-ons/translators/raw/
H A DRAW.cpp50 int32 leaf; member in struct:decode
2133 3-bit, etc. Bytes after that are the leaf values.
2182 current->leaf = source[16 + fDecodeLeaf++];
2291 int length = dindex->leaf;
2508 int leaf = dindex->leaf;
2510 if (leaf == 0 && i)
2512 if (leaf == 0xff)
2514 i += leaf >> 4;
2516 int len = leaf
[all...]
/haiku/src/apps/haikudepot/model/
H A DModel.cpp835 BString leaf; local
836 leaf.SetToFormat("repository-all_%s.json.gz",
838 return StorageUtils::LocalWorkingFilesPath(leaf, path);
850 BString leaf; local
851 leaf.SetToFormat("reference-all_%s.json.gz",
853 return StorageUtils::LocalWorkingFilesPath(leaf, path);
868 BString leaf; local
869 leaf.SetToFormat("pkg-all-%s-%s.json.gz", repositorySourceCode.String(),
871 return StorageUtils::LocalWorkingFilesPath(leaf, path);
/haiku/src/apps/haikudepot/util/
H A DStorageUtils.cpp360 StorageUtils::LocalWorkingFilesPath(const BString leaf, BPath& path, argument
380 result = resultPath.Append(leaf);
387 "[%s] data; %s", leaf.String(), strerror(result));
395 StorageUtils::LocalWorkingDirectoryPath(const BString leaf, BPath& path, argument
408 result = resultPath.Append(leaf);
422 "[%s] data; %s", leaf.String(), strerror(result));

Completed in 148 milliseconds

12