Searched refs:paths (Results 1 - 25 of 58) sorted by relevance

123

/haiku/src/bin/network/ftpd/
H A Dpathnames.h37 #include <paths.h>
/haiku/src/bin/network/telnetd/
H A Dpathnames.h37 #include <paths.h>
/haiku/src/tests/system/kernel/
H A Dpath_resolution_test.cpp33 const char* const paths[] = { local
44 for (int32 i = 0; paths[i] != NULL; i++)
45 time_lstat(paths[i]);
/haiku/src/apps/icon-o-matic/shape/commands/
H A DMovePathsCommand.cpp24 VectorPath** paths, int32 count, int32 toIndex)
25 : MoveCommand<VectorPath>(container, paths, count, toIndex)
39 "one{path} other{paths}}"));
23 MovePathsCommand(Container<VectorPath>* container, VectorPath** paths, int32 count, int32 toIndex) argument
H A DAddPathsCommand.cpp24 const VectorPath* const* paths, int32 count, bool ownsPaths, int32 index)
25 : AddCommand<VectorPath>(container, paths, count, ownsPaths, index)
39 "one{path} other{paths}}"));
41 "one{path} other{paths}}"));
23 AddPathsCommand(Container<VectorPath>* container, const VectorPath* const* paths, int32 count, bool ownsPaths, int32 index) argument
H A DAddPathsCommand.h28 const VectorPath* const* paths,
H A DMovePathsCommand.h29 VectorPath** paths,
/haiku/src/apps/icon-o-matic/
H A DUtil.cpp53 VectorPath* paths[1]; local
54 paths[0] = *path;
58 container, paths, 1, true, insertIndex);
/haiku/src/bin/
H A Dsetarch.cpp75 // get the primary architecture bin paths
79 // get the bin paths to insert
86 BStringList paths; local
88 && !BString(pathVariableValue).Split(":", true, paths)) {
93 // Filter the paths, removing any path that isn't associated with the
95 // bin paths.
97 int32 count = paths.CountStrings();
99 // We always keep relative paths. Filter absolute ones only.
100 const char* path = paths.StringAt(i);
120 if (!_paths.Add(paths
221 BStringList paths; local
[all...]
H A Dgetarch.cpp77 BStringList paths; local
79 && BString(pathVariableValue).Split(":", true, paths)) {
80 int32 count = paths.CountStrings();
84 if (paths.StringAt(i)[0] != '/'
85 || path.SetTo(paths.StringAt(i), NULL, true) != B_OK) {
/haiku/src/kits/debug/
H A DTeamDebugger.cpp174 const char* paths = getenv("PATH"); local
175 if (!paths)
178 // iterate through the paths
180 const char* pathEnd = strchr(paths, ':');
181 int pathLen = (pathEnd ? pathEnd - paths : strlen(paths));
183 // We skip empty paths.
186 BString directory(paths, pathLen);
203 paths = (pathEnd ? pathEnd + 1 : NULL);
204 } while (paths);
[all...]
/haiku/src/bin/debug/
H A Ddebug_utils.cpp40 const char* paths = getenv("PATH"); local
41 if (!paths)
44 // iterate through the paths
46 const char* pathEnd = strchr(paths, ':');
47 int pathLen = (pathEnd ? pathEnd - paths : strlen(paths));
49 // We skip empty paths.
52 std::string path(paths, pathLen);
64 paths = (pathEnd ? pathEnd + 1 : NULL);
65 } while (paths);
[all...]
/haiku/src/libs/icon/message/
H A DMessageImporter.h50 Container<VectorPath>* paths) const;
54 Container<VectorPath>* paths,
H A DMessageImporter.cpp93 // paths
94 Container<VectorPath>* paths = icon->Paths();
95 ret = _ImportPaths(&archive, paths);
98 "error importing paths: %s\n", strerror(ret));
112 ret = _ImportShapes(&archive, paths, styles, icon->Shapes());
128 Container<VectorPath>* paths) const
131 status_t ret = archive->FindMessage("paths", &allPaths);
139 if (!path || !paths->AddItem(path)) {
177 MessageImporter::_ImportShapes(const BMessage* archive, Container<VectorPath>* paths, argument
222 // find the referenced paths
[all...]
/haiku/src/libs/icon/transformer/
H A DPathSource.cpp18 PathSource::PathSource(Container<VectorPath>* paths) argument
20 , fPaths(paths)
H A DPathSource.h30 PathSource(Container<VectorPath>* paths);
/haiku/src/kits/print/
H A DPrintTransport.cpp73 const directory_which paths[] = { local
80 for (uint32 i = 0; i < sizeof(paths) / sizeof(paths[0]); ++i) {
81 if (find_directory(paths[i], &path) != B_OK)
/haiku/src/libs/icon/flat_icon/
H A DFlatIconImporter.h59 Container<VectorPath>* paths);
63 Container<VectorPath>* paths);
66 Container<VectorPath>* paths,
/haiku/src/preferences/media/
H A DMidiSettingsView.cpp168 BStringList paths; local
170 "synth", paths);
176 for (int32 i = 0; i < paths.CountStrings(); i++) {
177 BDirectory directory(paths.StringAt(i).String());
189 BPath fullPath = paths.StringAt(i).String();
275 BStringList paths; local
276 BPathFinder().FindPaths(B_FIND_PATH_DATA_DIRECTORY, "synth", paths);
277 for (int32 i = 0; i < paths.CountStrings(); i++) {
278 BEntry entry(paths.StringAt(i));
/haiku/src/libs/print/libprint/
H A DTransport.cpp44 const directory_which paths[] = { local
51 for (uint32 i = 0; i < sizeof(paths) / sizeof(paths[0]); ++i) {
52 if (find_directory(paths[i], &path) != B_OK)
/haiku/src/apps/icon-o-matic/gui/
H A DPathListView.cpp354 VectorPath* paths[1]; local
355 paths[0] = path;
357 paths, 1, false, fCurrentShape->Paths()->CountItems());
533 BList paths; local
543 if (!paths.AddItem(path)) {
551 int32 count = paths.CountItems();
556 (VectorPath**)paths.Items(), count, true, dropIndex);
559 delete (VectorPath*)paths.ItemAtFast(i);
576 VectorPath** paths = new (nothrow) VectorPath*[count]; local
577 if (paths
604 VectorPath* paths[count]; local
[all...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/
H A DUserlandFSServer.cpp71 BStringList paths; local
73 "userlandfs", B_FIND_PATH_EXISTING_ONLY, paths);
78 for (int index = 0; index < paths.CountStrings(); index++) {
79 error = addOnPath.SetTo(paths.StringAt(index));
/haiku/src/preferences/mail/
H A DFilterList.cpp42 BStringList paths; local
43 BPathFinder().FindPaths(B_FIND_PATH_ADD_ONS_DIRECTORY, subPath, paths);
44 for (int32 i = 0; i < paths.CountStrings(); i++) {
45 BPath path(paths.StringAt(i));
/haiku/src/apps/icon-o-matic/import_export/message/
H A DMessageExporter.cpp44 const Container<VectorPath>* paths = icon->Paths(); local
47 // paths
50 int32 count = paths->CountItems();
52 VectorPath* path = paths->ItemAtFast(i);
63 ret = archive.AddMessage("paths", &allPaths);
93 ret = _Export(shape, paths, styles, &shapeArchive);
174 // indices of used paths
/haiku/src/system/libroot/os/
H A Dimage.cpp328 const char* paths = getenv("PATH"); local
329 if (paths == NULL)
334 // iterate through the paths
335 const char* pathEnd = paths - 1;
337 paths = pathEnd + 1;
338 pathEnd = strchr(paths, ':');
339 int pathLen = (pathEnd ? pathEnd - paths : strlen(paths));
341 // We skip empty paths and those that would become too long.
350 memcpy(path, paths, pathLe
[all...]

Completed in 179 milliseconds

123