Re: [PATCH net-next V1 1/2] net: Header length compution function

[David Miller <davem@davemloft.net>]

From: Cong Wang <cwang@twopensource.com>
Date: Mon, 28 Jul 2014 14:26:08 -0700

> On Mon, Jul 28, 2014 at 7:50 AM, Alexander Duyck
> <alexander.h.duyck@intel.com> wrote:
>> On 07/28/2014 04:28 AM, Amir Vadai wrote:
>>> +u32 eth_frame_headlen(void *data, unsigned int len)
>>> +{
>>> +     const struct ethhdr *eth = data;
>>> +     struct sk_buff skb;
>>> +
>>> +     if (unlikely(len < ETH_HLEN))
>>> +             return len;
>>> +
>>> +     skb.protocol = eth->h_proto;
>>> +     skb.head = data + ETH_HLEN;
>>> +     skb.data = skb.head;
>>> +     skb_reset_network_header(&skb);
>>> +     skb.len = len - ETH_HLEN;
>>> +     skb.data_len = 0;
>>> +     return __skb_get_poff(&skb) + ETH_HLEN;
>>> +}
>>
>> I'm still not a big fan of allocating an sk_buff on the stack.  Seems
>> like it isn't maintainable and really opens things up to possible issues
>> if someone ever extends the __skb_get_poff call.  But I'm not going to
>> force the issue since for now this isn't impacting igb or ixgbe.
>>
> 
> +1
> 
> I think you can refactor the code to pass all these input as
> arguments instead of a whole skbuff.

I was going to say the same thing, but if you take a look it's not so
simple.

The code currently handles fragmented SKBs just fine, and you'd
therefore have to make a seperate code path for purely linear buffers,
and thus code duplication.

I'm still not sure what's better, to be honest.  Currently I'm leaning
towards allowing the version in this patch set, even though it's a bit
risky this is in the fast path so perhaps warrants such tricks for
performance's sake.