Searched refs:newSize (Results 1 - 25 of 110) sorted by path

12345

/haiku/headers/os/interface/
H A DRegion.h91 bool _SetSize(int32 newSize);
/haiku/headers/os/storage/
H A DResourceStrings.h57 status_t _Rehash(int32 newSize);
/haiku/headers/private/fs_shell/
H A Dfssh_unistd.h57 extern int fssh_ftruncate(int fd, fssh_off_t newSize);
58 extern int fssh_truncate(const char *path, fssh_off_t newSize);
/haiku/headers/private/kernel/util/
H A DHeap.h276 int newSize = max_c(max_c(fSize * 2, 4), minimalSize); local
278 size_t arraySize = newSize * sizeof(Element*);
285 fSize = newSize;
H A DMinMaxHeap.h328 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;
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;
/haiku/headers/private/net/
H A Dnet_buffer.h67 status_t (*trim)(net_buffer* buffer, size_t newSize);
/haiku/headers/private/shared/
H A DArray.h249 int32 newSize = fSize + delta; local
251 while (newCapacity < newSize)
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DIndex.cpp340 off_t newSize = inode->Size(); local
343 (uint8*)&oldSize, sizeof(int64), (uint8*)&newSize, sizeof(int64),
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DMetadataCache.cpp75 MetadataCache::GrowFile(size_t newSize) argument
79 fStatCache.st_size = max_c((off_t)newSize, fStatCache.st_size);
H A DMetadataCache.h35 void GrowFile(size_t newSize);
H A DRPCCallbackServer.cpp105 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;
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DSizeIndex.cpp205 off_t newSize = node->FileSize(); local
206 if (newSize == oldSize)
239 (const uint8*)&oldSize, sizeof(oldSize), (const uint8*)&newSize,
240 sizeof(newSize));
/haiku/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/src/add-ons/kernel/network/stack/
H A Dsimple_net_buffer.cpp67 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/apps/patchbay/
H A DPatchView.cpp382 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/bin/rc/
H A Dparser.y688 resize_data(data_t data, size_t newSize)
690 if (newSize == 0) {
691 abort_compile(RDEF_COMPILE_ERR, "invalid size %lu", newSize);
692 } else if (data.size != newSize) {
693 void* newBuffer = alloc_mem(newSize);
695 memset(newBuffer, 0, newSize);
696 memcpy(newBuffer, data.ptr, min(data.size, newSize));
699 ((char*)newBuffer)[newSize - 1] = '\0';
703 data.size = newSize;
/haiku/src/build/libroot/
H A Dremapped_functions.h36 int _haiku_build_ftruncate(int fd, off_t newSize);
/haiku/src/kits/app/
H A DLinkSender.cpp231 LinkSender::AdjustBuffer(size_t newSize, char **_oldBuffer) argument
234 if (newSize <= kInitialBufferSize)
235 newSize = kInitialBufferSize;
236 else if (newSize > kMaxBufferSize)
238 else if (newSize > kInitialBufferSize)
239 newSize = (newSize + B_PAGE_SIZE - 1) & ~(B_PAGE_SIZE - 1);
241 if (newSize == fBufferSize) {
249 char *buffer = (char *)malloc(newSize);
259 fBufferSize = newSize;
[all...]
/haiku/src/kits/interface/
H A DShape.cpp600 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/src/kits/interface/textview_support/
H A DTextGapBuffer.cpp171 uint32 newSize = numChars * charLen;
173 if ((uint32)fScratchSize < newSize) {
174 fScratchBuffer = (char*)realloc(fScratchBuffer, newSize);
175 fScratchSize = newSize;
185 *_numBytes = newSize;
218 uint32 newSize = numChars * bulletCharLen + 1;
220 if ((uint32)fScratchSize < newSize) {
221 fScratchBuffer = (char*)realloc(fScratchBuffer, newSize);
222 fScratchSize = newSize;
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/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/src/kits/network/libnetapi/
H A DDynamicBuffer.cpp147 size_t newSize;
149 newSize = (fBufferSize + size) * 2;
151 newSize = size;
153 unsigned char* newBuffer = new (std::nothrow) unsigned char[newSize];
164 fBufferSize = newSize;
/haiku/src/kits/support/
H A DDataIO.cpp498 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;

Completed in 107 milliseconds

12345