[RFC V2 PATCH 22/25] net/netpolicy: fast path for finding the queues

2016-08-04 Thread kan . liang
From: Kan Liang Current implementation searches the hash table to get assigned object for each transmit/receive packet. It's not necessory, because the assigned object usually remain unchanged. This patch store the assigned queue to speed up the searching process. But under certain situations, t

[RFC V2 PATCH 22/25] net/netpolicy: fast path for finding the queues

2016-08-04 Thread kan . liang
From: Kan Liang Current implementation searches the hash table to get assigned object for each transmit/receive packet. It's not necessory, because the assigned object usually remain unchanged. This patch store the assigned queue to speed up the searching process. But under certain situations, t