rz_stack.h File Reference

#include <rz_types.h>

Go to the source code of this file.

Classes
struct	rz_stack_t

Typedefs
typedef void(*	RzStackFree) (void *ptr)
typedef struct rz_stack_t	RzStack

Functions
RZ_API RzStack *	rz_stack_new (ut32 n)
RZ_API void	rz_stack_free (RzStack *s)
RZ_API bool	rz_stack_is_empty (RzStack *s)
RZ_API RzStack *	rz_stack_newf (ut32 n, RzStackFree f)
RZ_API bool	rz_stack_push (RzStack *s, void *el)
RZ_API void *	rz_stack_pop (RzStack *s)
RZ_API size_t	rz_stack_size (RzStack *s)
RZ_API void *	rz_stack_peek (RzStack *s)

Typedef Documentation

RzStack

typedef struct rz_stack_t RzStack

RzStackFree

typedef void(* RzStackFree) (void *ptr)

Definition at line 10 of file rz_stack.h.

Function Documentation

rz_stack_free()

RZ_API void rz_stack_free

(

RzStack *

s

)

Definition at line 29 of file stack.c.

                                      {
    if (s) {
        if (s->free) {
            int i;
            for (i = 0; i <= s->top; i++) {
                s->free(s->elems[i]);
            }
        }
        free(s->elems);
        free(s);
    }
}

References free(), i, and s.

Referenced by cons_context_deinit(), dfs_node(), GetSegmentHeapBlocks(), rz_cons_break_end(), rz_str_word_set0_stack(), and tree_dfs_node().

rz_stack_is_empty()

RZ_API bool rz_stack_is_empty

(

RzStack *

s

)

Definition at line 68 of file stack.c.

                                          {
    return s->top == -1;
}

References s.

Referenced by dfs_node(), GetSegmentHeapBlocks(), rz_cons_break_end(), rz_cons_context_break_push(), rz_stack_peek(), rz_str_word_set0_stack(), and tree_dfs_node().

rz_stack_new()

RZ_API RzStack* rz_stack_new

(

ut32

n

)

Definition at line 6 of file stack.c.

                                     {
    RzStack *s = RZ_NEW0(RzStack);
    if (!s) {
        return NULL;
    }
    s->elems = RZ_NEWS0(void *, n);
    if (!s->elems) {
        free(s);
        return NULL;
    }
    s->n_elems = n;
    s->top = -1;
    return s;
}

References free(), n, NULL, RZ_NEW0, RZ_NEWS0, and s.

Referenced by dfs_node(), GetSegmentHeapBlocks(), rz_stack_newf(), rz_str_word_set0_stack(), and tree_dfs_node().

rz_stack_newf()

RZ_API RzStack* rz_stack_newf	(	ut32	n,
		RzStackFree	f
	)

Definition at line 21 of file stack.c.

                                                     {
    RzStack *s = rz_stack_new(n);
    if (s) {
        s->free = f;
    }
    return s;
}

References f, n, rz_stack_new(), and s.

Referenced by cons_context_init(), and rz_cons_break_end().

rz_stack_peek()

RZ_API void* rz_stack_peek

(

RzStack *

s

)

Definition at line 76 of file stack.c.

                                       {
    return rz_stack_is_empty(s) ? NULL : s->elems[s->top];
}

References NULL, rz_stack_is_empty(), and s.

rz_stack_pop()

RZ_API void* rz_stack_pop

(

RzStack *

s

)

Definition at line 59 of file stack.c.

                                      {
    if (s->top == -1) {
        return NULL;
    }
    void *res = s->elems[s->top];
    s->top--;
    return res;
}

References NULL, and s.

Referenced by dfs_node(), GetSegmentHeapBlocks(), rz_cons_context_break_pop(), rz_cons_pop(), rz_str_word_set0_stack(), and tree_dfs_node().

rz_stack_push()

RZ_API bool rz_stack_push	(	RzStack *	s,
		void *	el
	)

Definition at line 42 of file stack.c.

                                                {
    if (s->top == s->n_elems - 1) {
        /* reallocate the stack */
        s->n_elems *= 2;
        void **elems = realloc(s->elems, s->n_elems * sizeof(void *));
        if (!elems) {
            return false;
        }
        s->elems = elems;
    }
 
    s->top++;
    s->elems[s->top] = el;
    return true;
}

References realloc(), and s.

Referenced by dfs_node(), GetSegmentHeapBlocks(), rz_cons_context_break_push(), rz_cons_push(), rz_str_word_set0_stack(), and tree_dfs_node().

rz_stack_size()

RZ_API size_t rz_stack_size

(

RzStack *

s

)

Definition at line 72 of file stack.c.

                                        {
    return (size_t)(s->top + 1);
}

References s.