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
134
135
|
/*
* 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.
*/
#include <guththila_stack.h>
int GUTHTHILA_CALL
guththila_stack_init(
guththila_stack_t * stack,
const axutil_env_t * env)
{
stack->top = 0;
stack->data = (void **)AXIS2_MALLOC(env->allocator, sizeof(void **) * GUTHTHILA_STACK_DEFAULT);
if(!stack->data)
{
return GUTHTHILA_FAILURE;
}
else
{
stack->max = GUTHTHILA_STACK_DEFAULT;
return GUTHTHILA_SUCCESS;
}
}
void GUTHTHILA_CALL
guththila_stack_free(
guththila_stack_t * stack,
const axutil_env_t * env)
{
if(stack->data)
AXIS2_FREE(env->allocator, stack->data);
AXIS2_FREE(env->allocator, stack);
}
void GUTHTHILA_CALL
guththila_stack_un_init(
guththila_stack_t * stack,
const axutil_env_t * env)
{
if(stack->data)
AXIS2_FREE(env->allocator, stack->data);
}
void *GUTHTHILA_CALL
guththila_stack_pop(
guththila_stack_t * stack,
const axutil_env_t * env)
{
if(stack->top > 0)
{
return stack->data[--(stack->top)];
}
return NULL;
}
int GUTHTHILA_CALL
guththila_stack_push(
guththila_stack_t * stack,
void *data,
const axutil_env_t * env)
{
int top = stack->top++;
if(top >= stack->max)
{
void **temp = NULL;
int i = 0;
temp = (void **)AXIS2_MALLOC(env->allocator, sizeof(void **) * (stack->max *= 2));
for(i = 0; i < top; ++i)
{
temp[i] = stack->data[i];
}
AXIS2_FREE(env->allocator, stack->data);
stack->data = temp;
}
stack->data[top] = data;
return top;
}
void *GUTHTHILA_CALL
guththila_stack_peek(
guththila_stack_t * stack,
const axutil_env_t * env)
{
if(stack->top > 0)
{
return stack->data[stack->top - 1];
}
else
{
return NULL;
}
}
int GUTHTHILA_CALL
guththila_stack_del_top(
guththila_stack_t * stack,
const axutil_env_t * env)
{
if(stack->top > 0)
{
AXIS2_FREE(env->allocator, stack->data[stack->top]);
return GUTHTHILA_SUCCESS;
}
return GUTHTHILA_FAILURE;
}
int GUTHTHILA_CALL
guththila_stack_is_empty(
guththila_stack_t * stack,
const axutil_env_t * env)
{
return stack->top == 0 ? 1 : 0;
}
void *GUTHTHILA_CALL
guththila_stack_get_by_index(
guththila_stack_t * stack,
int index,
const axutil_env_t * env)
{
return index < stack->top ? stack->data[index] : NULL;
}
|
