fAvailable
fAvailable(0)
uint32 Available() const { return fAvailable; }
if (size > fAvailable)
fAvailable -= chunk->Size();
fAvailable += freeChunk->Size();
fMaxHeapUsage = std::max(fMaxHeapUsage, fMaxHeapSize - fAvailable);
if (freedChunk->Size() > (fMaxHeapSize - fAvailable)) {
if (chunk->Size() > fAvailable || freedChunk == chunk)
fAvailable -= chunk->Size();
fAvailable += freedChunk->Size();
fMaxHeapUsage = std::max(fMaxHeapUsage, fMaxHeapSize - fAvailable);
uint32 fAvailable;
fAvailable(true),
fAvailable = added;
if (!fAvailable)
if (!fAvailable)
if (atDeviceLevel && fAvailable) {
if (!fAvailable)
if (!fAvailable)
if (!fAvailable)
bool fAvailable;
if (fAvailable < length) {
fAvailable -= length;
if (fAvailable < length)
fAvailable -= length;
{ return fBufferSize - fAvailable; }
size_t fAvailable;
fAvailable(size),
: fAvailable(4)
int32 count = fAvailable.CountItems();
delete (BRegion*)fAvailable.ItemAtFast(i);
BRegion* region = (BRegion*)fAvailable.RemoveItem(
fAvailable.CountItems() - 1);
int32 count = fAvailable.CountItems();
region = (BRegion*)fAvailable.RemoveItem(count - 1);
if (!fAvailable.AddItem(region)) {
BList fAvailable;
fAvailable -= bitsLength;
fAvailable -= bitsLength;
fAvailable += fWriteIndex;
size_t fAvailable;
fAvailable(0),
fAvailable += fWriteIndex;
fAvailable -= sizeof(T);
if (length > fAvailable && !_MakeSpace(length))
fAvailable -= length;
if (fAvailable >= size)
fAvailable = extraSize;
if (isAvailable != fAvailable) {
fAvailable = isAvailable;
fListeners.ItemAt(i)->NetworkAvailabilityChanged(fAvailable);
bool fAvailable;