Searched refs:newSize (Results 26 - 50 of 122) sorted by relevance

12345

/haiku-fatelf/src/add-ons/kernel/file_systems/reiserfs/
H A DList.h320 int32 newSize = count; local
321 if (newSize <= 0)
322 newSize = 1;
323 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize;
325 if ((size_t)newSize != fCapacity) {
327 = (item_t*)realloc(fItems, newSize * sizeof(item_t));
330 fCapacity = newSize;
/haiku-fatelf/src/kits/support/
H A DDataIO.cpp310 size_t newSize = max_c(pos + (off_t)size, (off_t)fLength);
313 if (newSize > fMallocSize)
314 error = SetSize(newSize);
363 size_t newSize = (size + fBlockSize - 1) / fBlockSize * fBlockSize; local
366 if (char *newData = static_cast<char*>(realloc(fData, newSize))) {
368 if (newSize > fMallocSize)
369 memset(newData + fMallocSize, 0, newSize - fMallocSize);
371 fMallocSize = newSize;
H A DList.cpp479 int32 newSize = fPhysicalSize > 0 ? fPhysicalSize : fBlockSize; local
484 while (newSize < targetSize)
485 newSize <<= 1;
487 newSize = fResizeThreshold;
491 if (newSize != fPhysicalSize) {
493 = (void**)realloc(fObjectList, newSize * sizeof(void*));
496 fPhysicalSize = newSize;
/haiku-fatelf/src/system/libroot/os/
H A Darea.c49 resize_area(area_id id, size_t newSize) argument
51 return _kern_resize_area(id, newSize);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/reiserfs/
H A DList.h320 int32 newSize = count; local
321 if (newSize <= 0)
322 newSize = 1;
323 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize;
325 if ((size_t)newSize != fCapacity) {
327 = (item_t*)realloc(fItems, newSize * sizeof(item_t));
330 fCapacity = newSize;
/haiku-fatelf/headers/private/kernel/util/
H A DMultiHashTable.h155 bool _Resize(size_t newSize) argument
157 ValueType **newTable = new ValueType *[newSize];
161 for (size_t i = 0; i < newSize; i++)
169 _Insert(newTable, newSize, bucket);
177 HashTable::fTableSize = newSize;
H A DOpenHashTable.h393 bool _Resize(size_t newSize) argument
396 = (ValueType**)fAllocator.Allocate(sizeof(ValueType*) * newSize);
400 _Resize(newTable, newSize);
404 void _Resize(ValueType** newTable, size_t newSize, void** _oldTable = NULL) argument
406 for (size_t i = 0; i < newSize; i++)
414 _Insert(newTable, newSize, bucket);
426 fTableSize = newSize;
/haiku-fatelf/src/libs/icon/flat_icon/
H A DLittleEndianBuffer.cpp158 size_t newSize = fSize; local
159 while (newSize < neededSize)
160 newSize += CHUNK_SIZE;
163 if (newSize > fSize)
164 _SetSize(newSize);
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DBlockAllocatorArea.cpp159 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 DAttribute.cpp52 Attribute::SetSize(off_t newSize) argument
56 if (newSize != oldSize) {
60 error = DataContainer::Resize(newSize);
H A DOpenHashTable.h332 int32 newSize = max(fInitialSize, local
334 newSize = OptimalSize(newSize);
335 if (newSize != fArraySize) {
336 PRINT(("_Rehash(): %lu -> %lu (currently %lu entries)\n", fArraySize, newSize,
340 = (int32*)AreaUtils::calloc(newSize, sizeof(int32));
343 for (int32 index = 0; index < newSize; index++)
353 uint32 hash = (element.Hash() % newSize);
363 fArraySize = newSize;
453 int32 newSize local
[all...]
H A DList.h366 int32 newSize = count; local
367 if (newSize <= 0)
368 newSize = 1;
369 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize;
371 if ((size_t)newSize != fCapacity) {
373 = (item_t*)realloc(fItems, newSize * sizeof(item_t));
376 fCapacity = newSize;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DBlockAllocatorArea.cpp159 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 DOpenHashTable.h333 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 DList.h367 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;
/haiku-fatelf/src/kits/storage/
H A DResourceStrings.cpp266 \param newSize the new hash table size
272 BResourceStrings::_Rehash(int32 newSize) argument
275 if (newSize > 0 && newSize != fHashTableSize) {
278 = new(nothrow) _string_id_hash*[newSize];
280 memset(newHashTable, 0, sizeof(_string_id_hash*) * newSize);
286 int32 newPos = entry->id % newSize;
295 fHashTableSize = newSize;
/haiku-fatelf/headers/private/shared/
H A DOpenHashTable.h352 int32 newSize = int32(fElementCount * 1.73 * fMaxLoadFactor); local
353 newSize = (fInitialSize > newSize ? fInitialSize : newSize);
354 if (newSize != fArraySize) {
356 int32 *newHashArray = (int32*)calloc(newSize, sizeof(int32));
359 for (int32 index = 0; index < newSize; index++)
369 uint32 hash = (element.Hash() % newSize);
379 fArraySize = newSize;
469 int32 newSize local
[all...]
/haiku-fatelf/src/apps/webpositive/support/
H A DOpenHashTable.h352 int32 newSize = int32(fElementCount * 1.73 * fMaxLoadFactor); local
353 newSize = (fInitialSize > newSize ? fInitialSize : newSize);
354 if (newSize != fArraySize) {
356 int32 *newHashArray = (int32*)calloc(newSize, sizeof(int32));
359 for (int32 index = 0; index < newSize; index++)
369 uint32 hash = (element.Hash() % newSize);
379 fArraySize = newSize;
469 int32 newSize local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/
H A DOpenHashTable.h348 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...]
/haiku-fatelf/src/kits/media/
H A DRealtimeAlloc.cpp418 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-fatelf/src/add-ons/kernel/network/ppp/shared/libkernelppp/headers/
H A DTemplateList.h371 int32 newSize = count; local
372 if (newSize <= 0)
373 newSize = 1;
374 newSize = ((newSize - 1) / fChunkSize + 1) * fChunkSize;
376 if ((size_t)newSize != fCapacity) {
378 = (item_t*)realloc(fItems, newSize * sizeof(item_t));
381 fCapacity = newSize;
/haiku-fatelf/src/system/kernel/vm/
H A DVMKernelAddressSpace.cpp230 VMKernelAddressSpace::CanResizeArea(VMArea* area, size_t newSize) argument
234 if (newSize <= range->size)
248 return newSize - range->size <= nextRange->size;
253 VMKernelAddressSpace::ResizeArea(VMArea* _area, size_t newSize, argument
257 newSize);
262 if (newSize == range->size)
267 if (newSize < range->size) {
271 nextRange->size += range->size - newSize;
272 nextRange->base = range->base + newSize;
278 range->base + newSize, rang
321 ShrinkAreaHead(VMArea* _area, size_t newSize, uint32 allocationFlags) argument
368 ShrinkAreaTail(VMArea* area, size_t newSize, uint32 allocationFlags) argument
[all...]
/haiku-fatelf/src/kits/interface/textview_support/
H A DWidthBuffer.cpp330 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-fatelf/src/system/runtime_loader/
H A Dheap.cpp240 realloc(void *allocation, size_t newSize) argument
243 if (newSize == 0) {
250 return malloc(newSize);
254 if (chunk->Size() >= newSize)
258 void* newAllocation = malloc(newSize);
/haiku-fatelf/src/add-ons/kernel/partitioning_systems/gpt/
H A Defi_gpt.cpp190 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...]

Completed in 228 milliseconds

12345