Searched refs:newSize (Results 26 - 50 of 110) sorted by last modified time

12345

/haiku/headers/build/
H A DBeOSBuildCompatibility.h108 int _haiku_build_ftruncate(int fd, off_t newSize);
151 # define ftruncate(fd, newSize) _haiku_build_ftruncate(fd, newSize)
/haiku/headers/posix/
H A Dunistd.h360 extern int ftruncate(int fd, off_t newSize);
361 extern int truncate(const char *path, off_t newSize);
H A Dstdlib.h53 extern void *realloc(void *oldPointer, size_t newSize);
H A Dmalloc.h17 extern void *realloc(void *oldPointer, size_t newSize);
/haiku/src/system/kernel/vm/
H A DVMAnonymousCache.cpp583 VMAnonymousCache::Resize(off_t newSize, int priority) argument
586 if (fNoSwapPages->Resize(PAGE_ALIGN(newSize) >> PAGE_SHIFT) != B_OK)
590 _FreeSwapPageRange(newSize + B_PAGE_SIZE - 1,
592 return VMCache::Resize(newSize, priority);
H A DVMAnonymousCache.h45 virtual status_t Resize(off_t newSize, int priority);
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DDataContainer.h25 status_t Resize(off_t newSize);
H A DAttribute.cpp55 Attribute::SetSize(off_t newSize) argument
59 if (newSize != oldSize) {
63 error = DataContainer::Resize(newSize);
/haiku/src/add-ons/kernel/file_systems/ext2/
H A Dext2.h642 void SetSize(off_t newSize) argument
644 size = B_HOST_TO_LENDIAN_INT32(newSize & 0xFFFFFFFF);
646 size_high = B_HOST_TO_LENDIAN_INT32(newSize >> 32);
666 void SetExtraInodeSize(uint16 newSize) argument
668 extra_inode_size = B_HOST_TO_LENDIAN_INT16(newSize);
/haiku/src/add-ons/kernel/network/stack/
H A Dnet_buffer.cpp159 static status_t trim_data(net_buffer* _buffer, size_t newSize);
1885 /*! Trims the buffer to the specified \a newSize by removing space from
1889 trim_data(net_buffer* _buffer, size_t newSize) argument
1892 TRACE(("%d: trim_data(buffer %p, newSize = %ld, buffer size = %" B_PRIu32 ")\n",
1893 find_thread(NULL), buffer, newSize, buffer->size));
1894 T(Trim(buffer, newSize));
1899 if (newSize > buffer->size)
1901 if (newSize == buffer->size)
1904 data_node* node = get_node_at_offset(buffer, newSize);
1910 int32 diff = node->used + node->offset - newSize;
[all...]
/haiku/headers/private/kernel/vm/
H A DVMCache.h133 virtual status_t Resize(off_t newSize, int priority);
H A Dvm.h185 status_t _user_resize_area(area_id area, size_t newSize);
/haiku/src/system/boot/loader/
H A Dvfs.cpp939 ftruncate(int fd, off_t newSize) argument
H A Dheap.cpp321 size_t newSize = (addr_t)chunk - (addr_t)this; local
322 chunk->fSize = fSize - newSize;
325 fSize = newSize;
505 realloc(void* oldBuffer, size_t newSize) argument
507 if (newSize == 0) {
508 TRACE("realloc(%p, %lu) -> NULL\n", oldBuffer, newSize);
522 newSize);
529 if (oldSize >= newSize
530 && (oldSize < 128 || newSize > oldSize / 3)) {
532 oldBuffer, newSize);
[all...]
/haiku/src/system/libroot/posix/malloc_debug/
H A Dmalloc_debug_api.cpp270 realloc(void* address, size_t newSize) argument
272 return sCurrentHeap->realloc(address, newSize);
H A Dheap.cpp1392 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 Dguarded_heap.cpp752 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);
/haiku/src/system/libroot/os/
H A Darea.c56 resize_area(area_id id, size_t newSize) argument
58 return _kern_resize_area(id, newSize);
/haiku/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/src/build/libroot/
H A Dfunction_remapper.cpp169 ftruncate(int fd, off_t newSize) argument
173 return _haiku_build_ftruncate(fd, newSize);
/haiku/headers/private/kernel/
H A Dvfs.h77 status_t vfs_resize_fd_table(struct io_context* context, uint32 newSize);
/haiku/src/add-ons/kernel/partitioning_systems/intel/
H A Dwrite_support.cpp150 off_t newSize = *size; local
152 if (newSize == partition->size)
155 if (newSize < 0)
156 newSize = 0;
158 newSize = sector_align(newSize, partition->block_size);
161 if (newSize > partition->size) {
162 *size = newSize;
168 // TODO: shouldn't be just: off_t currentEnd = newSize; ??? probably not
170 off_t currentEnd = partition->offset + newSize;
[all...]
/haiku/src/system/runtime_loader/
H A Dheap.cpp203 size_t newSize = (addr_t)chunk - (addr_t)this; local
204 chunk->fSize = fSize - newSize;
207 fSize = newSize;
377 realloc(void* oldBuffer, size_t newSize) argument
379 if (newSize == 0) {
380 TRACE(("realloc(%p, %lu) -> NULL\n", oldBuffer, newSize));
393 if (oldSize >= newSize
394 && (oldSize < 128 || newSize > oldSize / 3)) {
396 oldBuffer, newSize));
401 void* newBuffer = malloc(newSize);
[all...]
/haiku/src/apps/haikudepot/ui_generic/
H A DBitmapView.cpp132 BSize newSize = MinSize(); local
133 if (size != newSize)
/haiku/src/system/kernel/messaging/
H A DKMessage.cpp972 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;

Completed in 197 milliseconds

12345