/home/maarten/src/libreoffice/core/include/rtl/ref.hxx

Bug Summary

File:	home/maarten/src/libreoffice/core/include/rtl/ref.hxx
Warning:	line 113, column 13 Use of memory after it is freed

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name filtnav.cxx -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -mframe-pointer=all -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /usr/lib64/clang/11.0.0 -D BOOST_ERROR_CODE_HEADER_ONLY -D BOOST_SYSTEM_NO_DEPRECATED -D CPPU_ENV=gcc3 -D LINUX -D OSL_DEBUG_LEVEL=1 -D SAL_LOG_INFO -D SAL_LOG_WARN -D UNIX -D UNX -D X86_64 -D _PTHREADS -D _REENTRANT -D SVX_DLLIMPLEMENTATION -D EXCEPTIONS_ON -D LIBO_INTERNAL_ONLY -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source/i18n -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/icu/source/common -I /home/maarten/src/libreoffice/core/external/boost/include -I /home/maarten/src/libreoffice/core/workdir/UnpackedTarball/boost -I /home/maarten/src/libreoffice/core/svx/inc -I /home/maarten/src/libreoffice/core/svx/source/inc -I /home/maarten/src/libreoffice/core/include -I /usr/lib/jvm/java-11-openjdk-11.0.9.10-0.0.ea.fc33.x86_64/include -I /usr/lib/jvm/java-11-openjdk-11.0.9.10-0.0.ea.fc33.x86_64/include/linux -I /home/maarten/src/libreoffice/core/config_host -I /home/maarten/src/libreoffice/core/workdir/UnoApiHeadersTarget/udkapi/normal -I /home/maarten/src/libreoffice/core/workdir/UnoApiHeadersTarget/offapi/normal -I /home/maarten/src/libreoffice/core/workdir/CustomTarget/officecfg/registry -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10 -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/x86_64-redhat-linux -internal-isystem /usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/backward -internal-isystem /usr/local/include -internal-isystem /usr/lib64/clang/11.0.0/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O0 -Wno-missing-braces -std=c++17 -fdeprecated-macro -fdebug-compilation-dir /home/maarten/src/libreoffice/core -ferror-limit 19 -fvisibility hidden -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -fcxx-exceptions -fexceptions -debug-info-kind=constructor -analyzer-output=html -faddrsig -o /home/maarten/tmp/wis/scan-build-libreoffice/output/report/2020-10-07-141433-9725-1 -x c++ /home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx

/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx

→

1/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2/*
* 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 .
*/

20#include <memory>
21#include <filtnav.hxx>
22#include <fmexch.hxx>
23#include <helpids.h>
24#include <fmprop.hxx>
25#include <svx/strings.hrc>

27#include <com/sun/star/awt/XControl.hpp>
28#include <com/sun/star/form/runtime/XFormController.hpp>
29#include <com/sun/star/util/NumberFormatter.hpp>
30#include <com/sun/star/sdb/SQLContext.hpp>

32#include <comphelper/processfactory.hxx>
33#include <comphelper/string.hxx>
34#include <connectivity/dbtools.hxx>
35#include <connectivity/sqlnode.hxx>
36#include <cppuhelper/implbase.hxx>
37#include <i18nlangtag/languagetag.hxx>
38#include <fmshimp.hxx>
39#include <o3tl/safeint.hxx>
40#include <sfx2/objitem.hxx>
41#include <sfx2/request.hxx>
42#include <svx/dialmgr.hxx>
43#include <svx/fmshell.hxx>
44#include <svx/fmtools.hxx>
45#include <svx/svxids.hrc>
46#include <vcl/settings.hxx>
47#include <tools/diagnose_ex.h>
48#include <vcl/commandevent.hxx>
49#include <vcl/event.hxx>
50#include <vcl/svapp.hxx>

52#include <bitmaps.hlst>

54#include <functional>

56using namespace ::svxform;
57using namespace ::connectivity;
58using namespace ::dbtools;

60namespace svxform
61{
  using ::com::sun::star::uno::Reference;
  using ::com::sun::star::container::XIndexAccess;
  using ::com::sun::star::uno::UNO_QUERY;
  using ::com::sun::star::beans::XPropertySet;
  using ::com::sun::star::form::runtime::XFormController;
  using ::com::sun::star::form::runtime::XFilterController;
  using ::com::sun::star::form::runtime::XFilterControllerListener;
  using ::com::sun::star::form::runtime::FilterEvent;
  using ::com::sun::star::lang::EventObject;
  using ::com::sun::star::form::XForm;
  using ::com::sun::star::container::XChild;
  using ::com::sun::star::awt::XControl;
  using ::com::sun::star::sdbc::XConnection;
  using ::com::sun::star::util::XNumberFormatsSupplier;
  using ::com::sun::star::util::XNumberFormatter;
  using ::com::sun::star::util::NumberFormatter;
  using ::com::sun::star::sdbc::XRowSet;
  using ::com::sun::star::lang::Locale;
  using ::com::sun::star::sdb::SQLContext;
  using ::com::sun::star::uno::XInterface;
  using ::com::sun::star::uno::UNO_QUERY_THROW;
  using ::com::sun::star::uno::UNO_SET_THROW;
  using ::com::sun::star::uno::Exception;
  using ::com::sun::star::uno::Sequence;


88OFilterItemExchange::OFilterItemExchange()
  : m_pFormItem(nullptr)
90{
91}

93void OFilterItemExchange::AddSupportedFormats()
94{
  AddFormat(getFormatId());
96}

98SotClipboardFormatId OFilterItemExchange::getFormatId()
99{
  static SotClipboardFormatId s_nFormat =
       SotExchange::RegisterFormatName("application/x-openoffice;windows_formatname=\"form.FilterControlExchange\"");
  DBG_ASSERT(static_cast<SotClipboardFormatId>(-1) != s_nFormat, "OFilterExchangeHelper::getFormatId: bad exchange id!")do { if (true && (!(static_cast<SotClipboardFormatId
>(-1) != s_nFormat))) { sal_detail_logFormat((SAL_DETAIL_LOG_LEVEL_WARN
), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "102" ": "), "%s", "OFilterExchangeHelper::getFormatId: bad exchange id!"
); } } while (false);
  return s_nFormat;
104}

106OLocalExchange* OFilterExchangeHelper::createExchange() const
107{
  return new OFilterItemExchange;
109}

111OUString FmFilterData::GetImage() const
112{
  return OUString();
114}

116FmParentData::~FmParentData()
117{
118}

120OUString FmFormItem::GetImage() const
121{
  return RID_SVXBMP_FORM"res/sx10593.png";
123}

125FmFilterItem* FmFilterItems::Find( const ::sal_Int32 _nFilterComponentIndex ) const
126{
  for ( auto & pData : m_aChildren )
  {
      FmFilterItem& rCondition = dynamic_cast<FmFilterItem&>(*pData);
      if ( _nFilterComponentIndex == rCondition.GetComponentIndex() )
          return &rCondition;
  }
  return nullptr;
134}

136OUString FmFilterItems::GetImage() const
137{
  return RID_SVXBMP_FILTER"res/sx10715.png";
139}

141FmFilterItem::FmFilterItem( FmFilterItems* pParent,
                          const OUString& aFieldName,
                          const OUString& aText,
                          const sal_Int32 _nComponentIndex )
        :FmFilterData(pParent, aText)
        ,m_aFieldName(aFieldName)
        ,m_nComponentIndex( _nComponentIndex )
148{
149}

151OUString FmFilterItem::GetImage() const
152{
  return RID_SVXBMP_FIELD"res/sx18027.png";
154}

156// Hints for communication between model and view

158namespace {

160class FmFilterHint : public SfxHint
161{
  FmFilterData*   m_pData;

164public:
  explicit FmFilterHint(FmFilterData* pData):m_pData(pData){}
  FmFilterData* GetData() const { return m_pData; }
167};

169class FmFilterInsertedHint : public FmFilterHint
170{
  size_t m_nPos;   // Position relative to the parent of the data

173public:
  FmFilterInsertedHint(FmFilterData* pData, size_t nRelPos)
      :FmFilterHint(pData)
      ,m_nPos(nRelPos){}

  size_t GetPos() const { return m_nPos; }
179};

181class FmFilterRemovedHint : public FmFilterHint
182{
183public:
  explicit FmFilterRemovedHint(FmFilterData* pData)
      :FmFilterHint(pData){}
186};


189class FmFilterTextChangedHint : public FmFilterHint
190{
191public:
  explicit FmFilterTextChangedHint(FmFilterData* pData)
      :FmFilterHint(pData){}
194};

196class FilterClearingHint : public SfxHint
197{
198public:
  FilterClearingHint(){}
200};

202class FmFilterCurrentChangedHint : public SfxHint
203{
204public:
  FmFilterCurrentChangedHint(){}
206};

208}

210// class FmFilterAdapter, listener at the FilterControls
211class FmFilterAdapter : public ::cppu::WeakImplHelper< XFilterControllerListener >
212{
  FmFilterModel*              m_pModel;
  Reference< XIndexAccess >   m_xControllers;

216public:
  FmFilterAdapter(FmFilterModel* pModel, const Reference< XIndexAccess >& xControllers);

219// XEventListener
  virtual void SAL_CALL disposing(const EventObject& Source) override;

222// XFilterControllerListener
  virtual void SAL_CALL predicateExpressionChanged( const FilterEvent& Event ) override;
  virtual void SAL_CALL disjunctiveTermRemoved( const FilterEvent& Event ) override;
  virtual void SAL_CALL disjunctiveTermAdded( const FilterEvent& Event ) override;

227// helpers
  /// @throws RuntimeException
  void dispose();

  void AddOrRemoveListener( const Reference< XIndexAccess >& _rxControllers, const bool _bAdd );

  static void setText(sal_Int32 nPos,
      const FmFilterItem* pFilterItem,
      const OUString& rText);
236};


239FmFilterAdapter::FmFilterAdapter(FmFilterModel* pModel, const Reference< XIndexAccess >& xControllers)
  :m_pModel( pModel )
  ,m_xControllers( xControllers )
242{
  AddOrRemoveListener( m_xControllers, true );
244}


247void FmFilterAdapter::dispose()
248{
  AddOrRemoveListener( m_xControllers, false );
250}


253void FmFilterAdapter::AddOrRemoveListener( const Reference< XIndexAccess >& _rxControllers, const bool _bAdd )
254{
  for (sal_Int32 i = 0, nLen = _rxControllers->getCount(); i < nLen; ++i)
  {
      Reference< XIndexAccess > xElement( _rxControllers->getByIndex(i), UNO_QUERY );

      // step down
      AddOrRemoveListener( xElement, _bAdd );

      // handle this particular controller
      Reference< XFilterController > xController( xElement, UNO_QUERY );
      OSL_ENSURE( xController.is(), "FmFilterAdapter::InsertElements: no XFilterController, cannot sync data!" )do { if (true && (!(xController.is()))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "264" ": "), "%s", "FmFilterAdapter::InsertElements: no XFilterController, cannot sync data!"
); } } while (false);
      if ( xController.is() )
      {
          if ( _bAdd )
              xController->addFilterControllerListener( this );
          else
              xController->removeFilterControllerListener( this );
      }
  }
273}


276void FmFilterAdapter::setText(sal_Int32 nRowPos,
                            const FmFilterItem* pFilterItem,
                            const OUString& rText)
279{
  FmFormItem* pFormItem = dynamic_cast<FmFormItem*>( pFilterItem->GetParent()->GetParent()  );
  assert(pFormItem)(static_cast <bool> (pFormItem) ? void (0) : __assert_fail
 ("pFormItem", "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
, 281, __extension__ __PRETTY_FUNCTION__));
  try
  {
      Reference< XFilterController > xController( pFormItem->GetController(), UNO_QUERY_THROW );
      xController->setPredicateExpression( pFilterItem->GetComponentIndex(), nRowPos, rText );
  }
  catch( const Exception& )
  {
      DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "289" ": ", "svx" );;
  }
291}


294// XEventListener

296void SAL_CALL FmFilterAdapter::disposing(const EventObject& /*e*/)
297{
298}


301namespace
302{
  OUString lcl_getLabelName_nothrow( const Reference< XControl >& _rxControl )
  {
      OUString sLabelName;
      try
      {
          Reference< XPropertySet > xModel( _rxControl->getModel(), UNO_QUERY_THROW );
          sLabelName = getLabelName( xModel );
      }
      catch( const Exception& )
      {
          DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "313" ": ", "svx" );;
      }
      return sLabelName;
  }

  Reference< XPropertySet > lcl_getBoundField_nothrow( const Reference< XControl >& _rxControl )
  {
      Reference< XPropertySet > xField;
      try
      {
          Reference< XPropertySet > xModelProps( _rxControl->getModel(), UNO_QUERY_THROW );
          xField.set( xModelProps->getPropertyValue( FM_PROP_BOUNDFIELD"BoundField" ), UNO_QUERY_THROW );
      }
      catch( const Exception& )
      {
          DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "328" ": ", "svx" );;
      }
      return xField;
  }
332}

334// XFilterControllerListener
335void FmFilterAdapter::predicateExpressionChanged( const FilterEvent& Event )
336{
  SolarMutexGuard aGuard;

  if ( !m_pModel )
      return;

  // the controller which sent the event
  Reference< XFormController > xController( Event.Source, UNO_QUERY_THROW );
  Reference< XFilterController > xFilterController( Event.Source, UNO_QUERY_THROW );
  Reference< XForm > xForm( xController->getModel(), UNO_QUERY_THROW );

  FmFormItem* pFormItem = m_pModel->Find( m_pModel->m_aChildren, xForm );
  OSL_ENSURE( pFormItem, "FmFilterAdapter::predicateExpressionChanged: don't know this form!" )do { if (true && (!(pFormItem))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "348" ": "), "%s", "FmFilterAdapter::predicateExpressionChanged: don't know this form!"
); } } while (false);
  if ( !pFormItem )
      return;

  const sal_Int32 nActiveTerm( xFilterController->getActiveTerm() );

  FmFilterData* pData = pFormItem->GetChildren()[nActiveTerm].get();
  FmFilterItems& rFilter = dynamic_cast<FmFilterItems&>(*pData);
  FmFilterItem* pFilterItem = rFilter.Find( Event.FilterComponent );
  if ( pFilterItem )
  {
      if ( !Event.PredicateExpression.isEmpty())
      {
          pFilterItem->SetText( Event.PredicateExpression );
          // notify the UI
          FmFilterTextChangedHint aChangeHint(pFilterItem);
          m_pModel->Broadcast( aChangeHint );
      }
      else
      {
          // no text anymore so remove the condition
          m_pModel->Remove(pFilterItem);
      }
  }
  else
  {
      // searching the component by field name
      OUString aFieldName( lcl_getLabelName_nothrow( xFilterController->getFilterComponent( Event.FilterComponent ) ) );

      std::unique_ptr<FmFilterItem> pNewFilterItem(new FmFilterItem(&rFilter, aFieldName, Event.PredicateExpression, Event.FilterComponent));
      m_pModel->Insert(rFilter.GetChildren().end(), std::move(pNewFilterItem));
  }

  // ensure there's one empty term in the filter, just in case the active term was previously empty
  m_pModel->EnsureEmptyFilterRows( *pFormItem );
383}


386void SAL_CALL FmFilterAdapter::disjunctiveTermRemoved( const FilterEvent& Event )
387{
  SolarMutexGuard aGuard;

  Reference< XFormController > xController( Event.Source, UNO_QUERY_THROW );
  Reference< XFilterController > xFilterController( Event.Source, UNO_QUERY_THROW );
  Reference< XForm > xForm( xController->getModel(), UNO_QUERY_THROW );

  FmFormItem* pFormItem = m_pModel->Find( m_pModel->m_aChildren, xForm );
  OSL_ENSURE( pFormItem, "FmFilterAdapter::disjunctiveTermRemoved: don't know this form!" )do { if (true && (!(pFormItem))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "395" ": "), "%s", "FmFilterAdapter::disjunctiveTermRemoved: don't know this form!"
); } } while (false);
  if ( !pFormItem )
      return;

  auto& rTermItems = pFormItem->GetChildren();
  const bool bValidIndex = ( Event.DisjunctiveTerm >= 0 ) && ( o3tl::make_unsigned(Event.DisjunctiveTerm) < rTermItems.size() );
  OSL_ENSURE( bValidIndex, "FmFilterAdapter::disjunctiveTermRemoved: invalid term index!" )do { if (true && (!(bValidIndex))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "401" ": "), "%s", "FmFilterAdapter::disjunctiveTermRemoved: invalid term index!"
); } } while (false);
  if ( !bValidIndex )
      return;

  // if the first term was removed, then the to-be first term needs its text updated
  if ( Event.DisjunctiveTerm == 0 )
  {
      rTermItems[1]->SetText( SvxResId(RID_STR_FILTER_FILTER_FORreinterpret_cast<char const *>("RID_STR_FILTER_FILTER_FOR"
 "\004" u8"Filter for")));
      FmFilterTextChangedHint aChangeHint( rTermItems[1].get() );
      m_pModel->Broadcast( aChangeHint );
  }

  // finally remove the entry from the model
  m_pModel->Remove( rTermItems.begin() + Event.DisjunctiveTerm );

  // ensure there's one empty term in the filter, just in case the currently removed one was the last empty one
  m_pModel->EnsureEmptyFilterRows( *pFormItem );
418}


421void SAL_CALL FmFilterAdapter::disjunctiveTermAdded( const FilterEvent& Event )
422{
  SolarMutexGuard aGuard;

  Reference< XFormController > xController( Event.Source, UNO_QUERY_THROW );
  Reference< XFilterController > xFilterController( Event.Source, UNO_QUERY_THROW );
  Reference< XForm > xForm( xController->getModel(), UNO_QUERY_THROW );

  FmFormItem* pFormItem = m_pModel->Find( m_pModel->m_aChildren, xForm );
  OSL_ENSURE( pFormItem, "FmFilterAdapter::disjunctiveTermAdded: don't know this form!" )do { if (true && (!(pFormItem))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "430" ": "), "%s", "FmFilterAdapter::disjunctiveTermAdded: don't know this form!"
); } } while (false);
  if ( !pFormItem )
      return;

  const sal_Int32 nInsertPos = Event.DisjunctiveTerm;
  bool bValidIndex = ( nInsertPos >= 0 ) && ( o3tl::make_unsigned(nInsertPos) <= pFormItem->GetChildren().size() );
  if ( !bValidIndex )
  {
      OSL_FAIL( "FmFilterAdapter::disjunctiveTermAdded: invalid index!" )do { if (true && (((sal_Bool)1))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "438" ": "), "%s", "FmFilterAdapter::disjunctiveTermAdded: invalid index!"
); } } while (false);
      return;
  }

  auto insertPos = pFormItem->GetChildren().begin() + nInsertPos;

  // "Filter for" for first position, "Or" for the other positions
  std::unique_ptr<FmFilterItems> pFilterItems(new FmFilterItems(pFormItem, (nInsertPos?SvxResId(RID_STR_FILTER_FILTER_ORreinterpret_cast<char const *>("RID_STR_FILTER_FILTER_OR"
 "\004" u8"Or")):SvxResId(RID_STR_FILTER_FILTER_FORreinterpret_cast<char const *>("RID_STR_FILTER_FILTER_FOR"
 "\004" u8"Filter for")))));
  m_pModel->Insert( insertPos, std::move(pFilterItems) );
447}


450FmFilterModel::FmFilterModel()
            :FmParentData(nullptr, OUString())
            ,OSQLParserClient(comphelper::getProcessComponentContext())
            ,m_pCurrentItems(nullptr)
454{
455}


458FmFilterModel::~FmFilterModel()
459{
  Clear();
461}


464void FmFilterModel::Clear()
465{
  // notify
  FilterClearingHint aClearedHint;
  Broadcast( aClearedHint );

  // lose endings
  if (m_pAdapter.is())
  {
      m_pAdapter->dispose();
      m_pAdapter.clear();
  }

  m_pCurrentItems  = nullptr;
  m_xController    = nullptr;
  m_xControllers   = nullptr;

  m_aChildren.clear();
482}


485void FmFilterModel::Update(const Reference< XIndexAccess > & xControllers, const Reference< XFormController > & xCurrent)
486{
  if ( xCurrent == m_xController )
      return;

  if (!xControllers.is())
  {
      Clear();
      return;
  }

  // there is only a new current controller
  if ( m_xControllers != xControllers )
  {
      Clear();

      m_xControllers = xControllers;
      Update(m_xControllers, this);

      DBG_ASSERT(xCurrent.is(), "FmFilterModel::Update(...) no current controller")do { if (true && (!(xCurrent.is()))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "504" ": "), "%s", "FmFilterModel::Update(...) no current controller"
); } } while (false);

      // Listening for TextChanges
      m_pAdapter = new FmFilterAdapter(this, xControllers);

      SetCurrentController(xCurrent);
      EnsureEmptyFilterRows( *this );
  }
  else
      SetCurrentController(xCurrent);
514}


517void FmFilterModel::Update(const Reference< XIndexAccess > & xControllers, FmParentData* pParent)
518{
  try
  {
      sal_Int32 nCount = xControllers->getCount();
      for ( sal_Int32 i = 0; i < nCount; ++i )
      {
          Reference< XFormController > xController( xControllers->getByIndex(i), UNO_QUERY_THROW );

          Reference< XPropertySet > xFormProperties( xController->getModel(), UNO_QUERY_THROW );
          OUString aName;
          OSL_VERIFY( xFormProperties->getPropertyValue( FM_PROP_NAME ) >>= aName )do { if (!(xFormProperties->getPropertyValue( "Name" ) >>=
 aName)) do { if (true && (!(0))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "528" ": "), "OSL_ASSERT: %s", "0"); } } while (false); }
 while (0);

          // Insert a new item for the form
          FmFormItem* pFormItem = new FmFormItem( pParent, xController, aName );
          Insert( pParent->GetChildren().end(), std::unique_ptr<FmFilterData>(pFormItem) );

          Reference< XFilterController > xFilterController( pFormItem->GetFilterController(), UNO_SET_THROW );

          // insert the existing filters for the form
          OUString aTitle(SvxResId(RID_STR_FILTER_FILTER_FORreinterpret_cast<char const *>("RID_STR_FILTER_FILTER_FOR"
 "\004" u8"Filter for")));

          const Sequence< Sequence< OUString > > aExpressions = xFilterController->getPredicateExpressions();
          for ( auto const & conjunctionTerm : aExpressions )
          {
              // we always display one row, even if there's no term to be displayed
              FmFilterItems* pFilterItems = new FmFilterItems( pFormItem, aTitle );
              Insert( pFormItem->GetChildren().end(), std::unique_ptr<FmFilterData>(pFilterItems) );

              const Sequence< OUString >& rDisjunction( conjunctionTerm );
              sal_Int32 nComponentIndex = -1;
              for ( const OUString& rDisjunctiveTerm : rDisjunction )
              {
                  ++nComponentIndex;

                  if ( rDisjunctiveTerm.isEmpty() )
                      // no condition for this particular component in this particular conjunction term
                      continue;

                  // determine the display name of the control
                  const Reference< XControl > xFilterControl( xFilterController->getFilterComponent( nComponentIndex ) );
                  const OUString sDisplayName( lcl_getLabelName_nothrow( xFilterControl ) );

                  // insert a new entry
                  std::unique_ptr<FmFilterItem> pANDCondition(new FmFilterItem( pFilterItems, sDisplayName, rDisjunctiveTerm, nComponentIndex ));
                  Insert( pFilterItems->GetChildren().end(), std::move(pANDCondition) );
              }

              // title for the next conditions
              aTitle = SvxResId( RID_STR_FILTER_FILTER_ORreinterpret_cast<char const *>("RID_STR_FILTER_FILTER_OR"
 "\004" u8"Or") );
          }

          // now add dependent controllers
          Update( xController, pFormItem );
      }
  }
  catch( const Exception& )
  {
      DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "575" ": ", "svx" );;
  }
577}


580FmFormItem* FmFilterModel::Find(const ::std::vector<std::unique_ptr<FmFilterData>>& rItems, const Reference< XFormController > & xController) const
581{
  for (const auto& rItem : rItems)
  {
      FmFormItem* pForm = dynamic_cast<FmFormItem*>( rItem.get() );
      if (pForm)
      {
          if ( xController == pForm->GetController() )
              return pForm;
          else
          {
              pForm = Find(pForm->GetChildren(), xController);
              if (pForm)
                  return pForm;
          }
      }
  }
  return nullptr;
598}


601FmFormItem* FmFilterModel::Find(const ::std::vector<std::unique_ptr<FmFilterData>>& rItems, const Reference< XForm >& xForm) const
602{
  for (const auto& rItem : rItems)
  {
      FmFormItem* pForm = dynamic_cast<FmFormItem*>( rItem.get() );
      if (pForm)
      {
          if (xForm == pForm->GetController()->getModel())
              return pForm;
          else
          {
              pForm = Find(pForm->GetChildren(), xForm);
              if (pForm)
                  return pForm;
          }
      }
  }
  return nullptr;
619}

621void FmFilterModel::SetCurrentController(const Reference< XFormController > & xCurrent)
622{
  if ( xCurrent == m_xController )
      return;

  m_xController = xCurrent;

  FmFormItem* pItem = Find( m_aChildren, xCurrent );
  if ( !pItem )
      return;

  try
  {
      Reference< XFilterController > xFilterController( m_xController, UNO_QUERY_THROW );
      const sal_Int32 nActiveTerm( xFilterController->getActiveTerm() );
      if (nActiveTerm != -1 && pItem->GetChildren().size() > o3tl::make_unsigned(nActiveTerm))
      {
          SetCurrentItems( static_cast< FmFilterItems* >( pItem->GetChildren()[ nActiveTerm ].get() ) );
      }
  }
  catch( const Exception& )
  {
      DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "643" ": ", "svx" );;
  }
645}

647void FmFilterModel::AppendFilterItems( FmFormItem& _rFormItem )
648{
  // insert the condition behind the last filter items
  auto iter = std::find_if(_rFormItem.GetChildren().rbegin(), _rFormItem.GetChildren().rend(),
      [](const std::unique_ptr<FmFilterData>& rChild) { return dynamic_cast<const FmFilterItems*>(rChild.get()) != nullptr; });

  sal_Int32 nInsertPos = iter.base() - _rFormItem.GetChildren().begin();
  // delegate this to the FilterController, it will notify us, which will let us update our model
  try
  {
      Reference< XFilterController > xFilterController( _rFormItem.GetFilterController(), UNO_SET_THROW );
      if ( nInsertPos >= xFilterController->getDisjunctiveTerms() )
          xFilterController->appendEmptyDisjunctiveTerm();
  }
  catch( const Exception& )
  {
      DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "663" ": ", "svx" );;
  }
665}

667void FmFilterModel::Insert(const ::std::vector<std::unique_ptr<FmFilterData>>::iterator& rPos, std::unique_ptr<FmFilterData> pData)
668{
  auto pTemp = pData.get();
  size_t nPos;
  ::std::vector<std::unique_ptr<FmFilterData>>& rItems = pData->GetParent()->GetChildren();
  if (rPos == rItems.end())
  {
      nPos = rItems.size();
      rItems.push_back(std::move(pData));
  }
  else
  {
      nPos = rPos - rItems.begin();
      rItems.insert(rPos, std::move(pData));
  }

  // notify the UI
  FmFilterInsertedHint aInsertedHint(pTemp, nPos);
  Broadcast( aInsertedHint );
686}

688void FmFilterModel::Remove(FmFilterData* pData)
689{
  FmParentData* pParent = pData->GetParent();
  ::std::vector<std::unique_ptr<FmFilterData>>& rItems = pParent->GetChildren();

  // erase the item from the model
  auto i = ::std::find_if(rItems.begin(), rItems.end(),
          [&](const std::unique_ptr<FmFilterData>& p) { return p.get() == pData; } );
  DBG_ASSERT(i != rItems.end(), "FmFilterModel::Remove(): unknown Item")do { if (true && (!(i != rItems.end()))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "696" ": "), "%s", "FmFilterModel::Remove(): unknown Item"
); } } while (false);
  // position within the parent
  sal_Int32 nPos = i - rItems.begin();
  if (dynamic_cast<const FmFilterItems*>( pData) !=  nullptr)
  {
      FmFormItem* pFormItem = static_cast<FmFormItem*>(pParent);

      try
      {
          Reference< XFilterController > xFilterController( pFormItem->GetFilterController(), UNO_SET_THROW );

          bool bEmptyLastTerm = ( ( nPos == 0 ) && xFilterController->getDisjunctiveTerms() == 1 );
          if ( bEmptyLastTerm )
          {
              // remove all children (by setting an empty predicate expression)
              ::std::vector< std::unique_ptr<FmFilterData> >& rChildren = static_cast<FmFilterItems*>(pData)->GetChildren();
              while ( !rChildren.empty() )
              {
                  auto removePos = rChildren.end() - 1;
                  if (FmFilterItem* pFilterItem = dynamic_cast<FmFilterItem*>( removePos->get() ))
                  {
                      FmFilterAdapter::setText( nPos, pFilterItem, OUString() );
                  }
                  Remove( removePos );
              }
          }
          else
          {
              xFilterController->removeDisjunctiveTerm( nPos );
          }
      }
      catch( const Exception& )
      {
          DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "729" ": ", "svx" );;
      }
  }
  else // FormItems can not be deleted
  {
      FmFilterItem& rFilterItem = dynamic_cast<FmFilterItem&>(*pData);

      // if it's the last condition remove the parent
      if (rItems.size() == 1)
          Remove(rFilterItem.GetParent());
      else
      {
          // find the position of the father within his father
          ::std::vector<std::unique_ptr<FmFilterData>>& rParentParentItems = pData->GetParent()->GetParent()->GetChildren();
          auto j = ::std::find_if(rParentParentItems.begin(), rParentParentItems.end(),
              [&](const std::unique_ptr<FmFilterData>& p) { return p.get() == rFilterItem.GetParent(); });
          DBG_ASSERT(j != rParentParentItems.end(), "FmFilterModel::Remove(): unknown Item")do { if (true && (!(j != rParentParentItems.end()))) {
 sal_detail_logFormat((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.tools"
), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "745" ": "), "%s", "FmFilterModel::Remove(): unknown Item"
); } } while (false);
          sal_Int32 nParentPos = j - rParentParentItems.begin();

          // EmptyText removes the filter
          FmFilterAdapter::setText(nParentPos, &rFilterItem, OUString());
          Remove( i );
      }
  }
753}

755void FmFilterModel::Remove( const ::std::vector<std::unique_ptr<FmFilterData>>::iterator& rPos )
756{
  // remove from parent's child list
  std::unique_ptr<FmFilterData> pData = std::move(*rPos);
  pData->GetParent()->GetChildren().erase( rPos );

  // notify the view, this will remove the actual SvTreeListEntry
  FmFilterRemovedHint aRemoveHint( pData.get() );
  Broadcast( aRemoveHint );
764}


767bool FmFilterModel::ValidateText(FmFilterItem const * pItem, OUString& rText, OUString& rErrorMsg) const
768{
  FmFormItem* pFormItem = dynamic_cast<FmFormItem*>( pItem->GetParent()->GetParent()  );
  assert(pFormItem)(static_cast <bool> (pFormItem) ? void (0) : __assert_fail
 ("pFormItem", "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
, 770, __extension__ __PRETTY_FUNCTION__));
  try
  {
      Reference< XFormController > xFormController( pFormItem->GetController() );
      // obtain the connection of the form belonging to the controller
      Reference< XRowSet > xRowSet( xFormController->getModel(), UNO_QUERY_THROW );
      Reference< XConnection > xConnection( getConnection( xRowSet ) );

      // obtain a number formatter for this connection
      // TODO: shouldn't this be cached?
      Reference< XNumberFormatsSupplier > xFormatSupplier = getNumberFormats( xConnection, true );
      Reference< XNumberFormatter > xFormatter( NumberFormatter::create( comphelper::getProcessComponentContext() ), UNO_QUERY_THROW );
      xFormatter->attachNumberFormatsSupplier( xFormatSupplier );

      // get the field (database column) which the item is responsible for
      Reference< XFilterController > xFilterController( xFormController, UNO_QUERY_THROW );
      Reference< XPropertySet > xField( lcl_getBoundField_nothrow( xFilterController->getFilterComponent( pItem->GetComponentIndex() ) ), UNO_SET_THROW );

      // parse the given text as filter predicate
      OUString aErr, aTxt( rText );
      std::unique_ptr< OSQLParseNode > pParseNode = predicateTree( aErr, aTxt, xFormatter, xField );
      rErrorMsg = aErr;
      rText = aTxt;
      if ( pParseNode != nullptr )
      {
          OUString aPreparedText;
          Locale aAppLocale = Application::GetSettings().GetUILanguageTag().getLocale();
          pParseNode->parseNodeToPredicateStr(
              aPreparedText, xConnection, xFormatter, xField, OUString(), aAppLocale, OUString("."), getParseContext() );
          rText = aPreparedText;
          return true;
      }
  }
  catch( const Exception& )
  {
      DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "805" ": ", "svx" );;
  }

  return false;
809}


812void FmFilterModel::Append(FmFilterItems* pItems, std::unique_ptr<FmFilterItem> pFilterItem)
813{
  Insert(pItems->GetChildren().end(), std::move(pFilterItem));
815}


818void FmFilterModel::SetTextForItem(FmFilterItem* pItem, const OUString& rText)
819{
  ::std::vector<std::unique_ptr<FmFilterData>>& rItems = pItem->GetParent()->GetParent()->GetChildren();
  auto i = ::std::find_if(rItems.begin(), rItems.end(),
              [&](const std::unique_ptr<FmFilterData>& p) { return p.get() == pItem->GetParent(); });
  sal_Int32 nParentPos = i - rItems.begin();

  FmFilterAdapter::setText(nParentPos, pItem, rText);

  if (rText.isEmpty())
      Remove(pItem);
  else
  {
      // Change the text
      pItem->SetText(rText);
      FmFilterTextChangedHint aChangeHint(pItem);
      Broadcast( aChangeHint );
  }
836}


839void FmFilterModel::SetCurrentItems(FmFilterItems* pCurrent)
840{
  if (m_pCurrentItems == pCurrent)
      return;

  // search for the condition
  if (pCurrent)
  {
      FmFormItem* pFormItem = static_cast<FmFormItem*>(pCurrent->GetParent());
      ::std::vector<std::unique_ptr<FmFilterData>>& rItems = pFormItem->GetChildren();
      auto i = ::std::find_if(rItems.begin(), rItems.end(),
                  [&](const std::unique_ptr<FmFilterData>& p) { return p.get() == pCurrent; });

      if (i != rItems.end())
      {
          // determine the filter position
          sal_Int32 nPos = i - rItems.begin();
          try
          {
              Reference< XFilterController > xFilterController( pFormItem->GetFilterController(), UNO_SET_THROW );
              xFilterController->setActiveTerm( nPos );
          }
          catch( const Exception& )
          {
              DBG_UNHANDLED_EXCEPTION("svx")DbgUnhandledException( DbgGetCaughtException(), __func__, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "863" ": ", "svx" );;
          }

          if ( m_xController != pFormItem->GetController() )
              // calls SetCurrentItems again
              SetCurrentController( pFormItem->GetController() );
          else
              m_pCurrentItems = pCurrent;
      }
      else
          m_pCurrentItems = nullptr;
  }
  else
      m_pCurrentItems = nullptr;


  // notify the UI
  FmFilterCurrentChangedHint aHint;
  Broadcast( aHint );
882}


885void FmFilterModel::EnsureEmptyFilterRows( FmParentData& _rItem )
886{
  // checks whether for each form there's one free level for input
  ::std::vector< std::unique_ptr<FmFilterData> >& rChildren = _rItem.GetChildren();
  bool bAppendLevel = dynamic_cast<const FmFormItem*>(&_rItem) !=  nullptr;

  for ( const auto& rpChild : rChildren )
  {
      FmFilterItems* pItems = dynamic_cast<FmFilterItems*>( rpChild.get() );
      if ( pItems && pItems->GetChildren().empty() )
      {
          bAppendLevel = false;
          break;
      }

      FmFormItem* pFormItem = dynamic_cast<FmFormItem*>( rpChild.get() );
      if (pFormItem)
      {
          EnsureEmptyFilterRows( *pFormItem );
          continue;
      }
  }

  if ( bAppendLevel )
  {
      FmFormItem* pFormItem = dynamic_cast<FmFormItem*>( &_rItem  );
      OSL_ENSURE( pFormItem, "FmFilterModel::EnsureEmptyFilterRows: no FmFormItem, but a FmFilterItems child?" )do { if (true && (!(pFormItem))) { sal_detail_logFormat
((SAL_DETAIL_LOG_LEVEL_WARN), ("legacy.osl"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "911" ": "), "%s", "FmFilterModel::EnsureEmptyFilterRows: no FmFormItem, but a FmFilterItems child?"
); } } while (false);
      if ( pFormItem )
          AppendFilterItems( *pFormItem );
  }
915}

917const int nxD = 4;
918const int nxDBmp = 12;

920IMPL_STATIC_LINK(FmFilterNavigator, CustomGetSizeHdl, weld::TreeView::get_size_args, aPayload, Size)Size FmFilterNavigator::LinkStubCustomGetSizeHdl(void * instance
, weld::TreeView::get_size_args data) { return CustomGetSizeHdl
(static_cast<FmFilterNavigator *>(instance), data); } Size
 FmFilterNavigator::CustomGetSizeHdl(__attribute__ ((unused))
 FmFilterNavigator *, weld::TreeView::get_size_args aPayload)
921{
  vcl::RenderContext& rRenderContext = aPayload.first;
  const OUString& rId = aPayload.second;

  Size aSize;

  FmFilterData* pData = reinterpret_cast<FmFilterData*>(rId.toUInt64());
  OUString sText = pData->GetText();

  if (FmFilterItem* pItem = dynamic_cast<FmFilterItem*>(pData))
  {
      rRenderContext.Push(PushFlags::FONT);
      vcl::Font aFont(rRenderContext.GetFont());
      aFont.SetWeight(WEIGHT_BOLD);
      rRenderContext.SetFont(aFont);

      OUString sName = pItem->GetFieldName() + ": ";
      aSize = Size(rRenderContext.GetTextWidth(sName), rRenderContext.GetTextHeight());

      rRenderContext.Pop();

      aSize.AdjustWidth(rRenderContext.GetTextWidth(sText) + nxD);
  }
  else
  {
      aSize = Size(rRenderContext.GetTextWidth(sText), rRenderContext.GetTextHeight());
      if (dynamic_cast<FmFilterItems*>(pData))
          aSize.AdjustWidth(nxDBmp);
  }

  return aSize;
952}

954IMPL_STATIC_LINK(FmFilterNavigator, CustomRenderHdl, weld::TreeView::render_args, aPayload, void)void FmFilterNavigator::LinkStubCustomRenderHdl(void * instance
, weld::TreeView::render_args data) { return CustomRenderHdl(
static_cast<FmFilterNavigator *>(instance), data); } void
 FmFilterNavigator::CustomRenderHdl(__attribute__ ((unused)) FmFilterNavigator
 *, weld::TreeView::render_args aPayload)
955{
  vcl::RenderContext& rRenderContext = std::get<0>(aPayload);
  const ::tools::Rectangle& rRect = std::get<1>(aPayload);
  ::tools::Rectangle aRect(rRect.TopLeft(), Size(rRenderContext.GetOutputSize().Width() - rRect.Left(), rRect.GetHeight()));
  bool bSelected = std::get<2>(aPayload);
  const OUString& rId = std::get<3>(aPayload);

  rRenderContext.Push(PushFlags::TEXTCOLOR);
  const StyleSettings& rStyleSettings = Application::GetSettings().GetStyleSettings();
  if (bSelected)
      rRenderContext.SetTextColor(rStyleSettings.GetHighlightTextColor());
  else
      rRenderContext.SetTextColor(rStyleSettings.GetDialogTextColor());

  FmFilterData* pData = reinterpret_cast<FmFilterData*>(rId.toUInt64());
  OUString sText = pData->GetText();
  Point aPos(aRect.TopLeft());

  if (FmFilterItem* pFilter = dynamic_cast<FmFilterItem*>(pData))
  {
      vcl::Font aFont(rRenderContext.GetFont());
      aFont.SetWeight(WEIGHT_BOLD);

      rRenderContext.Push(PushFlags::FONT);
      rRenderContext.SetFont(aFont);

      OUString sName = pFilter->GetFieldName() + ": ";
      rRenderContext.DrawText(aPos, sName);

      // position for the second text
      aPos.AdjustX(rRenderContext.GetTextWidth(sName) + nxD);
      rRenderContext.Pop();

      rRenderContext.DrawText(aPos, sText);
  }
  else if (FmFilterItems* pRow = dynamic_cast<FmFilterItems*>(pData))
  {
      FmFormItem* pForm = static_cast<FmFormItem*>(pRow->GetParent());

      // current filter is significant painted
      const bool bIsCurrentFilter = pForm->GetChildren()[ pForm->GetFilterController()->getActiveTerm() ].get() == pRow;
      if (bIsCurrentFilter)
      {
          rRenderContext.Push(PushFlags::LINECOLOR);
          rRenderContext.SetLineColor(rRenderContext.GetTextColor());

          Point aFirst(aPos.X(), aRect.Bottom() - 6);
          Point aSecond(aFirst .X() + 2, aFirst.Y() + 3);

          rRenderContext.DrawLine(aFirst, aSecond);

          aFirst = aSecond;
          aFirst.AdjustX(1);
          aSecond.AdjustX(6);
          aSecond.AdjustY(-5);

          rRenderContext.DrawLine(aFirst, aSecond);
          rRenderContext.Pop();
      }

      rRenderContext.DrawText(Point(aPos.X() + nxDBmp, aPos.Y()), sText);
  }
  else
      rRenderContext.DrawText(aPos, sText);

  rRenderContext.Pop();
1021}

1023FmFilterNavigatorDropTarget::FmFilterNavigatorDropTarget(FmFilterNavigator& rTreeView)
  : DropTargetHelper(rTreeView.get_widget().get_drop_target())
  , m_rTreeView(rTreeView)
1026{
1027}

1029sal_Int8 FmFilterNavigatorDropTarget::AcceptDrop(const AcceptDropEvent& rEvt)
1030{
  sal_Int8 nAccept = m_rTreeView.AcceptDrop(rEvt);

  if (nAccept != DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE)
  {
      // to enable the autoscroll when we're close to the edges
      weld::TreeView& rWidget = m_rTreeView.get_widget();
      rWidget.get_dest_row_at_pos(rEvt.maPosPixel, nullptr, true);
  }

  return nAccept;
1041}

1043sal_Int8 FmFilterNavigatorDropTarget::ExecuteDrop(const ExecuteDropEvent& rEvt)
1044{
  return m_rTreeView.ExecuteDrop(rEvt);
1046}

1048FmFilterNavigator::FmFilterNavigator(vcl::Window* pTopLevel, std::unique_ptr<weld::TreeView> xTreeView)
  : m_xTopLevel(pTopLevel)
  , m_xTreeView(std::move(xTreeView))
  , m_aDropTargetHelper(*this)
  , m_aControlExchange()
  , m_nAsyncRemoveEvent(nullptr)
1054{
  m_xTreeView->set_help_id(HID_FILTER_NAVIGATOR"SVX_HID_FILTER_NAVIGATOR");

  m_xTreeView->set_selection_mode(SelectionMode::Multiple);

  m_pModel.reset( new FmFilterModel() );
  StartListening( *m_pModel );

  m_xTreeView->connect_custom_get_size(LINK(this, FmFilterNavigator, CustomGetSizeHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubCustomGetSizeHdl
));
  m_xTreeView->connect_custom_render(LINK(this, FmFilterNavigator, CustomRenderHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubCustomRenderHdl
));
  m_xTreeView->set_column_custom_renderer(0, true);

  m_xTreeView->connect_changed(LINK(this, FmFilterNavigator, SelectHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubSelectHdl));
  m_xTreeView->connect_key_press(LINK(this, FmFilterNavigator, KeyInputHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubKeyInputHdl));
  m_xTreeView->connect_popup_menu(LINK(this, FmFilterNavigator, PopupMenuHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubPopupMenuHdl));
  m_xTreeView->connect_editing(LINK(this, FmFilterNavigator, EditingEntryHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubEditingEntryHdl
),
                               LINK(this, FmFilterNavigator, EditedEntryHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubEditedEntryHdl));
  m_xTreeView->connect_drag_begin(LINK(this, FmFilterNavigator, DragBeginHdl)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubDragBeginHdl));
1072}

1074FmFilterNavigator::~FmFilterNavigator()
1075{
  if (m_nAsyncRemoveEvent)
      Application::RemoveUserEvent(m_nAsyncRemoveEvent);
  EndListening(*m_pModel);
  m_pModel.reset();
1080}

1082void FmFilterNavigator::UpdateContent(const Reference< XIndexAccess > & xControllers, const Reference< XFormController > & xCurrent)
1083{
  if (xCurrent == m_pModel->GetCurrentController())
      return;

  m_pModel->Update(xControllers, xCurrent);

  // expand the filters for the current controller
  std::unique_ptr<weld::TreeIter> xEntry = FindEntry(m_pModel->GetCurrentForm());
  if (!xEntry || m_xTreeView->get_row_expanded(*xEntry))
      return;

  m_xTreeView->unselect_all();

  m_xTreeView->expand_row(*xEntry);

  xEntry = FindEntry(m_pModel->GetCurrentItems());
  if (xEntry)
  {
      if (!m_xTreeView->get_row_expanded(*xEntry))
          m_xTreeView->expand_row(*xEntry);
      m_xTreeView->select(*xEntry);
      SelectHdl(*m_xTreeView);
  }
1106}

1108IMPL_LINK(FmFilterNavigator, EditingEntryHdl, const weld::TreeIter&, rIter, bool)bool FmFilterNavigator::LinkStubEditingEntryHdl(void * instance
, const weld::TreeIter& data) { return static_cast<FmFilterNavigator
 *>(instance)->EditingEntryHdl(data); } bool FmFilterNavigator
::EditingEntryHdl(const weld::TreeIter& rIter)
1109{
  // returns true to allow editing
  if (dynamic_cast<const FmFilterItem*>(reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(rIter).toUInt64())))
  {
      m_xEditingCurrently = m_xTreeView->make_iterator(&rIter);
      return true;
  }
  m_xEditingCurrently.reset();
  return false;
1118}

1120IMPL_LINK(FmFilterNavigator, EditedEntryHdl, const IterString&, rIterString, bool)bool FmFilterNavigator::LinkStubEditedEntryHdl(void * instance
, const IterString& data) { return static_cast<FmFilterNavigator
 *>(instance)->EditedEntryHdl(data); } bool FmFilterNavigator
::EditedEntryHdl(const IterString& rIterString)
1121{
  const weld::TreeIter& rIter = rIterString.first;
  const OUString& rNewText = rIterString.second;

  assert(m_xEditingCurrently && m_xTreeView->iter_compare(rIter, *m_xEditingCurrently) == 0 &&(static_cast <bool> (m_xEditingCurrently && m_xTreeView
->iter_compare(rIter, *m_xEditingCurrently) == 0 &&
 "FmFilterNavigator::EditedEntry: suspicious entry!") ? void (
0) : __assert_fail ("m_xEditingCurrently && m_xTreeView->iter_compare(rIter, *m_xEditingCurrently) == 0 && \"FmFilterNavigator::EditedEntry: suspicious entry!\""
, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
, 1126, __extension__ __PRETTY_FUNCTION__))
             "FmFilterNavigator::EditedEntry: suspicious entry!")(static_cast <bool> (m_xEditingCurrently && m_xTreeView
->iter_compare(rIter, *m_xEditingCurrently) == 0 &&
 "FmFilterNavigator::EditedEntry: suspicious entry!") ? void (
0) : __assert_fail ("m_xEditingCurrently && m_xTreeView->iter_compare(rIter, *m_xEditingCurrently) == 0 && \"FmFilterNavigator::EditedEntry: suspicious entry!\""
, "/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
, 1126, __extension__ __PRETTY_FUNCTION__));
  m_xEditingCurrently.reset();

  FmFilterData* pData = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(rIter).toUInt64());

  DBG_ASSERT(dynamic_cast<const FmFilterItem*>(pData) != nullptr,do { if (true && (!(dynamic_cast<const FmFilterItem
*>(pData) != nullptr))) { sal_detail_logFormat((SAL_DETAIL_LOG_LEVEL_WARN
), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "1132" ": "), "%s", "FmFilterNavigator::EditedEntry() wrong entry"
); } } while (false)
                  "FmFilterNavigator::EditedEntry() wrong entry")do { if (true && (!(dynamic_cast<const FmFilterItem
*>(pData) != nullptr))) { sal_detail_logFormat((SAL_DETAIL_LOG_LEVEL_WARN
), ("legacy.tools"), ("/home/maarten/src/libreoffice/core/svx/source/form/filtnav.cxx"
 ":" "1132" ": "), "%s", "FmFilterNavigator::EditedEntry() wrong entry"
); } } while (false);

  OUString aText(comphelper::string::strip(rNewText, ' '));
  if (aText.isEmpty())
  {
      // deleting the entry asynchron
      m_nAsyncRemoveEvent = Application::PostUserEvent(LINK(this, FmFilterNavigator, OnRemove)::tools::detail::makeLink( ::tools::detail::castTo<FmFilterNavigator
 *>(this), &FmFilterNavigator::LinkStubOnRemove), pData);
  }
  else
  {
      OUString aErrorMsg;

      if (m_pModel->ValidateText(static_cast<FmFilterItem*>(pData), aText, aErrorMsg))
      {
          // this will set the text at the FmFilterItem, as well as update any filter controls
          // which are connected to this particular entry
          m_pModel->SetTextForItem(static_cast<FmFilterItem*>(pData), aText);
          m_xTreeView->set_text(rIter, aText);
      }
      else
      {
          // display the error and return sal_False
          SQLContext aError;
          aError.Message = SvxResId(RID_STR_SYNTAXERRORreinterpret_cast<char const *>("RID_STR_SYNTAXERROR" "\004"
 u8"Syntax error in query expression"));
          aError.Details = aErrorMsg;
          displayException(aError, m_xTopLevel);

          return false;
      }
  }
  return true;
1163}

1165IMPL_LINK( FmFilterNavigator, OnRemove, void*, p, void )void FmFilterNavigator::LinkStubOnRemove(void * instance, void
* data) { return static_cast<FmFilterNavigator *>(instance
)->OnRemove(data); } void FmFilterNavigator::OnRemove(void
* p)
1166{
  m_nAsyncRemoveEvent = nullptr;
  // now remove the entry
  m_pModel->Remove(static_cast<FmFilterData*>(p));
1170}

1172sal_Int8 FmFilterNavigator::AcceptDrop( const AcceptDropEvent& rEvt )
1173{
  if (!m_aControlExchange.isDragSource())
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  if (!OFilterItemExchange::hasFormat(m_aDropTargetHelper.GetDataFlavorExVector()))
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  // do we contain the formitem?
  if (!FindEntry(m_aControlExchange->getFormItem()))
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  Point aDropPos = rEvt.maPosPixel;
  std::unique_ptr<weld::TreeIter> xDropTarget(m_xTreeView->make_iterator());
  // get_dest_row_at_pos with false cause we must drop exactly "on" a node to paste a condition into it
  if (!m_xTreeView->get_dest_row_at_pos(aDropPos, xDropTarget.get(), false))
      xDropTarget.reset();

  if (!xDropTarget)
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  FmFilterData* pData = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(*xDropTarget).toUInt64());
  FmFormItem* pForm = nullptr;
  if (dynamic_cast<const FmFilterItem*>(pData) !=  nullptr)
  {
      pForm = dynamic_cast<FmFormItem*>( pData->GetParent()->GetParent() );
      if (pForm != m_aControlExchange->getFormItem())
          return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;
  }
  else if (dynamic_cast<const FmFilterItems*>( pData) !=  nullptr)
  {
      pForm = dynamic_cast<FmFormItem*>( pData->GetParent() );
      if (pForm != m_aControlExchange->getFormItem())
          return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;
  }
  else
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  return rEvt.mnAction;
1211}

1213namespace
1214{
  FmFilterItems* getTargetItems(const weld::TreeView& rTreeView, const weld::TreeIter& rTarget)
  {
      FmFilterData* pData = reinterpret_cast<FmFilterData*>(rTreeView.get_id(rTarget).toUInt64());
      FmFilterItems*  pTargetItems = dynamic_cast<FmFilterItems*>(pData);
      if (!pTargetItems)
          pTargetItems = dynamic_cast<FmFilterItems*>(pData->GetParent());
      return pTargetItems;
  }
1223}

1225sal_Int8 FmFilterNavigator::ExecuteDrop( const ExecuteDropEvent& rEvt )
1226{
  if (!m_aControlExchange.isDragSource())
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  Point aDropPos = rEvt.maPosPixel;
  std::unique_ptr<weld::TreeIter> xDropTarget(m_xTreeView->make_iterator());
  // get_dest_row_at_pos with false cause we must drop exactly "on" a node to paste a condition into it
  if (!m_xTreeView->get_dest_row_at_pos(aDropPos, xDropTarget.get(), false))
      xDropTarget.reset();
  if (!xDropTarget)
      return DND_ACTION_NONEcss::datatransfer::dnd::DNDConstants::ACTION_NONE;

  // search the container where to add the items
  FmFilterItems* pTargetItems = getTargetItems(*m_xTreeView, *xDropTarget);
  m_xTreeView->unselect_all();
  std::unique_ptr<weld::TreeIter> xEntry = FindEntry(pTargetItems);
  m_xTreeView->select(*xEntry);
  m_xTreeView->set_cursor(*xEntry);

  insertFilterItem(m_aControlExchange->getDraggedEntries(),pTargetItems,DND_ACTION_COPYcss::datatransfer::dnd::DNDConstants::ACTION_COPY == rEvt.mnAction);

  return DND_ACTION_COPYcss::datatransfer::dnd::DNDConstants::ACTION_COPY;
1248}

1250IMPL_LINK_NOARG(FmFilterNavigator, SelectHdl, weld::TreeView&, void)void FmFilterNavigator::LinkStubSelectHdl(void * instance, weld
::TreeView& data) { return static_cast<FmFilterNavigator
 *>(instance)->SelectHdl(data); } void FmFilterNavigator
::SelectHdl(__attribute__ ((unused)) weld::TreeView&)
1251{
  std::unique_ptr<weld::TreeIter> xIter(m_xTreeView->make_iterator());
  if (!m_xTreeView->get_selected(xIter.get()))
      return;

  FmFilterData* pData = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(*xIter).toUInt64());

  FmFormItem* pFormItem = nullptr;
  if (FmFilterItem* pItem = dynamic_cast<FmFilterItem*>(pData))
      pFormItem = static_cast<FmFormItem*>(pItem->GetParent()->GetParent());
  else if (FmFilterItems* pItems = dynamic_cast<FmFilterItems*>(pData))
      pFormItem = static_cast<FmFormItem*>(pItems->GetParent()->GetParent());
  else
      pFormItem = dynamic_cast<FmFormItem*>(pData);

  if (pFormItem)
  {
      // will the controller be exchanged?
      if (FmFilterItem* pItem = dynamic_cast<FmFilterItem*>(pData))
          m_pModel->SetCurrentItems(static_cast<FmFilterItems*>(pItem->GetParent()));
      else if (FmFilterItems* pItems = dynamic_cast<FmFilterItems*>(pData))
          m_pModel->SetCurrentItems(pItems);
      else
          m_pModel->SetCurrentController(pFormItem->GetController());
  }
1276}

1278void FmFilterNavigator::Notify( SfxBroadcaster& /*rBC*/, const SfxHint& rHint )
1279{
  if (const FmFilterInsertedHint* pInsertHint = dynamic_cast<const FmFilterInsertedHint*>(&rHint))
  {
      Insert(pInsertHint->GetData(), pInsertHint->GetPos());
  }
  else if( dynamic_cast<const FilterClearingHint*>(&rHint) )
  {
      m_xTreeView->clear();
  }
  else if (const FmFilterRemovedHint* pRemoveHint = dynamic_cast<const FmFilterRemovedHint*>(&rHint))
  {
      Remove(pRemoveHint->GetData());
  }
  else if (const FmFilterTextChangedHint *pChangeHint = dynamic_cast<const FmFilterTextChangedHint*>(&rHint))
  {
      std::unique_ptr<weld::TreeIter> xEntry = FindEntry(pChangeHint->GetData());
      if (xEntry)
          m_xTreeView->set_text(*xEntry, pChangeHint->GetData()->GetText());
  }
  else if( dynamic_cast<const FmFilterCurrentChangedHint*>(&rHint) )
  {
      m_xTreeView->queue_draw();
  }
1302}

1304std::unique_ptr<weld::TreeIter> FmFilterNavigator::FindEntry(const FmFilterData* pItem) const
1305{
  if (!pItem)
      return nullptr;
  std::unique_ptr<weld::TreeIter> xEntry = m_xTreeView->make_iterator();
  if (!m_xTreeView->get_iter_first(*xEntry))
      return nullptr;
  do
  {
      FmFilterData* pEntryItem = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(*xEntry).toUInt64());
      if (pEntryItem == pItem)
          return xEntry;
  }
  while (m_xTreeView->iter_next(*xEntry));

  return nullptr;
1320}

1322void FmFilterNavigator::Insert(FmFilterData* pItem, int nPos)
1323{
  const FmParentData* pParent = pItem->GetParent() ? pItem->GetParent() : m_pModel.get();

  // insert the item
  std::unique_ptr<weld::TreeIter> xParentEntry = FindEntry(pParent);

  OUString sId(OUString::number(reinterpret_cast<sal_uIntPtr>(pItem)));
  std::unique_ptr<weld::TreeIter> xRet(m_xTreeView->make_iterator());
  m_xTreeView->insert(xParentEntry.get(), nPos, &pItem->GetText(), &sId,
                      nullptr, nullptr, false, xRet.get());
  m_xTreeView->set_image(*xRet, pItem->GetImage());

  if (!xParentEntry)
      return;
  m_xTreeView->expand_row(*xParentEntry);
1338}

1340void FmFilterNavigator::EndEditing()
1341{
  if (m_xEditingCurrently)
  {
      // end editing
      m_xTreeView->end_editing();
      m_xEditingCurrently.reset();
  }
1348}

1350void FmFilterNavigator::Remove(FmFilterData const * pItem)
1351{
  // the entry for the data
  std::unique_ptr<weld::TreeIter> xEntry = FindEntry(pItem);
  if (!xEntry)
      return;

  if (m_xEditingCurrently && m_xTreeView->iter_compare(*xEntry, *m_xEditingCurrently) == 0)
      EndEditing();

  m_xTreeView->remove(*xEntry);
1361}

1363FmFormItem* FmFilterNavigator::getSelectedFilterItems(::std::vector<FmFilterItem*>& _rItemList)
1364{
  // be sure that the data is only used within only one form!
  FmFormItem* pFirstItem = nullptr;

  bool bHandled = true;
  bool bFoundSomething = false;

  m_xTreeView->selected_foreach([this, &bHandled, &bFoundSomething, &pFirstItem, &_rItemList](weld::TreeIter& rEntry) {
      FmFilterData* pFilterEntry = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(rEntry).toInt64());
      FmFilterItem* pFilter = dynamic_cast<FmFilterItem*>(pFilterEntry);
      if (pFilter)
      {
          FmFormItem* pForm = dynamic_cast<FmFormItem*>( pFilter->GetParent()->GetParent() );
          if (!pForm)
              bHandled = false;
          else if (!pFirstItem)
              pFirstItem = pForm;
          else if (pFirstItem != pForm)
              bHandled = false;

          if (bHandled)
          {
              _rItemList.push_back(pFilter);
              bFoundSomething = true;
          }
      }
      return !bHandled;
  });

  if ( !bHandled || !bFoundSomething )
      pFirstItem = nullptr;
  return pFirstItem;
1396}

1398void FmFilterNavigator::insertFilterItem(const ::std::vector<FmFilterItem*>& _rFilterList,FmFilterItems* _pTargetItems,bool _bCopy)
1399{
  for (FmFilterItem* pLookupItem : _rFilterList)
  {
      if ( pLookupItem->GetParent() == _pTargetItems )
          continue;

      FmFilterItem* pFilterItem = _pTargetItems->Find( pLookupItem->GetComponentIndex() );
      OUString aText = pLookupItem->GetText();
      if ( !pFilterItem )
      {
          pFilterItem = new FmFilterItem( _pTargetItems, pLookupItem->GetFieldName(), aText, pLookupItem->GetComponentIndex() );
          m_pModel->Append( _pTargetItems, std::unique_ptr<FmFilterItem>(pFilterItem) );
      }

      if ( !_bCopy )
          m_pModel->Remove( pLookupItem );

      // now set the text for the new dragged item
      m_pModel->SetTextForItem( pFilterItem, aText );
  }

  m_pModel->EnsureEmptyFilterRows( *_pTargetItems->GetParent() );
1421}

1423IMPL_LINK(FmFilterNavigator, DragBeginHdl, bool&, rUnsetDragIcon, bool)bool FmFilterNavigator::LinkStubDragBeginHdl(void * instance,
 bool& data) { return static_cast<FmFilterNavigator *>
(instance)->DragBeginHdl(data); } bool FmFilterNavigator::
DragBeginHdl(bool& rUnsetDragIcon)
1424{
  rUnsetDragIcon = false;

  // be sure that the data is only used within an only one form!
  m_aControlExchange.prepareDrag();

  ::std::vector<FmFilterItem*> aItemList;
  if (FmFormItem* pFirstItem = getSelectedFilterItems(aItemList))
  {
      m_aControlExchange->setDraggedEntries(aItemList);
      m_aControlExchange->setFormItem(pFirstItem);

      OFilterItemExchange& rExchange = *m_aControlExchange;
      rtl::Reference<TransferDataContainer> xHelper(&rExchange);
      m_xTreeView->enable_drag_source(xHelper, DND_ACTION_COPYMOVEcss::datatransfer::dnd::DNDConstants::ACTION_COPY_OR_MOVE);
      rExchange.setDragging(true);

      return false;
  }
  return true;
1444}

1446IMPL_LINK(FmFilterNavigator, PopupMenuHdl, const CommandEvent&, rEvt, bool)bool FmFilterNavigator::LinkStubPopupMenuHdl(void * instance,
 const CommandEvent& data) { return static_cast<FmFilterNavigator
 *>(instance)->PopupMenuHdl(data); } bool FmFilterNavigator
::PopupMenuHdl(const CommandEvent& rEvt)
1447{
  bool bHandled = false;
  switch (rEvt.GetCommand())
  {
      case CommandEventId::ContextMenu:
      {
          // the place where it was clicked
          Point aWhere;
          std::unique_ptr<weld::TreeIter> xClicked(m_xTreeView->make_iterator());
          if (rEvt.IsMouseEvent())
          {
              aWhere = rEvt.GetMousePosPixel();
              if (!m_xTreeView->get_dest_row_at_pos(aWhere, xClicked.get(), false))
                  break;

              if (!m_xTreeView->is_selected(*xClicked))
              {
                  m_xTreeView->unselect_all();
                  m_xTreeView->select(*xClicked);
                  m_xTreeView->set_cursor(*xClicked);
              }
          }
          else
          {
              if (!m_xTreeView->get_cursor(xClicked.get()))
                  break;
              aWhere = m_xTreeView->get_row_area(*xClicked).Center();
          }

          ::std::vector<FmFilterData*> aSelectList;
          m_xTreeView->selected_foreach([this, &aSelectList](weld::TreeIter& rEntry) {
              FmFilterData* pFilterEntry = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(rEntry).toInt64());

              // don't delete forms
              FmFormItem* pForm = dynamic_cast<FmFormItem*>(pFilterEntry);
              if (!pForm)
                  aSelectList.push_back(pFilterEntry);

              return false;
          });

          if (aSelectList.size() == 1)
          {
              // don't delete the only empty row of a form
              FmFilterItems* pFilterItems = dynamic_cast<FmFilterItems*>( aSelectList[0] );
              if (pFilterItems && pFilterItems->GetChildren().empty()
                  && pFilterItems->GetParent()->GetChildren().size() == 1)
                  aSelectList.clear();
          }

          std::unique_ptr<weld::Builder> xBuilder(Application::CreateBuilder(m_xTreeView.get(), "svx/ui/filtermenu.ui"));
          std::unique_ptr<weld::Menu> xContextMenu(xBuilder->weld_menu("menu"));

          // every condition could be deleted except the first one if it's the only one
          bool bNoDelete = false;
          if (aSelectList.empty())
          {
              bNoDelete = true;
              xContextMenu->remove("delete");
          }

          FmFilterData* pFilterEntry = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(*xClicked).toInt64());
          bool bEdit = dynamic_cast<FmFilterItem*>(pFilterEntry) != nullptr &&
              m_xTreeView->is_selected(*xClicked) && m_xTreeView->count_selected_rows() == 1;

          if (bNoDelete && !bEdit)
          {
              // nothing is in the menu, don't bother
              return true;
          }

          if (!bEdit)
          {
              xContextMenu->remove("edit");
              xContextMenu->remove("isnull");
              xContextMenu->remove("isnotnull");
          }

          OString sIdent = xContextMenu->popup_at_rect(m_xTreeView.get(), tools::Rectangle(aWhere, ::Size(1, 1)));
          if (sIdent == "edit")
          {
              m_xTreeView->start_editing(*xClicked);
          }
          else if (sIdent == "isnull")
          {
              OUString aErrorMsg;
              OUString aText = "IS NULL";
              m_pModel->ValidateText(static_cast<FmFilterItem*>(pFilterEntry),
                                      aText, aErrorMsg);
              m_pModel->SetTextForItem(static_cast<FmFilterItem*>(pFilterEntry), aText);
          }
          else if (sIdent == "isnotnull")
          {
              OUString aErrorMsg;
              OUString aText = "IS NOT NULL";

              m_pModel->ValidateText(static_cast<FmFilterItem*>(pFilterEntry),
                                      aText, aErrorMsg);
              m_pModel->SetTextForItem(static_cast<FmFilterItem*>(pFilterEntry), aText);
          }
          else if (sIdent == "delete")
          {
              DeleteSelection();
          }
          bHandled = true;
      }
      break;
      default: break;
  }

  return bHandled;
1558}

1560typedef std::vector<std::unique_ptr<weld::TreeIter>> iter_vector;

1562bool FmFilterNavigator::getNextEntry(weld::TreeIter& rEntry)
1563{
  bool bEntry = m_xTreeView->iter_next(rEntry);
  // we need the next filter entry
  if (bEntry)
  {
      while (!m_xTreeView->iter_has_child(rEntry))
      {
          std::unique_ptr<weld::TreeIter> xNext = m_xTreeView->make_iterator(&rEntry);
          if (!m_xTreeView->iter_next(*xNext))
              break;
          m_xTreeView->copy_iterator(*xNext, rEntry);
      }
  }
  return bEntry;
1577}

1579bool FmFilterNavigator::getPrevEntry(weld::TreeIter& rEntry)
1580{
  bool bEntry = m_xTreeView->iter_previous(rEntry);
  // check if the previous entry is a filter, if so get the next prev
  if (bEntry && m_xTreeView->iter_has_child(rEntry))
  {
      bEntry = m_xTreeView->iter_previous(rEntry);
      // if the entry is still no leaf return
      if (bEntry && m_xTreeView->iter_has_child(rEntry))
          bEntry = false;
  }
  return bEntry;
1591}
1592IMPL_LINK(FmFilterNavigator, KeyInputHdl, const ::KeyEvent&, rKEvt, bool)bool FmFilterNavigator::LinkStubKeyInputHdl(void * instance, const
 ::KeyEvent& data) { return static_cast<FmFilterNavigator
 *>(instance)->KeyInputHdl(data); } bool FmFilterNavigator
::KeyInputHdl(const ::KeyEvent& rKEvt)
1593{
  const vcl::KeyCode& rKeyCode = rKEvt.GetKeyCode();

  switch ( rKeyCode.GetCode() )
  {
      case KEY_UP:
      case KEY_DOWN:
      {
          if ( !rKeyCode.IsMod1() || !rKeyCode.IsMod2() || rKeyCode.IsShift() )
              break;

          ::std::vector<FmFilterItem*> aItemList;
          if ( !getSelectedFilterItems( aItemList ) )
              break;


          iter_vector aSelected;
          m_xTreeView->selected_foreach([this, &aSelected](weld::TreeIter& rEntry){
              aSelected.emplace_back(m_xTreeView->make_iterator(&rEntry));
              return false;
          });

          std::unique_ptr<weld::TreeIter> xTarget;
          ::std::function<bool(FmFilterNavigator*, weld::TreeIter&)> getter;

          if (rKeyCode.GetCode() == KEY_UP)
          {
              xTarget = m_xTreeView->make_iterator(aSelected.front().get());
              getter = ::std::mem_fn(&FmFilterNavigator::getPrevEntry);
          }
          else
          {
              xTarget = m_xTreeView->make_iterator(aSelected.back().get());
              getter = ::std::mem_fn(&FmFilterNavigator::getNextEntry);
          }

          bool bTarget = getter(this, *xTarget);
          if (!bTarget)
              break;

          FmFilterItems* pTargetItems = getTargetItems(*m_xTreeView, *xTarget);
          if (!pTargetItems)
              break;

          ::std::vector<FmFilterItem*>::const_iterator aEnd = aItemList.end();
          bool bNextTargetItem = true;
          while ( bNextTargetItem )
          {
              ::std::vector<FmFilterItem*>::const_iterator i = aItemList.begin();
              for (; i != aEnd; ++i)
              {
                  if ( (*i)->GetParent() == pTargetItems )
                  {
                      bTarget = getter(this, *xTarget);
                      if (!bTarget)
                          return true;
                      pTargetItems = getTargetItems(*m_xTreeView, *xTarget);
                      break;
                  }
                  else
                  {
                      FmFilterItem* pFilterItem = pTargetItems->Find( (*i)->GetComponentIndex() );
                      // we found the text component so jump above
                      if ( pFilterItem )
                      {
                          bTarget = getter(this, *xTarget);
                          if (!bTarget)
                              return true;

                          pTargetItems = getTargetItems(*m_xTreeView, *xTarget);
                          break;
                      }
                  }
              }
              bNextTargetItem = i != aEnd && pTargetItems;
          }

          if ( pTargetItems )
          {
              insertFilterItem( aItemList, pTargetItems, false );
              return true;
          }
      }
      break;

      case KEY_DELETE:
      {
          if ( rKeyCode.GetModifier() )
              break;

          std::unique_ptr<weld::TreeIter> xEntry = m_xTreeView->make_iterator();
          if (m_xTreeView->get_iter_first(*xEntry) && !m_xTreeView->is_selected(*xEntry))
              DeleteSelection();

          return true;
      }
  }

  return false;
1692}

1694void FmFilterNavigator::DeleteSelection()
1695{
  // to avoid the deletion of an entry twice (e.g. deletion of a parent and afterward
  // the deletion of its child, I have to shrink the selection list
  std::vector<FmFilterData*> aEntryList;

  m_xTreeView->selected_foreach([this, &aEntryList](weld::TreeIter& rEntry) {
      FmFilterData* pFilterEntry = reinterpret_cast<FmFilterData*>(m_xTreeView->get_id(rEntry).toInt64());

      if (dynamic_cast<FmFilterItem*>(pFilterEntry))
      {
          std::unique_ptr<weld::TreeIter> xParent(m_xTreeView->make_iterator(&rEntry));
          if (m_xTreeView->iter_parent(*xParent) && m_xTreeView->is_selected(*xParent))
              return false;
      }

      FmFormItem* pForm = dynamic_cast<FmFormItem*>(pFilterEntry);
      if (!pForm)
          aEntryList.emplace_back(pFilterEntry);

      return false;
  });

  // Remove the selection
  m_xTreeView->unselect_all();

  for (auto i = aEntryList.rbegin(); i != aEntryList.rend(); ++i)
      m_pModel->Remove(*i);
1722}

1724FmFilterNavigatorWin::FmFilterNavigatorWin(SfxBindings* _pBindings, SfxChildWindow* _pMgr,
                                         vcl::Window* _pParent)
  : SfxDockingWindow(_pBindings, _pMgr, _pParent, "FilterNavigator", "svx/ui/filternavigator.ui")
  , SfxControllerItem( SID_FM_FILTER_NAVIGATOR_CONTROL( 10000 + 752 ), *_pBindings )
  , m_xNavigatorTree(new FmFilterNavigator(this, m_xBuilder->weld_tree_view("treeview")))
1729{
  SetHelpId( HID_FILTER_NAVIGATOR_WIN"SVX_HID_FILTER_NAVIGATOR_WIN" );

  SetText( SvxResId(RID_STR_FILTER_NAVIGATORreinterpret_cast<char const *>("RID_STR_FILTER_NAVIGATOR"
 "\004" u8"Filter navigator")) );
  SfxDockingWindow::SetFloatingSize( Size(200,200) );
1734}

1736FmFilterNavigatorWin::~FmFilterNavigatorWin()
1737{
  disposeOnce();
1739}

1741void FmFilterNavigatorWin::dispose()
1742{
  m_xNavigatorTree.reset();
  ::SfxControllerItem::dispose();
  SfxDockingWindow::dispose();
1746}

1748void FmFilterNavigatorWin::UpdateContent(FmFormShell const * pFormShell)
1749{
  if (!m_xNavigatorTree)
      return;

  if (!pFormShell)
      m_xNavigatorTree->UpdateContent( nullptr, nullptr );
  else
  {
      Reference<XFormController> const xController(pFormShell->GetImpl()->getActiveInternalController_Lock());
      Reference< XIndexAccess >   xContainer;
      if (xController.is())
      {
          Reference< XChild >  xChild = xController;
          for (Reference< XInterface >  xParent(xChild->getParent());
               xParent.is();
               xParent = xChild.is() ? xChild->getParent() : Reference< XInterface > ())
          {
              xContainer.set(xParent, UNO_QUERY);
              xChild.set(xParent, UNO_QUERY);
          }
      }
      m_xNavigatorTree->UpdateContent(xContainer, xController);
  }
1772}

1774void FmFilterNavigatorWin::StateChanged( sal_uInt16 nSID, SfxItemState eState, const SfxPoolItem* pState )
1775{
  if( !pState  || SID_FM_FILTER_NAVIGATOR_CONTROL( 10000 + 752 ) != nSID )
      return;

  if( eState >= SfxItemState::DEFAULT )
  {
      FmFormShell* pShell = dynamic_cast<FmFormShell*>( static_cast<const SfxObjectItem*>(pState)->GetShell()  );
      UpdateContent( pShell );
  }
  else
      UpdateContent( nullptr );
1786}

1788bool FmFilterNavigatorWin::Close()
1789{
  if (m_xNavigatorTree)
      m_xNavigatorTree->EndEditing();

  UpdateContent( nullptr );
  return SfxDockingWindow::Close();
1795}

1797void FmFilterNavigatorWin::FillInfo( SfxChildWinInfo& rInfo ) const
1798{
  SfxDockingWindow::FillInfo( rInfo );
  rInfo.bVisible = false;
1801}

1803Size FmFilterNavigatorWin::CalcDockingSize( SfxChildAlignment eAlign )
1804{
  if ( ( eAlign == SfxChildAlignment::TOP ) || ( eAlign == SfxChildAlignment::BOTTOM ) )
      return Size();

  return SfxDockingWindow::CalcDockingSize( eAlign );
1809}

1811SfxChildAlignment FmFilterNavigatorWin::CheckAlignment( SfxChildAlignment eActAlign, SfxChildAlignment eAlign )
1812{
  switch (eAlign)
  {
      case SfxChildAlignment::LEFT:
      case SfxChildAlignment::RIGHT:
      case SfxChildAlignment::NOALIGNMENT:
          return eAlign;
      default:
          break;
  }

  return eActAlign;
1824}

1826void FmFilterNavigatorWin::GetFocus()
1827{
  // oj #97405#
  if (m_xNavigatorTree)
      m_xNavigatorTree->GrabFocus();
  else
      SfxDockingWindow::GetFocus();
1833}

1835SFX_IMPL_DOCKINGWINDOW( FmFilterNavigatorWinMgr, SID_FM_FILTER_NAVIGATOR )std::unique_ptr<SfxChildWindow> FmFilterNavigatorWinMgr
::CreateImpl( vcl::Window *pParent, sal_uInt16 nId, SfxBindings
 *pBindings, SfxChildWinInfo* pInfo ) { return std::make_unique
<FmFilterNavigatorWinMgr>(pParent, nId, pBindings, pInfo
); } void FmFilterNavigatorWinMgr::RegisterChildWindow (bool bVis
, SfxModule *pMod, SfxChildWindowFlags nFlags) { auto pFact =
 std::make_unique<SfxChildWinFactory>( FmFilterNavigatorWinMgr
::CreateImpl, ( 10000 + 732 ), (32767 *2 +1) ); pFact->aInfo
.nFlags |= nFlags; pFact->aInfo.bVisible = bVis; SfxChildWindow
::RegisterChildWindow(pMod, std::move(pFact)); } SfxChildWinInfo
 FmFilterNavigatorWinMgr::GetInfo() const { SfxChildWinInfo aInfo
 = SfxChildWindow::GetInfo(); static_cast<SfxDockingWindow
*>(GetWindow())->FillInfo( aInfo ); return aInfo; }
1
Calling 'make_unique<svxform::FmFilterNavigatorWinMgr, vcl::Window *&, unsigned short &, SfxBindings *&, SfxChildWinInfo *&>'→


1838FmFilterNavigatorWinMgr::FmFilterNavigatorWinMgr( vcl::Window *_pParent, sal_uInt16 _nId,
                                  SfxBindings *_pBindings, SfxChildWinInfo* _pInfo )
               :SfxChildWindow( _pParent, _nId )
1841{
  SetWindow( VclPtr<FmFilterNavigatorWin>::Create( _pBindings, this, _pParent ) );
3
←
Calling 'VclPtr::Create'→
5
←
Returned allocated memory→
6
←
Calling implicit destructor for 'VclPtr<vcl::Window>'→
7
←
Calling '~Reference'→
14
←
Returning from '~Reference'→
15
←
Returning from destructor for 'VclPtr<vcl::Window>'→
16
←
Calling implicit destructor for 'VclPtr<svxform::FmFilterNavigatorWin>'→
17
←
Calling '~Reference'→
  static_cast<SfxDockingWindow*>(GetWindow())->Initialize( _pInfo );
1844}


1847}

1849/* vim:set shiftwidth=4 softtabstop=4 expandtab: */

←

/usr/bin/../lib/gcc/x86_64-redhat-linux/10/../../../../include/c++/10/bits/unique_ptr.h

→

1// unique_ptr implementation -*- C++ -*-

3// Copyright (C) 2008-2020 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library.  This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.

11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14// GNU General Public License for more details.

16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.

20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.

25/** @file bits/unique_ptr.h
*  This is an internal header file, included by other library headers.
*  Do not attempt to use it directly. @headername{memory}
*/

30#ifndef _UNIQUE_PTR_H1
31#define _UNIQUE_PTR_H1 1

33#include <bits/c++config.h>
34#include <debug/assertions.h>
35#include <type_traits>
36#include <utility>
37#include <tuple>
38#include <bits/stl_function.h>
39#include <bits/functional_hash.h>
40#if __cplusplus201703L > 201703L
41# include <compare>
42# include <ostream>
43#endif

45namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
46{
47_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
 * @addtogroup pointer_abstractions
 * @{
 */

54#if _GLIBCXX_USE_DEPRECATED1
55#pragma GCC diagnostic push
56#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
template<typename> class auto_ptr;
58#pragma GCC diagnostic pop
59#endif

/// Primary template of default_delete, used by unique_ptr for single objects
template<typename _Tp>
  struct default_delete
  {
    /// Default constructor
    constexpr default_delete() noexcept = default;

    /** @brief Converting constructor.
     *
     * Allows conversion from a deleter for objects of another type, `_Up`,
     * only if `_Up*` is convertible to `_Tp*`.
     */
    template<typename _Up,
      typename = _Require<is_convertible<_Up*, _Tp*>>>
      default_delete(const default_delete<_Up>&) noexcept { }

    /// Calls `delete __ptr`
    void
    operator()(_Tp* __ptr) const
    {
static_assert(!is_void<_Tp>::value,
      "can't delete pointer to incomplete type");
static_assert(sizeof(_Tp)>0,
      "can't delete pointer to incomplete type");
delete __ptr;
    }
  };

// _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 740 - omit specialization for array objects with a compile time length

/// Specialization of default_delete for arrays, used by `unique_ptr<T[]>`
template<typename _Tp>
  struct default_delete<_Tp[]>
  {
  public:
    /// Default constructor
    constexpr default_delete() noexcept = default;

    /** @brief Converting constructor.
     *
     * Allows conversion from a deleter for arrays of another type, such as
     * a const-qualified version of `_Tp`.
     *
     * Conversions from types derived from `_Tp` are not allowed because
     * it is undefined to `delete[]` an array of derived types through a
     * pointer to the base type.
     */
    template<typename _Up,
      typename = _Require<is_convertible<_Up(*)[], _Tp(*)[]>>>
      default_delete(const default_delete<_Up[]>&) noexcept { }

    /// Calls `delete[] __ptr`
    template<typename _Up>
typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type
operator()(_Up* __ptr) const
{
 static_assert(sizeof(_Tp)>0,
	"can't delete pointer to incomplete type");
 delete [] __ptr;
}
  };

/// @cond undocumented

// Manages the pointer and deleter of a unique_ptr
template <typename _Tp, typename _Dp>
  class __uniq_ptr_impl
  {
    template <typename _Up, typename _Ep, typename = void>
struct _Ptr
{
 using type = _Up*;
};

    template <typename _Up, typename _Ep>
struct
_Ptr<_Up, _Ep, __void_t<typename remove_reference<_Ep>::type::pointer>>
{
 using type = typename remove_reference<_Ep>::type::pointer;
};

  public:
    using _DeleterConstraint = enable_if<
      __and_<__not_<is_pointer<_Dp>>,
      is_default_constructible<_Dp>>::value>;

    using pointer = typename _Ptr<_Tp, _Dp>::type;

    static_assert( !is_rvalue_reference<_Dp>::value,
     "unique_ptr's deleter type must be a function object type"
     " or an lvalue reference type" );

    __uniq_ptr_impl() = default;
    __uniq_ptr_impl(pointer __p) : _M_t() { _M_ptr() = __p; }

    template<typename _Del>
    __uniq_ptr_impl(pointer __p, _Del&& __d)
: _M_t(__p, std::forward<_Del>(__d)) { }

    __uniq_ptr_impl(__uniq_ptr_impl&& __u) noexcept
    : _M_t(std::move(__u._M_t))
    { __u._M_ptr() = nullptr; }

    __uniq_ptr_impl& operator=(__uniq_ptr_impl&& __u) noexcept
    {
reset(__u.release());
_M_deleter() = std::forward<_Dp>(__u._M_deleter());
return *this;
    }

    pointer&   _M_ptr() { return std::get<0>(_M_t); }
    pointer    _M_ptr() const { return std::get<0>(_M_t); }
    _Dp&       _M_deleter() { return std::get<1>(_M_t); }
    const _Dp& _M_deleter() const { return std::get<1>(_M_t); }

    void reset(pointer __p) noexcept
    {
const pointer __old_p = _M_ptr();
_M_ptr() = __p;
if (__old_p)
 _M_deleter()(__old_p);
    }

    pointer release() noexcept
    {
pointer __p = _M_ptr();
_M_ptr() = nullptr;
return __p;
    }

    void
    swap(__uniq_ptr_impl& __rhs) noexcept
    {
using std::swap;
swap(this->_M_ptr(), __rhs._M_ptr());
swap(this->_M_deleter(), __rhs._M_deleter());
    }

  private:
    tuple<pointer, _Dp> _M_t;
  };

// Defines move construction + assignment as either defaulted or deleted.
template <typename _Tp, typename _Dp,
   bool = is_move_constructible<_Dp>::value,
   bool = is_move_assignable<_Dp>::value>
  struct __uniq_ptr_data : __uniq_ptr_impl<_Tp, _Dp>
  {
    using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
    __uniq_ptr_data(__uniq_ptr_data&&) = default;
    __uniq_ptr_data& operator=(__uniq_ptr_data&&) = default;
  };

template <typename _Tp, typename _Dp>
  struct __uniq_ptr_data<_Tp, _Dp, true, false> : __uniq_ptr_impl<_Tp, _Dp>
  {
    using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
    __uniq_ptr_data(__uniq_ptr_data&&) = default;
    __uniq_ptr_data& operator=(__uniq_ptr_data&&) = delete;
  };

template <typename _Tp, typename _Dp>
  struct __uniq_ptr_data<_Tp, _Dp, false, true> : __uniq_ptr_impl<_Tp, _Dp>
  {
    using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
    __uniq_ptr_data(__uniq_ptr_data&&) = delete;
    __uniq_ptr_data& operator=(__uniq_ptr_data&&) = default;
  };

template <typename _Tp, typename _Dp>
  struct __uniq_ptr_data<_Tp, _Dp, false, false> : __uniq_ptr_impl<_Tp, _Dp>
  {
    using __uniq_ptr_impl<_Tp, _Dp>::__uniq_ptr_impl;
    __uniq_ptr_data(__uniq_ptr_data&&) = delete;
    __uniq_ptr_data& operator=(__uniq_ptr_data&&) = delete;
  };
/// @endcond

/// 20.7.1.2 unique_ptr for single objects.
template <typename _Tp, typename _Dp = default_delete<_Tp>>
  class unique_ptr
  {
    template <typename _Up>
using _DeleterConstraint =
 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;

    __uniq_ptr_data<_Tp, _Dp> _M_t;

  public:
    using pointer	  = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
    using element_type  = _Tp;
    using deleter_type  = _Dp;

  private:
    // helper template for detecting a safe conversion from another
    // unique_ptr
    template<typename _Up, typename _Ep>
using __safe_conversion_up = __and_<
 is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>,
 __not_<is_array<_Up>>
      >;

  public:
    // Constructors.

    /// Default constructor, creates a unique_ptr that owns nothing.
    template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
constexpr unique_ptr() noexcept
: _M_t()
{ }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     *
     * The deleter will be value-initialized.
     */
    template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
explicit
unique_ptr(pointer __p) noexcept
: _M_t(__p)
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p __d
     */
    template<typename _Del = deleter_type,
      typename = _Require<is_copy_constructible<_Del>>>
unique_ptr(pointer __p, const deleter_type& __d) noexcept
: _M_t(__p, __d) { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an object of @c element_type
     * @param __d  An rvalue reference to a (non-reference) deleter.
     *
     * The deleter will be initialized with @p std::move(__d)
     */
    template<typename _Del = deleter_type,
      typename = _Require<is_move_constructible<_Del>>>
unique_ptr(pointer __p,
   __enable_if_t<!is_lvalue_reference<_Del>::value,
		 _Del&&> __d) noexcept
: _M_t(__p, std::move(__d))
{ }

    template<typename _Del = deleter_type,
      typename _DelUnref = typename remove_reference<_Del>::type>
unique_ptr(pointer,
   __enable_if_t<is_lvalue_reference<_Del>::value,
		 _DelUnref&&>) = delete;

    /// Creates a unique_ptr that owns nothing.
    template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
constexpr unique_ptr(nullptr_t) noexcept
: _M_t()
{ }

    // Move constructors.

    /// Move constructor.
    unique_ptr(unique_ptr&&) = default;

    /** @brief Converting constructor from another type
     *
     * Requires that the pointer owned by @p __u is convertible to the
     * type of pointer owned by this object, @p __u does not own an array,
     * and @p __u has a compatible deleter type.
     */
    template<typename _Up, typename _Ep, typename = _Require<
             __safe_conversion_up<_Up, _Ep>,
      typename conditional<is_reference<_Dp>::value,
		    is_same<_Ep, _Dp>,
		    is_convertible<_Ep, _Dp>>::type>>
unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
: _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
{ }

344#if _GLIBCXX_USE_DEPRECATED1
345#pragma GCC diagnostic push
346#pragma GCC diagnostic ignored "-Wdeprecated-declarations"
    /// Converting constructor from @c auto_ptr
    template<typename _Up, typename = _Require<
      is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>>
unique_ptr(auto_ptr<_Up>&& __u) noexcept;
351#pragma GCC diagnostic pop
352#endif

    /// Destructor, invokes the deleter if the stored pointer is not null.
    ~unique_ptr() noexcept
    {
static_assert(__is_invocable<deleter_type&, pointer>::value,
      "unique_ptr's deleter must be invocable with a pointer");
auto& __ptr = _M_t._M_ptr();
if (__ptr != nullptr)
 get_deleter()(std::move(__ptr));
__ptr = pointer();
    }

    // Assignment.

    /** @brief Move assignment operator.
     *
     * Invokes the deleter if this object owns a pointer.
     */
    unique_ptr& operator=(unique_ptr&&) = default;

    /** @brief Assignment from another type.
     *
     * @param __u  The object to transfer ownership from, which owns a
     *             convertible pointer to a non-array object.
     *
     * Invokes the deleter if this object owns a pointer.
     */
    template<typename _Up, typename _Ep>
      typename enable_if< __and_<
        __safe_conversion_up<_Up, _Ep>,
        is_assignable<deleter_type&, _Ep&&>
        >::value,
        unique_ptr&>::type
operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
{
 reset(__u.release());
 get_deleter() = std::forward<_Ep>(__u.get_deleter());
 return *this;
}

    /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
    unique_ptr&
    operator=(nullptr_t) noexcept
    {
reset();
return *this;
    }

    // Observers.

    /// Dereference the stored pointer.
    typename add_lvalue_reference<element_type>::type
    operator*() const
    {
__glibcxx_assert(get() != pointer());
return *get();
    }

    /// Return the stored pointer.
    pointer
    operator->() const noexcept
    {
_GLIBCXX_DEBUG_PEDASSERT(get() != pointer());
return get();
    }

    /// Return the stored pointer.
    pointer
    get() const noexcept
    { return _M_t._M_ptr(); }

    /// Return a reference to the stored deleter.
    deleter_type&
    get_deleter() noexcept
    { return _M_t._M_deleter(); }

    /// Return a reference to the stored deleter.
    const deleter_type&
    get_deleter() const noexcept
    { return _M_t._M_deleter(); }

    /// Return @c true if the stored pointer is not null.
    explicit operator bool() const noexcept
    { return get() == pointer() ? false : true; }

    // Modifiers.

    /// Release ownership of any stored pointer.
    pointer
    release() noexcept
    { return _M_t.release(); }

    /** @brief Replace the stored pointer.
     *
     * @param __p  The new pointer to store.
     *
     * The deleter will be invoked if a pointer is already owned.
     */
    void
    reset(pointer __p = pointer()) noexcept
    {
static_assert(__is_invocable<deleter_type&, pointer>::value,
      "unique_ptr's deleter must be invocable with a pointer");
_M_t.reset(std::move(__p));
    }

    /// Exchange the pointer and deleter with another object.
    void
    swap(unique_ptr& __u) noexcept
    {
static_assert(__is_swappable<_Dp>::value, "deleter must be swappable");
_M_t.swap(__u._M_t);
    }

    // Disable copy from lvalue.
    unique_ptr(const unique_ptr&) = delete;
    unique_ptr& operator=(const unique_ptr&) = delete;
};

/// 20.7.1.3 unique_ptr for array objects with a runtime length
// [unique.ptr.runtime]
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// DR 740 - omit specialization for array objects with a compile time length
template<typename _Tp, typename _Dp>
  class unique_ptr<_Tp[], _Dp>
  {
    template <typename _Up>
    using _DeleterConstraint =
typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;

    __uniq_ptr_data<_Tp, _Dp> _M_t;

    template<typename _Up>
using __remove_cv = typename remove_cv<_Up>::type;

    // like is_base_of<_Tp, _Up> but false if unqualified types are the same
    template<typename _Up>
using __is_derived_Tp
 = __and_< is_base_of<_Tp, _Up>,
    __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;

  public:
    using pointer	  = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
    using element_type  = _Tp;
    using deleter_type  = _Dp;

    // helper template for detecting a safe conversion from another
    // unique_ptr
    template<typename _Up, typename _Ep,
             typename _UPtr = unique_ptr<_Up, _Ep>,
      typename _UP_pointer = typename _UPtr::pointer,
      typename _UP_element_type = typename _UPtr::element_type>
using __safe_conversion_up = __and_<
        is_array<_Up>,
        is_same<pointer, element_type*>,
        is_same<_UP_pointer, _UP_element_type*>,
        is_convertible<_UP_element_type(*)[], element_type(*)[]>
      >;

    // helper template for detecting a safe conversion from a raw pointer
    template<typename _Up>
      using __safe_conversion_raw = __and_<
        __or_<__or_<is_same<_Up, pointer>,
                    is_same<_Up, nullptr_t>>,
              __and_<is_pointer<_Up>,
                     is_same<pointer, element_type*>,
                     is_convertible<
                       typename remove_pointer<_Up>::type(*)[],
                       element_type(*)[]>
              >
        >
      >;

    // Constructors.

    /// Default constructor, creates a unique_ptr that owns nothing.
    template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
constexpr unique_ptr() noexcept
: _M_t()
{ }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     *
     * The deleter will be value-initialized.
     */
    template<typename _Up,
      typename _Vp = _Dp,
      typename = _DeleterConstraint<_Vp>,
      typename = typename enable_if<
               __safe_conversion_raw<_Up>::value, bool>::type>
explicit
unique_ptr(_Up __p) noexcept
: _M_t(__p)
      { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p __d
     */
    template<typename _Up, typename _Del = deleter_type,
      typename = _Require<__safe_conversion_raw<_Up>,
		   is_copy_constructible<_Del>>>
    unique_ptr(_Up __p, const deleter_type& __d) noexcept
    : _M_t(__p, __d) { }

    /** Takes ownership of a pointer.
     *
     * @param __p  A pointer to an array of a type safely convertible
     * to an array of @c element_type
     * @param __d  A reference to a deleter.
     *
     * The deleter will be initialized with @p std::move(__d)
     */
    template<typename _Up, typename _Del = deleter_type,
      typename = _Require<__safe_conversion_raw<_Up>,
		   is_move_constructible<_Del>>>
unique_ptr(_Up __p,
   __enable_if_t<!is_lvalue_reference<_Del>::value,
		 _Del&&> __d) noexcept
: _M_t(std::move(__p), std::move(__d))
{ }

    template<typename _Up, typename _Del = deleter_type,
      typename _DelUnref = typename remove_reference<_Del>::type,
      typename = _Require<__safe_conversion_raw<_Up>>>
unique_ptr(_Up,
   __enable_if_t<is_lvalue_reference<_Del>::value,
		 _DelUnref&&>) = delete;

    /// Move constructor.
    unique_ptr(unique_ptr&&) = default;

    /// Creates a unique_ptr that owns nothing.
    template<typename _Del = _Dp, typename = _DeleterConstraint<_Del>>
constexpr unique_ptr(nullptr_t) noexcept
: _M_t()
      { }

    template<typename _Up, typename _Ep, typename = _Require<
      __safe_conversion_up<_Up, _Ep>,
      typename conditional<is_reference<_Dp>::value,
		    is_same<_Ep, _Dp>,
		    is_convertible<_Ep, _Dp>>::type>>
unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
: _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter()))
{ }

    /// Destructor, invokes the deleter if the stored pointer is not null.
    ~unique_ptr()
    {
auto& __ptr = _M_t._M_ptr();
if (__ptr != nullptr)
 get_deleter()(__ptr);
__ptr = pointer();
    }

    // Assignment.

    /** @brief Move assignment operator.
     *
     * Invokes the deleter if this object owns a pointer.
     */
    unique_ptr&
    operator=(unique_ptr&&) = default;

    /** @brief Assignment from another type.
     *
     * @param __u  The object to transfer ownership from, which owns a
     *             convertible pointer to an array object.
     *
     * Invokes the deleter if this object owns a pointer.
     */
    template<typename _Up, typename _Ep>
typename
enable_if<__and_<__safe_conversion_up<_Up, _Ep>,
                       is_assignable<deleter_type&, _Ep&&>
                >::value,
                unique_ptr&>::type
operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
{
 reset(__u.release());
 get_deleter() = std::forward<_Ep>(__u.get_deleter());
 return *this;
}

    /// Reset the %unique_ptr to empty, invoking the deleter if necessary.
    unique_ptr&
    operator=(nullptr_t) noexcept
    {
reset();
return *this;
    }

    // Observers.

    /// Access an element of owned array.
    typename std::add_lvalue_reference<element_type>::type
    operator[](size_t __i) const
    {
__glibcxx_assert(get() != pointer());
return get()[__i];
    }

    /// Return the stored pointer.
    pointer
    get() const noexcept
    { return _M_t._M_ptr(); }

    /// Return a reference to the stored deleter.
    deleter_type&
    get_deleter() noexcept
    { return _M_t._M_deleter(); }

    /// Return a reference to the stored deleter.
    const deleter_type&
    get_deleter() const noexcept
    { return _M_t._M_deleter(); }

    /// Return @c true if the stored pointer is not null.
    explicit operator bool() const noexcept
    { return get() == pointer() ? false : true; }

    // Modifiers.

    /// Release ownership of any stored pointer.
    pointer
    release() noexcept
    { return _M_t.release(); }

    /** @brief Replace the stored pointer.
     *
     * @param __p  The new pointer to store.
     *
     * The deleter will be invoked if a pointer is already owned.
     */
    template <typename _Up,
              typename = _Require<
                __or_<is_same<_Up, pointer>,
                      __and_<is_same<pointer, element_type*>,
                             is_pointer<_Up>,
                             is_convertible<
                               typename remove_pointer<_Up>::type(*)[],
                               element_type(*)[]
                             >
                      >
                >
             >>
    void
    reset(_Up __p) noexcept
    { _M_t.reset(std::move(__p)); }

    void reset(nullptr_t = nullptr) noexcept
    { reset(pointer()); }

    /// Exchange the pointer and deleter with another object.
    void
    swap(unique_ptr& __u) noexcept
    {
static_assert(__is_swappable<_Dp>::value, "deleter must be swappable");
_M_t.swap(__u._M_t);
    }

    // Disable copy from lvalue.
    unique_ptr(const unique_ptr&) = delete;
    unique_ptr& operator=(const unique_ptr&) = delete;
  };

/// @relates unique_ptr @{

/// Swap overload for unique_ptr
template<typename _Tp, typename _Dp>
  inline
732#if __cplusplus201703L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
  // Constrained free swap overload, see p0185r1
  typename enable_if<__is_swappable<_Dp>::value>::type
735#else
  void
737#endif
  swap(unique_ptr<_Tp, _Dp>& __x,
unique_ptr<_Tp, _Dp>& __y) noexcept
  { __x.swap(__y); }

742#if __cplusplus201703L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11
template<typename _Tp, typename _Dp>
  typename enable_if<!__is_swappable<_Dp>::value>::type
  swap(unique_ptr<_Tp, _Dp>&,
unique_ptr<_Tp, _Dp>&) = delete;
747#endif

/// Equality operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator==(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return __x.get() == __y.get(); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
  { return !__x; }

763#ifndef __cpp_lib_three_way_comparison
/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
  { return !__x; }

/// Inequality operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator!=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return __x.get() != __y.get(); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator!=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept
  { return (bool)__x; }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator!=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept
  { return (bool)__x; }
789#endif // three way comparison

/// Relational operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<(const unique_ptr<_Tp, _Dp>& __x,
     const unique_ptr<_Up, _Ep>& __y)
  {
    typedef typename
std::common_type<typename unique_ptr<_Tp, _Dp>::pointer,
                typename unique_ptr<_Up, _Ep>::pointer>::type _CT;
    return std::less<_CT>()(__x.get(), __y.get());
  }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  {
    return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
						 nullptr);
  }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  {
    return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
						 __x.get());
  }

/// Relational operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return !(__y < __x); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return !(nullptr < __x); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator<=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return !(__x < nullptr); }

/// Relational operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>(const unique_ptr<_Tp, _Dp>& __x,
     const unique_ptr<_Up, _Ep>& __y)
  { return (__y < __x); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  {
    return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr,
						 __x.get());
  }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  {
    return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(),
						 nullptr);
  }

/// Relational operator for unique_ptr objects, compares the owned pointers
template<typename _Tp, typename _Dp,
  typename _Up, typename _Ep>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>=(const unique_ptr<_Tp, _Dp>& __x,
      const unique_ptr<_Up, _Ep>& __y)
  { return !(__x < __y); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  { return !(__x < nullptr); }

/// unique_ptr comparison with nullptr
template<typename _Tp, typename _Dp>
  _GLIBCXX_NODISCARD[[__nodiscard__]] inline bool
  operator>=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x)
  { return !(nullptr < __x); }

888#ifdef __cpp_lib_three_way_comparison
template<typename _Tp, typename _Dp, typename _Up, typename _Ep>
  requires three_way_comparable_with<typename unique_ptr<_Tp, _Dp>::pointer,
		       typename unique_ptr<_Up, _Ep>::pointer>
  inline
  compare_three_way_result_t<typename unique_ptr<_Tp, _Dp>::pointer,
	       typename unique_ptr<_Up, _Ep>::pointer>
  operator<=>(const unique_ptr<_Tp, _Dp>& __x,
const unique_ptr<_Up, _Ep>& __y)
  { return compare_three_way()(__x.get(), __y.get()); }

template<typename _Tp, typename _Dp>
  requires three_way_comparable<typename unique_ptr<_Tp, _Dp>::pointer>
  inline
  compare_three_way_result_t<typename unique_ptr<_Tp, _Dp>::pointer>
  operator<=>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t)
  {
    using pointer = typename unique_ptr<_Tp, _Dp>::pointer;
    return compare_three_way()(__x.get(), static_cast<pointer>(nullptr));
  }
908#endif
// @} relates unique_ptr

/// @cond undocumented
template<typename _Up, typename _Ptr = typename _Up::pointer,
  bool = __poison_hash<_Ptr>::__enable_hash_call>
  struct __uniq_ptr_hash
915#if ! _GLIBCXX_INLINE_VERSION0
  : private __poison_hash<_Ptr>
917#endif
  {
    size_t
    operator()(const _Up& __u) const
    noexcept(noexcept(std::declval<hash<_Ptr>>()(std::declval<_Ptr>())))
    { return hash<_Ptr>()(__u.get()); }
  };

template<typename _Up, typename _Ptr>
  struct __uniq_ptr_hash<_Up, _Ptr, false>
  : private __poison_hash<_Ptr>
  { };
/// @endcond

/// std::hash specialization for unique_ptr.
template<typename _Tp, typename _Dp>
  struct hash<unique_ptr<_Tp, _Dp>>
  : public __hash_base<size_t, unique_ptr<_Tp, _Dp>>,
    public __uniq_ptr_hash<unique_ptr<_Tp, _Dp>>
  { };

938#if __cplusplus201703L >= 201402L
/// @relates unique_ptr @{
940#define __cpp_lib_make_unique201304 201304

/// @cond undocumented

template<typename _Tp>
  struct _MakeUniq
  { typedef unique_ptr<_Tp> __single_object; };

template<typename _Tp>
  struct _MakeUniq<_Tp[]>
  { typedef unique_ptr<_Tp[]> __array; };

template<typename _Tp, size_t _Bound>
  struct _MakeUniq<_Tp[_Bound]>
  { struct __invalid_type { }; };

/// @endcond

/// std::make_unique for single objects
template<typename _Tp, typename... _Args>
  inline typename _MakeUniq<_Tp>::__single_object
  make_unique(_Args&&... __args)
  { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); }
2
←
Calling constructor for 'FmFilterNavigatorWinMgr'→

/// std::make_unique for arrays of unknown bound
template<typename _Tp>
  inline typename _MakeUniq<_Tp>::__array
  make_unique(size_t __num)
  { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); }

/// Disable std::make_unique for arrays of known bound
template<typename _Tp, typename... _Args>
  inline typename _MakeUniq<_Tp>::__invalid_type
  make_unique(_Args&&...) = delete;
// @} relates unique_ptr
975#endif // C++14

977#if __cplusplus201703L > 201703L && __cpp_concepts
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// 2948. unique_ptr does not define operator<< for stream output
/// Stream output operator for unique_ptr
template<typename _CharT, typename _Traits, typename _Tp, typename _Dp>
  inline basic_ostream<_CharT, _Traits>&
  operator<<(basic_ostream<_CharT, _Traits>& __os,
      const unique_ptr<_Tp, _Dp>& __p)
  requires requires { __os << __p.get(); }
  {
    __os << __p.get();
    return __os;
  }
990#endif // C++20

// @} group pointer_abstractions

994#if __cplusplus201703L >= 201703L
namespace __detail::__variant
{
  template<typename> struct _Never_valueless_alt; // see <variant>

  // Provide the strong exception-safety guarantee when emplacing a
  // unique_ptr into a variant.
  template<typename _Tp, typename _Del>
    struct _Never_valueless_alt<std::unique_ptr<_Tp, _Del>>
    : std::true_type
    { };
}  // namespace __detail::__variant
1006#endif // C++17

1008_GLIBCXX_END_NAMESPACE_VERSION
1009} // namespace

1011#endif /* _UNIQUE_PTR_H */

←

/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx

→

1/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2/*
* 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 .
*/

20#ifndef INCLUDED_VCL_PTR_HXX
21#define INCLUDED_VCL_PTR_HXX

23#include <sal/config.h>

25#include <rtl/ref.hxx>

27#include <utility>
28#include <type_traits>

30#ifdef DBG_UTIL
31#ifndef _WIN32
32#include <vcl/vclmain.hxx>
33#endif
34#endif

36class VclReferenceBase;

38namespace vcl::detail {

40template<typename>
41constexpr bool isIncompleteOrDerivedFromVclReferenceBase(...) { return true; }

43template<typename T> constexpr bool isIncompleteOrDerivedFromVclReferenceBase(
  int (*)[sizeof(T)])
45{ return std::is_base_of<VclReferenceBase, T>::value; }

47} // namespace vcl::detail

49/**
* A thin wrapper around rtl::Reference to implement the acquire and dispose semantics we want for references to vcl::Window subclasses.
*
* For more details on the design please see vcl/README.lifecycle
*
* @param reference_type must be a subclass of vcl::Window
*/
56template <class reference_type>
57class VclPtr
58{
  static_assert(
      vcl::detail::isIncompleteOrDerivedFromVclReferenceBase<reference_type>(
          nullptr),
      "template argument type must be derived from VclReferenceBase");

  ::rtl::Reference<reference_type> m_rInnerRef;

66public:
  /** Constructor...
   */
  VclPtr()
      : m_rInnerRef()
  {}

  /** Constructor...
   */
  VclPtr (reference_type * pBody)
      : m_rInnerRef(pBody)
  {}

  /** Constructor... that doesn't take a ref.
   */
  VclPtr (reference_type * pBody, __sal_NoAcquire)
      : m_rInnerRef(pBody, SAL_NO_ACQUIRE)
  {}

  /** Up-casting conversion constructor: Copies interface reference.

      Does not work for up-casts to ambiguous bases.  For the special case of
      up-casting to Reference< XInterface >, see the corresponding conversion
      operator.

      @param rRef another reference
  */
  template< class derived_type >
  VclPtr(
      const VclPtr< derived_type > & rRef,
      typename std::enable_if<
          std::is_base_of<reference_type, derived_type>::value, int>::type
          = 0 )
      : m_rInnerRef( static_cast<reference_type*>(rRef) )
  {
  }

103#if defined(DBG_UTIL) && !defined(_WIN32)
  virtual ~VclPtr()
  {
      assert(m_rInnerRef.get() == nullptr || vclmain::isAlive())(static_cast <bool> (m_rInnerRef.get() == nullptr || vclmain
::isAlive()) ? void (0) : __assert_fail ("m_rInnerRef.get() == nullptr || vclmain::isAlive()"
, "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx"
, 106, __extension__ __PRETTY_FUNCTION__));
      // We can be one of the intermediate counts, but if we are the last
      // VclPtr keeping this object alive, then something forgot to call dispose().
      assert((!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1)(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef
->isDisposed() || m_rInnerRef->getRefCount() > 1) &&
 "someone forgot to call dispose()") ? void (0) : __assert_fail
 ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\""
, "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx"
, 110, __extension__ __PRETTY_FUNCTION__))
              && "someone forgot to call dispose()")(static_cast <bool> ((!m_rInnerRef.get() || m_rInnerRef
->isDisposed() || m_rInnerRef->getRefCount() > 1) &&
 "someone forgot to call dispose()") ? void (0) : __assert_fail
 ("(!m_rInnerRef.get() || m_rInnerRef->isDisposed() || m_rInnerRef->getRefCount() > 1) && \"someone forgot to call dispose()\""
, "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx"
, 110, __extension__ __PRETTY_FUNCTION__));
  }
  VclPtr(VclPtr const &) = default;
  VclPtr(VclPtr &&) = default;
  VclPtr & operator =(VclPtr const &) = default;
  VclPtr & operator =(VclPtr &&) = default;
116#endif

  /**
   * A construction helper for VclPtr. Since VclPtr types are created
   * with a reference-count of one - to help fit into the existing
   * code-flow; this helps us to construct them easily.
   *
   * For more details on the design please see vcl/README.lifecycle
   *
   * @tparam reference_type must be a subclass of vcl::Window
   */
  template<typename... Arg> [[nodiscard]] static VclPtr< reference_type > Create(Arg &&... arg)
  {
      return VclPtr< reference_type >( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE );
4
←
Memory is allocated→
  }

  /** Probably most common used: handle->someBodyOp().
   */
  reference_type * operator->() const
  {
      return m_rInnerRef.get();
  }

  /** Get the body. Can be used instead of operator->().
       I.e. handle->someBodyOp() and handle.get()->someBodyOp()
       are the same.
    */
  reference_type * get() const
  {
      return m_rInnerRef.get();
  }

  void set(reference_type *pBody)
  {
      m_rInnerRef.set(pBody);
  }

  void reset(reference_type *pBody)
  {
      m_rInnerRef.set(pBody);
  }

  /** Up-casting copy assignment operator.

      Does not work for up-casts to ambiguous bases.

      @param rRef another reference
  */
  template<typename derived_type>
  typename std::enable_if<
      std::is_base_of<reference_type, derived_type>::value,
      VclPtr &>::type
  operator =(VclPtr<derived_type> const & rRef)
  {
      m_rInnerRef.set(rRef.get());
      return *this;
  }

  VclPtr & operator =(reference_type * pBody)
  {
      m_rInnerRef.set(pBody);
      return *this;
  }

  operator reference_type * () const
  {
      return m_rInnerRef.get();
  }

  explicit operator bool () const
  {
      return m_rInnerRef.get() != nullptr;
  }

  void clear()
  {
      m_rInnerRef.clear();
  }

  void reset()
  {
      m_rInnerRef.clear();
  }

  void disposeAndClear()
  {
      // hold it alive for the lifetime of this method
      ::rtl::Reference<reference_type> aTmp(m_rInnerRef);
      m_rInnerRef.clear(); // we should use some 'swap' method ideally ;-)
      if (aTmp.get()) {
          aTmp->disposeOnce();
      }
  }

  /** Needed to place VclPtr's into STL collection.
   */
  bool operator< (const VclPtr<reference_type> & handle) const
  {
      return (m_rInnerRef < handle.m_rInnerRef);
  }
216}; // class VclPtr

218template<typename T1, typename T2>
219inline bool operator ==(VclPtr<T1> const & p1, VclPtr<T2> const & p2) {
  return p1.get() == p2.get();
221}

223template<typename T> inline bool operator ==(VclPtr<T> const & p1, T const * p2)
224{
  return p1.get() == p2;
226}

228template<typename T> inline bool operator ==(VclPtr<T> const & p1, T * p2) {
  return p1.get() == p2;
230}

232template<typename T> inline bool operator ==(T const * p1, VclPtr<T> const & p2)
233{
  return p1 == p2.get();
235}

237template<typename T> inline bool operator ==(T * p1, VclPtr<T> const & p2) {
  return p1 == p2.get();
239}

241template<typename T1, typename T2>
242inline bool operator !=(VclPtr<T1> const & p1, VclPtr<T2> const & p2) {
  return !(p1 == p2);
244}

246template<typename T> inline bool operator !=(VclPtr<T> const & p1, T const * p2)
247{
  return !(p1 == p2);
249}

251template<typename T> inline bool operator !=(VclPtr<T> const & p1, T * p2) {
  return !(p1 == p2);
253}

255template<typename T> inline bool operator !=(T const * p1, VclPtr<T> const & p2)
256{
  return !(p1 == p2);
258}

260template<typename T> inline bool operator !=(T * p1, VclPtr<T> const & p2) {
  return !(p1 == p2);
262}

264/**
* A construction helper for a temporary VclPtr. Since VclPtr types
* are created with a reference-count of one - to help fit into
* the existing code-flow; this helps us to construct them easily.
* see also VclPtr::Create and ScopedVclPtr
*
* For more details on the design please see vcl/README.lifecycle
*
* @param reference_type must be a subclass of vcl::Window
*/
274template <class reference_type>
275class SAL_WARN_UNUSED__attribute__((warn_unused)) VclPtrInstance final : public VclPtr<reference_type>
276{
277public:
  template<typename... Arg> VclPtrInstance(Arg &&... arg)
      : VclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE )
  {
  }

  /**
   * Override and disallow this, to prevent people accidentally calling it and actually
   * getting VclPtr::Create and getting a naked VclPtr<> instance
   */
  template<typename... Arg> static VclPtrInstance< reference_type > Create(Arg &&... ) = delete;
288};

290template <class reference_type>
291class ScopedVclPtr : public VclPtr<reference_type>
292{
293public:
  /** Constructor...
   */
  ScopedVclPtr()
      : VclPtr<reference_type>()
  {}

  /** Constructor
   */
  ScopedVclPtr (reference_type * pBody)
      : VclPtr<reference_type>(pBody)
  {}

  /** Copy constructor...
   */
  ScopedVclPtr (const VclPtr<reference_type> & handle)
      : VclPtr<reference_type>(handle)
  {}

  /**
     Assignment that releases the last reference.
   */
  void disposeAndReset(reference_type *pBody)
  {
      if (pBody != this->get()) {
          VclPtr<reference_type>::disposeAndClear();
          VclPtr<reference_type>::set(pBody);
      }
  }

  /**
     Assignment that releases the last reference.
   */
  ScopedVclPtr<reference_type>& operator = (reference_type * pBody)
  {
      disposeAndReset(pBody);
      return *this;
  }

  /** Up-casting conversion constructor: Copies interface reference.

      Does not work for up-casts to ambiguous bases.  For the special case of
      up-casting to Reference< XInterface >, see the corresponding conversion
      operator.

      @param rRef another reference
  */
  template< class derived_type >
  ScopedVclPtr(
      const VclPtr< derived_type > & rRef,
      typename std::enable_if<
          std::is_base_of<reference_type, derived_type>::value, int>::type
          = 0 )
      : VclPtr<reference_type>( rRef )
  {
  }

  /** Up-casting assignment operator.

      Does not work for up-casts to ambiguous bases.

      @param rRef another VclPtr
  */
  template<typename derived_type>
  typename std::enable_if<
      std::is_base_of<reference_type, derived_type>::value,
      ScopedVclPtr &>::type
  operator =(VclPtr<derived_type> const & rRef)
  {
      disposeAndReset(rRef.get());
      return *this;
  }

  /**
   * Override and disallow this, to prevent people accidentally calling it and actually
   * getting VclPtr::Create and getting a naked VclPtr<> instance
   */
  template<typename... Arg> static ScopedVclPtr< reference_type > Create(Arg &&... ) = delete;

  ~ScopedVclPtr()
  {
      VclPtr<reference_type>::disposeAndClear();
      assert(VclPtr<reference_type>::get() == nullptr)(static_cast <bool> (VclPtr<reference_type>::get(
) == nullptr) ? void (0) : __assert_fail ("VclPtr<reference_type>::get() == nullptr"
, "/home/maarten/src/libreoffice/core/include/vcl/vclptr.hxx"
, 375, __extension__ __PRETTY_FUNCTION__)); // make sure there are no lingering references
  }

378private:
  // Most likely we don't want this default copy-constructor.
  ScopedVclPtr (const ScopedVclPtr<reference_type> &) = delete;
  // And certainly we don't want a default assignment operator.
  ScopedVclPtr<reference_type>& operator = (const ScopedVclPtr<reference_type> &) = delete;
  // And disallow reset as that doesn't call disposeAndClear on the original reference
  void reset() = delete;
  void reset(reference_type *pBody) = delete;

387protected:
  ScopedVclPtr (reference_type * pBody, __sal_NoAcquire)
      : VclPtr<reference_type>(pBody, SAL_NO_ACQUIRE)
  {}
391};

393/**
* A construction helper for ScopedVclPtr. Since VclPtr types are created
* with a reference-count of one - to help fit into the existing
* code-flow; this helps us to construct them easily.
*
* For more details on the design please see vcl/README.lifecycle
*
* @param reference_type must be a subclass of vcl::Window
*/
402#if defined _MSC_VER
403#pragma warning(push)
404#pragma warning(disable: 4521) // " multiple copy constructors specified"
405#endif
406template <class reference_type>
407class SAL_WARN_UNUSED__attribute__((warn_unused)) ScopedVclPtrInstance final : public ScopedVclPtr<reference_type>
408{
409public:
  template<typename... Arg> ScopedVclPtrInstance(Arg &&... arg)
      : ScopedVclPtr<reference_type>( new reference_type(std::forward<Arg>(arg)...), SAL_NO_ACQUIRE )
  {
  }

  /**
   * Override and disallow this, to prevent people accidentally calling it and actually
   * getting VclPtr::Create and getting a naked VclPtr<> instance
   */
  template<typename... Arg> static ScopedVclPtrInstance< reference_type > Create(Arg &&...) = delete;

421private:
  // Prevent the above perfect forwarding ctor from hijacking (accidental)
  // attempts at ScopedVclPtrInstance copy construction (where the hijacking
  // would typically lead to somewhat obscure error messages); both non-const
  // and const variants are needed here, as the ScopedVclPtr base class has a
  // const--variant copy ctor, so the implicitly declared copy ctor for
  // ScopedVclPtrInstance would also be the const variant, so non-const copy
  // construction attempts would be hijacked by the perfect forwarding ctor;
  // but if we only declared a non-const variant here, the const variant would
  // no longer be implicitly declared (as there would already be an explicitly
  // declared copy ctor), so const copy construction attempts would then be
  // hijacked by the perfect forwarding ctor:
  ScopedVclPtrInstance(ScopedVclPtrInstance &) = delete;
  ScopedVclPtrInstance(ScopedVclPtrInstance const &) = delete;
435};
436#if defined _MSC_VER
437#pragma warning(pop)
438#endif

440#endif // INCLUDED_VCL_PTR_HXX

442/* vim:set shiftwidth=4 softtabstop=4 expandtab: */

←

/home/maarten/src/libreoffice/core/include/rtl/ref.hxx

→

1/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2/*
* 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 .
*/

20#ifndef INCLUDED_RTL_REF_HXX
21#define INCLUDED_RTL_REF_HXX

23#include "sal/config.h"

25#include <cassert>
26#include <cstddef>
27#include <functional>
28#ifdef LIBO_INTERNAL_ONLY1
29#include <type_traits>
30#endif

32#include "sal/types.h"

34namespace rtl
35{

37/** Template reference class for reference type.
38*/
39template <class reference_type>
40class Reference
41{
  /** The <b>reference_type</b> body pointer.
   */
  reference_type * m_pBody;


47public:
  /** Constructor...
   */
  Reference()
      : m_pBody (NULL__null)
  {}


  /** Constructor...
   */
  Reference (reference_type * pBody, __sal_NoAcquire)
      : m_pBody (pBody)
  {
  }

  /** Constructor...
   */
  Reference (reference_type * pBody)
      : m_pBody (pBody)
  {
      if (m_pBody)
          m_pBody->acquire();
  }

  /** Copy constructor...
   */
  Reference (const Reference<reference_type> & handle)
      : m_pBody (handle.m_pBody)
  {
      if (m_pBody)
          m_pBody->acquire();
  }

80#ifdef LIBO_INTERNAL_ONLY1
  /** Move constructor...
   */
  Reference (Reference<reference_type> && handle) noexcept
      : m_pBody (handle.m_pBody)
  {
      handle.m_pBody = nullptr;
  }
88#endif

90#if defined LIBO_INTERNAL_ONLY1
  /** Up-casting conversion constructor: Copies interface reference.

      Does not work for up-casts to ambiguous bases.

      @param rRef another reference
  */
  template< class derived_type >
  inline Reference(
      const Reference< derived_type > & rRef,
      std::enable_if_t<std::is_base_of_v<reference_type, derived_type>, int> = 0 )
      : m_pBody (rRef.get())
  {
      if (m_pBody)
          m_pBody->acquire();
  }
106#endif

  /** Destructor...
   */
  ~Reference() COVERITY_NOEXCEPT_FALSE
  {
      if (m_pBody7.1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
1
Field 'm_pBody' is non-null
)
8
←
Taking true branch→
18
←
Taking true branch→
          m_pBody->release();
9
←
Calling 'VclReferenceBase::release'→
13
←
Returning; memory was released→
19
←
Use of memory after it is freed
  }

  /** Set...
       Similar to assignment.
   */
  Reference<reference_type> &
  SAL_CALL set (reference_type * pBody)
  {
      if (pBody)
          pBody->acquire();
      reference_type * const pOld = m_pBody;
      m_pBody = pBody;
      if (pOld)
          pOld->release();
      return *this;
  }

  /** Assignment.
       Unbinds this instance from its body (if bound) and
       bind it to the body represented by the handle.
   */
  Reference<reference_type> &
  SAL_CALL operator= (const Reference<reference_type> & handle)
  {
      return set( handle.m_pBody );
  }

141#ifdef LIBO_INTERNAL_ONLY1
  /** Assignment.
   *   Unbinds this instance from its body (if bound),
   *   bind it to the body represented by the handle, and
   *   set the body represented by the handle to nullptr.
   */
  Reference<reference_type> &
  operator= (Reference<reference_type> && handle)
  {
      // self-movement guts ourself
      if (m_pBody)
          m_pBody->release();
      m_pBody = handle.m_pBody;
      handle.m_pBody = nullptr;
      return *this;
  }
157#endif

  /** Assignment...
   */
  Reference<reference_type> &
  SAL_CALL operator= (reference_type * pBody)
  {
      return set( pBody );
  }

  /** Unbind the body from this handle.
       Note that for a handle representing a large body,
       "handle.clear().set(new body());" _might_
       perform a little bit better than "handle.set(new body());",
       since in the second case two large objects exist in memory
       (the old body and the new body).
   */
  Reference<reference_type> & SAL_CALL clear()
  {
      if (m_pBody)
      {
          reference_type * const pOld = m_pBody;
          m_pBody = NULL__null;
          pOld->release();
      }
      return *this;
  }


  /** Get the body. Can be used instead of operator->().
       I.e. handle->someBodyOp() and handle.get()->someBodyOp()
       are the same.
   */
  reference_type * SAL_CALL get() const
  {
      return m_pBody;
  }


  /** Probably most common used: handle->someBodyOp().
   */
  reference_type * SAL_CALL operator->() const
  {
      assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail
 ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx"
, 200, __extension__ __PRETTY_FUNCTION__));
      return m_pBody;
  }


  /** Allows (*handle).someBodyOp().
  */
  reference_type & SAL_CALL operator*() const
  {
      assert(m_pBody != NULL)(static_cast <bool> (m_pBody != __null) ? void (0) : __assert_fail
 ("m_pBody != NULL", "/home/maarten/src/libreoffice/core/include/rtl/ref.hxx"
, 209, __extension__ __PRETTY_FUNCTION__));
      return *m_pBody;
  }


  /** Returns True if the handle does point to a valid body.
   */
  bool SAL_CALL is() const
  {
      return (m_pBody != NULL__null);
  }

221#if defined LIBO_INTERNAL_ONLY1
  /** Returns True if the handle does point to a valid body.
   */
  explicit operator bool() const
  {
      return is();
  }
228#endif

  /** Returns True if this points to pBody.
   */
  bool SAL_CALL operator== (const reference_type * pBody) const
  {
      return (m_pBody == pBody);
  }


  /** Returns True if handle points to the same body.
   */
  bool
  SAL_CALL operator== (const Reference<reference_type> & handle) const
  {
      return (m_pBody == handle.m_pBody);
  }


  /** Needed to place References into STL collection.
   */
  bool
  SAL_CALL operator!= (const Reference<reference_type> & handle) const
  {
      return (m_pBody != handle.m_pBody);
  }


  /** Needed to place References into STL collection.
   */
  bool
  SAL_CALL operator< (const Reference<reference_type> & handle) const
  {
      return (m_pBody < handle.m_pBody);
  }


  /** Needed to place References into STL collection.
   */
  bool
  SAL_CALL operator> (const Reference<reference_type> & handle) const
  {
      return (m_pBody > handle.m_pBody);
  }
272};

274} // namespace rtl

276#if defined LIBO_INTERNAL_ONLY1
277namespace std
278{

280/// @cond INTERNAL
281/**
Make rtl::Reference hashable by default for use in STL containers.

@since LibreOffice 6.3
285*/
286template<typename T>
287struct hash<::rtl::Reference<T>>
288{
  std::size_t operator()(::rtl::Reference<T> const & s) const
  { return std::size_t(s.get()); }
291};
292/// @endcond

294}

296#endif

298#endif /* ! INCLUDED_RTL_REF_HXX */

300/* vim:set shiftwidth=4 softtabstop=4 expandtab: */

←

/home/maarten/src/libreoffice/core/include/vcl/vclreferencebase.hxx

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#ifndef INCLUDED_VCL_Reference_HXX
20#define INCLUDED_VCL_Reference_HXX
21 
22#include <vcl/dllapi.h>
23#include <osl/interlck.h>
24 
25class VCL_DLLPUBLIC__attribute__ ((visibility("default"))) VclReferenceBase
26{
27    mutable oslInterlockedCount mnRefCnt;
28 
29    template<typename T> friend class VclPtr;
30 
31public:
32    void acquire() const
33    {
34        osl_atomic_increment(&mnRefCnt)__sync_add_and_fetch((&mnRefCnt), 1);
35    }
36 
37    void release() const
38    {
39        if (osl_atomic_decrement(&mnRefCnt)__sync_sub_and_fetch((&mnRefCnt), 1) == 0)
10
←
Assuming the condition is true→
11
←
Taking true branch→
40            delete this;
12
←
Memory is released→
41    }
42#ifdef DBG_UTIL
43#ifndef _WIN32
44    sal_Int32 getRefCount() const { return mnRefCnt; }
45#endif
46#endif
47 
48 
49private:
50    VclReferenceBase(const VclReferenceBase&) = delete;
51    VclReferenceBase& operator=(const VclReferenceBase&) = delete;
52 
53    bool                        mbDisposed : 1;
54 
55protected:
56                                VclReferenceBase();
57protected:
58    virtual                     ~VclReferenceBase();
59 
60protected:
61    virtual void                dispose();
62 
63public:
64    void                        disposeOnce();
65    bool                        isDisposed() const { return mbDisposed; }
66 
67};
68#endif