Intravision/reactos
1
0
Fork 0
mirror of https://github.com/reactos/reactos.git synced 2024-12-28 01:55:19 +00:00
Code Issues Projects Releases Packages Wiki Activity

- Fixed the check for the empty (or not empty) dpc queue in KeInsertQueueDpc.

Browse source 
svn path=/trunk/; revision=11733
This commit is contained in:
Hartmut Birr 2004-11-21 10:48:33 +00:00
parent dc61134cf1
commit d69a931982
1 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
reactos/ntoskrnl/ke/dpc.c
View file

@ -19,7 +19,7 @@
* along with this program; if not, write to the Free Software * along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/ */
/* $Id: dpc.c,v 1.46 2004/11/21 06:51:18 ion Exp $ /* $Id: dpc.c,v 1.47 2004/11/21 10:48:33 hbirr Exp $
* *
* COPYRIGHT: See COPYING in the top level directory * COPYRIGHT: See COPYING in the top level directory
* PROJECT: ReactOS kernel * PROJECT: ReactOS kernel
@ -214,18 +214,18 @@ KeInsertQueueDpc (PKDPC Dpc,
return(FALSE); return(FALSE);
} }
/* Now we can play with the DPC safely */
Dpc->SystemArgument1=SystemArgument1;
Dpc->SystemArgument2=SystemArgument2;
Pcr->PrcbData.DpcData[0].DpcQueueDepth++;
Pcr->PrcbData.DpcData[0].DpcCount++;
/* Make sure the lists are free if the Queue is 0 */ /* Make sure the lists are free if the Queue is 0 */
if (Pcr->PrcbData.DpcData[0].DpcQueueDepth == 0) { if (Pcr->PrcbData.DpcData[0].DpcQueueDepth == 0) {
ASSERT(IsListEmpty(&Pcr->PrcbData.DpcData[0].DpcListHead)); ASSERT(IsListEmpty(&Pcr->PrcbData.DpcData[0].DpcListHead));
} else { } else {
ASSERT(!IsListEmpty(&Pcr->PrcbData.DpcData[0].DpcListHead)); ASSERT(!IsListEmpty(&Pcr->PrcbData.DpcData[0].DpcListHead));
} }
/* Now we can play with the DPC safely */
Dpc->SystemArgument1=SystemArgument1;
Dpc->SystemArgument2=SystemArgument2;
Pcr->PrcbData.DpcData[0].DpcQueueDepth++;
Pcr->PrcbData.DpcData[0].DpcCount++;
/* Insert the DPC into the list. HighImportance DPCs go at the beginning */ /* Insert the DPC into the list. HighImportance DPCs go at the beginning */
if (Dpc->Importance == HighImportance) { if (Dpc->Importance == HighImportance) {