| /packages/apps/Nfc/nxp/jni/ |
| com_android_nfc_list.cpp | 56 struct listNode* pNode;
61 pNode = (struct listNode*)malloc(sizeof(listNode));
62 if (pNode == NULL)
68 TRACE("Allocated node: %8p (%8p)", pNode, pData);
69 pNode->pData = pData;
70 pNode->pNext = NULL;
78 pList->pFirst = pNode;
90 pLastNode->pNext = pNode;
102 struct listNode* pNode;
116 pNode = pList->pFirst
[all...] |
| /external/pdfium/core/src/fxcrt/ |
| fx_basic_list.cpp | 74 void CFX_PtrList::FreeNode(CFX_PtrList::CNode* pNode)
76 pNode->pNext = m_pNodeFree;
77 m_pNodeFree = pNode;
95 CNode* pNode = (CNode*)pNewBlock->data();
96 pNode += m_nBlockSize - 1;
97 for (int i = m_nBlockSize - 1; i >= 0; i--, pNode--) {
98 pNode->pNext = m_pNodeFree;
99 m_pNodeFree = pNode;
103 CFX_PtrList::CNode* pNode = m_pNodeFree;
105 pNode->pPrev = pPrev;
[all...] |
| /packages/apps/OMA-DM/engine/dmlib/linux_java/samples/plugins/testdataplugin/src/ |
| plugin_dll_test_data.cc | 97 PDmtPluginNode pNode;
122 pNode=PDmtPluginNode(new DmtPluginNode());
124 pNode->Init(pMyTree, pName, oChildren);
127 PDmtNode(pNode.GetPtr())
134 pNode=PDmtPluginNode(new DmtPluginNode());
135 pNode->Init(pMyTree, pName, DmtData(paramValue.c_str()));
139 PDmtNode(pNode.GetPtr())
149 PDmtPluginNode pNode;
152 pNode=PDmtPluginNode(new DmtPluginNode());
153 pNode->Init(pMyTree, pName, oChildren)
[all...] |
| /frameworks/compile/mclinker/lib/ADT/GraphLite/ |
| ListDigraph.cpp | 98 void ListDigraph::erase(ListDigraph::Node& pNode)
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.next
[all...] |
| Digraph.cpp | 66 void Digraph::erase(const Digraph::Node& pNode)
|
| /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_tnm/src/ |
| dm_tree_node_class.cc | 118 DMNode *pNode = pcFirstChild;
120 while ( pNode && pNode->abNodeName != szName )
121 pNode = pNode->pcNextSibling;
123 return pNode;
141 DMNode *pNode = pcParentOfNode;
143 while ( pNode && pNode != psStartNode ){
144 pNode->m_nFlags |= enum_NodeSkeleton
[all...] |
| dm_tree_class_private.cc | 363 DMNode * pNode = psFindNode;
365 while ( pNode ) {
366 if ( pNode->pArchive ) {
367 pNode->pArchive->setLastAccessedTime(currentTime);
370 pNode = pNode->pcParentOfNode;
[all...] |
| /hardware/ti/omap4-aah/security/tf_crypto_sst/ |
| lib_object.c | 77 LIB_OBJECT_NODE* pNode,
87 nKey1 == pNode->key.nHandle;
92 &pNode->key.sStorageName,
97 uint32_t nLength2 = pNode->key.f.nFilenameLength;
103 &pNode->key.f.sFilename,
118 LIB_OBJECT_NODE* pNode = pRoot;
121 if (libObjectKeyEqualNode(pNode, nKey1, pKey2, eNodeType))
124 return pNode;
126 pNode = pNode->pNext
[all...] |
| /hardware/ti/omap4xxx/security/tf_crypto_sst/ |
| lib_object.c | 77 LIB_OBJECT_NODE* pNode,
87 nKey1 == pNode->key.nHandle;
92 &pNode->key.sStorageName,
97 uint32_t nLength2 = pNode->key.f.nFilenameLength;
103 &pNode->key.f.sFilename,
118 LIB_OBJECT_NODE* pNode = pRoot;
121 if (libObjectKeyEqualNode(pNode, nKey1, pKey2, eNodeType))
124 return pNode;
126 pNode = pNode->pNext
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| rtree.c | 212 RtreeNode *pNode; /* Node cursor is currently pointing at */
213 int iCell; /* Index of current cell in pNode */
265 #define NCELL(pNode) readInt16(&(pNode)->zData[2])
417 ** Add node pNode to the node hash table.
419 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
421 assert( pNode->pNext==0 );
422 iHash = nodeHash(pNode->iNode);
423 pNode->pNext = pRtree->aHash[iHash];
424 pRtree->aHash[iHash] = pNode;
[all...] |
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| ListDigraph.h | 64 void erase(Node& pNode);
70 void getHead(Node*& pNode) const { pNode = m_pNodeHead; }
|
| Digraph.h | 66 void erase(const Node& pNode);
|
| /hardware/ti/omap4xxx/security/tf_daemon/ |
| smc_properties_parser.c | 149 static S_RESULT static_listSortedAddNode(NODE* pList,NODE* pNode)
154 nCmp=strcmp(pNode->pName,pList->pName);
163 pList->pRight=pNode;
165 pNode->pPrevious=pList;
166 pNode->pNext=pList->pNext;
169 pList->pNext->pPrevious=pNode;
171 pList->pNext=pNode;
183 pList->pLeft=pNode;
185 pNode->pNext=pList;
186 pNode->pPrevious=pList->pPrevious
[all...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| os_os2.c | 831 os2ShmNode *pNode, /* Apply locks to this open shared-memory segment */
841 assert( sqlite3_mutex_held(pNode->mutex) || pNode->nRef==0 );
854 rc = DosSetFileLocks(pNode->hLockFile,
859 rc = DosSetFileLocks(pNode->hLockFile,
865 pNode->hLockFile,
870 ERR_TRACE(rc, ("os2ShmSystemLock: %d %s\n", rc, pNode->shmBaseName))
883 os2ShmNode *pNode;
907 for( pNode = os2ShmNodeList;
908 pNode && stricmp(shmName, pNode->shmBaseName) != 0;
[all...] |
| /packages/apps/OMA-DM/engine/dmlib/linux_java/samples/plugins/testrwplugin/src/ |
| test_rwplugin.cc | 95 PtestRWPluginNode pNode;
97 pNode=new testRWPluginNode(this,
102 PDmtNode(pNode.GetPtr())
104 ptrCreatedNode = pNode;
110 PtestRWPluginNode pNode;
112 pNode=new testRWPluginNode(
119 PDmtNode(pNode.GetPtr())
122 ptrCreatedNode = pNode;
503 PtestRWPluginNode pNode;
510 pNode=new testRWPluginNode(pMyTree,
[all...] |
| /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_ua/hdr/ |
| dmMetaDataManager.h | 37 typedef BOOLEAN (*SYNCML_DM_MDF_CBACK)(DMNode* pNode, PDmtNode ptrPluginNode, CPCHAR szNodeName, CPCHAR szOrigName);
161 * \param pNode [in] - pointer on DM node to be added
169 SYNCML_DM_RET_STATUS_T VerifyAddParameters(DMNode* pNode,
176 * \param pNode [in] - pointer on DM node to be replaced
184 SYNCML_DM_RET_STATUS_T VerifyReplaceParameters(DMNode* pNode,
191 * \param pNode [in] - pointer on DM node to be deleted
197 SYNCML_DM_RET_STATUS_T VerifyDeleteParameters(DMNode* pNode,
318 * \param pNode [in] - pointer on DM node
322 CPCHAR GetNodeName(DMNode *pNode, CPCHAR szURI);
327 * \param pNode [in] - pointer on DM node to be verifie
[all...] |
| /hardware/ti/omap4-aah/security/tf_daemon/ |
| smc_properties_parser.c | 150 static S_RESULT static_listSortedAddNode(NODE* pList,NODE* pNode)
155 nCmp=strcmp(pNode->pName,pList->pName);
164 pList->pRight=pNode;
166 pNode->pPrevious=pList;
167 pNode->pNext=pList->pNext;
170 pList->pNext->pPrevious=pNode;
172 pList->pNext=pNode;
184 pList->pLeft=pNode;
186 pNode->pNext=pList;
187 pNode->pPrevious=pList->pPrevious
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| dxtmpl.h | 386 CNode *pNode = (CNode *) rPosition;
387 _ASSERT(DXIsValidAddress(pNode,sizeof(CNode),TRUE));
388 rPosition = (DXLISTPOS) pNode->pNext;
389 return pNode->data;
393 CNode *pNode = (CNode *) rPosition;
394 _ASSERT(DXIsValidAddress(pNode,sizeof(CNode),TRUE));
395 rPosition = (DXLISTPOS) pNode->pNext;
396 return pNode->data;
400 CNode *pNode = (CNode *) rPosition;
401 _ASSERT(DXIsValidAddress(pNode,sizeof(CNode),TRUE))
[all...] |
| /external/pdfium/core/src/fpdfdoc/ |
| doc_form.cpp | 89 _Node *pNode = (_Node *)children.GetAt(i);
90 CPDF_FormField* pField = pNode->GetField(fields_to_go);
111 void RemoveNode(_Node *pNode, int nLevel = 0);
129 _Node *pNode = FX_NEW _Node;
130 if (pNode == NULL) {
133 pNode->parent = pParent;
134 pNode->short_name = short_name;
135 pNode->field_ptr = field_ptr;
136 pParent->children.Add(pNode);
137 return pNode;
[all...] |
| doc_basic.cpp | 77 static CPDF_Object* SearchNameNode(CPDF_Dictionary* pNode, const CFX_ByteString& csName,
83 CPDF_Array* pLimits = pNode->GetArray(FX_BSTRC("Limits"));
96 CPDF_Array* pNames = pNode->GetArray(FX_BSTRC("Names"));
118 CPDF_Array* pKids = pNode->GetArray(FX_BSTRC("Kids"));
134 static CPDF_Object* SearchNameNode(CPDF_Dictionary* pNode, int nIndex, int& nCurIndex,
140 CPDF_Array* pNames = pNode->GetArray(FX_BSTRC("Names"));
154 CPDF_Array* pKids = pNode->GetArray(FX_BSTRC("Kids"));
170 static int CountNames(CPDF_Dictionary* pNode, int nLevel = 0)
175 CPDF_Array* pNames = pNode->GetArray(FX_BSTRC("Names"));
179 CPDF_Array* pKids = pNode->GetArray(FX_BSTRC("Kids"));
[all...] |
| /packages/apps/OMA-DM/engine/javaplugin/nativelib/src/ |
| DmtJavaPluginTree.cc | 82 PDmtJavaPluginNode pNode = new DmtJavaPluginNode(this, path, childNodeNames);
83 res = this->SetNode(path, static_cast<PDmtNode>(pNode));
88 ptrCreatedNode = pNode;
129 PDmtJavaPluginNode pNode = new DmtJavaPluginNode(this, path, value);
130 res = this->SetNode(path, static_cast<PDmtNode>(pNode));
135 ptrCreatedNode = pNode;
|
| /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_ua/src/ |
| dmMetaDataManager.cc | 118 DMMetaDataManager::GetNodeName(DMNode* pNode, CPCHAR szURI)
120 if ( pNode->isPlugin() )
125 return pNode->abNodeName.GetBuffer();
170 DMMetaDataManager::VerifyDeleteParameters(DMNode* pNode, CPCHAR szURI)
177 strNodeName = GetNodeName(pNode,szURI);
426 DMNode* pNode,
463 DMNode* pNode,
505 dm_stat = VerifyConstraints(oNodeMDF,pNode,szNodeName,oAddData);
517 DMMetaDataManager::VerifyReplaceParameters(DMNode* pNode,
544 strNodeName = GetNodeName(pNode,szURI)
[all...] |
| /external/opencv/cvaux/src/ |
| cvlcm.cpp | 73 CvVoronoiNode2D* pnode; member in struct:CvLCMData
95 { (STRUCT)->psite = SITE ; (STRUCT)->pedge = EDGE; (STRUCT)->pnode = NODE;}
179 // pNode : in, given node
182 // pSite: in, original site (pNode must be the begin point of pEdge
189 CvVoronoiNode2D* pNode,
355 CvVoronoiNode2D* pNode, *pNode1;
375 pNode = CV_VORONOIEDGE2D_BEGINNODE(pEdge,pSite);
376 if(pNode->radius > LCM->maxWidth)
385 if(_cvNodeMultyplicity(pSite, pEdge,pNode,LinkedEdges,LinkedSites) == 1)
490 CvVoronoiNode2D* pNode = CV_VORONOIEDGE2D_BEGINNODE(pEdge,pSite)
[all...] |
| /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_persist/src/ |
| SyncML_DM_WBXMLArchive.cc | 356 DMNode* pNode = rootTreeNode->GetParent(); // can be null for '.'; otherwise is valid parent
365 if ( pNode == rootTreeNode )
368 if ( !pNode || !pNode->GetParent() ){
374 pNode = pNode->GetParent();
401 ret_stat = pTree->AddNode(&pNode, props);
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| TreeBase.h | 61 void hook(NodeBase* pNode) { assert(0 && "not allowed"); }
|
