Home
last modified time | relevance | path

Searched refs:STG_FREE (Results 1 – 5 of 5) sorted by relevance

/aoo41x/main/sot/source/sdstor/
H A Dstgstrms.cxx114 if( nCur == STG_FREE ) in FindBlock()
283 pPg->SetPage( i, STG_FREE ); in InitNew()
301 pPg->SetPage( nOffset >> 2, bAll ? STG_FREE : STG_EOF ); in FreePages()
539 if( nFAT == STG_EOF || nFAT == STG_FREE ) in GetPage()
545 pMaster = rIo.Copy( nFAT, STG_FREE ); in GetPage()
549 pMaster->SetPage( k, STG_FREE ); in GetPage()
614 if( nFAT == STG_EOF || nFAT == STG_FREE ) in SetPage()
658 SetPage( i, STG_FREE ); in SetSize()
693 StgPage* pPg = rIo.Copy( nNewPage, STG_FREE ); in SetSize()
697 pPg->SetPage( j, STG_FREE ); in SetSize()
[all …]
H A Dstgelem.cxx118 SetFATPage( i, STG_FREE ); in Init()
201 … && ( nMasterChain == STG_FREE || nMasterChain == STG_EOF || ( nMasterChain >=0 && nMaster > 0 ) ) in Check()
306 SetLeaf( STG_LEFT, STG_FREE ); in Init()
307 SetLeaf( STG_RIGHT, STG_FREE ); in Init()
308 SetLeaf( STG_CHILD, STG_FREE ); in Init()
441 ( nPage1 < 0 && nPage1 != STG_FREE && nPage1 != STG_EOF ) ) in Load()
H A Dstgdir.cxx119 sal_Int32 nLeft = STG_FREE, nRight = STG_FREE, nDown = STG_FREE; in Enum()
856 else if (n>=nEntryCount || (n<0 && n!=STG_FREE)) in SetupEntry()
863 void* p = ( n == STG_FREE ) ? NULL : GetEntry( n ); in SetupEntry()
884 sal_Int32 nLeaf = STG_FREE; in SetupEntry()
888 if (nLeaf != STG_FREE && nLeaf == n) in SetupEntry()
960 if( !Copy( STG_FREE, nSize ) ) in Store()
H A Dstgcache.hxx88 StgPage* Copy( sal_Int32, sal_Int32=STG_FREE ); // copy a page
H A Dstgelem.hxx160 #define STG_FREE -1L // page is free macro

Completed in 119 milliseconds