/haiku-fatelf/src/add-ons/kernel/partitioning_systems/gpt/ |
H A D | efi_gpt.cpp | 190 off_t newSize = *size; local 191 if (newSize == partition->size) 194 if (newSize < 0) 195 newSize = 0; 197 newSize = block_align(partition, newSize, false); 200 if (newSize > partition->size) { 201 *size = newSize; 206 off_t newEnd = partition->offset + newSize; 216 newSize 226 off_t newSize = *size; local [all...] |
/haiku-fatelf/src/system/kernel/fs/ |
H A D | vfs.cpp | 4904 vfs_resize_fd_table(struct io_context* context, const int newSize) argument 4906 if (newSize <= 0 || newSize > MAX_FD_TABLE_SIZE) 4909 TIOC(ResizeIOContext(context, newSize)); 4915 int newCloseOnExitBitmapSize = (newSize + 7) / 8; 4918 if (newSize < oldSize) { 4919 for (int i = oldSize; i-- > newSize;) { 4932 sizeof(struct file_descriptor*) * newSize 4933 + sizeof(struct select_sync*) * newSize 4939 context->select_infos = (select_info**)(context->fds + newSize); 4967 vfs_resize_monitor_table(struct io_context* context, const int newSize) argument [all...] |
/haiku-fatelf/src/system/kernel/vm/ |
H A D | vm.cpp | 641 size_t newSize = address - area->Base(); local 643 status_t error = addressSpace->ShrinkAreaTail(area, newSize, 649 unmap_pages(area, address, oldSize - newSize); 658 cache->Resize(cache->virtual_base + newSize, priority); 669 size_t newSize = areaLast - lastAddress; local 675 status_t error = addressSpace->ShrinkAreaHead(area, newSize, 4800 vm_resize_area(area_id areaID, size_t newSize, bool kernel) argument 4802 // is newSize a multiple of B_PAGE_SIZE? 4803 if (newSize & (B_PAGE_SIZE - 1)) 4836 if (newSize 5799 resize_area(area_id areaID, size_t newSize) argument 6028 _user_resize_area(area_id area, size_t newSize) argument [all...] |
H A D | VMAnonymousCache.cpp | 489 VMAnonymousCache::Resize(off_t newSize, int priority) argument 496 for (page_num_t pageIndex = (newSize + B_PAGE_SIZE - 1) >> PAGE_SHIFT; 543 return VMCache::Resize(newSize, priority);
|
H A D | VMCache.cpp | 1089 VMCache::Resize(off_t newSize, int priority) argument 1091 TRACE(("VMCache::Resize(cache %p, newSize %" B_PRIdOFF ") old size %" 1092 B_PRIdOFF "\n", this, newSize, this->virtual_end)); 1095 T(Resize(this, newSize)); 1097 status_t status = Commit(newSize - virtual_base, priority); 1103 uint32 newPageCount = (uint32)((newSize + B_PAGE_SIZE - 1) >> PAGE_SHIFT); 1141 virtual_end = newSize;
|
H A D | VMAnonymousCache.h | 42 virtual status_t Resize(off_t newSize, int priority);
|
/haiku-fatelf/src/kits/tracker/ |
H A D | PoseView.cpp | 9240 BPoseView::ResizeColumn(BColumn* column, float newSize, argument 9255 bool shrinking = newSize < column->Width(); 9258 - kRoomForLine + newSize; 9266 column->SetWidth(newSize);
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/ |
H A D | Inode.cpp | 1091 Inode::FillGapWithZeros(off_t pos, off_t newSize) argument 1094 //if (pos >= newSize) 1102 off_t length = newSize - pos;
|
/haiku-fatelf/headers/private/kernel/vm/ |
H A D | VMCache.h | 132 virtual status_t Resize(off_t newSize, int priority);
|
H A D | vm.h | 180 status_t _user_resize_area(area_id area, size_t newSize);
|
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/ |
H A D | Inode.cpp | 104 Resize(Inode* inode, off_t oldSize, off_t newSize, bool trim) argument 109 fNewSize(newSize), 1642 Inode::FillGapWithZeros(off_t pos, off_t newSize) argument 1644 while (pos < newSize) { 1646 if (newSize > pos + 1024 * 1024 * 1024) 1649 size = newSize - pos;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/ |
H A D | OpenHashTable.h | 348 int32 newSize = int32(fElementCount * 1.73 * fMaxLoadFactor); local 349 newSize = (fInitialSize > newSize ? fInitialSize : newSize); 350 if (newSize != fArraySize) { 352 int32 *newHashArray = (int32*)calloc(newSize, sizeof(int32)); 355 for (int32 index = 0; index < newSize; index++) 365 uint32 hash = (element.Hash() % newSize); 375 fArraySize = newSize; 465 int32 newSize local [all...] |
H A D | Vector.h | 742 int32 newSize = count; local 743 if (newSize <= 0) 744 newSize = 1; 745 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 747 if ((size_t)newSize != fCapacity) { 748 Value* newItems = (Value*)realloc(fItems, newSize * sizeof(Value)); 751 fCapacity = newSize;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/shared/ |
H A D | KMessage.cpp | 754 int32 newSize = offset + size; local 756 newSize = _Align(newSize); 759 int32 newCapacity = _CapacityFor(newSize); 768 if (newSize > fBufferCapacity) { 772 int32 newCapacity = _CapacityFor(newSize); 780 _Header()->size = newSize; 782 *alignedSize = newSize - offset;
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | BlockAllocatorArea.cpp | 159 size_t newSize = max(newUsableSize + sizeof(BlockHeader), local 161 newSize = block_align_ceil(newSize); 162 if (newSize == size) { 165 } else if (newSize < size) { 167 size_t sizeDiff = size - newSize; 175 block->SetSize(newSize, true); 179 TFreeBlock *newFree = _MakeFreeBlock(block, newSize, block, 182 block->SetSize(newSize, true); 194 size_t sizeDiff = newSize 476 _MoveResizeFreeBlock(TFreeBlock *freeBlock, ssize_t offset, size_t newSize) argument [all...] |
H A D | BlockAllocatorArea.h | 38 Block *ResizeBlock(Block *block, size_t newSize, 61 size_t newSize);
|
H A D | DataContainer.cpp | 34 DataContainer::Resize(off_t newSize) argument 37 if (newSize < 0) 38 newSize = 0; 39 if (newSize != fSize) { 43 error = _Resize(newSize); 44 if (error == B_NO_MEMORY && newSize > fSize) 107 off_t newSize = offset + size; local 109 if (newSize > fSize) { 110 error = Resize(newSize); 187 DataContainer::_Resize(off_t newSize) argument 341 _ResizeLastBlock(size_t newSize) argument 403 _SwitchToSmallBufferMode(size_t newSize) argument [all...] |
H A D | DataContainer.h | 42 status_t Resize(off_t newSize); 69 status_t _Resize(off_t newSize); 70 status_t _ResizeLastBlock(size_t newSize); 73 void _SwitchToSmallBufferMode(size_t newSize);
|
H A D | Directory.h | 23 virtual status_t SetSize(off_t newSize);
|
H A D | File.cpp | 48 File::SetSize(off_t newSize) argument 52 if (newSize != oldSize) { 53 error = DataContainer::Resize(newSize);
|
H A D | File.h | 21 virtual status_t SetSize(off_t newSize);
|
H A D | List.h | 367 int32 newSize = count; local 368 if (newSize <= 0) 369 newSize = 1; 370 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize; 372 if ((size_t)newSize != fCapacity) { 374 = (item_t*)realloc(fItems, newSize * sizeof(item_t)); 377 fCapacity = newSize;
|
H A D | Node.h | 55 virtual status_t SetSize(off_t newSize) = 0;
|
H A D | OpenHashTable.h | 333 int32 newSize = max(fInitialSize, local 335 newSize = OptimalSize(newSize); 336 if (newSize != fArraySize) { 337 PRINT(("_Rehash(): %lu -> %lu (currently %lu entries)\n", fArraySize, newSize, 341 = (int32*)AreaUtils::calloc(newSize, sizeof(int32)); 344 for (int32 index = 0; index < newSize; index++) 354 uint32 hash = (element.Hash() % newSize); 364 fArraySize = newSize; 454 int32 newSize local [all...] |
H A D | SizeIndex.cpp | 164 off_t newSize = node->GetSize(); local 166 (const uint8*)&oldSize, sizeof(oldSize), (const uint8*)&newSize, 167 sizeof(newSize));
|