127 lines
4.9 KiB
C
127 lines
4.9 KiB
C
/*
|
|
Copyright (c) 2006-2020 Chung, Hyung-Hwan. 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.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "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 AUTHOR 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.
|
|
*/
|
|
|
|
/*
|
|
tre-stack.h: Stack definitions
|
|
|
|
This is the license, copyright notice, and disclaimer for TRE, a regex
|
|
matching package (library and tools) with support for approximate
|
|
matching.
|
|
|
|
Copyright (c) 2001-2009 Ville Laurikari <vl@iki.fi>
|
|
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.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER 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.
|
|
*/
|
|
|
|
|
|
#ifndef _HAWK_TRE_STACK_H_
|
|
#define _HAWK_TRE_STACK_H_
|
|
|
|
#include "tre-prv.h"
|
|
|
|
typedef struct tre_stack_rec tre_stack_t;
|
|
|
|
/* Creates a new stack object. `size' is initial size in bytes, `max_size'
|
|
is maximum size, and `increment' specifies how much more space will be
|
|
allocated with realloc() if all space gets used up. Returns the stack
|
|
object or NULL if out of memory. */
|
|
tre_stack_t *
|
|
tre_stack_new(hawk_gem_t* gem, int size, int max_size, int increment);
|
|
|
|
/* Frees the stack object. */
|
|
void
|
|
tre_stack_destroy(tre_stack_t *s);
|
|
|
|
/* Returns the current number of objects in the stack. */
|
|
int
|
|
tre_stack_num_objects(tre_stack_t *s);
|
|
|
|
/* Each tre_stack_push_*(tre_stack_t *s, <type> value) function pushes
|
|
`value' on top of stack `s'. Returns REG_ESPACE if out of memory.
|
|
This tries to realloc() more space before failing if maximum size
|
|
has not yet been reached. Returns REG_OK if successful. */
|
|
#define declare_pushf(typetag, type) \
|
|
reg_errcode_t tre_stack_push_ ## typetag(tre_stack_t *s, type value)
|
|
|
|
declare_pushf(voidptr, void *);
|
|
declare_pushf(int, int);
|
|
|
|
/* Each tre_stack_pop_*(tre_stack_t *s) function pops the topmost
|
|
element off of stack `s' and returns it. The stack must not be
|
|
empty. */
|
|
#define declare_popf(typetag, type) \
|
|
type tre_stack_pop_ ## typetag(tre_stack_t *s)
|
|
|
|
declare_popf(voidptr, void *);
|
|
declare_popf(int, int);
|
|
|
|
/* Just to save some typing. */
|
|
#define STACK_PUSH(s, typetag, value) \
|
|
do \
|
|
{ \
|
|
status = tre_stack_push_ ## typetag(s, value); \
|
|
} \
|
|
while (/*CONSTCOND*/0)
|
|
|
|
#define STACK_PUSHX(s, typetag, value) \
|
|
{ \
|
|
status = tre_stack_push_ ## typetag(s, value); \
|
|
if (status != REG_OK) \
|
|
break; \
|
|
}
|
|
|
|
#define STACK_PUSHR(s, typetag, value) \
|
|
{ \
|
|
reg_errcode_t _status; \
|
|
_status = tre_stack_push_ ## typetag(s, value); \
|
|
if (_status != REG_OK) \
|
|
return _status; \
|
|
}
|
|
|
|
#endif /* TRE_STACK_H */
|
|
|
|
/* EOF */
|