parseStack.c File Reference

#include "parseInt.h"

Include dependency graph for parseStack.c:

Go to the source code of this file.

Classes
struct	ParseStackFnStruct
	DECLARATIONS ///. More...
struct	ParseStackOpStruct

Functions
Parse_StackFn_t *	Parse_StackFnStart (int nDepth)
	FUNCTION DEFINITIONS ///.
int	Parse_StackFnIsEmpty (Parse_StackFn_t *p)
void	Parse_StackFnPush (Parse_StackFn_t *p, void *bFunc)
void *	Parse_StackFnPop (Parse_StackFn_t *p)
void	Parse_StackFnFree (Parse_StackFn_t *p)
Parse_StackOp_t *	Parse_StackOpStart (int nDepth)
int	Parse_StackOpIsEmpty (Parse_StackOp_t *p)
void	Parse_StackOpPush (Parse_StackOp_t *p, int Oper)
int	Parse_StackOpPop (Parse_StackOp_t *p)
void	Parse_StackOpFree (Parse_StackOp_t *p)

Function Documentation

Parse_StackFnFree()

void Parse_StackFnFree

(

Parse_StackFn_t *

p

)

Function*************************************************************

Synopsis [Deletes the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 136 of file parseStack.c.

{
    ABC_FREE( p->pData );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Parse_StackFnIsEmpty()

int Parse_StackFnIsEmpty

(

Parse_StackFn_t *

p

)

Function*************************************************************

Synopsis [Checks whether the stack is empty.]

Description []

SideEffects []

SeeAlso []

Definition at line 78 of file parseStack.c.

{
    return (int)(p->Top == 0);
}

Here is the caller graph for this function:

Parse_StackFnPop()

void * Parse_StackFnPop

(

Parse_StackFn_t *

p

)

Function*************************************************************

Synopsis [Pops an entry out of the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 115 of file parseStack.c.

{
    if ( p->Top == 0 )
    {
        printf( "Parse_StackFnPush(): Trying to extract data from the empty stack!\n" );
        return NULL;
    }
    return p->pData[ --p->Top ];
}

Here is the caller graph for this function:

Parse_StackFnPush()

void Parse_StackFnPush	(	Parse_StackFn_t *	p,
		void *	bFunc )

Function*************************************************************

Synopsis [Pushes an entry into the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 94 of file parseStack.c.

{
    if ( p->Top >= p->Size )
    {
        printf( "Parse_StackFnPush(): Stack size is too small!\n" );
        return;
    }
    p->pData[ p->Top++ ] = bFunc;
}

Here is the caller graph for this function:

Parse_StackFnStart()

Parse_StackFn_t * Parse_StackFnStart

(

int

nDepth

)

FUNCTION DEFINITIONS ///.

GLOBAL VARIABLES ///.

Function*************************************************************

Synopsis [Starts the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 57 of file parseStack.c.

{
    Parse_StackFn_t * p;
    p = ABC_ALLOC( Parse_StackFn_t, 1 );
    memset( p, 0, sizeof(Parse_StackFn_t) );
    p->pData = ABC_ALLOC( void *, nDepth );
    p->Size = nDepth;
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Parse_StackOpFree()

void Parse_StackOpFree

(

Parse_StackOp_t *

p

)

Function*************************************************************

Synopsis [Deletes the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 235 of file parseStack.c.

{
    ABC_FREE( p->pData );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Parse_StackOpIsEmpty()

int Parse_StackOpIsEmpty

(

Parse_StackOp_t *

p

)

Function*************************************************************

Synopsis [Checks whether the stack is empty.]

Description []

SideEffects []

SeeAlso []

Definition at line 177 of file parseStack.c.

{
    return (int)(p->Top == 0);
}

Here is the caller graph for this function:

Parse_StackOpPop()

int Parse_StackOpPop

(

Parse_StackOp_t *

p

)

Function*************************************************************

Synopsis [Pops an entry out of the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 214 of file parseStack.c.

{
    if ( p->Top == 0 )
    {
        printf( "Parse_StackOpPush(): Trying to extract data from the empty stack!\n" );
        return -1;
    }
    return p->pData[ --p->Top ];
}

Here is the caller graph for this function:

Parse_StackOpPush()

void Parse_StackOpPush	(	Parse_StackOp_t *	p,
		int	Oper )

Function*************************************************************

Synopsis [Pushes an entry into the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 193 of file parseStack.c.

{
    if ( p->Top >= p->Size )
    {
        printf( "Parse_StackOpPush(): Stack size is too small!\n" );
        return;
    }
    p->pData[ p->Top++ ] = Oper;
}

Here is the caller graph for this function:

Parse_StackOpStart()

Parse_StackOp_t * Parse_StackOpStart

(

int

nDepth

)

Function*************************************************************

Synopsis [Starts the stack.]

Description []

SideEffects []

SeeAlso []

Definition at line 156 of file parseStack.c.

{
    Parse_StackOp_t * p;
    p = ABC_ALLOC( Parse_StackOp_t, 1 );
    memset( p, 0, sizeof(Parse_StackOp_t) );
    p->pData = ABC_ALLOC( int, nDepth );
    p->Size = nDepth;
    return p;
}

Here is the call graph for this function:

Here is the caller graph for this function: