* |WARNING| pw119910-119922 [PATCH v1 01/13] graph: split graph worker into common and default model
[not found] <20221117050926.136974-2-zhirun.yan@intel.com>
@ 2022-11-17 5:05 ` qemudev
2022-11-17 5:10 ` |SUCCESS| pw119910 " checkpatch
1 sibling, 0 replies; 2+ messages in thread
From: qemudev @ 2022-11-17 5:05 UTC (permalink / raw)
To: test-report; +Cc: Zhirun Yan
Test-Label: loongarch-compilation
Test-Status: WARNING
http://dpdk.org/patch/119910
_apply patch failure_
Submitter: Zhirun Yan <zhirun.yan@intel.com>
Date: Thu, 17 Nov 2022 13:09:14 +0800
DPDK git baseline: Repo:dpdk
Branch: main
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
error: lib/graph/rte_graph_worker.h: patch does not apply
Checking patch lib/graph/rte_graph_worker_common.h...
^ permalink raw reply [flat|nested] 2+ messages in thread
* |SUCCESS| pw119910 [PATCH v1 01/13] graph: split graph worker into common and default model
[not found] <20221117050926.136974-2-zhirun.yan@intel.com>
2022-11-17 5:05 ` |WARNING| pw119910-119922 [PATCH v1 01/13] graph: split graph worker into common and default model qemudev
@ 2022-11-17 5:10 ` checkpatch
1 sibling, 0 replies; 2+ messages in thread
From: checkpatch @ 2022-11-17 5:10 UTC (permalink / raw)
To: test-report
Test-Label: checkpatch
Test-Status: SUCCESS
http://dpdk.org/patch/119910
_coding style OK_
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2022-11-17 5:16 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
[not found] <20221117050926.136974-2-zhirun.yan@intel.com>
2022-11-17 5:05 ` |WARNING| pw119910-119922 [PATCH v1 01/13] graph: split graph worker into common and default model qemudev
2022-11-17 5:10 ` |SUCCESS| pw119910 " checkpatch
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).