tyler.durden
/
audk
mirror of https://github.com/acidanthera/audk.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Modify MDE source code according to MDE library update. 

git-svn-id: https://edk2.svn.sourceforge.net/svnroot/edk2/trunk/edk2@6103 6f19259b-4bc3-4df7-8a09-765794883524
This commit is contained in:
xli24 2008-10-11 12:32:19 +00:00
parent e500088c2d
commit aa0583c783
2 changed files with 23 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
MdePkg/Include/Library/BaseLib.h
View File

@ -1370,7 +1370,7 @@ BcdToDecimal8 (
LIST_ENTRY * LIST_ENTRY *
EFIAPI EFIAPI
InitializeListHead ( InitializeListHead (
IN LIST_ENTRY *ListHead IN OUT LIST_ENTRY *ListHead
); );
@ -1398,8 +1398,8 @@ InitializeListHead (
LIST_ENTRY * LIST_ENTRY *
EFIAPI EFIAPI
InsertHeadList ( InsertHeadList (
IN LIST_ENTRY *ListHead, IN OUT LIST_ENTRY *ListHead,
IN LIST_ENTRY *Entry IN OUT LIST_ENTRY *Entry
); );
@ -1427,8 +1427,8 @@ InsertHeadList (
LIST_ENTRY * LIST_ENTRY *
EFIAPI EFIAPI
InsertTailList ( InsertTailList (
IN LIST_ENTRY *ListHead, IN OUT LIST_ENTRY *ListHead,
IN LIST_ENTRY *Entry IN OUT LIST_ENTRY *Entry
); );
@ -1513,11 +1513,13 @@ IsListEmpty (
/** /**
Determines if a node in a doubly linked list is null. Determines if a node in a doubly linked list is the head node of a the same
doubly linked list. This function is typically used to terminate a loop that
traverses all the nodes in a doubly linked list starting with the head node.
Returns FALSE if Node is one of the nodes in the doubly linked list specified Returns TRUE if Node is equal to List. Returns FALSE if Node is one of the
by List. Otherwise, TRUE is returned. List must have been initialized with nodes in the doubly linked list specified by List. List must have been
InitializeListHead(). initialized with InitializeListHead().
If List is NULL, then ASSERT(). If List is NULL, then ASSERT().
If Node is NULL, then ASSERT(). If Node is NULL, then ASSERT().
@ -1600,8 +1602,8 @@ IsNodeAtEnd (
LIST_ENTRY * LIST_ENTRY *
EFIAPI EFIAPI
SwapListEntries ( SwapListEntries (
IN LIST_ENTRY *FirstEntry, IN OUT LIST_ENTRY *FirstEntry,
IN LIST_ENTRY *SecondEntry IN OUT LIST_ENTRY *SecondEntry
); );
@ -3081,7 +3083,7 @@ InitializeSpinLock (
SPIN_LOCK * SPIN_LOCK *
EFIAPI EFIAPI
AcquireSpinLock ( AcquireSpinLock (
IN SPIN_LOCK *SpinLock IN OUT SPIN_LOCK *SpinLock
); );
@ -3105,7 +3107,7 @@ AcquireSpinLock (
BOOLEAN BOOLEAN
EFIAPI EFIAPI
AcquireSpinLockOrFail ( AcquireSpinLockOrFail (
IN SPIN_LOCK *SpinLock IN OUT SPIN_LOCK *SpinLock
); );
@ -3126,7 +3128,7 @@ AcquireSpinLockOrFail (
SPIN_LOCK * SPIN_LOCK *
EFIAPI EFIAPI
ReleaseSpinLock ( ReleaseSpinLock (
IN SPIN_LOCK *SpinLock IN OUT SPIN_LOCK *SpinLock
); );

12
MdePkg/Library/BaseLib/LinkedList.c
View File

@ -1,7 +1,7 @@
/** @file /** @file
Linked List Library Functions. Linked List Library Functions.
Copyright (c) 2006, Intel Corporation<BR> Copyright (c) 2006 - 2008, Intel Corporation<BR>
All rights reserved. This program and the accompanying materials All rights reserved. This program and the accompanying materials
are licensed and made available under the terms and conditions of the BSD License are licensed and made available under the terms and conditions of the BSD License
which accompanies this distribution. The full text of the license may be found at which accompanies this distribution. The full text of the license may be found at
@ -289,11 +289,13 @@ IsListEmpty (
} }
/** /**
Determines if a node in a doubly linked list is null. Determines if a node in a doubly linked list is the head node of a the same
doubly linked list. This function is typically used to terminate a loop that
traverses all the nodes in a doubly linked list starting with the head node.
Returns FALSE if Node is one of the nodes in the doubly linked list specified Returns TRUE if Node is equal to List. Returns FALSE if Node is one of the
by List. Otherwise, TRUE is returned. List must have been initialized with nodes in the doubly linked list specified by List. List must have been
InitializeListHead(). initialized with InitializeListHead().
If List is NULL, then ASSERT(). If List is NULL, then ASSERT().
If Node is NULL, then ASSERT(). If Node is NULL, then ASSERT().