blob: 3b79b5f875658f4b3ce974f5ca21896ba04eb914 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include "vcl/window.hxx"
#include "vcl/menu.hxx"
#include "vcl/lazydelete.hxx"
#include "svdata.hxx"
namespace vcl {
LazyDeletorBase::LazyDeletorBase()
{
}
LazyDeletorBase::~LazyDeletorBase()
{
}
// instantiate instance pointer for LazyDeletor<Window>
LazyDeletor* LazyDeletor::s_pOneInstance = NULL;
// a list for all LazyeDeletor<T> singletons
static std::vector< LazyDeletorBase* > lcl_aDeletors;
void LazyDelete::addDeletor( LazyDeletorBase* i_pDel )
{
lcl_aDeletors.push_back( i_pDel );
}
void LazyDelete::flush()
{
DBG_TESTSOLARMUTEX(); // must be locked
unsigned int nCount = lcl_aDeletors.size();
for( unsigned int i = 0; i < nCount; i++ )
delete lcl_aDeletors[i];
lcl_aDeletors.clear();
}
// specialized is_less function for Window
bool LazyDeletor::is_less( vcl::Window* left, vcl::Window* right )
{
return left != right && right->IsChild( left, true );
}
DeleteOnDeinitBase::~DeleteOnDeinitBase()
{
ImplSVData* pSVData = ImplGetSVData();
if( pSVData && pSVData->mpDeinitDeleteList != NULL )
pSVData->mpDeinitDeleteList->remove( this );
}
void DeleteOnDeinitBase::addDeinitContainer( DeleteOnDeinitBase* i_pContainer )
{
ImplSVData* pSVData = ImplGetSVData();
DBG_ASSERT( ! pSVData->mbDeInit, "DeleteOnDeinit added after DeiInitVCL !" );
if( pSVData->mbDeInit )
return;
if( pSVData->mpDeinitDeleteList == NULL )
pSVData->mpDeinitDeleteList = new std::list< DeleteOnDeinitBase* >();
pSVData->mpDeinitDeleteList->push_back( i_pContainer );
}
void DeleteOnDeinitBase::ImplDeleteOnDeInit()
{
ImplSVData* pSVData = ImplGetSVData();
if( pSVData->mpDeinitDeleteList )
{
for( std::list< vcl::DeleteOnDeinitBase* >::iterator it = pSVData->mpDeinitDeleteList->begin();
it != pSVData->mpDeinitDeleteList->end(); ++it )
{
(*it)->doCleanup();
}
delete pSVData->mpDeinitDeleteList;
pSVData->mpDeinitDeleteList = NULL;
}
}
} // namespace vcl
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
