From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mails.dpdk.org (mails.dpdk.org [217.70.189.124]) by inbox.dpdk.org (Postfix) with ESMTP id 18327A00C2 for ; Thu, 17 Nov 2022 06:16:46 +0100 (CET) Received: from mails.dpdk.org (localhost [127.0.0.1]) by mails.dpdk.org (Postfix) with ESMTP id E6D9740DDC; Thu, 17 Nov 2022 06:16:45 +0100 (CET) Received: from loongson.cn (mail.loongson.cn [114.242.206.163]) by mails.dpdk.org (Postfix) with ESMTP id 5670D40DDA for ; Thu, 17 Nov 2022 06:16:44 +0100 (CET) Received: from loongson.cn (unknown [10.40.46.153]) by gateway (Coremail) with SMTP id _____8AxHLa1w3VjSS0IAA--.11543S3; Thu, 17 Nov 2022 13:16:37 +0800 (CST) Received: from localhost.localdomain (unknown [10.40.46.153]) by localhost.localdomain (Coremail) with SMTP id AQAAf8DxNle0w3VjTrYVAA--.39168S3; Thu, 17 Nov 2022 13:16:36 +0800 (CST) Received: from localhost.localdomain (localhost.localdomain [127.0.0.1]) by localhost.localdomain (8.15.2/8.15.2) with ESMTPS id 2AH5604w2190606 (version=TLSv1.3 cipher=TLS_AES_256_GCM_SHA384 bits=256 verify=NOT); Thu, 17 Nov 2022 13:06:00 +0800 Received: (from root@localhost) by localhost.localdomain (8.15.2/8.15.2/Submit) id 2AH55xMU2190605; Thu, 17 Nov 2022 13:05:59 +0800 Date: Thu, 17 Nov 2022 13:05:59 +0800 From: qemudev@loongson.cn Message-Id: <202211170505.2AH55xMU2190605@localhost.localdomain> Content-Type: text/plain; charset="utf-8" Subject: |WARNING| pw119910-119922 [PATCH v1 01/13] graph: split graph worker into common and default model In-Reply-To: <20221117050926.136974-2-zhirun.yan@intel.com> References: <20221117050926.136974-2-zhirun.yan@intel.com> To: test-report@dpdk.org Cc: Zhirun Yan X-CM-TRANSID: AQAAf8DxNle0w3VjTrYVAA--.39168S3 X-CM-SenderInfo: pthp3vthy6z05rqj20fqof0/ X-Coremail-Antispam: 1Uk129KBjvJXoWxAFyDZF17uw4xXrWUurWfKrg_yoWrWFyUpa 43Ka1SqrWDX340grn2gan2q3yIqw4DZw4UWFZ8tr1jyrs8Xrn7Ca4UJ34UXFW7W34xu34v ya17Gr1j9F17u3DanT9S1TB71UUUUUUqnTZGkaVYY2UrUUUUj1kv1TuYvTs0mT0YCTnIWj qI5I8CrVACY4xI64kE6c02F40Ex7xfYxn0WfASr-VFAUDa7-sFnT9fnUUIcSsGvfJTRUUU b0kFc2x0x2IEx4CE42xK8VAvwI8IcIk0rVWrJVCq3wA2ocxC64kIII0Yj41l84x0c7CEw4 AK67xGY2AK021l84ACjcxK6xIIjxv20xvE14v26r1j6r1xM28EF7xvwVC0I7IYx2IY6xkF 7I0E14v26r1j6r4UM28EF7xvwVC2z280aVAFwI0_Gr1j6F4UJwA2z4x0Y4vEx4A2jsIEc7 CjxVAFwI0_Cr1j6rxdM2AIxVAIcxkEcVAq07x20xvEncxIr21l57IF6xkI12xvs2x26I8E 6xACxx1l5I8CrVACY4xI64kE6c02F40Ex7xfMcIj6x8ErcxFaVAv8VWrMcvjeVCFs4IE7x kEbVWUJVW8JwAKzVCY07xG64k0F24l42xK82IYc2Ij64vIr41l42xK82IY6x8ErcxFaVAv 8VWrMxC20s026xCaFVCjc4AY6r1j6r4UMI8I3I0E5I8CrVAFwI0_Jr0_Jr4lx2IqxVCjr7 xvwVAFwI0_JrI_JrWlx4CE17CEb7AF67AKxVWUXVWUAwCIc40Y0x0EwIxGrwCI42IY6xII jxv20xvE14v26r1j6r1xMIIF0xvE2Ix0cI8IcVCY1x0267AKxVWUJVW8JwCI42IY6xAIw2 0EY4v20xvaj40_Jr0_JF4lIxAIcVC2z280aVAFwI0_Gr0_Cr1lIxAIcVC2z280aVCY1x02 67AKxVW8JVW8JrUvcSsGvfC2KfnxnUUI43ZEXa7xRENVy7UUUUU== X-BeenThere: test-report@dpdk.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: automatic DPDK test reports List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: test-report-bounces@dpdk.org Test-Label: loongarch-compilation Test-Status: WARNING http://dpdk.org/patch/119910 _apply patch failure_ Submitter: Zhirun Yan 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 #include #include #include #include #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...