[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-Id:
<171270962926.13694.12417499918923919527.git-patchwork-notify@kernel.org>
Date: Wed, 10 Apr 2024 00:40:29 +0000
From: patchwork-bot+netdevbpf@...nel.org
To: Kuan-Wei Chiu <visitorckw@...il.com>
Cc: toke@...e.dk, jhs@...atatu.com, xiyou.wangcong@...il.com,
jiri@...nulli.us, davem@...emloft.net, edumazet@...gle.com, kuba@...nel.org,
pabeni@...hat.com, jserv@...s.ncku.edu.tw, cake@...ts.bufferbloat.net,
netdev@...r.kernel.org, linux-kernel@...r.kernel.org
Subject: Re: [PATCH net-next v2] net: sched: cake: Optimize the number of function
calls and branches in heap construction
Hello:
This patch was applied to netdev/net-next.git (main)
by Jakub Kicinski <kuba@...nel.org>:
On Tue, 9 Apr 2024 01:47:16 +0800 you wrote:
> When constructing a heap, heapify operations are required on all
> non-leaf nodes. Thus, determining the index of the first non-leaf node
> is crucial. In a heap, the left child's index of node i is 2 * i + 1
> and the right child's index is 2 * i + 2. Node CAKE_MAX_TINS *
> CAKE_QUEUES / 2 has its left and right children at indexes
> CAKE_MAX_TINS * CAKE_QUEUES + 1 and CAKE_MAX_TINS * CAKE_QUEUES + 2,
> respectively, which are beyond the heap's range, indicating it as a
> leaf node. Conversely, node CAKE_MAX_TINS * CAKE_QUEUES / 2 - 1 has a
> left child at index CAKE_MAX_TINS * CAKE_QUEUES - 1, confirming its
> non-leaf status. The loop should start from it since it's not a leaf
> node.
>
> [...]
Here is the summary with links:
- [net-next,v2] net: sched: cake: Optimize the number of function calls and branches in heap construction
https://git.kernel.org/netdev/net-next/c/d034d02de882
You are awesome, thank you!
--
Deet-doot-dot, I am a bot.
https://korg.docs.kernel.org/patchwork/pwbot.html
Powered by blists - more mailing lists