WebSVN – HelenOS – Diff – /branches/sparc/kernel/generic/src/mm/backend_elf.c


/*
 * Copyright (c) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup genericmm
 * @{
 */
 
/**
 * @file
 * @brief   Backend for address space areas backed by an ELF image.
 */
 
#include <lib/elf.h>
#include <debug.h>
#include <arch/types.h>
#include <mm/as.h>
#include <mm/frame.h>
#include <mm/slab.h>
#include <mm/page.h>
#include <genarch/mm/page_pt.h>
#include <genarch/mm/page_ht.h>
#include <align.h>
#include <memstr.h>
#include <macros.h>
#include <arch.h>
 
#ifdef CONFIG_VIRT_IDX_DCACHE
#include <arch/mm/cache.h>
#endif
 
static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);
static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
static void elf_share(as_area_t *area);
 
mem_backend_t elf_backend = {
    .page_fault = elf_page_fault,
    .frame_free = elf_frame_free,
    .share = elf_share
};
 
/** Service a page fault in the ELF backend address space area.
 *
 * The address space area and page tables must be already locked.
 *
 * @param area Pointer to the address space area.
 * @param addr Faulting virtual address.
 * @param access Access mode that caused the fault (i.e. read/write/exec).
 *
 * @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.
 *     serviced).
 */
int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
{
    elf_header_t *elf = area->backend_data.elf;
    elf_segment_header_t *entry = area->backend_data.segment;
    btree_node_t *leaf;
    uintptr_t base, frame;
    index_t i;
 
    if (!as_area_check_access(area, access))
        return AS_PF_FAULT;
 
    ASSERT((addr >= entry->p_vaddr) &&
        (addr < entry->p_vaddr + entry->p_memsz));
    i = (addr - entry->p_vaddr) >> PAGE_WIDTH;
    base = (uintptr_t) (((void *) elf) + entry->p_offset);
    ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);
 
    if (area->sh_info) {
        bool found = false;
 
        /*
         * The address space area is shared.
         */
         
        mutex_lock(&area->sh_info->lock);
        frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
            ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);
        if (!frame) {
            int i;
 
            /*
             * Workaround for valid NULL address.
             */
 
            for (i = 0; i < leaf->keys; i++) {
                if (leaf->key[i] ==
                    ALIGN_DOWN(addr, PAGE_SIZE)) {
                    found = true;
                    break;
                }
            }
        }
        if (frame || found) {
            frame_reference_add(ADDR2PFN(frame));
            page_mapping_insert(AS, addr, frame,
                as_area_get_flags(area));
            if (!used_space_insert(area,
                ALIGN_DOWN(addr, PAGE_SIZE), 1))
                panic("Could not insert used space.\n");
            mutex_unlock(&area->sh_info->lock);
            return AS_PF_OK;
        }
    }
   
    /*
     * The area is either not shared or the pagemap does not contain the
     * mapping.
     */
   
    if (ALIGN_DOWN(addr, PAGE_SIZE) + PAGE_SIZE <
        entry->p_vaddr + entry->p_filesz) {
        /*
         * Initialized portion of the segment. The memory is backed
         * directly by the content of the ELF image. Pages are
         * only copied if the segment is writable so that there
         * can be more instantions of the same memory ELF image
         * used at a time. Note that this could be later done
         * as COW.
         */
        if (entry->p_flags & PF_W) {
            frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
            memcpy((void *) PA2KA(frame),
                (void *) (base + i * FRAME_SIZE), FRAME_SIZE);
           
            if (area->sh_info) {
                frame_reference_add(ADDR2PFN(frame));
                btree_insert(&area->sh_info->pagemap,
                    ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
                    (void *) frame, leaf);
            }
 
        } else {
            frame = KA2PA(base + i*FRAME_SIZE);
        }  
    } else if (ALIGN_DOWN(addr, PAGE_SIZE) >=
        ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {
        /*
         * This is the uninitialized portion of the segment.
         * It is not physically present in the ELF image.
         * To resolve the situation, a frame must be allocated
         * and cleared.
         */
        frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
        memsetb(PA2KA(frame), FRAME_SIZE, 0);
 
        if (area->sh_info) {
            frame_reference_add(ADDR2PFN(frame));
            btree_insert(&area->sh_info->pagemap,
                ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
                (void *) frame, leaf);
        }
 
    } else {
        size_t size;
        /*
         * The mixed case.
         * The lower part is backed by the ELF image and
         * the upper part is anonymous memory.
         */
        size = entry->p_filesz - (i<<PAGE_WIDTH);
        frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
        memsetb(PA2KA(frame) + size, FRAME_SIZE - size, 0);
        memcpy((void *) PA2KA(frame), (void *) (base + i * FRAME_SIZE),
            size);
 
        if (area->sh_info) {
            frame_reference_add(ADDR2PFN(frame));
            btree_insert(&area->sh_info->pagemap,
                ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
                (void *) frame, leaf);
        }
 
    }
   
    if (area->sh_info)
        mutex_unlock(&area->sh_info->lock);
   
    page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
    if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))
        panic("Could not insert used space.\n");
 
    return AS_PF_OK;
}
 
/** Free a frame that is backed by the ELF backend.
 *
 * The address space area and page tables must be already locked.
 *
 * @param area Pointer to the address space area.
 * @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE.
 * @param frame Frame to be released.
 *
 */
void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
{
    elf_header_t *elf = area->backend_data.elf;
    elf_segment_header_t *entry = area->backend_data.segment;
    uintptr_t base;
    index_t i;
   
    ASSERT((page >= entry->p_vaddr) &&
        (page < entry->p_vaddr + entry->p_memsz));
    i = (page - entry->p_vaddr) >> PAGE_WIDTH;
    base = (uintptr_t) (((void *) elf) + entry->p_offset);
    ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);
   
    if (page + PAGE_SIZE <
        ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {
        if (entry->p_flags & PF_W) {
            /*
             * Free the frame with the copy of writable segment
             * data.
             */
            frame_free(frame);
#ifdef CONFIG_VIRT_IDX_DCACHE
                dcache_flush_frame(page, frame);
#endif
        }
    } else {
        /*
         * The frame is either anonymous memory or the mixed case (i.e.
         * lower part is backed by the ELF image and the upper is
         * anonymous). In any case, a frame needs to be freed.
         */
        frame_free(frame);
#ifdef CONFIG_VIRT_IDX_DCACHE
            dcache_flush_frame(page, frame);
#endif
    }
}
 
/** Share ELF image backed address space area.
 *
 * If the area is writable, then all mapped pages are duplicated in the pagemap.
 * Otherwise only portions of the area that are not backed by the ELF image
 * are put into the pagemap.
 *
 * The address space and address space area must be locked prior to the call.
 *
 * @param area Address space area.
 */
void elf_share(as_area_t *area)
{
    elf_segment_header_t *entry = area->backend_data.segment;
    link_t *cur;
    btree_node_t *leaf, *node;
    uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
 
    /*
     * Find the node in which to start linear search.
     */
    if (area->flags & AS_AREA_WRITE) {
        node = list_get_instance(area->used_space.leaf_head.next,
            btree_node_t, leaf_link);
    } else {
        (void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);
        node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,
            leaf);
        if (!node)
            node = leaf;
    }
 
    /*
     * Copy used anonymous portions of the area to sh_info's page map.
     */
    mutex_lock(&area->sh_info->lock);
    for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;
        cur = cur->next) {
        int i;
       
        node = list_get_instance(cur, btree_node_t, leaf_link);
       
        for (i = 0; i < node->keys; i++) {
            uintptr_t base = node->key[i];
            count_t count = (count_t) node->value[i];
            int j;
           
            /*
             * Skip read-only areas of used space that are backed
             * by the ELF image.
             */
            if (!(area->flags & AS_AREA_WRITE))
                if (base + count*PAGE_SIZE <= start_anon)
                    continue;
           
            for (j = 0; j < count; j++) {
                pte_t *pte;
           
                /*
                 * Skip read-only pages that are backed by the
                 * ELF image.
                 */
                if (!(area->flags & AS_AREA_WRITE))
                    if (base + (j + 1) * PAGE_SIZE <=
                        start_anon)
                        continue;
               
                page_table_lock(area->as, false);
                pte = page_mapping_find(area->as,
                    base + j * PAGE_SIZE);
                ASSERT(pte && PTE_VALID(pte) &&
                    PTE_PRESENT(pte));
                btree_insert(&area->sh_info->pagemap,
                    (base + j * PAGE_SIZE) - area->base,
                    (void *) PTE_GET_FRAME(pte), NULL);
                page_table_unlock(area->as, false);
 
                pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
                frame_reference_add(pfn);
            }
               
        }
    }
    mutex_unlock(&area->sh_info->lock);
}
 
/** @}
 */
 
 

Rev 2089	Rev 2132
1	/*	1	/*
2	* Copyright (c) 2006 Jakub Jermar	2	* Copyright (c) 2006 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup genericmm	29	/** @addtogroup genericmm
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file	34	* @file
35	* @brief Backend for address space areas backed by an ELF image.	35	* @brief Backend for address space areas backed by an ELF image.
36	*/	36	*/
37		37
38	#include <lib/elf.h>	38	#include <lib/elf.h>
39	#include <debug.h>	39	#include <debug.h>
40	#include <arch/types.h>	40	#include <arch/types.h>
41	#include <mm/as.h>	41	#include <mm/as.h>
42	#include <mm/frame.h>	42	#include <mm/frame.h>
43	#include <mm/slab.h>	43	#include <mm/slab.h>
44	#include <mm/page.h>	44	#include <mm/page.h>
45	#include <genarch/mm/page_pt.h>	45	#include <genarch/mm/page_pt.h>
46	#include <genarch/mm/page_ht.h>	46	#include <genarch/mm/page_ht.h>
47	#include <align.h>	47	#include <align.h>
48	#include <memstr.h>	48	#include <memstr.h>
49	#include <macros.h>	49	#include <macros.h>
50	#include <arch.h>	50	#include <arch.h>
51		51
52	#ifdef CONFIG_VIRT_IDX_DCACHE	52	#ifdef CONFIG_VIRT_IDX_DCACHE
53	#include <arch/mm/cache.h>	53	#include <arch/mm/cache.h>
54	#endif	54	#endif
55		55
56	static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);	56	static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);
57	static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);	57	static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
58	static void elf_share(as_area_t *area);	58	static void elf_share(as_area_t *area);
59		59
60	mem_backend_t elf_backend = {	60	mem_backend_t elf_backend = {
61	.page_fault = elf_page_fault,	61	.page_fault = elf_page_fault,
62	.frame_free = elf_frame_free,	62	.frame_free = elf_frame_free,
63	.share = elf_share	63	.share = elf_share
64	};	64	};
65		65
66	/** Service a page fault in the ELF backend address space area.	66	/** Service a page fault in the ELF backend address space area.
67	*	67	*
68	* The address space area and page tables must be already locked.	68	* The address space area and page tables must be already locked.
69	*	69	*
70	* @param area Pointer to the address space area.	70	* @param area Pointer to the address space area.
71	* @param addr Faulting virtual address.	71	* @param addr Faulting virtual address.
72	* @param access Access mode that caused the fault (i.e. read/write/exec).	72	* @param access Access mode that caused the fault (i.e. read/write/exec).
73	*	73	*
74	* @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e. serviced).	74	* @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.
-		75	* serviced).
75	*/	76	*/
76	int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)	77	int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
77	{	78	{
78	elf_header_t *elf = area->backend_data.elf;	79	elf_header_t *elf = area->backend_data.elf;
79	elf_segment_header_t *entry = area->backend_data.segment;	80	elf_segment_header_t *entry = area->backend_data.segment;
80	btree_node_t *leaf;	81	btree_node_t *leaf;
81	uintptr_t base, frame;	82	uintptr_t base, frame;
82	index_t i;	83	index_t i;
83		84
84	if (!as_area_check_access(area, access))	85	if (!as_area_check_access(area, access))
85	return AS_PF_FAULT;	86	return AS_PF_FAULT;
86		87
-		88	ASSERT((addr >= entry->p_vaddr) &&
87	ASSERT((addr >= entry->p_vaddr) && (addr < entry->p_vaddr + entry->p_memsz));	89	(addr < entry->p_vaddr + entry->p_memsz));
88	i = (addr - entry->p_vaddr) >> PAGE_WIDTH;	90	i = (addr - entry->p_vaddr) >> PAGE_WIDTH;
89	base = (uintptr_t) (((void *) elf) + entry->p_offset);	91	base = (uintptr_t) (((void *) elf) + entry->p_offset);
90	ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);	92	ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);
91		93
92	if (area->sh_info) {	94	if (area->sh_info) {
93	bool found = false;	95	bool found = false;
94		96
95	/*	97	/*
96	* The address space area is shared.	98	* The address space area is shared.
97	*/	99	*/
98		100
99	mutex_lock(&area->sh_info->lock);	101	mutex_lock(&area->sh_info->lock);
100	frame = (uintptr_t) btree_search(&area->sh_info->pagemap,	102	frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
101	ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);	103	ALIGN_DOWN(addr, PAGE_SIZE) - area->base, &leaf);
102	if (!frame) {	104	if (!frame) {
103	int i;	105	int i;
104		106
105	/*	107	/*
106	* Workaround for valid NULL address.	108	* Workaround for valid NULL address.
107	*/	109	*/
108		110
109	for (i = 0; i < leaf->keys; i++) {	111	for (i = 0; i < leaf->keys; i++) {
-		112	if (leaf->key[i] ==
110	if (leaf->key[i] == ALIGN_DOWN(addr, PAGE_SIZE)) {	113	ALIGN_DOWN(addr, PAGE_SIZE)) {
111	found = true;	114	found = true;
112	break;	115	break;
113	}	116	}
114	}	117	}
115	}	118	}
116	if (frame \|\| found) {	119	if (frame \|\| found) {
117	frame_reference_add(ADDR2PFN(frame));	120	frame_reference_add(ADDR2PFN(frame));
118	page_mapping_insert(AS, addr, frame, as_area_get_flags(area));	121	page_mapping_insert(AS, addr, frame,
-		122	as_area_get_flags(area));
-		123	if (!used_space_insert(area,
119	if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))	124	ALIGN_DOWN(addr, PAGE_SIZE), 1))
120	panic("Could not insert used space.\n");	125	panic("Could not insert used space.\n");
121	mutex_unlock(&area->sh_info->lock);	126	mutex_unlock(&area->sh_info->lock);
122	return AS_PF_OK;	127	return AS_PF_OK;
123	}	128	}
124	}	129	}
125		130
126	/*	131	/*
127	* The area is either not shared or the pagemap does not contain the mapping.	132	* The area is either not shared or the pagemap does not contain the
-		133	* mapping.
128	*/	134	*/
129		135
130	if (ALIGN_DOWN(addr, PAGE_SIZE) + PAGE_SIZE < entry->p_vaddr + entry->p_filesz) {	136	if (ALIGN_DOWN(addr, PAGE_SIZE) + PAGE_SIZE <
-		137	entry->p_vaddr + entry->p_filesz) {
131	/*	138	/*
132	* Initialized portion of the segment. The memory is backed	139	* Initialized portion of the segment. The memory is backed
133	* directly by the content of the ELF image. Pages are	140	* directly by the content of the ELF image. Pages are
134	* only copied if the segment is writable so that there	141	* only copied if the segment is writable so that there
135	* can be more instantions of the same memory ELF image	142	* can be more instantions of the same memory ELF image
136	* used at a time. Note that this could be later done	143	* used at a time. Note that this could be later done
137	* as COW.	144	* as COW.
138	*/	145	*/
139	if (entry->p_flags & PF_W) {	146	if (entry->p_flags & PF_W) {
140	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	147	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
-		148	memcpy((void *) PA2KA(frame),
141	memcpy((void ) PA2KA(frame), (void ) (base + i*FRAME_SIZE), FRAME_SIZE);	149	(void ) (base + i FRAME_SIZE), FRAME_SIZE);
142		150
143	if (area->sh_info) {	151	if (area->sh_info) {
144	frame_reference_add(ADDR2PFN(frame));	152	frame_reference_add(ADDR2PFN(frame));
-		153	btree_insert(&area->sh_info->pagemap,
145	btree_insert(&area->sh_info->pagemap, ALIGN_DOWN(addr, PAGE_SIZE) - area->base,	154	ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
146	(void *) frame, leaf);	155	(void *) frame, leaf);
147	}	156	}
148		157
149	} else {	158	} else {
150	frame = KA2PA(base + i*FRAME_SIZE);	159	frame = KA2PA(base + i*FRAME_SIZE);
151	}	160	}
-		161	} else if (ALIGN_DOWN(addr, PAGE_SIZE) >=
152	} else if (ALIGN_DOWN(addr, PAGE_SIZE) >= ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {	162	ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {
153	/*	163	/*
154	* This is the uninitialized portion of the segment.	164	* This is the uninitialized portion of the segment.
155	* It is not physically present in the ELF image.	165	* It is not physically present in the ELF image.
156	* To resolve the situation, a frame must be allocated	166	* To resolve the situation, a frame must be allocated
157	* and cleared.	167	* and cleared.
158	*/	168	*/
159	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	169	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
160	memsetb(PA2KA(frame), FRAME_SIZE, 0);	170	memsetb(PA2KA(frame), FRAME_SIZE, 0);
161		171
162	if (area->sh_info) {	172	if (area->sh_info) {
163	frame_reference_add(ADDR2PFN(frame));	173	frame_reference_add(ADDR2PFN(frame));
-		174	btree_insert(&area->sh_info->pagemap,
164	btree_insert(&area->sh_info->pagemap, ALIGN_DOWN(addr, PAGE_SIZE) - area->base,	175	ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
165	(void *) frame, leaf);	176	(void *) frame, leaf);
166	}	177	}
167		178
168	} else {	179	} else {
169	size_t size;	180	size_t size;
170	/*	181	/*
171	* The mixed case.	182	* The mixed case.
172	* The lower part is backed by the ELF image and	183	* The lower part is backed by the ELF image and
173	* the upper part is anonymous memory.	184	* the upper part is anonymous memory.
174	*/	185	*/
175	size = entry->p_filesz - (i<<PAGE_WIDTH);	186	size = entry->p_filesz - (i<<PAGE_WIDTH);
176	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	187	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
177	memsetb(PA2KA(frame) + size, FRAME_SIZE - size, 0);	188	memsetb(PA2KA(frame) + size, FRAME_SIZE - size, 0);
178	memcpy((void ) PA2KA(frame), (void ) (base + i*FRAME_SIZE), size);	189	memcpy((void ) PA2KA(frame), (void ) (base + i * FRAME_SIZE),
-		190	size);
179		191
180	if (area->sh_info) {	192	if (area->sh_info) {
181	frame_reference_add(ADDR2PFN(frame));	193	frame_reference_add(ADDR2PFN(frame));
-		194	btree_insert(&area->sh_info->pagemap,
182	btree_insert(&area->sh_info->pagemap, ALIGN_DOWN(addr, PAGE_SIZE) - area->base,	195	ALIGN_DOWN(addr, PAGE_SIZE) - area->base,
183	(void *) frame, leaf);	196	(void *) frame, leaf);
184	}	197	}
185		198
186	}	199	}
187		200
188	if (area->sh_info)	201	if (area->sh_info)
189	mutex_unlock(&area->sh_info->lock);	202	mutex_unlock(&area->sh_info->lock);
190		203
191	page_mapping_insert(AS, addr, frame, as_area_get_flags(area));	204	page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
192	if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))	205	if (!used_space_insert(area, ALIGN_DOWN(addr, PAGE_SIZE), 1))
193	panic("Could not insert used space.\n");	206	panic("Could not insert used space.\n");
194		207
195	return AS_PF_OK;	208	return AS_PF_OK;
196	}	209	}
197		210
198	/** Free a frame that is backed by the ELF backend.	211	/** Free a frame that is backed by the ELF backend.
199	*	212	*
200	* The address space area and page tables must be already locked.	213	* The address space area and page tables must be already locked.
201	*	214	*
202	* @param area Pointer to the address space area.	215	* @param area Pointer to the address space area.
203	* @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE.	216	* @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE.
204	* @param frame Frame to be released.	217	* @param frame Frame to be released.
205	*	218	*
206	*/	219	*/
207	void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)	220	void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
208	{	221	{
209	elf_header_t *elf = area->backend_data.elf;	222	elf_header_t *elf = area->backend_data.elf;
210	elf_segment_header_t *entry = area->backend_data.segment;	223	elf_segment_header_t *entry = area->backend_data.segment;
211	uintptr_t base;	224	uintptr_t base;
212	index_t i;	225	index_t i;
213		226
-		227	ASSERT((page >= entry->p_vaddr) &&
214	ASSERT((page >= entry->p_vaddr) && (page < entry->p_vaddr + entry->p_memsz));	228	(page < entry->p_vaddr + entry->p_memsz));
215	i = (page - entry->p_vaddr) >> PAGE_WIDTH;	229	i = (page - entry->p_vaddr) >> PAGE_WIDTH;
216	base = (uintptr_t) (((void *) elf) + entry->p_offset);	230	base = (uintptr_t) (((void *) elf) + entry->p_offset);
217	ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);	231	ASSERT(ALIGN_UP(base, FRAME_SIZE) == base);
218		232
-		233	if (page + PAGE_SIZE <
219	if (page + PAGE_SIZE < ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {	234	ALIGN_UP(entry->p_vaddr + entry->p_filesz, PAGE_SIZE)) {
220	if (entry->p_flags & PF_W) {	235	if (entry->p_flags & PF_W) {
221	/*	236	/*
222	* Free the frame with the copy of writable segment data.	237	* Free the frame with the copy of writable segment
-		238	* data.
223	*/	239	*/
224	frame_free(frame);	240	frame_free(frame);
225	#ifdef CONFIG_VIRT_IDX_DCACHE	241	#ifdef CONFIG_VIRT_IDX_DCACHE
226	dcache_flush_frame(page, frame);	242	dcache_flush_frame(page, frame);
227	#endif	243	#endif
228	}	244	}
229	} else {	245	} else {
230	/*	246	/*
231	* The frame is either anonymous memory or the mixed case (i.e. lower	247	* The frame is either anonymous memory or the mixed case (i.e.
232	* part is backed by the ELF image and the upper is anonymous).	248	* lower part is backed by the ELF image and the upper is
233	* In any case, a frame needs to be freed.	249	* anonymous). In any case, a frame needs to be freed.
234	*/	250	*/
235	frame_free(frame);	251	frame_free(frame);
236	#ifdef CONFIG_VIRT_IDX_DCACHE	252	#ifdef CONFIG_VIRT_IDX_DCACHE
237	dcache_flush_frame(page, frame);	253	dcache_flush_frame(page, frame);
238	#endif	254	#endif
239	}	255	}
240	}	256	}
241		257
242	/** Share ELF image backed address space area.	258	/** Share ELF image backed address space area.
243	*	259	*
244	* If the area is writable, then all mapped pages are duplicated in the pagemap.	260	* If the area is writable, then all mapped pages are duplicated in the pagemap.
245	* Otherwise only portions of the area that are not backed by the ELF image	261	* Otherwise only portions of the area that are not backed by the ELF image
246	* are put into the pagemap.	262	* are put into the pagemap.
247	*	263	*
248	* The address space and address space area must be locked prior to the call.	264	* The address space and address space area must be locked prior to the call.
249	*	265	*
250	* @param area Address space area.	266	* @param area Address space area.
251	*/	267	*/
252	void elf_share(as_area_t *area)	268	void elf_share(as_area_t *area)
253	{	269	{
254	elf_segment_header_t *entry = area->backend_data.segment;	270	elf_segment_header_t *entry = area->backend_data.segment;
255	link_t *cur;	271	link_t *cur;
256	btree_node_t leaf, node;	272	btree_node_t leaf, node;
257	uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;	273	uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
258		274
259	/*	275	/*
260	* Find the node in which to start linear search.	276	* Find the node in which to start linear search.
261	*/	277	*/
262	if (area->flags & AS_AREA_WRITE) {	278	if (area->flags & AS_AREA_WRITE) {
263	node = list_get_instance(area->used_space.leaf_head.next, btree_node_t, leaf_link);	279	node = list_get_instance(area->used_space.leaf_head.next,
-		280	btree_node_t, leaf_link);
264	} else {	281	} else {
265	(void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);	282	(void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);
266	node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap, leaf);	283	node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,
-		284	leaf);
267	if (!node)	285	if (!node)
268	node = leaf;	286	node = leaf;
269	}	287	}
270		288
271	/*	289	/*
272	* Copy used anonymous portions of the area to sh_info's page map.	290	* Copy used anonymous portions of the area to sh_info's page map.
273	*/	291	*/
274	mutex_lock(&area->sh_info->lock);	292	mutex_lock(&area->sh_info->lock);
275	for (cur = &node->leaf_link; cur != &area->used_space.leaf_head; cur = cur->next) {	293	for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;
-		294	cur = cur->next) {
276	int i;	295	int i;
277		296
278	node = list_get_instance(cur, btree_node_t, leaf_link);	297	node = list_get_instance(cur, btree_node_t, leaf_link);
279		298
280	for (i = 0; i < node->keys; i++) {	299	for (i = 0; i < node->keys; i++) {
281	uintptr_t base = node->key[i];	300	uintptr_t base = node->key[i];
282	count_t count = (count_t) node->value[i];	301	count_t count = (count_t) node->value[i];
283	int j;	302	int j;
284		303
285	/*	304	/*
286	* Skip read-only areas of used space that are backed	305	* Skip read-only areas of used space that are backed
287	* by the ELF image.	306	* by the ELF image.
288	*/	307	*/
289	if (!(area->flags & AS_AREA_WRITE))	308	if (!(area->flags & AS_AREA_WRITE))
290	if (base + count*PAGE_SIZE <= start_anon)	309	if (base + count*PAGE_SIZE <= start_anon)
291	continue;	310	continue;
292		311
293	for (j = 0; j < count; j++) {	312	for (j = 0; j < count; j++) {
294	pte_t *pte;	313	pte_t *pte;
295		314
296	/*	315	/*
297	* Skip read-only pages that are backed by the ELF image.	316	* Skip read-only pages that are backed by the
-		317	* ELF image.
298	*/	318	*/
299	if (!(area->flags & AS_AREA_WRITE))	319	if (!(area->flags & AS_AREA_WRITE))
300	if (base + (j + 1)*PAGE_SIZE <= start_anon)	320	if (base + (j + 1) * PAGE_SIZE <=
-		321	start_anon)
301	continue;	322	continue;
302		323
303	page_table_lock(area->as, false);	324	page_table_lock(area->as, false);
304	pte = page_mapping_find(area->as, base + j*PAGE_SIZE);	325	pte = page_mapping_find(area->as,
-		326	base + j * PAGE_SIZE);
305	ASSERT(pte && PTE_VALID(pte) && PTE_PRESENT(pte));	327	ASSERT(pte && PTE_VALID(pte) &&
-		328	PTE_PRESENT(pte));
306	btree_insert(&area->sh_info->pagemap, (base + j*PAGE_SIZE) - area->base,	329	btree_insert(&area->sh_info->pagemap,
-		330	(base + j * PAGE_SIZE) - area->base,
307	(void *) PTE_GET_FRAME(pte), NULL);	331	(void *) PTE_GET_FRAME(pte), NULL);
308	page_table_unlock(area->as, false);	332	page_table_unlock(area->as, false);
-		333
309	frame_reference_add(ADDR2PFN(PTE_GET_FRAME(pte)));	334	pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
-		335	frame_reference_add(pfn);
310	}	336	}
311		337
312	}	338	}
313	}	339	}
314	mutex_unlock(&area->sh_info->lock);	340	mutex_unlock(&area->sh_info->lock);
315	}	341	}
316		342
317	/** @}	343	/** @}
318	*/	344	*/
-		345
319		346

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/generic/src/mm/backend_elf.c @ 3862 – Rev 2089 → 2132