dfs:add FUSE based filesystem for DPDK

86 lines not on this page · raw message

842 lines not on this page · raw message

768 lines not on this page · raw message

53 lines not on this page · raw message

new file mode 100644
index 000000000..647eba3df
@@ -0,0 +1,25 @@
+/* SPDX-License-Identifier: BSD-3-Clause
+ * Copyright(c) 2018 Intel Corporation.
+ */
+
+#ifndef _DFS_CRYPTODEV_H_
+#define _DFS_CRYPTODEV_H_
+
+/**
+ * @file
+ * RTE DFS Cryptodev Operations
+ *
+ * These routines supply the Crypto usage support routines.
+ */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define DFS_CRYPTODEV_INFO_FILE "cryptodev-info.tmp"
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _DFS_CRYPTODEV_H_ */

323 lines not on this page · raw message

new file mode 100644
index 000000000..1b0ca9106
@@ -0,0 +1,37 @@
+/* SPDX-License-Identifier: BSD-3-Clause
+ * Copyright(c) 2018 Intel Corporation.
+ */
+
+#ifndef _DFS_DPDK_H_
+#define _DFS_DPDK_H_
+
+/**
+ * @file
+ * RTE DFS DPDK Operations
+ *
+ * These routines supply the DPDK usage support routines.
+ */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define DFS_DEBUG_FILE      "debug.tmp"
+#define DFS_HASH_FILE       "hash.tmp"
+#define DFS_DEVBIND_FILE    "devbind.tmp"
+
+#define DFS_DEVBIND_CMD     "dpdk-devbind.py"
+
+/**
+ * Initialize the DPDK support for DFS
+ *
+ * @return
+ *  -1 on error or 0 on OK
+ */
+int __rte_experimental dfs_dpdk_init(void);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _DFS_DPDK_H_ */

31 lines not on this page · raw message

102 lines not on this page · raw message

324 lines not on this page · raw message

new file mode 100644
index 000000000..76f30c1ab

Lines of this file are not shown. View the raw message.

130 lines not on this page · raw message

new file mode 100644
index 000000000..121217588

Lines of this file are not shown. View the raw message.

new file mode 100644
index 000000000..2f48d8923

Lines of this file are not shown. View the raw message.

836 lines not on this page · raw message

48 lines not on this page · raw message

54 lines not on this page · raw message

new file mode 100644
index 000000000..69edb7cf0

Lines of this file are not shown. View the raw message.

107 lines not on this page · raw message

new file mode 100644
index 000000000..4e78c1120

Lines of this file are not shown. View the raw message.

203 lines not on this page · raw message

266 lines not on this page · raw message

58 lines not on this page · raw message

new file mode 100644
index 000000000..cb9fdf38b

Lines of this file are not shown. View the raw message.

index babd3b30a..791dcc37b 100644
@@ -69,6 +69,25 @@ rte_dump_tailq(FILE *f)
 	rte_rwlock_read_unlock(&mcfg->qlock);
 }
 
+void
+rte_tailq_walk(void (*iter)(const struct rte_tailq_head *, void *), void *arg)
+{
+	struct rte_mem_config *mcfg;
+	unsigned int i = 0;
+
+	if (!iter)
+		return;
+	mcfg = rte_eal_get_configuration()->mem_config;
+
+	rte_rwlock_read_lock(&mcfg->qlock);
+	for (i = 0; i < RTE_MAX_TAILQ; i++) {
+		const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
+
+		iter(tailq, arg);
+	}
+	rte_rwlock_read_unlock(&mcfg->qlock);
+}
+
 static struct rte_tailq_head *
 rte_eal_tailq_create(const char *name)
 {

index 9b01abb2c..b9b1c6e75 100644
@@ -18,6 +18,7 @@ extern "C" {
 #include <sys/queue.h>
 #include <stdio.h>
 #include <rte_debug.h>
+#include <rte_compat.h>
 
 /** dummy structure type used by the rte_tailq APIs */
 struct rte_tailq_entry {

@@ -85,6 +86,18 @@ struct rte_tailq_elem {
  */
 void rte_dump_tailq(FILE *f);
 
+/**
+ * Walk the tailq list and call the Iterator function given.
+ *
+ * @param func
+ *   Iterator function
+ * @param arg
+ *   pointer to user supplied argument passed to Iterator function
+ */
+void __rte_experimental
+	rte_tailq_walk(void (*iter)(const struct rte_tailq_head *, void *),
+	void *arg);
+
 /**
  * Lookup for a tail queue.
  *

index d215acecc..fb5819e4b 100644
@@ -280,3 +280,23 @@ rte_ring_lookup(const char *name)
 
 	return r;
 }
+
+void
+rte_ring_walk(void (*func)(struct rte_ring *r, void *arg), void *arg)
+{
+	const struct rte_tailq_entry *te;
+	struct rte_ring_list *ring_list;
+
+	if (!func)
+		return;
+
+	ring_list = RTE_TAILQ_CAST(rte_ring_tailq.head, rte_ring_list);
+
+	rte_rwlock_read_lock(RTE_EAL_TAILQ_RWLOCK);
+
+	TAILQ_FOREACH(te, ring_list, next) {
+		func((struct rte_ring *) te->data, arg);
+	}
+
+	rte_rwlock_read_unlock(RTE_EAL_TAILQ_RWLOCK);
+}

index af5444a9f..b9391a655 100644
@@ -769,6 +769,20 @@ rte_ring_get_capacity(const struct rte_ring *r)
  */
 void rte_ring_list_dump(FILE *f);
 
+/**
+ * Walk the list of ring entries and call the function provided
+ *
+ * @param func
+ *   The function to call for each ring entry using the following prototype
+ *     void (*func)(struct rte_ring *r, void *arg)
+ * @param arg
+ *   argument for the call to function
+ * @return
+ *   None.
+ */
+void __rte_experimental
+rte_ring_walk(void (*func)(struct rte_ring *r, void *arg), void *arg);
+
 /**
  * Search a ring from its name
  *

index d215acecc..4b68c0d98 100644
@@ -280,3 +280,32 @@ rte_ring_lookup(const char *name)
 
 	return r;
 }
+
+void
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg)
+{
+	const struct rte_tailq_entry *te, *tv;
+	struct rte_ring_list *ring_list;
+
+	if (!func)
+		return;
+
+	ring_list = RTE_TAILQ_CAST(rte_ring_tailq.head, rte_ring_list);
+
+	rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
+
+	TAILQ_FOREACH_SAFE(te, ring_list, next, tv) {
+		int ret;
+
+		ret = func((struct rte_ring *) te->data, arg);
+		if (ret < 0)
+			break;
+
+		if (ret > 0) {
+			TAILQ_REMOVE(ring_list, te, next);
+			rte_free(te);
+		}
+	}
+
+	rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
+}

index af5444a9f..ed6a44773 100644
@@ -769,6 +769,23 @@ rte_ring_get_capacity(const struct rte_ring *r)
  */
 void rte_ring_list_dump(FILE *f);
 
+/**
+ * Walk the list of ring entries and call the function provided.
+ *
+ * @param func
+ *   The function to call for each ring entry using the following prototype.
+ *     If the function returns < 0 then stop walking the list.
+ *     If the function returns > 0 then remove and free the tailq entry.
+ *       and do not free the tailq entry ring pointer. Leave ring pointer
+ *       to the function to handle the ring pointer freeing.
+ *     If the function returns 0 then continue walking the list.
+ *   The RTE_EAL_TAILQ_RWLOCK write lock is taken while walking the list.
+ * @param arg
+ *   argument for the call to function.
+ */
+void __rte_experimental
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg);
+
 /**
  * Search a ring from its name
  *

index babd3b30a..99e898019 100644
@@ -69,6 +69,26 @@ rte_dump_tailq(FILE *f)
 	rte_rwlock_read_unlock(&mcfg->qlock);
 }
 
+void
+rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *), void *arg)
+{
+	struct rte_mem_config *mcfg;
+	unsigned int i = 0;
+
+	if (!iter)
+		return;
+	mcfg = rte_eal_get_configuration()->mem_config;
+
+	rte_rwlock_read_lock(&mcfg->qlock);
+	for (i = 0; i < RTE_MAX_TAILQ; i++) {
+		const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
+
+		if (iter(tailq, arg) < 0)
+			break;
+	}
+	rte_rwlock_read_unlock(&mcfg->qlock);
+}
+
 static struct rte_tailq_head *
 rte_eal_tailq_create(const char *name)
 {

index 9b01abb2c..25e99658b 100644
@@ -18,6 +18,7 @@ extern "C" {
 #include <sys/queue.h>
 #include <stdio.h>
 #include <rte_debug.h>
+#include <rte_compat.h>
 
 /** dummy structure type used by the rte_tailq APIs */
 struct rte_tailq_entry {

@@ -85,6 +86,21 @@ struct rte_tailq_elem {
  */
 void rte_dump_tailq(FILE *f);
 
+/**
+ * Walk the tailq list and call the Iterator function given.
+ *
+ * @param func
+ *   Iterator function called for each tailq list.
+ *   The rte_eal_get_configuration()->mem_config.qlock read lock is held.
+ *   If Iterator returns < 0 then break out of loop.
+ *   If Iterator returns 0 then continue looping.
+ * @param arg
+ *   pointer to user supplied argument passed to Iterator function.
+ */
+void __rte_experimental
+	rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *),
+	void *arg);
+
 /**
  * Lookup for a tail queue.
  *

index d215acecc..4b68c0d98 100644
@@ -280,3 +280,32 @@ rte_ring_lookup(const char *name)
 
 	return r;
 }
+
+void
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg)
+{
+	const struct rte_tailq_entry *te, *tv;
+	struct rte_ring_list *ring_list;
+
+	if (!func)
+		return;
+
+	ring_list = RTE_TAILQ_CAST(rte_ring_tailq.head, rte_ring_list);
+
+	rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
+
+	TAILQ_FOREACH_SAFE(te, ring_list, next, tv) {
+		int ret;
+
+		ret = func((struct rte_ring *) te->data, arg);
+		if (ret < 0)
+			break;
+
+		if (ret > 0) {
+			TAILQ_REMOVE(ring_list, te, next);
+			rte_free(te);
+		}
+	}
+
+	rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
+}

index af5444a9f..ed6a44773 100644
@@ -769,6 +769,23 @@ rte_ring_get_capacity(const struct rte_ring *r)
  */
 void rte_ring_list_dump(FILE *f);
 
+/**
+ * Walk the list of ring entries and call the function provided.
+ *
+ * @param func
+ *   The function to call for each ring entry using the following prototype.
+ *     If the function returns < 0 then stop walking the list.
+ *     If the function returns > 0 then remove and free the tailq entry.
+ *       and do not free the tailq entry ring pointer. Leave ring pointer
+ *       to the function to handle the ring pointer freeing.
+ *     If the function returns 0 then continue walking the list.
+ *   The RTE_EAL_TAILQ_RWLOCK write lock is taken while walking the list.
+ * @param arg
+ *   argument for the call to function.
+ */
+void __rte_experimental
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg);
+
 /**
  * Search a ring from its name
  *

index babd3b30a..99e898019 100644
@@ -69,6 +69,26 @@ rte_dump_tailq(FILE *f)
 	rte_rwlock_read_unlock(&mcfg->qlock);
 }
 
+void
+rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *), void *arg)
+{
+	struct rte_mem_config *mcfg;
+	unsigned int i = 0;
+
+	if (!iter)
+		return;
+	mcfg = rte_eal_get_configuration()->mem_config;
+
+	rte_rwlock_read_lock(&mcfg->qlock);
+	for (i = 0; i < RTE_MAX_TAILQ; i++) {
+		const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
+
+		if (iter(tailq, arg) < 0)
+			break;
+	}
+	rte_rwlock_read_unlock(&mcfg->qlock);
+}
+
 static struct rte_tailq_head *
 rte_eal_tailq_create(const char *name)
 {

index 9b01abb2c..25e99658b 100644
@@ -18,6 +18,7 @@ extern "C" {
 #include <sys/queue.h>
 #include <stdio.h>
 #include <rte_debug.h>
+#include <rte_compat.h>
 
 /** dummy structure type used by the rte_tailq APIs */
 struct rte_tailq_entry {

@@ -85,6 +86,21 @@ struct rte_tailq_elem {
  */
 void rte_dump_tailq(FILE *f);
 
+/**
+ * Walk the tailq list and call the Iterator function given.
+ *
+ * @param func
+ *   Iterator function called for each tailq list.
+ *   The rte_eal_get_configuration()->mem_config.qlock read lock is held.
+ *   If Iterator returns < 0 then break out of loop.
+ *   If Iterator returns 0 then continue looping.
+ * @param arg
+ *   pointer to user supplied argument passed to Iterator function.
+ */
+void __rte_experimental
+	rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *),
+	void *arg);
+
 /**
  * Lookup for a tail queue.
  *

index babd3b30a..99e898019 100644
@@ -69,6 +69,26 @@ rte_dump_tailq(FILE *f)
 	rte_rwlock_read_unlock(&mcfg->qlock);
 }
 
+void
+rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *), void *arg)
+{
+	struct rte_mem_config *mcfg;
+	unsigned int i = 0;
+
+	if (!iter)
+		return;
+	mcfg = rte_eal_get_configuration()->mem_config;
+
+	rte_rwlock_read_lock(&mcfg->qlock);
+	for (i = 0; i < RTE_MAX_TAILQ; i++) {
+		const struct rte_tailq_head *tailq = &mcfg->tailq_head[i];
+
+		if (iter(tailq, arg) < 0)
+			break;
+	}
+	rte_rwlock_read_unlock(&mcfg->qlock);
+}
+
 static struct rte_tailq_head *
 rte_eal_tailq_create(const char *name)
 {

index 9b01abb2c..25e99658b 100644
@@ -18,6 +18,7 @@ extern "C" {
 #include <sys/queue.h>
 #include <stdio.h>
 #include <rte_debug.h>
+#include <rte_compat.h>
 
 /** dummy structure type used by the rte_tailq APIs */
 struct rte_tailq_entry {

@@ -85,6 +86,21 @@ struct rte_tailq_elem {
  */
 void rte_dump_tailq(FILE *f);
 
+/**
+ * Walk the tailq list and call the Iterator function given.
+ *
+ * @param func
+ *   Iterator function called for each tailq list.
+ *   The rte_eal_get_configuration()->mem_config.qlock read lock is held.
+ *   If Iterator returns < 0 then break out of loop.
+ *   If Iterator returns 0 then continue looping.
+ * @param arg
+ *   pointer to user supplied argument passed to Iterator function.
+ */
+void __rte_experimental
+	rte_tailq_walk(int (*iter)(const struct rte_tailq_head *, void *),
+	void *arg);
+
 /**
  * Lookup for a tail queue.
  *

index d215acecc..17c9780df 100644
@@ -280,3 +280,32 @@ rte_ring_lookup(const char *name)
 
 	return r;
 }
+
+void
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg)
+{
+	const struct rte_tailq_entry *te, *tv;
+	struct rte_ring_list *ring_list;
+
+	if (!func)
+		return;
+
+	ring_list = RTE_TAILQ_CAST(rte_ring_tailq.head, rte_ring_list);
+
+	rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
+
+	TAILQ_FOREACH_SAFE(te, ring_list, next, tv) {
+		int ret;
+
+		ret = func((struct rte_ring *) te->data, arg);
+		if (ret < 0)
+			break;
+
+		if (ret > 0) {
+			TAILQ_REMOVE(ring_list, te, next);
+			rte_free((void *)(uintptr_t)te);
+		}
+	}
+
+	rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
+}

index af5444a9f..ed6a44773 100644
@@ -769,6 +769,23 @@ rte_ring_get_capacity(const struct rte_ring *r)
  */
 void rte_ring_list_dump(FILE *f);
 
+/**
+ * Walk the list of ring entries and call the function provided.
+ *
+ * @param func
+ *   The function to call for each ring entry using the following prototype.
+ *     If the function returns < 0 then stop walking the list.
+ *     If the function returns > 0 then remove and free the tailq entry.
+ *       and do not free the tailq entry ring pointer. Leave ring pointer
+ *       to the function to handle the ring pointer freeing.
+ *     If the function returns 0 then continue walking the list.
+ *   The RTE_EAL_TAILQ_RWLOCK write lock is taken while walking the list.
+ * @param arg
+ *   argument for the call to function.
+ */
+void __rte_experimental
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg);
+
 /**
  * Search a ring from its name
  *

index d215acecc..17c9780df 100644
@@ -280,3 +280,32 @@ rte_ring_lookup(const char *name)
 
 	return r;
 }
+
+void
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg)
+{
+	const struct rte_tailq_entry *te, *tv;
+	struct rte_ring_list *ring_list;
+
+	if (!func)
+		return;
+
+	ring_list = RTE_TAILQ_CAST(rte_ring_tailq.head, rte_ring_list);
+
+	rte_rwlock_write_lock(RTE_EAL_TAILQ_RWLOCK);
+
+	TAILQ_FOREACH_SAFE(te, ring_list, next, tv) {
+		int ret;
+
+		ret = func((struct rte_ring *) te->data, arg);
+		if (ret < 0)
+			break;
+
+		if (ret > 0) {
+			TAILQ_REMOVE(ring_list, te, next);
+			rte_free((void *)(uintptr_t)te);
+		}
+	}
+
+	rte_rwlock_write_unlock(RTE_EAL_TAILQ_RWLOCK);
+}

index af5444a9f..ed6a44773 100644
@@ -769,6 +769,23 @@ rte_ring_get_capacity(const struct rte_ring *r)
  */
 void rte_ring_list_dump(FILE *f);
 
+/**
+ * Walk the list of ring entries and call the function provided.
+ *
+ * @param func
+ *   The function to call for each ring entry using the following prototype.
+ *     If the function returns < 0 then stop walking the list.
+ *     If the function returns > 0 then remove and free the tailq entry.
+ *       and do not free the tailq entry ring pointer. Leave ring pointer
+ *       to the function to handle the ring pointer freeing.
+ *     If the function returns 0 then continue walking the list.
+ *   The RTE_EAL_TAILQ_RWLOCK write lock is taken while walking the list.
+ * @param arg
+ *   argument for the call to function.
+ */
+void __rte_experimental
+rte_ring_walk(int (*func)(struct rte_ring *r, void *arg), void *arg);
+
 /**
  * Search a ring from its name
  *