basctl/source/basicide/breakpoint.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include "breakpoint.hxx"
  21
  22 #include <basic/sbmod.hxx>
  23 #include <tools/debug.hxx>
  24
  25
  26 namespace basctl
  27 {
  28
  29 BreakPointList::BreakPointList()
  30 {}
  31
  32 BreakPointList::BreakPointList(BreakPointList const & rList)
  33 {
  34     for (size_t i = 0; i < rList.size(); ++i)
  35         maBreakPoints.push_back( new BreakPoint(*rList.at( i ) ) );
  36 }
  37
  38 BreakPointList::~BreakPointList()
  39 {
  40     reset();
  41 }
  42
  43 void BreakPointList::reset()
  44 {
  45     for (BreakPoint* pBreakPoint : maBreakPoints)
  46         delete pBreakPoint;
  47     maBreakPoints.clear();
  48 }
  49
  50 void BreakPointList::transfer(BreakPointList & rList)
  51 {
  52     maBreakPoints.swap(rList.maBreakPoints);
  53     rList.reset();
  54 }
  55
  56 void BreakPointList::InsertSorted(BreakPoint* pNewBrk)
  57 {
  58     for ( std::vector< BreakPoint* >::iterator i = maBreakPoints.begin(); i != maBreakPoints.end(); ++i )
  59     {
  60         if ( pNewBrk->nLine <= (*i)->nLine )
  61         {
  62             DBG_ASSERT( (*i)->nLine != pNewBrk->nLine, "BreakPoint exists already!" );
  63             maBreakPoints.insert( i, pNewBrk );
  64             return;
  65         }
  66     }
  67     // no insert position found => LIST_APPEND
  68     maBreakPoints.push_back( pNewBrk );
  69 }
  70
  71 void BreakPointList::SetBreakPointsInBasic(SbModule* pModule)
  72 {
  73     pModule->ClearAllBP();
  74
  75     for (BreakPoint* pBrk : maBreakPoints)
  76     {
  77         if ( pBrk->bEnabled )
  78             pModule->SetBP( static_cast<sal_uInt16>(pBrk->nLine) );
  79     }
  80 }
  81
  82 BreakPoint* BreakPointList::FindBreakPoint(size_t nLine)
  83 {
  84     for (BreakPoint* pBrk : maBreakPoints)
  85     {
  86         if ( pBrk->nLine == nLine )
  87             return pBrk;
  88     }
  89     return nullptr;
  90 }
  91
  92 void BreakPointList::AdjustBreakPoints(size_t nLine, bool bInserted)
  93 {
  94     for ( size_t i = 0; i < maBreakPoints.size(); )
  95     {
  96         BreakPoint* pBrk = maBreakPoints[ i ];
  97         bool bDelBrk = false;
  98         if ( pBrk->nLine == nLine )
  99         {
 100             if ( bInserted )
 101                 pBrk->nLine++;
 102             else
 103                 bDelBrk = true;
 104         }
 105         else if ( pBrk->nLine > nLine )
 106         {
 107             if ( bInserted )
 108                 pBrk->nLine++;
 109             else
 110                 pBrk->nLine--;
 111         }
 112
 113         if ( bDelBrk )
 114         {
 115             delete remove( pBrk );
 116         }
 117         else
 118         {
 119             ++i;
 120         }
 121     }
 122 }
 123
 124 void BreakPointList::ResetHitCount()
 125 {
 126     for (BreakPoint* pBrk : maBreakPoints)
 127     {
 128         pBrk->nHitCount = 0;
 129     }
 130 }
 131
 132 BreakPoint* BreakPointList::remove(BreakPoint* ptr)
 133 {
 134     for ( std::vector< BreakPoint* >::iterator i = maBreakPoints.begin(); i != maBreakPoints.end(); ++i )
 135     {
 136         if ( ptr == *i )
 137         {
 138             maBreakPoints.erase( i );
 139             return ptr;
 140         }
 141     }
 142     return nullptr;
 143 }
 144
 145 size_t BreakPointList::size() const
 146 {
 147     return maBreakPoints.size();
 148 }
 149
 150 BreakPoint* BreakPointList::at(size_t i)
 151 {
 152     return i < maBreakPoints.size() ? maBreakPoints[ i ] : nullptr;
 153 }
 154
 155 const BreakPoint* BreakPointList::at(size_t i) const
 156 {
 157     return i < maBreakPoints.size() ? maBreakPoints[ i ] : nullptr;
 158 }
 159
 160 } // namespace basctl
 161
 162 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */