|
0
|
1 |
// Copyright (c) 2007-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
|
2 |
// All rights reserved.
|
|
|
3 |
// This component and the accompanying materials are made available
|
|
|
4 |
// under the terms of the License "Eclipse Public License v1.0"
|
|
|
5 |
// which accompanies this distribution, and is available
|
|
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
|
7 |
//
|
|
|
8 |
// Initial Contributors:
|
|
|
9 |
// Nokia Corporation - initial contribution.
|
|
|
10 |
//
|
|
|
11 |
// Contributors:
|
|
|
12 |
//
|
|
|
13 |
// Description:
|
|
|
14 |
//
|
|
|
15 |
|
|
|
16 |
#include "memmodel.h"
|
|
|
17 |
#include "mm.h"
|
|
|
18 |
#include "mmu.h"
|
|
|
19 |
#include "mobject.h"
|
|
|
20 |
#include "mmapping.h"
|
|
|
21 |
#include "mmanager.h"
|
|
|
22 |
#include "mpdalloc.h"
|
|
|
23 |
#include "mptalloc.h"
|
|
|
24 |
#include "mpager.h"
|
|
|
25 |
#include "maddressspace.h"
|
|
|
26 |
|
|
|
27 |
|
|
|
28 |
|
|
|
29 |
|
|
|
30 |
//
|
|
|
31 |
// DMutexPool
|
|
|
32 |
//
|
|
|
33 |
|
|
|
34 |
DMutexPool::~DMutexPool()
|
|
|
35 |
{
|
|
|
36 |
TUint i;
|
|
|
37 |
for(i=0; i<iCount; ++i)
|
|
|
38 |
{
|
|
|
39 |
DMutex* mutex = iMembers[i].iMutex;
|
|
|
40 |
if(mutex)
|
|
|
41 |
mutex->Close(0);
|
|
|
42 |
}
|
|
|
43 |
Kern::Free(iMembers);
|
|
|
44 |
}
|
|
|
45 |
|
|
|
46 |
|
|
|
47 |
TInt DMutexPool::Create(TUint aCount, const TDesC* aName, TUint aOrder)
|
|
|
48 |
{
|
|
|
49 |
if(aCount>EMaxPoolSize)
|
|
|
50 |
return KErrTooBig;
|
|
|
51 |
|
|
|
52 |
iMembers = (SMember*)Kern::AllocZ(aCount*sizeof(SMember));
|
|
|
53 |
if(!iMembers)
|
|
|
54 |
return KErrNoMemory;
|
|
|
55 |
|
|
|
56 |
iCount = aCount;
|
|
|
57 |
|
|
|
58 |
TInt r = KErrNone;
|
|
|
59 |
TUint i;
|
|
|
60 |
for(i=0; i<aCount; ++i)
|
|
|
61 |
{
|
|
|
62 |
TKName name;
|
|
|
63 |
if(aName)
|
|
|
64 |
{
|
|
|
65 |
name = *aName;
|
|
|
66 |
name.AppendNum(i);
|
|
|
67 |
}
|
|
|
68 |
K::MutexCreate(iMembers[i].iMutex, name, NULL, EFalse, aOrder);
|
|
|
69 |
if(r!=KErrNone)
|
|
|
70 |
break;
|
|
|
71 |
}
|
|
|
72 |
|
|
|
73 |
return r;
|
|
|
74 |
}
|
|
|
75 |
|
|
|
76 |
|
|
|
77 |
/**
|
|
|
78 |
@class DMutexPool
|
|
|
79 |
@details
|
|
|
80 |
|
|
|
81 |
The cookie used for dynamically assigned mutexes is broken into three bit fields:
|
|
|
82 |
- Bit 0, always set. (To distinguish the cookie from a proper DMutex*).
|
|
|
83 |
- Bits 1 through #KMutexPoolIndexBits, these contain the index of the assigned
|
|
|
84 |
mutex within DMutexPool::iMembers.
|
|
|
85 |
- Bits (#KMutexPoolIndexBits+1) through 31, the count of the number of threads waiting
|
|
|
86 |
for this particular mutex assignment. When this reaches zero, the mutex can
|
|
|
87 |
be unassigned.
|
|
|
88 |
*/
|
|
|
89 |
|
|
|
90 |
/**
|
|
|
91 |
Number of bits used to contain the index value of a dynamically assigned pool mutex.
|
|
|
92 |
*/
|
|
|
93 |
const TUint KMutexPoolIndexBits = 7;
|
|
|
94 |
|
|
|
95 |
const TUint KMutexPoolIndexMask = ((1<<KMutexPoolIndexBits)-1)<<1;
|
|
|
96 |
const TUint KMutexPoolWaitCountIncrement = 1<<(KMutexPoolIndexBits+1);
|
|
|
97 |
|
|
|
98 |
__ASSERT_COMPILE(DMutexPool::EMaxPoolSize<=TUint(KMutexPoolIndexMask/2+1)); // required for algorithm correctness
|
|
|
99 |
|
|
|
100 |
__ASSERT_COMPILE(DMutexPool::EMaxPoolSize<=64); // required to avoid excessive system lock hold time
|
|
|
101 |
|
|
|
102 |
|
|
|
103 |
void DMutexPool::Wait(DMutex*& aMutexRef)
|
|
|
104 |
{
|
|
|
105 |
NKern::LockSystem();
|
|
|
106 |
|
|
|
107 |
TUintPtr poolMutex = (TUintPtr)aMutexRef;
|
|
|
108 |
if(!poolMutex)
|
|
|
109 |
{
|
|
|
110 |
// try and find a free mutex, else use the next one...
|
|
|
111 |
TUint next = iNext;
|
|
|
112 |
do
|
|
|
113 |
{
|
|
|
114 |
if(iMembers[next].iUseCount==0)
|
|
|
115 |
break;
|
|
|
116 |
if(++next>=iCount)
|
|
|
117 |
next = 0;
|
|
|
118 |
}
|
|
|
119 |
while(next!=iNext);
|
|
|
120 |
// use found mutex...
|
|
|
121 |
++iMembers[next].iUseCount;
|
|
|
122 |
poolMutex = (next*2)+1; // mutex index*2 | 1
|
|
|
123 |
// update next...
|
|
|
124 |
if(++next>=iCount)
|
|
|
125 |
next = 0;
|
|
|
126 |
iNext = next;
|
|
|
127 |
}
|
|
|
128 |
|
|
|
129 |
DMutex* mutex = (DMutex*)poolMutex;
|
|
|
130 |
if(poolMutex&1)
|
|
|
131 |
{
|
|
|
132 |
// mutex is a pool mutex, get pointer, and update wait count...
|
|
|
133 |
SMember* member = &iMembers[(poolMutex&KMutexPoolIndexMask)>>1];
|
|
|
134 |
mutex = member->iMutex;
|
|
|
135 |
poolMutex += KMutexPoolWaitCountIncrement;
|
|
|
136 |
__NK_ASSERT_ALWAYS(poolMutex>=KMutexPoolWaitCountIncrement);
|
|
|
137 |
aMutexRef = (DMutex*)poolMutex;
|
|
|
138 |
}
|
|
|
139 |
|
|
|
140 |
mutex->Wait();
|
|
|
141 |
|
|
|
142 |
NKern::UnlockSystem();
|
|
|
143 |
}
|
|
|
144 |
|
|
|
145 |
|
|
|
146 |
void DMutexPool::Signal(DMutex*& aMutexRef)
|
|
|
147 |
{
|
|
|
148 |
NKern::LockSystem();
|
|
|
149 |
|
|
|
150 |
TUintPtr poolMutex = (TUintPtr)aMutexRef;
|
|
|
151 |
__NK_ASSERT_ALWAYS(poolMutex);
|
|
|
152 |
|
|
|
153 |
DMutex* mutex = (DMutex*)poolMutex;
|
|
|
154 |
|
|
|
155 |
if(poolMutex&1)
|
|
|
156 |
{
|
|
|
157 |
// mutex is a pool mutex, get pointer, and update wait count...
|
|
|
158 |
SMember* member = &iMembers[(poolMutex&KMutexPoolIndexMask)>>1];
|
|
|
159 |
mutex = member->iMutex;
|
|
|
160 |
__NK_ASSERT_ALWAYS(poolMutex>=KMutexPoolWaitCountIncrement);
|
|
|
161 |
poolMutex -= KMutexPoolWaitCountIncrement;
|
|
|
162 |
if(poolMutex<KMutexPoolWaitCountIncrement)
|
|
|
163 |
{
|
|
|
164 |
--member->iUseCount;
|
|
|
165 |
poolMutex = 0;
|
|
|
166 |
}
|
|
|
167 |
aMutexRef = (DMutex*)poolMutex;
|
|
|
168 |
}
|
|
|
169 |
|
|
|
170 |
mutex->Signal();
|
|
|
171 |
}
|
|
|
172 |
|
|
|
173 |
|
|
|
174 |
TBool DMutexPool::IsHeld(DMutex*& aMutexRef)
|
|
|
175 |
{
|
|
|
176 |
TBool held = false;
|
|
|
177 |
NKern::LockSystem();
|
|
|
178 |
TUintPtr poolMutex = (TUintPtr)aMutexRef;
|
|
|
179 |
if(poolMutex)
|
|
|
180 |
{
|
|
|
181 |
DMutex* mutex = (DMutex*)poolMutex;
|
|
|
182 |
if(poolMutex&1)
|
|
|
183 |
{
|
|
|
184 |
SMember* member = &iMembers[(poolMutex&KMutexPoolIndexMask)>>1];
|
|
|
185 |
mutex = member->iMutex;
|
|
|
186 |
}
|
|
|
187 |
held = mutex->iCleanup.iThread==&Kern::CurrentThread();
|
|
|
188 |
}
|
|
|
189 |
NKern::UnlockSystem();
|
|
|
190 |
return held;
|
|
|
191 |
}
|
|
|
192 |
|
|
|
193 |
|
|
|
194 |
|
|
|
195 |
//
|
|
|
196 |
// DReferenceCountedObject
|
|
|
197 |
//
|
|
|
198 |
|
|
|
199 |
DReferenceCountedObject::~DReferenceCountedObject()
|
|
|
200 |
{
|
|
|
201 |
__NK_ASSERT_DEBUG(iReferenceCount==0);
|
|
|
202 |
}
|
|
|
203 |
|
|
|
204 |
|
|
|
205 |
void DReferenceCountedObject::Open()
|
|
|
206 |
{
|
|
|
207 |
__ASSERT_CRITICAL
|
|
|
208 |
TBool ok = __e32_atomic_tas_ord32(&iReferenceCount, 1, 1, 0);
|
|
|
209 |
__NK_ASSERT_ALWAYS(ok);
|
|
|
210 |
}
|
|
|
211 |
|
|
|
212 |
|
|
|
213 |
TBool DReferenceCountedObject::TryOpen()
|
|
|
214 |
{
|
|
|
215 |
__ASSERT_CRITICAL
|
|
|
216 |
TBool ok = __e32_atomic_tas_ord32(&iReferenceCount, 1, 1, 0);
|
|
|
217 |
return ok;
|
|
|
218 |
}
|
|
|
219 |
|
|
|
220 |
|
|
|
221 |
TBool DReferenceCountedObject::CheckCloseIsSafe()
|
|
|
222 |
{
|
|
|
223 |
__ASSERT_CRITICAL
|
|
|
224 |
#ifdef _DEBUG
|
|
|
225 |
NFastMutex* fm = NKern::HeldFastMutex();
|
|
|
226 |
if(fm)
|
|
|
227 |
{
|
|
|
228 |
Kern::Printf("DReferenceCountedObject[0x%08x]::Close() fast mutex violation %M",this,fm);
|
|
|
229 |
return false;
|
|
|
230 |
}
|
|
|
231 |
SDblQue& ml = TheCurrentThread->iMutexList;
|
|
|
232 |
if(!ml.IsEmpty())
|
|
|
233 |
{
|
|
|
234 |
DMutex* m = _LOFF(ml.First(), DMutex, iOrderLink);
|
|
|
235 |
if(m->iOrder<KMutexOrdKernelHeap)
|
|
|
236 |
{
|
|
|
237 |
Kern::Printf("DReferenceCountedObject[0x%08x]::Close() mutex order violation holding mutex %O",this,m);
|
|
|
238 |
return false;
|
|
|
239 |
}
|
|
|
240 |
}
|
|
|
241 |
#endif
|
|
|
242 |
return true;
|
|
|
243 |
}
|
|
|
244 |
|
|
|
245 |
|
|
|
246 |
void DReferenceCountedObject::Close()
|
|
|
247 |
{
|
|
|
248 |
__ASSERT_CRITICAL
|
|
|
249 |
__NK_ASSERT_DEBUG(CheckCloseIsSafe());
|
|
|
250 |
__NK_ASSERT_DEBUG(iReferenceCount>0);
|
|
|
251 |
if (__e32_atomic_tas_ord32(&iReferenceCount, 1, -1, 0) == 1)
|
|
|
252 |
delete this;
|
|
|
253 |
}
|
|
|
254 |
|
|
|
255 |
|
|
|
256 |
void DReferenceCountedObject::AsyncClose()
|
|
|
257 |
{
|
|
|
258 |
__ASSERT_CRITICAL
|
|
|
259 |
__NK_ASSERT_DEBUG(iReferenceCount>0);
|
|
|
260 |
if (__e32_atomic_tas_ord32(&iReferenceCount, 1, -1, 0) == 1)
|
|
|
261 |
AsyncDelete();
|
|
|
262 |
}
|
|
|
263 |
|
|
|
264 |
|
|
|
265 |
//
|
|
|
266 |
// Memory object functions
|
|
|
267 |
//
|
|
|
268 |
|
|
|
269 |
TInt MM::MemoryNew(DMemoryObject*& aMemory, TMemoryObjectType aType, TUint aPageCount, TMemoryCreateFlags aCreateFlags, TMemoryAttributes aAttributes)
|
|
|
270 |
{
|
|
|
271 |
TRACE(("MM::MemoryNew(?,0x%08x,0x%08x,0x%08x,0x%08x)",aType,aPageCount,aCreateFlags,*(TUint32*)&aAttributes));
|
|
|
272 |
|
|
|
273 |
DMemoryManager* manager;
|
|
|
274 |
if(aCreateFlags&EMemoryCreateCustomManager)
|
|
|
275 |
manager = (DMemoryManager*)aType;
|
|
|
276 |
else
|
|
|
277 |
{
|
|
|
278 |
switch(aType)
|
|
|
279 |
{
|
|
|
280 |
case EMemoryObjectUnpaged:
|
|
|
281 |
manager = TheUnpagedMemoryManager;
|
|
|
282 |
break;
|
|
|
283 |
case EMemoryObjectMovable:
|
|
|
284 |
manager = TheMovableMemoryManager;
|
|
|
285 |
break;
|
|
|
286 |
case EMemoryObjectPaged:
|
|
|
287 |
manager = TheDataPagedMemoryManager;
|
|
|
288 |
break;
|
|
|
289 |
case EMemoryObjectDiscardable:
|
|
|
290 |
manager = TheDiscardableMemoryManager;
|
|
|
291 |
break;
|
|
|
292 |
case EMemoryObjectHardware:
|
|
|
293 |
manager = TheHardwareMemoryManager;
|
|
|
294 |
break;
|
|
|
295 |
default:
|
|
|
296 |
manager = 0;
|
|
|
297 |
__NK_ASSERT_DEBUG(0);
|
|
|
298 |
break;
|
|
|
299 |
}
|
|
|
300 |
}
|
|
|
301 |
TMemoryCreateFlags flags = (TMemoryCreateFlags)(aCreateFlags&~(EMemoryCreateDemandPaged));
|
|
|
302 |
TInt r = manager->New(aMemory,aPageCount,aAttributes,flags);
|
|
|
303 |
TRACE(("MM::MemoryNew returns %d, aMemory=0x%08x",r,aMemory));
|
|
|
304 |
#ifdef BTRACE_FLEXIBLE_MEM_MODEL
|
|
|
305 |
if (r == KErrNone)
|
|
|
306 |
aMemory->BTraceCreate();
|
|
|
307 |
#endif
|
|
|
308 |
return r;
|
|
|
309 |
}
|
|
|
310 |
|
|
|
311 |
|
|
|
312 |
TInt MM::MemoryClaimInitialPages(DMemoryObject* aMemory, TLinAddr aBase, TUint aSize, TMappingPermissions aPermissions, TBool aAllowGaps, TBool aAllowNonRamPages)
|
|
|
313 |
{
|
|
|
314 |
TRACE(("MM::MemoryClaimInitialPages(0x%08x,0x%08x,0x%08x,0x%08x,%d,%d)",aMemory,aBase,aPermissions,aSize,aAllowGaps!=0,aAllowNonRamPages!=0));
|
|
|
315 |
TInt r = aMemory->ClaimInitialPages(aBase,aSize,aPermissions,aAllowGaps,aAllowNonRamPages);
|
|
|
316 |
TRACE(("MM::MemoryClaimInitialPages returns %d",r));
|
|
|
317 |
__NK_ASSERT_DEBUG(r==KErrNone);
|
|
|
318 |
return r;
|
|
|
319 |
}
|
|
|
320 |
|
|
|
321 |
|
|
|
322 |
void MM::MemorySetLock(DMemoryObject* aMemory, DMutex* aLock)
|
|
|
323 |
{
|
|
|
324 |
aMemory->SetLock(aLock);
|
|
|
325 |
}
|
|
|
326 |
|
|
|
327 |
|
|
|
328 |
void MM::MemoryLock(DMemoryObject* aMemory)
|
|
|
329 |
{
|
|
|
330 |
MemoryObjectLock::Lock(aMemory);
|
|
|
331 |
}
|
|
|
332 |
|
|
|
333 |
|
|
|
334 |
void MM::MemoryUnlock(DMemoryObject* aMemory)
|
|
|
335 |
{
|
|
|
336 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
337 |
}
|
|
|
338 |
|
|
|
339 |
|
|
|
340 |
void MM::MemoryDestroy(DMemoryObject*& aMemory)
|
|
|
341 |
{
|
|
|
342 |
DMemoryObject* memory = (DMemoryObject*)__e32_atomic_swp_ord_ptr(&aMemory, 0);
|
|
|
343 |
if (!memory)
|
|
|
344 |
return;
|
|
|
345 |
TRACE(("MM::MemoryDestroy(0x%08x)",memory));
|
|
|
346 |
#ifdef BTRACE_FLEXIBLE_MEM_MODEL
|
|
|
347 |
BTraceContext4(BTrace::EFlexibleMemModel,BTrace::EMemoryObjectDestroy,memory);
|
|
|
348 |
#endif
|
|
|
349 |
memory->iManager->Destruct(memory);
|
|
|
350 |
}
|
|
|
351 |
|
|
|
352 |
|
|
|
353 |
TInt MM::MemoryAlloc(DMemoryObject* aMemory, TUint aIndex, TUint aCount)
|
|
|
354 |
{
|
|
|
355 |
TRACE(("MM::MemoryAlloc(0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount));
|
|
|
356 |
MemoryObjectLock::Lock(aMemory);
|
|
|
357 |
TInt r;
|
|
|
358 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
359 |
r = KErrArgument;
|
|
|
360 |
else
|
|
|
361 |
r = aMemory->iManager->Alloc(aMemory,aIndex,aCount);
|
|
|
362 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
363 |
TRACE(("MM::MemoryAlloc returns %d",r));
|
|
|
364 |
return r;
|
|
|
365 |
}
|
|
|
366 |
|
|
|
367 |
|
|
|
368 |
TInt MM::MemoryAllocContiguous(DMemoryObject* aMemory, TUint aIndex, TUint aCount, TUint aAlign, TPhysAddr& aPhysAddr)
|
|
|
369 |
{
|
|
|
370 |
TRACE(("MM::MemoryAllocContiguous(0x%08x,0x%08x,0x%08x,%d,?)",aMemory,aIndex,aCount,aAlign));
|
|
|
371 |
MemoryObjectLock::Lock(aMemory);
|
|
|
372 |
TInt r;
|
|
|
373 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
374 |
r = KErrArgument;
|
|
|
375 |
else
|
|
|
376 |
r = aMemory->iManager->AllocContiguous(aMemory,aIndex,aCount,MM::RoundToPageShift(aAlign),aPhysAddr);
|
|
|
377 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
378 |
TRACE(("MM::MemoryAlloc returns %d (aPhysAddr=0x%08x)",r,aPhysAddr));
|
|
|
379 |
return r;
|
|
|
380 |
}
|
|
|
381 |
|
|
|
382 |
|
|
|
383 |
void MM::MemoryFree(DMemoryObject* aMemory, TUint aIndex, TUint aCount)
|
|
|
384 |
{
|
|
|
385 |
TRACE(("MM::MemoryFree(0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount));
|
|
|
386 |
MemoryObjectLock::Lock(aMemory);
|
|
|
387 |
aMemory->ClipRegion(aIndex,aCount);
|
|
|
388 |
aMemory->iManager->Free(aMemory,aIndex,aCount);
|
|
|
389 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
390 |
}
|
|
|
391 |
|
|
|
392 |
|
|
|
393 |
TInt MM::MemoryAddPages(DMemoryObject* aMemory, TUint aIndex, TUint aCount, TPhysAddr* aPages)
|
|
|
394 |
{
|
|
|
395 |
TRACE(("MM::MemoryAddPages(0x%08x,0x%08x,0x%08x,?)",aMemory,aIndex,aCount));
|
|
|
396 |
MemoryObjectLock::Lock(aMemory);
|
|
|
397 |
TInt r;
|
|
|
398 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
399 |
r = KErrArgument;
|
|
|
400 |
else
|
|
|
401 |
r = aMemory->iManager->AddPages(aMemory,aIndex,aCount,aPages);
|
|
|
402 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
403 |
TRACE(("MM::MemoryAddPages returns %d",r));
|
|
|
404 |
return r;
|
|
|
405 |
}
|
|
|
406 |
|
|
|
407 |
|
|
|
408 |
TInt MM::MemoryAddContiguous(DMemoryObject* aMemory, TUint aIndex, TUint aCount, TPhysAddr aPhysAddr)
|
|
|
409 |
{
|
|
|
410 |
TRACE(("MM::MemoryAddContiguous(0x%08x,0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount,aPhysAddr));
|
|
|
411 |
MemoryObjectLock::Lock(aMemory);
|
|
|
412 |
TInt r;
|
|
|
413 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
414 |
r = KErrArgument;
|
|
|
415 |
else
|
|
|
416 |
r = aMemory->iManager->AddContiguous(aMemory,aIndex,aCount,aPhysAddr);
|
|
|
417 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
418 |
TRACE(("MM::MemoryAddContiguous returns %d",r));
|
|
|
419 |
return r;
|
|
|
420 |
}
|
|
|
421 |
|
|
|
422 |
|
|
|
423 |
TUint MM::MemoryRemovePages(DMemoryObject* aMemory, TUint aIndex, TUint aCount, TPhysAddr* aPages)
|
|
|
424 |
{
|
|
|
425 |
TRACE(("MM::MemoryRemovePages(0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount));
|
|
|
426 |
MemoryObjectLock::Lock(aMemory);
|
|
|
427 |
aMemory->ClipRegion(aIndex,aCount);
|
|
|
428 |
TInt r = aMemory->iManager->RemovePages(aMemory,aIndex,aCount,aPages);
|
|
|
429 |
if(r<0)
|
|
|
430 |
r = 0;
|
|
|
431 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
432 |
TRACE(("MM::MemoryRemovePages returns %d",r));
|
|
|
433 |
return r;
|
|
|
434 |
}
|
|
|
435 |
|
|
|
436 |
|
|
|
437 |
TInt MM::MemoryAllowDiscard(DMemoryObject* aMemory, TUint aIndex, TUint aCount)
|
|
|
438 |
{
|
|
|
439 |
TRACE(("MM::MemoryAllowDiscard(0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount));
|
|
|
440 |
MemoryObjectLock::Lock(aMemory);
|
|
|
441 |
TInt r;
|
|
|
442 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
443 |
r = KErrArgument;
|
|
|
444 |
else
|
|
|
445 |
r = aMemory->iManager->AllowDiscard(aMemory,aIndex,aCount);
|
|
|
446 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
447 |
TRACE(("MM::MemoryAllowDiscard returns %d",r));
|
|
|
448 |
return r;
|
|
|
449 |
}
|
|
|
450 |
|
|
|
451 |
|
|
|
452 |
TInt MM::MemoryDisallowDiscard(DMemoryObject* aMemory, TUint aIndex, TUint aCount)
|
|
|
453 |
{
|
|
|
454 |
TRACE(("MM::MemoryDisallowDiscard(0x%08x,0x%08x,0x%08x)",aMemory,aIndex,aCount));
|
|
|
455 |
MemoryObjectLock::Lock(aMemory);
|
|
|
456 |
TInt r;
|
|
|
457 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
458 |
r = KErrArgument;
|
|
|
459 |
else
|
|
|
460 |
r = aMemory->iManager->DisallowDiscard(aMemory,aIndex,aCount);
|
|
|
461 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
462 |
TRACE(("MM::MemoryDisallowDiscard returns %d",r));
|
|
|
463 |
return r;
|
|
|
464 |
}
|
|
|
465 |
|
|
|
466 |
|
|
|
467 |
TInt MM::MemoryPhysAddr(DMemoryObject* aMemory, TUint aIndex, TUint aCount, TPhysAddr& aPhysicalAddress, TPhysAddr* aPhysicalPageList)
|
|
|
468 |
{
|
|
|
469 |
TRACE(("MM::MemoryPhysAddr(0x%08x,0x%08x,0x%08x,?,?)",aMemory,aIndex,aCount));
|
|
|
470 |
TInt r = aMemory->PhysAddr(aIndex,aCount,aPhysicalAddress,aPhysicalPageList);
|
|
|
471 |
TRACE(("MM::MemoryPhysAddr returns %d aPhysicalAddress=0x%08x",r,aPhysicalAddress));
|
|
|
472 |
return r;
|
|
|
473 |
}
|
|
|
474 |
|
|
|
475 |
|
|
|
476 |
void MM::MemoryBTracePrime(DMemoryObject* aMemory)
|
|
|
477 |
{
|
|
|
478 |
aMemory->BTraceCreate();
|
|
|
479 |
aMemory->iMappings.Lock();
|
|
|
480 |
TMappingListIter iter;
|
|
|
481 |
DMemoryMapping* mapping = (DMemoryMapping*)iter.Start(aMemory->iMappings);
|
|
|
482 |
while(mapping)
|
|
|
483 |
{
|
|
|
484 |
aMemory->iMappings.Unlock();
|
|
|
485 |
mapping->BTraceCreate();
|
|
|
486 |
aMemory->iMappings.Lock();
|
|
|
487 |
mapping = (DMemoryMapping*)iter.Next();
|
|
|
488 |
}
|
|
|
489 |
iter.Finish();
|
|
|
490 |
aMemory->iMappings.Unlock();
|
|
|
491 |
}
|
|
|
492 |
|
|
|
493 |
|
|
|
494 |
void MM::MemoryClose(DMemoryObject* aMemory)
|
|
|
495 |
{
|
|
|
496 |
aMemory->Close();
|
|
|
497 |
}
|
|
|
498 |
|
|
|
499 |
|
|
|
500 |
TBool MM::MemoryIsNotMapped(DMemoryObject* aMemory)
|
|
|
501 |
{
|
|
|
502 |
TBool r = aMemory->iMappings.IsEmpty();
|
|
|
503 |
TRACE2(("MM::MemoryIsNotMapped(0x%08x) returns %d",aMemory,r));
|
|
|
504 |
return r;
|
|
|
505 |
}
|
|
|
506 |
|
|
|
507 |
//
|
|
|
508 |
// Physical pinning
|
|
|
509 |
//
|
|
|
510 |
|
|
|
511 |
TInt MM::PinPhysicalMemory(DMemoryObject* aMemory, DPhysicalPinMapping* aPinObject, TUint aIndex, TUint aCount, TBool aReadOnly, TPhysAddr& aAddress, TPhysAddr* aPages, TUint32& aMapAttr, TUint& aColour)
|
|
|
512 |
{
|
|
|
513 |
|
|
|
514 |
if (!aMemory->CheckRegion(aIndex,aCount))
|
|
|
515 |
return KErrArgument;
|
|
|
516 |
|
|
|
517 |
TMappingPermissions permissions = aReadOnly ? ESupervisorReadOnly : ESupervisorReadWrite;
|
|
|
518 |
TInt r = aPinObject->Pin(aMemory, aIndex, aCount, permissions);
|
|
|
519 |
if (r == KErrNone)
|
|
|
520 |
{
|
|
|
521 |
r = aPinObject->PhysAddr(aIndex, aCount, aAddress, aPages);
|
|
|
522 |
if (r>=KErrNone)
|
|
|
523 |
{
|
|
|
524 |
r = KErrNone; //Do not report discontigious memory in return value.
|
|
|
525 |
const TMappingAttributes2& mapAttr2 =
|
|
|
526 |
MM::LegacyMappingAttributes(aMemory->Attributes(), permissions);
|
|
|
527 |
*(TMappingAttributes2*)&aMapAttr = mapAttr2;
|
|
|
528 |
}
|
|
|
529 |
else
|
|
|
530 |
{
|
|
|
531 |
aPinObject->Unpin();
|
|
|
532 |
}
|
|
|
533 |
}
|
|
|
534 |
|
|
|
535 |
aColour = 0;
|
|
|
536 |
return r;
|
|
|
537 |
}
|
|
|
538 |
|
|
|
539 |
|
|
|
540 |
TInt MM::MemoryWipe(DMemoryObject* aMemory)
|
|
|
541 |
{
|
|
|
542 |
__NK_ASSERT_ALWAYS(aMemory->iMappings.IsEmpty()); // can't be mapped otherwise confidentiality can't be guaranteed
|
|
|
543 |
TRACE2(("MM::MemoryWipe(0x%08x)",aMemory));
|
|
|
544 |
MemoryObjectLock::Lock(aMemory);
|
|
|
545 |
TInt r = aMemory->iManager->Wipe(aMemory);
|
|
|
546 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
547 |
return r;
|
|
|
548 |
}
|
|
|
549 |
|
|
|
550 |
|
|
|
551 |
TInt MM::MemorySetReadOnly(DMemoryObject* aMemory)
|
|
|
552 |
{
|
|
|
553 |
TRACE2(("MM::MemorySetReadOnly(0x%08x)",aMemory));
|
|
|
554 |
MemoryObjectLock::Lock(aMemory);
|
|
|
555 |
TInt r = aMemory->SetReadOnly();
|
|
|
556 |
MemoryObjectLock::Unlock(aMemory);
|
|
|
557 |
return r;
|
|
|
558 |
}
|
|
|
559 |
|
|
|
560 |
//
|
|
|
561 |
// Mapping functions
|
|
|
562 |
//
|
|
|
563 |
|
|
|
564 |
TInt MM::MappingNew(DMemoryMapping*& aMapping, DMemoryObject* aMemory, TMappingPermissions aPermissions, TInt aOsAsid, TMappingCreateFlags aFlags, TLinAddr aAddr, TUint aIndex, TUint aCount)
|
|
|
565 |
{
|
|
|
566 |
TRACE(("MM::MappingNew(?,0x%08x,0x%08x,%d,0x%08x,0x%08x,0x%08x,0x%08x)",aMemory, aPermissions, aOsAsid, aFlags, aAddr, aIndex, aCount));
|
|
|
567 |
|
|
|
568 |
/**
|
|
|
569 |
@todo Make mappings created with this function fail (panic?) if the are reused to map
|
|
|
570 |
another object.
|
|
|
571 |
*/
|
|
|
572 |
if(aCount==~0u)
|
|
|
573 |
aCount = aMemory->iSizeInPages-aIndex;
|
|
|
574 |
|
|
|
575 |
// if memory object reserves all resources, make mappings also do so...
|
|
|
576 |
if(aMemory->iFlags&DMemoryObject::EReserveResources)
|
|
|
577 |
FlagSet(aFlags,EMappingCreateReserveAllResources);
|
|
|
578 |
|
|
|
579 |
// check if mapping is for global user data...
|
|
|
580 |
if(aOsAsid==(TInt)KKernelOsAsid && aPermissions&EUser)
|
|
|
581 |
FlagSet(aFlags,EMappingCreateUserGlobalVirtual);
|
|
|
582 |
else
|
|
|
583 |
FlagClear(aFlags,EMappingCreateUserGlobalVirtual);
|
|
|
584 |
|
|
|
585 |
// set paged attribute for mapping...
|
|
|
586 |
if(aMemory->IsDemandPaged())
|
|
|
587 |
FlagSet(aFlags,EMappingCreateDemandPaged);
|
|
|
588 |
else
|
|
|
589 |
FlagClear(aFlags,EMappingCreateDemandPaged);
|
|
|
590 |
|
|
|
591 |
DMemoryMapping* mapping = 0;
|
|
|
592 |
TInt r = KErrNone;
|
|
|
593 |
if(!aMemory->CheckRegion(aIndex,aCount))
|
|
|
594 |
r = KErrArgument;
|
|
|
595 |
else
|
|
|
596 |
{
|
|
|
597 |
mapping = aMemory->CreateMapping(aIndex, aCount);
|
|
|
598 |
if(!mapping)
|
|
|
599 |
r = KErrNoMemory;
|
|
|
600 |
}
|
|
|
601 |
|
|
|
602 |
if(!mapping)
|
|
|
603 |
{
|
|
|
604 |
// free any virtual address the mapping should have adopted...
|
|
|
605 |
if(aFlags&EMappingCreateAdoptVirtual)
|
|
|
606 |
MM::VirtualFree(aOsAsid, aAddr, aCount<<KPageShift);
|
|
|
607 |
}
|
|
|
608 |
else
|
|
|
609 |
{
|
|
|
610 |
r = mapping->Construct(aMemory->Attributes(), aFlags, aOsAsid, aAddr, aCount<<KPageShift, aIndex<<KPageShift);
|
|
|
611 |
if(r==KErrNone)
|
|
|
612 |
r = mapping->Map(aMemory, aIndex, aCount, aPermissions);
|
|
|
613 |
if(r!=KErrNone)
|
|
|
614 |
{
|
|
|
615 |
mapping->Close();
|
|
|
616 |
mapping = 0;
|
|
|
617 |
}
|
|
|
618 |
}
|
|
|
619 |
|
|
|
620 |
aMapping = mapping;
|
|
|
621 |
TRACE(("MM::MappingNew returns %d (aMapping=0x%0x)",r,aMapping));
|
|
|
622 |
#ifdef BTRACE_FLEXIBLE_MEM_MODEL
|
|
|
623 |
if (r == KErrNone)
|
|
|
624 |
aMapping->BTraceCreate();
|
|
|
625 |
#endif
|
|
|
626 |
return r;
|
|
|
627 |
}
|
|
|
628 |
|
|
|
629 |
|
|
|
630 |
TInt MM::MappingNew(DMemoryMapping*& aMapping, TUint aCount, TInt aOsAsid, TMappingCreateFlags aFlags, TLinAddr aAddr, TLinAddr aColourOffset)
|
|
|
631 |
{
|
|
|
632 |
TRACE2(("MM::MappingNew(?,0x%08x,%d,0x%08x,0x%08x,0x%08x)",aCount, aOsAsid, aFlags, aAddr, aColourOffset));
|
|
|
633 |
|
|
|
634 |
FlagClear(aFlags,EMappingCreateDemandPaged); // mapping can't use demand paged page tables
|
|
|
635 |
|
|
|
636 |
TInt r = KErrNone;
|
|
|
637 |
DMemoryMapping* mapping = new DFineMapping();
|
|
|
638 |
if(!mapping)
|
|
|
639 |
r = KErrNoMemory;
|
|
|
640 |
|
|
|
641 |
if(!mapping)
|
|
|
642 |
{
|
|
|
643 |
// free any virtual address the mapping should have adopted...
|
|
|
644 |
if(aFlags&EMappingCreateAdoptVirtual)
|
|
|
645 |
MM::VirtualFree(aOsAsid, aAddr, aCount<<KPageShift);
|
|
|
646 |
}
|
|
|
647 |
else
|
|
|
648 |
{
|
|
|
649 |
r = mapping->Construct(EMemoryAttributeStandard, aFlags, aOsAsid, aAddr, aCount<<KPageShift, aColourOffset);
|
|
|
650 |
if(r!=KErrNone)
|
|
|
651 |
{
|
|
|
652 |
mapping->Close();
|
|
|
653 |
mapping = 0;
|
|
|
654 |
}
|
|
|
655 |
}
|
|
|
656 |
|
|
|
657 |
aMapping = mapping;
|
|
|
658 |
TRACE2(("MM::MappingNew returns %d (aMapping=0x%0x)",r,aMapping));
|
|
|
659 |
|
|
|
660 |
return r;
|
|
|
661 |
}
|
|
|
662 |
|
|
|
663 |
|
|
|
664 |
TInt MM::MappingMap(DMemoryMapping* aMapping, TMappingPermissions aPermissions, DMemoryObject* aMemory, TUint aIndex, TUint aCount)
|
|
|
665 |
{
|
|
|
666 |
TRACE2(("MM::MappingMap(0x%08x,0x%08x,0x%08x,0x%x,0x%x)",aMapping,aPermissions,aMemory,aIndex,aCount));
|
|
|
667 |
if(aCount==~0u)
|
|
|
668 |
aCount = aMemory->iSizeInPages-aIndex;
|
|
|
669 |
TInt r = aMapping->Map(aMemory, aIndex, aCount, aPermissions);
|
|
|
670 |
TRACE2(("MM::MappingMap returns %d",r));
|
|
|
671 |
return r;
|
|
|
672 |
}
|
|
|
673 |
|
|
|
674 |
|
|
|
675 |
void MM::MappingUnmap(DMemoryMapping* aMapping)
|
|
|
676 |
{
|
|
|
677 |
if(aMapping->IsAttached())
|
|
|
678 |
{
|
|
|
679 |
TRACE2(("MM::MappingUnmap(0x%08x)",aMapping));
|
|
|
680 |
aMapping->Unmap();
|
|
|
681 |
}
|
|
|
682 |
}
|
|
|
683 |
|
|
|
684 |
|
|
|
685 |
void MM::MappingDestroy(DMemoryMapping*& aMapping)
|
|
|
686 |
{
|
|
|
687 |
DMemoryMapping* mapping = (DMemoryMapping*)__e32_atomic_swp_ord_ptr(&aMapping, 0);
|
|
|
688 |
if (!mapping)
|
|
|
689 |
return;
|
|
|
690 |
TRACE(("MM::MappingDestroy(0x%08x)",mapping));
|
|
|
691 |
#ifdef BTRACE_FLEXIBLE_MEM_MODEL
|
|
|
692 |
BTraceContext4(BTrace::EFlexibleMemModel,BTrace::EMemoryMappingDestroy,mapping);
|
|
|
693 |
#endif
|
|
|
694 |
if(mapping->IsAttached())
|
|
|
695 |
mapping->Unmap();
|
|
|
696 |
mapping->Close();
|
|
|
697 |
}
|
|
|
698 |
|
|
|
699 |
|
|
|
700 |
void MM::MappingDestroy(TLinAddr aAddr, TInt aOsAsid)
|
|
|
701 |
{
|
|
|
702 |
DMemoryMapping* mapping = AddressSpace[aOsAsid]->GetMapping(aAddr);
|
|
|
703 |
MM::MappingDestroy(mapping);
|
|
|
704 |
}
|
|
|
705 |
|
|
|
706 |
|
|
|
707 |
void MM::MappingAndMemoryDestroy(DMemoryMapping*& aMapping)
|
|
|
708 |
{
|
|
|
709 |
DMemoryMapping* mapping = (DMemoryMapping*)__e32_atomic_swp_ord_ptr(&aMapping, 0);
|
|
|
710 |
TRACE(("MM::MappingAndMemoryDestroy(0x%08x)",mapping));
|
|
|
711 |
if (!mapping)
|
|
|
712 |
return;
|
|
|
713 |
DMemoryObject* memory = mapping->Memory(true); // safe because we assume owner hasn't unmapped mapping
|
|
|
714 |
MM::MappingDestroy(mapping);
|
|
|
715 |
MM::MemoryDestroy(memory);
|
|
|
716 |
}
|
|
|
717 |
|
|
|
718 |
|
|
|
719 |
void MM::MappingAndMemoryDestroy(TLinAddr aAddr, TInt aOsAsid)
|
|
|
720 |
{
|
|
|
721 |
DMemoryMapping* mapping = AddressSpace[aOsAsid]->GetMapping(aAddr);
|
|
|
722 |
MM::MappingAndMemoryDestroy(mapping);
|
|
|
723 |
}
|
|
|
724 |
|
|
|
725 |
|
|
|
726 |
TLinAddr MM::MappingBase(DMemoryMapping* aMapping)
|
|
|
727 |
{
|
|
|
728 |
TLinAddr base = aMapping->Base();
|
|
|
729 |
TRACE2(("MM::MappingBase(0x%08x) returns 0x%08x",aMapping,base));
|
|
|
730 |
return base;
|
|
|
731 |
}
|
|
|
732 |
|
|
|
733 |
|
|
|
734 |
TInt MM::MappingOsAsid(DMemoryMapping* aMapping)
|
|
|
735 |
{
|
|
|
736 |
return aMapping->OsAsid();
|
|
|
737 |
}
|
|
|
738 |
|
|
|
739 |
|
|
|
740 |
DMemoryObject* MM::MappingGetAndOpenMemory(DMemoryMapping* aMapping)
|
|
|
741 |
{
|
|
|
742 |
MmuLock::Lock();
|
|
|
743 |
DMemoryObject* memory = aMapping->Memory();
|
|
|
744 |
if (memory)
|
|
|
745 |
memory->Open();
|
|
|
746 |
MmuLock::Unlock();
|
|
|
747 |
TRACE2(("MM::MappingGetAndOpenMemory(0x%08x) returns 0x%08x",aMapping,memory));
|
|
|
748 |
return memory;
|
|
|
749 |
}
|
|
|
750 |
|
|
|
751 |
|
|
|
752 |
void MM::MappingClose(DMemoryMapping* aMapping)
|
|
|
753 |
{
|
|
|
754 |
TRACE2(("MM::MappingClose(0x%08x)",aMapping));
|
|
|
755 |
aMapping->Close();
|
|
|
756 |
}
|
|
|
757 |
|
|
|
758 |
|
|
|
759 |
DMemoryMapping* MM::FindMappingInThread(DMemModelThread* aThread, TLinAddr aAddr, TUint aSize,
|
|
|
760 |
TUint& aOffsetInMapping, TUint& aInstanceCount)
|
|
|
761 |
{
|
|
|
762 |
if(aAddr>=KGlobalMemoryBase)
|
|
|
763 |
{
|
|
|
764 |
// Address in global region, so look it up in kernel's address space...
|
|
|
765 |
return FindMappingInAddressSpace(KKernelOsAsid, aAddr, aSize, aOffsetInMapping, aInstanceCount);
|
|
|
766 |
}
|
|
|
767 |
|
|
|
768 |
// Address in thread's process address space so open a reference to its os asid
|
|
|
769 |
// so that it remains valid for FindMappingInAddressSpace() call.
|
|
|
770 |
DMemModelProcess* process = (DMemModelProcess*)aThread->iOwningProcess;
|
|
|
771 |
TInt osAsid = process->TryOpenOsAsid();
|
|
|
772 |
if (osAsid < 0)
|
|
|
773 |
{// The process no longer owns an address space so can't have any mappings.
|
|
|
774 |
return NULL;
|
|
|
775 |
}
|
|
|
776 |
|
|
|
777 |
DMemoryMapping* r = FindMappingInAddressSpace(osAsid, aAddr, aSize, aOffsetInMapping, aInstanceCount);
|
|
|
778 |
|
|
|
779 |
process->CloseOsAsid();
|
|
|
780 |
return r;
|
|
|
781 |
}
|
|
|
782 |
|
|
|
783 |
|
|
|
784 |
DMemoryMapping* MM::FindMappingInAddressSpace( TUint aOsAsid, TLinAddr aAddr, TUint aSize,
|
|
|
785 |
TUint& aOffsetInMapping, TUint& aInstanceCount)
|
|
|
786 |
{
|
|
|
787 |
return AddressSpace[aOsAsid]->FindMapping(aAddr, aSize, aOffsetInMapping, aInstanceCount);
|
|
|
788 |
}
|
|
|
789 |
|
|
|
790 |
|
|
|
791 |
|
|
|
792 |
//
|
|
|
793 |
// Address space
|
|
|
794 |
//
|
|
|
795 |
|
|
|
796 |
TInt MM::AddressSpaceAlloc(TPhysAddr& aPageDirectory)
|
|
|
797 |
{
|
|
|
798 |
return DAddressSpace::New(aPageDirectory);
|
|
|
799 |
}
|
|
|
800 |
|
|
|
801 |
|
|
|
802 |
void MM::AddressSpaceFree(TUint aOsAsid)
|
|
|
803 |
{
|
|
|
804 |
AddressSpace[aOsAsid]->Close();
|
|
|
805 |
}
|
|
|
806 |
|
|
|
807 |
|
|
|
808 |
void MM::AsyncAddressSpaceFree(TUint aOsAsid)
|
|
|
809 |
{
|
|
|
810 |
AddressSpace[aOsAsid]->AsyncClose();
|
|
|
811 |
}
|
|
|
812 |
|
|
|
813 |
|
|
|
814 |
TInt MM::VirtualAllocCommon(TLinAddr& aLinAddr, TUint aSize, TBool aDemandPaged)
|
|
|
815 |
{
|
|
|
816 |
TRACE(("MM::VirtualAllocCommon(?,0x%08x,%d)",aSize,aDemandPaged));
|
|
|
817 |
TUint pdeType = aDemandPaged ? EVirtualSlabTypeDemandPaged : 0;
|
|
|
818 |
TInt r = DAddressSpace::AllocateUserCommonVirtualMemory(aLinAddr, aSize, 0, aSize, pdeType);
|
|
|
819 |
TRACE(("MM::VirtualAllocCommon returns %d region=0x%08x+0x%08x",r,aLinAddr,aSize));
|
|
|
820 |
return r;
|
|
|
821 |
}
|
|
|
822 |
|
|
|
823 |
|
|
|
824 |
void MM::VirtualFreeCommon(TLinAddr aLinAddr, TUint aSize)
|
|
|
825 |
{
|
|
|
826 |
TRACE(("MM::VirtualFreeCommon(0x%08x,0x%08x)",aLinAddr,aSize));
|
|
|
827 |
DAddressSpace::FreeUserCommonVirtualMemory(aLinAddr, aSize);
|
|
|
828 |
}
|
|
|
829 |
|
|
|
830 |
|
|
|
831 |
TInt MM::VirtualAlloc(TInt aOsAsid, TLinAddr& aLinAddr, TUint aSize, TBool aDemandPaged)
|
|
|
832 |
{
|
|
|
833 |
TRACE(("MM::VirtualAlloc(?,%d,0x%08x,%d)",aOsAsid,aSize,aDemandPaged));
|
|
|
834 |
TUint pdeType = aDemandPaged ? EVirtualSlabTypeDemandPaged : 0;
|
|
|
835 |
TInt r = AddressSpace[aOsAsid]->AllocateVirtualMemory(aLinAddr, aSize, 0, aSize, pdeType);
|
|
|
836 |
TRACE(("MM::VirtualAlloc returns %d region=0x%08x+0x%08x",r,aLinAddr,aSize));
|
|
|
837 |
return r;
|
|
|
838 |
}
|
|
|
839 |
|
|
|
840 |
|
|
|
841 |
void MM::VirtualFree(TInt aOsAsid, TLinAddr aLinAddr, TUint aSize)
|
|
|
842 |
{
|
|
|
843 |
TRACE(("MM::VirtualFree(%d,0x%08x,0x%08x)",aOsAsid,aLinAddr,aSize));
|
|
|
844 |
AddressSpace[aOsAsid]->FreeVirtualMemory(aLinAddr, aSize);
|
|
|
845 |
}
|
|
|
846 |
|
|
|
847 |
|
|
|
848 |
|
|
|
849 |
//
|
|
|
850 |
// Init
|
|
|
851 |
//
|
|
|
852 |
|
|
|
853 |
void MM::Init1()
|
|
|
854 |
{
|
|
|
855 |
TheMmu.Init1();
|
|
|
856 |
}
|
|
|
857 |
|
|
|
858 |
|
|
|
859 |
extern DMutexPool MemoryObjectMutexPool;
|
|
|
860 |
extern DMutexPool AddressSpaceMutexPool;
|
|
|
861 |
|
|
|
862 |
void MM::Init2()
|
|
|
863 |
{
|
|
|
864 |
TInt r;
|
|
|
865 |
|
|
|
866 |
TheMmu.Init2();
|
|
|
867 |
|
|
|
868 |
// create mutex pools before calling any functions which require them...
|
|
|
869 |
_LIT(KAddressSpaceMutexName,"AddressSpaceMutex");
|
|
|
870 |
r = AddressSpaceMutexPool.Create(4, &KAddressSpaceMutexName, KMutexOrdAddresSpace);
|
|
|
871 |
__NK_ASSERT_ALWAYS(r==KErrNone);
|
|
|
872 |
_LIT(KMemoryObjectMutexName,"MemoryObjectMutex");
|
|
|
873 |
r = MemoryObjectMutexPool.Create(8, &KMemoryObjectMutexName, KMutexOrdMemoryObject);
|
|
|
874 |
__NK_ASSERT_ALWAYS(r==KErrNone);
|
|
|
875 |
|
|
|
876 |
// use the Ram Allocator mutex for low-level memory functions...
|
|
|
877 |
DMutex* mmuAllocMutex = TheMmu.iRamAllocatorMutex;
|
|
|
878 |
|
|
|
879 |
// memory cleanup needs initialising before any memory is freed...
|
|
|
880 |
TMemoryCleanup::Init2();
|
|
|
881 |
|
|
|
882 |
// initialise allocators used for MMU operations...
|
|
|
883 |
RPageArray::Init2A();
|
|
|
884 |
PageTables.Init2(mmuAllocMutex); // must come before any other code which allocates memory objects
|
|
|
885 |
RPageArray::Init2B(mmuAllocMutex);
|
|
|
886 |
PageTables.Init2B();
|
|
|
887 |
PageDirectories.Init2();
|
|
|
888 |
|
|
|
889 |
// initialise address spaces...
|
|
|
890 |
DAddressSpace::Init2();
|
|
|
891 |
|
|
|
892 |
TheMmu.Init2Final();
|
|
|
893 |
}
|
|
|
894 |
|
|
|
895 |
|
|
|
896 |
/** HAL Function wrapper for the RAM allocator.
|
|
|
897 |
*/
|
|
|
898 |
TInt RamHalFunction(TAny*, TInt aFunction, TAny* a1, TAny* a2)
|
|
|
899 |
{
|
|
|
900 |
return TheMmu.RamHalFunction(aFunction, a1, a2);
|
|
|
901 |
}
|
|
|
902 |
|
|
|
903 |
|
|
|
904 |
void MM::Init3()
|
|
|
905 |
{
|
|
|
906 |
__KTRACE_OPT2(KBOOT,KMMU,Kern::Printf("MM::Init3"));
|
|
|
907 |
ThePager.Init3();
|
|
|
908 |
|
|
|
909 |
// Register a HAL Function for the Ram allocator.
|
|
|
910 |
TInt r = Kern::AddHalEntry(EHalGroupRam, RamHalFunction, 0);
|
|
|
911 |
__NK_ASSERT_ALWAYS(r==KErrNone);
|
|
|
912 |
|
|
|
913 |
TheMmu.Init3();
|
|
|
914 |
}
|
|
|
915 |
|
|
|
916 |
|
|
|
917 |
TInt MM::InitFixedKernelMemory(DMemoryObject*& aMemory,
|
|
|
918 |
TLinAddr aStart,
|
|
|
919 |
TLinAddr aEnd,
|
|
|
920 |
TUint aInitSize,
|
|
|
921 |
TMemoryObjectType aType,
|
|
|
922 |
TMemoryCreateFlags aMemoryCreateFlags,
|
|
|
923 |
TMemoryAttributes aMemoryAttributes,
|
|
|
924 |
TMappingCreateFlags aMappingCreateFlags
|
|
|
925 |
)
|
|
|
926 |
{
|
|
|
927 |
TUint maxSize = aEnd-aStart;
|
|
|
928 |
TInt r = MM::MemoryNew(aMemory, aType, MM::BytesToPages(maxSize), aMemoryCreateFlags, aMemoryAttributes);
|
|
|
929 |
if(r==KErrNone)
|
|
|
930 |
{
|
|
|
931 |
TBool allowGaps = aInitSize&1; // lower bit of size is set if region to be claimed contains gaps
|
|
|
932 |
aInitSize &= ~1;
|
|
|
933 |
r = MM::MemoryClaimInitialPages(aMemory,aStart,aInitSize,ESupervisorReadWrite,allowGaps);
|
|
|
934 |
if(r==KErrNone)
|
|
|
935 |
{
|
|
|
936 |
DMemoryMapping* mapping;
|
|
|
937 |
r = MM::MappingNew(mapping,aMemory,ESupervisorReadWrite,KKernelOsAsid,aMappingCreateFlags,aStart);
|
|
|
938 |
// prevent any further mappings of this memory,
|
|
|
939 |
// this is needed for realtime and OOM guarantees...
|
|
|
940 |
aMemory->DenyMappings();
|
|
|
941 |
}
|
|
|
942 |
}
|
|
|
943 |
// Note, no cleanup is done if an error occurs because this function is only
|
|
|
944 |
// used at boot time and the system can't recover from an error
|
|
|
945 |
return r;
|
|
|
946 |
}
|
|
|
947 |
|
|
|
948 |
|
|
|
949 |
void MM::Panic(MM::TMemModelPanic aPanic)
|
|
|
950 |
{
|
|
|
951 |
Kern::Fault("MemModel", aPanic);
|
|
|
952 |
}
|
|
|
953 |
|
|
|
954 |
|
|
|
955 |
//
|
|
|
956 |
//
|
|
|
957 |
//
|
|
|
958 |
|
|
|
959 |
TUint MM::BytesToPages(TUint aBytes)
|
|
|
960 |
{
|
|
|
961 |
if(aBytes&KPageMask)
|
|
|
962 |
Panic(EBadBytesToPages);
|
|
|
963 |
return aBytes>>KPageShift;
|
|
|
964 |
}
|
|
|
965 |
|
|
|
966 |
|
|
|
967 |
TUint MM::RoundToPageSize(TUint aSize)
|
|
|
968 |
{
|
|
|
969 |
return (aSize+KPageMask)&~KPageMask;
|
|
|
970 |
}
|
|
|
971 |
|
|
|
972 |
|
|
|
973 |
TUint MM::RoundToPageCount(TUint aSize)
|
|
|
974 |
{
|
|
|
975 |
return (aSize+KPageMask)>>KPageShift;
|
|
|
976 |
}
|
|
|
977 |
|
|
|
978 |
|
|
|
979 |
TUint MM::RoundToPageShift(TUint aShift)
|
|
|
980 |
{
|
|
|
981 |
return aShift>(TUint)KPageShift ? aShift-KPageShift : 0;
|
|
|
982 |
}
|
|
|
983 |
|
|
|
984 |
|
|
|
985 |
//
|
|
|
986 |
//
|
|
|
987 |
//
|
|
|
988 |
|
|
|
989 |
void MM::ValidateLocalIpcAddress(TLinAddr aAddr, TUint aSize, TBool aWrite)
|
|
|
990 |
{
|
|
|
991 |
__NK_ASSERT_DEBUG(aSize);
|
|
|
992 |
|
|
|
993 |
TLinAddr end = aAddr+aSize-1;
|
|
|
994 |
if(end<aAddr)
|
|
|
995 |
end = ~(TLinAddr)0; // clip to end of memory
|
|
|
996 |
|
|
|
997 |
// if IPC region is in process local data area then it's OK...
|
|
|
998 |
if(end<KUserLocalDataEnd && aAddr>=KUserLocalDataBase)
|
|
|
999 |
return;
|
|
|
1000 |
|
|
|
1001 |
// if region overlaps alias region...
|
|
|
1002 |
if(end>=KIPCAlias && aAddr<KIPCAlias+KIPCAliasAreaSize)
|
|
|
1003 |
{
|
|
|
1004 |
// remove alias...
|
|
|
1005 |
((DMemModelThread*)TheCurrentThread)->RemoveAlias();
|
|
|
1006 |
// make sure start address is in alias region...
|
|
|
1007 |
if(aAddr<KIPCAlias)
|
|
|
1008 |
aAddr = KIPCAlias;
|
|
|
1009 |
// then cause fault now...
|
|
|
1010 |
MM::UserPermissionFault(aAddr,aWrite);
|
|
|
1011 |
}
|
|
|
1012 |
|
|
|
1013 |
if(end<(TLinAddr)KUserMemoryLimit)
|
|
|
1014 |
return; // user memory is safe
|
|
|
1015 |
|
|
|
1016 |
// Compare the current thread's process os asid to kernel asid, no need to
|
|
|
1017 |
// open a reference on the os asid as it is the current thread.
|
|
|
1018 |
if(((DMemModelProcess*)TheCurrentThread->iOwningProcess)->OsAsid()==(TInt)KKernelOsAsid)
|
|
|
1019 |
return; // kernel can access everything
|
|
|
1020 |
|
|
|
1021 |
// make sure address is in supervisor only region...
|
|
|
1022 |
if(aAddr<KUserMemoryLimit)
|
|
|
1023 |
aAddr = KUserMemoryLimit;
|
|
|
1024 |
// then cause fault now...
|
|
|
1025 |
MM::UserPermissionFault(aAddr,aWrite);
|
|
|
1026 |
}
|
|
|
1027 |
|
|
|
1028 |
|
|
|
1029 |
void MM::UserPermissionFault(TLinAddr aAddr, TBool aWrite)
|
|
|
1030 |
{
|
|
|
1031 |
// Access aAddr with user permissions to generate an exception...
|
|
|
1032 |
if(aWrite)
|
|
|
1033 |
UserWriteFault(aAddr);
|
|
|
1034 |
else
|
|
|
1035 |
UserReadFault(aAddr);
|
|
|
1036 |
__NK_ASSERT_ALWAYS(0); // shouldn't get here
|
|
|
1037 |
}
|
|
|
1038 |
|
|
|
1039 |
|
|
|
1040 |
#ifndef __SMP__
|
|
|
1041 |
void MM::IpcAliasPde(TPde*& aPdePtr, TUint aOsAsid)
|
|
|
1042 |
{
|
|
|
1043 |
aPdePtr = &Mmu::PageDirectory(aOsAsid)[KIPCAlias>>KChunkShift];
|
|
|
1044 |
}
|
|
|
1045 |
#endif
|
|
|
1046 |
|
|
|
1047 |
|
|
|
1048 |
TMappingPermissions MM::MappingPermissions(TBool aUser, TBool aWrite, TBool aExecute)
|
|
|
1049 |
{
|
|
|
1050 |
TUint perm = 0;
|
|
|
1051 |
if(aUser)
|
|
|
1052 |
perm |= EUser;
|
|
|
1053 |
if(aWrite)
|
|
|
1054 |
perm |= EReadWrite;
|
|
|
1055 |
if(aExecute)
|
|
|
1056 |
perm |= EExecute;
|
|
|
1057 |
return (TMappingPermissions)perm;
|
|
|
1058 |
}
|
|
|
1059 |
|
|
|
1060 |
|
|
|
1061 |
TInt MM::MappingPermissions(TMappingPermissions& aPermissions, TMappingAttributes2 aLegacyAttributes)
|
|
|
1062 |
{
|
|
|
1063 |
TUint attr2 = *(TUint32*)&aLegacyAttributes;
|
|
|
1064 |
|
|
|
1065 |
TUint read = attr2&EMapAttrReadMask;
|
|
|
1066 |
TUint write = (attr2&EMapAttrWriteMask)>>4;
|
|
|
1067 |
TUint execute = (attr2&EMapAttrExecMask)>>8;
|
|
|
1068 |
|
|
|
1069 |
read |= execute; // execute access requires read access
|
|
|
1070 |
|
|
|
1071 |
if(write==0) // no write required
|
|
|
1072 |
{
|
|
|
1073 |
if((read&5)==0)
|
|
|
1074 |
return KErrNotSupported; // neither supervisor nor user read specified
|
|
|
1075 |
}
|
|
|
1076 |
else if(write<4) // supervisor write required
|
|
|
1077 |
{
|
|
|
1078 |
if(read>=4)
|
|
|
1079 |
return KErrNotSupported; // user read requested (but no user write)
|
|
|
1080 |
}
|
|
|
1081 |
|
|
|
1082 |
read |= write; // write access implies read access
|
|
|
1083 |
|
|
|
1084 |
TUint user = read&4;
|
|
|
1085 |
aPermissions = MappingPermissions(user,write,execute);
|
|
|
1086 |
|
|
|
1087 |
return KErrNone;
|
|
|
1088 |
}
|
|
|
1089 |
|
|
|
1090 |
|
|
|
1091 |
TInt MM::MemoryAttributes(TMemoryAttributes& aAttributes, TMappingAttributes2 aLegacyAttributes)
|
|
|
1092 |
{
|
|
|
1093 |
TUint attr = aLegacyAttributes.Type();
|
|
|
1094 |
if (aLegacyAttributes.Shared())
|
|
|
1095 |
attr |= EMemoryAttributeShareable;
|
|
|
1096 |
if (aLegacyAttributes.Parity())
|
|
|
1097 |
attr |= EMemoryAttributeUseECC;
|
|
|
1098 |
aAttributes = Mmu::CanonicalMemoryAttributes((TMemoryAttributes)attr);
|
|
|
1099 |
return KErrNone;
|
|
|
1100 |
}
|
|
|
1101 |
|
|
|
1102 |
|
|
|
1103 |
TMappingAttributes2 MM::LegacyMappingAttributes(TMemoryAttributes aAttributes, TMappingPermissions aPermissions)
|
|
|
1104 |
{
|
|
|
1105 |
TUint attr = Mmu::CanonicalMemoryAttributes(aAttributes);
|
|
|
1106 |
return TMappingAttributes2
|
|
|
1107 |
(
|
|
|
1108 |
(TMemoryType)(attr&EMemoryAttributeTypeMask),
|
|
|
1109 |
aPermissions&EUser,
|
|
|
1110 |
aPermissions&EReadWrite,
|
|
|
1111 |
aPermissions&EExecute,
|
|
|
1112 |
attr&EMemoryAttributeShareable,
|
|
|
1113 |
attr&EMemoryAttributeUseECC
|
|
|
1114 |
);
|
|
|
1115 |
}
|
|
|
1116 |
|
|
|
1117 |
|