Style fix. space -> tab.

1 files changed, 61 insertions, 59 deletions

diff --git a/libarchive/archive_util.c b/libarchive/archive_util.c
index a6a485c6..643eef87 100644
--- a/libarchive/archive_util.c
+++ b/libarchive/archive_util.c
@@ -549,68 +549,70 @@ __archive_ensure_cloexec_flag(int fd)
 static int
 archive_utility_string_sort_helper(char **strings, unsigned int n)
 {
-  unsigned int i, lesser_count, greater_count;
-  char **lesser, **greater, **tmp, *pivot;
-  int retval1, retval2;
-
-  /* A list of 0 or 1 elements is already sorted */
-  if (n <= 1)
-    return (ARCHIVE_OK);
-
-  lesser_count = greater_count = 0;
-  lesser = greater = NULL;
-  pivot = strings[0];
-  for (i = 1; i < n; i++)
-  {
-    if (strcmp(strings[i], pivot) < 0)
-    {
-      lesser_count++;
-      tmp = (char **)realloc(lesser, lesser_count * sizeof(char *));
-      if (!tmp) {
-        free(greater);
-        free(lesser);
-        return (ARCHIVE_FATAL);
-      }
-      lesser = tmp;
-      lesser[lesser_count - 1] = strings[i];
-    }
-    else
-    {
-      greater_count++;
-      tmp = (char **)realloc(greater, greater_count * sizeof(char *));
-      if (!tmp) {
-        free(greater);
-        free(lesser);
-        return (ARCHIVE_FATAL);
-      }
-      greater = tmp;
-      greater[greater_count - 1] = strings[i];
-    }
-  }
-
-  /* quicksort(lesser) */
-  retval1 = archive_utility_string_sort_helper(lesser, lesser_count);
-  for (i = 0; i < lesser_count; i++)
-    strings[i] = lesser[i];
-  free(lesser);
-
-  /* pivot */
-  strings[lesser_count] = pivot;
-
-  /* quicksort(greater) */
-  retval2 = archive_utility_string_sort_helper(greater, greater_count);
-  for (i = 0; i < greater_count; i++)
-    strings[lesser_count + 1 + i] = greater[i];
-  free(greater);
-
-  return (retval1 < retval2) ? retval1 : retval2;
+	unsigned int i, lesser_count, greater_count;
+	char **lesser, **greater, **tmp, *pivot;
+	int retval1, retval2;
+
+	/* A list of 0 or 1 elements is already sorted */
+	if (n <= 1)
+		return (ARCHIVE_OK);
+
+	lesser_count = greater_count = 0;
+	lesser = greater = NULL;
+	pivot = strings[0];
+	for (i = 1; i < n; i++)
+	{
+		if (strcmp(strings[i], pivot) < 0)
+		{
+			lesser_count++;
+			tmp = (char **)realloc(lesser,
+				lesser_count * sizeof(char *));
+			if (!tmp) {
+				free(greater);
+				free(lesser);
+				return (ARCHIVE_FATAL);
+			}
+			lesser = tmp;
+			lesser[lesser_count - 1] = strings[i];
+		}
+		else
+		{
+			greater_count++;
+			tmp = (char **)realloc(greater,
+				greater_count * sizeof(char *));
+			if (!tmp) {
+				free(greater);
+				free(lesser);
+				return (ARCHIVE_FATAL);
+			}
+			greater = tmp;
+			greater[greater_count - 1] = strings[i];
+		}
+	}
+
+	/* quicksort(lesser) */
+	retval1 = archive_utility_string_sort_helper(lesser, lesser_count);
+	for (i = 0; i < lesser_count; i++)
+		strings[i] = lesser[i];
+	free(lesser);
+
+	/* pivot */
+	strings[lesser_count] = pivot;
+
+	/* quicksort(greater) */
+	retval2 = archive_utility_string_sort_helper(greater, greater_count);
+	for (i = 0; i < greater_count; i++)
+		strings[lesser_count + 1 + i] = greater[i];
+	free(greater);
+
+	return (retval1 < retval2) ? retval1 : retval2;
 }
 
 int
 archive_utility_string_sort(char **strings)
 {
-  unsigned int size = 0;
-  while (strings[size] != NULL)
-    size++;
-  return archive_utility_string_sort_helper(strings, size);
+	  unsigned int size = 0;
+	  while (strings[size] != NULL)
+		size++;
+	  return archive_utility_string_sort_helper(strings, size);
 }