diff options
| author | Michael Meeks <michael.meeks@suse.com> | 2012-05-14 09:41:02 +0100 |
|---|---|---|
| committer | Michael Meeks <michael.meeks@suse.com> | 2012-05-14 09:41:02 +0100 |
| commit | 1d32c56f36adbd0d5801f0fedec3111011ea4d65 (patch) | |
| tree | b0d5c2d76f9a3f69aeaebb89cf97f67e25ca6f42 /sot/source/sdstor/stgstrms.hxx | |
| parent | c948e655f837dc3f03b849d388ec52508c96d533 (diff) | |
sot: re-work OLE2 offset-to-page computation
The gotcha here is that if we get ahead of ourselves, and read to
the end of the stream, we detect bad chains too early, so instead
incrementally build the page chain cache, which is also quicker
and behaves more similarly to the previous code.
Diffstat (limited to 'sot/source/sdstor/stgstrms.hxx')
| -rw-r--r-- | sot/source/sdstor/stgstrms.hxx | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/sot/source/sdstor/stgstrms.hxx b/sot/source/sdstor/stgstrms.hxx index 125dc67c3798..dff07dfa4d98 100644 --- a/sot/source/sdstor/stgstrms.hxx +++ b/sot/source/sdstor/stgstrms.hxx @@ -79,7 +79,7 @@ protected: short nOffset; // offset into current page short nPageSize; // logical page size std::vector<sal_Int32> m_aPagesCache; - bool buildPageChainCache(); + void scanBuildPageChainCache(sal_Int32 *pOptionalCalcSize = NULL); sal_Bool Copy( sal_Int32 nFrom, sal_Int32 nBytes ); StgStrm( StgIo& ); public: |