Searched refs:areas (Results 1 - 17 of 17) sorted by relevance

/haiku/src/tests/system/kernel/
H A Dset_area_protection_test1.cpp51 // allocate read-only areas
53 area_id areas[kAreaCount]; local
56 areas[0] = create_test_area("area0", &areaAddresses[0], B_READ_AREA);
57 areas[1] = create_test_area("area1", &areaAddresses[1], B_READ_AREA);
58 areas[2] = create_test_area("area2", &areaAddresses[2], B_READ_AREA);
60 areas[3] = area_for(areaAddresses[3]);
64 B_READ_AREA | B_WRITE_AREA, areas[2]);
69 printf("parent: areas[%d]: %ld, %p (0x%08x)\n", i, areas[i],
95 // get the IDs of the copied areas
[all...]
/haiku/headers/private/media/
H A DNotifications.h72 void BuffersCreated(area_info* areas, int32 count);
/haiku/src/system/kernel/vm/
H A DVMCache.cpp630 return areas == NULL && temporary && !consumers.IsEmpty()
653 areas = NULL;
693 if (areas != NULL)
694 panic("cache %p to be deleted still has areas", this);
998 area->cache_next = areas;
1002 areas = area;
1029 if (areas == area)
1030 areas = area->cache_next;
1036 /*! Transfers the areas from \a fromCache to this cache. This cache must not
1037 have areas ye
[all...]
H A DVMAddressSpaceLocking.cpp475 /*! Adds all address spaces of the areas associated with the given area's cache,
477 until the situation is stable (i.e. the neither cache nor cache's areas
510 // add all areas
511 VMArea* firstArea = cache->areas;
545 if (cache == oldCache && firstArea == cache->areas) {
H A Dvm.cpp702 bool onlyCacheUser = cache->areas == area && area->cache_next == NULL
955 /*! Deletes or cuts all areas in the given address range.
965 // Check, whether the caller is allowed to modify the concerned areas.
988 // Failing after already messing with areas is ugly, but we
1006 if (cache->areas != area || area->cache_next != NULL
1166 // insert the area in the global areas map
1265 - All areas intersecting with the range are checked (respectively all until
1270 - None of the areas' caches are allowed to be locked.
1574 // For full lock or contiguous areas we're also going to map the pages and
1616 // For full lock areas reserv
[all...]
/haiku/src/system/libroot/posix/malloc_debug/
H A Dguarded_heap.cpp193 guarded_heap_area* areas; member in struct:guarded_heap
459 area->next = heap.areas;
460 heap.areas = area;
580 for (guarded_heap_area* area = heap.areas; area != NULL;
609 for (guarded_heap_area* area = heap.areas; area != NULL;
828 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL;
961 guarded_heap_area* area = heap.areas;
967 printf("areas: %p (%" B_PRIuSIZE ")\n", heap.areas, areaCount);
978 for (guarded_heap_area* area = heap.areas; are
[all...]
H A Dheap.cpp143 heap_area * areas; // sorted so that the desired area is always first member in struct:heap_allocator_s
144 heap_area * all_areas; // all areas including full ones
263 dump_allocator(heap_allocator *heap, bool areas, bool bins) argument
271 if (areas)
286 // go through all the pages in all the areas
381 // go through all the pages in all the areas
540 // validate the areas
541 area = heap->areas;
698 if (heap->areas == NULL) {
701 heap->areas
[all...]
/haiku/src/system/kernel/
H A Dguarded_heap.cpp69 guarded_heap_area* areas; member in struct:guarded_heap
362 area->next = heap.areas;
363 heap.areas = area;
419 for (guarded_heap_area* area = heap.areas; area != NULL;
449 for (guarded_heap_area* area = heap.areas; area != NULL;
617 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL;
672 for (guarded_heap_area* candidate = sGuardedHeap.areas; candidate != NULL;
773 guarded_heap_area* area = heap->areas;
779 kprintf("areas: %p (%" B_PRIuSIZE ")\n", heap->areas, areaCoun
[all...]
H A Dheap.cpp124 heap_area * areas; // sorted so that the desired area is always first member in struct:heap_allocator_s
125 heap_area * all_areas; // all areas including full ones
365 dump_allocator(heap_allocator *heap, bool areas, bool bins) argument
373 if (areas)
458 // go through all the pages in all the areas
565 // go through all the pages in all the areas
702 // go through all the pages in all the areas
907 // validate the areas
908 area = heap->areas;
1064 if (heap->areas
[all...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/private/
H A DRequests.cpp408 RequestRelocator(int32 requestBufferSize, area_id* areas, int32* count) argument
410 fAreas(areas),
510 area_id* areas, int32* count)
512 if (!request || !areas || !count)
514 RequestRelocator task(requestBufferSize, areas, count);
509 relocate_request(Request* request, int32 requestBufferSize, area_id* areas, int32* count) argument
/haiku/src/kits/media/
H A DNotifications.cpp185 BuffersCreated(area_info* areas, int32 count) argument
191 msg.AddData("clone_info", B_RAW_TYPE, &areas[i], sizeof(area_info));
/haiku/src/servers/app/stackandtile/
H A DStackAndTile.cpp623 const WindowAreaList& areas = group->GetAreaList(); local
624 int32 areasCount = areas.CountItems();
626 WindowArea* currentArea = areas.ItemAt(i);
H A DSATGroup.cpp141 const WindowAreaList& areas = fGroup->GetAreaList(); local
142 for (int32 i = 0; i < areas.CountItems(); i++) {
143 WindowArea* area = areas.ItemAt(i);
1363 // don't _FollowSeed of invalid areas
/haiku/src/kits/debugger/controllers/
H A DDebugReportGenerator.cpp371 BObjectList<AreaInfo> areas(20, true);
372 status_t result = fDebuggerInterface->GetAreaInfos(areas);
376 areas.SortItems(&_CompareAreas);
389 for (int32 i = 0; (info = areas.ItemAt(i)) != NULL; i++) {
/haiku/headers/private/kernel/vm/
H A DVMCache.h190 VMArea* areas; member in struct:VMCache
/haiku/src/system/kernel/cache/
H A Dfile_cache.cpp292 if (cache->consumers.IsEmpty() && cache->areas == NULL
/haiku/headers/private/userlandfs/private/
H A DRequests.h2402 area_id* areas, int32* count);

Completed in 158 milliseconds