Intravision/reactos
1
0
Fork 0
mirror of https://github.com/reactos/reactos.git synced 2025-08-05 21:32:56 +00:00
Code Issues Projects Releases Packages Wiki Activity

fix warnings

Browse source 
svn path=/trunk/; revision=25594
This commit is contained in:
Sylvain Petreolle 2007-01-22 10:35:52 +00:00
parent b440bf6fae
commit 85ff81ad42
1 changed files with 7 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

14
reactos/ntoskrnl/ex/handle.c
View file

@ -321,7 +321,7 @@ ExpFreeHandleTableEntry(IN PHANDLE_TABLE HandleTable,
/* Get the current value and write */ /* Get the current value and write */
OldValue = *Free; OldValue = *Free;
HandleTableEntry->NextFreeTableEntry = (ULONG)OldValue; HandleTableEntry->NextFreeTableEntry = (ULONG)OldValue;
if (InterlockedCompareExchange(Free, NewValue, OldValue) == OldValue) if (InterlockedCompareExchange((PLONG) Free, NewValue, OldValue) == OldValue)
{ {
/* Break out, we're done. Make sure the handle value makes sense */ /* Break out, we're done. Make sure the handle value makes sense */
ASSERT((OldValue & FREE_HANDLE_MASK) < ASSERT((OldValue & FREE_HANDLE_MASK) <
@ -596,7 +596,7 @@ ExpAllocateHandleTableEntrySlow(IN PHANDLE_TABLE HandleTable,
} }
/* Update the index of the next handle */ /* Update the index of the next handle */
Index = InterlockedExchangeAdd(&HandleTable->NextHandleNeedingPool, Index = InterlockedExchangeAdd((PLONG) &HandleTable->NextHandleNeedingPool,
SizeOfHandle(LOW_LEVEL_ENTRIES)); SizeOfHandle(LOW_LEVEL_ENTRIES));
/* Check if need to initialize the table */ /* Check if need to initialize the table */
@ -613,7 +613,7 @@ ExpAllocateHandleTableEntrySlow(IN PHANDLE_TABLE HandleTable,
Low[LOW_LEVEL_ENTRIES - 1].NextFreeTableEntry = FirstFree; Low[LOW_LEVEL_ENTRIES - 1].NextFreeTableEntry = FirstFree;
/* Change the index */ /* Change the index */
NewFree = InterlockedCompareExchange(&HandleTable->FirstFree, NewFree = InterlockedCompareExchange((PLONG) &HandleTable->FirstFree,
Index, Index,
FirstFree); FirstFree);
if (NewFree == FirstFree) break; if (NewFree == FirstFree) break;
@ -631,7 +631,7 @@ ExpMoveFreeHandles(IN PHANDLE_TABLE HandleTable)
ULONG LastFree, i; ULONG LastFree, i;
/* Clear the last free index */ /* Clear the last free index */
LastFree = InterlockedExchange(&HandleTable->LastFree, 0); LastFree = InterlockedExchange((PLONG) &HandleTable->LastFree, 0);
/* Check if we had no index */ /* Check if we had no index */
if (!LastFree) return LastFree; if (!LastFree) return LastFree;
@ -647,7 +647,7 @@ ExpMoveFreeHandles(IN PHANDLE_TABLE HandleTable)
if (!HandleTable->StrictFIFO) if (!HandleTable->StrictFIFO)
{ {
/* Update the first free index */ /* Update the first free index */
if (!InterlockedCompareExchange(&HandleTable->FirstFree, LastFree, 0)) if (!InterlockedCompareExchange((PLONG) &HandleTable->FirstFree, LastFree, 0))
{ {
/* We're done, exit */ /* We're done, exit */
return LastFree; return LastFree;
@ -744,7 +744,7 @@ ExpAllocateHandleTableEntry(IN PHANDLE_TABLE HandleTable,
/* Now get the next value and do the compare */ /* Now get the next value and do the compare */
NewValue = Entry->NextFreeTableEntry; NewValue = Entry->NextFreeTableEntry;
NewValue1 = InterlockedCompareExchange(&HandleTable->FirstFree, NewValue1 = InterlockedCompareExchange((PLONG) &HandleTable->FirstFree,
NewValue, NewValue,
OldValue); OldValue);
@ -911,7 +911,7 @@ ExUnlockHandleTableEntry(IN PHANDLE_TABLE HandleTable,
(KeGetCurrentIrql() == APC_LEVEL)); (KeGetCurrentIrql() == APC_LEVEL));
/* Set the lock bit and make sure it wasn't earlier */ /* Set the lock bit and make sure it wasn't earlier */
OldValue = InterlockedOr(&HandleTableEntry->Value, OldValue = InterlockedOr((PLONG) &HandleTableEntry->Value,
EXHANDLE_TABLE_ENTRY_LOCK_BIT); EXHANDLE_TABLE_ENTRY_LOCK_BIT);
ASSERT((OldValue & EXHANDLE_TABLE_ENTRY_LOCK_BIT) == 0); ASSERT((OldValue & EXHANDLE_TABLE_ENTRY_LOCK_BIT) == 0);