vcl/source/helper/lazydelete.cxx

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