2019-05-11 05:33:26 +00:00
|
|
|
/*
|
2020-02-02 05:24:51 +00:00
|
|
|
Copyright (c) 2014-2020, The Monero Project
|
2019-05-11 05:33:26 +00:00
|
|
|
|
|
|
|
All rights reserved.
|
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
|
|
|
|
1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
list of conditions and the following disclaimer.
|
|
|
|
|
|
|
|
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
this list of conditions and the following disclaimer in the documentation
|
|
|
|
and/or other materials provided with the distribution.
|
|
|
|
|
|
|
|
3. Neither the name of the copyright holder nor the names of its contributors
|
|
|
|
may be used to endorse or promote products derived from this software without
|
|
|
|
specific prior written permission.
|
|
|
|
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
|
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
Parts of the project are originally copyright (c) 2012-2013 The Cryptonote
|
|
|
|
developers.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Bounded Stack */
|
|
|
|
|
|
|
|
#ifndef BSTACK_H
|
|
|
|
#define BSTACK_H
|
|
|
|
|
|
|
|
#include <stddef.h>
|
|
|
|
|
|
|
|
typedef struct bstack_t bstack_t;
|
|
|
|
typedef void (*recycle_fun)(void*);
|
|
|
|
|
|
|
|
void bstack_new(bstack_t **out, size_t count, size_t size, recycle_fun recycle);
|
|
|
|
void bstack_free(bstack_t *q);
|
|
|
|
void * bstack_push(bstack_t *q, void *item);
|
|
|
|
void bstack_drop(bstack_t *q);
|
|
|
|
void * bstack_peek(bstack_t *q);
|
|
|
|
size_t bstack_count(bstack_t *q);
|
|
|
|
void * bstack_next(bstack_t *q);
|
|
|
|
void bstack_reset(bstack_t *q);
|
|
|
|
|
|
|
|
#endif
|