/haiku/src/apps/terminal/ |
H A D | HistoryBuffer.h | 27 int32 Capacity() const { return fCapacity; } 46 int32 fCapacity; member in class:HistoryBuffer 58 return &fLines[(fCapacity + fNextLine - index - 1) % fCapacity];
|
H A D | HistoryBuffer.cpp | 24 fCapacity(0), 58 fCapacity = capacity; 216 if (count > fCapacity) 217 count = fCapacity; 219 if (count + fSize > fCapacity) 220 DropLines(count + fSize - fCapacity); 228 fNextLine = (fNextLine + 1) % fCapacity; 260 if (fSize == fCapacity) 292 fNextLine = (fNextLine + 1) % fCapacity;
|
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | RequestMemberArray.h | 20 fCapacity(0) 101 if (capacity > fCapacity) { 102 if (capacity < 2 * fCapacity) 103 capacity = 2 * fCapacity; 111 fCapacity = capacity; 120 int32 fCapacity; member in class:RequestMemberArray
|
/haiku/headers/private/userlandfs/private/ |
H A D | Port.h | 37 int32 GetCapacity() const { return fCapacity; } 52 int32 fCapacity; member in class:UserlandFSUtil::Port
|
/haiku/src/system/boot/loader/ |
H A D | PathBlocklist.cpp | 21 fCapacity(0) 79 fCapacity = 0; 83 if (length < fCapacity) { 89 size_t capacity = std::max(length + 1, 2 * fCapacity); 107 fCapacity = capacity;
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | Hashtable.cpp | 52 fCapacity = capacity; 63 for(int32 index = fCapacity;--index >= 0;) 122 index = hash % fCapacity; 139 index = hash % fCapacity; 176 while (!fIteratorEntry && fIteratorIndex + 1 < fCapacity) 200 for (int32 index = fCapacity; --index >= 0;) { 246 int oldCapacity = fCapacity; 257 fCapacity = newCapacity; 285 for(entry = table[hash % fCapacity];entry;entry = entry->next)
|
H A D | Hashtable.h | 54 int32 fCapacity,fCount,fThreshold,fModCount; member in class:Hashtable
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/ |
H A D | Port.cpp | 26 fCapacity(0), 55 fCapacity = size; 64 fCapacity(0), 85 fCapacity = info->size;
|
/haiku/headers/private/kernel/boot/ |
H A D | PathBlocklist.h | 38 size_t fCapacity; member in class:BlockedPath
|
/haiku/headers/private/storage/ |
H A D | PartitioningInfo.h | 41 int32 fCapacity; member in class:BPartitioningInfo
|
/haiku/headers/private/shared/ |
H A D | Array.h | 60 int32 fCapacity; member in class:BPrivate::Array 69 fCapacity(0) 79 fCapacity(0) 185 fCapacity = 0; 254 if (newCapacity == fCapacity) { 292 fCapacity = newCapacity;
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | List.h | 83 size_t fCapacity; member in class:List 98 : fCapacity(0), 164 if ((int32)fCapacity > fItemCount) { 325 if ((size_t)newSize != fCapacity) { 330 fCapacity = newSize;
|
/haiku/src/kits/storage/disk_device/ |
H A D | PartitioningInfo.cpp | 35 fCapacity(0) 69 fCapacity = fCount; 83 fCapacity = 0; 243 if (fCount + count <= fCapacity) { 266 fCapacity = capacity;
|
/haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/headers/ |
H A D | TemplateList.h | 71 int32 GetCapacity() const { return fCapacity; } 78 size_t fCapacity; member in class:TemplateList 93 : fCapacity(0), 159 if ((int32)fCapacity > fItemCount) { 353 if ((size_t)newSize != fCapacity) { 358 fCapacity = newSize;
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | List.h | 66 int32 GetCapacity() const { return fCapacity; } 73 size_t fCapacity; member in class:List 88 : fCapacity(0), 154 if ((int32)fCapacity > fItemCount) { 348 if ((size_t)newSize != fCapacity) { 353 fCapacity = newSize;
|
/haiku/src/add-ons/kernel/network/protocols/unix/ |
H A D | UnixFifo.h | 80 size_t Capacity() const { return fCapacity; } 99 size_t fCapacity; member in class:UnixBufferQueue
|
/haiku/src/system/kernel/vm/ |
H A D | VMAddressSpaceLocking.cpp | 331 fCapacity(0), 358 if (fCount == fCapacity) { 360 (fCapacity + 4) * sizeof(lock_item)); 364 fCapacity += 4;
|
H A D | VMAddressSpaceLocking.h | 122 int32 fCapacity; member in class:MultiAddressSpaceLocker
|
/haiku/headers/private/kernel/ |
H A D | tracing.h | 53 bool IsFull() const { return fSize >= fCapacity; } 56 size_t Capacity() const { return fCapacity; } 66 size_t fCapacity; member in class:TraceOutput
|
/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | ShareNode.cpp | 276 fCapacity(kRemoteShareDirIteratorCapacity), 325 return fCapacity; 358 if (!entry || fCount >= fCapacity)
|
H A D | ShareNode.h | 136 int32 fCapacity; member in class:RemoteShareDirIterator
|
/haiku/headers/private/kernel/util/ |
H A D | Vector.h | 81 int32 GetCapacity() const { return fCapacity; } 90 size_t fCapacity; member in class:Vector 201 : fCapacity(0), 728 if ((size_t)newSize != fCapacity) { 732 fCapacity = newSize;
|
/haiku/headers/private/userlandfs/shared/ |
H A D | Vector.h | 77 int32 GetCapacity() const { return fCapacity; } 86 size_t fCapacity; member in class:Vector 197 : fCapacity(0), 724 if ((size_t)newSize != fCapacity) { 728 fCapacity = newSize;
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | KernelDebug.cpp | 81 kprintf(" capacity: %" B_PRId32 "\n", port->fPort.fCapacity);
|
/haiku/src/add-ons/accelerants/common/ |
H A D | create_display_modes.cpp | 118 uint32 fCapacity; member in class:BPrivate::ModeList 166 fCapacity(0) 442 if (fCount + count <= fCapacity) 445 uint32 capacity = (fCapacity + count + 0xf) & ~0xf; 452 fCapacity = capacity;
|