X-Git-Url: https://git.artsoft.org/?a=blobdiff_plain;f=src%2Fgame_bd%2Fbd_cave.c;h=15dc6cf1c80b0204baf988160927f6d624c46acf;hb=c89f4820aaab48ad6c79d2eac0f16b06f63438dc;hp=1b014ccd4546f0d199a816bbdc09aabb37b348e4;hpb=676a1f66491c208d47c2b5bc6e9ce18e0a28005c;p=rocksndiamonds.git diff --git a/src/game_bd/bd_cave.c b/src/game_bd/bd_cave.c index 1b014ccd..15dc6cf1 100644 --- a/src/game_bd/bd_cave.c +++ b/src/game_bd/bd_cave.c @@ -81,7 +81,7 @@ static const char* scheduling_filename[] = "bd2ckatari" }; -static struct hashtable *name_to_element; +static HashTable *name_to_element; GdElement gd_char_to_element[256]; /* color of flashing the screen, gate opening to exit */ @@ -275,8 +275,8 @@ void gd_cave_init(void) /* put names to a hash table */ /* this is a helper for file read operations */ - /* maps g_strdupped strings to elemenets (integers) */ - name_to_element = create_hashtable(str_case_hash, str_case_equal, NULL, NULL); + /* maps copied strings to elements (integers) */ + name_to_element = create_hashtable(gd_str_case_hash, gd_str_case_equal, NULL, NULL); for (i = 0; i < O_MAX; i++) { @@ -290,7 +290,7 @@ void gd_cave_init(void) hashtable_insert(name_to_element, key, INT_TO_PTR(i)); /* ^^^ do not free "key", as hash table needs it during the whole time! */ - key = g_strdup_printf("SCANNED_%s", key); /* new string */ + key = getStringCat2("SCANNED_", key); /* new string */ hashtable_insert(name_to_element, key, INT_TO_PTR(i)); /* once again, do not free "key" ^^^ */ @@ -423,12 +423,12 @@ int gd_add_highscore(GdHighScore *highscores, const char *name, int score) } /* for the case-insensitive hash keys */ -int str_case_equal(void *s1, void *s2) +int gd_str_case_equal(void *s1, void *s2) { return strcasecmp(s1, s2) == 0; } -unsigned int str_case_hash(void *v) +unsigned int gd_str_case_hash(void *v) { char *upper = getStringToUpper(v); unsigned int hash = get_hash_from_string(upper); @@ -438,23 +438,6 @@ unsigned int str_case_hash(void *v) return hash; } -/* for the case-insensitive hash keys */ -boolean gd_str_case_equal(gconstpointer s1, gconstpointer s2) -{ - return strcasecmp(s1, s2) == 0; -} - -guint gd_str_case_hash(gconstpointer v) -{ - char *upper; - guint hash; - - upper = g_ascii_strup(v, -1); - hash = g_str_hash(v); - free(upper); - return hash; -} - /* create new cave with default values. sets every value, also default size, diamond value etc. @@ -466,7 +449,7 @@ GdCave *gd_cave_new(void) cave = checked_calloc(sizeof(GdCave)); /* hash table which stores unknown tags as strings. */ - cave->tags = g_hash_table_new_full(gd_str_case_hash, gd_str_case_equal, free, free); + cave->tags = create_hashtable(gd_str_case_hash, gd_str_case_equal, free, free); gd_cave_set_gdash_defaults(cave); @@ -553,7 +536,7 @@ void gd_cave_free(GdCave *cave) return; if (cave->tags) - g_hash_table_destroy(cave->tags); + hashtable_destroy(cave->tags); if (cave->random) /* random generator is a GRand * */ g_rand_free(cave->random); @@ -584,9 +567,9 @@ void gd_cave_free(GdCave *cave) free (cave); } -static void hash_copy_foreach(const char *key, const char *value, GHashTable *dest) +static void hash_copy_foreach(const char *key, const char *value, HashTable *dest) { - g_hash_table_insert(dest, g_strdup(key), g_strdup(value)); + hashtable_insert(dest, getStringCopy(key), getStringCopy(value)); } /* copy cave from src to destination, with duplicating dynamically allocated data */ @@ -598,10 +581,10 @@ void gd_cave_copy(GdCave *dest, const GdCave *src) g_memmove(dest, src, sizeof(GdCave)); /* but duplicate dynamic data */ - dest->tags = g_hash_table_new_full(gd_str_case_hash, gd_str_case_equal, - free, free); + dest->tags = create_hashtable(gd_str_case_hash, gd_str_case_equal, free, free); + if (src->tags) - g_hash_table_foreach(src->tags, (GHFunc) hash_copy_foreach, dest->tags); + hashtable_foreach(src->tags, (hashtable_fn)hash_copy_foreach, dest->tags); dest->map = gd_cave_map_dup(src, map); dest->hammered_reappear = gd_cave_map_dup(src, hammered_reappear);