/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | RPCCallbackServer.cpp | 105 uint32 newSize = max_c(fArraySize * 2, 4); local 106 uint32 size = newSize * sizeof(CallbackSlot); 114 for (uint32 i = fArraySize; i < newSize; i++) 117 array[newSize - 1].fNext = -1; 121 fArraySize = newSize;
|
H A D | MetadataCache.cpp | 75 MetadataCache::GrowFile(size_t newSize) argument 79 fStatCache.st_size = max_c((off_t)newSize, fStatCache.st_size);
|
/haiku/src/apps/patchbay/ |
H A D | PatchView.cpp | 382 BPoint newSize = CalcRowSize(); local 385 (*i)->ResizeTo(newSize.x, newSize.y - 1); 432 BPoint newSize = CalcRowSize(); local 435 (*i)->ResizeTo(newSize.x, newSize.y - 1);
|
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | File.h | 25 virtual status_t Resize(uint64 newSize, bool fillWithZeroes,
|
H A D | File.cpp | 137 File::Resize(uint64 newSize, bool fillWithZeroes, Transaction& transaction) argument 140 if (newSize == size) 143 FUNCTION("%" B_PRIu64 " -> %" B_PRIu64 "\n", size, newSize); 146 uint64 newBlockCount = BLOCK_ROUND_UP(newSize) / B_PAGE_SIZE; 159 SetSize(newSize); 161 file_cache_set_size(fFileCache, newSize); 162 file_map_set_size(fFileMap, newSize); 164 if (newSize > size && fillWithZeroes) { 165 status_t error = _WriteZeroes(size, newSize - size);
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | SizeIndex.cpp | 167 off_t newSize = node->GetSize(); local 169 (const uint8*)&oldSize, sizeof(oldSize), (const uint8*)&newSize, 170 sizeof(newSize));
|
/haiku/headers/build/ |
H A D | BeOSBuildCompatibility.h | 108 int _haiku_build_ftruncate(int fd, off_t newSize); 151 # define ftruncate(fd, newSize) _haiku_build_ftruncate(fd, newSize)
|
/haiku/src/system/kernel/ |
H A D | heap.cpp | 236 Reallocate(addr_t oldAddress, addr_t newAddress, size_t newSize) argument 239 fNewSize(newSize) 1776 size_t newSize, uint32 flags) 1804 TRACE(("realloc(address = %p, newSize = %lu)\n", address, newSize)); 1843 newSize += sizeof(heap_leak_check_info); 1847 if (newSize > minSize && newSize <= maxSize) { 1852 info->size = newSize - sizeof(heap_leak_check_info); 1853 newSize 1775 heap_realloc(heap_allocator *heap, void *address, void **newAddress, size_t newSize, uint32 flags) argument 2405 realloc_etc(void *address, size_t newSize, uint32 flags) argument 2480 realloc(void *address, size_t newSize) argument [all...] |
H A D | guarded_heap.cpp | 545 guarded_heap_realloc(void* address, size_t newSize, uint32 flags) argument 562 if (oldSize == newSize) 565 void* newBlock = malloc_etc(newSize, flags); 569 memcpy(newBlock, address, min_c(oldSize, newSize)); 969 realloc_etc(void* address, size_t newSize, uint32 flags) argument 971 if (newSize == 0) { 977 return malloc_etc(newSize, flags); 979 return guarded_heap_realloc(address, newSize, flags); 984 realloc(void* address, size_t newSize) argument 986 return realloc_etc(address, newSize, [all...] |
/haiku/src/preferences/time/ |
H A D | NetworkTimeView.cpp | 175 ssize_t newSize = fMessage.FlattenedSize(); local 177 if (oldSize != newSize || oldSize < 0 || newSize < 0) 185 char* newBytes = new (std::nothrow) char[newSize]; 190 fMessage.Flatten(newBytes, newSize);
|
/haiku/src/system/libroot/posix/malloc_debug/ |
H A D | heap.cpp | 1392 size_t newSize) 1420 INFO(("realloc(address = %p, newSize = %" B_PRIuSIZE ")\n", address, newSize)); 1456 newSize += sizeof(addr_t) + sizeof(heap_leak_check_info); 1459 if (newSize > minSize && newSize <= maxSize) { 1463 newSize -= sizeof(addr_t) + sizeof(heap_leak_check_info); 1467 info->size = newSize; 1468 addr_t wallAddress = (addr_t)address + newSize; 1476 newSize 1391 heap_realloc(heap_allocator *heap, void *address, void **newAddress, size_t newSize) argument [all...] |
H A D | guarded_heap.cpp | 752 guarded_heap_realloc(void* address, size_t newSize) argument 777 if (oldSize == newSize) 780 void* newBlock = guarded_heap_allocate(sGuardedHeap, newSize, 785 memcpy(newBlock, address, min_c(oldSize, newSize)); 1192 heap_realloc(void* address, size_t newSize) argument 1194 if (newSize == 0) { 1200 return heap_memalign(sDefaultAlignment, newSize); 1202 return guarded_heap_realloc(address, newSize);
|
H A D | malloc_debug_api.cpp | 270 realloc(void* address, size_t newSize) argument 272 return sCurrentHeap->realloc(address, newSize);
|
/haiku/src/add-ons/kernel/network/stack/ |
H A D | simple_net_buffer.cpp | 67 static status_t trim_data(net_buffer *_buffer, size_t newSize); 389 Trims the buffer to the specified \a newSize by removing space from 393 trim_data(net_buffer *_buffer, size_t newSize) argument 397 if (newSize > buffer->size) 399 if (newSize == buffer->size) 402 buffer->data = (uint8*)realloc(buffer->data, newSize); 403 buffer->size = newSize;
|
/haiku/src/system/kernel/vm/ |
H A D | VMUserAddressSpace.cpp | 225 VMUserAddressSpace::CanResizeArea(VMArea* area, size_t newSize) argument 228 addr_t newEnd = area->Base() + (newSize - 1); 247 VMUserAddressSpace::ResizeArea(VMArea* _area, size_t newSize, argument 252 addr_t newEnd = area->Base() + (newSize - 1); 264 addr_t offset = area->Base() + newSize - next->Base(); 277 area->SetSize(newSize);
|
H A D | VMAnonymousCache.h | 45 virtual status_t Resize(off_t newSize, int priority);
|
/haiku/headers/private/kernel/util/ |
H A D | Heap.h | 276 int newSize = max_c(max_c(fSize * 2, 4), minimalSize); local 278 size_t arraySize = newSize * sizeof(Element*); 285 fSize = newSize;
|
H A D | MinMaxHeap.h | 328 int newSize = max_c(max_c(fSize * 4, 4), minimalSize); 330 size_t arraySize = newSize * sizeof(Element*); 337 newBuffer += newSize / 2; 342 fSize = newSize / 2;
|
/haiku/headers/os/interface/ |
H A D | Region.h | 91 bool _SetSize(int32 newSize);
|
/haiku/src/build/libroot/ |
H A D | remapped_functions.h | 36 int _haiku_build_ftruncate(int fd, off_t newSize);
|
H A D | function_remapper.cpp | 169 ftruncate(int fd, off_t newSize) argument 173 return _haiku_build_ftruncate(fd, newSize);
|
/haiku/src/system/kernel/messaging/ |
H A D | KMessage.cpp | 972 int32 newSize = offset + size; local 974 newSize = _Align(newSize); 977 int32 newCapacity = _CapacityFor(newSize); 986 if (newSize > fBufferCapacity) { 993 ", needed: %" B_PRId32 "\n", fBufferCapacity, newSize); 998 int32 newCapacity = _CapacityFor(newSize); 1006 _Header()->size = newSize; 1008 *alignedSize = newSize - offset;
|
/haiku/headers/private/kernel/ |
H A D | heap.h | 63 void* realloc_etc(void* address, size_t newSize, uint32 flags);
|
/haiku/headers/private/shared/ |
H A D | Array.h | 249 int32 newSize = fSize + delta; local 251 while (newCapacity < newSize)
|
/haiku/src/system/libroot/posix/malloc_hoard2/ |
H A D | arch-specific.cpp | 182 size_t newSize = chunk->size - size; local 187 chunk->size = newSize;
|