+2004-11-22 Paul Eggert <eggert@cs.ucla.edu>
+
+ * src/LR0.c, src/closure.c, src/derives.c, src/gram.c,
+ src/lalr.c, src/nullable.c, src/relation.c, src/scan-skel.l,
+ src/system.h, src/tables.c: XFREE -> free, to accommodate
+ recent change to gnulib xalloc.h.
+
2004-11-17 Akim Demaille <akim@epita.fr>
* data/lalr1.cc (symprint_): Use cdebug_ to avoid warnings.
free (shiftset);
free (kernel_base);
free (kernel_size);
- XFREE (kernel_items);
+ free (kernel_items);
state_hash_free ();
}
void
free_closure (void)
{
- XFREE (itemset);
+ free (itemset);
bitset_free (ruleset);
bitsetv_free (fderives);
}
expected_rr_conflicts = -1;
}
- src_ok =
+ src_ok =
src_total == (expected_sr_conflicts == -1 ? 0 : expected_sr_conflicts);
- rrc_ok =
+ rrc_ok =
rrc_total == (expected_rr_conflicts == -1 ? 0 : expected_rr_conflicts);
/* If there are as many RR conflicts and SR conflicts as
void
conflicts_free (void)
{
- XFREE (conflicts);
+ free (conflicts);
bitset_free (shift_set);
bitset_free (look_ahead_set);
obstack_free (&solved_conflicts_obstack, NULL);
void
derives_free (void)
{
- XFREE (derives[0]);
- XFREE (derives);
+ free (derives[0]);
+ free (derives);
}
void
grammar_free (void)
{
- XFREE (ritem);
+ free (ritem);
free (rules);
- XFREE (token_translations);
+ free (token_translations);
/* Free the symbol table data structure. */
symbols_free ();
free_merger_functions ();
}
}
- XFREE (temp_map);
+ free (temp_map);
}
relation_digraph (reads, ngotos, &F);
for (i = 0; i < ngotos; i++)
- XFREE (reads[i]);
+ free (reads[i]);
- XFREE (reads);
- XFREE (edge);
+ free (reads);
+ free (edge);
}
}
}
- XFREE (edge);
- XFREE (states1);
+ free (edge);
+ free (states1);
relation_transpose (&includes, ngotos);
}
relation_digraph (includes, ngotos, &F);
for (i = 0; i < ngotos; i++)
- XFREE (includes[i]);
+ free (includes[i]);
- XFREE (includes);
+ free (includes);
}
for (i = 0; i < nLA; i++)
LIST_FREE (goto_list, lookback[i]);
- XFREE (lookback);
+ free (lookback);
bitsetv_free (F);
}
}
}
- XFREE (squeue);
- XFREE (rcount);
- XFREE (rsets);
- XFREE (relts);
+ free (squeue);
+ free (rcount);
+ free (rsets);
+ free (relts);
if (trace_flag & trace_sets)
nullable_print (stderr);
void
nullable_free (void)
{
- XFREE (nullable);
+ free (nullable);
}
if (INDEX[i] == 0 && R[i])
traverse (i);
- XFREE (INDEX);
- XFREE (VERTICES);
+ free (INDEX);
+ free (VERTICES);
*function = F;
}
/* Free the input: it is replaced with the result. */
for (i = 0; i < n; i++)
- XFREE ((*R_arg)[i]);
+ free ((*R_arg)[i]);
free (*R_arg);
if (trace_flag & trace_sets)
fatal ("invalid token in skeleton: %s", yytext);
}
- XFREE (outname);
+ free (outname);
outname = xstrdup (filename);
xfclose (yyout);
yyout = xfopen (outname, "w");
for (_node = List; _node; _node = _next) \
{ \
_next = _node->next; \
- XFREE (_node); \
+ free (_node); \
} \
} while (0)
{
free (froms[i]);
free (tos[i]);
- XFREE (conflict_tos[i]);
+ free (conflict_tos[i]);
}
free (froms);