ipcpd: normal: Create policies for GAM

This allows the selection of a policy for the graph adjacency
manager. Currently we only support constructing a complete graph.

1 files changed, 208 insertions, 0 deletions

diff --git a/src/ipcpd/normal/pol/complete.c b/src/ipcpd/normal/pol/complete.c
new file mode 100644
index 00000000..89e1b91f
--- /dev/null
+++ b/src/ipcpd/normal/pol/complete.c
@@ -0,0 +1,208 @@
+/*
+ * Ouroboros - Copyright (C) 2016 - 2017
+ *
+ * Graph adjacency manager for IPC Process components
+ *
+ *    Dimitri Staessens <[email protected]>
+ *    Sander Vrijders   <[email protected]>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2 as
+ * published by the Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ */
+
+#define OUROBOROS_PREFIX "complete-graph-adjacency-manager"
+
+#include <ouroboros/config.h>
+#include <ouroboros/logs.h>
+#include <ouroboros/list.h>
+#include <ouroboros/qos.h>
+
+#include "pathname.h"
+#include "ro.h"
+#include "ipcp.h"
+#include "gam.h"
+
+#include <string.h>
+#include <stdlib.h>
+
+#define RO_DIR "neighbors"
+
+struct neighbor {
+        struct list_head next;
+        char *           neighbor;
+};
+
+struct complete {
+        struct list_head neighbors;
+        pthread_mutex_t  neighbors_lock;
+
+        pthread_t        allocator;
+
+        struct gam *     gam;
+};
+
+static void * allocator(void * o)
+{
+        qosspec_t         qs;
+        ssize_t           len;
+        char **           children;
+        int               i;
+        char *            ro_name;
+        struct complete * complete = (struct complete *) o;
+
+        qs.delay = 0;
+        qs.jitter = 0;
+
+        ro_name = pathname_create(RO_DIR);
+        if (ro_name == NULL)
+                return (void *) -1;
+
+        len = ro_children(ro_name, &children);
+        if (len > 0) {
+                for (i = 0; i < len; i++) {
+                        if (strcmp(children[i], ipcpi.name) == 0)
+                                continue;
+                        gam_flow_alloc(complete->gam, children[i], qs);
+                }
+        }
+
+        pathname_destroy(ro_name);
+
+        return (void *) 0;
+}
+
+void * complete_create(struct gam * gam)
+{
+        struct ro_attr    attr;
+        char *            ro_name;
+        struct complete * complete;
+
+        ro_attr_init(&attr);
+        attr.enrol_sync = true;
+        attr.recv_set = ALL_MEMBERS;
+
+        complete = malloc(sizeof(*complete));
+        if (complete == NULL)
+                return NULL;
+
+        ro_name = pathname_create(RO_DIR);
+        if (ro_name == NULL) {
+                free(complete);
+                return NULL;
+        }
+
+        if (!ro_exists(RO_DIR)) {
+                if (ro_create(ro_name, &attr, NULL, 0)) {
+                        free(complete);
+                        pathname_destroy(ro_name);
+                        return NULL;
+                }
+        }
+
+        ro_name = pathname_append(ro_name, ipcpi.name);
+        if (ro_name == NULL) {
+                free(complete);
+                pathname_destroy(ro_name);
+                return NULL;
+        }
+
+        if (ro_create(ro_name, &attr, NULL, 0)) {
+                free(complete);
+                pathname_destroy(ro_name);
+                return NULL;
+        }
+        pathname_destroy(ro_name);
+
+        list_head_init(&complete->neighbors);
+        complete->gam = gam;
+
+        if (pthread_mutex_init(&complete->neighbors_lock, NULL)) {
+                free(complete);
+                return NULL;
+        }
+
+        if (pthread_create(&complete->allocator, NULL,
+                           allocator, (void *) complete)) {
+                free(complete);
+                pthread_mutex_destroy(&complete->neighbors_lock);
+                return NULL;
+        }
+
+        return (void *) complete;
+}
+
+void complete_destroy(void * o)
+{
+        struct list_head * p = NULL;
+        struct list_head * n = NULL;
+        struct complete * complete = (struct complete *) o;
+
+        pthread_cancel(complete->allocator);
+        pthread_join(complete->allocator, NULL);
+
+        list_for_each_safe(p, n, &complete->neighbors) {
+                struct neighbor * e = list_entry(p, struct neighbor, next);
+                list_del(&e->next);
+                free(e->neighbor);
+                free(e);
+        }
+}
+
+int complete_accept_new_flow(void * o)
+{
+        (void) o;
+
+        return 0;
+}
+
+int complete_accept_flow(void *                    o,
+                         qosspec_t                 qs,
+                         const struct cacep_info * info)
+{
+        struct list_head * pos = NULL;
+        struct neighbor * n;
+        struct complete * complete = (struct complete *) o;
+
+        (void) qs;
+
+        pthread_mutex_lock(&complete->neighbors_lock);
+
+        list_for_each(pos, &complete->neighbors) {
+                struct neighbor * e = list_entry(pos, struct neighbor, next);
+                if (strcmp(e->neighbor, info->name) == 0) {
+                        pthread_mutex_unlock(&complete->neighbors_lock);
+                        return -1;
+                }
+        }
+
+        n = malloc(sizeof(*n));
+        if (n == NULL) {
+                pthread_mutex_unlock(&complete->neighbors_lock);
+                return -1;
+        }
+
+        list_head_init(&n->next);
+
+        n->neighbor = strdup(info->name);
+        if (n->neighbor == NULL) {
+                pthread_mutex_unlock(&complete->neighbors_lock);
+                free(n);
+                return -1;
+        }
+
+        list_add(&n->next, &complete->neighbors);
+
+        pthread_mutex_unlock(&complete->neighbors_lock);
+
+        return 0;
+}