0d4c16e0c0
that put one or more full paths on the stack before, which could cause some problems under certain conditions. * Cleaned up KPath, ie. use size_t instead of int32 where appropriate, added license. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@16585 a95241bf-73f2-0310-859d-f6bbb57e9c96
64 lines
1.4 KiB
C++
64 lines
1.4 KiB
C++
/*
|
|
* Copyright 2004-2006, Ingo Weinhold, bonefish@users.sf.net.
|
|
* Distributed under the terms of the MIT License.
|
|
*/
|
|
#ifndef _K_PATH_H
|
|
#define _K_PATH_H
|
|
|
|
|
|
#include <KernelExport.h>
|
|
|
|
|
|
namespace BPrivate {
|
|
namespace DiskDevice {
|
|
|
|
class KPath {
|
|
public:
|
|
KPath(size_t bufferSize = B_PATH_NAME_LENGTH);
|
|
KPath(const char* path, bool normalize = false,
|
|
size_t bufferSize = B_PATH_NAME_LENGTH);
|
|
KPath(const KPath& other);
|
|
~KPath();
|
|
|
|
status_t SetTo(const char *path, bool normalize = false,
|
|
size_t bufferSize = B_PATH_NAME_LENGTH);
|
|
|
|
status_t InitCheck() const;
|
|
|
|
status_t SetPath(const char *path, bool normalize = false);
|
|
const char *Path() const;
|
|
size_t Length() const { return fPathLength; }
|
|
|
|
size_t BufferSize() const { return fBufferSize; }
|
|
char *LockBuffer();
|
|
void UnlockBuffer();
|
|
|
|
const char *Leaf() const;
|
|
status_t ReplaceLeaf(const char *newLeaf);
|
|
|
|
status_t Append(const char *toAppend, bool isComponent = true);
|
|
|
|
KPath& operator=(const KPath& other);
|
|
KPath& operator=(const char* path);
|
|
|
|
bool operator==(const KPath& other) const;
|
|
bool operator==(const char* path) const;
|
|
bool operator!=(const KPath& other) const;
|
|
bool operator!=(const char* path) const;
|
|
|
|
private:
|
|
void _ChopTrailingSlashes();
|
|
|
|
char* fBuffer;
|
|
size_t fBufferSize;
|
|
size_t fPathLength;
|
|
bool fLocked;
|
|
};
|
|
|
|
} // namespace DiskDevice
|
|
} // namespace BPrivate
|
|
|
|
using BPrivate::DiskDevice::KPath;
|
|
|
|
#endif /* _K_PATH_H */
|