Home
last modified time | relevance | path

Searched refs:areas (Results 1 – 25 of 30) sorted by relevance

12

/haiku/src/tests/system/kernel/
H A Dset_area_protection_test1.cpp53 area_id areas[kAreaCount]; in main() local
56 areas[0] = create_test_area("area0", &areaAddresses[0], B_READ_AREA); in main()
57 areas[1] = create_test_area("area1", &areaAddresses[1], B_READ_AREA); in main()
58 areas[2] = create_test_area("area2", &areaAddresses[2], B_READ_AREA); in main()
60 areas[3] = area_for(areaAddresses[3]); in main()
64 B_READ_AREA | B_WRITE_AREA, areas[2]); in main()
69 printf("parent: areas[%d]: %ld, %p (0x%08x)\n", i, areas[i], in main()
98 parentAreas[i] = areas[i]; in main()
99 areas[i] = area_for(areaAddresses[i]); in main()
103 printf("child: areas[%d]: %ld, %p\n", i, areas[i], in main()
[all …]
/haiku/src/system/kernel/
H A Dguarded_heap.cpp69 guarded_heap_area* areas; member
362 area->next = heap.areas; in guarded_heap_area_init()
363 heap.areas = area; in guarded_heap_area_init()
419 for (guarded_heap_area* area = heap.areas; area != NULL; in guarded_heap_allocate()
449 for (guarded_heap_area* area = heap.areas; area != NULL; in guarded_heap_get_locked_area_for()
617 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL; in dump_guarded_heap_page()
672 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL; in dump_guarded_heap_area()
773 guarded_heap_area* area = heap->areas; in dump_guarded_heap()
779 kprintf("areas: %p (%" B_PRIuSIZE ")\n", heap->areas, areaCount); in dump_guarded_heap()
816 guarded_heap_area* area = sGuardedHeap.areas; in dump_guarded_heap_allocations()
[all …]
H A Dheap.cpp124 heap_area * areas; // sorted so that the desired area is always first member
365 dump_allocator(heap_allocator *heap, bool areas, bool bins) in dump_allocator() argument
373 if (areas) in dump_allocator()
908 area = heap->areas; in heap_validate_heap()
1064 if (heap->areas == NULL) { in heap_add_area()
1067 heap->areas = area; in heap_add_area()
1070 heap_area *lastArea = heap->areas; in heap_add_area()
1122 if (heap->areas == area) in heap_remove_area()
1123 heap->areas = area->next; in heap_remove_area()
1176 heap->areas = heap->all_areas = NULL; in heap_create_allocator()
[all …]
/haiku/src/system/kernel/vm/
H A DVMCache.cpp614 return areas == NULL && temporary && !unmergeable in _IsMergeable()
637 areas = NULL; in Init()
678 if (areas != NULL) in Delete()
983 area->cache_next = areas; in InsertAreaLocked()
987 areas = area; in InsertAreaLocked()
1014 if (areas == area) in RemoveArea()
1015 areas = area->cache_next; in RemoveArea()
1029 ASSERT(areas == NULL); in TransferAreas()
1031 areas = fromCache->areas; in TransferAreas()
1032 fromCache->areas = NULL; in TransferAreas()
[all …]
H A DVMAddressSpaceLocking.cpp527 VMArea* firstArea = cache->areas; in AddAreaCacheAndLock()
561 if (cache == oldCache && firstArea == cache->areas) { in AddAreaCacheAndLock()
H A Dvm_debug.cpp334 if (cache->areas != NULL) { in dump_caches_recursively()
335 VMArea* area = cache->areas; in dump_caches_recursively()
H A Dvm.cpp776 bool onlyCacheUser = cache->areas == area && area->cache_next == NULL in cut_area()
1103 if (cache->areas != area || area->cache_next != NULL in discard_area_range()
2774 for (VMArea* tempArea = upperCache->areas; tempArea != NULL; in vm_copy_on_write_area()
2801 for (VMArea* tempArea = upperCache->areas; tempArea != NULL; in vm_copy_on_write_area()
3072 for (VMArea* otherArea = cache->areas; otherArea != NULL; in vm_set_area_protection()
4881 for (VMArea* current = cache->areas; current != NULL; in vm_resize_area()
4891 for (VMArea* current = cache->areas; current != NULL; in vm_resize_area()
4920 for (VMArea* current = cache->areas; current != NULL; in vm_resize_area()
4974 for (VMArea* current = cache->areas; current != NULL; in vm_resize_area()
/haiku/docs/develop/kernel/vm/
H A DVM_TODOs1 - unmap the page of all areas from the cache when a newly added page shadows one
H A DVM_Locking5 fields: areas, area_hint (is currently written in vm_area_lookup() without a write lock!),
33 cache, areas: guarded by lock
/haiku/docs/develop/drivers/disk/
H A Dioctls.rst51 Mark the listed areas on disk as unused, allowing future reads to these areas to return
/haiku/src/system/libroot/posix/malloc/debug/
H A Dguarded_heap.cpp194 guarded_heap_area* areas; member
467 area->next = heap.areas; in guarded_heap_area_init()
468 heap.areas = area; in guarded_heap_area_init()
589 for (guarded_heap_area* area = heap.areas; area != NULL; in guarded_heap_allocate()
618 for (guarded_heap_area* area = heap.areas; area != NULL; in guarded_heap_get_locked_area_for()
837 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL; in dump_guarded_heap_page()
970 guarded_heap_area* area = heap.areas; in dump_guarded_heap()
976 printf("areas: %p (%" B_PRIuSIZE ")\n", heap.areas, areaCount); in dump_guarded_heap()
987 for (guarded_heap_area* area = heap.areas; area != NULL; in dump_allocations()
1068 for (guarded_heap_area* area = sGuardedHeap.areas; area != NULL; in guarded_heap_dump_heaps()
[all …]
H A Dheap.cpp143 heap_area * areas; // sorted so that the desired area is always first member
263 dump_allocator(heap_allocator *heap, bool areas, bool bins) in dump_allocator() argument
271 if (areas) in dump_allocator()
541 area = heap->areas; in heap_validate_heap()
698 if (heap->areas == NULL) { in heap_add_area()
701 heap->areas = area; in heap_add_area()
704 heap_area *lastArea = heap->areas; in heap_add_area()
752 if (heap->areas == area) in heap_remove_area()
753 heap->areas = area->next; in heap_remove_area()
793 heap->areas = heap->all_areas = NULL; in heap_create_allocator()
[all …]
/haiku/src/add-ons/kernel/drivers/graphics/et6x00/
H A Dreadme6 - hardware accelerated rectangular areas filling.
/haiku/headers/private/media/
H A DNotifications.h72 void BuffersCreated(area_info* areas, int32 count);
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/
H A DRequests.cpp408 RequestRelocator(int32 requestBufferSize, area_id* areas, int32* count) in RequestRelocator()
410 fAreas(areas), in RequestRelocator()
510 area_id* areas, int32* count) in relocate_request() argument
512 if (!request || !areas || !count) in relocate_request()
514 RequestRelocator task(requestBufferSize, areas, count); in relocate_request()
/haiku/src/kits/media/
H A DNotifications.cpp185 BuffersCreated(area_info* areas, int32 count) in BuffersCreated() argument
191 msg.AddData("clone_info", B_RAW_TYPE, &areas[i], sizeof(area_info)); in BuffersCreated()
/haiku/src/kits/debugger/controllers/
H A DDebugReportGenerator.cpp370 BObjectList<AreaInfo> areas(20, true); in _DumpAreas() local
371 status_t result = fDebuggerInterface->GetAreaInfos(areas); in _DumpAreas()
375 areas.SortItems(&_CompareAreas); in _DumpAreas()
388 for (int32 i = 0; (info = areas.ItemAt(i)) != NULL; i++) { in _DumpAreas()
/haiku/src/servers/app/stackandtile/
H A DStackAndTile.cpp623 const WindowAreaList& areas = group->GetAreaList(); in _ActivateWindow() local
624 int32 areasCount = areas.CountItems(); in _ActivateWindow()
626 WindowArea* currentArea = areas.ItemAt(i); in _ActivateWindow()
H A DSATGroup.cpp141 const WindowAreaList& areas = fGroup->GetAreaList(); in DoGroupLayout() local
142 for (int32 i = 0; i < areas.CountItems(); i++) { in DoGroupLayout()
143 WindowArea* area = areas.ItemAt(i); in DoGroupLayout()
/haiku/docs/user/interface/
H A DGroupLayout.dox30 area, but different horizontal areas. In a vertical BGroupLayout, each
31 BLayoutItem is given the same horizontal area, but different vertical areas.
/haiku/headers/private/kernel/vm/
H A DVMCache.h190 VMArea* areas;
/haiku/docs/develop/servers/app_server/
H A DDesktopClasses.rst154 3. If the RootLayer was resized larger, Invalidate the new areas
/haiku/docs/develop/kernel/
H A Ddevice_manager_introduction.rst259 areas that could use improvements or are problematic under certain
/haiku/src/system/kernel/cache/
H A Dfile_cache.cpp294 if (cache->consumers.IsEmpty() && cache->areas == NULL in reserve_pages()
/haiku/headers/private/userlandfs/private/
H A DRequests.h2402 area_id* areas, int32* count);

12