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
|
/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2019-2023 Broadcom
* All rights reserved.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <stdint.h>
#include <errno.h>
#include "stack.h"
#define STACK_EMPTY -1
/* Initialize stack
*/
int
stack_init(int num_entries, uint32_t *items, struct stack *st)
{
if (items == NULL || st == NULL)
return -EINVAL;
st->max = num_entries;
st->top = STACK_EMPTY;
st->items = items;
return 0;
}
/*
* Return the address of the items
*/
uint32_t *stack_items(struct stack *st)
{
return st->items;
}
/* Return the size of the stack
*/
int32_t
stack_size(struct stack *st)
{
return st->top + 1;
}
/* Check if the stack is empty
*/
bool
stack_is_empty(struct stack *st)
{
return st->top == STACK_EMPTY;
}
/* Check if the stack is full
*/
bool
stack_is_full(struct stack *st)
{
return st->top == st->max - 1;
}
/* Add element x to the stack
*/
int
stack_push(struct stack *st, uint32_t x)
{
if (stack_is_full(st))
return -EOVERFLOW;
/* add an element and increments the top index
*/
st->items[++st->top] = x;
return 0;
}
/* Pop top element x from the stack and return
* in user provided location.
*/
int
stack_pop(struct stack *st, uint32_t *x)
{
if (stack_is_empty(st))
return -ENOENT;
*x = st->items[st->top];
st->top--;
return 0;
}
/* Dump the stack
*/
void stack_dump(struct stack *st)
{
int i, j;
printf("top=%d\n", st->top);
printf("max=%d\n", st->max);
if (st->top == -1) {
printf("stack is empty\n");
return;
}
for (i = 0; i < st->max + 7 / 8; i++) {
printf("item[%d] 0x%08x", i, st->items[i]);
for (j = 0; j < 7; j++) {
if (i++ < st->max - 1)
printf(" 0x%08x", st->items[i]);
}
printf("\n");
}
}
|
