X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;f=datapath%2Factions.c;h=7fe2f5454b44203108e7b97c6d1a408f8b2bd972;hb=e2f3178f0582eda302bdc5629189b6a56d9fbcdd;hp=5871d823161d7da5374f3bb22df1beb0180924fd;hpb=a605908001070c27aa8c755c92cd361a10b46beb;p=sliver-openvswitch.git diff --git a/datapath/actions.c b/datapath/actions.c index 5871d8231..7fe2f5454 100644 --- a/datapath/actions.c +++ b/datapath/actions.c @@ -166,7 +166,7 @@ static void set_ip_addr(struct sk_buff *skb, struct iphdr *nh, } csum_replace4(&nh->check, *addr, new_addr); - skb_clear_rxhash(skb); + skb_clear_hash(skb); *addr = new_addr; } @@ -200,7 +200,7 @@ static void set_ipv6_addr(struct sk_buff *skb, u8 l4_proto, if (recalculate_csum) update_ipv6_checksum(skb, l4_proto, addr, new_addr); - skb_clear_rxhash(skb); + skb_clear_hash(skb); memcpy(addr, new_addr, sizeof(__be32[4])); } @@ -297,7 +297,7 @@ static void set_tp_port(struct sk_buff *skb, __be16 *port, { inet_proto_csum_replace2(check, skb, *port, new_port, 0); *port = new_port; - skb_clear_rxhash(skb); + skb_clear_hash(skb); } static void set_udp_port(struct sk_buff *skb, __be16 *port, __be16 new_port) @@ -311,7 +311,7 @@ static void set_udp_port(struct sk_buff *skb, __be16 *port, __be16 new_port) uh->check = CSUM_MANGLED_0; } else { *port = new_port; - skb_clear_rxhash(skb); + skb_clear_hash(skb); } } @@ -382,7 +382,7 @@ static int set_sctp(struct sk_buff *skb, /* Carry any checksum errors through. */ sh->checksum = old_csum ^ old_correct_csum ^ new_csum; - skb_clear_rxhash(skb); + skb_clear_hash(skb); } return 0; @@ -446,7 +446,7 @@ static int sample(struct datapath *dp, struct sk_buff *skb, a = nla_next(a, &rem)) { switch (nla_type(a)) { case OVS_SAMPLE_ATTR_PROBABILITY: - if (net_random() >= nla_get_u32(a)) + if (prandom_u32() >= nla_get_u32(a)) return 0; break; @@ -467,7 +467,7 @@ static void execute_hash(struct sk_buff *skb, const struct nlattr *attr) u32 hash = 0; /* OVS_HASH_ALG_L4 is the only possible hash algorithm. */ - hash = skb_get_rxhash(skb); + hash = skb_get_hash(skb); hash = jhash_1word(hash, hash_act->hash_basis); if (!hash) hash = 0x1; @@ -536,7 +536,7 @@ static int execute_recirc(struct datapath *dp, struct sk_buff *skb, recirc_key.ovs_flow_hash = hash; recirc_key.recirc_id = nla_get_u32(a); - ovs_dp_process_packet_with_key(skb, &recirc_key); + ovs_dp_process_packet_with_key(skb, &recirc_key, true); return 0; } @@ -631,11 +631,18 @@ static int do_execute_actions(struct datapath *dp, struct sk_buff *skb, } /* We limit the number of times that we pass into execute_actions() - * to avoid blowing out the stack in the event that we have a loop. */ -#define MAX_LOOPS 4 + * to avoid blowing out the stack in the event that we have a loop. + * + * Each loop adds some (estimated) cost to the kernel stack. + * The loop terminates when the max cost is exceeded. + * */ +#define RECIRC_STACK_COST 1 +#define DEFAULT_STACK_COST 4 +/* Allow up to 4 regular services, and up to 3 recirculations */ +#define MAX_STACK_COST (DEFAULT_STACK_COST * 4 + RECIRC_STACK_COST * 3) struct loop_counter { - u8 count; /* Count. */ + u8 stack_cost; /* loop stack cost. */ bool looping; /* Loop detected? */ }; @@ -644,22 +651,24 @@ static DEFINE_PER_CPU(struct loop_counter, loop_counters); static int loop_suppress(struct datapath *dp, struct sw_flow_actions *actions) { if (net_ratelimit()) - pr_warn("%s: flow looped %d times, dropping\n", - ovs_dp_name(dp), MAX_LOOPS); + pr_warn("%s: flow loop detected, dropping\n", + ovs_dp_name(dp)); actions->actions_len = 0; return -ELOOP; } /* Execute a list of actions against 'skb'. */ -int ovs_execute_actions(struct datapath *dp, struct sk_buff *skb) +int ovs_execute_actions(struct datapath *dp, struct sk_buff *skb, bool recirc) { struct sw_flow_actions *acts = rcu_dereference(OVS_CB(skb)->flow->sf_acts); + const u8 stack_cost = recirc ? RECIRC_STACK_COST : DEFAULT_STACK_COST; struct loop_counter *loop; int error; /* Check whether we've looped too much. */ loop = &__get_cpu_var(loop_counters); - if (unlikely(++loop->count > MAX_LOOPS)) + loop->stack_cost += stack_cost; + if (unlikely(loop->stack_cost > MAX_STACK_COST)) loop->looping = true; if (unlikely(loop->looping)) { error = loop_suppress(dp, acts); @@ -676,8 +685,9 @@ int ovs_execute_actions(struct datapath *dp, struct sk_buff *skb) error = loop_suppress(dp, acts); out_loop: - /* Decrement loop counter. */ - if (!--loop->count) + /* Decrement loop stack cost. */ + loop->stack_cost -= stack_cost; + if (!loop->stack_cost) loop->looping = false; return error;