4 * (c) 2010 Arnaldo Carvalho de Melo <acme@redhat.com>
10 #include <linux/kernel.h>
15 unsigned short max_nr_entries
;
19 struct pstack
*pstack__new(unsigned short max_nr_entries
)
21 struct pstack
*pstack
= zalloc((sizeof(*pstack
) +
22 max_nr_entries
* sizeof(void *)));
24 pstack
->max_nr_entries
= max_nr_entries
;
28 void pstack__delete(struct pstack
*pstack
)
33 bool pstack__empty(const struct pstack
*pstack
)
35 return pstack
->top
== 0;
38 void pstack__remove(struct pstack
*pstack
, void *key
)
40 unsigned short i
= pstack
->top
, last_index
= pstack
->top
- 1;
43 if (pstack
->entries
[i
] == key
) {
45 memmove(pstack
->entries
+ i
,
46 pstack
->entries
+ i
+ 1,
47 (last_index
- i
) * sizeof(void *));
52 pr_err("%s: %p not on the pstack!\n", __func__
, key
);
55 void pstack__push(struct pstack
*pstack
, void *key
)
57 if (pstack
->top
== pstack
->max_nr_entries
) {
58 pr_err("%s: top=%d, overflow!\n", __func__
, pstack
->top
);
61 pstack
->entries
[pstack
->top
++] = key
;
64 void *pstack__pop(struct pstack
*pstack
)
68 if (pstack
->top
== 0) {
69 pr_err("%s: underflow!\n", __func__
);
73 ret
= pstack
->entries
[--pstack
->top
];
74 pstack
->entries
[pstack
->top
] = NULL
;