Home
last modified time | relevance | path

Searched refs:pTree (Results 1 – 25 of 357) sorted by relevance

12345678910>>...15

/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-yarn-project/hadoop-yarn/hadoop-yarn-common/src/test/java/org/apache/hadoop/yarn/util/
H A DTestWindowsBasedProcessTree.java55 pTree.updateProcessTree(); in tree()
57 assertTrue(pTree.getCumulativeVmem() == 2048); in tree()
59 assertTrue(pTree.getCumulativeVmem(0) == 2048); in tree()
61 assertTrue(pTree.getRssMemorySize() == 2048); in tree()
63 assertTrue(pTree.getRssMemorySize(0) == 2048); in tree()
68 pTree.updateProcessTree(); in tree()
70 assertTrue(pTree.getCumulativeVmem() == 3072); in tree()
73 assertTrue(pTree.getRssMemorySize() == 3072); in tree()
75 assertTrue(pTree.getRssMemorySize(1) == 2048); in tree()
80 pTree.updateProcessTree(); in tree()
[all …]
/dports/deskutils/cairo-dock-plugins/cairo-dock-plug-ins-3.4.1/desklet-rendering/src/
H A Drendering-desklet-tree.c34 return pTree; in configure()
41 if (pTree == NULL) in load_data()
63 if (pTree == NULL) in free_data()
69 g_free (pTree); in free_data()
97 if (pTree == NULL) in calculate_icons()
122 pTree->iNbIconsInTree = iNbIcons; in calculate_icons()
127 pTree->fTreeHeightFactor = h / (pTree->iNbBranches * TREE_HEIGHT); in calculate_icons()
129 … %d branches, proportions : %.2fx%.2f", pTree->iNbIconsInTree, pTree->iNbBranches, pTree->fTreeWid… in calculate_icons()
142 pIcon->fWidth = 48 * MIN (pTree->fTreeWidthFactor, pTree->fTreeHeightFactor); in calculate_icons()
143 pIcon->fHeight = 48 * MIN (pTree->fTreeWidthFactor, pTree->fTreeHeightFactor); in calculate_icons()
[all …]
/dports/devel/codeworker/CodeWorker4_5_3/
H A DCW4dl.h428 inline const char* getValue(Tree* pTree) { return _getValue(pTree); } in getValue() argument
433 inline int getIntValue(Tree* pTree) { return _getIntValue(pTree); } in getIntValue() argument
438 inline double getDoubleValue(Tree* pTree) { return _getDoubleValue(pTree); } in getDoubleValue() argument
443 inline bool getBooleanValue(Tree* pTree) { return _getBooleanValue(pTree); } in getBooleanValue() argument
453 inline void setValue(Tree* pTree, const char* tcValue) { _setValue(pTree, tcValue); } in setValue() argument
458 inline void setIntValue(Tree* pTree, int iValue) { _setIntValue(pTree, iValue); } in setIntValue() argument
500 inline void clearNode(Tree* pTree) { _clearNode(pTree); } in clearNode() argument
509 inline int size(Tree* pTree) { return _sizeArray(pTree); } in size() argument
522 inline int allKeys(Tree* pTree, const char** tcKeys) { return _allKeys(pTree, tcKeys); } in allKeys() argument
556 inline Tree* getItem(Tree* pTree, int iKey) { return _getItemFromPos(pTree, iKey); } in getItem() argument
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/extrab/
H A DextraBddImage.c206 return pTree; in Extra_bddImageStart()
253 Extra_bddImageCompute_rec( pTree, pTree->pRoot ); in Extra_bddImageCompute()
254 if ( pTree->nNodesMaxT < pTree->nNodesMax ) in Extra_bddImageCompute()
255 pTree->nNodesMaxT = pTree->nNodesMax; in Extra_bddImageCompute()
1086 pTree->bRel = b1; Cudd_Ref( pTree->bRel ); in Extra_bddImageStart2()
1089 pTree->bRel = Cudd_bddAnd( dd, bTemp = pTree->bRel, pbParts[i] ); Cudd_Ref( pTree->bRel ); in Extra_bddImageStart2()
1111 Cudd_RecursiveDeref( pTree->dd, pTree->bImage ); in Extra_bddImageCompute2()
1112 pTree->bImage = Cudd_bddAndAbstract( pTree->dd, pTree->bRel, bCare, pTree->bCube ); in Extra_bddImageCompute2()
1131 Cudd_RecursiveDeref( pTree->dd, pTree->bRel ); in Extra_bddImageTreeDelete2()
1133 Cudd_RecursiveDeref( pTree->dd, pTree->bCube ); in Extra_bddImageTreeDelete2()
[all …]
/dports/net/tigervnc-server/tigervnc-1.12.0/unix/xserver/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xwayland/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xorg-nestserver/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xorg-vfbserver/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xorg-server/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xephyr/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xorg-dmx/xorg-server-1.20.13/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xarcan/xarcan-0.6.0/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/x11-servers/xwayland-devel/xorg-xserver-xorg-server-21.0.99.1-177-g9e5a37961/mi/
H A Dmioverlay.c200 if (pTree) { in miOverlayCreateWindow()
238 pTree->prevSib->nextSib = pTree->nextSib; in miOverlayDestroyWindow()
240 pTree->parent->firstChild = pTree->nextSib; in miOverlayDestroyWindow()
243 pTree->nextSib->prevSib = pTree->prevSib; in miOverlayDestroyWindow()
245 pTree->parent->lastChild = pTree->prevSib; in miOverlayDestroyWindow()
269 if (pTree) in miOverlayUnrealizeWindow()
410 if (pTree && pTree->nextSib) { in miOverlayMarkOverlappedWindows()
858 pTree = pTree->firstChild; in miOverlayHandleExposures()
863 pTree = pTree->parent; in miOverlayHandleExposures()
866 pTree = pTree->nextSib; in miOverlayHandleExposures()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/bbr/
H A DbbrImage.c239 return pTree; in Bbr_bddImageStart()
286 if ( !Bbr_bddImageCompute_rec( pTree, pTree->pRoot ) ) in Bbr_bddImageCompute()
288 if ( pTree->nNodesMaxT < pTree->nNodesMax ) in Bbr_bddImageCompute()
289 pTree->nNodesMaxT = pTree->nNodesMax; in Bbr_bddImageCompute()
1251 pTree->bRel = b1; Cudd_Ref( pTree->bRel ); in Bbr_bddImageStart2()
1254 pTree->bRel = Cudd_bddAnd( dd, bTemp = pTree->bRel, pbParts[i] ); Cudd_Ref( pTree->bRel ); in Bbr_bddImageStart2()
1276 Cudd_RecursiveDeref( pTree->dd, pTree->bImage ); in Bbr_bddImageCompute2()
1277 pTree->bImage = Cudd_bddAndAbstract( pTree->dd, pTree->bRel, bCare, pTree->bCube ); in Bbr_bddImageCompute2()
1296 Cudd_RecursiveDeref( pTree->dd, pTree->bRel ); in Bbr_bddImageTreeDelete2()
1298 Cudd_RecursiveDeref( pTree->dd, pTree->bCube ); in Bbr_bddImageTreeDelete2()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/fxu/
H A DfxuHeapD.c66 p->pTree[0] = NULL; in Fxu_HeapDoubleStart()
85 p->pTree = ABC_REALLOC( Fxu_Double *, p->pTree, p->nItemsAlloc + 1 ); in Fxu_HeapDoubleResize()
101 ABC_FREE( p->pTree ); in Fxu_HeapDoubleStop()
206 p->pTree[++p->nItems] = pDiv; in Fxu_HeapDoubleInsert()
255 p->pTree[pDiv->HNum] = p->pTree[p->nItems--]; in Fxu_HeapDoubleDelete()
256 p->pTree[pDiv->HNum]->HNum = pDiv->HNum; in Fxu_HeapDoubleDelete()
277 return p->pTree[1]; in Fxu_HeapDoubleReadMax()
297 pDiv = p->pTree[1]; in Fxu_HeapDoubleGetMax()
301 p->pTree[1] = p->pTree[p->nItems--]; in Fxu_HeapDoubleGetMax()
302 p->pTree[1]->HNum = 1; in Fxu_HeapDoubleGetMax()
[all …]
H A DfxuHeapS.c66 p->pTree[0] = NULL; in Fxu_HeapSingleStart()
85 p->pTree = ABC_REALLOC( Fxu_Single *, p->pTree, p->nItemsAlloc + 10 ); in Fxu_HeapSingleResize()
103 ABC_FREE( p->pTree ); in Fxu_HeapSingleStop()
209 p->pTree[++p->nItems] = pSingle; in Fxu_HeapSingleInsert()
257 p->pTree[Place] = p->pTree[p->nItems--]; in Fxu_HeapSingleDelete()
258 p->pTree[Place]->HNum = Place; in Fxu_HeapSingleDelete()
279 return p->pTree[1]; in Fxu_HeapSingleReadMax()
299 pSingle = p->pTree[1]; in Fxu_HeapSingleGetMax()
303 p->pTree[1] = p->pTree[p->nItems--]; in Fxu_HeapSingleGetMax()
304 p->pTree[1]->HNum = 1; in Fxu_HeapSingleGetMax()
[all …]
/dports/devel/intel-graphics-compiler/intel-graphics-compiler-igc-1.0.9636/3d/common/iStdLib/
H A DBinaryTree.h801 SNode* &pTree,
887 SNode* pTree,
941 SNode* pTree,
987 SNode* pTree,
1033 SNode* pTree,
1128 SNode* &pTree,
1232 SNode* &pTree,
1290 SNode* &pTree,
1347 SNode* &pTree,
1397 while( pTree )
[all …]
/dports/devel/RStudio/rstudio-2021.09.1-372/src/cpp/core/system/file_monitor/
H A DFileMonitor.cpp143 tree<FileInfo>* pTree, in processFileAdded() argument
153 if (it != pTree->end(parentIt)) in processFileAdded()
183 pTree->erase(addedIter); in processFileAdded()
200 pTree->sort(pTree->begin(parentIt), in processFileAdded()
201 pTree->end(parentIt), in processFileAdded()
245 if (remIt != pTree->end(parentIt)) in processFileRemoved()
269 pTree->erase(remIt); in processFileRemoved()
278 tree<FileInfo>* pTree, in discoverAndProcessFileChanges() argument
288 if (it == pTree->end()) in discoverAndProcessFileChanges()
319 pTree->erase(it); in discoverAndProcessFileChanges()
[all …]
/dports/databases/sqlite3/sqlite-src-3350500/src/
H A Drowset.c443 struct RowSetEntry *p, *pTree; in sqlite3RowSetTest() local
459 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
460 ppPrevTree = &pTree->pRight; in sqlite3RowSetTest()
461 if( pTree->pLeft==0 ){ in sqlite3RowSetTest()
467 pTree->pLeft = 0; in sqlite3RowSetTest()
471 if( pTree==0 ){ in sqlite3RowSetTest()
473 if( pTree ){ in sqlite3RowSetTest()
474 pTree->v = 0; in sqlite3RowSetTest()
475 pTree->pRight = 0; in sqlite3RowSetTest()
489 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
[all …]
/dports/databases/sqlcipher/sqlcipher-3.4.2/src/
H A Drowset.c439 struct RowSetEntry *p, *pTree; in sqlite3RowSetTest() local
455 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
456 ppPrevTree = &pTree->pRight; in sqlite3RowSetTest()
457 if( pTree->pLeft==0 ){ in sqlite3RowSetTest()
463 pTree->pLeft = 0; in sqlite3RowSetTest()
467 if( pTree==0 ){ in sqlite3RowSetTest()
469 if( pTree ){ in sqlite3RowSetTest()
470 pTree->v = 0; in sqlite3RowSetTest()
471 pTree->pRight = 0; in sqlite3RowSetTest()
485 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/src/
H A Drowset.c443 struct RowSetEntry *p, *pTree; in sqlite3RowSetTest() local
459 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
460 ppPrevTree = &pTree->pRight; in sqlite3RowSetTest()
461 if( pTree->pLeft==0 ){ in sqlite3RowSetTest()
467 pTree->pLeft = 0; in sqlite3RowSetTest()
471 if( pTree==0 ){ in sqlite3RowSetTest()
473 if( pTree ){ in sqlite3RowSetTest()
474 pTree->v = 0; in sqlite3RowSetTest()
475 pTree->pRight = 0; in sqlite3RowSetTest()
489 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/src/
H A Drowset.c443 struct RowSetEntry *p, *pTree; in sqlite3RowSetTest() local
459 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
460 ppPrevTree = &pTree->pRight; in sqlite3RowSetTest()
461 if( pTree->pLeft==0 ){ in sqlite3RowSetTest()
467 pTree->pLeft = 0; in sqlite3RowSetTest()
471 if( pTree==0 ){ in sqlite3RowSetTest()
473 if( pTree ){ in sqlite3RowSetTest()
474 pTree->v = 0; in sqlite3RowSetTest()
475 pTree->pRight = 0; in sqlite3RowSetTest()
489 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){ in sqlite3RowSetTest()
[all …]
/dports/devel/hadoop/hadoop-1.2.1/src/mapred/org/apache/hadoop/mapred/
H A DTaskMemoryManagerThread.java98 private ProcfsBasedProcessTree pTree; field in TaskMemoryManagerThread.ProcessTreeInfo
103 ProcfsBasedProcessTree pTree, long memLimit) { in ProcessTreeInfo() argument
106 this.pTree = pTree; in ProcessTreeInfo()
123 return pTree; in getProcessTree()
126 public void setProcessTree(ProcfsBasedProcessTree pTree) { in setProcessTree() argument
127 this.pTree = pTree; in setProcessTree()
203 pTree = pTree.getProcessTree(); // get the updated process-tree in run()
206 long currentMemUsage = pTree.getCumulativeVmem(); in run()
318 boolean isProcessTreeOverLimit(ProcfsBasedProcessTree pTree, in isProcessTreeOverLimit() argument
320 long currentMemUsage = pTree.getCumulativeVmem(); in isProcessTreeOverLimit()
[all …]
/dports/databases/sqlite2/sqlite-2.8.17/src/
H A Dbtree_rb.c99 BtRbTree *pTree; member
221 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()
253 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()
670 BtRbTree *pTree; in memRbtreeDropTable() local
675 assert(pTree); in memRbtreeDropTable()
677 sqliteFree(pTree); in memRbtreeDropTable()
725 assert( pCur->pTree ); in memRbtreeCursor()
1028 BtRbTree *pTree; in memRbtreeClearTable() local
1032 assert(pTree); in memRbtreeClearTable()
1034 pNode = pTree->pHead; in memRbtreeClearTable()
[all …]
/dports/databases/p5-DBD-SQLite2/DBD-SQLite2-0.38/
H A Dbtree_rb.c99 BtRbTree *pTree; member
221 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()
253 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()
670 BtRbTree *pTree; in memRbtreeDropTable() local
675 assert(pTree); in memRbtreeDropTable()
677 sqliteFree(pTree); in memRbtreeDropTable()
725 assert( pCur->pTree ); in memRbtreeCursor()
1028 BtRbTree *pTree; in memRbtreeClearTable() local
1032 assert(pTree); in memRbtreeClearTable()
1034 pNode = pTree->pHead; in memRbtreeClearTable()
[all …]

12345678910>>...15