XFREE -> free

ChangeLog

@@ -1,3 +1,10 @@
+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.

src/LR0.c

@@ -158,7 +158,7 @@ free_storage (void)
   free (shiftset);
   free (kernel_base);
   free (kernel_size);
-  XFREE (kernel_items);
+  free (kernel_items);
   state_hash_free ();
 }
 

src/closure.c

@@ -241,7 +241,7 @@ closure (item_number *core, int n)
 void
 free_closure (void)
 {
-  XFREE (itemset);
+  free (itemset);
   bitset_free (ruleset);
   bitsetv_free (fderives);
 }

src/conflicts.c

@@ -488,9 +488,9 @@ conflicts_print (void)
       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
@@ -522,7 +522,7 @@ conflicts_print (void)
 void
 conflicts_free (void)
 {
-  XFREE (conflicts);
+  free (conflicts);
   bitset_free (shift_set);
   bitset_free (look_ahead_set);
   obstack_free (&solved_conflicts_obstack, NULL);

src/derives.c

@@ -116,6 +116,6 @@ derives_compute (void)
 void
 derives_free (void)
 {
-  XFREE (derives[0]);
-  XFREE (derives);
+  free (derives[0]);
+  free (derives);
 }

src/gram.c

@@ -326,9 +326,9 @@ grammar_rules_never_reduced_report (const char *message)
 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 ();

src/lalr.c

@@ -128,7 +128,7 @@ set_goto_map (void)
 	}
     }
 
-  XFREE (temp_map);
+  free (temp_map);
 }
 
 
@@ -203,10 +203,10 @@ initialize_F (void)
   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);
 }
 
 
@@ -283,8 +283,8 @@ build_relations (void)
 	}
     }
 
-  XFREE (edge);
-  XFREE (states1);
+  free (edge);
+  free (states1);
 
   relation_transpose (&includes, ngotos);
 }
@@ -299,9 +299,9 @@ compute_FOLLOWS (void)
   relation_digraph (includes, ngotos, &F);
 
   for (i = 0; i < ngotos; i++)
-    XFREE (includes[i]);
+    free (includes[i]);
 
-  XFREE (includes);
+  free (includes);
 }
 
 
@@ -319,7 +319,7 @@ compute_look_ahead_tokens (void)
   for (i = 0; i < nLA; i++)
     LIST_FREE (goto_list, lookback[i]);
 
-  XFREE (lookback);
+  free (lookback);
   bitsetv_free (F);
 }
 

src/nullable.c

@@ -126,10 +126,10 @@ nullable_compute (void)
 	    }
       }
 
-  XFREE (squeue);
-  XFREE (rcount);
-  XFREE (rsets);
-  XFREE (relts);
+  free (squeue);
+  free (rcount);
+  free (rsets);
+  free (relts);
 
   if (trace_flag & trace_sets)
     nullable_print (stderr);
@@ -139,5 +139,5 @@ nullable_compute (void)
 void
 nullable_free (void)
 {
-  XFREE (nullable);
+  free (nullable);
 }

src/relation.c

@@ -112,8 +112,8 @@ relation_digraph (relation r, size_t size, bitsetv *function)
     if (INDEX[i] == 0 && R[i])
       traverse (i);
 
-  XFREE (INDEX);
-  XFREE (VERTICES);
+  free (INDEX);
+  free (VERTICES);
 
   *function = F;
 }
@@ -170,7 +170,7 @@ relation_transpose (relation *R_arg, int n)
 
   /* 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)

src/scan-skel.l

@@ -58,7 +58,7 @@ int skel_lex (void);
 	fatal ("invalid token in skeleton: %s", yytext);
     }
 
-  XFREE (outname);
+  free (outname);
   outname = xstrdup (filename);
   xfclose (yyout);
   yyout = xfopen (outname, "w");

src/system.h

@@ -205,7 +205,7 @@ do {						\
   for (_node = List; _node; _node = _next)	\
     {						\
       _next = _node->next;			\
-      XFREE (_node);				\
+      free (_node);				\
     }						\
 } while (0)
 

src/tables.c

@@ -835,7 +835,7 @@ tables_generate (void)
     {
       free (froms[i]);
       free (tos[i]);
-      XFREE (conflict_tos[i]);
+      free (conflict_tos[i]);
     }
 
   free (froms);