Home
last modified time | relevance | path

Searched refs:elementSize (Results 1 – 7 of 7) sorted by relevance

/haiku/src/system/kernel/messaging/
H A DKMessage.cpp99 int32 elementSize; // if < 0: non-fixed size member
112 return elementSize >= 0; in HasFixedElementSize()
121 *size = elementSize; in ElementAt()
122 return data + elementSize * index; in ElementAt()
280 KMessage::AddField(const char* name, type_code type, int32 elementSize, in AddField() argument
288 return _AddField(name, type, elementSize, field); in AddField()
376 int32 elementSize, int32 elementCount) in AddArray() argument
378 if (!name || type == B_ANY_TYPE || !data || elementSize < 0 in AddArray()
389 status_t error = _AddField(name, type, elementSize, &field); in AddArray()
393 return _AddFieldData(&field, data, elementSize, elementCount); in AddArray()
[all …]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DAllocationInfo.cpp54 size_t elementSize, size_t elementCount) in AddNodeTableAllocation() argument
57 fNodeTableVectorSize += vectorSize * elementSize; in AddNodeTableAllocation()
65 size_t elementSize, in AddDirectoryEntryTableAllocation() argument
69 fDirectoryEntryTableVectorSize += vectorSize * elementSize; in AddDirectoryEntryTableAllocation()
129 AllocationInfo::AddListAllocation(size_t capacity, size_t elementSize) in AddListAllocation() argument
132 fListSize += capacity * elementSize; in AddListAllocation()
H A DAllocationInfo.h16 size_t elementSize, size_t elementCount);
18 size_t elementSize,
29 void AddListAllocation(size_t capacity, size_t elementSize);
/haiku/headers/private/kernel/util/
H A DKMessage.h60 int32 elementSize = -1,
73 const void* data, int32 elementSize,
212 int32 elementSize, KMessageField* field);
214 const void* data, int32 elementSize,
263 int32 elementSize = -1);
/haiku/src/add-ons/translators/icns/
H A DICNSLoader.cpp87 iconDataSize = iconElement.elementSize - 8; in ICNSLoader()
95 dataOffset += iconElement.elementSize; in ICNSLoader()
/haiku/src/system/kernel/
H A Dheap.cpp470 size_t elementSize in dump_allocations() local
473 j++, base += elementSize) { in dump_allocations()
489 (void *)base, elementSize); in dump_allocations()
492 totalSize += elementSize; in dump_allocations()
578 size_t elementSize in dump_allocations() local
581 j++, base += elementSize) { in dump_allocations()
595 info = (heap_leak_check_info *)(base + elementSize in dump_allocations()
715 size_t elementSize = heap->bins[page->bin_index].element_size; in analyze_allocation_callers() local
716 for (uint32 j = 0; j < elementCount; j++, base += elementSize) { in analyze_allocation_callers()
730 info = (heap_leak_check_info *)(base + elementSize in analyze_allocation_callers()
/haiku/src/system/libroot/posix/malloc/debug/
H A Dheap.cpp299 size_t elementSize in dump_allocations() local
302 j++, base += elementSize) { in dump_allocations()
316 info = (heap_leak_check_info *)(base + elementSize in dump_allocations()
394 size_t elementSize in heap_validate_walls() local
397 j++, base += elementSize) { in heap_validate_walls()
411 info = (heap_leak_check_info *)(base + elementSize in heap_validate_walls()
413 if (info->size > elementSize - sizeof(addr_t) in heap_validate_walls()
416 " element size %" B_PRIuSIZE "\n", info->size, elementSize); in heap_validate_walls()