Searched refs:pNode (Results 1 - 7 of 7) sorted by relevance

/frameworks/compile/mclinker/lib/ADT/GraphLite/
H A DListDigraph.cpp98 void ListDigraph::erase(ListDigraph::Node& pNode) argument
101 if (NULL != pNode.next) {
102 pNode.next->prev = pNode.prev;
105 if (NULL != pNode.prev) {
106 pNode.prev->next = pNode.next;
108 else { // pNode.prev is NULL => pNode is the head
109 m_pNodeHead = pNode
[all...]
H A DDigraph.cpp66 void Digraph::erase(const Digraph::Node& pNode) argument
/frameworks/compile/mclinker/include/mcld/ADT/GraphLite/
H A DListDigraph.h64 void erase(Node& pNode);
70 void getHead(Node*& pNode) const { pNode = m_pNodeHead; }
H A DDigraph.h66 void erase(const Node& pNode);
/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h248 virtual void move(TreeIteratorBase& pNode) const = 0;
260 void move(TreeIteratorBase& pNode) const {
261 pNode.move<Positional>();
273 void move(TreeIteratorBase& pNode) const {
274 pNode.move<Inclusive>();
/frameworks/compile/mclinker/include/mcld/ADT/
H A DTreeBase.h61 void hook(NodeBase* pNode) { assert(0 && "not allowed"); } argument
H A DBinTree.h323 void destroyNode(NodeType *pNode) { argument
324 pNode->left = pNode->right = 0;
325 pNode->data = 0;
326 m_Root.deallocate(pNode);

Completed in 116 milliseconds