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>
#include <arch/barrier.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, page, start_anon;
    index_t i;
    bool dirty = false;
 
    if (!as_area_check_access(area, access))
        return AS_PF_FAULT;
 
    ASSERT((addr >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&
        (addr < entry->p_vaddr + entry->p_memsz));
    i = (addr - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
    base = (uintptr_t)
        (((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));
 
    /* Virtual address of faulting page*/
    page = ALIGN_DOWN(addr, PAGE_SIZE);
 
    /* Virtual address of the end of initialized part of segment */
    start_anon = entry->p_vaddr + entry->p_filesz;
 
    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,
            page - area->base, &leaf);
        if (!frame) {
            unsigned int i;
 
            /*
             * Workaround for valid NULL address.
             */
 
            for (i = 0; i < leaf->keys; i++) {
                if (leaf->key[i] == page) {
                    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, page, 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 (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
        /*
         * 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 (entry->p_flags & PF_X)
                smc_coherence_block(PA2KA(frame), FRAME_SIZE);
            dirty = true;
        } else {
            frame = KA2PA(base + i * FRAME_SIZE);
        }  
    } else if (page >= start_anon) {
        /*
         * 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((void *) PA2KA(frame), FRAME_SIZE, 0);
        dirty = true;
    } else {
        size_t pad_lo, pad_hi;
        /*
         * The mixed case.
         *
         * The middle part is backed by the ELF image and
         * the lower and upper parts are anonymous memory.
         * (The segment can be and often is shorter than 1 page).
         */
        if (page < entry->p_vaddr)
            pad_lo = entry->p_vaddr - page;
        else
            pad_lo = 0;
 
        if (start_anon < page + PAGE_SIZE)
            pad_hi = page + PAGE_SIZE - start_anon;
        else
            pad_hi = 0;
 
        frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
        memcpy((void *) (PA2KA(frame) + pad_lo),
            (void *) (base + i * FRAME_SIZE + pad_lo),
            FRAME_SIZE - pad_lo - pad_hi);
        if (entry->p_flags & PF_X)
            smc_coherence_block(PA2KA(frame) + pad_lo, FRAME_SIZE -
                pad_lo - pad_hi);
        memsetb((void *) PA2KA(frame), pad_lo, 0);
        memsetb((void *) (PA2KA(frame) + FRAME_SIZE - pad_hi), pad_hi,
            0);
        dirty = true;
    }
 
    if (dirty && area->sh_info) {
        frame_reference_add(ADDR2PFN(frame));
        btree_insert(&area->sh_info->pagemap, page - 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, page, 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, start_anon;
    index_t i;
 
    ASSERT((page >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&
        (page < entry->p_vaddr + entry->p_memsz));
    i = (page - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
    base = (uintptr_t) (((void *) elf) +
        ALIGN_DOWN(entry->p_offset, FRAME_SIZE));
    start_anon = entry->p_vaddr + entry->p_filesz;
 
    if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
        if (entry->p_flags & PF_W) {
            /*
             * Free the frame with the copy of writable segment
             * data.
             */
            frame_free(frame);
        }
    } 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);
    }
}
 
/** 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) {
        unsigned 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];
            unsigned int j;
           
            /*
             * Skip read-only areas of used space that are backed
             * by the ELF image.
             */
            if (!(area->flags & AS_AREA_WRITE))
                if (base >= entry->p_vaddr &&
                    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 >= entry->p_vaddr &&
                        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 3104	Rev 3141
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	#include <arch/barrier.h>
51		52
52	#ifdef CONFIG_VIRT_IDX_DCACHE	53	#ifdef CONFIG_VIRT_IDX_DCACHE
53	#include <arch/mm/cache.h>	54	#include <arch/mm/cache.h>
54	#endif	55	#endif
55		56
56	static int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access);	57	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);	58	static void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame);
58	static void elf_share(as_area_t *area);	59	static void elf_share(as_area_t *area);
59		60
60	mem_backend_t elf_backend = {	61	mem_backend_t elf_backend = {
61	.page_fault = elf_page_fault,	62	.page_fault = elf_page_fault,
62	.frame_free = elf_frame_free,	63	.frame_free = elf_frame_free,
63	.share = elf_share	64	.share = elf_share
64	};	65	};
65		66
66	/** Service a page fault in the ELF backend address space area.	67	/** Service a page fault in the ELF backend address space area.
67	*	68	*
68	* The address space area and page tables must be already locked.	69	* The address space area and page tables must be already locked.
69	*	70	*
70	* @param area Pointer to the address space area.	71	* @param area Pointer to the address space area.
71	* @param addr Faulting virtual address.	72	* @param addr Faulting virtual address.
72	* @param access Access mode that caused the fault (i.e. read/write/exec).	73	* @param access Access mode that caused the fault (i.e.
-		74	* read/write/exec).
73	*	75	*
74	* @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK on success (i.e.	76	* @return AS_PF_FAULT on failure (i.e. page fault) or AS_PF_OK
75	* serviced).	77	* on success (i.e. serviced).
76	*/	78	*/
77	int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)	79	int elf_page_fault(as_area_t *area, uintptr_t addr, pf_access_t access)
78	{	80	{
79	elf_header_t *elf = area->backend_data.elf;	81	elf_header_t *elf = area->backend_data.elf;
80	elf_segment_header_t *entry = area->backend_data.segment;	82	elf_segment_header_t *entry = area->backend_data.segment;
81	btree_node_t *leaf;	83	btree_node_t *leaf;
82	uintptr_t base, frame, page, start_anon;	84	uintptr_t base, frame, page, start_anon;
83	index_t i;	85	index_t i;
84	bool dirty = false;	86	bool dirty = false;
85		87
86	if (!as_area_check_access(area, access))	88	if (!as_area_check_access(area, access))
87	return AS_PF_FAULT;	89	return AS_PF_FAULT;
88		90
89	ASSERT((addr >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&	91	ASSERT((addr >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&
90	(addr < entry->p_vaddr + entry->p_memsz));	92	(addr < entry->p_vaddr + entry->p_memsz));
91	i = (addr - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;	93	i = (addr - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
92	base = (uintptr_t)	94	base = (uintptr_t)
93	(((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));	95	(((void *) elf) + ALIGN_DOWN(entry->p_offset, PAGE_SIZE));
94		96
95	/* Virtual address of faulting page*/	97	/* Virtual address of faulting page*/
96	page = ALIGN_DOWN(addr, PAGE_SIZE);	98	page = ALIGN_DOWN(addr, PAGE_SIZE);
97		99
98	/* Virtual address of the end of initialized part of segment */	100	/* Virtual address of the end of initialized part of segment */
99	start_anon = entry->p_vaddr + entry->p_filesz;	101	start_anon = entry->p_vaddr + entry->p_filesz;
100		102
101	if (area->sh_info) {	103	if (area->sh_info) {
102	bool found = false;	104	bool found = false;
103		105
104	/*	106	/*
105	* The address space area is shared.	107	* The address space area is shared.
106	*/	108	*/
107		109
108	mutex_lock(&area->sh_info->lock);	110	mutex_lock(&area->sh_info->lock);
109	frame = (uintptr_t) btree_search(&area->sh_info->pagemap,	111	frame = (uintptr_t) btree_search(&area->sh_info->pagemap,
110	page - area->base, &leaf);	112	page - area->base, &leaf);
111	if (!frame) {	113	if (!frame) {
112	unsigned int i;	114	unsigned int i;
113		115
114	/*	116	/*
115	* Workaround for valid NULL address.	117	* Workaround for valid NULL address.
116	*/	118	*/
117		119
118	for (i = 0; i < leaf->keys; i++) {	120	for (i = 0; i < leaf->keys; i++) {
119	if (leaf->key[i] == page) {	121	if (leaf->key[i] == page) {
120	found = true;	122	found = true;
121	break;	123	break;
122	}	124	}
123	}	125	}
124	}	126	}
125	if (frame \|\| found) {	127	if (frame \|\| found) {
126	frame_reference_add(ADDR2PFN(frame));	128	frame_reference_add(ADDR2PFN(frame));
127	page_mapping_insert(AS, addr, frame,	129	page_mapping_insert(AS, addr, frame,
128	as_area_get_flags(area));	130	as_area_get_flags(area));
129	if (!used_space_insert(area, page, 1))	131	if (!used_space_insert(area, page, 1))
130	panic("Could not insert used space.\n");	132	panic("Could not insert used space.\n");
131	mutex_unlock(&area->sh_info->lock);	133	mutex_unlock(&area->sh_info->lock);
132	return AS_PF_OK;	134	return AS_PF_OK;
133	}	135	}
134	}	136	}
135		137
136	/*	138	/*
137	* The area is either not shared or the pagemap does not contain the	139	* The area is either not shared or the pagemap does not contain the
138	* mapping.	140	* mapping.
139	*/	141	*/
140	if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {	142	if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
141	/*	143	/*
142	* Initialized portion of the segment. The memory is backed	144	* Initialized portion of the segment. The memory is backed
143	* directly by the content of the ELF image. Pages are	145	* directly by the content of the ELF image. Pages are
144	* only copied if the segment is writable so that there	146	* only copied if the segment is writable so that there
145	* can be more instantions of the same memory ELF image	147	* can be more instantions of the same memory ELF image
146	* used at a time. Note that this could be later done	148	* used at a time. Note that this could be later done
147	* as COW.	149	* as COW.
148	*/	150	*/
149	if (entry->p_flags & PF_W) {	151	if (entry->p_flags & PF_W) {
150	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	152	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
151	memcpy((void *) PA2KA(frame),	153	memcpy((void *) PA2KA(frame),
152	(void ) (base + i FRAME_SIZE), FRAME_SIZE);	154	(void ) (base + i FRAME_SIZE), FRAME_SIZE);
-		155	if (entry->p_flags & PF_X)
-		156	smc_coherence_block(PA2KA(frame), FRAME_SIZE);
153	dirty = true;	157	dirty = true;
154	} else {	158	} else {
155	frame = KA2PA(base + i * FRAME_SIZE);	159	frame = KA2PA(base + i * FRAME_SIZE);
156	}	160	}
157	} else if (page >= start_anon) {	161	} else if (page >= start_anon) {
158	/*	162	/*
159	* This is the uninitialized portion of the segment.	163	* This is the uninitialized portion of the segment.
160	* It is not physically present in the ELF image.	164	* It is not physically present in the ELF image.
161	* To resolve the situation, a frame must be allocated	165	* To resolve the situation, a frame must be allocated
162	* and cleared.	166	* and cleared.
163	*/	167	*/
164	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	168	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
165	memsetb((void *) PA2KA(frame), FRAME_SIZE, 0);	169	memsetb((void *) PA2KA(frame), FRAME_SIZE, 0);
166	dirty = true;	170	dirty = true;
167	} else {	171	} else {
168	size_t pad_lo, pad_hi;	172	size_t pad_lo, pad_hi;
169	/*	173	/*
170	* The mixed case.	174	* The mixed case.
171	*	175	*
172	* The middle part is backed by the ELF image and	176	* The middle part is backed by the ELF image and
173	* the lower and upper parts are anonymous memory.	177	* the lower and upper parts are anonymous memory.
174	* (The segment can be and often is shorter than 1 page).	178	* (The segment can be and often is shorter than 1 page).
175	*/	179	*/
176	if (page < entry->p_vaddr)	180	if (page < entry->p_vaddr)
177	pad_lo = entry->p_vaddr - page;	181	pad_lo = entry->p_vaddr - page;
178	else	182	else
179	pad_lo = 0;	183	pad_lo = 0;
180		184
181	if (start_anon < page + PAGE_SIZE)	185	if (start_anon < page + PAGE_SIZE)
182	pad_hi = page + PAGE_SIZE - start_anon;	186	pad_hi = page + PAGE_SIZE - start_anon;
183	else	187	else
184	pad_hi = 0;	188	pad_hi = 0;
185		189
186	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);	190	frame = (uintptr_t)frame_alloc(ONE_FRAME, 0);
187	memcpy((void *) (PA2KA(frame) + pad_lo),	191	memcpy((void *) (PA2KA(frame) + pad_lo),
188	(void ) (base + i FRAME_SIZE + pad_lo),	192	(void ) (base + i FRAME_SIZE + pad_lo),
189	FRAME_SIZE - pad_lo - pad_hi);	193	FRAME_SIZE - pad_lo - pad_hi);
-		194	if (entry->p_flags & PF_X)
-		195	smc_coherence_block(PA2KA(frame) + pad_lo, FRAME_SIZE -
-		196	pad_lo - pad_hi);
190	memsetb((void *) PA2KA(frame), pad_lo, 0);	197	memsetb((void *) PA2KA(frame), pad_lo, 0);
191	memsetb((void *) (PA2KA(frame) + FRAME_SIZE - pad_hi), pad_hi, 0);	198	memsetb((void *) (PA2KA(frame) + FRAME_SIZE - pad_hi), pad_hi,
-		199	0);
192	dirty = true;	200	dirty = true;
193	}	201	}
194		202
195	if (dirty && area->sh_info) {	203	if (dirty && area->sh_info) {
196	frame_reference_add(ADDR2PFN(frame));	204	frame_reference_add(ADDR2PFN(frame));
197	btree_insert(&area->sh_info->pagemap, page - area->base,	205	btree_insert(&area->sh_info->pagemap, page - area->base,
198	(void *) frame, leaf);	206	(void *) frame, leaf);
199	}	207	}
200		208
201	if (area->sh_info)	209	if (area->sh_info)
202	mutex_unlock(&area->sh_info->lock);	210	mutex_unlock(&area->sh_info->lock);
203		211
204	page_mapping_insert(AS, addr, frame, as_area_get_flags(area));	212	page_mapping_insert(AS, addr, frame, as_area_get_flags(area));
205	if (!used_space_insert(area, page, 1))	213	if (!used_space_insert(area, page, 1))
206	panic("Could not insert used space.\n");	214	panic("Could not insert used space.\n");
207		215
208	return AS_PF_OK;	216	return AS_PF_OK;
209	}	217	}
210		218
211	/** Free a frame that is backed by the ELF backend.	219	/** Free a frame that is backed by the ELF backend.
212	*	220	*
213	* The address space area and page tables must be already locked.	221	* The address space area and page tables must be already locked.
214	*	222	*
215	* @param area Pointer to the address space area.	223	* @param area Pointer to the address space area.
216	* @param page Page that is mapped to frame. Must be aligned to PAGE_SIZE.	224	* @param page Page that is mapped to frame. Must be aligned to
-		225	* PAGE_SIZE.
217	* @param frame Frame to be released.	226	* @param frame Frame to be released.
218	*	227	*
219	*/	228	*/
220	void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)	229	void elf_frame_free(as_area_t *area, uintptr_t page, uintptr_t frame)
221	{	230	{
222	elf_header_t *elf = area->backend_data.elf;	231	elf_header_t *elf = area->backend_data.elf;
223	elf_segment_header_t *entry = area->backend_data.segment;	232	elf_segment_header_t *entry = area->backend_data.segment;
224	uintptr_t base, start_anon;	233	uintptr_t base, start_anon;
225	index_t i;	234	index_t i;
226		235
227	ASSERT((page >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&	236	ASSERT((page >= ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) &&
228	(page < entry->p_vaddr + entry->p_memsz));	237	(page < entry->p_vaddr + entry->p_memsz));
229	i = (page - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;	238	i = (page - ALIGN_DOWN(entry->p_vaddr, PAGE_SIZE)) >> PAGE_WIDTH;
230	base = (uintptr_t) (((void *) elf) +	239	base = (uintptr_t) (((void *) elf) +
231	ALIGN_DOWN(entry->p_offset, FRAME_SIZE));	240	ALIGN_DOWN(entry->p_offset, FRAME_SIZE));
232	start_anon = entry->p_vaddr + entry->p_filesz;	241	start_anon = entry->p_vaddr + entry->p_filesz;
233		242
234	if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {	243	if (page >= entry->p_vaddr && page + PAGE_SIZE <= start_anon) {
235	if (entry->p_flags & PF_W) {	244	if (entry->p_flags & PF_W) {
236	/*	245	/*
237	* Free the frame with the copy of writable segment	246	* Free the frame with the copy of writable segment
238	* data.	247	* data.
239	*/	248	*/
240	frame_free(frame);	249	frame_free(frame);
241	}	250	}
242	} else {	251	} else {
243	/*	252	/*
244	* The frame is either anonymous memory or the mixed case (i.e.	253	* The frame is either anonymous memory or the mixed case (i.e.
245	* lower part is backed by the ELF image and the upper is	254	* lower part is backed by the ELF image and the upper is
246	* anonymous). In any case, a frame needs to be freed.	255	* anonymous). In any case, a frame needs to be freed.
247	*/	256	*/
248	frame_free(frame);	257	frame_free(frame);
249	}	258	}
250	}	259	}
251		260
252	/** Share ELF image backed address space area.	261	/** Share ELF image backed address space area.
253	*	262	*
254	* If the area is writable, then all mapped pages are duplicated in the pagemap.	263	* If the area is writable, then all mapped pages are duplicated in the pagemap.
255	* Otherwise only portions of the area that are not backed by the ELF image	264	* Otherwise only portions of the area that are not backed by the ELF image
256	* are put into the pagemap.	265	* are put into the pagemap.
257	*	266	*
258	* The address space and address space area must be locked prior to the call.	267	* The address space and address space area must be locked prior to the call.
259	*	268	*
260	* @param area Address space area.	269	* @param area Address space area.
261	*/	270	*/
262	void elf_share(as_area_t *area)	271	void elf_share(as_area_t *area)
263	{	272	{
264	elf_segment_header_t *entry = area->backend_data.segment;	273	elf_segment_header_t *entry = area->backend_data.segment;
265	link_t *cur;	274	link_t *cur;
266	btree_node_t leaf, node;	275	btree_node_t leaf, node;
267	uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;	276	uintptr_t start_anon = entry->p_vaddr + entry->p_filesz;
268		277
269	/*	278	/*
270	* Find the node in which to start linear search.	279	* Find the node in which to start linear search.
271	*/	280	*/
272	if (area->flags & AS_AREA_WRITE) {	281	if (area->flags & AS_AREA_WRITE) {
273	node = list_get_instance(area->used_space.leaf_head.next,	282	node = list_get_instance(area->used_space.leaf_head.next,
274	btree_node_t, leaf_link);	283	btree_node_t, leaf_link);
275	} else {	284	} else {
276	(void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);	285	(void) btree_search(&area->sh_info->pagemap, start_anon, &leaf);
277	node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,	286	node = btree_leaf_node_left_neighbour(&area->sh_info->pagemap,
278	leaf);	287	leaf);
279	if (!node)	288	if (!node)
280	node = leaf;	289	node = leaf;
281	}	290	}
282		291
283	/*	292	/*
284	* Copy used anonymous portions of the area to sh_info's page map.	293	* Copy used anonymous portions of the area to sh_info's page map.
285	*/	294	*/
286	mutex_lock(&area->sh_info->lock);	295	mutex_lock(&area->sh_info->lock);
287	for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;	296	for (cur = &node->leaf_link; cur != &area->used_space.leaf_head;
288	cur = cur->next) {	297	cur = cur->next) {
289	unsigned int i;	298	unsigned int i;
290		299
291	node = list_get_instance(cur, btree_node_t, leaf_link);	300	node = list_get_instance(cur, btree_node_t, leaf_link);
292		301
293	for (i = 0; i < node->keys; i++) {	302	for (i = 0; i < node->keys; i++) {
294	uintptr_t base = node->key[i];	303	uintptr_t base = node->key[i];
295	count_t count = (count_t) node->value[i];	304	count_t count = (count_t) node->value[i];
296	unsigned int j;	305	unsigned int j;
297		306
298	/*	307	/*
299	* Skip read-only areas of used space that are backed	308	* Skip read-only areas of used space that are backed
300	* by the ELF image.	309	* by the ELF image.
301	*/	310	*/
302	if (!(area->flags & AS_AREA_WRITE))	311	if (!(area->flags & AS_AREA_WRITE))
303	if (base >= entry->p_vaddr &&	312	if (base >= entry->p_vaddr &&
304	base + count * PAGE_SIZE <= start_anon)	313	base + count * PAGE_SIZE <= start_anon)
305	continue;	314	continue;
306		315
307	for (j = 0; j < count; j++) {	316	for (j = 0; j < count; j++) {
308	pte_t *pte;	317	pte_t *pte;
309		318
310	/*	319	/*
311	* Skip read-only pages that are backed by the	320	* Skip read-only pages that are backed by the
312	* ELF image.	321	* ELF image.
313	*/	322	*/
314	if (!(area->flags & AS_AREA_WRITE))	323	if (!(area->flags & AS_AREA_WRITE))
315	if (base >= entry->p_vaddr &&	324	if (base >= entry->p_vaddr &&
316	base + (j + 1) * PAGE_SIZE <=	325	base + (j + 1) * PAGE_SIZE <=
317	start_anon)	326	start_anon)
318	continue;	327	continue;
319		328
320	page_table_lock(area->as, false);	329	page_table_lock(area->as, false);
321	pte = page_mapping_find(area->as,	330	pte = page_mapping_find(area->as,
322	base + j * PAGE_SIZE);	331	base + j * PAGE_SIZE);
323	ASSERT(pte && PTE_VALID(pte) &&	332	ASSERT(pte && PTE_VALID(pte) &&
324	PTE_PRESENT(pte));	333	PTE_PRESENT(pte));
325	btree_insert(&area->sh_info->pagemap,	334	btree_insert(&area->sh_info->pagemap,
326	(base + j * PAGE_SIZE) - area->base,	335	(base + j * PAGE_SIZE) - area->base,
327	(void *) PTE_GET_FRAME(pte), NULL);	336	(void *) PTE_GET_FRAME(pte), NULL);
328	page_table_unlock(area->as, false);	337	page_table_unlock(area->as, false);
329		338
330	pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));	339	pfn_t pfn = ADDR2PFN(PTE_GET_FRAME(pte));
331	frame_reference_add(pfn);	340	frame_reference_add(pfn);
332	}	341	}
333		342
334	}	343	}
335	}	344	}
336	mutex_unlock(&area->sh_info->lock);	345	mutex_unlock(&area->sh_info->lock);
337	}	346	}
338		347
339	/** @}	348	/** @}
340	*/	349	*/
341		350

Subversion Repositories HelenOS

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