Something went wrong. Try again.
Reactos
Something went wrong. Try again.
28 kB · 1001 lines
C
at master
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002/*++
Copyright (c) 1989-2000 Microsoft Corporation
Module Name:
PathSup.c
Abstract:
This module implements the Path Table support routines for Cdfs.
The path table on a CDROM is a condensed summary of the entire directory structure. It is stored on a number of contiguous sectors on the disk. Each directory on the disk has an entry in the path table. The entries are aligned on USHORT boundaries and MAY span sector boundaries. The entries are stored as a breadth-first search.
The first entry in the table contains the entry for the root. The next entries will consist of the contents of the root directory. The next entries will consist of the all the directories at the next level of the tree. The children of a given directory will be grouped together.
The directories are assigned ordinal numbers based on their position in the path table. The root dirctory is assigned ordinal value 1.
Path table sectors:
Ordinal 1 2 3 4 5 6 +-----------+ | Spanning | | Sectors | +----------------------------+ +------------------------+ | | | | | | | | | DirName | \ | a | b |c| | c | d | e | | | | | | | | | | Parent #| 1 | 1 | 1 | | | 2 | 2 | 3 | +----------------------------+ +------------------------+
Directory Tree:
\ (root)
/ \ / \ a b
/ \ \ / \ \ c d e
Path Table Entries:
- Position scan at known offset in the path table. Path Entry at this offset must exist and is known to be valid. Used when scanning for the children of a given directory.
- Position scan at known offset in the path table. Path Entry is known to start at this location but the bounds must be checked for validity.
- Move to next path entry in the table.
- Update a common path entry structure with the details of the on-disk structure. This is used to smooth out the differences in the on-disk structures.
- Update the filename in the in-memory path entry with the bytes off the disk. For Joliet disks we will have to convert to little endian. We assume that directories don't have version numbers.
--*/
#include "cdprocs.h"
//// The Bug check file id for this module//
#define BugCheckFileId (CDFS_BUG_CHECK_PATHSUP)
//// Local macros//
//// PRAW_PATH_ENTRY// CdRawPathEntry (// _In_ PIRP_CONTEXT IrpContext,// _In_ PPATH_ENUM_CONTEXT PathContext// );//
#define CdRawPathEntry(IC, PC) \ Add2Ptr( (PC)->Data, (PC)->DataOffset, PRAW_PATH_ENTRY )
//// Local support routines//
VOIDCdMapPathTableBlock ( _In_ PIRP_CONTEXT IrpContext, _In_ PFCB Fcb, _In_ LONGLONG BaseOffset, _Inout_ PPATH_ENUM_CONTEXT PathContext );
_Success_(return != FALSE)BOOLEANCdUpdatePathEntryFromRawPathEntry ( _In_ PIRP_CONTEXT IrpContext, _In_ ULONG Ordinal, _In_ BOOLEAN VerifyBounds, _In_ PPATH_ENUM_CONTEXT PathContext, _Out_ PPATH_ENTRY PathEntry );
#ifdef ALLOC_PRAGMA#pragma alloc_text(PAGE, CdFindPathEntry)#pragma alloc_text(PAGE, CdLookupPathEntry)#pragma alloc_text(PAGE, CdLookupNextPathEntry)#pragma alloc_text(PAGE, CdMapPathTableBlock)#pragma alloc_text(PAGE, CdUpdatePathEntryFromRawPathEntry)#pragma alloc_text(PAGE, CdUpdatePathEntryName)#endif
VOIDCdLookupPathEntry ( _In_ PIRP_CONTEXT IrpContext, _In_ ULONG PathEntryOffset, _In_ ULONG Ordinal, _In_ BOOLEAN VerifyBounds, _Inout_ PCOMPOUND_PATH_ENTRY CompoundPathEntry )
/*++
Routine Description:
This routine is called to initiate a walk through a path table. We are looking for a path table entry at location PathEntryOffset.
Arguments:
PathEntryOffset - This is our target point in the Path Table. We know that a path entry must begin at this point although we may have to verify the bounds.
Ordinal - Ordinal number for the directory at the PathEntryOffset above.
VerifyBounds - Indicates whether we need to check the validity of this entry.
CompoundPathEntry - PathEnumeration context and in-memory path entry. This has been initialized outside of this call.
Return Value:
None.
--*/
{ PPATH_ENUM_CONTEXT PathContext = &CompoundPathEntry->PathContext; LONGLONG CurrentBaseOffset;
PAGED_CODE();
// // Compute the starting base and starting path table offset. //
CurrentBaseOffset = SectorTruncate( PathEntryOffset );
// // Map the next block in the Path Table. //
CdMapPathTableBlock( IrpContext, IrpContext->Vcb->PathTableFcb, CurrentBaseOffset, PathContext );
// // Set up our current offset into the Path Context. //
PathContext->DataOffset = PathEntryOffset - PathContext->BaseOffset;
// // Update the in-memory structure for this path entry. //
(VOID) CdUpdatePathEntryFromRawPathEntry( IrpContext, Ordinal, VerifyBounds, &CompoundPathEntry->PathContext, &CompoundPathEntry->PathEntry );}
BOOLEANCdLookupNextPathEntry ( _In_ PIRP_CONTEXT IrpContext, _Inout_ PPATH_ENUM_CONTEXT PathContext, _Inout_ PPATH_ENTRY PathEntry )
/*++
Routine Description:
This routine is called to move to the next path table entry. We know the offset and the length of the current entry. We start by computing the offset of the next entry and determine if it is contained in the table. Then we check to see if we need to move to the next sector in the path table. We always map two sectors at a time so we don't have to deal with any path entries which span sectors. We move to the next sector if we are in the second sector of the current mapped data block.
We look up the next entry and update the path entry structure with the values out of the raw sector but don't update the CdName structure.
Arguments:
PathContext - Enumeration context for this scan of the path table.
PathEntry - In-memory representation of the on-disk path table entry.
Return Value:
BOOLEAN - TRUE if another entry is found, FALSE otherwise. This routine may raise on error.
--*/
{ LONGLONG CurrentBaseOffset;
PAGED_CODE();
// // Get the offset of the next path entry within the current // data block. //
PathContext->DataOffset += PathEntry->PathEntryLength;
// // If we are in the last data block then check if we are beyond the // end of the file. //
if (PathContext->LastDataBlock) {
if (PathContext->DataOffset >= PathContext->DataLength) {
return FALSE; }
// // If we are not in the last data block of the path table and // this offset is in the second sector then move to the next // data block. //
} else if (PathContext->DataOffset >= SECTOR_SIZE) {
CurrentBaseOffset = PathContext->BaseOffset + SECTOR_SIZE;
CdMapPathTableBlock( IrpContext, IrpContext->Vcb->PathTableFcb, CurrentBaseOffset, PathContext );
// // Set up our current offset into the Path Context. //
PathContext->DataOffset -= SECTOR_SIZE; }
// // Now update the path entry with the values from the on-disk // structure. //
return CdUpdatePathEntryFromRawPathEntry( IrpContext, PathEntry->Ordinal + 1, TRUE, PathContext, PathEntry );}
_Success_(return != FALSE)BOOLEANCdFindPathEntry ( _In_ PIRP_CONTEXT IrpContext, _In_ PFCB ParentFcb, _In_ PCD_NAME DirName, _In_ BOOLEAN IgnoreCase, _Inout_ PCOMPOUND_PATH_ENTRY CompoundPathEntry )
/*++
Routine Description:
This routine will walk through the path table looking for a matching entry for DirName among the child directories of the ParentFcb.
Arguments:
ParentFcb - This is the directory we are examining. We know the ordinal and path table offset for this directory in the path table. If this is the first scan for this Fcb we will update the first child offset for this directory in the path table.
DirName - This is the name we are searching for. This name will not contain wildcard characters. The name will also not have a version string.
IgnoreCase - Indicates if this search is exact or ignore case.
CompoundPathEntry - Complete path table enumeration structure. We will have initialized it for the search on entry. This will be positioned at the matching name if found.
Return Value:
BOOLEAN - TRUE if matching entry found, FALSE otherwise.
--*/
{ BOOLEAN Found = FALSE; BOOLEAN UpdateChildOffset = TRUE;
ULONG StartingOffset; ULONG StartingOrdinal;
PAGED_CODE();
// // Position ourselves at either the first child or at the directory itself. // Lock the Fcb to get this value and remember whether to update with the first // child. //
StartingOffset = CdQueryFidPathTableOffset( ParentFcb->FileId ); StartingOrdinal = ParentFcb->Ordinal;
// // ISO 9660 9.4.4 restricts the backpointer from child to parent in a // pathtable entry to 16bits. Although we internally store ordinals // as 32bit values, it is impossible to search for the children of a // directory whose ordinal value is greater than MAXUSHORT. Media that // could induce such a search is illegal. // // Note that it is not illegal to have more than MAXUSHORT directories. //
if (ParentFcb->Ordinal > MAXUSHORT) {
CdRaiseStatus( IrpContext, STATUS_DISK_CORRUPT_ERROR ); }
CdLockFcb( IrpContext, ParentFcb );
if (ParentFcb->ChildPathTableOffset != 0) {
StartingOffset = ParentFcb->ChildPathTableOffset; StartingOrdinal = ParentFcb->ChildOrdinal; UpdateChildOffset = FALSE;
} else if (ParentFcb == ParentFcb->Vcb->RootIndexFcb) {
UpdateChildOffset = FALSE; }
CdUnlockFcb( IrpContext, ParentFcb );
CdLookupPathEntry( IrpContext, StartingOffset, StartingOrdinal, FALSE, CompoundPathEntry );
// // Loop until we find a match or are beyond the children for this directory. //
do {
// // If we are beyond this directory then return FALSE. //
if (CompoundPathEntry->PathEntry.ParentOrdinal > ParentFcb->Ordinal) {
// // Update the Fcb with the offsets for the children in the path table. //
if (UpdateChildOffset) {
CdLockFcb( IrpContext, ParentFcb );
ParentFcb->ChildPathTableOffset = StartingOffset; ParentFcb->ChildOrdinal = StartingOrdinal;
CdUnlockFcb( IrpContext, ParentFcb ); }
break; }
// // If we are within the children of this directory then check for a match. //
if (CompoundPathEntry->PathEntry.ParentOrdinal == ParentFcb->Ordinal) {
// // Update the child offset if not yet done. //
if (UpdateChildOffset) {
CdLockFcb( IrpContext, ParentFcb );
ParentFcb->ChildPathTableOffset = CompoundPathEntry->PathEntry.PathTableOffset; ParentFcb->ChildOrdinal = CompoundPathEntry->PathEntry.Ordinal;
CdUnlockFcb( IrpContext, ParentFcb );
UpdateChildOffset = FALSE; }
// // Update the name in the path entry. //
CdUpdatePathEntryName( IrpContext, &CompoundPathEntry->PathEntry, IgnoreCase );
// // Now compare the names for an exact match. //
if (CdIsNameInExpression( IrpContext, &CompoundPathEntry->PathEntry.CdCaseDirName, DirName, 0, FALSE )) {
// // Let our caller know we have a match. //
Found = TRUE; break; } }
// // Go to the next entry in the path table. Remember the current position // in the event we update the Fcb. //
StartingOffset = CompoundPathEntry->PathEntry.PathTableOffset; StartingOrdinal = CompoundPathEntry->PathEntry.Ordinal;
} while (CdLookupNextPathEntry( IrpContext, &CompoundPathEntry->PathContext, &CompoundPathEntry->PathEntry ));
return Found;}
//// Local support routine//
VOIDCdMapPathTableBlock ( _In_ PIRP_CONTEXT IrpContext, _In_ PFCB Fcb, _In_ LONGLONG BaseOffset, _Inout_ PPATH_ENUM_CONTEXT PathContext )
/*++
Routine Description:
This routine is called to map (or allocate and copy) the next data block in the path table. We check if the next block will span a view boundary and allocate an auxilary buffer in that case.
Arguments:
Fcb - This is the Fcb for the Path Table.
BaseOffset - Offset of the first sector to map. This will be on a sector boundary.
PathContext - Enumeration context to update in this routine.
Return Value:
None.
--*/
{ ULONG CurrentLength; ULONG SectorSize; ULONG DataOffset; ULONG PassCount; PVOID Sector;
PAGED_CODE();
UNREFERENCED_PARAMETER( IrpContext );
// // Map the new block and set the enumeration context to this // point. Allocate an auxilary buffer if necessary. //
CurrentLength = 2 * SECTOR_SIZE;
if (CurrentLength >= (ULONG) (Fcb->FileSize.QuadPart - BaseOffset)) {
CurrentLength = (ULONG) (Fcb->FileSize.QuadPart - BaseOffset);
// // We know this is the last data block for this // path table. //
PathContext->LastDataBlock = TRUE; }
// // Set context values. //
PathContext->BaseOffset = (ULONG) BaseOffset; PathContext->DataLength = CurrentLength;
// // Drop the previous sector's mapping //
CdUnpinData( IrpContext, &PathContext->Bcb );
// // Check if spanning a view section. The following must // be true before we take this step. // // Data length is more than one sector. // Starting offset must be one sector before the // cache manager VACB boundary. //
if ((CurrentLength > SECTOR_SIZE) && (FlagOn( ((ULONG) BaseOffset), VACB_MAPPING_MASK ) == LAST_VACB_SECTOR_OFFSET )) {
// // Map each sector individually and store into an auxilary // buffer. //
SectorSize = SECTOR_SIZE; DataOffset = 0; PassCount = 2;
PathContext->Data = FsRtlAllocatePoolWithTag( CdPagedPool, CurrentLength, TAG_SPANNING_PATH_TABLE ); PathContext->AllocatedData = TRUE;
while (PassCount--) {
CcMapData( Fcb->FileObject, (PLARGE_INTEGER) &BaseOffset, SectorSize, TRUE, &PathContext->Bcb, &Sector );
RtlCopyMemory( Add2Ptr( PathContext->Data, DataOffset, PVOID ), Sector, SectorSize );
CdUnpinData( IrpContext, &PathContext->Bcb );
BaseOffset += SECTOR_SIZE; SectorSize = CurrentLength - SECTOR_SIZE; DataOffset = SECTOR_SIZE; }
// // Otherwise we can just map the data into the cache. //
} else {
// // There is a slight chance that we have allocated an // auxilary buffer on the previous sector. //
if (PathContext->AllocatedData) {
CdFreePool( &PathContext->Data ); PathContext->AllocatedData = FALSE; }
CcMapData( Fcb->FileObject, (PLARGE_INTEGER) &BaseOffset, CurrentLength, TRUE, &PathContext->Bcb, &PathContext->Data ); }
return;}
//// Local support routine//_Success_(return != FALSE)BOOLEANCdUpdatePathEntryFromRawPathEntry ( _In_ PIRP_CONTEXT IrpContext, _In_ ULONG Ordinal, _In_ BOOLEAN VerifyBounds, _In_ PPATH_ENUM_CONTEXT PathContext, _Out_ PPATH_ENTRY PathEntry )
/*++
Routine Description:
This routine is called to update the in-memory Path Entry from the on-disk path entry. We also do a careful check of the bounds if requested and we are in the last data block of the path table.
Arguments:
Ordinal - Ordinal number for this directory.
VerifyBounds - Check that the current raw Path Entry actually fits within the data block.
PathContext - Current path table enumeration context.
PathEntry - Pointer to the in-memory path entry structure.
Return Value:
TRUE if updated ok, FALSE if we've hit the end of the pathtable - zero name length && PT size is a multiple of blocksize. This is a workaround for some Video CDs. Win 9x works around this.
This routine may raise.
--*/
{ PRAW_PATH_ENTRY RawPathEntry = CdRawPathEntry( IrpContext, PathContext ); ULONG RemainingDataLength;
PAGED_CODE();
// // Check for a name length of zero. This is the first byte of the record, // and there must be at least one byte remaining in the buffer else we // wouldn't be here (caller would have spotted buffer end). //
PathEntry->DirNameLen = CdRawPathIdLen( IrpContext, RawPathEntry );
if (0 == PathEntry->DirNameLen) {
// // If we are in the last block, and the path table size (ie last block) is a // multiple of block size, then we will consider this the end of the path table // rather than raising an error. Workaround for NTI Cd Maker video CDs which // round path table length to blocksize multiple. In all other cases we consider // a zero length name to be corruption. //
if ( PathContext->LastDataBlock && (0 == BlockOffset( IrpContext->Vcb, PathContext->DataLength))) {
return FALSE; }
CdRaiseStatus( IrpContext, STATUS_DISK_CORRUPT_ERROR ); }
// // Check if we should verify the path entry. If we are not in the last // data block then there is nothing to check. //
if (PathContext->LastDataBlock && VerifyBounds) {
// // Quick check to see if the maximum size is still available. This // will handle most cases and we don't need to access any of the // fields. //
RemainingDataLength = PathContext->DataLength - PathContext->DataOffset;
if (RemainingDataLength < sizeof( RAW_PATH_ENTRY )) {
// // Make sure the remaining bytes hold the path table entries. // Do the following checks. // // - A minimal path table entry will fit (and then check) // - This path table entry (with dir name) will fit. //
if ((RemainingDataLength < MIN_RAW_PATH_ENTRY_LEN) || (RemainingDataLength < (ULONG) (CdRawPathIdLen( IrpContext, RawPathEntry ) + MIN_RAW_PATH_ENTRY_LEN - 1))) {
CdRaiseStatus( IrpContext, STATUS_DISK_CORRUPT_ERROR ); } } }
// // The ordinal number of this directory is passed in. // Compute the path table offset of this entry. //
PathEntry->Ordinal = Ordinal; PathEntry->PathTableOffset = PathContext->BaseOffset + PathContext->DataOffset;
// // We know we can safely access all of the fields of the raw path table at // this point.
// // Bias the disk offset by the number of logical blocks //
CopyUchar4( &PathEntry->DiskOffset, CdRawPathLoc( IrpContext, RawPathEntry ));
PathEntry->DiskOffset += CdRawPathXar( IrpContext, RawPathEntry );
CopyUchar2( &PathEntry->ParentOrdinal, &RawPathEntry->ParentNum );
PathEntry->PathEntryLength = PathEntry->DirNameLen + MIN_RAW_PATH_ENTRY_LEN - 1;
// // Align the path entry length on a ushort boundary. //
PathEntry->PathEntryLength = WordAlign( PathEntry->PathEntryLength );
PathEntry->DirName = (PCHAR)RawPathEntry->DirId;
return TRUE;}
//// Local support routine//
VOIDCdUpdatePathEntryName ( _In_ PIRP_CONTEXT IrpContext, _Inout_ PPATH_ENTRY PathEntry, _In_ BOOLEAN IgnoreCase )
/*++
Routine Description:
This routine will store the directory name into the CdName in the path entry. If this is a Joliet name then we will make sure we have an allocated buffer and need to convert from big endian to little endian. We also correctly update the case name. If this operation is ignore case then we need an auxilary buffer for the name.
For an Ansi disk we can use the name from the disk for the exact case. We only need to allocate a buffer for the ignore case name. The on-disk representation of a Unicode name is useless for us. In this case we will need a name buffer for both names. We store a buffer in the PathEntry which can hold two 8.3 unicode names. This means we will almost never need to allocate a buffer in the Ansi case (we only need one buffer and already have 48 characters).
Arguments:
PathEntry - Pointer to a path entry structure. We have already updated this path entry with the values from the raw path entry.
Return Value:
None.
--*/
{ ULONG Length; NTSTATUS Status;
PAGED_CODE();
// // Check if this is a self entry. We use a fixed string for this. // // Self-Entry - Length is 1, value is 0. //
if ((*PathEntry->DirName == 0) && (PathEntry->DirNameLen == 1)) {
// // There should be no allocated buffers. //
NT_ASSERT( !FlagOn( PathEntry->Flags, PATH_ENTRY_FLAG_ALLOC_BUFFER ));
// // Now use one of the hard coded directory names. //
PathEntry->CdDirName.FileName = CdUnicodeDirectoryNames[0];
// // Show that there is no version number. //
PathEntry->CdDirName.VersionString.Length = 0;
// // The case name is identical. //
PathEntry->CdCaseDirName = PathEntry->CdDirName;
// // Return now. //
return; }
// // Compute how large a buffer we will need. If this is an ignore // case operation then we will want a double size buffer. If the disk is not // a Joliet disk then we might need two bytes for each byte in the name. //
Length = PathEntry->DirNameLen;
if (IgnoreCase) {
Length *= 2; }
if (!FlagOn( IrpContext->Vcb->VcbState, VCB_STATE_JOLIET )) {
Length *= sizeof( WCHAR ); }
// // Now decide if we need to allocate a new buffer. We will if // this name won't fit in the embedded name buffer and it is // larger than the current allocated buffer. We always use the // allocated buffer if present. // // If we haven't allocated a buffer then use the embedded buffer if the data // will fit. This is the typical case. //
if (!FlagOn( PathEntry->Flags, PATH_ENTRY_FLAG_ALLOC_BUFFER ) && (Length <= sizeof( PathEntry->NameBuffer ))) {
PathEntry->CdDirName.FileName.MaximumLength = sizeof( PathEntry->NameBuffer ); PathEntry->CdDirName.FileName.Buffer = PathEntry->NameBuffer;
} else {
// // We need to use an allocated buffer. Check if the current buffer // is large enough. //
if (Length > PathEntry->CdDirName.FileName.MaximumLength) {
// // Free any allocated buffer. //
if (FlagOn( PathEntry->Flags, PATH_ENTRY_FLAG_ALLOC_BUFFER )) {
CdFreePool( &PathEntry->CdDirName.FileName.Buffer ); ClearFlag( PathEntry->Flags, PATH_ENTRY_FLAG_ALLOC_BUFFER ); }
PathEntry->CdDirName.FileName.Buffer = FsRtlAllocatePoolWithTag( CdPagedPool, Length, TAG_PATH_ENTRY_NAME );
SetFlag( PathEntry->Flags, PATH_ENTRY_FLAG_ALLOC_BUFFER );
PathEntry->CdDirName.FileName.MaximumLength = (USHORT) Length; } }
// // We now have a buffer for the name. We need to either convert the on-disk bigendian // to little endian or covert the name to Unicode. //
if (!FlagOn( IrpContext->Vcb->VcbState, VCB_STATE_JOLIET )) {
Status = RtlOemToUnicodeN( PathEntry->CdDirName.FileName.Buffer, PathEntry->CdDirName.FileName.MaximumLength, &Length, PathEntry->DirName, PathEntry->DirNameLen );
NT_ASSERT( Status == STATUS_SUCCESS ); __analysis_assert( Status == STATUS_SUCCESS ); PathEntry->CdDirName.FileName.Length = (USHORT) Length;
} else {
// // Convert this string to little endian. //
CdConvertBigToLittleEndian( IrpContext, PathEntry->DirName, PathEntry->DirNameLen, (PCHAR) PathEntry->CdDirName.FileName.Buffer );
PathEntry->CdDirName.FileName.Length = (USHORT) PathEntry->DirNameLen; }
// // There is no version string. //
PathEntry->CdDirName.VersionString.Length = PathEntry->CdCaseDirName.VersionString.Length = 0;
// // If the name string ends with a period then knock off the last // character. //
if (PathEntry->CdDirName.FileName.Buffer[(PathEntry->CdDirName.FileName.Length - sizeof( WCHAR )) / 2] == L'.') {
// // Shrink the filename length. //
PathEntry->CdDirName.FileName.Length -= sizeof( WCHAR ); }
// // Update the case name buffer if necessary. If this is an exact case // operation then just copy the exact case string. //
if (IgnoreCase) {
PathEntry->CdCaseDirName.FileName.Buffer = Add2Ptr( PathEntry->CdDirName.FileName.Buffer, PathEntry->CdDirName.FileName.MaximumLength / 2, PWCHAR);
PathEntry->CdCaseDirName.FileName.MaximumLength = PathEntry->CdDirName.FileName.MaximumLength / 2;
CdUpcaseName( IrpContext, &PathEntry->CdDirName, &PathEntry->CdCaseDirName );
} else {
PathEntry->CdCaseDirName = PathEntry->CdDirName; }
return;}