Chameleon

Chameleon Svn Source Tree

Root/branches/cparm/i386/libsaio/hfs.c

1/*␊
2 * Copyright (c) 2000-2003 Apple Computer, Inc. All rights reserved.␊
3 *␊
4 * @APPLE_LICENSE_HEADER_START@␊
5 * ␊
6 * The contents of this file constitute Original Code as defined in and␊
7 * are subject to the Apple Public Source License Version 2.0 (the␊
8 * "License"). You may not use this file except in compliance with the␊
9 * License. Please obtain a copy of the License at␊
10 * http://www.apple.com/publicsource and read it before using this file.␊
11 * ␊
12 * This Original Code and all software distributed under the License are␊
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER␊
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,␊
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,␊
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the␊
17 * License for the specific language governing rights and limitations␊
18 * under the License.␊
19 * ␊
20 * @APPLE_LICENSE_HEADER_END@␊
21 */␊
22/*␊
23 * hfs.c - File System Module for HFS and HFS+.␊
24 *␊
25 * Copyright (c) 1999-2002 Apple Computer, Inc.␊
26 *␊
27 * DRI: Josh de Cesare␊
28 */␊
29␊
30#include <sl.h>␊
31#include <hfs/hfs_format.h>␊
32␊
33#include "hfs.h"␊
34#include "platform.h"␊
35␊
36#define kBlockSize (0x200)␊
37␊
38#define kMDBBaseOffset (2 * kBlockSize)␊
39␊
40#define kBTreeCatalog (0)␊
41#define kBTreeExtents (1)␊
42␊
43#ifdef __i386__␊
44␊
45static CICell gCurrentIH;␊
46static long long gAllocationOffset;␊
47static long gIsHFSPlus;␊
48static long gCaseSensitive;␊
49static long gBlockSize;␊
50static long gCacheBlockSize;␊
51static char *gBTreeHeaderBuffer;␊
52static BTHeaderRec gBaseBTHeaders[2];␊
53static BTHeaderRec **gBTHeaders = (BTHeaderRec**)gBaseBTHeaders;␊
54␊
55static char *gHFSMdbVib;␊
56static HFSMasterDirectoryBlock *gHFSMDB;␊
57static char *gHFSPlusHeader;␊
58static HFSPlusVolumeHeader *gHFSPlus;␊
59static char *gLinkTemp;␊
60static long long gVolID;␊
61static char *gTempStr;␊
62␊
63#else /* !__i386__ */␊
64␊
65static CICell gCurrentIH;␊
66static long long gAllocationOffset;␊
67static long gIsHFSPlus;␊
68static long gBlockSize;␊
69static long gCaseSensitive;␊
70static long gCacheBlockSize;␊
71static char gBTreeHeaderBuffer[512];␊
72static BTHeaderRec gBaseBTHeaders[2];␊
73static BTHeaderRec **gBTHeaders = (BTHeaderRec**)gBaseBTHeaders;␊
74static char gHFSMdbVib[kBlockSize];␊
75static HFSMasterDirectoryBlock *gHFSMDB =(HFSMasterDirectoryBlock*)gHFSMdbVib;␊
76static char gHFSPlusHeader[kBlockSize];␊
77static HFSPlusVolumeHeader *gHFSPlus =(HFSPlusVolumeHeader*)gHFSPlusHeader;␊
78static char gLinkTemp[64];␊
79static long long gVolID;␊
80␊
81#endif /* !__i386__ */␊
82␊
83static long ReadFile(void *file, uint64_t *length, void *base, uint64_t offset);␊
84static long GetCatalogEntryInfo(void *entry, long *flags, long *time,␊
85 FinderInfo *finderInfo, long *infoValid);␊
86static long ResolvePathToCatalogEntry(char *filePath, long *flags,␊
87␉␉␉␉␉␉␉␉␉ void *entry, long dirID, long long *dirIndex);␊
88␊
89static long GetCatalogEntry(long long *dirIndex, char **name,␊
90 long *flags, long *time,␊
91 FinderInfo *finderInfo, long *infoValid);␊
92static long ReadCatalogEntry(char *fileName, long dirID, void *entry,␊
93␉␉␉␉␉␉␉ long long *dirIndex);␊
94static long ReadExtentsEntry(long fileID, long startBlock, void *entry);␊
95␊
96static long ReadBTreeEntry(long btree, void *key, char *entry, long long *dirIndex);␊
97static void GetBTreeRecord(long index, char *nodeBuffer, long nodeSize,␊
98␉␉␉␉␉␉ char **key, char **data);␊
99␊
100static long ReadExtent(char *extent, uint64_t extentSize, long extentFile,␊
101␉␉␉␉␉ uint64_t offset, uint64_t size, void *buffer, long cache);␊
102␊
103static long GetExtentStart(void *extents, long index);␊
104static long GetExtentSize(void *extents, long index);␊
105␊
106static long CompareHFSCatalogKeys(void *key, void *testKey);␊
107static long CompareHFSPlusCatalogKeys(void *key, void *testKey);␊
108static long CompareHFSExtentsKeys(void *key, void *testKey);␊
109static long CompareHFSPlusExtentsKeys(void *key, void *testKey);␊
110␊
111extern long FastRelString(u_int8_t *str1, u_int8_t *str2);␊
112extern long BinaryUnicodeCompare(u_int16_t *uniStr1, u_int32_t len1,␊
113 u_int16_t *uniStr2, u_int32_t len2);␊
114␊
115␊
116static void SwapFinderInfo(FndrFileInfo *dst, FndrFileInfo *src)␊
117{␊
118 dst->fdType = SWAP_BE32(src->fdType);␊
119 dst->fdCreator = SWAP_BE32(src->fdCreator);␊
120 dst->fdFlags = SWAP_BE16(src->fdFlags);␊
121 // Don't bother with location␊
122}␊
123␊
124void HFSFree(CICell ih)␊
125{␊
126 if(gCurrentIH == ih)␊
127 gCurrentIH = 0;␊
128 free(ih);␊
129}␊
130␊
131bool HFSProbe (const void *buf)␊
132{␊
133␉const HFSMasterDirectoryBlock *mdb;␊
134␉const HFSPlusVolumeHeader *header;␊
135␉mdb=(const HFSMasterDirectoryBlock *)(((const char*)buf)+kMDBBaseOffset);␊
136␉header=(const HFSPlusVolumeHeader *)(((const char*)buf)+kMDBBaseOffset);␊
137␉␊
138␉if ( SWAP_BE16(mdb->drSigWord) == kHFSSigWord )␊
139␉␉return true;␊
140␉if (SWAP_BE16(header->signature) != kHFSPlusSigWord &&␊
141 SWAP_BE16(header->signature) != kHFSXSigWord)␊
142␉␉return false;␊
143␉return true;␊
144}␊
145␊
146long HFSInitPartition(CICell ih)␊
147{␊
148 long extentSize, extentFile, nodeSize;␊
149 void *extent;␊
150␉␊
151 if (ih == gCurrentIH) {␊
152#ifdef __i386__␊
153 CacheInit(ih, gCacheBlockSize);␊
154#endif␊
155 return 0;␊
156 }␊
157␉␊
158#ifdef __i386__␊
159 if (!gTempStr) gTempStr = (char *)malloc(4096);␊
160 if (!gLinkTemp) gLinkTemp = (char *)malloc(64);␊
161 if (!gBTreeHeaderBuffer) gBTreeHeaderBuffer = (char *)malloc(512);␊
162 if (!gHFSMdbVib) {␊
163 gHFSMdbVib = (char *)malloc(kBlockSize);␊
164 gHFSMDB = (HFSMasterDirectoryBlock *)gHFSMdbVib;␊
165 }␊
166 if (!gHFSPlusHeader) {␊
167 gHFSPlusHeader = (char *)malloc(kBlockSize);␊
168 gHFSPlus = (HFSPlusVolumeHeader *)gHFSPlusHeader;␊
169 }␊
170 if (!gTempStr || !gLinkTemp || !gBTreeHeaderBuffer ||␊
171 !gHFSMdbVib || !gHFSPlusHeader) return -1;␊
172#endif /* __i386__ */␊
173␉␊
174 gAllocationOffset = 0;␊
175 gIsHFSPlus = 0;␊
176 gCaseSensitive = 0;␊
177 gBTHeaders[0] = 0;␊
178 gBTHeaders[1] = 0;␊
179␉␊
180 // Look for the HFS MDB␊
181 Seek(ih, kMDBBaseOffset);␊
182 Read(ih, (long)gHFSMdbVib, kBlockSize);␊
183␉␊
184 if ( SWAP_BE16(gHFSMDB->drSigWord) == kHFSSigWord ) {␊
185 gAllocationOffset = SWAP_BE16(gHFSMDB->drAlBlSt) * kBlockSize;␊
186␉␉␊
187 // See if it is HFSPlus␊
188 if (SWAP_BE16(gHFSMDB->drEmbedSigWord) != kHFSPlusSigWord) {␊
189 // Normal HFS;␊
190 gCacheBlockSize = gBlockSize = SWAP_BE32(gHFSMDB->drAlBlkSiz);␊
191 CacheInit(ih, gCacheBlockSize);␊
192 gCurrentIH = ih;␊
193␉␉␉␊
194 // grab the 64 bit volume ID␊
195 bcopy(&gHFSMDB->drFndrInfo[6], &gVolID, 8);␊
196␉␉␉␊
197 // Get the Catalog BTree node size.␊
198 extent = (HFSExtentDescriptor *)&gHFSMDB->drCTExtRec;␊
199 extentSize = SWAP_BE32(gHFSMDB->drCTFlSize);␊
200 extentFile = kHFSCatalogFileID;␊
201 ReadExtent(extent, extentSize, extentFile, 0, 256,␊
202 gBTreeHeaderBuffer + kBTreeCatalog * 256, 0);␊
203␉␉␉␊
204 nodeSize = SWAP_BE16(((BTHeaderRec *)(gBTreeHeaderBuffer + kBTreeCatalog * 256 + ␊
205␉␉␉␉␉␉␉␉␉␉␉␉ sizeof(BTNodeDescriptor)))->nodeSize);␊
206␉␉␉␊
207 // If the BTree node size is larger than the block size, reset the cache.␊
208 if (nodeSize > gBlockSize) {␊
209 gCacheBlockSize = nodeSize;␊
210 CacheInit(ih, gCacheBlockSize);␊
211 }␊
212␉␉␉␊
213 return 0;␊
214 }␊
215␉␉␊
216 // Calculate the offset to the embeded HFSPlus volume.␊
217 gAllocationOffset += (long long)SWAP_BE16(gHFSMDB->drEmbedExtent.startBlock) *␊
218␉␉SWAP_BE32(gHFSMDB->drAlBlkSiz);␊
219 }␊
220␉␊
221 // Look for the HFSPlus Header␊
222 Seek(ih, gAllocationOffset + kMDBBaseOffset);␊
223 Read(ih, (long)gHFSPlusHeader, kBlockSize);␊
224␉␊
225 // Not a HFS+ or HFSX volume.␊
226 if (SWAP_BE16(gHFSPlus->signature) != kHFSPlusSigWord &&␊
227 SWAP_BE16(gHFSPlus->signature) != kHFSXSigWord) {␊
228␉␉verbose("HFS signature was not present.\n");␊
229 gCurrentIH = 0;␊
230␉␉return -1;␊
231 }␊
232␉␊
233 gIsHFSPlus = 1;␊
234 gCacheBlockSize = gBlockSize = SWAP_BE32(gHFSPlus->blockSize);␊
235 CacheInit(ih, gCacheBlockSize);␊
236 gCurrentIH = ih;␊
237␉␊
238␉ih->modTime = SWAP_BE32(gHFSPlus->modifyDate) - 2082844800;␊
239␉␊
240 // grab the 64 bit volume ID␊
241 bcopy(&gHFSPlus->finderInfo[24], &gVolID, 8);␊
242␉␊
243 // Get the Catalog BTree node size.␊
244 extent = &gHFSPlus->catalogFile.extents;␊
245 extentSize = SWAP_BE64(gHFSPlus->catalogFile.logicalSize);␊
246 extentFile = kHFSCatalogFileID;␊
247␉␊
248 ReadExtent(extent, extentSize, extentFile, 0, 256,␊
249 gBTreeHeaderBuffer + kBTreeCatalog * 256, 0);␊
250␉␊
251 nodeSize = SWAP_BE16(((BTHeaderRec *)(gBTreeHeaderBuffer + kBTreeCatalog * 256 +␊
252␉␉␉␉␉␉␉␉␉␉ sizeof(BTNodeDescriptor)))->nodeSize);␊
253␉␊
254 // If the BTree node size is larger than the block size, reset the cache.␊
255 if (nodeSize > gBlockSize) {␊
256 gCacheBlockSize = nodeSize;␊
257 CacheInit(ih, gCacheBlockSize);␊
258 }␊
259␉␊
260 return 0;␊
261}␊
262␊
263long HFSLoadFile(CICell ih, char * filePath)␊
264{␊
265␉return HFSReadFile(ih, filePath, (void *)(uint32_t)get_env(envgFSLoadAddress), 0, 0);␊
266}␊
267␊
268long HFSReadFile(CICell ih, char * filePath, void *base, uint64_t offset, uint64_t length)␊
269{␊
270 char entry[512];␊
271 char devStr[12];␊
272 long dirID, result, flags = 0;␊
273␉␊
274 if (HFSInitPartition(ih) == -1) return -1;␊
275 ␊
276 dirID = kHFSRootFolderID;␊
277 // Skip a lead '\'. Start in the system folder if there are two.␊
278 if (filePath[0] == '/') {␊
279 if (filePath[1] == '/') {␊
280 if (gIsHFSPlus) dirID = SWAP_BE32(((long *)gHFSPlus->finderInfo)[5]);␊
281 else dirID = SWAP_BE32(gHFSMDB->drFndrInfo[5]);␊
282 if (dirID == 0) {␊
283␉␉␉␉return -1;␊
284␉␉␉}␊
285 filePath++;␊
286 }␊
287 filePath++;␊
288 }␊
289␉␊
290 result = ResolvePathToCatalogEntry(filePath, &flags, entry, dirID, 0);␊
291 if ((result == -1) || ((flags & kFileTypeMask) != kFileTypeFlat)) {␊
292␉␉return -1;␊
293 }␊
294␉␊
295#if UNUSED␊
296 // Not yet for Intel. System.config/Default.table will fail this check.␊
297 // Check file owner and permissions.␊
298 if (flags & (kOwnerNotRoot | kPermGroupWrite | kPermOtherWrite)) return -1;␊
299#endif␊
300␉␊
301 result = ReadFile(entry, &length, base, offset);␊
302 if (result == -1) {␊
303␉␉return -1;␊
304 }␊
305␉␊
306 getDeviceDescription(ih, devStr);␊
307␉␊
308␉if (get_env(envHFSLoadVerbose)) {␊
309␉␉verbose("Read HFS%s file: [%s/%s] %d bytes.\n",␊
310␉␉␉␉(gIsHFSPlus ? "+" : ""), devStr, filePath, (uint32_t)length);␊
311␉} else if (get_env(envHFSLoadVerbose) == 0) {␉␉␊
312␉␉safe_set_env(envHFSLoadVerbose, 1);␊
313␉}␊
314 ␊
315 return length;␊
316}␊
317␊
318long HFSGetDirEntry(CICell ih, char * dirPath, long long * dirIndex, char ** name,␊
319 long * flags, long * time,␊
320 FinderInfo * finderInfo, long * infoValid)␊
321{␊
322 char entry[512];␊
323 long dirID, dirFlags = 0;␊
324␉␊
325 if (HFSInitPartition(ih) == -1) return -1;␊
326␉␊
327 if (*dirIndex == -1) return -1;␊
328␉␊
329 dirID = kHFSRootFolderID;␊
330 // Skip a lead '\'. Start in the system folder if there are two.␊
331 if (dirPath[0] == '/') {␊
332 if (dirPath[1] == '/') {␊
333 if (gIsHFSPlus) dirID = SWAP_BE32(((long *)gHFSPlus->finderInfo)[5]);␊
334 else dirID = SWAP_BE32(gHFSMDB->drFndrInfo[5]);␊
335 if (dirID == 0) return -1;␊
336 dirPath++;␊
337 }␊
338 dirPath++;␊
339 }␊
340␉␊
341 if (*dirIndex == 0) {␊
342 ResolvePathToCatalogEntry(dirPath, &dirFlags, entry, dirID, dirIndex);␊
343 if (*dirIndex == 0) *dirIndex = -1;␊
344 if ((dirFlags & kFileTypeMask) != kFileTypeUnknown) return -1;␊
345 }␊
346␉␊
347 GetCatalogEntry(dirIndex, name, flags, time, finderInfo, infoValid);␊
348 if (*dirIndex == 0) *dirIndex = -1;␊
349 if ((*flags & kFileTypeMask) == kFileTypeUnknown) return -1;␊
350␉␊
351 return 0;␊
352}␊
353␊
354void␊
355HFSGetDescription(CICell ih, char *str, long strMaxLen)␊
356{␊
357␉␊
358 UInt16 nodeSize;␊
359 UInt32 firstLeafNode;␊
360 long long dirIndex;␊
361 char *name;␊
362 long flags = 0, time;␊
363␉␊
364 if (HFSInitPartition(ih) == -1) { return; }␊
365␉␊
366 /* Fill some crucial data structures by side effect. */␊
367 dirIndex = 0;␊
368 HFSGetDirEntry(ih, "/", &dirIndex, &name, &flags, &time, 0, 0);␊
369␉␊
370 /* Now we can loook up the volume name node. */␊
371 nodeSize = SWAP_BE16(gBTHeaders[kBTreeCatalog]->nodeSize);␊
372 firstLeafNode = SWAP_BE32(gBTHeaders[kBTreeCatalog]->firstLeafNode);␊
373␉␊
374 dirIndex = (long long) firstLeafNode * nodeSize;␊
375␉␊
376 GetCatalogEntry(&dirIndex, &name, &flags, &time, 0, 0);␊
377␉␊
378 strncpy(str, name, strMaxLen);␊
379 str[strMaxLen] = '\0';␊
380}␊
381␊
382␊
383long␊
384HFSGetFileBlock(CICell ih, char *filePath, unsigned long long *firstBlock)␊
385{␊
386 char entry[512];␊
387 long dirID, result, flags = 0;␊
388 void *extents;␊
389 HFSCatalogFile *hfsFile = (void *)entry;␊
390 HFSPlusCatalogFile *hfsPlusFile = (void *)entry;␊
391␉␊
392 if (HFSInitPartition(ih) == -1) return -1;␊
393␉␊
394 dirID = kHFSRootFolderID;␊
395 // Skip a lead '\'. Start in the system folder if there are two.␊
396 if (filePath[0] == '/') {␊
397 if (filePath[1] == '/') {␊
398 if (gIsHFSPlus) dirID = SWAP_BE32(((long *)gHFSPlus->finderInfo)[5]);␊
399 else dirID = SWAP_BE32(gHFSMDB->drFndrInfo[5]);␊
400 if (dirID == 0) {␊
401␉␉␉␉return -1;␊
402␉␉␉}␊
403 filePath++;␊
404 }␊
405 filePath++;␊
406 }␊
407␉␊
408 result = ResolvePathToCatalogEntry(filePath, &flags, entry, dirID, 0);␊
409 if ((result == -1) || ((flags & kFileTypeMask) != kFileTypeFlat)) {␊
410 printf("HFS: Resolve path %s failed\n", filePath);␊
411␉␉return -1;␊
412 }␊
413␉␊
414 if (gIsHFSPlus) {␊
415 extents = &hfsPlusFile->dataFork.extents;␊
416 } else {␊
417 extents = &hfsFile->dataExtents;␊
418 }␊
419␉␊
420#if DEBUG␊
421 printf("extent start 0x%x\n", (unsigned long)GetExtentStart(extents, 0));␊
422 printf("block size 0x%x\n", (unsigned long)gBlockSize);␊
423 printf("Allocation offset 0x%x\n", (unsigned long)gAllocationOffset);␊
424#endif␊
425 *firstBlock = ((unsigned long long)GetExtentStart(extents, 0) * (unsigned long long) gBlockSize + gAllocationOffset) / 512ULL;␊
426 return 0;␊
427}␊
428␊
429long HFSGetUUID(CICell ih, char *uuidStr)␊
430{␊
431 if (HFSInitPartition(ih) == -1) return -1;␊
432 if (gVolID == 0LL) return -1;␊
433␉␊
434 return CreateUUIDString((uint8_t*)(&gVolID), sizeof(gVolID), uuidStr);␊
435}␊
436␊
437// Private Functions␊
438␊
439static long ReadFile(void * file, uint64_t * length, void * base, uint64_t offset)␊
440{␊
441 void *extents;␊
442 long fileID;␊
443 uint64_t fileLength;␊
444 HFSCatalogFile *hfsFile = file;␊
445 HFSPlusCatalogFile *hfsPlusFile = file;␊
446␉␊
447 if (gIsHFSPlus) {␊
448 fileID = SWAP_BE32(hfsPlusFile->fileID);␊
449 fileLength = (uint64_t)SWAP_BE64(hfsPlusFile->dataFork.logicalSize);␊
450 extents = &hfsPlusFile->dataFork.extents;␊
451 } else {␊
452 fileID = SWAP_BE32(hfsFile->fileID);␊
453 fileLength = SWAP_BE32(hfsFile->dataLogicalSize);␊
454 extents = &hfsFile->dataExtents;␊
455 }␊
456␉␊
457 if (offset > fileLength) {␊
458 printf("Offset is too large.\n");␊
459 return -1;␊
460 }␊
461␉␊
462 if ((*length == 0) || ((offset + *length) > fileLength)) {␊
463 *length = fileLength - offset;␊
464 }␊
465␉␊
466␉/* if (*length > kLoadSize) {␊
467␉ printf("File is too large.\n");␊
468␉ return -1;␊
469␉ }*/␊
470␉␊
471 *length = ReadExtent((char *)extents, fileLength, fileID,␊
472 offset, *length, (char *)base, 0);␊
473␉␊
474 return 0;␊
475}␊
476␊
477static long GetCatalogEntryInfo(void * entry, long * flags, long * time,␊
478 FinderInfo * finderInfo, long * infoValid)␊
479{␊
480 long tmpTime = 0;␊
481 long valid = 0;␊
482␉␊
483 // Get information about the file.␊
484 ␊
485 switch ( SWAP_BE16(*(short *)entry) )␊
486 {␊
487 case kHFSFolderRecord :␊
488 *flags = kFileTypeDirectory;␊
489 tmpTime = SWAP_BE32(((HFSCatalogFolder *)entry)->modifyDate);␊
490 break;␊
491␉␉␉␊
492 case kHFSPlusFolderRecord :␊
493 *flags = kFileTypeDirectory |␊
494␉␉␉(SWAP_BE16(((HFSPlusCatalogFolder *)entry)->bsdInfo.fileMode) & kPermMask);␊
495 if (SWAP_BE32(((HFSPlusCatalogFolder *)entry)->bsdInfo.ownerID) != 0)␊
496 *flags |= kOwnerNotRoot;␊
497 tmpTime = SWAP_BE32(((HFSPlusCatalogFolder *)entry)->contentModDate);␊
498 break;␊
499␉␉␉␊
500 case kHFSFileRecord :␊
501 *flags = kFileTypeFlat;␊
502 tmpTime = SWAP_BE32(((HFSCatalogFile *)entry)->modifyDate);␊
503 if (finderInfo) {␊
504 SwapFinderInfo((FndrFileInfo *)finderInfo, &((HFSCatalogFile *)entry)->userInfo);␊
505 valid = 1;␊
506 }␊
507 break;␊
508␉␉␉␊
509 case kHFSPlusFileRecord :␊
510 *flags = kFileTypeFlat |␊
511␉␉␉(SWAP_BE16(((HFSPlusCatalogFile *)entry)->bsdInfo.fileMode) & kPermMask);␊
512 if (SWAP_BE32(((HFSPlusCatalogFile *)entry)->bsdInfo.ownerID) != 0)␊
513 *flags |= kOwnerNotRoot;␊
514 tmpTime = SWAP_BE32(((HFSPlusCatalogFile *)entry)->contentModDate);␊
515 if (finderInfo) {␊
516 SwapFinderInfo((FndrFileInfo *)finderInfo, &((HFSPlusCatalogFile *)entry)->userInfo);␊
517 valid = 1;␊
518 }␊
519 break;␊
520␉␉␉␊
521 case kHFSFileThreadRecord :␊
522 case kHFSPlusFileThreadRecord :␊
523 case kHFSFolderThreadRecord :␊
524 case kHFSPlusFolderThreadRecord :␊
525 *flags = kFileTypeUnknown;␊
526 tmpTime = 0;␊
527 break;␊
528␉␉default:␊
529␉␉␉break;␊
530 }␊
531␉␊
532 if (time != 0) {␊
533 // Convert base time from 1904 to 1970.␊
534 *time = tmpTime - 2082844800;␊
535 }␊
536 if (infoValid) *infoValid = valid;␊
537␉␊
538 return 0;␊
539}␊
540␊
541static long ResolvePathToCatalogEntry(char * filePath, long * flags,␊
542 void * entry, long dirID, long long * dirIndex)␊
543{␊
544 char *restPath;␊
545 long result, cnt, subFolderID = 0;␊
546 long long tmpDirIndex;␊
547 HFSPlusCatalogFile *hfsPlusFile;␊
548␉␊
549 // Copy the file name to gTempStr␊
550 cnt = 0;␊
551 while ((filePath[cnt] != '/') && (filePath[cnt] != '\0')) cnt++;␊
552 strlcpy(gTempStr, filePath, cnt+1);␊
553␉␊
554 // Move restPath to the right place.␊
555 if (filePath[cnt] != '\0') cnt++;␊
556 restPath = filePath + cnt;␊
557␉␊
558 // gTempStr is a name in the current Dir.␊
559 // restPath is the rest of the path if any.␊
560␉␊
561 result = ReadCatalogEntry(gTempStr, dirID, entry, dirIndex);␊
562 if (result == -1) {␊
563␉␉return -1;␊
564 }␊
565␉␊
566 GetCatalogEntryInfo(entry, flags, 0, 0, 0);␊
567␉␊
568 if ((*flags & kFileTypeMask) == kFileTypeDirectory) {␊
569 if (gIsHFSPlus)␊
570 subFolderID = SWAP_BE32(((HFSPlusCatalogFolder *)entry)->folderID);␊
571 else␊
572 subFolderID = SWAP_BE32(((HFSCatalogFolder *)entry)->folderID);␊
573 }␊
574␉␊
575 if ((*flags & kFileTypeMask) == kFileTypeDirectory)␊
576 result = ResolvePathToCatalogEntry(restPath, flags, entry,␊
577 subFolderID, dirIndex);␊
578␉␊
579 if (gIsHFSPlus && ((*flags & kFileTypeMask) == kFileTypeFlat)) {␊
580 hfsPlusFile = (HFSPlusCatalogFile *)entry;␊
581 if ((SWAP_BE32(hfsPlusFile->userInfo.fdType) == kHardLinkFileType) &&␊
582 (SWAP_BE32(hfsPlusFile->userInfo.fdCreator) == kHFSPlusCreator)) {␊
583␉␉␉sprintf(gLinkTemp, "%s/%s%ld", HFSPLUSMETADATAFOLDER,␊
584␉␉␉␉␉HFS_INODE_PREFIX, SWAP_BE32(hfsPlusFile->bsdInfo.special.iNodeNum));␊
585␉␉␉result = ResolvePathToCatalogEntry(gLinkTemp, flags, entry,␊
586␉␉␉␉␉␉␉␉␉␉␉ kHFSRootFolderID, &tmpDirIndex);␊
587 }␊
588 }␊
589␉␊
590 return result;␊
591}␊
592␊
593static long GetCatalogEntry(long long * dirIndex, char ** name,␊
594 long * flags, long * time,␊
595 FinderInfo * finderInfo, long * infoValid)␊
596{␊
597 long extentSize, nodeSize, curNode, index;␊
598 void *extent;␊
599 char *nodeBuf, *testKey, *entry;␊
600 BTNodeDescriptor *node;␊
601␉␊
602 if (gIsHFSPlus) {␊
603 extent = &gHFSPlus->catalogFile.extents;␊
604 extentSize = SWAP_BE64(gHFSPlus->catalogFile.logicalSize);␊
605 } else {␊
606 extent = (HFSExtentDescriptor *)&gHFSMDB->drCTExtRec;␊
607 extentSize = SWAP_BE32(gHFSMDB->drCTFlSize);␊
608 }␊
609␉␊
610 nodeSize = SWAP_BE16(gBTHeaders[kBTreeCatalog]->nodeSize);␊
611 nodeBuf = (char *)malloc(nodeSize);␊
612 node = (BTNodeDescriptor *)nodeBuf;␊
613␉␊
614 index = (long) (*dirIndex % nodeSize);␊
615 curNode = (long) (*dirIndex / nodeSize);␊
616␉␊
617 // Read the BTree node and get the record for index.␊
618 ReadExtent(extent, extentSize, kHFSCatalogFileID,␊
619 (long long) curNode * nodeSize, nodeSize, nodeBuf, 1);␊
620 GetBTreeRecord(index, nodeBuf, nodeSize, &testKey, &entry);␊
621␉␊
622 GetCatalogEntryInfo(entry, flags, time, finderInfo, infoValid);␊
623␉␊
624 // Get the file name.␊
625 if (gIsHFSPlus) {␊
626 utf_encodestr(((HFSPlusCatalogKey *)testKey)->nodeName.unicode,␊
627 SWAP_BE16(((HFSPlusCatalogKey *)testKey)->nodeName.length),␊
628 (u_int8_t *)gTempStr, 256, OSBigEndian);␊
629 } else {␊
630 strncpy(gTempStr,␊
631 (const char *)&((HFSCatalogKey *)testKey)->nodeName[1],␊
632␉␉␉␉((HFSCatalogKey *)testKey)->nodeName[0]);␊
633 gTempStr[((HFSCatalogKey *)testKey)->nodeName[0]] = '\0';␊
634 }␊
635 *name = gTempStr;␊
636␉␊
637 // Update dirIndex.␊
638 index++;␊
639 if (index == SWAP_BE16(node->numRecords)) {␊
640 index = 0;␊
641 curNode = SWAP_BE32(node->fLink);␊
642 }␊
643 *dirIndex = (long long) curNode * nodeSize + index;␊
644␉␊
645 free(nodeBuf);␊
646␉␊
647 return 0;␊
648}␊
649␊
650static long ReadCatalogEntry(char * fileName, long dirID,␊
651 void * entry, long long * dirIndex)␊
652{␊
653 //long length;␊
654 char key[sizeof(HFSPlusCatalogKey)];␊
655 HFSCatalogKey *hfsKey = (HFSCatalogKey *)key;␊
656 HFSPlusCatalogKey *hfsPlusKey = (HFSPlusCatalogKey *)key;␊
657␉␊
658 // Make the catalog key.␊
659 if ( gIsHFSPlus )␊
660 {␊
661 hfsPlusKey->parentID = SWAP_BE32(dirID);␊
662 //length = strlen(fileName);␊
663 //if (length > 255) length = 255;␊
664 utf_decodestr((u_int8_t *)fileName, hfsPlusKey->nodeName.unicode,␊
665 &(hfsPlusKey->nodeName.length), 512, OSBigEndian);␊
666 } else {␊
667 hfsKey->parentID = SWAP_BE32(dirID);␊
668 long length = strlen(fileName);␊
669 if (length > 31) length = 31;␊
670 hfsKey->nodeName[0] = length;␊
671 strncpy((char *)(hfsKey->nodeName + 1), fileName, length);␊
672 }␊
673␉␊
674 return ReadBTreeEntry(kBTreeCatalog, &key, entry, dirIndex);␊
675}␊
676␊
677static long ReadExtentsEntry(long fileID, long startBlock, void * entry)␊
678{␊
679 char key[sizeof(HFSPlusExtentKey)];␊
680 HFSExtentKey *hfsKey = (HFSExtentKey *)key;␊
681 HFSPlusExtentKey *hfsPlusKey = (HFSPlusExtentKey *)key;␊
682␉␊
683 // Make the extents key.␊
684 if (gIsHFSPlus) {␊
685 hfsPlusKey->forkType = 0;␊
686 hfsPlusKey->fileID = SWAP_BE32(fileID);␊
687 hfsPlusKey->startBlock = SWAP_BE32(startBlock);␊
688 } else {␊
689 hfsKey->forkType = 0;␊
690 hfsKey->fileID = SWAP_BE32(fileID);␊
691 hfsKey->startBlock = SWAP_BE16(startBlock);␊
692 }␊
693␉␊
694 return ReadBTreeEntry(kBTreeExtents, &key, entry, 0);␊
695}␊
696␊
697static long ReadBTreeEntry(long btree, void * key, char * entry, long long * dirIndex)␊
698{␊
699 long extentSize;␊
700 void *extent;␊
701 short extentFile;␊
702 char *nodeBuf;␊
703 BTNodeDescriptor *node;␊
704 long nodeSize, result = 0, entrySize = 0;␊
705 long curNode, index = 0, lowerBound, upperBound;␊
706 char *testKey, *recordData = 0;␊
707␉␊
708 // Figure out which tree is being looked at.␊
709 if (btree == kBTreeCatalog) {␊
710 if (gIsHFSPlus) {␊
711 extent = &gHFSPlus->catalogFile.extents;␊
712 extentSize = SWAP_BE64(gHFSPlus->catalogFile.logicalSize);␊
713 } else {␊
714 extent = (HFSExtentDescriptor *)&gHFSMDB->drCTExtRec;␊
715 extentSize = SWAP_BE32(gHFSMDB->drCTFlSize);␊
716 }␊
717 extentFile = kHFSCatalogFileID;␊
718 } else {␊
719 if (gIsHFSPlus) {␊
720 extent = &gHFSPlus->extentsFile.extents;␊
721 extentSize = SWAP_BE64(gHFSPlus->extentsFile.logicalSize);␊
722 } else {␊
723 extent = (HFSExtentDescriptor *)&gHFSMDB->drXTExtRec;␊
724 extentSize = SWAP_BE32(gHFSMDB->drXTFlSize);␊
725 }␊
726 extentFile = kHFSExtentsFileID;␊
727 }␊
728␉␊
729 // Read the BTree Header if needed.␊
730 if (gBTHeaders[btree] == 0) {␊
731 ReadExtent(extent, extentSize, extentFile, 0, 256,␊
732 gBTreeHeaderBuffer + btree * 256, 0);␊
733 gBTHeaders[btree] = (BTHeaderRec *)(gBTreeHeaderBuffer + btree * 256 +␊
734 sizeof(BTNodeDescriptor));␊
735 if ((gIsHFSPlus && btree == kBTreeCatalog) &&␊
736 (gBTHeaders[btree]->keyCompareType == kHFSBinaryCompare)) {␊
737␉␉␉gCaseSensitive = 1;␊
738 }␊
739 }␊
740␉␊
741 curNode = SWAP_BE32(gBTHeaders[btree]->rootNode);␊
742 nodeSize = SWAP_BE16(gBTHeaders[btree]->nodeSize);␊
743 nodeBuf = (char *)malloc(nodeSize);␊
744 node = (BTNodeDescriptor *)nodeBuf;␊
745␉␊
746 while (1) {␊
747 // Read the current node.␊
748 ReadExtent(extent, extentSize, extentFile,␊
749 (long long) curNode * nodeSize, nodeSize, nodeBuf, 1);␊
750␉␉␊
751 // Find the matching key.␊
752 lowerBound = 0;␊
753 upperBound = SWAP_BE16(node->numRecords) - 1;␊
754 while (lowerBound <= upperBound) {␊
755 index = (lowerBound + upperBound) / 2;␊
756␉␉␉␊
757 GetBTreeRecord(index, nodeBuf, nodeSize, &testKey, &recordData);␊
758␉␉␉␊
759 if (gIsHFSPlus) {␊
760 if (btree == kBTreeCatalog) {␊
761 result = CompareHFSPlusCatalogKeys(key, testKey);␊
762 } else {␊
763 result = CompareHFSPlusExtentsKeys(key, testKey);␊
764 }␊
765 } else {␊
766 if (btree == kBTreeCatalog) {␊
767 result = CompareHFSCatalogKeys(key, testKey);␊
768 } else {␊
769 result = CompareHFSExtentsKeys(key, testKey);␊
770 }␊
771 }␊
772␉␉␉␊
773 if (result < 0) upperBound = index - 1; // search < trial␊
774 else if (result > 0) lowerBound = index + 1; // search > trial␊
775 else break; // search = trial␊
776 }␊
777␉␉␊
778 if (result < 0) {␊
779 index = upperBound;␊
780 GetBTreeRecord(index, nodeBuf, nodeSize, &testKey, &recordData);␊
781 }␊
782 ␊
783 if (!recordData) { free(nodeBuf); return -1; }␊
784␉␉␊
785 // Found the closest key... Recurse on it if this is an index node.␊
786 if (node->kind == kBTIndexNode) {␊
787 curNode = SWAP_BE32( *((long *)recordData) );␊
788 } else break;␊
789 }␊
790␉␊
791 // Return error if the file was not found.␊
792 if (result != 0 || !recordData) { free(nodeBuf); return -1; }␊
793␉␊
794 if (btree == kBTreeCatalog) {␊
795 switch (SWAP_BE16(*(short *)recordData)) {␊
796 case kHFSFolderRecord : entrySize = 70; break;␊
797 case kHFSFileRecord : entrySize = 102; break;␊
798 case kHFSFolderThreadRecord : entrySize = 46; break;␊
799 case kHFSFileThreadRecord : entrySize = 46; break;␊
800 case kHFSPlusFolderRecord : entrySize = 88; break;␊
801 case kHFSPlusFileRecord : entrySize = 248; break;␊
802 case kHFSPlusFolderThreadRecord : entrySize = 264; break;␊
803 case kHFSPlusFileThreadRecord : entrySize = 264; break;␊
804␉␉␉default␉␉␉␉␉␉␉:␉␉␉␉ break;␊
805 }␊
806 } else {␊
807 if (gIsHFSPlus) entrySize = sizeof(HFSPlusExtentRecord);␊
808 else entrySize = sizeof(HFSExtentRecord);␊
809 }␊
810␉␊
811 bcopy(recordData, entry, entrySize);␊
812␉␊
813 // Update dirIndex.␊
814 if (dirIndex != 0) {␊
815 index++;␊
816 if (index == SWAP_BE16(node->numRecords)) {␊
817 index = 0;␊
818 curNode = SWAP_BE32(node->fLink);␊
819 }␊
820 *dirIndex = (long long) curNode * nodeSize + index;␊
821 }␊
822␉␊
823 free(nodeBuf);␊
824␉␊
825 return 0;␊
826}␊
827␊
828static void GetBTreeRecord(long index, char * nodeBuffer, long nodeSize,␊
829 char ** key, char ** data)␊
830{␊
831 long keySize;␊
832 long recordOffset;␊
833␉␊
834 recordOffset = SWAP_BE16(*((short *)(nodeBuffer + (nodeSize - 2 * index - 2))));␊
835 *key = nodeBuffer + recordOffset;␊
836 if (gIsHFSPlus) {␊
837 keySize = SWAP_BE16(*(short *)*key);␊
838 *data = *key + 2 + keySize;␊
839 } else {␊
840 keySize = **key;␊
841 *data = *key + 2 + keySize - (keySize & 1);␊
842 }␊
843}␊
844␊
845static long ReadExtent(char * extent, uint64_t extentSize,␊
846 long extentFile, uint64_t offset, uint64_t size,␊
847 void * buffer, long cache)␊
848{␊
849 uint64_t lastOffset;␊
850␉long long blockNumber, countedBlocks = 0;␊
851 long long nextExtent = 0, sizeRead = 0, readSize;␊
852 long long nextExtentBlock, currentExtentBlock = 0;␊
853 long long readOffset;␊
854 long long extentDensity, sizeofExtent, currentExtentSize;␊
855 char *currentExtent, *extentBuffer = 0, *bufferPos = buffer;␊
856␉␊
857 if (offset >= extentSize) return 0;␊
858␉␊
859 if (gIsHFSPlus) {␊
860 extentDensity = kHFSPlusExtentDensity;␊
861 sizeofExtent = sizeof(HFSPlusExtentDescriptor);␊
862 } else {␊
863 extentDensity = kHFSExtentDensity;␊
864 sizeofExtent = sizeof(HFSExtentDescriptor);␊
865 }␊
866␉␊
867 lastOffset = offset + size;␊
868 while (offset < lastOffset) {␊
869 blockNumber = offset / gBlockSize;␊
870␉␉␊
871 // Find the extent for the offset.␊
872 for (; ; nextExtent++) {␊
873 if (nextExtent < extentDensity) {␊
874 if ((countedBlocks+GetExtentSize(extent, nextExtent)-1)<blockNumber) {␊
875 countedBlocks += GetExtentSize(extent, nextExtent);␊
876 continue;␊
877 }␊
878␉␉␉␉␊
879 currentExtent = extent + nextExtent * sizeofExtent;␊
880 break;␊
881 }␊
882␉␉␉␊
883 if (extentBuffer == 0) {␊
884 extentBuffer = malloc(sizeofExtent * extentDensity);␊
885 if (extentBuffer == 0) return -1;␊
886 }␊
887␉␉␉␊
888 nextExtentBlock = nextExtent / extentDensity;␊
889 if (currentExtentBlock != nextExtentBlock) {␊
890 ReadExtentsEntry(extentFile, countedBlocks, extentBuffer);␊
891 currentExtentBlock = nextExtentBlock;␊
892 }␊
893␉␉␉␊
894 currentExtentSize = GetExtentSize(extentBuffer, nextExtent % extentDensity);␊
895␉␉␉␊
896 if ((countedBlocks + currentExtentSize - 1) >= blockNumber) {␊
897 currentExtent = extentBuffer + sizeofExtent * (nextExtent % extentDensity);␊
898 break;␊
899 }␊
900␉␉␉␊
901 countedBlocks += currentExtentSize;␊
902 }␊
903␉␉␊
904 readOffset = ((blockNumber - countedBlocks) * gBlockSize) +␊
905␉␉(offset % gBlockSize);␊
906␉␉␊
907␉␉// MacWen: fix overflow in multiplication by forcing 64bit multiplication␊
908 readSize = (long long)GetExtentSize(currentExtent, 0) * gBlockSize - readOffset;␊
909 if (readSize > (long long)(size - sizeRead)) readSize = size - sizeRead;␊
910␉␉␊
911 readOffset += (long long)GetExtentStart(currentExtent, 0) * gBlockSize;␊
912␉␉␊
913 CacheRead(gCurrentIH, bufferPos, gAllocationOffset + readOffset,␊
914 readSize, cache);␊
915␉␉␊
916 sizeRead += readSize;␊
917 offset += readSize;␊
918 bufferPos += readSize;␊
919 }␊
920␉␊
921 if (extentBuffer) free(extentBuffer);␊
922␉␊
923 return sizeRead;␊
924}␊
925␊
926static long GetExtentStart(void * extents, long index)␊
927{␊
928 long start;␊
929 HFSExtentDescriptor *hfsExtents = extents;␊
930 HFSPlusExtentDescriptor *hfsPlusExtents = extents;␊
931␉␊
932 if (gIsHFSPlus) start = SWAP_BE32(hfsPlusExtents[index].startBlock);␊
933 else start = SWAP_BE16(hfsExtents[index].startBlock);␊
934␉␊
935 return start;␊
936}␊
937␊
938static long GetExtentSize(void * extents, long index)␊
939{␊
940 long size;␊
941 HFSExtentDescriptor *hfsExtents = extents;␊
942 HFSPlusExtentDescriptor *hfsPlusExtents = extents;␊
943␉␊
944 if (gIsHFSPlus) size = SWAP_BE32(hfsPlusExtents[index].blockCount);␊
945 else size = SWAP_BE16(hfsExtents[index].blockCount);␊
946␉␊
947 return size;␊
948}␊
949␊
950static long CompareHFSCatalogKeys(void * key, void * testKey)␊
951{␊
952 HFSCatalogKey *searchKey, *trialKey;␊
953 long result, searchParentID, trialParentID;␊
954␉␊
955 searchKey = key;␊
956 trialKey = testKey;␊
957␉␊
958 searchParentID = SWAP_BE32(searchKey->parentID);␊
959 trialParentID = SWAP_BE32(trialKey->parentID);␊
960␉␊
961 // parent dirID is unsigned␊
962 if (searchParentID > trialParentID) result = 1;␊
963 else if (searchParentID < trialParentID) result = -1;␊
964 else {␊
965 // parent dirID's are equal, compare names␊
966 result = FastRelString(searchKey->nodeName, trialKey->nodeName);␊
967 }␊
968␉␊
969 return result;␊
970}␊
971␊
972static long CompareHFSPlusCatalogKeys(void * key, void * testKey)␊
973{␊
974 HFSPlusCatalogKey *searchKey, *trialKey;␊
975 long result, searchParentID, trialParentID;␊
976␉␊
977 searchKey = key;␊
978 trialKey = testKey;␊
979␉␊
980 searchParentID = SWAP_BE32(searchKey->parentID);␊
981 trialParentID = SWAP_BE32(trialKey->parentID);␊
982␉␊
983 // parent dirID is unsigned␊
984 if (searchParentID > trialParentID) result = 1;␊
985 else if (searchParentID < trialParentID) result = -1;␊
986 else {␊
987 // parent dirID's are equal, compare names␊
988 if ((searchKey->nodeName.length == 0) || (trialKey->nodeName.length == 0))␊
989 result = searchKey->nodeName.length - trialKey->nodeName.length;␊
990 else␊
991␉␉␉if (gCaseSensitive) {␊
992␉␉␉␉result = BinaryUnicodeCompare(&searchKey->nodeName.unicode[0],␊
993␉␉␉␉␉␉␉␉␉␉␉ SWAP_BE16(searchKey->nodeName.length),␊
994␉␉␉␉␉␉␉␉␉␉␉ &trialKey->nodeName.unicode[0],␊
995␉␉␉␉␉␉␉␉␉␉␉ SWAP_BE16(trialKey->nodeName.length));␊
996␉␉␉} else {␊
997␉␉␉␉result = FastUnicodeCompare(&searchKey->nodeName.unicode[0],␊
998␉␉␉␉␉␉␉␉␉␉␉SWAP_BE16(searchKey->nodeName.length),␊
999␉␉␉␉␉␉␉␉␉␉␉&trialKey->nodeName.unicode[0],␊
1000␉␉␉␉␉␉␉␉␉␉␉SWAP_BE16(trialKey->nodeName.length), OSBigEndian);␊
1001␉␉␉}␊
1002 }␊
1003␉␊
1004 return result;␊
1005}␊
1006␊
1007static long CompareHFSExtentsKeys(void * key, void * testKey)␊
1008{␊
1009 HFSExtentKey *searchKey, *trialKey;␊
1010 long result;␊
1011␉␊
1012 searchKey = key;␊
1013 trialKey = testKey;␊
1014␉␊
1015 // assume searchKey < trialKey␊
1016 result = -1; ␊
1017␉␊
1018 if (searchKey->fileID == trialKey->fileID) {␊
1019 // FileNum's are equal; compare fork types␊
1020 if (searchKey->forkType == trialKey->forkType) {␊
1021 // Fork types are equal; compare allocation block number␊
1022 if (searchKey->startBlock == trialKey->startBlock) {␊
1023 // Everything is equal␊
1024 result = 0;␊
1025 } else {␊
1026 // Allocation block numbers differ; determine sign␊
1027 if (SWAP_BE16(searchKey->startBlock) > SWAP_BE16(trialKey->startBlock))␊
1028 result = 1;␊
1029 }␊
1030 } else {␊
1031 // Fork types differ; determine sign␊
1032 if (searchKey->forkType > trialKey->forkType) result = 1;␊
1033 }␊
1034 } else {␊
1035 // FileNums differ; determine sign␊
1036 if (SWAP_BE32(searchKey->fileID) > SWAP_BE32(trialKey->fileID))␊
1037 result = 1;␊
1038 }␊
1039␉␊
1040 return result;␊
1041}␊
1042␊
1043static long CompareHFSPlusExtentsKeys(void * key, void * testKey)␊
1044{␊
1045 HFSPlusExtentKey *searchKey, *trialKey;␊
1046 long result;␊
1047␉␊
1048 searchKey = key;␊
1049 trialKey = testKey;␊
1050␉␊
1051 // assume searchKey < trialKey␊
1052 result = -1; ␊
1053␉␊
1054 if (searchKey->fileID == trialKey->fileID) {␊
1055 // FileNum's are equal; compare fork types␊
1056 if (searchKey->forkType == trialKey->forkType) {␊
1057 // Fork types are equal; compare allocation block number␊
1058 if (searchKey->startBlock == trialKey->startBlock) {␊
1059 // Everything is equal␊
1060 result = 0;␊
1061 } else {␊
1062 // Allocation block numbers differ; determine sign␊
1063 if (SWAP_BE32(searchKey->startBlock) > SWAP_BE32(trialKey->startBlock))␊
1064 result = 1;␊
1065 }␊
1066 } else {␊
1067 // Fork types differ; determine sign␊
1068 if (searchKey->forkType > trialKey->forkType) result = 1;␊
1069 }␊
1070 } else {␊
1071 // FileNums differ; determine sign␊
1072 if (SWAP_BE32(searchKey->fileID) > SWAP_BE32(trialKey->fileID))␊
1073 result = 1;␊
1074 }␊
1075␉␊
1076 return result;␊
1077}␊
1078␊
1079

Archive Download this file

Revision: 1977