sw/source/core/except/dbgloop.cxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: dbgloop.cxx,v $
  10  * $Revision: 1.5 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30
  31 // MARKER(update_precomp.py): autogen include statement, do not remove
  32 #include "precompiled_sw.hxx"
  33
  34 #ifdef PRODUCT
  35 #error Wer fummelt denn an den makefiles rum?
  36 #endif
  37 #include <tools/stream.hxx>
  38 #include "dbgloop.hxx"
  39 #include "errhdl.hxx"
  40
  41 DbgLoopStack DbgLoop::aDbgLoopStack;
  42
  43 /*************************************************************************
  44  *                                              class DbgLoopStack
  45  *************************************************************************/
  46
  47 DbgLoopStack::DbgLoopStack()
  48 {
  49     Reset();
  50 }
  51
  52 void DbgLoopStack::Reset()
  53 {
  54     nPtr = 0;
  55     pDbg = 0;
  56     for( USHORT i = 0; i < DBG_MAX_STACK; ++i )
  57         aCount[i] = 0;
  58 }
  59
  60 /*************************************************************************
  61  *                                               DbgLoopStack::Push()
  62  *************************************************************************/
  63
  64 void DbgLoopStack::Push( const void *pThis )
  65 {
  66     // Wir muessen irgendwie mitbekommen, wann die erste Stackposition
  67     // resettet werden soll, z.B. wenn wir einen Nullpointer uebergeben
  68     if( !nPtr && ( pDbg != pThis || !pThis ) )
  69     {
  70         aCount[1] = 0;
  71         pDbg = pThis;
  72     }
  73
  74     ++nPtr;
  75     if( DBG_MAX_STACK > nPtr )
  76     {
  77         // Wenn eine loop entdeckt wird, wird der counter wieder zurueckgesetzt.
  78         ASSERT( DBG_MAX_LOOP > aCount[nPtr], "DbgLoopStack::Push: loop detected" );
  79         if( DBG_MAX_LOOP > aCount[nPtr] )
  80             ++(aCount[nPtr]);
  81         else
  82             aCount[nPtr] = 0;
  83     }
  84 }
  85
  86 /*************************************************************************
  87  *                                               DbgLoopStack::Pop()
  88  *************************************************************************/
  89
  90 void DbgLoopStack::Pop()
  91 {
  92     if( DBG_MAX_STACK > nPtr )
  93     {
  94         ASSERT( nPtr, "DbgLoopStack::Pop: can't pop the stack" );
  95
  96         ASSERT( aCount[nPtr], "DbgLoopStack::Pop: can't dec the count" );
  97         if( DBG_MAX_STACK > nPtr + 1 )
  98             aCount[nPtr + 1] = 0;
  99     }
 100     --nPtr;
 101 }
 102
 103 /*************************************************************************
 104  *                                               DbgLoopStack::Print()
 105  *************************************************************************/
 106
 107 void DbgLoopStack::Print( SvStream &rOS ) const
 108 {
 109     rOS << "POS: " << nPtr << '\n';
 110     USHORT i;
 111     for( i = 0; i < DBG_MAX_STACK; ++i )
 112         rOS << i << " ";
 113     rOS << '\n';
 114     for( i = 0; i < DBG_MAX_STACK; ++i )
 115         rOS << aCount[i] << " ";
 116     rOS << '\n';
 117 }
 118
 119 #ifdef STAND_ALONE
 120 // compile with: cl /AL /DSTAND_ALONE dbgloop.cxx
 121
 122 /*************************************************************************
 123  *                                                      main()
 124  *************************************************************************/
 125
 126 #include <stdlib.h>
 127
 128 void AssertFail( const char *pErr, const char *pFile, USHORT nLine )
 129 {
 130     cout << pErr << '\n';
 131     PrintLoopStack( cout );
 132     exit(0);
 133 }
 134
 135 class Test
 136 {
 137 public:
 138         void Run() const;
 139 };
 140
 141 void Test::Run() const
 142 {
 143     cout << "---" << '\n';
 144     for( USHORT i = 0; i < 10; ++i )
 145     {
 146         cout << "i" << i;
 147         DBG_LOOP;
 148         PrintLoopStack( cout );
 149         for( USHORT j = 0; j < 10; ++j )
 150         {
 151             cout << " j" << j;
 152             DBG_LOOP;
 153             PrintLoopStack( cout );
 154         }
 155         cout << '\n';
 156     }
 157     PrintLoopStack( cout );
 158 }
 159
 160 int main()
 161 {
 162     // unterschiedliche Instanzen waehlen wg. pDbg != pThis
 163     Test aTest1;
 164     aTest1.Run();
 165     Test aTest2;
 166     aTest2.Run();
 167     return 0;
 168 }
 169 #endif
 170
 171