X-Git-Url: https://plomlompom.com/repos/?a=blobdiff_plain;f=src%2Fserver%2Fai.c;h=94f212ea7aa8eebddfb7cd1db83c1697c3ed925d;hb=1cb57a35a3b3cc4ec8870531ca254a655c0bdda2;hp=497d35d4e633ca50a2cc9f9e81dc235755d7f603;hpb=ab0b952b3178d390f945db68b29abc555e2f5aa6;p=plomrogue

diff --git a/src/server/ai.c b/src/server/ai.c
index 497d35d..94f212e 100644
--- a/src/server/ai.c
+++ b/src/server/ai.c
@@ -122,15 +122,13 @@ static void dijkstra_map(uint16_t * score_map, uint16_t max_score)
 
 static char get_dir_to_nearest_enemy(struct Thing * t_origin)
 {
-    char * f_name = "get_dir_to_nearest_enemy()";
-
     /* Calculate for each cell the distance to the visibly nearest map actor not
      * "t_origin", with movement only possible in the directions of "dir".
      * (Actors' own cells start with a distance of 0 towards themselves.)
      */
     uint32_t map_size = world.map.length * world.map.length;
     uint16_t max_score = UINT16_MAX - 1;
-    uint16_t * score_map = try_malloc(map_size * sizeof(uint16_t), f_name);
+    uint16_t * score_map = try_malloc(map_size * sizeof(uint16_t), __func__);
     uint32_t i;
     for (i = 0; i < map_size; i++)
     {