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

/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h103 virtual void move(TreeIteratorBase& pNode) const = 0;
114 virtual void move(TreeIteratorBase& pNode) const {
115 pNode.move<Positional>();
127 virtual void move(TreeIteratorBase& pNode) const {
128 pNode.move<Inclusive>();
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h326 void destroyNode(NodeType *pNode) { argument
327 pNode->left = pNode->right = 0;
328 pNode->data = 0;
329 m_Root.deallocate(pNode);
/frameworks/compile/mclinker/lib/Fragment/
H A DFragmentGraph.cpp371 bool FragmentGraph::getEdges(FGNode& pNode, EdgeListType& pEdges) argument
373 // Traverse all regular nodes to find the connection to pNode
377 uint32_t weight = m_pMatrix->at(pNode.getIndex(), node_to.getIndex());
380 pEdges.push_back(FGEdge(pNode, node_to, weight));
/frameworks/compile/mclinker/include/mcld/Fragment/
H A DFragmentGraph.h67 bool getEdges(FGNode& pNode, EdgeListType& pEdges);
/frameworks/base/media/libdrm/mobile1/src/objmng/
H A Ddrm_api.c1871 T_DRM_Rights_Info_Node *pNode, *pTmp; local
1876 pNode = pRightsHeader;
1878 while (NULL != pNode) {
1879 pTmp = pNode;
1880 pNode = pNode->next;

Completed in 164 milliseconds