memobj-r0drv-linux.c@ 18522

Last change on this file since 18522 was 18522, checked in by vboxsync, 16 years ago
memobj-r0drv-linux.c: nitpicking.
Property svn:eol-style set to `native` Property svn:keywords set to `Id Rev`
File size: 38.5 KB

Line
1	/* $Revision: 18522 $ */
2	/** @file
3	* IPRT - Ring-0 Memory Objects, Linux.
4	*/
5
6	/*
7	* Copyright (C) 2006-2007 Sun Microsystems, Inc.
8	*
9	* This file is part of VirtualBox Open Source Edition (OSE), as
10	* available from http://www.virtualbox.org. This file is free software;
11	* you can redistribute it and/or modify it under the terms of the GNU
12	* General Public License (GPL) as published by the Free Software
13	* Foundation, in version 2 as it comes in the "COPYING" file of the
14	* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
15	* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
16	*
17	* The contents of this file may alternatively be used under the terms
18	* of the Common Development and Distribution License Version 1.0
19	* (CDDL) only, as it comes in the "COPYING.CDDL" file of the
20	* VirtualBox OSE distribution, in which case the provisions of the
21	* CDDL are applicable instead of those of the GPL.
22	*
23	* You may elect to license modified versions of this file under the
24	* terms and conditions of either the GPL or the CDDL or both.
25	*
26	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa
27	* Clara, CA 95054 USA or visit http://www.sun.com if you need
28	* additional information or have any questions.
29	*/
30
31
32	/*******************************************************************************
33	* Header Files *
34	*******************************************************************************/
35	#include "the-linux-kernel.h"
36
37	#include <iprt/memobj.h>
38	#include <iprt/alloc.h>
39	#include <iprt/assert.h>
40	#include <iprt/log.h>
41	#include <iprt/string.h>
42	#include <iprt/process.h>
43	#include "internal/memobj.h"
44
45
46	/*******************************************************************************
47	* Defined Constants And Macros *
48	*******************************************************************************/
49	/* early 2.6 kernels */
50	#ifndef PAGE_SHARED_EXEC
51	# define PAGE_SHARED_EXEC PAGE_SHARED
52	#endif
53	#ifndef PAGE_READONLY_EXEC
54	# define PAGE_READONLY_EXEC PAGE_READONLY
55	#endif
56
57	/*
58	* 2.6.29+ kernels don't work with remap_pfn_range() anymore because
59	* track_pfn_vma_new() is apparently not defined for non-RAM pages.
60	* It should be safe to use vm_insert_page() older kernels as well.
61	*/
62	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 23)
63	# define VBOX_USE_INSERT_PAGE
64	#endif
65
66
67	/*******************************************************************************
68	* Structures and Typedefs *
69	*******************************************************************************/
70	/**
71	* The Darwin version of the memory object structure.
72	*/
73	typedef struct RTR0MEMOBJLNX
74	{
75	/** The core structure. */
76	RTR0MEMOBJINTERNAL Core;
77	/** Set if the allocation is contiguous.
78	* This means it has to be given back as one chunk. */
79	bool fContiguous;
80	/** Set if we've vmap'ed thed memory into ring-0. */
81	bool fMappedToRing0;
82	/** The pages in the apPages array. */
83	size_t cPages;
84	/** Array of struct page pointers. (variable size) */
85	struct page *apPages[1];
86	} RTR0MEMOBJLNX, *PRTR0MEMOBJLNX;
87
88
89	/**
90	* Helper that converts from a RTR0PROCESS handle to a linux task.
91	*
92	* @returns The corresponding Linux task.
93	* @param R0Process IPRT ring-0 process handle.
94	*/
95	struct task_struct *rtR0ProcessToLinuxTask(RTR0PROCESS R0Process)
96	{
97	/** @todo fix rtR0ProcessToLinuxTask!! */
98	return R0Process == RTR0ProcHandleSelf() ? current : NULL;
99	}
100
101
102	/**
103	* Compute order. Some functions allocate 2^order pages.
104	*
105	* @returns order.
106	* @param cPages Number of pages.
107	*/
108	static int rtR0MemObjLinuxOrder(size_t cPages)
109	{
110	int iOrder;
111	size_t cTmp;
112
113	for (iOrder = 0, cTmp = cPages; cTmp >>= 1; ++iOrder)
114	;
115	if (cPages & ~((size_t)1 << iOrder))
116	++iOrder;
117
118	return iOrder;
119	}
120
121
122	/**
123	* Converts from RTMEM_PROT_* to Linux PAGE_*.
124	*
125	* @returns Linux page protection constant.
126	* @param fProt The IPRT protection mask.
127	* @param fKernel Whether it applies to kernel or user space.
128	*/
129	static pgprot_t rtR0MemObjLinuxConvertProt(unsigned fProt, bool fKernel)
130	{
131	switch (fProt)
132	{
133	default:
134	AssertMsgFailed(("%#x %d\n", fProt, fKernel));
135	case RTMEM_PROT_NONE:
136	return PAGE_NONE;
137
138	case RTMEM_PROT_READ:
139	return fKernel ? PAGE_KERNEL_RO : PAGE_READONLY;
140
141	case RTMEM_PROT_WRITE:
142	case RTMEM_PROT_WRITE \| RTMEM_PROT_READ:
143	return fKernel ? PAGE_KERNEL : PAGE_SHARED;
144
145	case RTMEM_PROT_EXEC:
146	case RTMEM_PROT_EXEC \| RTMEM_PROT_READ:
147	#if defined(RT_ARCH_X86) \|\| defined(RT_ARCH_AMD64)
148	if (fKernel)
149	{
150	pgprot_t fPg = MY_PAGE_KERNEL_EXEC;
151	pgprot_val(fPg) &= ~_PAGE_RW;
152	return fPg;
153	}
154	return PAGE_READONLY_EXEC;
155	#else
156	return fKernel ? MY_PAGE_KERNEL_EXEC : PAGE_READONLY_EXEC;
157	#endif
158
159	case RTMEM_PROT_WRITE \| RTMEM_PROT_EXEC:
160	case RTMEM_PROT_WRITE \| RTMEM_PROT_EXEC \| RTMEM_PROT_READ:
161	return fKernel ? MY_PAGE_KERNEL_EXEC : PAGE_SHARED_EXEC;
162	}
163	}
164
165
166	/**
167	* Internal worker that allocates physical pages and creates the memory object for them.
168	*
169	* @returns IPRT status code.
170	* @param ppMemLnx Where to store the memory object pointer.
171	* @param enmType The object type.
172	* @param cb The number of bytes to allocate.
173	* @param fFlagsLnx The page allocation flags (GPFs).
174	* @param fContiguous Whether the allocation must be contiguous.
175	*/
176	static int rtR0MemObjLinuxAllocPages(PRTR0MEMOBJLNX *ppMemLnx, RTR0MEMOBJTYPE enmType, size_t cb, unsigned fFlagsLnx, bool fContiguous)
177	{
178	size_t iPage;
179	size_t cPages = cb >> PAGE_SHIFT;
180	struct page *paPages;
181
182	/*
183	* Allocate a memory object structure that's large enough to contain
184	* the page pointer array.
185	*/
186	PRTR0MEMOBJLNX pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(RT_OFFSETOF(RTR0MEMOBJLNX, apPages[cPages]), enmType, NULL, cb);
187	if (!pMemLnx)
188	return VERR_NO_MEMORY;
189	pMemLnx->cPages = cPages;
190
191	/*
192	* Allocate the pages.
193	* For small allocations we'll try contiguous first and then fall back on page by page.
194	*/
195	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
196	if ( fContiguous
197	\|\| cb <= PAGE_SIZE * 2)
198	{
199	#ifdef VBOX_USE_INSERT_PAGE
200	paPages = alloc_pages(fFlagsLnx \| __GFP_COMP, rtR0MemObjLinuxOrder(cb >> PAGE_SHIFT));
201	#else
202	paPages = alloc_pages(fFlagsLnx, rtR0MemObjLinuxOrder(cb >> PAGE_SHIFT));
203	#endif
204	if (paPages)
205	{
206	fContiguous = true;
207	for (iPage = 0; iPage < cPages; iPage++)
208	pMemLnx->apPages[iPage] = &paPages[iPage];
209	}
210	else if (fContiguous)
211	{
212	rtR0MemObjDelete(&pMemLnx->Core);
213	return VERR_NO_MEMORY;
214	}
215	}
216
217	if (!fContiguous)
218	{
219	for (iPage = 0; iPage < cPages; iPage++)
220	{
221	pMemLnx->apPages[iPage] = alloc_page(fFlagsLnx);
222	if (RT_UNLIKELY(!pMemLnx->apPages[iPage]))
223	{
224	while (iPage-- > 0)
225	__free_page(pMemLnx->apPages[iPage]);
226	rtR0MemObjDelete(&pMemLnx->Core);
227	return VERR_NO_MEMORY;
228	}
229	}
230	}
231
232	#else /* < 2.4.22 */
233	/** @todo figure out why we didn't allocate page-by-page on 2.4.21 and older... */
234	paPages = alloc_pages(fFlagsLnx, rtR0MemObjLinuxOrder(cb >> PAGE_SHIFT));
235	if (!paPages)
236	{
237	rtR0MemObjDelete(&pMemLnx->Core);
238	return VERR_NO_MEMORY;
239	}
240	for (iPage = 0; iPage < cPages; iPage++)
241	{
242	pMemLnx->apPages[iPage] = &paPages[iPage];
243	MY_SET_PAGES_EXEC(pMemLnx->apPages[iPage], 1);
244	if (PageHighMem(pMemLnx->apPages[iPage]))
245	BUG();
246	}
247
248	fContiguous = true;
249	#endif /* < 2.4.22 */
250	pMemLnx->fContiguous = fContiguous;
251
252	/*
253	* Reserve the pages.
254	*/
255	for (iPage = 0; iPage < cPages; iPage++)
256	SetPageReserved(pMemLnx->apPages[iPage]);
257
258	*ppMemLnx = pMemLnx;
259	return VINF_SUCCESS;
260	}
261
262
263	/**
264	* Frees the physical pages allocated by the rtR0MemObjLinuxAllocPages() call.
265	*
266	* This method does NOT free the object.
267	*
268	* @param pMemLnx The object which physical pages should be freed.
269	*/
270	static void rtR0MemObjLinuxFreePages(PRTR0MEMOBJLNX pMemLnx)
271	{
272	size_t iPage = pMemLnx->cPages;
273	if (iPage > 0)
274	{
275	/*
276	* Restore the page flags.
277	*/
278	while (iPage-- > 0)
279	{
280	ClearPageReserved(pMemLnx->apPages[iPage]);
281	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
282	#else
283	MY_SET_PAGES_NOEXEC(pMemLnx->apPages[iPage], 1);
284	#endif
285	}
286
287	/*
288	* Free the pages.
289	*/
290	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
291	if (!pMemLnx->fContiguous)
292	{
293	iPage = pMemLnx->cPages;
294	while (iPage-- > 0)
295	__free_page(pMemLnx->apPages[iPage]);
296	}
297	else
298	#endif
299	__free_pages(pMemLnx->apPages[0], rtR0MemObjLinuxOrder(pMemLnx->cPages));
300
301	pMemLnx->cPages = 0;
302	}
303	}
304
305
306	/**
307	* Maps the allocation into ring-0.
308	*
309	* This will update the RTR0MEMOBJLNX::Core.pv and RTR0MEMOBJ::fMappedToRing0 members.
310	*
311	* Contiguous mappings that isn't in 'high' memory will already be mapped into kernel
312	* space, so we'll use that mapping if possible. If execute access is required, we'll
313	* play safe and do our own mapping.
314	*
315	* @returns IPRT status code.
316	* @param pMemLnx The linux memory object to map.
317	* @param fExecutable Whether execute access is required.
318	*/
319	static int rtR0MemObjLinuxVMap(PRTR0MEMOBJLNX pMemLnx, bool fExecutable)
320	{
321	int rc = VINF_SUCCESS;
322
323	/*
324	* Choose mapping strategy.
325	*/
326	bool fMustMap = fExecutable
327	\|\| !pMemLnx->fContiguous;
328	if (!fMustMap)
329	{
330	size_t iPage = pMemLnx->cPages;
331	while (iPage-- > 0)
332	if (PageHighMem(pMemLnx->apPages[iPage]))
333	{
334	fMustMap = true;
335	break;
336	}
337	}
338
339	Assert(!pMemLnx->Core.pv);
340	Assert(!pMemLnx->fMappedToRing0);
341
342	if (fMustMap)
343	{
344	/*
345	* Use vmap - 2.4.22 and later.
346	*/
347	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
348	pgprot_t fPg;
349	pgprot_val(fPg) = _PAGE_PRESENT \| _PAGE_RW;
350	# ifdef _PAGE_NX
351	if (!fExecutable)
352	pgprot_val(fPg) \|= _PAGE_NX;
353	# endif
354
355	# ifdef VM_MAP
356	pMemLnx->Core.pv = vmap(&pMemLnx->apPages[0], pMemLnx->cPages, VM_MAP, fPg);
357	# else
358	pMemLnx->Core.pv = vmap(&pMemLnx->apPages[0], pMemLnx->cPages, VM_ALLOC, fPg);
359	# endif
360	if (pMemLnx->Core.pv)
361	pMemLnx->fMappedToRing0 = true;
362	else
363	rc = VERR_MAP_FAILED;
364	#else /* < 2.4.22 */
365	rc = VERR_NOT_SUPPORTED;
366	#endif
367	}
368	else
369	{
370	/*
371	* Use the kernel RAM mapping.
372	*/
373	pMemLnx->Core.pv = phys_to_virt(page_to_phys(pMemLnx->apPages[0]));
374	Assert(pMemLnx->Core.pv);
375	}
376
377	return rc;
378	}
379
380
381	/**
382	* Undos what rtR0MemObjLinuxVMap() did.
383	*
384	* @param pMemLnx The linux memory object.
385	*/
386	static void rtR0MemObjLinuxVUnmap(PRTR0MEMOBJLNX pMemLnx)
387	{
388	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
389	if (pMemLnx->fMappedToRing0)
390	{
391	Assert(pMemLnx->Core.pv);
392	vunmap(pMemLnx->Core.pv);
393	pMemLnx->fMappedToRing0 = false;
394	}
395	#else /* < 2.4.22 */
396	Assert(!pMemLnx->fMappedToRing0);
397	#endif
398	pMemLnx->Core.pv = NULL;
399	}
400
401
402	int rtR0MemObjNativeFree(RTR0MEMOBJ pMem)
403	{
404	PRTR0MEMOBJLNX pMemLnx = (PRTR0MEMOBJLNX)pMem;
405
406	/*
407	* Release any memory that we've allocated or locked.
408	*/
409	switch (pMemLnx->Core.enmType)
410	{
411	case RTR0MEMOBJTYPE_LOW:
412	case RTR0MEMOBJTYPE_PAGE:
413	case RTR0MEMOBJTYPE_CONT:
414	case RTR0MEMOBJTYPE_PHYS:
415	case RTR0MEMOBJTYPE_PHYS_NC:
416	rtR0MemObjLinuxVUnmap(pMemLnx);
417	rtR0MemObjLinuxFreePages(pMemLnx);
418	break;
419
420	case RTR0MEMOBJTYPE_LOCK:
421	if (pMemLnx->Core.u.Lock.R0Process != NIL_RTR0PROCESS)
422	{
423	size_t iPage;
424	struct task_struct *pTask = rtR0ProcessToLinuxTask(pMemLnx->Core.u.Lock.R0Process);
425	Assert(pTask);
426	if (pTask && pTask->mm)
427	down_read(&pTask->mm->mmap_sem);
428
429	iPage = pMemLnx->cPages;
430	while (iPage-- > 0)
431	{
432	if (!PageReserved(pMemLnx->apPages[iPage]))
433	SetPageDirty(pMemLnx->apPages[iPage]);
434	page_cache_release(pMemLnx->apPages[iPage]);
435	}
436
437	if (pTask && pTask->mm)
438	up_read(&pTask->mm->mmap_sem);
439	}
440	else
441	AssertFailed(); /* not implemented for R0 */
442	break;
443
444	case RTR0MEMOBJTYPE_RES_VIRT:
445	Assert(pMemLnx->Core.pv);
446	if (pMemLnx->Core.u.ResVirt.R0Process != NIL_RTR0PROCESS)
447	{
448	struct task_struct *pTask = rtR0ProcessToLinuxTask(pMemLnx->Core.u.Lock.R0Process);
449	Assert(pTask);
450	if (pTask && pTask->mm)
451	{
452	down_write(&pTask->mm->mmap_sem);
453	MY_DO_MUNMAP(pTask->mm, (unsigned long)pMemLnx->Core.pv, pMemLnx->Core.cb);
454	up_write(&pTask->mm->mmap_sem);
455	}
456	}
457	else
458	{
459	vunmap(pMemLnx->Core.pv);
460
461	Assert(pMemLnx->cPages == 1 && pMemLnx->apPages[0] != NULL);
462	__free_page(pMemLnx->apPages[0]);
463	pMemLnx->apPages[0] = NULL;
464	pMemLnx->cPages = 0;
465	}
466	pMemLnx->Core.pv = NULL;
467	break;
468
469	case RTR0MEMOBJTYPE_MAPPING:
470	Assert(pMemLnx->cPages == 0); Assert(pMemLnx->Core.pv);
471	if (pMemLnx->Core.u.ResVirt.R0Process != NIL_RTR0PROCESS)
472	{
473	struct task_struct *pTask = rtR0ProcessToLinuxTask(pMemLnx->Core.u.Lock.R0Process);
474	Assert(pTask);
475	if (pTask && pTask->mm)
476	{
477	down_write(&pTask->mm->mmap_sem);
478	MY_DO_MUNMAP(pTask->mm, (unsigned long)pMemLnx->Core.pv, pMemLnx->Core.cb);
479	up_write(&pTask->mm->mmap_sem);
480	}
481	}
482	else
483	vunmap(pMemLnx->Core.pv);
484	pMemLnx->Core.pv = NULL;
485	break;
486
487	default:
488	AssertMsgFailed(("enmType=%d\n", pMemLnx->Core.enmType));
489	return VERR_INTERNAL_ERROR;
490	}
491	return VINF_SUCCESS;
492	}
493
494
495	int rtR0MemObjNativeAllocPage(PPRTR0MEMOBJINTERNAL ppMem, size_t cb, bool fExecutable)
496	{
497	PRTR0MEMOBJLNX pMemLnx;
498	int rc;
499
500	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
501	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_PAGE, cb, GFP_HIGHUSER, false /* non-contiguous */);
502	#else
503	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_PAGE, cb, GFP_USER, false /* non-contiguous */);
504	#endif
505	if (RT_SUCCESS(rc))
506	{
507	rc = rtR0MemObjLinuxVMap(pMemLnx, fExecutable);
508	if (RT_SUCCESS(rc))
509	{
510	*ppMem = &pMemLnx->Core;
511	return rc;
512	}
513
514	rtR0MemObjLinuxFreePages(pMemLnx);
515	rtR0MemObjDelete(&pMemLnx->Core);
516	}
517
518	return rc;
519	}
520
521
522	int rtR0MemObjNativeAllocLow(PPRTR0MEMOBJINTERNAL ppMem, size_t cb, bool fExecutable)
523	{
524	PRTR0MEMOBJLNX pMemLnx;
525	int rc;
526
527	#ifdef RT_ARCH_AMD64
528	# ifdef GFP_DMA32
529	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_LOW, cb, GFP_DMA32, false /* non-contiguous */);
530	if (RT_FAILURE(rc))
531	# endif
532	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_LOW, cb, GFP_DMA, false /* non-contiguous */);
533	#else
534	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_LOW, cb, GFP_USER, false /* non-contiguous */);
535	#endif
536	if (RT_SUCCESS(rc))
537	{
538	rc = rtR0MemObjLinuxVMap(pMemLnx, fExecutable);
539	if (RT_SUCCESS(rc))
540	{
541	*ppMem = &pMemLnx->Core;
542	return rc;
543	}
544
545	rtR0MemObjLinuxFreePages(pMemLnx);
546	rtR0MemObjDelete(&pMemLnx->Core);
547	}
548
549	return rc;
550	}
551
552
553	int rtR0MemObjNativeAllocCont(PPRTR0MEMOBJINTERNAL ppMem, size_t cb, bool fExecutable)
554	{
555	PRTR0MEMOBJLNX pMemLnx;
556	int rc;
557
558	#ifdef RT_ARCH_AMD64
559	# ifdef GFP_DMA32
560	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_CONT, cb, GFP_DMA32, true /* contiguous */);
561	if (RT_FAILURE(rc))
562	# endif
563	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_CONT, cb, GFP_DMA, true /* contiguous */);
564	#else
565	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, RTR0MEMOBJTYPE_CONT, cb, GFP_USER, true /* contiguous */);
566	#endif
567	if (RT_SUCCESS(rc))
568	{
569	rc = rtR0MemObjLinuxVMap(pMemLnx, fExecutable);
570	if (RT_SUCCESS(rc))
571	{
572	#if defined(RT_STRICT) && (defined(RT_ARCH_AMD64) \|\| defined(CONFIG_HIGHMEM64G))
573	size_t iPage = pMemLnx->cPages;
574	while (iPage-- > 0)
575	Assert(page_to_phys(pMemLnx->apPages[iPage]) < _4G);
576	#endif
577	pMemLnx->Core.u.Cont.Phys = page_to_phys(pMemLnx->apPages[0]);
578	*ppMem = &pMemLnx->Core;
579	return rc;
580	}
581
582	rtR0MemObjLinuxFreePages(pMemLnx);
583	rtR0MemObjDelete(&pMemLnx->Core);
584	}
585
586	return rc;
587	}
588
589
590	/**
591	* Worker for rtR0MemObjLinuxAllocPhysSub that tries one allocation strategy.
592	*
593	* @returns IPRT status.
594	* @param ppMemLnx Where to
595	* @param enmType The object type.
596	* @param cb The size of the allocation.
597	* @param PhysHighest See rtR0MemObjNativeAllocPhys.
598	* @param fGfp The Linux GFP flags to use for the allocation.
599	*/
600	static int rtR0MemObjLinuxAllocPhysSub2(PPRTR0MEMOBJINTERNAL ppMem, RTR0MEMOBJTYPE enmType, size_t cb, RTHCPHYS PhysHighest, unsigned fGfp)
601	{
602	PRTR0MEMOBJLNX pMemLnx;
603	int rc;
604
605	rc = rtR0MemObjLinuxAllocPages(&pMemLnx, enmType, cb, fGfp,
606	enmType == RTR0MEMOBJTYPE_PHYS /* contiguous / non-contiguous */);
607	if (RT_FAILURE(rc))
608	return rc;
609
610	/*
611	* Check the addresses if necessary. (Can be optimized a bit for PHYS.)
612	*/
613	if (PhysHighest != NIL_RTHCPHYS)
614	{
615	size_t iPage = pMemLnx->cPages;
616	while (iPage-- > 0)
617	if (page_to_phys(pMemLnx->apPages[iPage]) >= PhysHighest)
618	{
619	rtR0MemObjLinuxFreePages(pMemLnx);
620	rtR0MemObjDelete(&pMemLnx->Core);
621	return VERR_NO_MEMORY;
622	}
623	}
624
625	/*
626	* Complete the object.
627	*/
628	if (enmType == RTR0MEMOBJTYPE_PHYS)
629	{
630	pMemLnx->Core.u.Phys.PhysBase = page_to_phys(pMemLnx->apPages[0]);
631	pMemLnx->Core.u.Phys.fAllocated = true;
632	}
633	*ppMem = &pMemLnx->Core;
634	return rc;
635	}
636
637
638	/**
639	* Worker for rtR0MemObjNativeAllocPhys and rtR0MemObjNativeAllocPhysNC.
640	*
641	* @returns IPRT status.
642	* @param ppMem Where to store the memory object pointer on success.
643	* @param enmType The object type.
644	* @param cb The size of the allocation.
645	* @param PhysHighest See rtR0MemObjNativeAllocPhys.
646	*/
647	static int rtR0MemObjLinuxAllocPhysSub(PPRTR0MEMOBJINTERNAL ppMem, RTR0MEMOBJTYPE enmType, size_t cb, RTHCPHYS PhysHighest)
648	{
649	int rc;
650
651	/*
652	* There are two clear cases and that's the <=16MB and anything-goes ones.
653	* When the physical address limit is somewhere inbetween those two we'll
654	* just have to try, starting with HIGHUSER and working our way thru the
655	* different types, hoping we'll get lucky.
656	*
657	* We should probably move this physical address restriction logic up to
658	* the page alloc function as it would be more efficient there. But since
659	* we don't expect this to be a performance issue just yet it can wait.
660	*/
661	if (PhysHighest == NIL_RTHCPHYS)
662	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_HIGHUSER);
663	else if (PhysHighest <= _1M * 16)
664	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_DMA);
665	else
666	{
667	rc = VERR_NO_MEMORY;
668	if (RT_FAILURE(rc))
669	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_HIGHUSER);
670	if (RT_FAILURE(rc))
671	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_USER);
672	#ifdef GFP_DMA32
673	if (RT_FAILURE(rc))
674	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_DMA32);
675	#endif
676	if (RT_FAILURE(rc))
677	rc = rtR0MemObjLinuxAllocPhysSub2(ppMem, enmType, cb, PhysHighest, GFP_DMA);
678	}
679	return rc;
680	}
681
682
683	int rtR0MemObjNativeAllocPhys(PPRTR0MEMOBJINTERNAL ppMem, size_t cb, RTHCPHYS PhysHighest)
684	{
685	return rtR0MemObjLinuxAllocPhysSub(ppMem, RTR0MEMOBJTYPE_PHYS, cb, PhysHighest);
686	}
687
688
689	int rtR0MemObjNativeAllocPhysNC(PPRTR0MEMOBJINTERNAL ppMem, size_t cb, RTHCPHYS PhysHighest)
690	{
691	return rtR0MemObjLinuxAllocPhysSub(ppMem, RTR0MEMOBJTYPE_PHYS_NC, cb, PhysHighest);
692	}
693
694
695	int rtR0MemObjNativeEnterPhys(PPRTR0MEMOBJINTERNAL ppMem, RTHCPHYS Phys, size_t cb)
696	{
697	/*
698	* All we need to do here is to validate that we can use
699	* ioremap on the specified address (32/64-bit dma_addr_t).
700	*/
701	PRTR0MEMOBJLNX pMemLnx;
702	dma_addr_t PhysAddr = Phys;
703	AssertMsgReturn(PhysAddr == Phys, ("%#llx\n", (unsigned long long)Phys), VERR_ADDRESS_TOO_BIG);
704
705	pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(sizeof(*pMemLnx), RTR0MEMOBJTYPE_PHYS, NULL, cb);
706	if (!pMemLnx)
707	return VERR_NO_MEMORY;
708
709	pMemLnx->Core.u.Phys.PhysBase = PhysAddr;
710	pMemLnx->Core.u.Phys.fAllocated = false;
711	Assert(!pMemLnx->cPages);
712	*ppMem = &pMemLnx->Core;
713	return VINF_SUCCESS;
714	}
715
716
717	int rtR0MemObjNativeLockUser(PPRTR0MEMOBJINTERNAL ppMem, RTR3PTR R3Ptr, size_t cb, RTR0PROCESS R0Process)
718	{
719	const int cPages = cb >> PAGE_SHIFT;
720	struct task_struct *pTask = rtR0ProcessToLinuxTask(R0Process);
721	struct vm_area_struct **papVMAs;
722	PRTR0MEMOBJLNX pMemLnx;
723	int rc = VERR_NO_MEMORY;
724
725	/*
726	* Check for valid task and size overflows.
727	*/
728	if (!pTask)
729	return VERR_NOT_SUPPORTED;
730	if (((size_t)cPages << PAGE_SHIFT) != cb)
731	return VERR_OUT_OF_RANGE;
732
733	/*
734	* Allocate the memory object and a temporary buffer for the VMAs.
735	*/
736	pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(RT_OFFSETOF(RTR0MEMOBJLNX, apPages[cPages]), RTR0MEMOBJTYPE_LOCK, (void *)R3Ptr, cb);
737	if (!pMemLnx)
738	return VERR_NO_MEMORY;
739
740	papVMAs = (struct vm_area_struct *)RTMemAlloc(sizeof(papVMAs) * cPages);
741	if (papVMAs)
742	{
743	down_read(&pTask->mm->mmap_sem);
744
745	/*
746	* Get user pages.
747	*/
748	rc = get_user_pages(pTask, /* Task for fault acounting. */
749	pTask->mm, /* Whose pages. */
750	R3Ptr, /* Where from. */
751	cPages, /* How many pages. */
752	1, /* Write to memory. */
753	0, /* force. */
754	&pMemLnx->apPages[0], /* Page array. */
755	papVMAs); /* vmas */
756	if (rc == cPages)
757	{
758	/*
759	* Flush dcache (required?), protect against fork and _really_ pin the page
760	* table entries. get_user_pages() will protect against swapping out the
761	* pages but it will NOT protect against removing page table entries. This
762	* can be achieved with
763	* - using mlock / mmap(..., MAP_LOCKED, ...) from userland. This requires
764	* an appropriate limit set up with setrlimit(..., RLIMIT_MEMLOCK, ...).
765	* Usual Linux distributions support only a limited size of locked pages
766	* (e.g. 32KB).
767	* - setting the PageReserved bit (as we do in rtR0MemObjLinuxAllocPages()
768	* or by
769	* - setting the VM_LOCKED flag. This is the same as doing mlock() without
770	* a range check.
771	*/
772	/** @todo The Linux fork() protection will require more work if this API
773	* is to be used for anything but locking VM pages. */
774	while (rc-- > 0)
775	{
776	flush_dcache_page(pMemLnx->apPages[rc]);
777	papVMAs[rc]->vm_flags \|= (VM_DONTCOPY \| VM_LOCKED);
778	}
779
780	up_read(&pTask->mm->mmap_sem);
781
782	RTMemFree(papVMAs);
783
784	pMemLnx->Core.u.Lock.R0Process = R0Process;
785	pMemLnx->cPages = cPages;
786	Assert(!pMemLnx->fMappedToRing0);
787	*ppMem = &pMemLnx->Core;
788
789	return VINF_SUCCESS;
790	}
791
792	/*
793	* Failed - we need to unlock any pages that we succeeded to lock.
794	*/
795	while (rc-- > 0)
796	{
797	if (!PageReserved(pMemLnx->apPages[rc]))
798	SetPageDirty(pMemLnx->apPages[rc]);
799	page_cache_release(pMemLnx->apPages[rc]);
800	}
801
802	up_read(&pTask->mm->mmap_sem);
803
804	RTMemFree(papVMAs);
805	rc = VERR_LOCK_FAILED;
806	}
807
808	rtR0MemObjDelete(&pMemLnx->Core);
809	return rc;
810	}
811
812
813	int rtR0MemObjNativeLockKernel(PPRTR0MEMOBJINTERNAL ppMem, void *pv, size_t cb)
814	{
815	/* What is there to lock? Should/Can we fake this? */
816	return VERR_NOT_SUPPORTED;
817	}
818
819
820	int rtR0MemObjNativeReserveKernel(PPRTR0MEMOBJINTERNAL ppMem, void *pvFixed, size_t cb, size_t uAlignment)
821	{
822	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
823	const size_t cPages = cb >> PAGE_SHIFT;
824	struct page *pDummyPage;
825	struct page **papPages;
826
827	/* check for unsupported stuff. */
828	AssertMsgReturn(pvFixed == (void *)-1, ("%p\n", pvFixed), VERR_NOT_SUPPORTED);
829	AssertMsgReturn(uAlignment <= PAGE_SIZE, ("%#x\n", uAlignment), VERR_NOT_SUPPORTED);
830
831	/*
832	* Allocate a dummy page and create a page pointer array for vmap such that
833	* the dummy page is mapped all over the reserved area.
834	*/
835	pDummyPage = alloc_page(GFP_HIGHUSER);
836	if (!pDummyPage)
837	return VERR_NO_MEMORY;
838	papPages = RTMemAlloc(sizeof(papPages) cPages);
839	if (papPages)
840	{
841	void *pv;
842	size_t iPage = cPages;
843	while (iPage-- > 0)
844	papPages[iPage] = pDummyPage;
845	# ifdef VM_MAP
846	pv = vmap(papPages, cPages, VM_MAP, PAGE_KERNEL_RO);
847	# else
848	pv = vmap(papPages, cPages, VM_ALLOC, PAGE_KERNEL_RO);
849	# endif
850	RTMemFree(papPages);
851	if (pv)
852	{
853	PRTR0MEMOBJLNX pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(sizeof(*pMemLnx), RTR0MEMOBJTYPE_RES_VIRT, pv, cb);
854	if (pMemLnx)
855	{
856	pMemLnx->Core.u.ResVirt.R0Process = NIL_RTR0PROCESS;
857	pMemLnx->cPages = 1;
858	pMemLnx->apPages[0] = pDummyPage;
859	*ppMem = &pMemLnx->Core;
860	return VINF_SUCCESS;
861	}
862	vunmap(pv);
863	}
864	}
865	__free_page(pDummyPage);
866	return VERR_NO_MEMORY;
867
868	#else /* < 2.4.22 */
869	/*
870	* Could probably use ioremap here, but the caller is in a better position than us
871	* to select some safe physical memory.
872	*/
873	return VERR_NOT_SUPPORTED;
874	#endif
875	}
876
877
878	/**
879	* Worker for rtR0MemObjNativeReserveUser and rtR0MemObjNativerMapUser that creates
880	* an empty user space mapping.
881	*
882	* The caller takes care of acquiring the mmap_sem of the task.
883	*
884	* @returns Pointer to the mapping.
885	* (void *)-1 on failure.
886	* @param R3PtrFixed (RTR3PTR)-1 if anywhere, otherwise a specific location.
887	* @param cb The size of the mapping.
888	* @param uAlignment The alignment of the mapping.
889	* @param pTask The Linux task to create this mapping in.
890	* @param fProt The RTMEM_PROT_* mask.
891	*/
892	static void rtR0MemObjLinuxDoMmap(RTR3PTR R3PtrFixed, size_t cb, size_t uAlignment, struct task_struct pTask, unsigned fProt)
893	{
894	unsigned fLnxProt;
895	unsigned long ulAddr;
896
897	/*
898	* Convert from IPRT protection to mman.h PROT_ and call do_mmap.
899	*/
900	fProt &= (RTMEM_PROT_NONE \| RTMEM_PROT_READ \| RTMEM_PROT_WRITE \| RTMEM_PROT_EXEC);
901	if (fProt == RTMEM_PROT_NONE)
902	fLnxProt = PROT_NONE;
903	else
904	{
905	fLnxProt = 0;
906	if (fProt & RTMEM_PROT_READ)
907	fLnxProt \|= PROT_READ;
908	if (fProt & RTMEM_PROT_WRITE)
909	fLnxProt \|= PROT_WRITE;
910	if (fProt & RTMEM_PROT_EXEC)
911	fLnxProt \|= PROT_EXEC;
912	}
913
914	if (R3PtrFixed != (RTR3PTR)-1)
915	ulAddr = do_mmap(NULL, R3PtrFixed, cb, fLnxProt, MAP_SHARED \| MAP_ANONYMOUS \| MAP_FIXED, 0);
916	else
917	{
918	ulAddr = do_mmap(NULL, 0, cb, fLnxProt, MAP_SHARED \| MAP_ANONYMOUS, 0);
919	if ( !(ulAddr & ~PAGE_MASK)
920	&& (ulAddr & (uAlignment - 1)))
921	{
922	/** @todo implement uAlignment properly... We'll probably need to make some dummy mappings to fill
923	* up alignment gaps. This is of course complicated by fragmentation (which we might have cause
924	* ourselves) and further by there begin two mmap strategies (top / bottom). */
925	/* For now, just ignore uAlignment requirements... */
926	}
927	}
928	if (ulAddr & ~PAGE_MASK) /* ~PAGE_MASK == PAGE_OFFSET_MASK */
929	return (void *)-1;
930	return (void *)ulAddr;
931	}
932
933
934	int rtR0MemObjNativeReserveUser(PPRTR0MEMOBJINTERNAL ppMem, RTR3PTR R3PtrFixed, size_t cb, size_t uAlignment, RTR0PROCESS R0Process)
935	{
936	PRTR0MEMOBJLNX pMemLnx;
937	void *pv;
938	struct task_struct *pTask = rtR0ProcessToLinuxTask(R0Process);
939	if (!pTask)
940	return VERR_NOT_SUPPORTED;
941
942	/*
943	* Let rtR0MemObjLinuxDoMmap do the difficult bits.
944	*/
945	down_write(&pTask->mm->mmap_sem);
946	pv = rtR0MemObjLinuxDoMmap(R3PtrFixed, cb, uAlignment, pTask, RTMEM_PROT_NONE);
947	up_write(&pTask->mm->mmap_sem);
948	if (pv == (void *)-1)
949	return VERR_NO_MEMORY;
950
951	pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(sizeof(*pMemLnx), RTR0MEMOBJTYPE_RES_VIRT, pv, cb);
952	if (!pMemLnx)
953	{
954	down_write(&pTask->mm->mmap_sem);
955	MY_DO_MUNMAP(pTask->mm, (unsigned long)pv, cb);
956	up_write(&pTask->mm->mmap_sem);
957	return VERR_NO_MEMORY;
958	}
959
960	pMemLnx->Core.u.ResVirt.R0Process = R0Process;
961	*ppMem = &pMemLnx->Core;
962	return VINF_SUCCESS;
963	}
964
965
966	int rtR0MemObjNativeMapKernel(PPRTR0MEMOBJINTERNAL ppMem, RTR0MEMOBJ pMemToMap, void *pvFixed, size_t uAlignment,
967	unsigned fProt, size_t offSub, size_t cbSub)
968	{
969	int rc = VERR_NO_MEMORY;
970	PRTR0MEMOBJLNX pMemLnxToMap = (PRTR0MEMOBJLNX)pMemToMap;
971	PRTR0MEMOBJLNX pMemLnx;
972
973	/* Fail if requested to do something we can't. */
974	AssertMsgReturn(!offSub && !cbSub, ("%#x %#x\n", offSub, cbSub), VERR_NOT_SUPPORTED);
975	AssertMsgReturn(pvFixed == (void *)-1, ("%p\n", pvFixed), VERR_NOT_SUPPORTED);
976	AssertMsgReturn(uAlignment <= PAGE_SIZE, ("%#x\n", uAlignment), VERR_NOT_SUPPORTED);
977
978	/*
979	* Create the IPRT memory object.
980	*/
981	pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(sizeof(*pMemLnx), RTR0MEMOBJTYPE_MAPPING, NULL, pMemLnxToMap->Core.cb);
982	if (pMemLnx)
983	{
984	if (pMemLnxToMap->cPages)
985	{
986	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 4, 22)
987	/*
988	* Use vmap - 2.4.22 and later.
989	*/
990	pgprot_t fPg = rtR0MemObjLinuxConvertProt(fProt, true /* kernel */);
991	# ifdef VM_MAP
992	pMemLnx->Core.pv = vmap(&pMemLnxToMap->apPages[0], pMemLnxToMap->cPages, VM_MAP, fPg);
993	# else
994	pMemLnx->Core.pv = vmap(&pMemLnxToMap->apPages[0], pMemLnxToMap->cPages, VM_ALLOC, fPg);
995	# endif
996	if (pMemLnx->Core.pv)
997	{
998	pMemLnx->fMappedToRing0 = true;
999	rc = VINF_SUCCESS;
1000	}
1001	else
1002	rc = VERR_MAP_FAILED;
1003
1004	#else /* < 2.4.22 */
1005	/*
1006	* Only option here is to share mappings if possible and forget about fProt.
1007	*/
1008	if (rtR0MemObjIsRing3(pMemToMap))
1009	rc = VERR_NOT_SUPPORTED;
1010	else
1011	{
1012	rc = VINF_SUCCESS;
1013	if (!pMemLnxToMap->Core.pv)
1014	rc = rtR0MemObjLinuxVMap(pMemLnxToMap, !!(fProt & RTMEM_PROT_EXEC));
1015	if (RT_SUCCESS(rc))
1016	{
1017	Assert(pMemLnxToMap->Core.pv);
1018	pMemLnx->Core.pv = pMemLnxToMap->Core.pv;
1019	}
1020	}
1021	#endif
1022	}
1023	else
1024	{
1025	/*
1026	* MMIO / physical memory.
1027	*/
1028	Assert(pMemLnxToMap->Core.enmType == RTR0MEMOBJTYPE_PHYS && !pMemLnxToMap->Core.u.Phys.fAllocated);
1029	pMemLnx->Core.pv = ioremap(pMemLnxToMap->Core.u.Phys.PhysBase, pMemLnxToMap->Core.cb);
1030	if (pMemLnx->Core.pv)
1031	{
1032	/** @todo fix protection. */
1033	rc = VINF_SUCCESS;
1034	}
1035	}
1036	if (RT_SUCCESS(rc))
1037	{
1038	pMemLnx->Core.u.Mapping.R0Process = NIL_RTR0PROCESS;
1039	*ppMem = &pMemLnx->Core;
1040	return VINF_SUCCESS;
1041	}
1042	rtR0MemObjDelete(&pMemLnx->Core);
1043	}
1044
1045	return rc;
1046	}
1047
1048
1049	int rtR0MemObjNativeMapUser(PPRTR0MEMOBJINTERNAL ppMem, RTR0MEMOBJ pMemToMap, RTR3PTR R3PtrFixed, size_t uAlignment, unsigned fProt, RTR0PROCESS R0Process)
1050	{
1051	struct task_struct *pTask = rtR0ProcessToLinuxTask(R0Process);
1052	PRTR0MEMOBJLNX pMemLnxToMap = (PRTR0MEMOBJLNX)pMemToMap;
1053	int rc = VERR_NO_MEMORY;
1054	PRTR0MEMOBJLNX pMemLnx;
1055
1056	/*
1057	* Check for restrictions.
1058	*/
1059	if (!pTask)
1060	return VERR_NOT_SUPPORTED;
1061
1062	/*
1063	* Create the IPRT memory object.
1064	*/
1065	pMemLnx = (PRTR0MEMOBJLNX)rtR0MemObjNew(sizeof(*pMemLnx), RTR0MEMOBJTYPE_MAPPING, NULL, pMemLnxToMap->Core.cb);
1066	if (pMemLnx)
1067	{
1068	/*
1069	* Allocate user space mapping.
1070	*/
1071	void *pv;
1072	down_write(&pTask->mm->mmap_sem);
1073	pv = rtR0MemObjLinuxDoMmap(R3PtrFixed, pMemLnxToMap->Core.cb, uAlignment, pTask, fProt);
1074	if (pv != (void *)-1)
1075	{
1076	/*
1077	* Map page by page into the mmap area.
1078	* This is generic, paranoid and not very efficient.
1079	*/
1080	pgprot_t fPg = rtR0MemObjLinuxConvertProt(fProt, false /* user */);
1081	unsigned long ulAddrCur = (unsigned long)pv;
1082	const size_t cPages = pMemLnxToMap->Core.cb >> PAGE_SHIFT;
1083	size_t iPage;
1084	rc = 0;
1085	if (pMemLnxToMap->cPages)
1086	{
1087	for (iPage = 0; iPage < cPages; iPage++, ulAddrCur += PAGE_SIZE)
1088	{
1089	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 0) \|\| defined(HAVE_26_STYLE_REMAP_PAGE_RANGE)
1090	struct vm_area_struct vma = find_vma(pTask->mm, ulAddrCur); / this is probably the same for all the pages... */
1091	AssertBreakStmt(vma, rc = VERR_INTERNAL_ERROR);
1092	#endif
1093
1094	#if defined(VBOX_USE_INSERT_PAGE) && LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 22)
1095	rc = vm_insert_page(vma, ulAddrCur, pMemLnxToMap->apPages[iPage]);
1096	vma->vm_flags \|= VM_RESERVED; /* This flag helps making 100% sure some bad stuff wont happen (swap, core, ++). */
1097	#elif LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 11)
1098	rc = remap_pfn_range(vma, ulAddrCur, page_to_pfn(pMemLnxToMap->apPages[iPage]), PAGE_SIZE, fPg);
1099	#elif LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 0) \|\| defined(HAVE_26_STYLE_REMAP_PAGE_RANGE)
1100	rc = remap_page_range(vma, ulAddrCur, page_to_phys(pMemLnxToMap->apPages[iPage]), PAGE_SIZE, fPg);
1101	#else /* 2.4 */
1102	rc = remap_page_range(ulAddrCur, page_to_phys(pMemLnxToMap->apPages[iPage]), PAGE_SIZE, fPg);
1103	#endif
1104	if (rc)
1105	break;
1106	}
1107	}
1108	else
1109	{
1110	RTHCPHYS Phys;
1111	if (pMemLnxToMap->Core.enmType == RTR0MEMOBJTYPE_PHYS)
1112	Phys = pMemLnxToMap->Core.u.Phys.PhysBase;
1113	else if (pMemLnxToMap->Core.enmType == RTR0MEMOBJTYPE_CONT)
1114	Phys = pMemLnxToMap->Core.u.Cont.Phys;
1115	else
1116	{
1117	AssertMsgFailed(("%d\n", pMemLnxToMap->Core.enmType));
1118	Phys = NIL_RTHCPHYS;
1119	}
1120	if (Phys != NIL_RTHCPHYS)
1121	{
1122	for (iPage = 0; iPage < cPages; iPage++, ulAddrCur += PAGE_SIZE, Phys += PAGE_SIZE)
1123	{
1124	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 0) \|\| defined(HAVE_26_STYLE_REMAP_PAGE_RANGE)
1125	struct vm_area_struct vma = find_vma(pTask->mm, ulAddrCur); / this is probably the same for all the pages... */
1126	AssertBreakStmt(vma, rc = VERR_INTERNAL_ERROR);
1127	#endif
1128
1129	#if LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 11)
1130	rc = remap_pfn_range(vma, ulAddrCur, Phys, PAGE_SIZE, fPg);
1131	#elif LINUX_VERSION_CODE >= KERNEL_VERSION(2, 6, 0) \|\| defined(HAVE_26_STYLE_REMAP_PAGE_RANGE)
1132	rc = remap_page_range(vma, ulAddrCur, Phys, PAGE_SIZE, fPg);
1133	#else /* 2.4 */
1134	rc = remap_page_range(ulAddrCur, Phys, PAGE_SIZE, fPg);
1135	#endif
1136	if (rc)
1137	break;
1138	}
1139	}
1140	}
1141	if (!rc)
1142	{
1143	up_write(&pTask->mm->mmap_sem);
1144
1145	pMemLnx->Core.pv = pv;
1146	pMemLnx->Core.u.Mapping.R0Process = R0Process;
1147	*ppMem = &pMemLnx->Core;
1148	return VINF_SUCCESS;
1149	}
1150
1151	/*
1152	* Bail out.
1153	*/
1154	MY_DO_MUNMAP(pTask->mm, (unsigned long)pv, pMemLnxToMap->Core.cb);
1155	if (rc != VERR_INTERNAL_ERROR)
1156	rc = VERR_NO_MEMORY;
1157	}
1158
1159	up_write(&pTask->mm->mmap_sem);
1160
1161	rtR0MemObjDelete(&pMemLnx->Core);
1162	}
1163
1164	return rc;
1165	}
1166
1167
1168	RTHCPHYS rtR0MemObjNativeGetPagePhysAddr(PRTR0MEMOBJINTERNAL pMem, size_t iPage)
1169	{
1170	PRTR0MEMOBJLNX pMemLnx = (PRTR0MEMOBJLNX)pMem;
1171
1172	if (pMemLnx->cPages)
1173	return page_to_phys(pMemLnx->apPages[iPage]);
1174
1175	switch (pMemLnx->Core.enmType)
1176	{
1177	case RTR0MEMOBJTYPE_CONT:
1178	return pMemLnx->Core.u.Cont.Phys + (iPage << PAGE_SHIFT);
1179
1180	case RTR0MEMOBJTYPE_PHYS:
1181	return pMemLnx->Core.u.Phys.PhysBase + (iPage << PAGE_SHIFT);
1182
1183	/* the parent knows */
1184	case RTR0MEMOBJTYPE_MAPPING:
1185	return rtR0MemObjNativeGetPagePhysAddr(pMemLnx->Core.uRel.Child.pParent, iPage);
1186
1187	/* cPages > 0 */
1188	case RTR0MEMOBJTYPE_LOW:
1189	case RTR0MEMOBJTYPE_LOCK:
1190	case RTR0MEMOBJTYPE_PHYS_NC:
1191	case RTR0MEMOBJTYPE_PAGE:
1192	default:
1193	AssertMsgFailed(("%d\n", pMemLnx->Core.enmType));
1194	/* fall thru */
1195
1196	case RTR0MEMOBJTYPE_RES_VIRT:
1197	return NIL_RTHCPHYS;
1198	}
1199	}
1200

Note: See TracBrowser for help on using the repository browser.

source: vbox/trunk/src/VBox/Runtime/r0drv/linux/memobj-r0drv-linux.c@ 18522

Download in other formats: