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
|
/*
* stack.c -- Implementation for stack functions for use by extensions.
*/
/*
* Copyright (C) 2012, 2013 the Free Software Foundation, Inc.
*
* This file is part of GAWK, the GNU implementation of the
* AWK Programming Language.
*
* GAWK is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* GAWK is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
#include <stdlib.h>
#include "stack.h"
#define INITIAL_STACK 20
static size_t size;
static void **stack;
static int index = -1;
/* stack_empty --- return true if stack is empty */
int
stack_empty()
{
return index < 0;
}
/* stack_top --- return top object on the stack */
void *
stack_top()
{
if (stack_empty() || stack == NULL)
return NULL;
return stack[index];
}
/* stack_pop --- pop top object and return it */
void *
stack_pop()
{
if (stack_empty() || stack == NULL)
return NULL;
return stack[index--];
}
/* stack_push --- push an object onto the stack */
int stack_push(void *object)
{
void **new_stack;
size_t new_size = 2 * size;
if (stack == NULL) {
stack = (void **) malloc(INITIAL_STACK * sizeof(void *));
if (stack == NULL)
return 0;
size = INITIAL_STACK;
} else if (index + 1 >= size) {
if (new_size < size)
return 0;
new_stack = realloc(stack, new_size * sizeof(void *));
if (new_stack == NULL)
return 0;
size = new_size;
stack = new_stack;
}
stack[++index] = object;
return 1;
}
|
