Searched refs:fCapacity (Results 1 - 25 of 35) sorted by relevance

12

/haiku/src/apps/terminal/
H A DHistoryBuffer.h27 int32 Capacity() const { return fCapacity; }
46 int32 fCapacity; member in class:HistoryBuffer
58 return &fLines[(fCapacity + fNextLine - index - 1) % fCapacity];
H A DHistoryBuffer.cpp24 fCapacity(0),
58 fCapacity = capacity;
212 if (count > fCapacity)
213 count = fCapacity;
215 if (count + fSize > fCapacity)
216 DropLines(count + fSize - fCapacity);
224 fNextLine = (fNextLine + 1) % fCapacity;
256 if (fSize == fCapacity)
288 fNextLine = (fNextLine + 1) % fCapacity;
/haiku/src/servers/app/
H A DHashTable.cpp39 fCapacity = capacity;
55 for (int32 index = fCapacity; --index >= 0;) {
95 index = hash % fCapacity;
121 index = hash % fCapacity;
149 int32 oldCapacity = fCapacity;
155 newCapacity = fCapacity;
165 for (i = fCapacity; i-- > 0;) {
182 fCapacity = newCapacity;
198 for (entry = fTable[hash % fCapacity]; entry != NULL; entry = entry->next) {
H A DHashTable.h44 int32 fCapacity, fCount, fThreshold; member in class:HashTable
/haiku/src/add-ons/kernel/file_systems/netfs/headers/shared/
H A DRequestMemberArray.h20 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 DPort.h37 int32 GetCapacity() const { return fCapacity; }
52 int32 fCapacity; member in class:UserlandFSUtil::Port
/haiku/src/system/boot/loader/
H A DPathBlacklist.cpp21 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 DHashtable.cpp52 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 DHashtable.h54 int32 fCapacity,fCount,fThreshold,fModCount; member in class:Hashtable
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/
H A DPort.cpp26 fCapacity(0),
55 fCapacity = size;
64 fCapacity(0),
85 fCapacity = info->size;
/haiku/headers/private/kernel/boot/
H A DPathBlacklist.h38 size_t fCapacity; member in class:BlacklistedPath
/haiku/headers/private/storage/
H A DPartitioningInfo.h41 int32 fCapacity; member in class:BPartitioningInfo
/haiku/headers/private/shared/
H A DArray.h60 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 DList.h83 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 DPartitioningInfo.cpp35 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 DTemplateList.h71 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 DList.h66 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 DUnixFifo.h70 size_t Capacity() const { return fCapacity; }
82 size_t fCapacity; member in class:UnixBufferQueue
/haiku/src/system/kernel/vm/
H A DVMAddressSpaceLocking.cpp331 fCapacity(0),
358 if (fCount == fCapacity) {
360 (fCapacity + 4) * sizeof(lock_item));
364 fCapacity += 4;
/haiku/headers/private/kernel/
H A Dtracing.h53 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 DShareNode.cpp276 fCapacity(kRemoteShareDirIteratorCapacity),
325 return fCapacity;
358 if (!entry || fCount >= fCapacity)
/haiku/headers/private/kernel/util/
H A DVector.h81 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 DVector.h77 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 DKernelDebug.cpp81 kprintf(" capacity: %" B_PRId32 "\n", port->fPort.fCapacity);
/haiku/src/add-ons/accelerants/common/
H A Dcreate_display_modes.cpp117 uint32 fCapacity; member in class:BPrivate::ModeList
165 fCapacity(0)
441 if (fCount + count <= fCapacity)
444 uint32 capacity = (fCapacity + count + 0xf) & ~0xf;
451 fCapacity = capacity;

Completed in 785 milliseconds

12