mirror of
https://github.com/BobTheBlinker/android_kernel_motorola_sm6375.git
synced 2026-10-28 02:32:09 -04:00
[INET]: Consolidate xxx_frag_intern
This routine checks for the existence of a given entry in the hash table and inserts the new one if needed. The ->equal callback is used to compare two frag_queue-s together, but this one is temporary and will be removed later. The netfilter code and the ipv6 one use the same routine to compare frags. The inet_frag_intern() always returns non-NULL pointer, so convert the inet_frag_queue into protocol specific one (with the container_of) without any checks. Signed-off-by: Pavel Emelyanov <[email protected]> Signed-off-by: David S. Miller <[email protected]>
This commit is contained in:
parent
fd9e63544c
commit
2588fe1d78
6 changed files with 82 additions and 96 deletions
|
|
@ -41,6 +41,8 @@ struct inet_frags {
|
|||
unsigned int (*hashfn)(struct inet_frag_queue *);
|
||||
void (*destructor)(struct inet_frag_queue *);
|
||||
void (*skb_free)(struct sk_buff *);
|
||||
int (*equal)(struct inet_frag_queue *q1,
|
||||
struct inet_frag_queue *q2);
|
||||
};
|
||||
|
||||
void inet_frags_init(struct inet_frags *);
|
||||
|
|
@ -50,6 +52,8 @@ void inet_frag_kill(struct inet_frag_queue *q, struct inet_frags *f);
|
|||
void inet_frag_destroy(struct inet_frag_queue *q,
|
||||
struct inet_frags *f, int *work);
|
||||
int inet_frag_evictor(struct inet_frags *f);
|
||||
struct inet_frag_queue *inet_frag_intern(struct inet_frag_queue *q,
|
||||
struct inet_frags *f, unsigned int hash);
|
||||
|
||||
static inline void inet_frag_put(struct inet_frag_queue *q, struct inet_frags *f)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -377,6 +377,9 @@ static inline int ipv6_prefix_equal(const struct in6_addr *a1,
|
|||
prefixlen);
|
||||
}
|
||||
|
||||
struct inet_frag_queue;
|
||||
int ip6_frag_equal(struct inet_frag_queue *q1, struct inet_frag_queue *q2);
|
||||
|
||||
static inline int ipv6_addr_any(const struct in6_addr *a)
|
||||
{
|
||||
return ((a->s6_addr32[0] | a->s6_addr32[1] |
|
||||
|
|
|
|||
Loading…
Reference in a new issue