1 /*****************************************************************************/
5 /* Integer stack used for program settings */
9 /* (C) 2004-2010, Ullrich von Bassewitz */
10 /* Roemerstrasse 52 */
11 /* D-70794 Filderstadt */
12 /* EMail: uz@cc65.org */
15 /* This software is provided 'as-is', without any expressed or implied */
16 /* warranty. In no event will the authors be held liable for any damages */
17 /* arising from the use of this software. */
19 /* Permission is granted to anyone to use this software for any purpose, */
20 /* including commercial applications, and to alter it and redistribute it */
21 /* freely, subject to the following restrictions: */
23 /* 1. The origin of this software must not be misrepresented; you must not */
24 /* claim that you wrote the original software. If you use this software */
25 /* in a product, an acknowledgment in the product documentation would be */
26 /* appreciated but is not required. */
27 /* 2. Altered source versions must be plainly marked as such, and must not */
28 /* be misrepresented as being the original software. */
29 /* 3. This notice may not be removed or altered from any source */
32 /*****************************************************************************/
45 /*****************************************************************************/
47 /*****************************************************************************/
51 typedef struct IntStack IntStack;
57 /* An initializer for an empty int stack */
58 #define STATIC_INTSTACK_INITIALIZER { 0, { 0, 0, 0, 0, 0, 0, 0, 0 } }
60 /* Declare an int stack with the given value as first element */
61 #define INTSTACK(Val) { 1, { Val, 0, 0, 0, 0, 0, 0, 0 } }
65 /*****************************************************************************/
67 /*****************************************************************************/
71 #if defined(HAVE_INLINE)
72 INLINE int IS_IsFull (const IntStack* S)
73 /* Return true if there is no space left on the given int stack */
75 return (S->Count >= sizeof (S->Stack) / sizeof (S->Stack[0]));
78 # define IS_IsFull(S) ((S)->Count >= sizeof ((S)->Stack) / sizeof ((S)->Stack[0]))
81 #if defined(HAVE_INLINE)
82 INLINE int IS_IsEmpty (const IntStack* S)
83 /* Return true if there are no values on the given int stack */
85 return (S->Count == 0);
88 # define IS_IsEmpty(S) ((S)->Count == 0)
91 #if defined(HAVE_INLINE)
92 INLINE unsigned IS_GetCount (const IntStack* S)
93 /* Return the number of elements on the given int stack */
98 # define IS_GetCount(S) (S)->Count
101 long IS_Get (const IntStack* S);
102 /* Get the value on top of an int stack */
104 void IS_Set (IntStack* S, long Val);
105 /* Set the value on top of an int stack */
107 void IS_Drop (IntStack* S);
108 /* Drop a value from an int stack */
110 void IS_Push (IntStack* S, long Val);
111 /* Push a value onto an int stack */
113 long IS_Pop (IntStack* S);
114 /* Pop a value from an int stack */
118 /* End of intstack.h */