<?xml version="1.0"?>
<?xml-stylesheet type="text/xsl" href="/source/rss.xsl.xml"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
    <title>Changes in spmc.bpf.c</title>
    <description></description>
    <language>en</language>
    <copyright>Copyright 2015</copyright>
    <generator>Java</generator><item>
        <title>57c6ace8395d53b9bae6fb21e0bd3f536342c16e - selftests/bpf: libarena: Add spmc queue data structure</title>
        <link>http://kernelsources.org:8080/source/history/linux/tools/testing/selftests/bpf/libarena/src/spmc.bpf.c#57c6ace8395d53b9bae6fb21e0bd3f536342c16e</link>
        <description>selftests/bpf: libarena: Add spmc queue data structureExpand libarena with a single producer multiple consumer deque datastructure. This is a single producer, multiple consumer lockless structurethat permits efficient work stealing. The structure is a Lev-Chase queue,so it is lock-free and wait-free.The data structure exposes three main calls. two of them are available tothe thread owning the queue and one available to all threads in the program:spmc_owner_push(): Push an item to the top of the queue.spmc_owner_pop(): Pop an item from the top of the queue.spmc_steal(): Steal a thread from the bottom of the queue fromany thread.Note that the queue is not really FIFO for all consumers, sincenon-owners of the queue can only work steal from the bottom.Signed-off-by: Emil Tsalapatis &lt;emil@etsalapatis.com&gt;Link: https://lore.kernel.org/r/20260605222020.5231-3-emil@etsalapatis.comSigned-off-by: Alexei Starovoitov &lt;ast@kernel.org&gt;

            List of files:
            /linux/tools/testing/selftests/bpf/libarena/src/spmc.bpf.c</description>
        <pubDate>Sat, 06 Jun 2026 00:20:19 +0200</pubDate>
        <dc:creator>Emil Tsalapatis &lt;emil@etsalapatis.com&gt;</dc:creator>
    </item>
</channel>
</rss>
