return to;
}
-void g_list_free_full(GList * list) {
- GList * cur = list;
-
- while (cur != NULL) {
- gpointer data = cur->data;
- amfree(data);
- cur = g_list_next(cur);
- }
-
- g_list_free(list);
-}
-
-void g_slist_free_full(GSList * list) {
+#if (GLIB_MAJOR_VERSION < 2 || (GLIB_MAJOR_VERSION == 2 && GLIB_MINOR_VERSION < 28))
+void slist_free_full(GSList * list, GDestroyNotify free_fn) {
GSList * cur = list;
while (cur != NULL) {
gpointer data = cur->data;
- amfree(data);
+ free_fn(data);
cur = g_slist_next(cur);
}
g_slist_free(list);
}
-
-void g_queue_free_full(GQueue * queue) {
- while (!g_queue_is_empty(queue)) {
- gpointer data;
- data = g_queue_pop_head(queue);
- amfree(data);
- }
- g_queue_free(queue);
-}
+#endif
void g_ptr_array_free_full(GPtrArray * array) {
size_t i;
#endif
guint
-g_str_case_hash(
+g_str_amanda_hash(
gconstpointer key)
{
/* modified version of glib's hash function, copyright
* GLib Team and others 1997-2000. */
- const char *p = key;
- guint h = g_ascii_toupper(*p);
+ const char *p;
+ guint h = 0;
- if (h)
- for (p += 1; *p != '\0'; p++)
- h = (h << 5) - h + g_ascii_toupper(*p);
+ for (p = key; *p != '\0'; p++)
+ h = (h << 5) - h + (('_' == *p) ? '-' : g_ascii_tolower(*p));
return h;
}
gboolean
-g_str_case_equal(
+g_str_amanda_equal(
gconstpointer v1,
gconstpointer v2)
{
- return (0 == g_ascii_strcasecmp((char *)v1, (char *)v2));
+ const gchar *p1 = v1, *p2 = v2;
+ while (*p1) {
+ /* letting '-' == '_' */
+ if (!('-' == *p1 || '_' == *p1) || !('-' == *p2 || '_' == *p2))
+ if (g_ascii_tolower(*p1) != g_ascii_tolower(*p2))
+ return FALSE;
+
+ p1++;
+ p2++;
+ }
+
+ /* p1 is at '\0' is p2 too? */
+ return *p2? FALSE : TRUE;
}