idlc/source/aststack.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 <rtl/alloc.h>
  21 #include <idlc/aststack.hxx>
  22 #include <idlc/astscope.hxx>
  23
  24 #define STACKSIZE_INCREMENT 64
  25
  26 AstStack::AstStack()
  27     : m_stack((AstScope**)rtl_allocateZeroMemory(sizeof(AstScope*) * STACKSIZE_INCREMENT))
  28     , m_size(STACKSIZE_INCREMENT)
  29     , m_top(0)
  30 {
  31 }
  32
  33 AstStack::~AstStack()
  34 {
  35     for(sal_uInt32 i=0; i < m_top; i++)
  36     {
  37         if (m_stack[i])
  38             delete(m_stack[i]);
  39     }
  40
  41     rtl_freeMemory(m_stack);
  42 }
  43
  44 sal_uInt32 AstStack::depth()
  45 {
  46     return m_top;
  47 }
  48
  49 AstScope* AstStack::top()
  50 {
  51     if (m_top < 1)
  52         return NULL;
  53     return m_stack[m_top - 1];
  54 }
  55
  56 AstScope* AstStack::bottom()
  57 {
  58     if (m_top == 0)
  59         return NULL;
  60     return m_stack[0];
  61 }
  62
  63 AstScope* AstStack::nextToTop()
  64 {
  65     AstScope *tmp, *retval;
  66
  67     if (depth() < 2)
  68         return NULL;
  69
  70     tmp = top();        // Save top
  71     (void) pop();       // Pop it
  72     retval = top();     // Get next one down
  73     (void) push(tmp);   // Push top back
  74     return retval;      // Return next one down
  75 }
  76
  77 AstScope* AstStack::topNonNull()
  78 {
  79     for (sal_uInt32 i = m_top; i > 0; i--)
  80     {
  81         if ( m_stack[i - 1] )
  82             return m_stack[i - 1];
  83       }
  84     return NULL;
  85 }
  86
  87 AstStack* AstStack::push(AstScope* pScope)
  88 {
  89     AstScope        **tmp;
  90 //  AstDeclaration  *pDecl = ScopeAsDecl(pScope);
  91     sal_uInt32  newSize;
  92     sal_uInt32  i;
  93
  94     // Make sure there's space for one more
  95     if (m_size == m_top)
  96     {
  97         newSize = m_size;
  98         newSize += STACKSIZE_INCREMENT;
  99         tmp = (AstScope**)rtl_allocateZeroMemory(sizeof(AstScope*) * newSize);
 100
 101         for(i=0; i < m_size; i++)
 102             tmp[i] = m_stack[i];
 103
 104         rtl_freeMemory(m_stack);
 105         m_stack = tmp;
 106     }
 107
 108     // Insert new scope
 109     m_stack[m_top++] = pScope;
 110
 111     return this;
 112 }
 113
 114 void AstStack::pop()
 115 {
 116     if (m_top < 1)
 117         return;
 118     --m_top;
 119 }
 120
 121 void AstStack::clear()
 122 {
 123     m_top = 0;
 124 }
 125
 126 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */