* |WARNING| pw119910-119922 [PATCH] [v1, 13/13] examples/l3fwd-graph: introduce generic worker model
@ 2022-11-17 5:28 dpdklab
0 siblings, 0 replies; only message in thread
From: dpdklab @ 2022-11-17 5:28 UTC (permalink / raw)
To: test-report; +Cc: dpdk-test-reports
[-- Attachment #1: Type: text/plain, Size: 11731 bytes --]
Test-Label: iol-testing
Test-Status: WARNING
http://dpdk.org/patch/119910
_apply patch failure_
Submitter: Zhirun Yan <zhirun.yan@intel.com>
Date: Thursday, November 17 2022 05:09:26
Applied on: CommitID:903ec2b1b49e496815c016b0104fd655cd972661
Apply patch set 119910-119922 failed:
Checking patch lib/graph/rte_graph_model_rtc.h...
Checking patch lib/graph/rte_graph_worker.h...
error: while searching for:
/* SPDX-License-Identifier: BSD-3-Clause
* Copyright(C) 2020 Marvell International Ltd.
*/
#ifndef _RTE_GRAPH_WORKER_H_
#define _RTE_GRAPH_WORKER_H_
/**
* @file rte_graph_worker.h
*
* @warning
* @b EXPERIMENTAL:
* All functions in this file may be changed or removed without prior notice.
*
* This API allows a worker thread to walk over a graph and nodes to create,
* process, enqueue and move streams of objects to the next nodes.
*/
#include <rte_common.h>
#include <rte_cycles.h>
#include <rte_prefetch.h>
#include <rte_memcpy.h>
#include <rte_memory.h>
#include "rte_graph.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* @internal
*
* Data structure to hold graph data.
*/
struct rte_graph {
uint32_t tail; /**< Tail of circular buffer. */
uint32_t head; /**< Head of circular buffer. */
uint32_t cir_mask; /**< Circular buffer wrap around mask. */
rte_node_t nb_nodes; /**< Number of nodes in the graph. */
rte_graph_off_t *cir_start; /**< Pointer to circular buffer. */
rte_graph_off_t nodes_start; /**< Offset at which node memory starts. */
rte_graph_t id; /**< Graph identifier. */
int socket; /**< Socket ID where memory is allocated. */
char name[RTE_GRAPH_NAMESIZE]; /**< Name of the graph. */
uint64_t fence; /**< Fence. */
} __rte_cache_aligned;
/**
* @internal
*
* Data structure to hold node data.
*/
struct rte_node {
/* Slow path area */
uint64_t fence; /**< Fence. */
rte_graph_off_t next; /**< Index to next node. */
rte_node_t id; /**< Node identifier. */
rte_node_t parent_id; /**< Parent Node identifier. */
rte_edge_t nb_edges; /**< Number of edges from this node. */
uint32_t realloc_count; /**< Number of times realloced. */
char parent[RTE_NODE_NAMESIZE]; /**< Parent node name. */
char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
/* Fast path area */
#define RTE_NODE_CTX_SZ 16
uint8_t ctx[RTE_NODE_CTX_SZ] __rte_cache_aligned; /**< Node Context. */
uint16_t size; /**< Total number of objects available. */
uint16_t idx; /**< Number of objects used. */
rte_graph_off_t off; /**< Offset of node in the graph reel. */
uint64_t total_cycles; /**< Cycles spent in this node. */
uint64_t total_calls; /**< Calls done to this node. */
uint64_t total_objs; /**< Objects processed by this node. */
RTE_STD_C11
union {
void **objs; /**< Array of object pointers. */
uint64_t objs_u64;
};
RTE_STD_C11
union {
rte_node_process_t process; /**< Process function. */
uint64_t process_u64;
};
struct rte_node *nodes[] __rte_cache_min_aligned; /**< Next nodes. */
} __rte_cache_aligned;
/**
* @internal
*
* Allocate a stream of objects.
*
* If stream already exists then re-allocate it to a larger size.
*
* @param graph
* Pointer to the graph object.
* @param node
* Pointer to the node object.
*/
__rte_experimental
void __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node);
/**
* @internal
*
* Allocate a stream with requested number of objects.
*
* If stream already exists then re-allocate it to a larger size.
*
* @param graph
* Pointer to the graph object.
* @param node
* Pointer to the node object.
* @param req_size
* Number of objects to be allocated.
*/
__rte_experimental
void __rte_node_stream_alloc_size(struct rte_graph *graph,
struct rte_node *node, uint16_t req_size);
/**
* Perform graph walk on the circular buffer and invoke the process function
error: patch failed: lib/graph/rte_graph_worker.h:1
Hunk #2 succeeded at 132 (offset 119 lines).
Checking patch lib/graph/rte_graph_worker_common.h...
Applied patch lib/graph/rte_graph_model_rtc.h cleanly.
Applying patch lib/graph/rte_graph_worker.h with 1 reject...
Rejected hunk #1.
Hunk #2 applied cleanly.
Applied patch lib/graph/rte_graph_worker_common.h cleanly.
diff a/lib/graph/rte_graph_worker.h b/lib/graph/rte_graph_worker.h (rejected hunks)
@@ -1,122 +1,4 @@
-/* SPDX-License-Identifier: BSD-3-Clause
- * Copyright(C) 2020 Marvell International Ltd.
- */
-
-#ifndef _RTE_GRAPH_WORKER_H_
-#define _RTE_GRAPH_WORKER_H_
-
-/**
- * @file rte_graph_worker.h
- *
- * @warning
- * @b EXPERIMENTAL:
- * All functions in this file may be changed or removed without prior notice.
- *
- * This API allows a worker thread to walk over a graph and nodes to create,
- * process, enqueue and move streams of objects to the next nodes.
- */
-
-#include <rte_common.h>
-#include <rte_cycles.h>
-#include <rte_prefetch.h>
-#include <rte_memcpy.h>
-#include <rte_memory.h>
-
-#include "rte_graph.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * @internal
- *
- * Data structure to hold graph data.
- */
-struct rte_graph {
- uint32_t tail; /**< Tail of circular buffer. */
- uint32_t head; /**< Head of circular buffer. */
- uint32_t cir_mask; /**< Circular buffer wrap around mask. */
- rte_node_t nb_nodes; /**< Number of nodes in the graph. */
- rte_graph_off_t *cir_start; /**< Pointer to circular buffer. */
- rte_graph_off_t nodes_start; /**< Offset at which node memory starts. */
- rte_graph_t id; /**< Graph identifier. */
- int socket; /**< Socket ID where memory is allocated. */
- char name[RTE_GRAPH_NAMESIZE]; /**< Name of the graph. */
- uint64_t fence; /**< Fence. */
-} __rte_cache_aligned;
-
-/**
- * @internal
- *
- * Data structure to hold node data.
- */
-struct rte_node {
- /* Slow path area */
- uint64_t fence; /**< Fence. */
- rte_graph_off_t next; /**< Index to next node. */
- rte_node_t id; /**< Node identifier. */
- rte_node_t parent_id; /**< Parent Node identifier. */
- rte_edge_t nb_edges; /**< Number of edges from this node. */
- uint32_t realloc_count; /**< Number of times realloced. */
-
- char parent[RTE_NODE_NAMESIZE]; /**< Parent node name. */
- char name[RTE_NODE_NAMESIZE]; /**< Name of the node. */
-
- /* Fast path area */
-#define RTE_NODE_CTX_SZ 16
- uint8_t ctx[RTE_NODE_CTX_SZ] __rte_cache_aligned; /**< Node Context. */
- uint16_t size; /**< Total number of objects available. */
- uint16_t idx; /**< Number of objects used. */
- rte_graph_off_t off; /**< Offset of node in the graph reel. */
- uint64_t total_cycles; /**< Cycles spent in this node. */
- uint64_t total_calls; /**< Calls done to this node. */
- uint64_t total_objs; /**< Objects processed by this node. */
- RTE_STD_C11
- union {
- void **objs; /**< Array of object pointers. */
- uint64_t objs_u64;
- };
- RTE_STD_C11
- union {
- rte_node_process_t process; /**< Process function. */
- uint64_t process_u64;
- };
- struct rte_node *nodes[] __rte_cache_min_aligned; /**< Next nodes. */
-} __rte_cache_aligned;
-
-/**
- * @internal
- *
- * Allocate a stream of objects.
- *
- * If stream already exists then re-allocate it to a larger size.
- *
- * @param graph
- * Pointer to the graph object.
- * @param node
- * Pointer to the node object.
- */
-__rte_experimental
-void __rte_node_stream_alloc(struct rte_graph *graph, struct rte_node *node);
-
-/**
- * @internal
- *
- * Allocate a stream with requested number of objects.
- *
- * If stream already exists then re-allocate it to a larger size.
- *
- * @param graph
- * Pointer to the graph object.
- * @param node
- * Pointer to the node object.
- * @param req_size
- * Number of objects to be allocated.
- */
-__rte_experimental
-void __rte_node_stream_alloc_size(struct rte_graph *graph,
- struct rte_node *node, uint16_t req_size);
+#include "rte_graph_model_rtc.h"
/**
* Perform graph walk on the circular buffer and invoke the process function
Checking patch lib/graph/rte_graph_model_rtc.h...
error: lib/graph/rte_graph_model_rtc.h: does not exist in index
Checking patch lib/graph/rte_graph_worker_common.h...
error: lib/graph/rte_graph_worker_common.h: does not exist in index
Checking patch lib/graph/rte_graph_model_rtc.h...
error: lib/graph/rte_graph_model_rtc.h: does not exist in index
Checking patch lib/graph/rte_graph_worker_common.h...
error: lib/graph/rte_graph_worker_common.h: does not exist in index
Checking patch lib/graph/rte_graph_worker.h...
error: lib/graph/rte_graph_worker.h: does not match index
Checking patch lib/graph/rte_graph_worker_common.h...
error: lib/graph/rte_graph_worker_common.h: does not exist in index
Checking patch lib/graph/version.map...
Applied patch lib/graph/version.map cleanly.
Checking patch lib/graph/graph_private.h...
Checking patch lib/graph/meson.build...
Checking patch lib/graph/node.c...
Checking patch lib/graph/rte_graph_model_generic.c...
.git/rebase-apply/patch:84: new blank line at EOF.
+
Checking patch lib/graph/rte_graph_model_generic.h...
Checking patch lib/graph/version.map...
error: lib/graph/version.map: does not match index
Applied patch lib/graph/graph_private.h cleanly.
Applied patch lib/graph/meson.build cleanly.
Applied patch lib/graph/node.c cleanly.
Applied patch lib/graph/rte_graph_model_generic.c cleanly.
Applied patch lib/graph/rte_graph_model_generic.h cleanly.
Checking patch lib/graph/graph.c...
Checking patch lib/graph/graph_private.h...
error: lib/graph/graph_private.h: does not match index
Checking patch lib/graph/rte_graph.h...
Checking patch lib/graph/version.map...
error: lib/graph/version.map: does not match index
Applied patch lib/graph/graph.c cleanly.
Applied patch lib/graph/rte_graph.h cleanly.
Checking patch lib/graph/graph.c...
error: lib/graph/graph.c: does not match index
Checking patch lib/graph/graph_private.h...
error: lib/graph/graph_private.h: does not match index
Checking patch lib/graph/rte_graph.h...
error: lib/graph/rte_graph.h: does not match index
Checking patch lib/graph/version.map...
error: lib/graph/version.map: does not match index
Checking patch lib/graph/graph.c...
error: lib/graph/graph.c: does not match index
Checking patch lib/graph/graph_populate.c...
Checking patch lib/graph/graph_private.h...
error: lib/graph/graph_private.h: does not match index
Checking patch lib/graph/meson.build...
error: lib/graph/meson.build: does not match index
Checking patch lib/graph/rte_graph_model_generic.c...
error: lib/graph/rte_graph_model_generic.c: does not exist in index
Checking patch lib/graph/rte_graph_model_generic.h...
error: lib/graph/rte_graph_model_generic.h: does not exist in index
Checking patch lib/graph/rte_graph_worker_common.h...
error: lib/graph/rte_graph_worker_common.h: does not exist in index
Applied patch lib/graph/graph_populate.c cleanly.
Checking patch lib/graph/graph.c...
error: lib/graph/graph.c: does not match index
Checking patch lib/graph/rte_graph_model_generic.h...
error: lib/graph/rte_graph_model_generic.h: does not exist in index
Checking patch lib/graph/rte_graph_worker.h...
error: lib/graph/rte_graph_worker.h: does not match index
Checking patch lib/graph/graph_debug.c...
Checking patch lib/graph/graph_stats.c...
Checking patch lib/graph/rte_graph.h...
error: lib/graph/rte_graph.h: does not match index
Checking patch lib/graph/rte_graph_model_generic.c...
error: lib/graph/rte_graph_model_generic.c: does not exist in index
Checking patch lib/graph/rte_graph_worker_common.h...
error: lib/graph/rte_graph_worker_common.h: does not exist in index
Applied patch lib/graph/graph_debug.c cleanly.
Applied patch lib/graph/graph_stats.c cleanly.
https://lab.dpdk.org/results/dashboard/patchsets/24501/
UNH-IOL DPDK Community Lab
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2022-11-17 5:28 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2022-11-17 5:28 |WARNING| pw119910-119922 [PATCH] [v1, 13/13] examples/l3fwd-graph: introduce generic worker model dpdklab
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).