X-Git-Url: http://git.tuebingen.mpg.de/?p=adu.git;a=blobdiff_plain;f=adu.c;h=07248e99a592e6466cb7f42abeb9d45fbeab905f;hp=3fca7a089a8d06d55f94602b3333a7ea442034cb;hb=9ca6c5e46bfbfeb6341a54703a21e25c15ef0f7e;hpb=2bf3762aeed22e4463810bc06a0dd7bf4e031190

diff --git a/adu.c b/adu.c
index 3fca7a0..07248e9 100644
--- a/adu.c
+++ b/adu.c
@@ -18,16 +18,12 @@ static int signum;
 /** Command line and config file options. */
 struct gengetopt_args_info conf;
 
-/** Global dir count. */
-uint64_t num_dirs = 0;
-/** Global files count. */
-uint64_t num_files = 0;
-/** Global bytes count. */
-uint64_t num_bytes = 0;
-
 /** The number of different uids found so far. */
 uint32_t num_uids = 0;
 
+/** This is always a power of two. It is set in create_hash_table(). */
+static uint32_t uid_hash_table_size;
+
 /**
  * Contains info for each user that owns at least one regular file.
  *
@@ -35,7 +31,17 @@ uint32_t num_uids = 0;
  * option occupy a slot in this hash table. This allows to find out
  * quicky whether a uid is admissible. And yes, this has to be fast.
  */
-struct user_info *uid_hash_table = NULL;
+static struct user_info *uid_hash_table;
+
+static inline int ui_used(struct user_info *ui)
+{
+	return ui->flags & UI_FL_SLOT_USED;
+}
+
+static inline int ui_admissible(struct user_info *ui)
+{
+	return ui->flags & UI_FL_ADMISSIBLE;
+}
 
 /**
  * The table containing the directory names and statistics.
@@ -47,8 +53,6 @@ struct osl_table *dir_table = NULL;
  */
 struct uid_range *admissible_uids;
 
-/** Evaluates to 1 if x < y, to -1 if x > y and to 0 if x == y. */
-#define NUM_COMPARE(x, y) ((int)((x) < (y)) - (int)((x) > (y)))
 
 /**
  * Compare the size of two directories
@@ -162,61 +166,6 @@ static struct osl_column_description user_table_cols[] = {
 	},
 };
 
-static int check_uid_arg(const char *arg, uint32_t *uid)
-{
-	const uint32_t max = ~0U;
-	/*
-	 * we need an 64-bit int for string -> uid conversion because strtoll()
-	 * returns a signed value.
-	 */
-	int64_t val;
-	int ret = atoi64(arg, &val);
-
-	if (ret < 0)
-		return ret;
-	if (val < 0 || val > max)
-		return -ERRNO_TO_ERROR(EINVAL);
-	*uid = val;
-	return 1;
-}
-
-static int parse_uid_range(const char *orig_arg, struct uid_range *ur)
-{
-	int ret;
-	char *arg = adu_strdup(orig_arg), *p = strchr(arg, '-');
-
-	if (!p || p == arg) { /* -42 or 42 */
-		ret = check_uid_arg(p? p + 1 : arg, &ur->high);
-		if (ret < 0)
-			goto out;
-		ur->low = p? 0 : ur->high;
-		ret = 1;
-		goto out;
-	}
-	/* 42- or 42-4711 */
-	*p = '\0';
-	p++;
-	ret = check_uid_arg(arg, &ur->low);
-	if (ret < 0)
-		goto out;
-	ur->high = ~0U;
-	if (*p) { /* 42-4711 */
-		ret = check_uid_arg(p, &ur->high);
-		if (ret < 0)
-			goto out;
-	}
-	if (ur->low > ur->high)
-		ret = -ERRNO_TO_ERROR(EINVAL);
-out:
-	if (ret < 0)
-		ERROR_LOG("bad uid option: %s\n", orig_arg);
-	else
-		INFO_LOG("admissible uid range: %u - %u\n", ur->low,
-			ur->high);
-	free(arg);
-	return ret;
-}
-
 /**
  * The log function.
  *
@@ -285,15 +234,34 @@ err:
 	return ret;
 }
 
-#define uid_hash_bits 8
-uint32_t uid_hash_table_size = 1 << uid_hash_bits;
-#define PRIME1 0x811c9dc5
+int for_each_admissible_user(int (*func)(struct user_info *, void *),
+		void *data)
+{
+	struct user_info *ui = uid_hash_table;
+
+	if (!ui)
+		return -ERRNO_TO_ERROR(EFAULT);
+
+	for (; ui < uid_hash_table + uid_hash_table_size; ui++) {
+		int ret;
+
+		if (!ui_used(ui) || !ui_admissible(ui))
+			continue;
+		ret = func(ui, data);
+		if (ret < 0)
+			return ret;
+	}
+	return 1;
+}
+
+#define PRIME1 0xb11924e1
 #define PRIME2 0x01000193
 
-void create_hash_table(void)
+void create_hash_table(unsigned bits)
 {
-	uid_hash_table = adu_calloc(uid_hash_table_size
-		* sizeof(struct user_info));
+	uid_hash_table_size = 1 << bits;
+	uid_hash_table = adu_calloc(uid_hash_table_size *
+		sizeof(struct user_info));
 }
 
 static void free_hash_table(void)
@@ -315,12 +283,10 @@ static void close_dir_table(void)
 	dir_table = NULL;
 }
 
-static void close_user_table(struct user_info *ui)
+static int close_user_table(struct user_info *ui, __a_unused void *data)
 {
 	int ret;
 
-	if (!ui || !ui_used(ui) || !ui_admissible(ui))
-		return;
 	ret = osl(osl_close_table(ui->table, OSL_MARK_CLEAN));
 	if (ret < 0)
 		ERROR_LOG("failed to close user table %u: %s\n",
@@ -335,14 +301,12 @@ static void close_user_table(struct user_info *ui)
 	ui->desc = NULL;
 	ui->table = NULL;
 	ui->flags = 0;
+	return 1;
 }
 
 static void close_user_tables(void)
 {
-	struct user_info *ui;
-
-	FOR_EACH_USER(ui)
-		close_user_table(ui);
+	for_each_admissible_user(close_user_table, NULL);
 }
 
 void close_all_tables(void)
@@ -454,6 +418,12 @@ char *get_uid_list_name(void)
 	return make_message("%s/uid_list", conf.database_dir_arg);
 }
 
+void sort_hash_table(int (*comp)(const void *, const void *))
+{
+	qsort(uid_hash_table, uid_hash_table_size, sizeof(struct user_info),
+		comp);
+}
+
 int open_dir_table(int create)
 {
 	dir_table_desc.dir = adu_strdup(conf.database_dir_arg);
@@ -525,8 +495,10 @@ int main(int argc, char **argv)
 	ret = -E_SYNTAX;
 	if (conf.select_given)
 		ret = com_select();
-	else
+	else if (conf.create_given)
 		ret = com_create();
+	else
+		ret = com_interactive();
 	if (ret < 0)
 		goto out;
 out: