-#define WORDSIZE(n) (((n) + BITS_PER_WORD - 1) / BITS_PER_WORD)
-#define SETBIT(x, i) ((x)[(i)/BITS_PER_WORD] |= (1<<((i) % BITS_PER_WORD)))
-#define RESETBIT(x, i) ((x)[(i)/BITS_PER_WORD] &= ~(1<<((i) % BITS_PER_WORD)))
-#define BITISSET(x, i) (((x)[(i)/BITS_PER_WORD] & (1<<((i) % BITS_PER_WORD))) != 0)
-
-
-/* Extensions to use for the output files. */
-
-#ifdef VMS
- /* VMS. */
-# define EXT_TAB "_tab"
-# define EXT_OUTPUT ".output"
-# define EXT_STYPE_H "_stype.h"
-# define EXT_GUARD_C "_guard.c"
-#else /* ! VMS */
-# ifdef MSDOS
- /* MS DOS. */
-# define EXT_TAB "_tab"
-# define EXT_OUTPUT ".out"
-# define EXT_STYPE_H ".sth"
-# define EXT_GUARD_C ".guc"
-# else /* ! MSDOS */
- /* Standard. */
-# define EXT_TAB ".tab"
-# define EXT_OUTPUT ".output"
-# define EXT_STYPE_H ".stype.h"
-# define EXT_GUARD_C ".guard.c"
-# endif /* ! MSDOS */
-#endif /* ! VMS */
+
+
+/*---------------------.
+| Free a linked list. |
+`---------------------*/
+
+#define LIST_FREE(Type, List) \
+do { \
+ Type *_node, *_next; \
+ for (_node = List; _node; _node = _next) \
+ { \
+ _next = _node->next; \
+ free (_node); \
+ } \
+} while (0)
+
+
+/* Assertions. <assert.h>'s assertions are too heavyweight, and can
+ be disabled too easily, so implement it separately here. */
+#define assert(x) ((void) ((x) || (abort (), 0)))
+
+
+/*---------------------------------------------.
+| Debugging memory allocation (must be last). |
+`---------------------------------------------*/
+
+# if WITH_DMALLOC
+# define DMALLOC_FUNC_CHECK
+# include <dmalloc.h>
+# endif /* WITH_DMALLOC */
+
+#endif /* ! BISON_SYSTEM_H */