**/\r
BOOLEAN\r
EFIAPI\r
-IsNodeInList (\r
+InternalBaseLibIsNodeInList (\r
IN CONST LIST_ENTRY *List,\r
IN CONST LIST_ENTRY *Node\r
)\r
//\r
// ASSERT List not too long and Entry is not one of the nodes of List\r
//\r
- ASSERT (!IsNodeInList (ListHead, Entry));\r
+ ASSERT (!InternalBaseLibIsNodeInList (ListHead, Entry));\r
\r
Entry->ForwardLink = ListHead->ForwardLink;\r
Entry->BackLink = ListHead;\r
//\r
// ASSERT List not too long and Entry is not one of the nodes of List\r
//\r
- ASSERT (!IsNodeInList (ListHead, Entry));\r
+ ASSERT (!InternalBaseLibIsNodeInList (ListHead, Entry));\r
\r
Entry->ForwardLink = ListHead;\r
Entry->BackLink = ListHead->BackLink;\r
//\r
// ASSERT List not too long\r
//\r
- ASSERT (IsNodeInList (List, List));\r
+ ASSERT (InternalBaseLibIsNodeInList (List, List));\r
\r
return List->ForwardLink;\r
}\r
//\r
// ASSERT List not too long and Node is one of the nodes of List\r
//\r
- ASSERT (IsNodeInList (List, Node));\r
+ ASSERT (InternalBaseLibIsNodeInList (List, Node));\r
\r
return Node->ForwardLink;\r
}\r
//\r
// ASSERT List not too long\r
//\r
- ASSERT (IsNodeInList (ListHead, ListHead));\r
+ ASSERT (InternalBaseLibIsNodeInList (ListHead, ListHead));\r
\r
return (BOOLEAN)(ListHead->ForwardLink == ListHead);\r
}\r
//\r
// ASSERT List not too long and Node is one of the nodes of List\r
//\r
- ASSERT (IsNodeInList (List, Node));\r
+ ASSERT (InternalBaseLibIsNodeInList (List, Node));\r
\r
return (BOOLEAN)(Node == List);\r
}\r
//\r
// ASSERT List not too long and Node is one of the nodes of List\r
//\r
- ASSERT (IsNodeInList (List, Node));\r
+ ASSERT (InternalBaseLibIsNodeInList (List, Node));\r
\r
return (BOOLEAN)(!IsNull (List, Node) && List->BackLink == Node);\r
}\r
//\r
// ASSERT Entry1 and Entry2 are in the same linked list\r
//\r
- ASSERT (IsNodeInList (FirstEntry, SecondEntry));\r
+ ASSERT (InternalBaseLibIsNodeInList (FirstEntry, SecondEntry));\r
\r
//\r
// Ptr is the node pointed to by FirstEntry->ForwardLink\r