WIP: Add a process manager "class"

libutils/Makefile.am

@@ -63,6 +63,7 @@ libutils_la_SOURCES = \
 	platform.h condition_macros.h \
 	printsize.h \
 	proc_keyvalue.c proc_keyvalue.h \
+	proc_manager.c proc_manager.h \
 	queue.c queue.h \
 	rb-tree.c rb-tree.h \
 	refcount.c refcount.h \

libutils/array_map.c

@@ -86,6 +86,26 @@ bool ArrayMapRemove(ArrayMap *map, const void *key)
     return false;
 }
 
+bool ArrayMapRemoveSoft(ArrayMap *map, const void *key)
+{
+    assert(map != NULL);
+
+    for (int i = 0; i < map->size; ++i)
+    {
+        if (map->equal_fn(map->values[i].key, key))
+        {
+            map->destroy_key_fn(map->values[i].key);
+
+            memmove(map->values + i, map->values + i + 1,
+                    sizeof(MapKeyValue) * (map->size - i - 1));
+
+            map->size--;
+            return true;
+        }
+    }
+    return false;
+}
+
 MapKeyValue *ArrayMapGet(const ArrayMap *map, const void *key)
 {
     for (int i = 0; i < map->size; ++i)

libutils/array_map_priv.h

@@ -55,6 +55,7 @@ ArrayMap *ArrayMapNew(MapKeyEqualFn equal_fn,
 int ArrayMapInsert(ArrayMap *map, void *key, void *value);
 
 bool ArrayMapRemove(ArrayMap *map, const void *key);
+bool ArrayMapRemoveSoft(ArrayMap *map, const void *key);
 MapKeyValue *ArrayMapGet(const ArrayMap *map, const void *key);
 void ArrayMapClear(ArrayMap *map);
 void ArrayMapSoftDestroy(ArrayMap *map);

libutils/hash_map.c

@@ -172,6 +172,39 @@ bool HashMapRemove(HashMap *map, const void *key)
     return false;
 }
 
+bool HashMapRemoveSoft(HashMap *map, const void *key)
+{
+    assert(map != NULL);
+
+    unsigned bucket = HashMapGetBucket(map, key);
+
+    /*
+     * prev points to a previous "next" pointer to rewrite it in case value need
+     * to be deleted
+     */
+
+    for (BucketListItem **prev = &map->buckets[bucket];
+         *prev != NULL;
+         prev = &((*prev)->next))
+    {
+        BucketListItem *cur = *prev;
+        if (map->equal_fn(cur->value.key, key))
+        {
+            map->destroy_key_fn(cur->value.key);
+            *prev = cur->next;
+            free(cur);
+            map->load--;
+            if ((map->load < map->min_threshold) && (map->size > map->init_size))
+            {
+                HashMapResize(map, map->size >> 1);
+            }
+            return true;
+        }
+    }
+
+    return false;
+}
+
 MapKeyValue *HashMapGet(const HashMap *map, const void *key)
 {
     unsigned bucket = HashMapGetBucket(map, key);

libutils/hash_map_priv.h

@@ -63,6 +63,7 @@ HashMap *HashMapNew(MapHashFn hash_fn, MapKeyEqualFn equal_fn,
 
 bool HashMapInsert(HashMap *map, void *key, void *value);
 bool HashMapRemove(HashMap *map, const void *key);
+bool HashMapRemoveSoft(HashMap *map, const void *key);
 MapKeyValue *HashMapGet(const HashMap *map, const void *key);
 void HashMapClear(HashMap *map);
 void HashMapSoftDestroy(HashMap *map);

libutils/map.c

@@ -237,6 +237,20 @@ bool MapRemove(Map *map, const void *key)
     }
 }
 
+bool MapRemoveSoft(Map *map, const void *key)
+{
+    assert(map != NULL);
+
+    if (IsArrayMap(map))
+    {
+        return ArrayMapRemoveSoft(map->arraymap, key);
+    }
+    else
+    {
+        return HashMapRemoveSoft(map->hashmap, key);
+    }
+}
+
 void MapClear(Map *map)
 {
     assert(map != NULL);

libutils/map.h

@@ -63,6 +63,12 @@ void *MapGet(Map *map, const void *key);
  */
 bool MapRemove(Map *map, const void *key);
 
+/*
+ * Remove key/value pair from the map without destroying the value. Returns
+ * 'true' if key was present in the map.
+ */
+bool MapRemoveSoft(Map *map, const void *key);
+
 size_t MapSize(const Map *map);
 
 /*