author | Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com> |
Thu, 15 Jul 2010 20:11:42 +0300 | |
branch | RCL_3 |
changeset 41 | 0ffb4e86fcc9 |
parent 0 | a41df078684a |
child 43 | c1f20ce4abcf |
permissions | -rw-r--r-- |
0 | 1 |
// Copyright (c) 1996-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 "cl_std.h" |
|
17 |
#include "cl_scan.h" |
|
18 |
||
19 |
const TInt KDirStackGranularity=8; |
|
20 |
||
21 |
/** Replace long names in path and filename with their sohrter version (if exists). Optionally appends |
|
22 |
filename to path name creating fully qualified file name. |
|
23 |
@param aFs (connected) File system session |
|
24 |
@param aCurrentPath on input contains current full path name, |
|
25 |
upon return contains the shortest version (using either shor or long names) of the same path |
|
26 |
@param aItem on input contains item with long name in the current path, |
|
27 |
upon return contains shorter name of either long or short name |
|
28 |
@param aAppend if ETrue aItem will be appended to aCurrentPath before successful return |
|
29 |
@return KErrNone if successful, otherwise one of the other system-wide error codes. |
|
30 |
*/ |
|
31 |
TInt ShrinkNames(RFs& aFs, TFileName& aCurrentPath, TFileName& aItem, TBool aAppend) |
|
32 |
{ |
|
33 |
TInt ret = KErrNone; |
|
34 |
TBuf<8+1+3> shortname; |
|
35 |
TFileName* current = NULL; |
|
36 |
TRAPD(r,current = new (ELeave) TFileName); |
|
37 |
if (r) |
|
38 |
return r; |
|
39 |
||
40 |
TInt pos = 0; |
|
41 |
TInt lastslash = KErrNotFound; |
|
42 |
TInt lastnewslash = KErrNotFound; |
|
43 |
while(ret == KErrNone && pos < aCurrentPath.Length()) |
|
44 |
{ |
|
45 |
if(aCurrentPath[pos] == KPathDelimiter) |
|
46 |
{ |
|
47 |
if(lastslash != KErrNotFound) |
|
48 |
{ |
|
49 |
ret = aFs.GetShortName(*current, shortname); |
|
50 |
if(ret == KErrNone && pos-lastslash > shortname.Length()) |
|
51 |
{ |
|
52 |
current->SetLength(lastnewslash); |
|
53 |
current->Append(shortname); |
|
54 |
} |
|
55 |
} |
|
56 |
lastslash = pos+1; |
|
57 |
lastnewslash = current->Length()+1; |
|
58 |
} |
|
59 |
current->Append(aCurrentPath[pos++]); |
|
60 |
} |
|
61 |
if(ret == KErrNone && current->Length() + aItem.Length() <= KMaxFileName) |
|
62 |
{ |
|
63 |
aCurrentPath = *current; |
|
64 |
TInt lenBefore = aCurrentPath.Length(); |
|
65 |
aCurrentPath.Append(aItem); |
|
66 |
ret = aFs.GetShortName(aCurrentPath, shortname); |
|
67 |
aCurrentPath.SetLength(lenBefore); |
|
68 |
||
69 |
if(ret == KErrNone && aItem.Length() > shortname.Length()) |
|
70 |
{ |
|
71 |
aItem = shortname; |
|
72 |
} |
|
73 |
} |
|
74 |
if(aAppend && ret == KErrNone && aCurrentPath.Length() + aItem.Length() <= KMaxFileName) |
|
75 |
{ |
|
76 |
aCurrentPath.Append(aItem); |
|
77 |
} |
|
78 |
delete current; |
|
79 |
return ret; |
|
80 |
} |
|
81 |
||
82 |
LOCAL_C TPtrC LeafDir(const TDesC& aPath) |
|
83 |
// |
|
84 |
// Returns the leaf directory of a path |
|
85 |
// |
|
86 |
{ |
|
87 |
||
88 |
TInt end=aPath.LocateReverse('\\'); |
|
89 |
__ASSERT_DEBUG(end!=KErrNotFound,Panic(EDirListError)); |
|
90 |
TPtrC ret(aPath.Ptr(),end); |
|
91 |
TInt start=ret.LocateReverse('\\'); |
|
92 |
if (start==KErrNotFound) |
|
93 |
start=end-1; |
|
94 |
return ret.Right(end-start-1); |
|
95 |
} |
|
96 |
||
97 |
CDirScan::CDirScan(RFs& aFs) |
|
98 |
// |
|
99 |
// Constructor |
|
100 |
// |
|
101 |
: iFs(&aFs) |
|
102 |
{ |
|
103 |
} |
|
104 |
||
105 |
||
106 |
||
107 |
||
108 |
EXPORT_C CDirScan* CDirScan::NewLC(RFs& aFs) |
|
109 |
/** |
|
110 |
Constructs and allocates memory for a new CDirScan object, putting a pointer |
|
111 |
to the object onto the cleanup stack. |
|
112 |
||
113 |
@param aFs The file server session. |
|
114 |
||
115 |
@return A pointer to the new directory scan object. |
|
116 |
*/ |
|
117 |
{ |
|
118 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNewLC, MODULEUID, aFs.Handle()); |
|
119 |
||
120 |
CDirScan* scan=new(ELeave) CDirScan(aFs); |
|
121 |
CleanupStack::PushL(scan); |
|
122 |
scan->iStack=CDirStack::NewL(); |
|
123 |
||
124 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNewLCReturn, MODULEUID, scan); |
|
125 |
return scan; |
|
126 |
} |
|
127 |
||
128 |
||
129 |
||
130 |
||
131 |
EXPORT_C CDirScan* CDirScan::NewL(RFs& aFs) |
|
132 |
/** |
|
133 |
Constructs and allocates memory for a new CDirScan object. |
|
134 |
||
135 |
@param aFs The file server session. |
|
136 |
||
137 |
@return A pointer to the new directory scan object. |
|
138 |
*/ |
|
139 |
{ |
|
140 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNewL, MODULEUID, aFs.Handle()); |
|
141 |
||
142 |
CDirScan* scan=CDirScan::NewLC(aFs); |
|
143 |
CleanupStack::Pop(); |
|
144 |
||
145 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNewLReturn, MODULEUID, scan); |
|
146 |
return scan; |
|
147 |
} |
|
148 |
||
149 |
||
150 |
||
151 |
||
152 |
EXPORT_C CDirScan::~CDirScan() |
|
153 |
/** |
|
154 |
Desctructor. |
|
155 |
||
156 |
Frees all resources owned by the object, prior to its destruction. |
|
157 |
*/ |
|
158 |
{ |
|
159 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanDestructor, MODULEUID, this); |
|
160 |
||
161 |
delete iStack; |
|
162 |
||
163 |
TRACE0(UTF::EBorder, UTraceModuleEfsrv::ECDirScanDestructorReturn, MODULEUID); |
|
164 |
} |
|
165 |
||
166 |
||
167 |
||
168 |
||
169 |
EXPORT_C void CDirScan::SetScanDataL(const TDesC& aMatchName,TUint anEntryAttMask,TUint anEntrySortKey,TScanDirection aScanDir) |
|
170 |
/** |
|
171 |
Initialises the scan. |
|
172 |
||
173 |
This involves specifying: |
|
174 |
||
175 |
1. the directory at the top of the structure to be scanned |
|
176 |
||
177 |
2. a filter for the entry types of interest |
|
178 |
||
179 |
3. the order in which the entries in each directory in the structure are to be sorted |
|
180 |
||
181 |
4. the scan direction. |
|
182 |
||
183 |
Whether the scan direction is upwards or downwards, the directories that are |
|
184 |
scanned are those in the part of the hierarchy below the directory |
|
185 |
specified in aMatchName. By default, the scan direction is downwards. |
|
186 |
If the scan direction is set to CDirScan::EScanUpTree, then all branches of |
|
187 |
the tree are explored starting at the lowest level directory in |
|
188 |
the tree below aMatchName, and ending at aMatchName. |
|
189 |
This option is provided for deleting a directory structure. |
|
190 |
||
191 |
@param aMatchName The top level directory for the scan. Any path components |
|
192 |
that are not specified here are taken from the session path. |
|
193 |
Note that the trailing backslash is required to specify the directory. |
|
194 |
I.e. path x:\\dir1\\dir2\\ means that the scan will start from dir2, while |
|
195 |
path x:\\dir1\\dir2 assumes scan starting from x:\\dir1\\ |
|
196 |
||
197 |
@param anEntryAttMask A bit mask that filters the entry types which should be returned by |
|
198 |
NextL(). The mask works as follows: |
|
199 |
To match files only, specify KEntryAttNormal. |
|
200 |
To match both files and directories, |
|
201 |
specify KEntryAttDir. |
|
202 |
To match directories only, |
|
203 |
specify KEntryAttDir|KEntryAttMatchExclusive. |
|
204 |
To match files with a specific attribute, |
|
205 |
then OR the attribute involved with |
|
206 |
KEntryAttMatchExclusive. |
|
207 |
For example, to match read-only files, |
|
208 |
specify KEntryAttReadOnly|KEntryAttMatchExclusive. |
|
209 |
For more information, |
|
210 |
see KEntryAttNormal or |
|
211 |
the other file/directory attributes. |
|
212 |
@param anEntrySortKey The order in which the directories are scanned by |
|
213 |
NextL(). This flag is defined in TEntryKey. |
|
214 |
@param aScanDir The direction of the scan. The default is downwards. |
|
215 |
*/ |
|
216 |
{ |
|
217 |
TRACEMULT5(UTF::EBorder, UTraceModuleEfsrv::ECDirScanSetScanDataL, MODULEUID, (TUint) |
|
218 |
this, aMatchName, anEntryAttMask, anEntrySortKey, (TUint) aScanDir); |
|
219 |
||
220 |
TInt r = Fs().Parse(aMatchName,iFullPath); |
|
221 |
if (r != KErrNone) |
|
222 |
{ |
|
223 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanSetScanDataLReturn, MODULEUID, r); |
|
224 |
User::Leave(r); |
|
225 |
} |
|
226 |
||
227 |
iScanning = ETrue; |
|
228 |
iEntryAttMask=anEntryAttMask; |
|
229 |
iEntrySortMask=anEntrySortKey; |
|
230 |
iStack->ResetL(LeafDir(iFullPath.FullName())); |
|
231 |
iAbbreviatedPathPos=iFullPath.DriveAndPath().Length()-1; |
|
232 |
iAbbreviatedPath.Set(_L("\\")); |
|
233 |
iScanDir=aScanDir; |
|
234 |
if (aScanDir==EScanDownTree) |
|
235 |
iFullPath.PopDir(); |
|
236 |
||
237 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanSetScanDataLReturn, MODULEUID, KErrNone); |
|
238 |
} |
|
239 |
||
240 |
void CDirScan::UpdateAbbreviatedPath() |
|
241 |
// |
|
242 |
// Set the abbreviated path based on the full path |
|
243 |
// |
|
244 |
{ |
|
245 |
||
246 |
TInt length=iFullPath.DriveAndPath().Length(); |
|
247 |
TPtrC fullName=iFullPath.FullName(); |
|
248 |
if (length>iAbbreviatedPathPos) |
|
249 |
iAbbreviatedPath.Set(&fullName[0]+iAbbreviatedPathPos,length-iAbbreviatedPathPos); |
|
250 |
else |
|
251 |
iAbbreviatedPath.Set(_L("\\")); |
|
252 |
} |
|
253 |
||
254 |
||
255 |
||
256 |
||
257 |
EXPORT_C void CDirScan::NextL(CDir*& aDirEntries) |
|
258 |
/** |
|
259 |
Scans the next directory entry in the structure. |
|
260 |
||
261 |
The order in which the structure is scanned is determined by the scan |
|
262 |
direction and the entry sort mask. These values are specified when setting up |
|
263 |
the scan. The type of entries retrieved by this function is determined by the |
|
264 |
entry attribute mask. This is also specified when setting up the scan. |
|
265 |
||
266 |
Notes: |
|
267 |
||
268 |
1. The function first sets aDirEntries to NULL, and then allocates memory for |
|
269 |
it before appending entries to it. Therefore, aDirEntries should have no |
|
270 |
memory allocated to it before this function is called, otherwise this |
|
271 |
memory will become orphaned. |
|
272 |
||
273 |
2. The caller of this function is responsible for deleting aDirEntries after |
|
274 |
the function has returned. |
|
275 |
||
276 |
@param aDirEntries On return, a pointer to an array containing filtered entries |
|
277 |
from the next directory in the structure. NULL if there are |
|
278 |
no more directories in the structure. |
|
279 |
*/ |
|
280 |
{ |
|
281 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNextL, MODULEUID, this); |
|
282 |
||
283 |
if (iScanDir==EScanUpTree) |
|
284 |
ScanUpTreeL(aDirEntries); |
|
285 |
else |
|
286 |
ScanDownTreeL(aDirEntries); |
|
287 |
||
288 |
TRACE2(UTF::EBorder, UTraceModuleEfsrv::ECDirScanNextLReturn, MODULEUID, |
|
289 |
KErrNone, aDirEntries ? (*aDirEntries).Count() : 0); |
|
290 |
} |
|
291 |
||
292 |
void CDirScan::ScanUpTreeL(CDir*& aDirEntries) |
|
293 |
// |
|
294 |
// Get the next directory starting from the bottom of the tree |
|
295 |
// eg: for deleting a directory structure |
|
296 |
// |
|
297 |
{ |
|
298 |
TInt r; |
|
299 |
iFullPath.PopDir(); |
|
300 |
CDirList* list=iStack->Peek(); |
|
301 |
if (!list->MoreEntries()) |
|
302 |
{ |
|
303 |
iStack->Pop(); |
|
304 |
if (iStack->IsEmpty()) |
|
305 |
{ |
|
306 |
aDirEntries=NULL; |
|
307 |
return; |
|
308 |
} |
|
309 |
UpdateAbbreviatedPath(); |
|
310 |
GetDirEntriesL(aDirEntries); |
|
311 |
return; |
|
312 |
} |
|
313 |
||
314 |
TFileName* next = new (ELeave) TFileName; |
|
315 |
CleanupStack::PushL(next); |
|
316 |
TFileName* current = new (ELeave) TFileName; |
|
317 |
CleanupStack::PushL(current); |
|
318 |
||
319 |
FOREVER |
|
320 |
{ |
|
321 |
TPtrC dirName=list->Next().iName; |
|
322 |
r = iFullPath.AddDir(dirName); |
|
323 |
if (r==KErrGeneral) // adding dirName would make iFullPath > 256 characters |
|
324 |
{ |
|
325 |
current->Copy(iFullPath.DriveAndPath()); |
|
326 |
next->Copy(dirName); |
|
327 |
||
328 |
r = ShrinkNames(Fs(), *current, *next, EFalse); |
|
329 |
if(r == KErrNone) |
|
330 |
{ |
|
331 |
r = iFullPath.Set(*current, NULL, NULL); |
|
332 |
if(r == KErrNone) |
|
333 |
{ |
|
334 |
r = iFullPath.AddDir(*next); |
|
335 |
} |
|
336 |
} |
|
337 |
} |
|
338 |
if (r != KErrNone) |
|
339 |
{ |
|
340 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
341 |
User::LeaveIfError(r); |
|
342 |
} |
|
343 |
||
344 |
CDir* dirList; |
|
345 |
// Start by searching for directories only from top to bottom |
|
346 |
r = Fs().GetDir(iFullPath.DriveAndPath(), |
|
347 |
KEntryAttDir|KEntryAttMatchExclusive|(iEntryAttMask&KEntryAttMatchMask), |
|
348 |
iEntrySortMask, |
|
349 |
dirList); |
|
350 |
if (r == KErrPermissionDenied && !iScanning) |
|
351 |
{ |
|
352 |
UpdateAbbreviatedPath(); |
|
353 |
aDirEntries = CDirFactory::NewL(); |
|
354 |
} |
|
355 |
else if (r != KErrNone) |
|
356 |
{ |
|
357 |
iScanning = EFalse; |
|
358 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
359 |
User::Leave(r); |
|
360 |
} |
|
361 |
||
362 |
iScanning= EFalse; |
|
363 |
||
364 |
// Permission denied case. No entry |
|
365 |
if(!dirList) |
|
366 |
break; |
|
367 |
||
368 |
if (dirList->Count()==0)// No more directory entries - bottom of tree reached |
|
369 |
{ |
|
370 |
delete dirList; |
|
371 |
break; |
|
372 |
} |
|
373 |
iStack->PushL(*dirList); |
|
374 |
list=iStack->Peek(); |
|
375 |
} //END OF FOREVER |
|
376 |
||
377 |
CleanupStack::PopAndDestroy(2); // current and next pointers |
|
378 |
||
379 |
UpdateAbbreviatedPath(); |
|
380 |
// Now get all valid entries for the lowest level directory encountered |
|
381 |
||
382 |
if(r!=KErrPermissionDenied ) |
|
383 |
{ |
|
384 |
GetDirEntriesL(aDirEntries); |
|
385 |
} |
|
386 |
} |
|
387 |
||
388 |
void CDirScan::GetDirEntriesL(CDir*& aDirEntries) |
|
389 |
// |
|
390 |
// Call GetDir. |
|
391 |
// |
|
392 |
{ |
|
393 |
TInt r = Fs().GetDir(iFullPath.FullName(),iEntryAttMask,iEntrySortMask,aDirEntries); |
|
394 |
if (r != KErrNone) |
|
395 |
{ |
|
396 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
397 |
User::Leave(r); |
|
398 |
} |
|
399 |
} |
|
400 |
||
401 |
void CDirScan::ScanDownTreeL(CDir*& aDirEntries) |
|
402 |
// |
|
403 |
// Get the next directory starting from the top of the tree |
|
404 |
// eg: for copying a directory structure |
|
405 |
// |
|
406 |
{ |
|
407 |
CDir* dirEntries = NULL; |
|
408 |
TInt r; |
|
409 |
aDirEntries=NULL; |
|
41
0ffb4e86fcc9
Revision: 201027
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
410 |
|
0ffb4e86fcc9
Revision: 201027
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
411 |
if(iStack && iStack->IsEmpty()) |
0ffb4e86fcc9
Revision: 201027
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
412 |
return; |
0ffb4e86fcc9
Revision: 201027
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
413 |
|
0 | 414 |
CDirList* list=iStack->Peek(); |
415 |
while (!list->MoreEntries()) |
|
416 |
{ |
|
417 |
iStack->Pop(); |
|
418 |
if (iStack->IsEmpty()) |
|
419 |
{ |
|
420 |
aDirEntries=NULL; |
|
421 |
return; |
|
422 |
} |
|
423 |
iFullPath.PopDir(); |
|
424 |
UpdateAbbreviatedPath(); |
|
425 |
list=iStack->Peek(); |
|
426 |
} |
|
427 |
||
428 |
TPtrC dirName=list->Next().iName; |
|
429 |
r=iFullPath.AddDir(dirName); |
|
430 |
if (r==KErrGeneral) // Adding dirName makes iFullPath>256 characters |
|
431 |
{ |
|
432 |
TRACE1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, KErrTooBig); |
|
433 |
User::Leave(KErrTooBig); |
|
434 |
} |
|
435 |
||
436 |
// Get all valid entries in this directory |
|
437 |
||
438 |
// coverity[alloc_arg] |
|
439 |
TRAP(r, GetDirEntriesL(dirEntries)); |
|
440 |
||
441 |
if (r == KErrNone) |
|
442 |
{ |
|
443 |
iScanning = EFalse; |
|
444 |
CleanupStack::PushL(dirEntries); |
|
445 |
// Get all directories within this directory - the next level down in the tree |
|
446 |
CDir* dirList; |
|
447 |
||
448 |
// coverity[alloc_fn] |
|
449 |
r = Fs().GetDir(iFullPath.DriveAndPath(), |
|
450 |
KEntryAttDir|KEntryAttMatchExclusive|(iEntryAttMask&KEntryAttMatchMask), |
|
451 |
iEntrySortMask,dirList); |
|
452 |
if (r != KErrNone) |
|
453 |
{ |
|
454 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
455 |
User::Leave(r); |
|
456 |
} |
|
457 |
iStack->PushL(*dirList); |
|
458 |
CleanupStack::Pop(); // dirEntries |
|
459 |
UpdateAbbreviatedPath(); |
|
460 |
aDirEntries=dirEntries; |
|
461 |
} |
|
462 |
else if (r == KErrPermissionDenied && !iScanning) |
|
463 |
{ |
|
464 |
CDir* dirList = CDirFactory::NewL(); |
|
465 |
iStack->PushL(*dirList); |
|
466 |
aDirEntries = CDirFactory::NewL(); |
|
467 |
} |
|
468 |
else |
|
469 |
{ |
|
470 |
iScanning = EFalse; |
|
471 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
472 |
User::Leave(r); |
|
473 |
} |
|
474 |
} |
|
475 |
||
476 |
||
477 |
||
478 |
||
479 |
EXPORT_C TPtrC CDirScan::AbbreviatedPath() |
|
480 |
/** |
|
481 |
Gets the abbreviated path of the entry currently being scanned. |
|
482 |
||
483 |
The abbreviated path is the path relative to the top level directory |
|
484 |
in the scan. |
|
485 |
||
486 |
@return A non modifiable pointer descriptor for the abbreviated path of |
|
487 |
the entry currently being scanned. |
|
488 |
*/ |
|
489 |
{ |
|
490 |
||
491 |
return iAbbreviatedPath; |
|
492 |
} |
|
493 |
||
494 |
||
495 |
||
496 |
||
497 |
EXPORT_C TPtrC CDirScan::FullPath() |
|
498 |
/** |
|
499 |
Gets the full path of the entry currently being scanned. |
|
500 |
||
501 |
The full path includes the drive letter. |
|
502 |
||
503 |
@return A non modifiable pointer descriptor for the full path of the entry |
|
504 |
currently being scanned. |
|
505 |
*/ |
|
506 |
{ |
|
507 |
||
508 |
return iFullPath.DriveAndPath(); |
|
509 |
} |
|
510 |
||
511 |
||
512 |
||
513 |
||
514 |
CDirStack* CDirStack::NewL() |
|
515 |
// |
|
516 |
// Create new directory stack |
|
517 |
// |
|
518 |
{ |
|
519 |
||
520 |
return new(ELeave) CDirStack; |
|
521 |
} |
|
522 |
||
523 |
CDirStack::CDirStack() |
|
524 |
// |
|
525 |
// Constructor |
|
526 |
// |
|
527 |
: iDirStack(KDirStackGranularity) |
|
528 |
{ |
|
529 |
} |
|
530 |
||
531 |
CDirStack::~CDirStack() |
|
532 |
// |
|
533 |
// Destructor |
|
534 |
// |
|
535 |
{ |
|
536 |
||
537 |
||
538 |
iDirStack.ResetAndDestroy(); |
|
539 |
} |
|
540 |
||
541 |
TInt CDirStack::IsEmpty() |
|
542 |
// |
|
543 |
// Return number of directories stacked |
|
544 |
// |
|
545 |
{ |
|
546 |
||
547 |
return (iDirStack.Count()==0); |
|
548 |
} |
|
549 |
||
550 |
void CDirStack::ResetL(const TDesC& aStartDir) |
|
551 |
// |
|
552 |
// Reset stack to containing only aStartDir |
|
553 |
// |
|
554 |
{ |
|
555 |
||
556 |
iDirStack.ResetAndDestroy(); |
|
557 |
CDir* dir=CDirFactory::NewL(aStartDir); |
|
558 |
PushL(*dir); |
|
559 |
} |
|
560 |
||
561 |
void CDirStack::PushL(CDir& aDirContents) |
|
562 |
// |
|
563 |
// Push a list of directories onto the stack |
|
564 |
// |
|
565 |
{ |
|
566 |
||
567 |
CleanupStack::PushL(&aDirContents); |
|
568 |
CDirList* nextLevel=CDirList::NewL(aDirContents); |
|
569 |
CleanupStack::Pop(); // aDirContents now owned by CDirList |
|
570 |
||
571 |
TInt r=iDirStack.Append(nextLevel); |
|
572 |
if (r!=KErrNone) |
|
573 |
{ |
|
574 |
delete nextLevel; |
|
575 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
576 |
User::Leave(r); |
|
577 |
} |
|
578 |
} |
|
579 |
||
580 |
void CDirStack::Pop() |
|
581 |
// |
|
582 |
// Pop subdirectory list off the stack |
|
583 |
// |
|
584 |
{ |
|
585 |
||
586 |
__ASSERT_DEBUG(iDirStack.Count(),Panic(EDirListError)); |
|
587 |
TInt tos=iDirStack.Count()-1; |
|
588 |
delete iDirStack[tos]; |
|
589 |
iDirStack.Remove(tos); |
|
590 |
} |
|
591 |
||
592 |
CDirList* CDirStack::Peek() |
|
593 |
// |
|
594 |
// Return current subdirectory |
|
595 |
// |
|
596 |
{ |
|
597 |
||
598 |
__ASSERT_DEBUG(iDirStack.Count(),Panic(EDirListError)); |
|
599 |
return iDirStack[iDirStack.Count()-1]; |
|
600 |
} |
|
601 |
||
602 |
CDirList* CDirList::NewL(CDir& aDirList) |
|
603 |
// |
|
604 |
// Create a new directory list - takes ownership of aDirList |
|
605 |
// |
|
606 |
{ |
|
607 |
||
608 |
CDirList* dirLevel=new(ELeave) CDirList; |
|
609 |
dirLevel->iDirList=&aDirList; |
|
610 |
return dirLevel; |
|
611 |
} |
|
612 |
||
613 |
CDirList::CDirList() |
|
614 |
// |
|
615 |
// Construct directory list |
|
616 |
// |
|
617 |
{ |
|
618 |
} |
|
619 |
||
620 |
CDirList::~CDirList() |
|
621 |
// |
|
622 |
// Destroy directory list |
|
623 |
// |
|
624 |
{ |
|
625 |
||
626 |
delete iDirList; |
|
627 |
} |
|
628 |
||
629 |
const TEntry& CDirList::Next() |
|
630 |
// |
|
631 |
// Return next directory in list. |
|
632 |
// |
|
633 |
{ |
|
634 |
||
635 |
__ASSERT_DEBUG(iCurrentPos>=0 && iCurrentPos<iDirList->Count(),Panic(EDirListError)); |
|
636 |
const TEntry& entry=(*iDirList)[iCurrentPos]; |
|
637 |
iCurrentPos++; |
|
638 |
return entry; |
|
639 |
} |
|
640 |
||
641 |
TBool CDirList::MoreEntries() const |
|
642 |
// |
|
643 |
// Return EFalse if the entire list has been read |
|
644 |
// |
|
645 |
{ |
|
646 |
||
647 |
__ASSERT_DEBUG(iCurrentPos>=0 && iCurrentPos<=iDirList->Count(),Panic(EDirListError)); |
|
648 |
return (iCurrentPos!=iDirList->Count()); |
|
649 |
} |
|
650 |
||
651 |
CDir* CDirFactory::NewL(const TDesC& anEntryName) |
|
652 |
// |
|
653 |
// Create a CDir containing a single entry. Used to initialize the scanner |
|
654 |
// |
|
655 |
{ |
|
656 |
||
657 |
CDirFactory* dir=(CDirFactory*)CDir::NewL(); |
|
658 |
CleanupStack::PushL(dir); |
|
659 |
TEntry entry; |
|
660 |
entry.iName=anEntryName; |
|
661 |
dir->AddL(entry); |
|
662 |
CleanupStack::Pop(); |
|
663 |
return dir; |
|
664 |
} |
|
665 |
||
666 |
CDir* CDirFactory::NewL() |
|
667 |
// |
|
668 |
// Create a CDir with nothing in it |
|
669 |
// |
|
670 |
{ |
|
671 |
||
672 |
CDirFactory* dir=(CDirFactory*)CDir::NewL(); |
|
673 |
return dir; |
|
674 |
} |
|
675 |
||
676 |
||
677 |
||
678 |
||
679 |
EXPORT_C TOpenFileScan::TOpenFileScan(RFs& aFs) |
|
680 |
/** |
|
681 |
Constructs the object with the specified file server session. |
|
682 |
||
683 |
@param aFs The file server session. |
|
684 |
*/ |
|
685 |
: iFs(&aFs), iScanPos(0), iEntryListPos(0) |
|
686 |
{} |
|
687 |
||
688 |
||
689 |
||
690 |
||
691 |
EXPORT_C void TOpenFileScan::NextL(CFileList*& aFileList) |
|
692 |
/** |
|
693 |
Gets a list of entries for the open files in the file server session. |
|
694 |
||
695 |
@param aFileList On return, contains a list of entries for all open files |
|
696 |
in the file server session. |
|
697 |
*/ |
|
698 |
{ |
|
699 |
||
700 |
||
701 |
aFileList=NULL; |
|
702 |
if (iScanPos==KErrNotFound) |
|
703 |
return; |
|
704 |
TEntryArray* pArray=new(ELeave) TEntryArray; |
|
705 |
CleanupStack::PushL(pArray); |
|
706 |
TEntryArray& array=*pArray; |
|
707 |
FOREVER |
|
708 |
{ |
|
709 |
TThreadId theId; |
|
710 |
TInt r = iFs->GetOpenFileList(iScanPos,iEntryListPos,theId,array); |
|
711 |
if (r != KErrNone) |
|
712 |
{ |
|
713 |
TRACERET1(UTF::EBorder, UTraceModuleEfsrv::ECDirScanLeave, MODULEUID, r); |
|
714 |
User::Leave(r); |
|
715 |
} |
|
716 |
TInt count=array.Count(); |
|
717 |
if (count==0) |
|
718 |
{ |
|
719 |
if (aFileList==NULL) |
|
720 |
iScanPos=KErrNotFound; |
|
721 |
else |
|
722 |
CleanupStack::Pop(); // aFileList |
|
723 |
iEntryListPos=0; |
|
724 |
CleanupStack::PopAndDestroy(); // pArray |
|
725 |
return; |
|
726 |
} |
|
727 |
iThreadId = theId; |
|
728 |
if (aFileList==NULL) |
|
729 |
{ |
|
730 |
aFileList=CFileList::NewL(); |
|
731 |
CleanupStack::PushL(aFileList); |
|
732 |
} |
|
733 |
TInt i=0; |
|
734 |
while (i<count) |
|
735 |
aFileList->AddL(array[i++]); |
|
736 |
} |
|
737 |
} |
|
738 |
||
739 |
||
740 |
||
741 |
||
742 |
EXPORT_C TThreadId TOpenFileScan::ThreadId() const |
|
743 |
/** |
|
744 |
Gets the ID of the thread that opened the files retrieved by NextL(). |
|
745 |
||
746 |
@return The ID of the thread that opened the files in the file list. |
|
747 |
*/ |
|
748 |
{ |
|
749 |
||
750 |
return(iThreadId); |
|
751 |
} |