fCapacity
size_t fCapacity;
bool IsFull() const { return fSize >= fCapacity; }
size_t Capacity() const { return fCapacity; }
size_t fCapacity;
: fCapacity(0),
if ((size_t)newSize != fCapacity) {
fCapacity = newSize;
int32 GetCapacity() const { return fCapacity; }
size_t fCapacity;
fCapacity = 0;
if (newCapacity == fCapacity) {
fCapacity = newCapacity;
int32 fCapacity;
fCapacity(0)
fCapacity(0)
int32 fCapacity;
int32 GetCapacity() const { return fCapacity; }
int32 fCapacity;
: fCapacity(0),
if ((size_t)newSize != fCapacity) {
fCapacity = newSize;
int32 GetCapacity() const { return fCapacity; }
size_t fCapacity;
uint32 fCapacity;
if (fCount + count <= fCapacity)
uint32 capacity = (fCapacity + count + 0xf) & ~0xf;
fCapacity = capacity;
fCapacity(kRemoteShareDirIteratorCapacity),
return fCapacity;
if (!entry || fCount >= fCapacity)
int32 fCapacity;
if (capacity > fCapacity) {
if (capacity < 2 * fCapacity)
capacity = 2 * fCapacity;
fCapacity = capacity;
int32 fCapacity;
fCapacity(0)
if ((int32)fCapacity > fItemCount) {
if ((size_t)newSize != fCapacity) {
fCapacity = newSize;
int32 GetCapacity() const { return fCapacity; }
size_t fCapacity;
: fCapacity(0),
if ((int32)fCapacity > fItemCount) {
if ((size_t)newSize != fCapacity) {
fCapacity = newSize;
size_t fCapacity;
: fCapacity(0),
kprintf(" capacity: %" B_PRId32 "\n", port->fPort.fCapacity);
fCapacity(0),
fCapacity = size;
fCapacity(0),
fCapacity = info->size;
if ((int32)fCapacity > fItemCount) {
if ((size_t)newSize != fCapacity) {
fCapacity = newSize;
int32 GetCapacity() const { return fCapacity; }
size_t fCapacity;
: fCapacity(0),
fCapacity(capacity),
fBuffer = create_ring_buffer(fCapacity);
fCapacity = capacity;
size_t fCapacity;
size_t Capacity() const { return fCapacity; }
if (count > fCapacity)
count = fCapacity;
if (count + fSize > fCapacity)
DropLines(count + fSize - fCapacity);
fNextLine = (fNextLine + 1) % fCapacity;
fCapacity(0),
if (fSize == fCapacity)
fNextLine = (fNextLine + 1) % fCapacity;
fCapacity = capacity;
int32 Capacity() const { return fCapacity; }
int32 fCapacity;
return &fLines[(fCapacity + fNextLine - index - 1) % fCapacity];
index = hash % fCapacity;
index = hash % fCapacity;
while (!fIteratorEntry && fIteratorIndex + 1 < fCapacity)
for (int32 index = fCapacity; --index >= 0;) {
int oldCapacity = fCapacity;
fCapacity = newCapacity;
for(entry = table[hash % fCapacity];entry;entry = entry->next)
fCapacity = capacity;
for(int32 index = fCapacity;--index >= 0;)
int32 fCapacity,fCount,fThreshold,fModCount;
if (fCount + count <= fCapacity) {
fCapacity = capacity;
fCapacity = fCount;
fCapacity = 0;
fCapacity = capacity;
fCapacity = 0;
if (length < fCapacity) {
size_t capacity = std::max(length + 1, 2 * fCapacity);
if (newLength >= fCapacity) {
size_t newCapacity = std::max(fCapacity, size_t(32));
fCapacity = newCapacity;
size_t fCapacity;
fCapacity(kBufferSize),
if (fCount >= fCapacity) {
size_t newCapacity = max_c(256, fCapacity * 2);
fCapacity = newCapacity;
size_t fCapacity;
fCapacity(0),
fCapacity = kBufferSize;
fBuffer = (uint8*)malloc(fCapacity);
size_t toWrite = std::min(size, fCapacity - fBuffered);
if (fBuffered + B_PAGE_SIZE > fCapacity) {
size_t fCapacity;
fCapacity(bufferSize),
if (fCapacity > 0)
size_t length = vsnprintf(fBuffer + fSize, fCapacity - fSize, format, args);
fSize += std::min(length, fCapacity - fSize - 1);
kprintf(" capacity: %" B_PRIuSIZE "\n", fCapacity);
buffer->fCapacity = count;
size_t Capacity() const { return fCapacity; }
size_t fCapacity;
fID, fName, fOwner, fCapacity);
int32 fCapacity;
fCapacity(0),
if (fCount == fCapacity) {
(fCapacity + 4) * sizeof(lock_item));
fCapacity += 4;
int32 fCapacity;