blob: ff319c6b5e5393f733e119488340965953ced7cc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/**************************************************************
*
* 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
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*************************************************************/
// MARKER(update_precomp.py): autogen include statement, do not remove
#include "precompiled_idlc.hxx"
#include <rtl/alloc.h>
#include <idlc/aststack.hxx>
#include <idlc/astscope.hxx>
#define STACKSIZE_INCREMENT 64
AstStack::AstStack()
: m_stack((AstScope**)rtl_allocateZeroMemory(sizeof(AstScope*) * STACKSIZE_INCREMENT))
, m_size(STACKSIZE_INCREMENT)
, m_top(0)
{
}
AstStack::~AstStack()
{
for(sal_uInt32 i=0; i < m_top; i++)
{
if (m_stack[i])
delete(m_stack[i]);
}
rtl_freeMemory(m_stack);
}
sal_uInt32 AstStack::depth()
{
return m_top;
}
AstScope* AstStack::top()
{
if (m_top < 1)
return NULL;
return m_stack[m_top - 1];
}
AstScope* AstStack::bottom()
{
if (m_top == 0)
return NULL;
return m_stack[0];
}
AstScope* AstStack::nextToTop()
{
AstScope *tmp, *retval;
if (depth() < 2)
return NULL;
tmp = top(); // Save top
(void) pop(); // Pop it
retval = top(); // Get next one down
(void) push(tmp); // Push top back
return retval; // Return next one down
}
AstScope* AstStack::topNonNull()
{
for (sal_uInt32 i = m_top; i > 0; i--)
{
if ( m_stack[i - 1] )
return m_stack[i - 1];
}
return NULL;
}
AstStack* AstStack::push(AstScope* pScope)
{
AstScope **tmp;
// AstDeclaration *pDecl = ScopeAsDecl(pScope);
sal_uInt32 newSize;
sal_uInt32 i;
// Make sure there's space for one more
if (m_size == m_top)
{
newSize = m_size;
newSize += STACKSIZE_INCREMENT;
tmp = (AstScope**)rtl_allocateZeroMemory(sizeof(AstScope*) * newSize);
for(i=0; i < m_size; i++)
tmp[i] = m_stack[i];
rtl_freeMemory(m_stack);
m_stack = tmp;
}
// Insert new scope
m_stack[m_top++] = pScope;
return this;
}
void AstStack::pop()
{
AstScope *pScope;
if (m_top < 1)
return;
pScope = m_stack[--m_top];
}
void AstStack::clear()
{
m_top = 0;
}
|
