sravan/system76-edk2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rename BaseLib internal functions by adding InternalBaseLib.

Browse Source 
git-svn-id: https://edk2.svn.sourceforge.net/svnroot/edk2/trunk/edk2@8980 6f19259b-4bc3-4df7-8a09-765794883524
This commit is contained in:
lgao4
2009-07-23 01:43:04 +00:00
parent 88e349f1fe
commit 80151e5331
3 changed files with 29 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -37,7 +37,7 @@
**/
BOOLEAN
EFIAPI
IsNodeInList (
InternalBaseLibIsNodeInList (
IN CONST LIST_ENTRY *List,
IN CONST LIST_ENTRY *Node
)
@@ -136,7 +136,7 @@ InsertHeadList (
//
// ASSERT List not too long and Entry is not one of the nodes of List
//
ASSERT (!IsNodeInList (ListHead, Entry));
ASSERT (!InternalBaseLibIsNodeInList (ListHead, Entry));
Entry->ForwardLink = ListHead->ForwardLink;
Entry->BackLink = ListHead;
@@ -177,7 +177,7 @@ InsertTailList (
//
// ASSERT List not too long and Entry is not one of the nodes of List
//
ASSERT (!IsNodeInList (ListHead, Entry));
ASSERT (!InternalBaseLibIsNodeInList (ListHead, Entry));
Entry->ForwardLink = ListHead;
Entry->BackLink = ListHead->BackLink;
@@ -215,7 +215,7 @@ GetFirstNode (
//
// ASSERT List not too long
//
ASSERT (IsNodeInList (List, List));
ASSERT (InternalBaseLibIsNodeInList (List, List));
return List->ForwardLink;
}
@@ -252,7 +252,7 @@ GetNextNode (
//
// ASSERT List not too long and Node is one of the nodes of List
//
ASSERT (IsNodeInList (List, Node));
ASSERT (InternalBaseLibIsNodeInList (List, Node));
return Node->ForwardLink;
}
@@ -285,7 +285,7 @@ IsListEmpty (
//
// ASSERT List not too long
//
ASSERT (IsNodeInList (ListHead, ListHead));
ASSERT (InternalBaseLibIsNodeInList (ListHead, ListHead));
return (BOOLEAN)(ListHead->ForwardLink == ListHead);
}
@@ -325,7 +325,7 @@ IsNull (
//
// ASSERT List not too long and Node is one of the nodes of List
//
ASSERT (IsNodeInList (List, Node));
ASSERT (InternalBaseLibIsNodeInList (List, Node));
return (BOOLEAN)(Node == List);
}
@@ -363,7 +363,7 @@ IsNodeAtEnd (
//
// ASSERT List not too long and Node is one of the nodes of List
//
ASSERT (IsNodeInList (List, Node));
ASSERT (InternalBaseLibIsNodeInList (List, Node));
return (BOOLEAN)(!IsNull (List, Node) && List->BackLink == Node);
}
@@ -409,7 +409,7 @@ SwapListEntries (
//
// ASSERT Entry1 and Entry2 are in the same linked list
//
ASSERT (IsNodeInList (FirstEntry, SecondEntry));
ASSERT (InternalBaseLibIsNodeInList (FirstEntry, SecondEntry));
//
// Ptr is the node pointed to by FirstEntry->ForwardLink