Searched refs:area (Results 251 - 275 of 279) sorted by path

<<1112

/haiku/src/system/kernel/
H A Delf.cpp1331 // we now no longer need to write to the text area anymore
1358 // find the runtime loader debug area
1359 VMArea* area; local
1362 (area = it.Next()) != NULL;) {
1363 if (strcmp(area->name, RUNTIME_LOADER_DEBUG_AREA_NAME) == 0)
1367 if (area == NULL)
1371 if (!_Read((runtime_loader_debug_area*)area->Base(), fDebugArea))
1926 // correct area protection will be set after relocation
2014 dprintf("error allocating bss area: %s!\n", strerror(id));
2070 // set correct area protectio
[all...]
H A Dguarded_heap.cpp53 area_id area; member in struct:guarded_heap_area
156 guarded_heap_page_protect(guarded_heap_area& area, size_t pageIndex, argument
159 if (area.area < 0)
162 addr_t address = area.base + pageIndex * B_PAGE_SIZE;
163 vm_set_kernel_area_debug_protection(area.protection_cookie, (void*)address,
169 guarded_heap_page_allocate(guarded_heap_area& area, size_t startPageIndex, argument
180 guarded_heap_page& page = area.pages[startPageIndex + i];
206 list_remove_item(&area.free_list, &page);
210 guarded_heap_page_protect(area, startPageInde
224 guarded_heap_free_page(guarded_heap_area& area, size_t pageIndex, bool force = false) argument
265 guarded_heap_area_allocate(guarded_heap_area& area, size_t size, size_t alignment, uint32 flags, bool& grow) argument
333 guarded_heap_area* area = (guarded_heap_area*)baseAddress; local
467 guarded_heap_area_page_index_for(guarded_heap_area& area, void* address) argument
500 guarded_heap_area_free(guarded_heap_area& area, void* address, uint32 flags) argument
547 guarded_heap_area* area = guarded_heap_get_locked_area_for(sGuardedHeap, local
616 guarded_heap_area* area = NULL; local
671 guarded_heap_area* area = NULL; local
773 guarded_heap_area* area = heap->areas; local
816 guarded_heap_area* area = sGuardedHeap.areas; local
[all...]
H A Dheap.cpp64 area_id area; member in struct:heap_area_s
84 heap_area * area; member in struct:heap_page_s
124 heap_area * areas; // sorted so that the desired area is always first
131 area_id area; member in struct:area_allocation_info_s
350 heap_area *area = heap->all_areas; local
351 while (area) {
352 kprintf("\tarea %p: area: %" B_PRId32 "; base: %p; size: %zu; page_count: "
353 "%" B_PRIu32 "; free_pages: %p (%" B_PRIu32 " entr%s)\n", area,
354 area->area, (voi
459 heap_area *area = heap->all_areas; local
566 heap_area *area = heap->all_areas; local
703 heap_area *area = heap->all_areas; local
858 heap_area *area = heap->all_areas; local
1025 heap_area *area = (heap_area *)base; local
1110 heap_remove_area(heap_allocator *heap, heap_area *area) argument
1218 heap_free_pages_added(heap_allocator *heap, heap_area *area, uint32 pageCount) argument
1260 heap_free_pages_removed(heap_allocator *heap, heap_area *area, uint32 pageCount) argument
1336 heap_area *area = heap->areas; local
1446 heap_area *area = heap->areas; local
1599 heap_area *area = heap->all_areas; local
1779 heap_area *area = heap->all_areas; local
2385 area_id area = area_for(address); local
2438 area_id area = area_for(address); local
[all...]
H A Dsem.cpp406 area_id area; local
423 area = create_area_etc(B_SYSTEM_TEAM, "sem_table",
427 if (area < 0)
H A Dteam.cpp1165 kprintf("user data: %p (area %" B_PRId32 ")\n",
1429 team->user_data_area = create_area_etc(team->id, "user area",
1595 // Main stack area layout is currently as follows (starting from 0):
1651 // Clone commpage area
1834 // create the user data area
2192 if (info.area == parentTeam->user_data_area) {
2193 // don't clone the user area; just create a new one
2201 area_id area = vm_copy_area(team->address_space->ID(), info.name, local
2202 &address, B_CLONE_ADDRESS, info.area);
2203 if (area < B_O
[all...]
/haiku/src/system/kernel/messaging/
H A DMessagingService.cpp55 MessagingArea *area = new(nothrow) MessagingArea; local
56 if (!area)
59 // create the area
60 area->fID = create_area("messaging", (void**)&area->fHeader,
63 if (area->fID < 0) {
64 delete area;
69 area->fSize = kMessagingAreaSize;
70 area->fLockSem = lockSem;
71 area
222 SetNextArea(MessagingArea *area) argument
361 MessagingArea *area = fFirstArea; local
389 MessagingArea *area; local
420 _AllocateCommand(int32 commandWhat, int32 size, MessagingArea *&area, void *&data, bool &wasEmpty) argument
[all...]
/haiku/src/system/kernel/slab/
H A DMemoryManager.cpp41 static const char* const kSlabAreaName = "slab area";
177 AllocateArea(Area* area, uint32 flags) argument
180 fArea(area),
188 out.Print("slab memory manager alloc area: flags: %#" B_PRIx32
200 AddArea(Area* area) argument
203 fArea(area)
210 out.Print("slab memory manager add area: %p", fArea);
220 FreeArea(Area* area, bool areaRemoved, uint32 flags) argument
223 fArea(area),
232 out.Print("slab memory manager free area
480 Area* area = sFreeAreas; local
574 Area* area = _AreaForAddress((addr_t)pages); local
625 area_id area = create_area_etc(VMAddressSpace::KernelID(), local
709 Area* area = sAreaTable.Lookup(areaBase); local
716 VMArea* area = addressSpace->LookupArea((addr_t)pages); local
776 Area* area = sAreaTable.Lookup(_AreaBaseAddressForAddress((addr_t)address)); local
782 VMArea* area = addressSpace->LookupArea((addr_t)address); local
817 Area* area = sAreaTable.Lookup(_AreaBaseAddressForAddress((addr_t)address)); local
852 Area* area; local
917 Area* area = sAreaTable.Lookup(areaBase); local
1004 Area* area; local
1166 _FreeChunk(Area* area, MetaChunk* metaChunk, Chunk* chunk, addr_t chunkAddress, bool alreadyUnmapped, uint32 flags) argument
1250 Area* area = metaChunk->GetArea(); local
1276 _AddArea(Area* area) argument
1303 Area* area; local
1382 _FreeArea(Area* area, bool areaRemoved, uint32 flags) argument
1552 _UnmapFreeChunksEarly(Area* area) argument
1601 _ConvertEarlyArea(Area* area) argument
1645 Area* area = metaChunk->GetArea(); local
[all...]
/haiku/src/system/kernel/vm/
H A DVMAddressSpaceLocking.cpp28 VMArea* area = VMAreas::LookupLocked(id); local
29 if (area != NULL) {
30 addressSpace = area->address_space;
118 AddressSpaceReadLocker::SetFromArea(area_id areaID, VMArea*& area) argument
126 area = VMAreas::Lookup(areaID);
128 if (area == NULL || area->address_space != fSpace) {
238 AddressSpaceWriteLocker::SetFromArea(area_id areaID, VMArea*& area) argument
246 area = VMAreas::Lookup(areaID);
248 if (area
259 SetFromArea(team_id team, area_id areaID, bool allowKernel, VMArea*& area) argument
295 SetFromArea(team_id team, area_id areaID, VMArea*& area) argument
498 VMArea* area; local
[all...]
H A DVMArea.cpp64 range of this area.
65 The area's top cache must be locked.
80 /*! Adds the given wired range to this area.
81 The area's top cache must be locked.
86 ASSERT(range->area == NULL);
88 range->area = this;
93 /*! Removes the given wired range from this area.
95 The area's top cache must be locked.
100 ASSERT(range->area == this);
103 range->area
217 VMArea* area = LookupLocked(id); local
248 Insert(VMArea* area) argument
257 Remove(VMArea* area) argument
[all...]
H A DVMCache.cpp286 InsertArea(VMCache* cache, VMArea* area) argument
289 fArea(area)
296 out.Print("vm cache insert area: cache: %p, area: %p", fCache,
312 RemoveArea(VMCache* cache, VMArea* area) argument
315 fArea(area)
322 out.Print("vm cache remove area: cache: %p, area: %p", fCache,
400 cache_stack_find_area_cache(const TraceEntryIterator& baseIterator, void* area) argument
404 // find the previous "insert area" entr
991 InsertAreaLocked(VMArea* area) argument
1011 RemoveArea(VMArea* area) argument
[all...]
H A DVMKernelAddressSpace.cpp53 /*! Verifies that an area with the given aligned base and size fits into
55 \param base Minimum base address valid for the area.
57 \param size The size of the area.
127 return range != NULL ? range->area : NULL;
138 return range != NULL ? range->area : NULL;
156 VMKernelArea* area = static_cast<VMKernelArea*>(_area); local
157 object_cache_delete(fAreaObjectCache, area);
169 VMKernelArea* area = range->area;
170 return area
200 VMKernelArea* area = static_cast<VMKernelArea*>(_area); local
231 VMKernelArea* area = static_cast<VMKernelArea*>(_area); local
242 CanResizeArea(VMArea* area, size_t newSize) argument
271 VMKernelArea* area = static_cast<VMKernelArea*>(_area); local
339 VMKernelArea* area = static_cast<VMKernelArea*>(_area); local
380 ShrinkAreaTail(VMArea* area, size_t newSize, uint32 allocationFlags) argument
493 VMKernelArea* area = range->area; local
[all...]
H A DVMKernelAddressSpace.h26 virtual VMArea* NextArea(VMArea* area) const;
33 virtual void DeleteArea(VMArea* area,
35 virtual status_t InsertArea(VMArea* area, size_t size,
39 virtual void RemoveArea(VMArea* area,
42 virtual bool CanResizeArea(VMArea* area, size_t newSize);
43 virtual status_t ResizeArea(VMArea* area, size_t newSize,
45 virtual status_t ShrinkAreaHead(VMArea* area, size_t newSize,
47 virtual status_t ShrinkAreaTail(VMArea* area, size_t newSize,
H A DVMKernelArea.h33 VMKernelArea* area; member in union:VMKernelAddressRange::__anon6
H A DVMUserAddressSpace.cpp44 /*! Verifies that an area with the given aligned base and size fits into
99 VMUserArea* area = fAreas.LeftMost(); local
100 while (area != NULL && area->id == RESERVED_AREA_ID)
101 area = fAreas.Next(area);
102 return area;
109 VMUserArea* area = static_cast<VMUserArea*>(_area); local
110 area = fAreas.Next(area);
128 VMUserArea* area = static_cast<VMUserArea*>(_area); local
138 VMUserArea* area = fAreas.FindClosest(address, true); local
150 VMUserArea* area = fAreas.FindClosest(address, less); local
167 VMUserArea* area = static_cast<VMUserArea*>(_area); local
213 VMUserArea* area = static_cast<VMUserArea*>(_area); local
225 CanResizeArea(VMArea* area, size_t newSize) argument
250 VMUserArea* area = static_cast<VMUserArea*>(_area); local
283 ShrinkAreaHead(VMArea* area, size_t size, uint32 allocationFlags) argument
298 ShrinkAreaTail(VMArea* area, size_t size, uint32 allocationFlags) argument
323 VMUserArea* area = VMUserArea::CreateReserved(this, flags, allocationFlags); local
355 VMUserArea* area = fAreas.FindClosest(address, false); local
448 _InsertAreaIntoReservedRegion(addr_t start, size_t size, VMUserArea* area, uint32 allocationFlags) argument
518 _InsertAreaSlot(addr_t start, addr_t size, addr_t end, uint32 addressSpec, size_t alignment, VMUserArea* area, uint32 allocationFlags) argument
[all...]
H A DVMUserAddressSpace.h21 virtual VMArea* NextArea(VMArea* area) const;
28 virtual void DeleteArea(VMArea* area,
30 virtual status_t InsertArea(VMArea* area, size_t size,
34 virtual void RemoveArea(VMArea* area,
37 virtual bool CanResizeArea(VMArea* area, size_t newSize);
38 virtual status_t ResizeArea(VMArea* area, size_t newSize,
40 virtual status_t ShrinkAreaHead(VMArea* area, size_t newSize,
42 virtual status_t ShrinkAreaTail(VMArea* area, size_t newSize,
63 size_t size, VMUserArea* area,
67 size_t alignment, VMUserArea* area,
[all...]
H A Dvm.cpp100 inline AreaCacheLocker(VMArea* area) argument
103 SetTo(area);
111 inline void SetTo(VMArea* area) argument
114 area != NULL ? vm_area_get_locked_cache(area) : NULL, true, true);
249 static rw_lock sAreaCacheLock = RW_LOCK_INITIALIZER("area->cache");
273 static void delete_area(VMAddressSpace* addressSpace, VMArea* area,
332 PageFaultError(area_id area, status_t error) argument
334 fArea(area),
344 out.Print("page fault error: no area");
381 PageFaultDone(area_id area, VMCache* topCache, VMCache* cache, vm_page* page) argument
439 virtual_page_address(VMArea* area, vm_page* page) argument
447 is_page_in_area(VMArea* area, vm_page* page) argument
461 VMArea* area = VMAreas::LookupLocked(id); local
481 allocate_area_page_protections(VMArea* area) argument
500 set_area_page_protection(VMArea* area, addr_t pageAddress, uint32 protection) argument
513 get_area_page_protection(VMArea* area, addr_t pageAddress) argument
553 map_page(VMArea* area, vm_page* page, addr_t address, uint32 protection, vm_page_reservation* reservation) argument
618 unmap_page(VMArea* area, addr_t virtualAddress) argument
629 unmap_pages(VMArea* area, addr_t base, size_t size) argument
636 intersect_area(VMArea* area, addr_t& address, addr_t& size, addr_t& offset) argument
672 cut_area(VMAddressSpace* addressSpace, VMArea* area, addr_t address, addr_t size, VMArea** _secondArea, bool kernel) argument
997 discard_area_range(VMArea* area, addr_t address, addr_t size) argument
1086 VMArea* area = addressSpace->CreateArea(areaName, wiring, protection, local
1198 wait_if_area_is_wired(VMArea* area, LockerType1* locker1, LockerType2* locker2) argument
1240 wait_if_area_range_is_wired(VMArea* area, addr_t base, size_t size, LockerType1* locker1, LockerType2* locker2) argument
1299 VMArea* area; local
1350 VMArea* area = (VMArea*)cookie; local
1404 VMArea* area; local
1465 VMArea* area; local
1844 VMArea* area; local
1992 VMArea* area; local
2077 VMArea* area; local
2111 pre_map_area_pages(VMArea* area, VMCache* cache, vm_page_reservation* reservation) argument
2266 VMArea* area; local
2313 vm_area_get_locked_cache(VMArea* area) argument
2505 delete_area(VMAddressSpace* addressSpace, VMArea* area, bool deletingAddressSpace) argument
2558 VMArea* area; local
2895 VMArea* area; local
3078 VMArea* area = mapping->area; local
3108 VMArea* area = mapping->area; local
3128 VMArea* area = mapping->area; local
3144 VMArea* area = mapping->area; local
3186 VMArea* area = mapping->area; local
3499 VMArea* area = cache->areas; local
3631 dump_area_struct(VMArea* area, bool mappings) argument
3673 VMArea* area; local
3737 VMArea* area; local
4106 area_id area = area_for((void*)(addr_t)args->kernel_args_range[i].start); local
4615 VMArea* area = NULL; local
4890 VMArea* area = addressSpace->LookupArea(address); local
5247 VMArea* area; local
5304 fill_area_info(struct VMArea* area, area_info* info, size_t size) argument
5729 VMArea* area = addressSpace->LookupArea(pageAddress); local
5799 VMArea* area = info->range.area; local
5888 VMArea* area = addressSpace->LookupArea(nextAddress); local
6047 VMArea* area = addressSpace->LookupArea(nextAddress); local
6292 VMArea* area; local
6332 set_area_protection(area_id area, uint32 newProtection) argument
6446 delete_area(area_id area) argument
6517 _user_get_area_info(area_id area, area_info* userInfo) argument
6564 _user_set_area_protection(area_id area, uint32 newProtection) argument
6575 _user_resize_area(area_id area, size_t newSize) argument
6584 _user_transfer_area(area_id area, void** userAddress, uint32 addressSpec, team_id target) argument
6686 area_id area = vm_create_anonymous_area(VMAddressSpace::CurrentID(), name, local
6701 _user_delete_area(area_id area) argument
6720 area_id area; local
6824 VMArea* area = locker.AddressSpace()->LookupArea(currentAddress); local
6859 VMArea* area = locker.AddressSpace()->LookupArea(currentAddress); local
7146 VMArea* area = addressSpace->LookupArea(nextAddress); local
[all...]
H A Dvm_page.cpp798 kprintf("%" B_PRId32 " (%s)", mapping->area->id, mapping->area->name);
979 kprintf("area mappings:\n");
984 kprintf(" %p (%" B_PRId32 ")\n", mapping->area, mapping->area->id);
1002 VMArea* area = addressSpace->LookupArea(address); local
1003 kprintf(" aspace %" B_PRId32 ", area %" B_PRId32 ": %#"
1005 area != NULL ? area->id : -1, address,
/haiku/src/system/libroot/os/
H A Dthread.c92 _kern_set_area_protection(info.area,
/haiku/src/system/libroot/posix/malloc_debug/
H A Dguarded_heap.cpp177 area_id area; member in struct:guarded_heap_area
225 guarded_heap_page_protect(guarded_heap_area& area, size_t pageIndex, argument
228 addr_t address = area.base + pageIndex * B_PAGE_SIZE;
306 guarded_heap_page_allocate(guarded_heap_area& area, size_t startPageIndex, argument
317 guarded_heap_page& page = area.pages[startPageIndex + i];
340 list_remove_item(&area.free_list, &page);
344 guarded_heap_page_protect(area, startPageIndex + i, 0);
346 guarded_heap_page_protect(area, startPageIndex + i,
354 guarded_heap_free_page(guarded_heap_area& area, size_t pageIndex, argument
357 guarded_heap_page& page = area
380 guarded_heap_area_allocate(guarded_heap_area& area, size_t pagesNeeded, size_t size, size_t alignment) argument
436 guarded_heap_area* area = (guarded_heap_area*)baseAddress; local
514 area_id area = create_area("guarded_heap_huge_allocation", &address, local
626 guarded_heap_area_page_index_for(guarded_heap_area& area, void* address) argument
659 guarded_heap_area_free(guarded_heap_area& area, void* address) argument
754 guarded_heap_area* area = guarded_heap_get_locked_area_for(sGuardedHeap, local
827 guarded_heap_area* area = NULL; local
890 dump_guarded_heap_area(guarded_heap_area& area) argument
961 guarded_heap_area* area = heap.areas; local
[all...]
H A Dheap.cpp92 area_id area; member in struct:heap_area_s
109 heap_area * area; member in struct:heap_page_s
143 heap_area * areas; // sorted so that the desired area is always first
149 area_id area; member in struct:area_allocation_info_s
248 heap_area *area = heap->all_areas; local
249 while (area) {
250 printf("\tarea %p: area: %" B_PRId32 "; base: 0x%08lx; size: %" B_PRIuSIZE "; "
252 area, area->area, are
287 heap_area *area = heap->all_areas; local
382 heap_area *area = heap->all_areas; local
488 heap_area *area = heap->all_areas; local
659 heap_area *area = (heap_area *)base; local
740 heap_remove_area(heap_allocator *heap, heap_area *area) argument
829 heap_free_pages_added(heap_allocator *heap, heap_area *area, uint32 pageCount) argument
871 heap_free_pages_removed(heap_allocator *heap, heap_area *area, uint32 pageCount) argument
946 heap_area *area = heap->areas; local
1056 heap_area *area = heap->areas; local
1182 heap_area *area = heap->all_areas; local
1395 heap_area *area = heap->all_areas; local
1513 heap_area *area = heap->all_areas; local
1781 area_id area = area_for(address); local
2028 delete_area(area); variable
[all...]
/haiku/src/system/libroot/posix/malloc_hoard2/
H A Darch-specific.cpp73 // find the heap area
78 "area not found! Base address: %p\n", find_thread(NULL),
207 // There was no chunk, let's see if the area is large enough
217 SERIAL_PRINT(("HEAP-%" B_PRId32 ": heap area large enough for %ld\n",
219 // the area is large enough already
224 // We need to grow the area
226 SERIAL_PRINT(("HEAP-%" B_PRId32 ": need to resize heap area to %ld "
231 // Either the system is out of memory or another area is in the way and
234 // splits the heap area in two, the first one retaining the original
235 // area I
250 area_id area = -1; local
[all...]
/haiku/src/system/libroot/posix/sys/
H A Dmman.cpp138 // create a name for this area based on calling image
145 snprintf(areaName, sizeof(areaName), "%s mmap area", imageName);
147 strlcpy(areaName, "mmap area", sizeof(areaName));
150 area_id area = _kern_map_file(areaName, &address, addressSpec, local
152 if (area < 0) {
153 __set_errno(area);
/haiku/src/system/runtime_loader/
H A Delf.cpp1211 // create the debug area
1215 runtime_loader_debug_area *area; local
1217 (void **)&area, B_RANDOMIZED_ANY_ADDRESS, size, B_NO_LOCK,
1220 FATAL("Failed to create debug area.\n");
1224 area->loaded_images = &get_loaded_images();
H A Dheap.cpp270 area_id area = _kern_create_area("rld heap", &base, local
272 if (area < 0)
273 return area;
275 // declare the whole area as one chunk, and add it to the free tree
H A Druntime_loader.cpp500 area_id area = _kern_map_file("mapped file", &fileBaseAddress, local
503 if (area < 0)
507 AreaDeleter(area_id area) argument
509 fArea(area)
520 } areaDeleter(area);

Completed in 379 milliseconds

<<1112