* |WARNING| pw133872 [RFC] mempool: CPU cache aligning mempool driver accesses
[not found] <98CBD80474FA8B44BF855DF32C47DC35E9EFD4@smartserver.smartshare.dk>
@ 2023-11-04 17:10 ` qemudev
0 siblings, 0 replies; only message in thread
From: qemudev @ 2023-11-04 17:10 UTC (permalink / raw)
To: test-report; +Cc: Morten Brørup, zhoumin
Test-Label: loongarch-compilation
Test-Status: WARNING
http://dpdk.org/patch/133872
_apply patch failure_
Submitter: Morten Brørup <mb@smartsharesystems.com>
Date: Sat, 4 Nov 2023 18:29:40 +0100
DPDK git baseline: Repo:dpdk
Branch: main
CommitID: 34c0c38ab772e8eea5243f530866d5b68519e7c7
Apply patch set 133872 failed:
Checking patch lib/mempool/rte_mempool.c...
error: while searching for:
mempool_event_callback_invoke(enum rte_mempool_event event,
struct rte_mempool *mp);
#define CACHE_FLUSHTHRESH_MULTIPLIER 1.5
#define CALC_CACHE_FLUSHTHRESH(c) \
((typeof(c))((c) * CACHE_FLUSHTHRESH_MULTIPLIER))
error: patch failed: lib/mempool/rte_mempool.c:48
error: lib/mempool/rte_mempool.c: patch does not apply
Checking patch lib/mempool/rte_mempool.h...
error: while searching for:
RTE_MEMPOOL_CACHE_STAT_ADD(cache, put_objs, n);
/* The request itself is too big for the cache */
if (unlikely(n > cache->flushthresh))
goto driver_enqueue_stats_incremented;
/*
* The cache follows the following algorithm:
* 1. If the objects cannot be added to the cache without crossing
* the flush threshold, flush the cache to the backend.
* 2. Add the objects to the cache.
*/
if (cache->len + n <= cache->flushthresh) {
cache_objs = &cache->objs[cache->len];
cache->len += n;
} else {
cache_objs = &cache->objs[0];
rte_mempool_ops_enqueue_bulk(mp, cache_objs, cache->len);
cache->len = n;
}
/* Add the objects to the cache. */
rte_memcpy(cache_objs, obj_table, sizeof(void *) * n);
error: patch failed: lib/mempool/rte_mempool.h:1373
error: lib/mempool/rte_mempool.h: patch does not apply
Checking patch lib/ring/rte_ring_elem_pvt.h...
error: while searching for:
uint32_t *ring = (uint32_t *)&r[1];
const uint32_t *obj = (const uint32_t *)obj_table;
if (likely(idx + n <= size)) {
for (i = 0; i < (n & ~0x7); i += 8, idx += 8) {
ring[idx] = obj[i];
ring[idx + 1] = obj[i + 1];
error: patch failed: lib/ring/rte_ring_elem_pvt.h:24
error: lib/ring/rte_ring_elem_pvt.h: patch does not apply
^ permalink raw reply [flat|nested] only message in thread