/* */
/* */
/* */
-/* (C) 2004 Ullrich von Bassewitz */
-/* Römerstraße 52 */
-/* D-70794 Filderstadt */
-/* EMail: uz@cc65.org */
+/* (C) 2004-2010, Ullrich von Bassewitz */
+/* Roemerstrasse 52 */
+/* D-70794 Filderstadt */
+/* EMail: uz@cc65.org */
/* */
/* */
/* This software is provided 'as-is', without any expressed or implied */
long Stack[8];
};
+/* An initializer for an empty int stack */
+#define STATIC_INTSTACK_INITIALIZER { 0, { 0, 0, 0, 0, 0, 0, 0, 0 } }
+
/* Declare an int stack with the given value as first element */
#define INTSTACK(Val) { 1, { Val, 0, 0, 0, 0, 0, 0, 0 } }
# define IS_IsFull(S) ((S)->Count >= sizeof ((S)->Stack) / sizeof ((S)->Stack[0]))
#endif
+#if defined(HAVE_INLINE)
+INLINE int IS_IsEmpty (const IntStack* S)
+/* Return true if there are no values on the given int stack */
+{
+ return (S->Count == 0);
+}
+#else
+# define IS_IsEmpty(S) ((S)->Count == 0)
+#endif
+
#if defined(HAVE_INLINE)
INLINE unsigned IS_GetCount (const IntStack* S)
/* Return the number of elements on the given int stack */
void IS_Push (IntStack* S, long Val);
/* Push a value onto an int stack */
+long IS_Pop (IntStack* S);
+/* Pop a value from an int stack */
-/* End of intstack.h */
-#endif
-
+/* End of intstack.h */
+#endif