/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | DataContainer.cpp | 88 DataContainer::Resize(off_t newSize) argument 90 // PRINT("DataContainer::Resize(%lld), fSize: %lld\n", newSize, fSize); 93 if (_RequiresCacheMode(newSize)) { 94 if (newSize < fSize) { 98 error = fCache->Resize(newSize, VM_PRIORITY_SYSTEM); 109 fCache->Resize(newSize, VM_PRIORITY_SYSTEM); 114 } else if (fSmallBufferSize < newSize 115 || (fSmallBufferSize - newSize) > (kMaximumSmallBufferSize / 2)) { 116 const size_t newBufferSize = max_c(next_power_of_2(newSize), 126 fSize = newSize; [all...] |
H A D | Attribute.cpp | 55 Attribute::SetSize(off_t newSize) argument 59 if (newSize != oldSize) { 63 error = DataContainer::Resize(newSize);
|
H A D | List.h | 343 int32 newSize = count; local 344 if (newSize <= 0) 345 newSize = 1; 346 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 348 if ((size_t)newSize != fCapacity) { 350 = (item_t*)realloc(fItems, newSize * sizeof(item_t)); 353 fCapacity = newSize;
|
H A D | Directory.h | 25 virtual status_t SetSize(off_t newSize);
|
H A D | Attribute.h | 35 status_t SetSize(off_t newSize);
|
H A D | DataContainer.h | 25 status_t Resize(off_t newSize);
|
/haiku/src/kits/media/ |
H A D | RealtimeAlloc.cpp | 418 rtm_realloc(void** _buffer, size_t newSize) argument 423 TRACE("rtm_realloc(%p, %lu)\n", *_buffer, newSize); 430 void* buffer = realloc(oldBuffer, newSize); 440 if (newSize == 0) { 441 TRACE("realloc(%p, %lu) -> NULL\n", oldBuffer, newSize); 447 size_t copySize = newSize; 452 if (oldChunk->Size() >= newSize && newSize > oldChunk->Size() / 3) { 454 oldBuffer, newSize); 462 void* newBuffer = rtm_alloc(pool, newSize); [all...] |
/haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/headers/ |
H A D | TemplateList.h | 348 int32 newSize = count; local 349 if (newSize <= 0) 350 newSize = 1; 351 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 353 if ((size_t)newSize != fCapacity) { 355 = (item_t*)realloc(fItems, newSize * sizeof(item_t)); 358 fCapacity = newSize;
|
/haiku/src/system/kernel/vm/ |
H A D | VMKernelAddressSpace.cpp | 242 VMKernelAddressSpace::CanResizeArea(VMArea* area, size_t newSize) argument 246 if (newSize <= range->size) 260 return newSize - range->size <= nextRange->size; 265 VMKernelAddressSpace::ResizeArea(VMArea* _area, size_t newSize, argument 269 newSize); 274 if (newSize == range->size) 279 if (newSize < range->size) { 283 nextRange->size += range->size - newSize; 284 nextRange->base = range->base + newSize; 290 range->base + newSize, rang 333 ShrinkAreaHead(VMArea* _area, size_t newSize, uint32 allocationFlags) argument 380 ShrinkAreaTail(VMArea* area, size_t newSize, uint32 allocationFlags) argument [all...] |
/haiku/src/kits/support/ |
H A D | List.cpp | 481 int32 newSize = fPhysicalSize > 0 ? fPhysicalSize : fBlockSize; local 487 while (newSize < targetSize) 488 newSize <<= 1; 490 newSize = fResizeThreshold; 493 if (newSize != fPhysicalSize) { 495 = (void**)realloc(fObjectList, newSize * sizeof(void*)); 498 fPhysicalSize = newSize;
|
H A D | DataIO.cpp | 498 size_t newSize = max_c(pos + (off_t)size, (off_t)fLength); 501 if (newSize > fMallocSize) 502 error = SetSize(newSize); 552 size_t newSize = (size + fBlockSize - 1) / fBlockSize * fBlockSize; local 555 if (char* newData = static_cast<char*>(realloc(fData, newSize))) { 557 if (newSize > fMallocSize) 558 memset(newData + fMallocSize, 0, newSize - fMallocSize); 560 fMallocSize = newSize;
|
/haiku/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 434 bool _Resize(size_t newSize) argument 437 = (ValueType**)fAllocator.Allocate(sizeof(ValueType*) * newSize); 441 _Resize(newTable, newSize); 445 void _Resize(ValueType** newTable, size_t newSize, void** _oldTable = NULL) argument 447 for (size_t i = 0; i < newSize; i++) 455 _Insert(newTable, newSize, bucket); 467 fTableSize = newSize;
|
/haiku/headers/private/kernel/util/ |
H A D | OpenHashTable.h | 434 bool _Resize(size_t newSize) argument 437 = (ValueType**)fAllocator.Allocate(sizeof(ValueType*) * newSize); 441 _Resize(newTable, newSize); 445 void _Resize(ValueType** newTable, size_t newSize, void** _oldTable = NULL) argument 447 for (size_t i = 0; i < newSize; i++) 455 _Insert(newTable, newSize, bucket); 467 fTableSize = newSize;
|
H A D | Vector.h | 723 int32 newSize = count; local 724 if (newSize <= 0) 725 newSize = 1; 726 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 728 if ((size_t)newSize != fCapacity) { 729 Value* newItems = (Value*)realloc(fItems, newSize * sizeof(Value)); 732 fCapacity = newSize;
|
/haiku/src/kits/interface/textview_support/ |
H A D | WidthBuffer.cpp | 330 const int32 newSize = table.tableCount * 2; local 333 hashed_escapement* newWidths = new hashed_escapement[newSize]; 340 = Hash(widths[oldPos].code) & (newSize - 1); 342 if (++newPos >= (uint32)newSize) 352 table.tableCount = newSize;
|
/haiku/src/tests/add-ons/media/media-add-ons/mixer/ |
H A D | main.cpp | 38 void Resize(int newSize) { argument 39 if (newSize <= 0) 40 newSize = 1; 41 fData = (float*)realloc(fData, newSize * sizeof(float)); 42 fSize = newSize;
|
/haiku/src/add-ons/kernel/partitioning_systems/gpt/ |
H A D | gpt.cpp | 209 off_t newSize = *size; local 210 if (newSize == partition->size) 213 if (newSize < 0) 214 newSize = 0; 216 newSize = block_align(partition, newSize, false); 219 if (newSize > partition->size) { 220 *size = newSize; 225 off_t newEnd = partition->offset + newSize; 235 newSize 245 off_t newSize = *size; local [all...] |
/haiku/src/kits/interface/ |
H A D | Shape.cpp | 600 int32 newSize = (data->opCount + count + 255) / 256 * 256; local 601 if (data->opSize >= newSize) 604 uint32* resizedArray = (uint32*)realloc(data->opList, newSize * sizeof(uint32)); 607 data->opSize = newSize; 619 int32 newSize = (data->ptCount + count + 255) / 256 * 256; local 620 if (data->ptSize >= newSize) 624 newSize * sizeof(BPoint)); 627 data->ptSize = newSize;
|
/haiku/headers/private/userlandfs/shared/ |
H A D | Vector.h | 719 int32 newSize = count; local 720 if (newSize <= 0) 721 newSize = 1; 722 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 724 if ((size_t)newSize != fCapacity) { 725 Value* newItems = (Value*)realloc(fItems, newSize * sizeof(Value)); 728 fCapacity = newSize;
|
/haiku/src/apps/haikudepot/ui_generic/ |
H A D | BitmapView.cpp | 132 BSize newSize = MinSize(); local 133 if (size != newSize)
|
/haiku/headers/os/storage/ |
H A D | ResourceStrings.h | 57 status_t _Rehash(int32 newSize);
|
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | MetadataCache.h | 35 void GrowFile(size_t newSize);
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | SizeIndex.cpp | 205 off_t newSize = node->FileSize(); local 206 if (newSize == oldSize) 239 (const uint8*)&oldSize, sizeof(oldSize), (const uint8*)&newSize, 240 sizeof(newSize));
|
/haiku/src/system/libroot/posix/malloc_debug/ |
H A D | malloc_debug_api.h | 19 void* (*realloc)(void* address, size_t newSize);
|
/haiku/headers/private/kernel/vm/ |
H A D | VMAddressSpace.h | 97 virtual bool CanResizeArea(VMArea* area, size_t newSize) = 0; 98 virtual status_t ResizeArea(VMArea* area, size_t newSize, 100 virtual status_t ShrinkAreaHead(VMArea* area, size_t newSize, 102 virtual status_t ShrinkAreaTail(VMArea* area, size_t newSize,
|