* [dpdk-test-report] |FAILURE| pw39295[dpdk-dev, 2/2] eal/malloc: fix heap index to correctly insert memseg
@ 2018-05-03 10:17 sys_stv
0 siblings, 0 replies; only message in thread
From: sys_stv @ 2018-05-03 10:17 UTC (permalink / raw)
To: test-report; +Cc: xinfengx.zhao, zhaoyan.chen, peipeix.lu
[-- Attachment #1: Type: text/plain, Size: 3269 bytes --]
Test-Label: Intel-compilation
Test-Status: FAILURE
http://dpdk.org/patch/39295
_apply issues_
Submitter: Gowrishankar <gowrishankar.m@linux.vnet.ibm.com>
Date: 2018-05-03 10:11:36
DPDK git baseline:
Repo:dpdk-master, CommitID: 7baac775945ce26f4740158656965f095dc4dbda
Repo:dpdk-next-eventdev, CommitID: fcde84b5f85b3c1a5d5564299fd49c58ca20370d
Repo:dpdk-next-net, CommitID: 36decb6967e0563430a6e3ab0e2db3fe4ccc8db2
Repo:dpdk-next-crypto, CommitID: 211992f3b7df5d6d8f1dbefc48bc37a6d5398fbc
Repo:dpdk-next-virtio, CommitID: 81daf0ba4f2eb20c00975b474cb9b6ab71c44e25
*Repo: dpdk-master
Checking patch lib/librte_eal/common/malloc_heap.c...
error: while searching for:
ms->len - MALLOC_ELEM_OVERHEAD);
end_elem = RTE_PTR_ALIGN_FLOOR(end_elem, RTE_CACHE_LINE_SIZE);
const size_t elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
malloc_elem_init(start_elem, heap, ms, elem_size);
--
malloc_elem_free_list_insert(start_elem);
heap->total_size += elem_size;
}
error: patch failed: lib/librte_eal/common/malloc_heap.c:105
error: lib/librte_eal/common/malloc_heap.c: patch does not apply
*Repo: dpdk-next-eventdev
Checking patch lib/librte_eal/common/malloc_heap.c...
error: while searching for:
ms->len - MALLOC_ELEM_OVERHEAD);
end_elem = RTE_PTR_ALIGN_FLOOR(end_elem, RTE_CACHE_LINE_SIZE);
const size_t elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
malloc_elem_init(start_elem, heap, ms, elem_size);
--
malloc_elem_free_list_insert(start_elem);
heap->total_size += elem_size;
}
error: patch failed: lib/librte_eal/common/malloc_heap.c:105
error: lib/librte_eal/common/malloc_heap.c: patch does not apply
*Repo: dpdk-next-net
Checking patch lib/librte_eal/common/malloc_heap.c...
error: while searching for:
ms->len - MALLOC_ELEM_OVERHEAD);
end_elem = RTE_PTR_ALIGN_FLOOR(end_elem, RTE_CACHE_LINE_SIZE);
const size_t elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
malloc_elem_init(start_elem, heap, ms, elem_size);
--
malloc_elem_free_list_insert(start_elem);
heap->total_size += elem_size;
}
error: patch failed: lib/librte_eal/common/malloc_heap.c:105
error: lib/librte_eal/common/malloc_heap.c: patch does not apply
*Repo: dpdk-next-crypto
Checking patch lib/librte_eal/common/malloc_heap.c...
error: while searching for:
ms->len - MALLOC_ELEM_OVERHEAD);
end_elem = RTE_PTR_ALIGN_FLOOR(end_elem, RTE_CACHE_LINE_SIZE);
const size_t elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
malloc_elem_init(start_elem, heap, ms, elem_size);
--
malloc_elem_free_list_insert(start_elem);
heap->total_size += elem_size;
}
error: patch failed: lib/librte_eal/common/malloc_heap.c:105
error: lib/librte_eal/common/malloc_heap.c: patch does not apply
*Repo: dpdk-next-virtio
Checking patch lib/librte_eal/common/malloc_heap.c...
error: while searching for:
ms->len - MALLOC_ELEM_OVERHEAD);
end_elem = RTE_PTR_ALIGN_FLOOR(end_elem, RTE_CACHE_LINE_SIZE);
const size_t elem_size = (uintptr_t)end_elem - (uintptr_t)start_elem;
malloc_elem_init(start_elem, heap, ms, elem_size);
--
malloc_elem_free_list_insert(start_elem);
heap->total_size += elem_size;
}
error: patch failed: lib/librte_eal/common/malloc_heap.c:105
error: lib/librte_eal/common/malloc_heap.c: patch does not apply
DPDK STV team
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2018-05-03 10:17 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2018-05-03 10:17 [dpdk-test-report] |FAILURE| pw39295[dpdk-dev, 2/2] eal/malloc: fix heap index to correctly insert memseg sys_stv
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).