WebSVN – HelenOS – Diff – /branches/sparc/kernel/generic/src/ddi/ddi.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 genericddi
 * @{
 */
 
/**
 * @file
 * @brief   Device Driver Interface functions.
 *
 * This file contains functions that comprise the Device Driver Interface.
 * These are the functions for mapping physical memory and enabling I/O
 * space to tasks.
 */
 
#include <ddi/ddi.h>
#include <ddi/ddi_arg.h>
#include <proc/task.h>
#include <security/cap.h>
#include <mm/frame.h>
#include <mm/as.h>
#include <synch/spinlock.h>
#include <syscall/copy.h>
#include <adt/btree.h>
#include <arch.h>
#include <align.h>
#include <errno.h>
 
/** This lock protects the parea_btree. */
SPINLOCK_INITIALIZE(parea_lock);
 
/** B+tree with enabled physical memory areas. */
static btree_t parea_btree;
 
/** Initialize DDI. */
void ddi_init(void)
{
    btree_create(&parea_btree);
}
 
/** Enable piece of physical memory for mapping by physmem_map().
 *
 * @param parea Pointer to physical area structure.
 *
 * @todo This function doesn't check for overlaps. It depends on the kernel to
 * create disjunct physical memory areas.
 */
void ddi_parea_register(parea_t *parea)
{
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&parea_lock);
   
    /*
     * TODO: we should really check for overlaps here.
     * However, we should be safe because the kernel is pretty sane and
     * memory of different devices doesn't overlap.
     */
    btree_insert(&parea_btree, (btree_key_t) parea->pbase, parea, NULL);
 
    spinlock_unlock(&parea_lock);
    interrupts_restore(ipl);   
}
 
/** Map piece of physical memory into virtual address space of current task.
 *
 * @param pf Physical address of the starting frame.
 * @param vp Virtual address of the starting page.
 * @param pages Number of pages to map.
 * @param flags Address space area flags for the mapping.
 *
 * @return 0 on success, EPERM if the caller lacks capabilities to use this
 *  syscall, ENOENT if there is no task matching the specified ID or the
 *  physical address space is not enabled for mapping and ENOMEM if there
 *  was a problem in creating address space area.
 */
static int ddi_physmem_map(uintptr_t pf, uintptr_t vp, count_t pages, int flags)
{
    ipl_t ipl;
    cap_t caps;
    mem_backend_data_t backend_data;
 
    backend_data.base = pf;
    backend_data.frames = pages;
   
    /*
     * Make sure the caller is authorised to make this syscall.
     */
    caps = cap_get(TASK);
    if (!(caps & CAP_MEM_MANAGER))
        return EPERM;
 
    ipl = interrupts_disable();
 
    /*
     * Check if the physical memory area is enabled for mapping.
     * If the architecture supports virtually indexed caches, intercept
     * attempts to create an illegal address alias.
     */
    spinlock_lock(&parea_lock);
    parea_t *parea;
    btree_node_t *nodep;
    parea = (parea_t *) btree_search(&parea_btree, (btree_key_t) pf, &nodep);
    if (!parea || parea->frames < pages || ((flags & AS_AREA_CACHEABLE) &&
        !parea->cacheable) || (!(flags & AS_AREA_CACHEABLE) &&
        parea->cacheable)) {
        /*
         * This physical memory area cannot be mapped.
         */
        spinlock_unlock(&parea_lock);
        interrupts_restore(ipl);
        return ENOENT;
    }
    spinlock_unlock(&parea_lock);
 
    spinlock_lock(&TASK->lock);
   
    if (!as_area_create(TASK->as, flags, pages * PAGE_SIZE, vp, AS_AREA_ATTR_NONE,
        &phys_backend, &backend_data)) {
        /*
         * The address space area could not have been created.
         * We report it using ENOMEM.
         */
        spinlock_unlock(&TASK->lock);
        interrupts_restore(ipl);
        return ENOMEM;
    }
   
    /*
     * Mapping is created on-demand during page fault.
     */
   
    spinlock_unlock(&TASK->lock);
    interrupts_restore(ipl);
    return 0;
}
 
/** Enable range of I/O space for task.
 *
 * @param id Task ID of the destination task.
 * @param ioaddr Starting I/O address.
 * @param size Size of the enabled I/O space..
 *
 * @return 0 on success, EPERM if the caller lacks capabilities to use this
 *  syscall, ENOENT if there is no task matching the specified ID.
 */
static int ddi_iospace_enable(task_id_t id, uintptr_t ioaddr, size_t size)
{
    ipl_t ipl;
    cap_t caps;
    task_t *t;
    int rc;
   
    /*
     * Make sure the caller is authorised to make this syscall.
     */
    caps = cap_get(TASK);
    if (!(caps & CAP_IO_MANAGER))
        return EPERM;
   
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
   
    t = task_find_by_id(id);
   
    if ((!t) || (!context_check(CONTEXT, t->context))) {
        /*
         * There is no task with the specified ID
         * or the task belongs to a different security
         * context.
         */
        spinlock_unlock(&tasks_lock);
        interrupts_restore(ipl);
        return ENOENT;
    }
 
    /* Lock the task and release the lock protecting tasks_btree. */
    spinlock_lock(&t->lock);
    spinlock_unlock(&tasks_lock);
 
    rc = ddi_iospace_enable_arch(t, ioaddr, size);
   
    spinlock_unlock(&t->lock);
    interrupts_restore(ipl);
    return rc;
}
 
/** Wrapper for SYS_PHYSMEM_MAP syscall.
 *
 * @param phys_base Physical base address to map
 * @param virt_base Destination virtual address
 * @param pages Number of pages
 * @param flags Flags of newly mapped pages
 *
 * @return 0 on success, otherwise it returns error code found in errno.h
 */
unative_t sys_physmem_map(unative_t phys_base, unative_t virt_base,
    unative_t pages, unative_t flags)
{
    return (unative_t) ddi_physmem_map(ALIGN_DOWN((uintptr_t) phys_base,
        FRAME_SIZE), ALIGN_DOWN((uintptr_t) virt_base, PAGE_SIZE),
        (count_t) pages, (int) flags);
}
 
/** Wrapper for SYS_ENABLE_IOSPACE syscall.
 *
 * @param uspace_io_arg User space address of DDI argument structure.
 *
 * @return 0 on success, otherwise it returns error code found in errno.h
 */
unative_t sys_iospace_enable(ddi_ioarg_t *uspace_io_arg)
{
    ddi_ioarg_t arg;
    int rc;
   
    rc = copy_from_uspace(&arg, uspace_io_arg, sizeof(ddi_ioarg_t));
    if (rc != 0)
        return (unative_t) rc;
       
    return (unative_t) ddi_iospace_enable((task_id_t) arg.task_id,
        (uintptr_t) arg.ioaddr, (size_t) arg.size);
}
 
/** Disable or enable preemption.
 *
 * @param enable If non-zero, the preemption counter will be decremented,
 *  leading to potential enabling of preemption. Otherwise the preemption
 *  counter will be incremented, preventing preemption from occurring.
 *
 * @return Zero on success or EPERM if callers capabilities are not sufficient.
 */
unative_t sys_preempt_control(int enable)
{
        if (!cap_get(TASK) & CAP_PREEMPT_CONTROL)
                return EPERM;
        if (enable)
                preemption_enable();
        else
                preemption_disable();
        return 0;
}
 
/** @}
 */
 

Rev 2141	Rev 3343
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 genericddi	29	/** @addtogroup genericddi
30	* @{	30	* @{
31	*/	31	*/
32		32
33	/**	33	/**
34	* @file	34	* @file
35	* @brief Device Driver Interface functions.	35	* @brief Device Driver Interface functions.
36	*	36	*
37	* This file contains functions that comprise the Device Driver Interface.	37	* This file contains functions that comprise the Device Driver Interface.
38	* These are the functions for mapping physical memory and enabling I/O	38	* These are the functions for mapping physical memory and enabling I/O
39	* space to tasks.	39	* space to tasks.
40	*/	40	*/
41		41
42	#include <ddi/ddi.h>	42	#include <ddi/ddi.h>
43	#include <ddi/ddi_arg.h>	43	#include <ddi/ddi_arg.h>
44	#include <proc/task.h>	44	#include <proc/task.h>
45	#include <security/cap.h>	45	#include <security/cap.h>
46	#include <mm/frame.h>	46	#include <mm/frame.h>
47	#include <mm/as.h>	47	#include <mm/as.h>
48	#include <synch/spinlock.h>	48	#include <synch/spinlock.h>
49	#include <syscall/copy.h>	49	#include <syscall/copy.h>
50	#include <adt/btree.h>	50	#include <adt/btree.h>
51	#include <arch.h>	51	#include <arch.h>
52	#include <align.h>	52	#include <align.h>
53	#include <errno.h>	53	#include <errno.h>
54		54
55	/** This lock protects the parea_btree. */	55	/** This lock protects the parea_btree. */
56	SPINLOCK_INITIALIZE(parea_lock);	56	SPINLOCK_INITIALIZE(parea_lock);
57		57
58	/** B+tree with enabled physical memory areas. */	58	/** B+tree with enabled physical memory areas. */
59	static btree_t parea_btree;	59	static btree_t parea_btree;
60		60
61	/** Initialize DDI. */	61	/** Initialize DDI. */
62	void ddi_init(void)	62	void ddi_init(void)
63	{	63	{
64	btree_create(&parea_btree);	64	btree_create(&parea_btree);
65	}	65	}
66		66
67	/** Enable piece of physical memory for mapping by physmem_map().	67	/** Enable piece of physical memory for mapping by physmem_map().
68	*	68	*
69	* @param parea Pointer to physical area structure.	69	* @param parea Pointer to physical area structure.
70	*	70	*
71	* @todo This function doesn't check for overlaps. It depends on the kernel to	71	* @todo This function doesn't check for overlaps. It depends on the kernel to
72	* create disjunct physical memory areas.	72	* create disjunct physical memory areas.
73	*/	73	*/
74	void ddi_parea_register(parea_t *parea)	74	void ddi_parea_register(parea_t *parea)
75	{	75	{
76	ipl_t ipl;	76	ipl_t ipl;
77		77
78	ipl = interrupts_disable();	78	ipl = interrupts_disable();
79	spinlock_lock(&parea_lock);	79	spinlock_lock(&parea_lock);
80		80
81	/*	81	/*
82	* TODO: we should really check for overlaps here.	82	* TODO: we should really check for overlaps here.
83	* However, we should be safe because the kernel is pretty sane and	83	* However, we should be safe because the kernel is pretty sane and
84	* memory of different devices doesn't overlap.	84	* memory of different devices doesn't overlap.
85	*/	85	*/
86	btree_insert(&parea_btree, (btree_key_t) parea->pbase, parea, NULL);	86	btree_insert(&parea_btree, (btree_key_t) parea->pbase, parea, NULL);
87		87
88	spinlock_unlock(&parea_lock);	88	spinlock_unlock(&parea_lock);
89	interrupts_restore(ipl);	89	interrupts_restore(ipl);
90	}	90	}
91		91
92	/** Map piece of physical memory into virtual address space of current task.	92	/** Map piece of physical memory into virtual address space of current task.
93	*	93	*
94	* @param pf Physical address of the starting frame.	94	* @param pf Physical address of the starting frame.
95	* @param vp Virtual address of the starting page.	95	* @param vp Virtual address of the starting page.
96	* @param pages Number of pages to map.	96	* @param pages Number of pages to map.
97	* @param flags Address space area flags for the mapping.	97	* @param flags Address space area flags for the mapping.
98	*	98	*
99	* @return 0 on success, EPERM if the caller lacks capabilities to use this	99	* @return 0 on success, EPERM if the caller lacks capabilities to use this
100	* syscall, ENOENT if there is no task matching the specified ID or the	100	* syscall, ENOENT if there is no task matching the specified ID or the
101	* physical address space is not enabled for mapping and ENOMEM if there	101	* physical address space is not enabled for mapping and ENOMEM if there
102	* was a problem in creating address space area.	102	* was a problem in creating address space area.
103	*/	103	*/
104	static int ddi_physmem_map(uintptr_t pf, uintptr_t vp, count_t pages, int flags)	104	static int ddi_physmem_map(uintptr_t pf, uintptr_t vp, count_t pages, int flags)
105	{	105	{
106	ipl_t ipl;	106	ipl_t ipl;
107	cap_t caps;	107	cap_t caps;
108	mem_backend_data_t backend_data;	108	mem_backend_data_t backend_data;
109		109
110	backend_data.base = pf;	110	backend_data.base = pf;
111	backend_data.frames = pages;	111	backend_data.frames = pages;
112		112
113	/*	113	/*
114	* Make sure the caller is authorised to make this syscall.	114	* Make sure the caller is authorised to make this syscall.
115	*/	115	*/
116	caps = cap_get(TASK);	116	caps = cap_get(TASK);
117	if (!(caps & CAP_MEM_MANAGER))	117	if (!(caps & CAP_MEM_MANAGER))
118	return EPERM;	118	return EPERM;
119		119
120	ipl = interrupts_disable();	120	ipl = interrupts_disable();
121		121
122	/*	122	/*
123	* Check if the physical memory area is enabled for mapping.	123	* Check if the physical memory area is enabled for mapping.
124	* If the architecture supports virtually indexed caches, intercept	124	* If the architecture supports virtually indexed caches, intercept
125	* attempts to create an illegal address alias.	125	* attempts to create an illegal address alias.
126	*/	126	*/
127	spinlock_lock(&parea_lock);	127	spinlock_lock(&parea_lock);
128	parea_t *parea;	128	parea_t *parea;
129	btree_node_t *nodep;	129	btree_node_t *nodep;
130	parea = (parea_t *) btree_search(&parea_btree, (btree_key_t) pf, &nodep);	130	parea = (parea_t *) btree_search(&parea_btree, (btree_key_t) pf, &nodep);
131	if (!parea \|\| parea->frames < pages \|\| ((flags & AS_AREA_CACHEABLE) &&	131	if (!parea \|\| parea->frames < pages \|\| ((flags & AS_AREA_CACHEABLE) &&
132	!parea->cacheable) \|\| (!(flags & AS_AREA_CACHEABLE) &&	132	!parea->cacheable) \|\| (!(flags & AS_AREA_CACHEABLE) &&
133	parea->cacheable)) {	133	parea->cacheable)) {
134	/*	134	/*
135	* This physical memory area cannot be mapped.	135	* This physical memory area cannot be mapped.
136	*/	136	*/
137	spinlock_unlock(&parea_lock);	137	spinlock_unlock(&parea_lock);
138	interrupts_restore(ipl);	138	interrupts_restore(ipl);
139	return ENOENT;	139	return ENOENT;
140	}	140	}
141	spinlock_unlock(&parea_lock);	141	spinlock_unlock(&parea_lock);
142		142
143	spinlock_lock(&TASK->lock);	143	spinlock_lock(&TASK->lock);
144		144
145	if (!as_area_create(TASK->as, flags, pages * PAGE_SIZE, vp, AS_AREA_ATTR_NONE,	145	if (!as_area_create(TASK->as, flags, pages * PAGE_SIZE, vp, AS_AREA_ATTR_NONE,
146	&phys_backend, &backend_data)) {	146	&phys_backend, &backend_data)) {
147	/*	147	/*
148	* The address space area could not have been created.	148	* The address space area could not have been created.
149	* We report it using ENOMEM.	149	* We report it using ENOMEM.
150	*/	150	*/
151	spinlock_unlock(&TASK->lock);	151	spinlock_unlock(&TASK->lock);
152	interrupts_restore(ipl);	152	interrupts_restore(ipl);
153	return ENOMEM;	153	return ENOMEM;
154	}	154	}
155		155
156	/*	156	/*
157	* Mapping is created on-demand during page fault.	157	* Mapping is created on-demand during page fault.
158	*/	158	*/
159		159
160	spinlock_unlock(&TASK->lock);	160	spinlock_unlock(&TASK->lock);
161	interrupts_restore(ipl);	161	interrupts_restore(ipl);
162	return 0;	162	return 0;
163	}	163	}
164		164
165	/** Enable range of I/O space for task.	165	/** Enable range of I/O space for task.
166	*	166	*
167	* @param id Task ID of the destination task.	167	* @param id Task ID of the destination task.
168	* @param ioaddr Starting I/O address.	168	* @param ioaddr Starting I/O address.
169	* @param size Size of the enabled I/O space..	169	* @param size Size of the enabled I/O space..
170	*	170	*
171	* @return 0 on success, EPERM if the caller lacks capabilities to use this	171	* @return 0 on success, EPERM if the caller lacks capabilities to use this
172	* syscall, ENOENT if there is no task matching the specified ID.	172	* syscall, ENOENT if there is no task matching the specified ID.
173	*/	173	*/
174	static int ddi_iospace_enable(task_id_t id, uintptr_t ioaddr, size_t size)	174	static int ddi_iospace_enable(task_id_t id, uintptr_t ioaddr, size_t size)
175	{	175	{
176	ipl_t ipl;	176	ipl_t ipl;
177	cap_t caps;	177	cap_t caps;
178	task_t *t;	178	task_t *t;
179	int rc;	179	int rc;
180		180
181	/*	181	/*
182	* Make sure the caller is authorised to make this syscall.	182	* Make sure the caller is authorised to make this syscall.
183	*/	183	*/
184	caps = cap_get(TASK);	184	caps = cap_get(TASK);
185	if (!(caps & CAP_IO_MANAGER))	185	if (!(caps & CAP_IO_MANAGER))
186	return EPERM;	186	return EPERM;
187		187
188	ipl = interrupts_disable();	188	ipl = interrupts_disable();
189	spinlock_lock(&tasks_lock);	189	spinlock_lock(&tasks_lock);
190		190
191	t = task_find_by_id(id);	191	t = task_find_by_id(id);
192		192
193	if ((!t) \|\| (!context_check(CONTEXT, t->context))) {	193	if ((!t) \|\| (!context_check(CONTEXT, t->context))) {
194	/*	194	/*
195	* There is no task with the specified ID	195	* There is no task with the specified ID
196	* or the task belongs to a different security	196	* or the task belongs to a different security
197	* context.	197	* context.
198	*/	198	*/
199	spinlock_unlock(&tasks_lock);	199	spinlock_unlock(&tasks_lock);
200	interrupts_restore(ipl);	200	interrupts_restore(ipl);
201	return ENOENT;	201	return ENOENT;
202	}	202	}
203		203
204	/* Lock the task and release the lock protecting tasks_btree. */	204	/* Lock the task and release the lock protecting tasks_btree. */
205	spinlock_lock(&t->lock);	205	spinlock_lock(&t->lock);
206	spinlock_unlock(&tasks_lock);	206	spinlock_unlock(&tasks_lock);
207		207
208	rc = ddi_iospace_enable_arch(t, ioaddr, size);	208	rc = ddi_iospace_enable_arch(t, ioaddr, size);
209		209
210	spinlock_unlock(&t->lock);	210	spinlock_unlock(&t->lock);
211	interrupts_restore(ipl);	211	interrupts_restore(ipl);
212	return rc;	212	return rc;
213	}	213	}
214		214
215	/** Wrapper for SYS_PHYSMEM_MAP syscall.	215	/** Wrapper for SYS_PHYSMEM_MAP syscall.
216	*	216	*
217	* @param phys_base Physical base address to map	217	* @param phys_base Physical base address to map
218	* @param virt_base Destination virtual address	218	* @param virt_base Destination virtual address
219	* @param pages Number of pages	219	* @param pages Number of pages
220	* @param flags Flags of newly mapped pages	220	* @param flags Flags of newly mapped pages
221	*	221	*
222	* @return 0 on success, otherwise it returns error code found in errno.h	222	* @return 0 on success, otherwise it returns error code found in errno.h
223	*/	223	*/
224	unative_t sys_physmem_map(unative_t phys_base, unative_t virt_base,	224	unative_t sys_physmem_map(unative_t phys_base, unative_t virt_base,
225	unative_t pages, unative_t flags)	225	unative_t pages, unative_t flags)
226	{	226	{
227	return (unative_t) ddi_physmem_map(ALIGN_DOWN((uintptr_t) phys_base,	227	return (unative_t) ddi_physmem_map(ALIGN_DOWN((uintptr_t) phys_base,
228	FRAME_SIZE), ALIGN_DOWN((uintptr_t) virt_base, PAGE_SIZE),	228	FRAME_SIZE), ALIGN_DOWN((uintptr_t) virt_base, PAGE_SIZE),
229	(count_t) pages, (int) flags);	229	(count_t) pages, (int) flags);
230	}	230	}
231		231
232	/** Wrapper for SYS_ENABLE_IOSPACE syscall.	232	/** Wrapper for SYS_ENABLE_IOSPACE syscall.
233	*	233	*
234	* @param uspace_io_arg User space address of DDI argument structure.	234	* @param uspace_io_arg User space address of DDI argument structure.
235	*	235	*
236	* @return 0 on success, otherwise it returns error code found in errno.h	236	* @return 0 on success, otherwise it returns error code found in errno.h
237	*/	237	*/
238	unative_t sys_iospace_enable(ddi_ioarg_t *uspace_io_arg)	238	unative_t sys_iospace_enable(ddi_ioarg_t *uspace_io_arg)
239	{	239	{
240	ddi_ioarg_t arg;	240	ddi_ioarg_t arg;
241	int rc;	241	int rc;
242		242
243	rc = copy_from_uspace(&arg, uspace_io_arg, sizeof(ddi_ioarg_t));	243	rc = copy_from_uspace(&arg, uspace_io_arg, sizeof(ddi_ioarg_t));
244	if (rc != 0)	244	if (rc != 0)
245	return (unative_t) rc;	245	return (unative_t) rc;
246		246
247	return (unative_t) ddi_iospace_enable((task_id_t) arg.task_id,	247	return (unative_t) ddi_iospace_enable((task_id_t) arg.task_id,
248	(uintptr_t) arg.ioaddr, (size_t) arg.size);	248	(uintptr_t) arg.ioaddr, (size_t) arg.size);
249	}	249	}
250		250
251	/** Disable or enable preemption.	251	/** Disable or enable preemption.
252	*	252	*
253	* @param enable If non-zero, the preemption counter will be decremented,	253	* @param enable If non-zero, the preemption counter will be decremented,
254	* leading to potential enabling of preemption. Otherwise the preemption	254	* leading to potential enabling of preemption. Otherwise the preemption
255	* counter will be incremented, preventing preemption from occurring.	255	* counter will be incremented, preventing preemption from occurring.
256	*	256	*
257	* @return Zero on success or EPERM if callers capabilities are not sufficient.	257	* @return Zero on success or EPERM if callers capabilities are not sufficient.
258	*/	258	*/
259	unative_t sys_preempt_control(int enable)	259	unative_t sys_preempt_control(int enable)
260	{	260	{
261	if (!cap_get(TASK) & CAP_PREEMPT_CONTROL)	261	if (!cap_get(TASK) & CAP_PREEMPT_CONTROL)
262	return EPERM;	262	return EPERM;
263	if (enable)	263	if (enable)
264	preemption_enable();	264	preemption_enable();
265	else	265	else
266	preemption_disable();	266	preemption_disable();
267	return 0;	267	return 0;
268	}	268	}
269		269
270	/** @}	270	/** @}
271	*/	271	*/
272		272

Subversion Repositories HelenOS

(root)/branches/sparc/kernel/generic/src/ddi/ddi.c @ 3862 – Rev 2141 → 3343