style: `make indent` for C

[thirdparty/dracut.git] / install / hashmap.c

diff --git a/install/hashmap.c b/install/hashmap.c
index 7e77f9a61281c3952d55e3d5ddc9be5a1cba9923..bc1196953665b9a2499bf042ffd9dd3b7d6fd8ad 100644 (file)
--- a/install/hashmap.c
+++ b/install/hashmap.c
@@ -45,35 +45,40 @@ struct Hashmap {
 
 #define BY_HASH(h) ((struct hashmap_entry**) ((uint8_t*) (h) + ALIGN(sizeof(Hashmap))))
 
-unsigned string_hash_func(const void *p) {
+unsigned string_hash_func(const void *p)
+{
         unsigned hash = 5381;
         const signed char *c;
 
         /* DJB's hash function */
 
         for (c = p; *c; c++)
-                hash = (hash << 5) + hash + (unsigned) *c;
+                hash = (hash << 5) + hash + (unsigned)*c;
 
         return hash;
 }
 
-int string_compare_func(const void *a, const void *b) {
+int string_compare_func(const void *a, const void *b)
+{
         return strcmp(a, b);
 }
 
-unsigned trivial_hash_func(const void *p) {
+unsigned trivial_hash_func(const void *p)
+{
         return PTR_TO_UINT(p);
 }
 
-int trivial_compare_func(const void *a, const void *b) {
+int trivial_compare_func(const void *a, const void *b)
+{
         return a < b ? -1 : (a > b ? 1 : 0);
 }
 
-Hashmap *hashmap_new(hash_func_t hash_func, compare_func_t compare_func) {
+Hashmap *hashmap_new(hash_func_t hash_func, compare_func_t compare_func)
+{
         Hashmap *h;
         size_t size;
 
-        size = ALIGN(sizeof(Hashmap)) + NBUCKETS * sizeof(struct hashmap_entry*);
+        size = ALIGN(sizeof(Hashmap)) + NBUCKETS * sizeof(struct hashmap_entry *);
 
         h = malloc0(size);
 
@@ -89,7 +94,8 @@ Hashmap *hashmap_new(hash_func_t hash_func, compare_func_t compare_func) {
         return h;
 }
 
-int hashmap_ensure_allocated(Hashmap **h, hash_func_t hash_func, compare_func_t compare_func) {
+int hashmap_ensure_allocated(Hashmap ** h, hash_func_t hash_func, compare_func_t compare_func)
+{
         assert(h);
 
         if (*h)
@@ -101,7 +107,8 @@ int hashmap_ensure_allocated(Hashmap **h, hash_func_t hash_func, compare_func_t
         return 0;
 }
 
-static void link_entry(Hashmap *h, struct hashmap_entry *e, unsigned hash) {
+static void link_entry(Hashmap * h, struct hashmap_entry *e, unsigned hash)
+{
         assert(h);
         assert(e);
 
@@ -128,7 +135,8 @@ static void link_entry(Hashmap *h, struct hashmap_entry *e, unsigned hash) {
         assert(h->n_entries >= 1);
 }
 
-static void unlink_entry(Hashmap *h, struct hashmap_entry *e, unsigned hash) {
+static void unlink_entry(Hashmap * h, struct hashmap_entry *e, unsigned hash)
+{
         assert(h);
         assert(e);
 
@@ -156,7 +164,8 @@ static void unlink_entry(Hashmap *h, struct hashmap_entry *e, unsigned hash) {
         h->n_entries--;
 }
 
-static void remove_entry(Hashmap *h, struct hashmap_entry **ep) {
+static void remove_entry(Hashmap * h, struct hashmap_entry **ep)
+{
         struct hashmap_entry *e = *ep;
         unsigned hash;
 
@@ -171,7 +180,8 @@ static void remove_entry(Hashmap *h, struct hashmap_entry **ep) {
         *ep = NULL;
 }
 
-void hashmap_free(Hashmap*h) {
+void hashmap_free(Hashmap * h)
+{
 
         if (!h)
                 return;
@@ -181,7 +191,8 @@ void hashmap_free(Hashmap*h) {
         free(h);
 }
 
-void hashmap_free_free(Hashmap *h) {
+void hashmap_free_free(Hashmap * h)
+{
         void *p;
 
         while ((p = hashmap_steal_first(h)))
@@ -190,7 +201,8 @@ void hashmap_free_free(Hashmap *h) {
         hashmap_free(h);
 }
 
-void hashmap_clear(Hashmap *h) {
+void hashmap_clear(Hashmap * h)
+{
         if (!h)
                 return;
 
@@ -200,7 +212,8 @@ void hashmap_clear(Hashmap *h) {
         }
 }
 
-static struct hashmap_entry *hash_scan(Hashmap *h, unsigned hash, const void *key) {
+static struct hashmap_entry *hash_scan(Hashmap * h, unsigned hash, const void *key)
+{
         struct hashmap_entry *e;
         assert(h);
         assert(hash < NBUCKETS);
@@ -212,7 +225,8 @@ static struct hashmap_entry *hash_scan(Hashmap *h, unsigned hash, const void *ke
         return NULL;
 }
 
-int hashmap_put(Hashmap *h, const void *key, void *value) {
+int hashmap_put(Hashmap * h, const void *key, void *value)
+{
         struct hashmap_entry *e;
         unsigned hash;
 
@@ -241,7 +255,8 @@ int hashmap_put(Hashmap *h, const void *key, void *value) {
         return 1;
 }
 
-int hashmap_replace(Hashmap *h, const void *key, void *value) {
+int hashmap_replace(Hashmap * h, const void *key, void *value)
+{
         struct hashmap_entry *e;
         unsigned hash;
 
@@ -258,7 +273,8 @@ int hashmap_replace(Hashmap *h, const void *key, void *value) {
         return hashmap_put(h, key, value);
 }
 
-void* hashmap_get(Hashmap *h, const void *key) {
+void *hashmap_get(Hashmap * h, const void *key)
+{
         unsigned hash;
         struct hashmap_entry *e;
 
@@ -273,7 +289,8 @@ void* hashmap_get(Hashmap *h, const void *key) {
         return e->value;
 }
 
-void* hashmap_remove(Hashmap *h, const void *key) {
+void *hashmap_remove(Hashmap * h, const void *key)
+{
         struct hashmap_entry *e;
         unsigned hash;
         void *data;
@@ -292,7 +309,8 @@ void* hashmap_remove(Hashmap *h, const void *key) {
         return data;
 }
 
-int hashmap_remove_and_put(Hashmap *h, const void *old_key, const void *new_key, void *value) {
+int hashmap_remove_and_put(Hashmap * h, const void *old_key, const void *new_key, void *value)
+{
         struct hashmap_entry *e;
         unsigned old_hash, new_hash;
 
@@ -317,7 +335,8 @@ int hashmap_remove_and_put(Hashmap *h, const void *old_key, const void *new_key,
         return 0;
 }
 
-int hashmap_remove_and_replace(Hashmap *h, const void *old_key, const void *new_key, void *value) {
+int hashmap_remove_and_replace(Hashmap * h, const void *old_key, const void *new_key, void *value)
+{
         struct hashmap_entry *e, *k;
         unsigned old_hash, new_hash;
 
@@ -344,7 +363,8 @@ int hashmap_remove_and_replace(Hashmap *h, const void *old_key, const void *new_
         return 0;
 }
 
-void* hashmap_remove_value(Hashmap *h, const void *key, void *value) {
+void *hashmap_remove_value(Hashmap * h, const void *key, void *value)
+{
         struct hashmap_entry *e;
         unsigned hash;
 
@@ -364,7 +384,8 @@ void* hashmap_remove_value(Hashmap *h, const void *key, void *value) {
         return value;
 }
 
-void *hashmap_iterate(Hashmap *h, Iterator *i, const void **key) {
+void *hashmap_iterate(Hashmap * h, Iterator * i, const void **key)
+{
         struct hashmap_entry *e;
 
         assert(i);
@@ -378,7 +399,7 @@ void *hashmap_iterate(Hashmap *h, Iterator *i, const void **key) {
         if (*i == ITERATOR_FIRST && !h->iterate_list_head)
                 goto at_end;
 
-        e = *i == ITERATOR_FIRST ? h->iterate_list_head : (struct hashmap_entry*) *i;
+        e = *i == ITERATOR_FIRST ? h->iterate_list_head : (struct hashmap_entry *)*i;
 
         if (e->iterate_next)
                 *i = (Iterator) e->iterate_next;
@@ -390,7 +411,7 @@ void *hashmap_iterate(Hashmap *h, Iterator *i, const void **key) {
 
         return e->value;
 
-at_end:
+ at_end:
         *i = ITERATOR_LAST;
 
         if (key)
@@ -399,7 +420,8 @@ at_end:
         return NULL;
 }
 
-void *hashmap_iterate_backwards(Hashmap *h, Iterator *i, const void **key) {
+void *hashmap_iterate_backwards(Hashmap * h, Iterator * i, const void **key)
+{
         struct hashmap_entry *e;
 
         assert(i);
@@ -413,7 +435,7 @@ void *hashmap_iterate_backwards(Hashmap *h, Iterator *i, const void **key) {
         if (*i == ITERATOR_LAST && !h->iterate_list_tail)
                 goto at_beginning;
 
-        e = *i == ITERATOR_LAST ? h->iterate_list_tail : (struct hashmap_entry*) *i;
+        e = *i == ITERATOR_LAST ? h->iterate_list_tail : (struct hashmap_entry *)*i;
 
         if (e->iterate_previous)
                 *i = (Iterator) e->iterate_previous;
@@ -425,7 +447,7 @@ void *hashmap_iterate_backwards(Hashmap *h, Iterator *i, const void **key) {
 
         return e->value;
 
-at_beginning:
+ at_beginning:
         *i = ITERATOR_FIRST;
 
         if (key)
@@ -434,7 +456,8 @@ at_beginning:
         return NULL;
 }
 
-void *hashmap_iterate_skip(Hashmap *h, const void *key, Iterator *i) {
+void *hashmap_iterate_skip(Hashmap * h, const void *key, Iterator * i)
+{
         unsigned hash;
         struct hashmap_entry *e;
 
@@ -451,7 +474,8 @@ void *hashmap_iterate_skip(Hashmap *h, const void *key, Iterator *i) {
         return e->value;
 }
 
-void* hashmap_first(Hashmap *h) {
+void *hashmap_first(Hashmap * h)
+{
 
         if (!h)
                 return NULL;
@@ -462,7 +486,8 @@ void* hashmap_first(Hashmap *h) {
         return h->iterate_list_head->value;
 }
 
-void* hashmap_first_key(Hashmap *h) {
+void *hashmap_first_key(Hashmap * h)
+{
 
         if (!h)
                 return NULL;
@@ -470,10 +495,11 @@ void* hashmap_first_key(Hashmap *h) {
         if (!h->iterate_list_head)
                 return NULL;
 
-        return (void*) h->iterate_list_head->key;
+        return (void *)h->iterate_list_head->key;
 }
 
-void* hashmap_last(Hashmap *h) {
+void *hashmap_last(Hashmap * h)
+{
 
         if (!h)
                 return NULL;
@@ -484,7 +510,8 @@ void* hashmap_last(Hashmap *h) {
         return h->iterate_list_tail->value;
 }
 
-void* hashmap_steal_first(Hashmap *h) {
+void *hashmap_steal_first(Hashmap * h)
+{
         struct hashmap_entry *e;
         void *data;
 
@@ -501,7 +528,8 @@ void* hashmap_steal_first(Hashmap *h) {
         return data;
 }
 
-void* hashmap_steal_first_key(Hashmap *h) {
+void *hashmap_steal_first_key(Hashmap * h)
+{
         struct hashmap_entry *e;
         void *key;
 
@@ -512,13 +540,14 @@ void* hashmap_steal_first_key(Hashmap *h) {
                 return NULL;
 
         e = h->iterate_list_head;
-        key = (void*) e->key;
+        key = (void *)e->key;
         remove_entry(h, &e);
 
         return key;
 }
 
-unsigned hashmap_size(Hashmap *h) {
+unsigned hashmap_size(Hashmap * h)
+{
 
         if (!h)
                 return 0;
@@ -526,7 +555,8 @@ unsigned hashmap_size(Hashmap *h) {
         return h->n_entries;
 }
 
-bool hashmap_isempty(Hashmap *h) {
+bool hashmap_isempty(Hashmap * h)
+{
 
         if (!h)
                 return true;
@@ -534,7 +564,8 @@ bool hashmap_isempty(Hashmap *h) {
         return h->n_entries == 0;
 }
 
-int hashmap_merge(Hashmap *h, Hashmap *other) {
+int hashmap_merge(Hashmap * h, Hashmap * other)
+{
         struct hashmap_entry *e;
 
         assert(h);
@@ -553,7 +584,8 @@ int hashmap_merge(Hashmap *h, Hashmap *other) {
         return 0;
 }
 
-void hashmap_move(Hashmap *h, Hashmap *other) {
+void hashmap_move(Hashmap * h, Hashmap * other)
+{
         struct hashmap_entry *e, *n;
 
         assert(h);
@@ -581,7 +613,8 @@ void hashmap_move(Hashmap *h, Hashmap *other) {
         }
 }
 
-int hashmap_move_one(Hashmap *h, Hashmap *other, const void *key) {
+int hashmap_move_one(Hashmap * h, Hashmap * other, const void *key)
+{
         unsigned h_hash, other_hash;
         struct hashmap_entry *e;
 
@@ -604,19 +637,20 @@ int hashmap_move_one(Hashmap *h, Hashmap *other, const void *key) {
         return 0;
 }
 
-char **hashmap_get_strv(Hashmap *h) {
+char **hashmap_get_strv(Hashmap * h)
+{
         char **sv;
         Iterator it;
         char *item;
         int n;
 
-        sv = new(char*, h->n_entries+1);
+        sv = new(char *, h->n_entries + 1);
         if (!sv)
                 return NULL;
 
         n = 0;
         HASHMAP_FOREACH(item, h, it)
-                sv[n++] = item;
+            sv[n++] = item;
         sv[n] = NULL;
 
         return sv;