Merge remote-tracking branch 'origin/maint'

* origin/maint:
  maint: post-release administrivia
  version 3.0.4
  gnulib: update
  build: re-enable compiler warnings, and fix them
  tests: c++: fix a C++03 conformance issue
  tests: fix a title
  c++: reserve 200 slots in the parser's stack
  tests: be more robust to unrecognized synclines, and try to recognize xlc
  tests: fix C++ conformance
  build: fix some warnings
  build: avoid infinite recursions on include_next
This commit is contained in:
Akim Demaille
2015-01-23 15:17:35 +01:00
28 changed files with 95 additions and 52 deletions

View File

@@ -546,7 +546,7 @@ AnnotationList__compute_from_inadequacies (
AnnotationList__insertInto (annotation_node,
&annotation_lists[s->number],
s->nitems);
aver (b);
aver (b); (void) b;
}
/* This aver makes sure the
AnnotationList__computeDominantContribution check above

View File

@@ -66,7 +66,7 @@ symbol *
InadequacyList__getContributionToken (InadequacyList const *self,
ContributionIndex i)
{
aver (0 <= i && i < self->contributionCount);
aver (0 <= i && i < self->contributionCount); (void) i;
return self->inadequacy.conflict.token;
}

View File

@@ -113,8 +113,8 @@ conclude_red (struct obstack *out, int source, rule_number ruleno,
with n the source state and m the rule number. This is because we
don't want all the reductions bearing a same rule number to point to
the same state, since that is not the desired format. */
fprintf (fout, " %1$d -> \"%1$dR%2$d%3$s\" [",
source, ruleno, ed);
fprintf (fout, " %d -> \"%dR%d%s\" [",
source, source, ruleno, ed);
/* (The lookahead tokens have been added to the beginning of the
obstack, in the caller function.) */

View File

@@ -1102,7 +1102,10 @@ ielr (void)
else if (STREQ (type, "canonical-lr"))
lr_type = LR_TYPE__CANONICAL_LR;
else
aver (false);
{
aver (false);
abort ();
}
free (type);
}

View File

@@ -344,6 +344,7 @@ print_reductions (FILE *out, state *s)
|| (STREQ (default_reductions, "consistent")
&& default_reduction_only)
|| (reds->num == 1 && reds->rules[0]->number == 0));
(void) default_reduction_only;
free (default_reductions);
}
}

View File

@@ -664,7 +664,7 @@ handle_action_dollar (symbol_list *rule, char *text, location dollar_loc)
case LHS_REF:
if (!type_name)
type_name = symbol_list_n_type_name_get (rule, dollar_loc, 0);
type_name = symbol_list_n_type_name_get (rule, 0);
if (!type_name)
{
@@ -695,8 +695,7 @@ handle_action_dollar (symbol_list *rule, char *text, location dollar_loc)
if (max_left_semantic_context < 1 - n)
max_left_semantic_context = 1 - n;
if (!type_name && 0 < n)
type_name =
symbol_list_n_type_name_get (effective_rule, dollar_loc, n);
type_name = symbol_list_n_type_name_get (effective_rule, n);
if (!type_name)
{
if (union_seen | tag_seen)

View File

@@ -190,7 +190,7 @@ symbol_list_n_get (symbol_list *l, int n)
`--------------------------------------------------------------*/
uniqstr
symbol_list_n_type_name_get (symbol_list *l, location loc, int n)
symbol_list_n_type_name_get (symbol_list *l, int n)
{
return symbol_list_n_get (l, n)->content.sym->content->type_name;
}

View File

@@ -124,7 +124,7 @@ symbol_list *symbol_list_n_get (symbol_list *l, int n);
/* Get the data type (alternative in the union) of the value for
symbol N in rule RULE. */
uniqstr symbol_list_n_type_name_get (symbol_list *l, location loc, int n);
uniqstr symbol_list_n_type_name_get (symbol_list *l, int n);
/* Check whether the node is a border element of a rule. */
bool symbol_list_null (symbol_list *node);

View File

@@ -187,7 +187,7 @@ code_props_type_string (code_props_type kind)
case printer:
return "%printer";
}
assert (0);
abort ();
}

View File

@@ -74,12 +74,12 @@ typedef enum
declared,
} status;
typedef enum code_props_type code_props_type;
enum code_props_type
{
destructor = 0,
printer = 1,
};
typedef enum code_props_type code_props_type;
enum { CODE_PROPS_SIZE = 2 };

View File

@@ -698,7 +698,7 @@ pack_vector (vector_number vector)
if (ok)
{
int loc;
int loc PACIFY_CC (= -1);
int k;
for (k = 0; k < t; k++)
{