1/*
 2 * Simple pointer stack
 3 *
 4 * (c) 2010 Arnaldo Carvalho de Melo <acme@redhat.com>
 5 */
 6
 7#include "util.h"
 8#include "pstack.h"
 9#include "debug.h"
10#include <linux/kernel.h>
11#include <stdlib.h>
12
13struct pstack {
14	unsigned short	top;
15	unsigned short	max_nr_entries;
16	void		*entries[0];
17};
18
19struct pstack *pstack__new(unsigned short max_nr_entries)
20{
21	struct pstack *pstack = zalloc((sizeof(*pstack) +
22				       max_nr_entries * sizeof(void *)));
23	if (pstack != NULL)
24		pstack->max_nr_entries = max_nr_entries;
25	return pstack;
26}
27
28void pstack__delete(struct pstack *pstack)
29{
30	free(pstack);
31}
32
33bool pstack__empty(const struct pstack *pstack)
34{
35	return pstack->top == 0;
36}
37
38void pstack__remove(struct pstack *pstack, void *key)
39{
40	unsigned short i = pstack->top, last_index = pstack->top - 1;
41
42	while (i-- != 0) {
43		if (pstack->entries[i] == key) {
44			if (i < last_index)
45				memmove(pstack->entries + i,
46					pstack->entries + i + 1,
47					(last_index - i) * sizeof(void *));
48			--pstack->top;
49			return;
50		}
51	}
52	pr_err("%s: %p not on the pstack!\n", __func__, key);
53}
54
55void pstack__push(struct pstack *pstack, void *key)
56{
57	if (pstack->top == pstack->max_nr_entries) {
58		pr_err("%s: top=%d, overflow!\n", __func__, pstack->top);
59		return;
60	}
61	pstack->entries[pstack->top++] = key;
62}
63
64void *pstack__pop(struct pstack *pstack)
65{
66	void *ret;
67
68	if (pstack->top == 0) {
69		pr_err("%s: underflow!\n", __func__);
70		return NULL;
71	}
72
73	ret = pstack->entries[--pstack->top];
74	pstack->entries[pstack->top] = NULL;
75	return ret;
76}
77
78void *pstack__peek(struct pstack *pstack)
79{
80	if (pstack->top == 0)
81		return NULL;
82	return pstack->entries[pstack->top - 1];
83}

 1// SPDX-License-Identifier: GPL-2.0
 2/*
 3 * Simple pointer stack
 4 *
 5 * (c) 2010 Arnaldo Carvalho de Melo <acme@redhat.com>
 6 */
 7
 8#include "util.h"
 9#include "pstack.h"
10#include "debug.h"
11#include <linux/kernel.h>
12#include <stdlib.h>
13
14struct pstack {
15	unsigned short	top;
16	unsigned short	max_nr_entries;
17	void		*entries[0];
18};
19
20struct pstack *pstack__new(unsigned short max_nr_entries)
21{
22	struct pstack *pstack = zalloc((sizeof(*pstack) +
23				       max_nr_entries * sizeof(void *)));
24	if (pstack != NULL)
25		pstack->max_nr_entries = max_nr_entries;
26	return pstack;
27}
28
29void pstack__delete(struct pstack *pstack)
30{
31	free(pstack);
32}
33
34bool pstack__empty(const struct pstack *pstack)
35{
36	return pstack->top == 0;
37}
38
39void pstack__remove(struct pstack *pstack, void *key)
40{
41	unsigned short i = pstack->top, last_index = pstack->top - 1;
42
43	while (i-- != 0) {
44		if (pstack->entries[i] == key) {
45			if (i < last_index)
46				memmove(pstack->entries + i,
47					pstack->entries + i + 1,
48					(last_index - i) * sizeof(void *));
49			--pstack->top;
50			return;
51		}
52	}
53	pr_err("%s: %p not on the pstack!\n", __func__, key);
54}
55
56void pstack__push(struct pstack *pstack, void *key)
57{
58	if (pstack->top == pstack->max_nr_entries) {
59		pr_err("%s: top=%d, overflow!\n", __func__, pstack->top);
60		return;
61	}
62	pstack->entries[pstack->top++] = key;
63}
64
65void *pstack__pop(struct pstack *pstack)
66{
67	void *ret;
68
69	if (pstack->top == 0) {
70		pr_err("%s: underflow!\n", __func__);
71		return NULL;
72	}
73
74	ret = pstack->entries[--pstack->top];
75	pstack->entries[pstack->top] = NULL;
76	return ret;
77}
78
79void *pstack__peek(struct pstack *pstack)
80{
81	if (pstack->top == 0)
82		return NULL;
83	return pstack->entries[pstack->top - 1];
84}