sambuc/codezero
1
0
Fork 0
mirror of https://github.com/drasko/codezero.git synced 2026-11-04 16:17:27 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

execve working from vfs executable file along with clone/fork/exit

Browse Source
This commit is contained in:
Bahadir Balban
2008-12-02 18:29:40 +02:00
parent 32b3dfe91d
commit 9123eb49a8
10 changed files with 64 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tasks/mm0/src/mmap.c
+12 -3
View File
@@ -97,14 +97,23 @@ int task_insert_vma(struct vm_area *this, struct list_head *vma_list)
BUG();
}
/* Search an empty space in the task's mmapable address region. */
/*
* Search an empty space in the task's mmapable address region.
*
* This does a less than O(n) algorithm by starting the estimated region
* and vma comparison from the beginning, once a vma is not intersected
* that means it is an available slot. However if vma's and estimated
* region does not go head-to-head for comparison, individual intersection
* checks would be meaningless since any other vma could be intersecting.
* Therefore head-to-head comparison is essential here.
*/
unsigned long find_unmapped_area(unsigned long npages, struct tcb *task)
{
unsigned long pfn_start = __pfn(task->map_start);
unsigned long pfn_start = __pfn(task->start);
unsigned long pfn_end = pfn_start + npages;
struct vm_area *vma;
if (npages > __pfn(task->map_end - task->map_start))
if (npages > __pfn(task->end - task->start))
return 0;
/* If no vmas, first map slot is available. */