/haiku/src/kits/shared/ |
H A D | HashString.cpp | 17 : fLength(0), 24 : fLength(0), 32 : fLength(0), 65 fLength = 0; 74 if (newLength < fLength) { 79 fLength = newLength; 80 fString[fLength] = '\0'; 100 _SetTo(string.fString, string.fLength); 108 return (fLength == string.fLength [all...] |
/haiku/src/system/libroot/os/ |
H A D | PathBuffer.h | 21 fLength(0) 34 fLength = length; 35 if (fLength < fSize) 36 fBuffer[fLength] = '\0'; 41 if (length > 0 && fLength + 1 < fSize) { 42 size_t toCopy = std::min(length, fSize - fLength - 1); 43 memcpy(fBuffer + fLength, toAppend, toCopy); 44 fBuffer[fLength + toCopy] = '\0'; 47 fLength += length; 48 return fLength < fSiz 69 size_t fLength; member in struct:__anon3::PathBuffer [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/shared/ |
H A D | String.cpp | 15 : fLength(0), 22 : fLength(0), 30 : fLength(0), 63 fLength = 0; 72 if (newLength < fLength) { 77 fLength = newLength; 78 fString[fLength] = '\0'; 98 _SetTo(string.fString, string.fLength); 106 return (fLength == string.fLength [all...] |
/haiku/src/kits/network/libnetservices/ |
H A D | UrlResult.cpp | 19 fLength(0) 39 fLength = length; 53 return fLength;
|
/haiku/src/apps/haikudepot/tar/ |
H A D | TarArchiveHeader.cpp | 12 fLength(0), 32 return fLength; 53 fLength = value;
|
H A D | TarArchiveHeader.h | 35 uint64 fLength; member in class:TarArchiveHeader
|
/haiku/src/add-ons/kernel/file_systems/nfs/ |
H A D | XDROutPacket.c | 21 return packet->fLength; 28 packet->fSize=packet->fLength=0; 40 if (packet->fLength+size>packet->fSize) 42 while (packet->fLength+size>packet->fSize) 53 *(int32 *)(&packet->fBuffer[packet->fLength])=B_HOST_TO_BENDIAN_INT32(val); 54 packet->fLength+=4; 72 memcpy(&packet->fBuffer[packet->fLength], data, size); 73 else if (user_memcpy(&packet->fBuffer[packet->fLength], data, size) != B_OK) 75 memset(&packet->fBuffer[packet->fLength + size], 0, roundedSize - size); 76 packet->fLength [all...] |
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | String.h | 48 inline int32 GetLength() const { return fLength; } 60 int32 fLength; member in class:String 71 : fLength(0), 78 : fLength(0), 86 : fLength(0), 119 fLength = 0; 128 if (newLength < fLength) { 133 fLength = newLength; 134 fString[fLength] = '\0'; 154 _SetTo(string.fString, string.fLength); [all...] |
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | Path.cpp | 14 fLength(0) 64 fLength = wholeLen; 75 if (fLength == 0) 84 bool insertSeparator = (fBuffer[fLength - 1] != '/' && leaf[0] != '/'); 87 int32 wholeLen = fLength + leafLen + (insertSeparator ? 1 : 0); 94 fBuffer[fLength++] = '/'; 98 memcpy(fBuffer + fLength, leaf, leafLen + 1); 100 fLength = wholeLen; 108 return (fLength == 0 ? NULL : fBuffer); 115 return fLength; [all...] |
H A D | Path.h | 26 int32 fLength; member in class:Path
|
/haiku/src/add-ons/kernel/file_systems/udf/ |
H A D | PhysicalPartition.cpp | 12 fLength(length) 35 if (logicalBlock >= fLength) { 37 ",length = %" B_PRIu32 "\n", logicalBlock, fLength));
|
H A D | DString.cpp | 15 fLength(0), 24 fLength(0), 36 fLength(0), 49 fLength(0), 69 fLength = ref.Length(); 70 memcpy(fString, ref.String(), fLength); 133 fLength = 0;
|
H A D | DString.h | 31 uint8 Length() const { return fLength; } 43 uint8 fLength; member in class:DString
|
H A D | PhysicalPartition.h | 33 uint32 Length() const { return fLength; } 37 uint32 fLength; member in class:PhysicalPartition
|
H A D | SparablePartition.cpp | 17 fLength(length), 58 if (logicalBlock >= fLength)
|
H A D | SparablePartition.h | 43 uint32 Length() const { return fLength; } 52 uint32 fLength; member in class:SparablePartition
|
/haiku/src/apps/resedit/ |
H A D | ResourceData.cpp | 19 fLength(0), 32 fLength(length), 62 SetData(data.fData, data.fLength); 72 (const char **)&name, &fLength)) { 81 char *data = (char *)res.LoadResource(fType, fID, &fLength); 82 SetData(data, fLength); 101 fLength = info.size; 106 fData = (char *)malloc(fLength); 108 ssize_t size = node.ReadAttr(name, info.type, 0, (void*)fData, fLength); 110 fLength [all...] |
/haiku/src/system/boot/loader/ |
H A D | PathBlocklist.cpp | 20 fLength(0), 60 size_t oldLength = fLength; 61 size_t length = (fLength > 0 ? fLength + 1 : 0) + componentLength; 78 fLength = 0; 85 fLength = length; 93 if (fLength > 0 && keepData) { 106 fLength = length;
|
/haiku/headers/private/netservices/ |
H A D | UrlResult.h | 30 off_t fLength; member in class:BPrivate::Network::BUrlResult
|
/haiku/headers/private/shared/ |
H A D | HashString.h | 47 int32 GetLength() const { return fLength; } 59 int32 fLength; member in class:BPrivate::HashString
|
/haiku/headers/private/userlandfs/shared/ |
H A D | String.h | 48 int32 GetLength() const { return fLength; } 60 int32 fLength; member in class:UserlandFSUtil::String
|
/haiku/src/kits/debugger/model/ |
H A D | Watchpoint.cpp | 13 fLength(length), 42 return address >= fAddress && address <= (fAddress + fLength);
|
/haiku/headers/private/debugger/model/ |
H A D | Watchpoint.h | 23 int32 Length() const { return fLength; } 46 int32 fLength; member in class:Watchpoint
|
/haiku/headers/private/kernel/boot/ |
H A D | PathBlocklist.h | 27 { return fLength; } 37 size_t fLength; member in class:BlockedPath
|
/haiku/src/kits/support/ |
H A D | DataIO.cpp | 325 fLength(length), 336 fLength(length), 355 if (pos < (off_t)fLength) { 356 sizeRead = min_c((off_t)size, (off_t)fLength - pos); 385 if (pos + sizeWritten > (off_t)fLength) 386 fLength = pos + sizeWritten; 403 fPosition = fLength + position; 429 fLength = size; 463 fLength(0), 483 if (pos < (off_t)fLength) { [all...] |