--- a/src/archiver_unpacked.c	Thu Mar 22 03:00:16 2012 -0400
+++ b/src/archiver_unpacked.c	Thu Mar 22 03:02:50 2012 -0400
@@ -199,7 +199,7 @@
     while (lo <= hi)
     {
         middle = lo + ((hi - lo) / 2);
-        rc = __PHYSFS_utf8strcasecmp(name, a[middle].name);
+        rc = __PHYSFS_utf8stricmp(name, a[middle].name);
         if (rc == 0)  /* found it! */
             return &a[middle];
         else if (rc > 0)

--- a/src/physfs_internal.h	Thu Mar 22 03:00:16 2012 -0400
+++ b/src/physfs_internal.h	Thu Mar 22 03:02:50 2012 -0400
@@ -350,11 +350,10 @@
  *  algorithms possible, if not entirely sane. Most cases should treat the
  *  return value as "equal" or "not equal".
  */
-/* !!! FIXME: why is this casecmp, when everyone else is icmp? */
-int __PHYSFS_utf8strcasecmp(const char *s1, const char *s2);
+int __PHYSFS_utf8stricmp(const char *s1, const char *s2);
 
 /*
- * This works like __PHYSFS_utf8strcasecmp(), but takes a character (NOT BYTE
+ * This works like __PHYSFS_utf8stricmp(), but takes a character (NOT BYTE
  *  COUNT) argument, like strcasencmp().
  */
 int __PHYSFS_utf8strnicmp(const char *s1, const char *s2, PHYSFS_uint32 l);

--- a/src/physfs_unicode.c	Thu Mar 22 03:00:16 2012 -0400
+++ b/src/physfs_unicode.c	Thu Mar 22 03:02:50 2012 -0400
@@ -455,7 +455,7 @@
 } /* utf8codepointcmp */
 
 
-int __PHYSFS_utf8strcasecmp(const char *str1, const char *str2)
+int __PHYSFS_utf8stricmp(const char *str1, const char *str2)
 {
     while (1)
     {
@@ -466,7 +466,7 @@
     } /* while */
 
     return 0;
-} /* __PHYSFS_utf8strcasecmp */
+} /* __PHYSFS_utf8stricmp */
 
 
 int __PHYSFS_utf8strnicmp(const char *str1, const char *str2, PHYSFS_uint32 n)