graph: remove useless duplicate name check

[dpdk.git] / lib / graph / node.c

diff --git a/lib/graph/node.c b/lib/graph/node.c
index 873c9ab..ae6eadb 100644 (file)
--- a/lib/graph/node.c
+++ b/lib/graph/node.c
@@ -8,7 +8,6 @@
 
 #include <rte_common.h>
 #include <rte_debug.h>
-#include <rte_eal.h>
 #include <rte_errno.h>
 #include <rte_string_fns.h>
 
@@ -86,10 +85,8 @@ __rte_node_register(const struct rte_node_register *reg)
        }
 
        /* Initialize the node */
-       if (rte_strscpy(node->name, reg->name, RTE_NODE_NAMESIZE) < 0) {
-               rte_errno = E2BIG;
+       if (rte_strscpy(node->name, reg->name, RTE_NODE_NAMESIZE) < 0)
                goto free;
-       }
        node->flags = reg->flags;
        node->process = reg->process;
        node->init = reg->init;
@@ -98,10 +95,8 @@ __rte_node_register(const struct rte_node_register *reg)
        node->parent_id = reg->parent_id;
        for (i = 0; i < reg->nb_edges; i++) {
                if (rte_strscpy(node->next_nodes[i], reg->next_nodes[i],
-                               RTE_NODE_NAMESIZE) < 0) {
-                       rte_errno = E2BIG;
+                               RTE_NODE_NAMESIZE) < 0)
                        goto free;
-               }
        }
 
        node->id = node_id++;
@@ -155,10 +150,6 @@ node_clone(struct node *node, const char *name)
                goto fail;
        }
 
-       /* Check for duplicate name */
-       if (node_has_duplicate_entry(name))
-               goto fail;
-
        reg = calloc(1, sizeof(*reg) + (sizeof(char *) * node->nb_edges));
        if (reg == NULL) {
                rte_errno = ENOMEM;
@@ -278,10 +269,8 @@ edge_update(struct node *node, struct node *prev, rte_edge_t from,
        /* Update the new nodes name */
        for (i = from; i < max_edges; i++, count++) {
                if (rte_strscpy(node->next_nodes[i], next_nodes[count],
-                               RTE_NODE_NAMESIZE) < 0) {
-                       rte_errno = E2BIG;
+                               RTE_NODE_NAMESIZE) < 0)
                        goto restore;
-               }
        }
 restore:
        /* Update the linked list to point new node address in prev node */