Ingo Molnar a =E9crit :k=20 =20 Hi Ingo I took the time to prepare a patch to implement =20 arch_stack_can_recurse() as you suggested. Thank you [PATCH] x86 : arch_stack_can_recurse() introduction Some paths in kernel would like to chose between on-stack fast recursion = and explicit iterators. One identified spot is in net loopback driver, where we can avoid=20 netif_rx() and its slowdown if sufficient stack space is available. We introduce a generic arch_stack_can_recurse() which default to a weak=20 function returning 0. On x86 arch, we implement following logic : 32 bits and 4K stacks (separate irq stacks) : can use up to 25% of sta= ck 64 bits, 8K stacks (separate irq stacks) : can use up to 25% of sta= ck 32 bits and 8K stacks (no irq stacks) : can use up to 50% of sta= ck Example of use in drivers/net/loopback.c, function loopback_xmit() if (arch_stack_can_recurse()) netif_receive_skb(skb); /* immediate delivery to stack */ else netif_rx(skb); /* defer to softirq handling */ Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
| Linus Torvalds | Linux 2.6.27-rc8 |
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
| Linus Torvalds | Linux 2.6.20-rc6 |
| Mike Snitzer | Re: Distributed storage. |
git: | |
| Gerrit Renker | [PATCH 03/37] dccp: List management for new feature negotiation |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | [GIT]: Networking |
| Herbert Xu | Re: Kernel oops with 2.6.26, padlock and ipsec: probably problem with fpu state ch... |
