--- deliantra/server/common/recipe.C	2009/11/06 12:49:19	1.30
+++ deliantra/server/common/recipe.C	2009/11/06 13:03:34	1.31
@@ -288,7 +288,7 @@
 /* Find a treasure with a matching name.  The 'depth' parameter is
  * only there to prevent infinite loops in treasure lists (a list
  * referencing another list pointing back to the first one). */
-archetype *
+static archetype *
 find_treasure_by_name (const treasure *t, const char *name, int depth)
 {
   if (depth > 10)
@@ -331,7 +331,7 @@
  * (e.g. sage & c_sage) or if only one of the monsters generates the
  * body parts that we are looking for (e.g. big_dragon and
  * big_dragon_worthless). */
-long
+static long
 find_ingred_cost (const char *name)
 {
   archetype *at2;
@@ -416,7 +416,7 @@
   return -1;
 }
 
-const char *
+static const char *
 ingred_name (const char *name)
 {
   const char *cp = name;
@@ -427,7 +427,7 @@
   return cp;
 }
 
-int
+static int
 numb_ingred (const char *buf)
 {
   int numb;
@@ -473,7 +473,7 @@
   return 0;
 }
 
-recipelist *
+static recipelist *
 get_random_recipelist (void)
 {
   recipelist *fl = NULL;
@@ -529,7 +529,7 @@
   return rp;
 }
 
-void
+static void
 free_all_recipes (void)
 {
   recipelist *fl = formulalist, *flnext;