X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/37e884cd9a249660f39b5b7290e1f4b3dcc851b0..0fe9720964da510a2b359af390a3053aace65f9f:/src/system.h diff --git a/src/system.h b/src/system.h index e3f17d89..6355141a 100644 --- a/src/system.h +++ b/src/system.h @@ -39,9 +39,18 @@ # include # include -# if HAVE_SYS_TYPES_H -# include -# endif +# define ARRAY_CARDINALITY(Array) (sizeof (Array) / sizeof *(Array)) +# define STREQ(L, R) (strcmp(L, R) == 0) +# define STRNEQ(L, R) (!STREQ(L, R)) + +/* Just like strncmp, but the second argument must be a literal string + and you don't specify the length. */ +# define STRNCMP_LIT(S, Literal) \ + strncmp (S, "" Literal "", sizeof (Literal) - 1) + +/* Whether Literal is a prefix of S. */ +# define STRPREFIX_LIT(Literal, S) \ + (STRNCMP_LIT (S, Literal) == 0) # include # include @@ -52,7 +61,7 @@ typedef size_t uintptr_t; # endif -// Version mismatch. +/* Version mismatch. */ # define EX_MISMATCH 63 /*---------. @@ -85,7 +94,7 @@ typedef size_t uintptr_t; # ifndef __attribute__ /* This feature is available in gcc versions 2.5 and later. */ # if (! defined __GNUC__ || __GNUC__ < 2 \ - || (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || __STRICT_ANSI__) + || (__GNUC__ == 2 && __GNUC_MINOR__ < 5)) # define __attribute__(Spec) /* empty */ # endif # endif @@ -105,7 +114,6 @@ typedef size_t uintptr_t; # define ATTRIBUTE_UNUSED __attribute__ ((__unused__)) # endif -# define FUNCTION_PRINT() fprintf (stderr, "%s: ", __func__) /*------. | NLS. | @@ -160,37 +168,56 @@ typedef size_t uintptr_t; # define obstack_chunk_free free # include +/* String-grow: append Str to Obs. */ + # define obstack_sgrow(Obs, Str) \ obstack_grow (Obs, Str, strlen (Str)) -# define obstack_fgrow1(Obs, Format, Arg1) \ -do { \ - char buf[4096]; \ - sprintf (buf, Format, Arg1); \ - obstack_grow (Obs, buf, strlen (buf)); \ -} while (0) +/* Output Str escaped for our postprocessing (i.e., escape M4 special + characters). + + For instance "[foo]" -> "@{foo@}", "$$" -> "$][$][". */ + +# define obstack_escape(Obs, Str) \ + do { \ + char const *p__; \ + for (p__ = Str; *p__; p__++) \ + switch (*p__) \ + { \ + case '$': obstack_sgrow (Obs, "$]["); break; \ + case '@': obstack_sgrow (Obs, "@@" ); break; \ + case '[': obstack_sgrow (Obs, "@{" ); break; \ + case ']': obstack_sgrow (Obs, "@}" ); break; \ + default: obstack_1grow (Obs, *p__ ); break; \ + } \ + } while (0) -# define obstack_fgrow2(Obs, Format, Arg1, Arg2) \ -do { \ - char buf[4096]; \ - sprintf (buf, Format, Arg1, Arg2); \ - obstack_grow (Obs, buf, strlen (buf)); \ -} while (0) -# define obstack_fgrow3(Obs, Format, Arg1, Arg2, Arg3) \ -do { \ - char buf[4096]; \ - sprintf (buf, Format, Arg1, Arg2, Arg3); \ - obstack_grow (Obs, buf, strlen (buf)); \ -} while (0) +/* Output Str both quoted for M4 (i.e., embed in [[...]]), and escaped + for our postprocessing (i.e., escape M4 special characters). If + Str is empty (or NULL), output "[]" instead of "[[]]" as it make M4 + programming easier (m4_ifval can be used). -# define obstack_fgrow4(Obs, Format, Arg1, Arg2, Arg3, Arg4) \ -do { \ - char buf[4096]; \ - sprintf (buf, Format, Arg1, Arg2, Arg3, Arg4); \ - obstack_grow (Obs, buf, strlen (buf)); \ -} while (0) + For instance "[foo]" -> "[[@{foo@}]]", "$$" -> "[[$][$][]]". */ +# define obstack_quote(Obs, Str) \ + do { \ + char const* obstack_quote_p = Str; \ + if (obstack_quote_p && obstack_quote_p[0]) \ + { \ + obstack_sgrow (Obs, "[["); \ + obstack_escape (Obs, obstack_quote_p); \ + obstack_sgrow (Obs, "]]"); \ + } \ + else \ + obstack_sgrow (Obs, "[]"); \ + } while (0) + + +/* Append the ending 0, finish Obs, and return the string. */ + +# define obstack_finish0(Obs) \ + (obstack_1grow (Obs, '\0'), (char *) obstack_finish (Obs)) /*-----------------------------------------. @@ -205,25 +232,21 @@ do { \ # define TAB_EXT ".tab" # endif -# ifndef DEFAULT_TMPDIR -# define DEFAULT_TMPDIR "/tmp" -# endif - /*---------------------. | 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) +# define LIST_FREE(Type, List) \ + do { \ + Type *_node, *_next; \ + for (_node = List; _node; _node = _next) \ + { \ + _next = _node->next; \ + free (_node); \ + } \ + } while (0) /*---------------------------------------------.