AML_NODE_HEADER *\r
EFIAPI\r
AmlGetNextSibling (\r
- IN CONST AML_NODE_HEADER * Node,\r
- IN CONST AML_NODE_HEADER * ChildNode\r
+ IN CONST AML_NODE_HEADER *Node,\r
+ IN CONST AML_NODE_HEADER *ChildNode\r
);\r
\r
/** Get the previous sibling node among the children of the input Node.\r
AML_NODE_HEADER *\r
EFIAPI\r
AmlGetPreviousSibling (\r
- IN CONST AML_NODE_HEADER * Node,\r
- IN CONST AML_NODE_HEADER * ChildNode\r
+ IN CONST AML_NODE_HEADER *Node,\r
+ IN CONST AML_NODE_HEADER *ChildNode\r
);\r
\r
/** Iterate through the nodes in the same order as the AML bytestream.\r
AML_NODE_HEADER *\r
EFIAPI\r
AmlGetNextNode (\r
- IN CONST AML_NODE_HEADER * Node\r
+ IN CONST AML_NODE_HEADER *Node\r
);\r
\r
/** Iterate through the nodes in the reverse order of the AML bytestream.\r
AML_NODE_HEADER *\r
EFIAPI\r
AmlGetPreviousNode (\r
- IN CONST AML_NODE_HEADER * Node\r
+ IN CONST AML_NODE_HEADER *Node\r
);\r
\r
#endif // AML_TREE_TRAVERSAL_H_\r
-\r