1 /* Copyright (c) 2009, 2010, 2011, 2012, 2013 Nicira, Inc.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License. */
16 #include "ofproto-dpif-upcall.h"
23 #include "dynamic-string.h"
25 #include "fail-open.h"
26 #include "guarded-list.h"
32 #include "ofproto-dpif-ipfix.h"
33 #include "ofproto-dpif-sflow.h"
35 #include "poll-loop.h"
38 #define MAX_QUEUE_LENGTH 512
40 VLOG_DEFINE_THIS_MODULE(ofproto_dpif_upcall);
42 COVERAGE_DEFINE(drop_queue_overflow);
43 COVERAGE_DEFINE(upcall_queue_overflow);
44 COVERAGE_DEFINE(fmb_queue_overflow);
45 COVERAGE_DEFINE(fmb_queue_revalidated);
47 /* A thread that processes each upcall handed to it by the dispatcher thread,
48 * forwards the upcall's packet, and then queues it to the main ofproto_dpif
49 * to possibly set up a kernel flow as a cache. */
51 struct udpif *udpif; /* Parent udpif. */
52 pthread_t thread; /* Thread ID. */
54 struct ovs_mutex mutex; /* Mutex guarding the following. */
56 /* Atomic queue of unprocessed upcalls. */
57 struct list upcalls OVS_GUARDED;
58 size_t n_upcalls OVS_GUARDED;
60 size_t n_new_upcalls; /* Only changed by the dispatcher. */
61 bool need_signal; /* Only changed by the dispatcher. */
63 pthread_cond_t wake_cond; /* Wakes 'thread' while holding
67 /* An upcall handler for ofproto_dpif.
69 * udpif is implemented as a "dispatcher" thread that reads upcalls from the
70 * kernel. It processes each upcall just enough to figure out its next
71 * destination. For a "miss" upcall (MISS_UPCALL), this is one of several
72 * "handler" threads (see struct handler). Other upcalls are queued to the
73 * main ofproto_dpif. */
75 struct dpif *dpif; /* Datapath handle. */
76 struct dpif_backer *backer; /* Opaque dpif_backer pointer. */
78 uint32_t secret; /* Random seed for upcall hash. */
80 pthread_t dispatcher; /* Dispatcher thread ID. */
82 struct handler *handlers; /* Upcall handlers. */
85 /* Queues to pass up to ofproto-dpif. */
86 struct guarded_list drop_keys; /* "struct drop key"s. */
87 struct guarded_list fmbs; /* "struct flow_miss_batch"es. */
89 /* Number of times udpif_revalidate() has been called. */
90 atomic_uint reval_seq;
94 struct latch exit_latch; /* Tells child threads to exit. */
98 BAD_UPCALL, /* Some kind of bug somewhere. */
99 MISS_UPCALL, /* A flow miss. */
100 SFLOW_UPCALL, /* sFlow sample. */
101 FLOW_SAMPLE_UPCALL, /* Per-flow sampling. */
102 IPFIX_UPCALL /* Per-bridge sampling. */
106 struct list list_node; /* For queuing upcalls. */
107 struct flow_miss *flow_miss; /* This upcall's flow_miss. */
109 /* Raw upcall plus data for keeping track of the memory backing it. */
110 struct dpif_upcall dpif_upcall; /* As returned by dpif_recv() */
111 struct ofpbuf upcall_buf; /* Owns some data in 'dpif_upcall'. */
112 uint64_t upcall_stub[512 / 8]; /* Buffer to reduce need for malloc(). */
115 static void upcall_destroy(struct upcall *);
117 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
119 static void recv_upcalls(struct udpif *);
120 static void handle_upcalls(struct udpif *, struct list *upcalls);
121 static void miss_destroy(struct flow_miss *);
122 static void *udpif_dispatcher(void *);
123 static void *udpif_upcall_handler(void *);
126 udpif_create(struct dpif_backer *backer, struct dpif *dpif)
128 struct udpif *udpif = xzalloc(sizeof *udpif);
131 udpif->backer = backer;
132 udpif->secret = random_uint32();
133 udpif->wait_seq = seq_create();
134 latch_init(&udpif->exit_latch);
135 guarded_list_init(&udpif->drop_keys);
136 guarded_list_init(&udpif->fmbs);
137 atomic_init(&udpif->reval_seq, 0);
143 udpif_destroy(struct udpif *udpif)
145 struct flow_miss_batch *fmb;
146 struct drop_key *drop_key;
148 udpif_recv_set(udpif, 0, false);
150 while ((drop_key = drop_key_next(udpif))) {
151 drop_key_destroy(drop_key);
154 while ((fmb = flow_miss_batch_next(udpif))) {
155 flow_miss_batch_destroy(fmb);
158 guarded_list_destroy(&udpif->drop_keys);
159 guarded_list_destroy(&udpif->fmbs);
160 latch_destroy(&udpif->exit_latch);
161 seq_destroy(udpif->wait_seq);
165 /* Tells 'udpif' to begin or stop handling flow misses depending on the value
166 * of 'enable'. 'n_handlers' is the number of upcall_handler threads to
167 * create. Passing 'n_handlers' as zero is equivalent to passing 'enable' as
170 udpif_recv_set(struct udpif *udpif, size_t n_handlers, bool enable)
172 n_handlers = enable ? n_handlers : 0;
173 n_handlers = MIN(n_handlers, 64);
175 /* Stop the old threads (if any). */
176 if (udpif->handlers && udpif->n_handlers != n_handlers) {
179 latch_set(&udpif->exit_latch);
181 /* Wake the handlers so they can exit. */
182 for (i = 0; i < udpif->n_handlers; i++) {
183 struct handler *handler = &udpif->handlers[i];
185 ovs_mutex_lock(&handler->mutex);
186 xpthread_cond_signal(&handler->wake_cond);
187 ovs_mutex_unlock(&handler->mutex);
190 xpthread_join(udpif->dispatcher, NULL);
191 for (i = 0; i < udpif->n_handlers; i++) {
192 struct handler *handler = &udpif->handlers[i];
193 struct upcall *miss, *next;
195 xpthread_join(handler->thread, NULL);
197 ovs_mutex_lock(&handler->mutex);
198 LIST_FOR_EACH_SAFE (miss, next, list_node, &handler->upcalls) {
199 list_remove(&miss->list_node);
200 upcall_destroy(miss);
202 ovs_mutex_unlock(&handler->mutex);
203 ovs_mutex_destroy(&handler->mutex);
205 xpthread_cond_destroy(&handler->wake_cond);
207 latch_poll(&udpif->exit_latch);
209 free(udpif->handlers);
210 udpif->handlers = NULL;
211 udpif->n_handlers = 0;
214 /* Start new threads (if necessary). */
215 if (!udpif->handlers && n_handlers) {
218 udpif->n_handlers = n_handlers;
219 udpif->handlers = xzalloc(udpif->n_handlers * sizeof *udpif->handlers);
220 for (i = 0; i < udpif->n_handlers; i++) {
221 struct handler *handler = &udpif->handlers[i];
223 handler->udpif = udpif;
224 list_init(&handler->upcalls);
225 handler->need_signal = false;
226 xpthread_cond_init(&handler->wake_cond, NULL);
227 ovs_mutex_init(&handler->mutex);
228 xpthread_create(&handler->thread, NULL, udpif_upcall_handler,
231 xpthread_create(&udpif->dispatcher, NULL, udpif_dispatcher, udpif);
236 udpif_wait(struct udpif *udpif)
238 uint64_t seq = seq_read(udpif->wait_seq);
239 if (!guarded_list_is_empty(&udpif->drop_keys) ||
240 !guarded_list_is_empty(&udpif->fmbs)) {
241 poll_immediate_wake();
243 seq_wait(udpif->wait_seq, seq);
247 /* Notifies 'udpif' that something changed which may render previous
248 * xlate_actions() results invalid. */
250 udpif_revalidate(struct udpif *udpif)
252 struct flow_miss_batch *fmb, *next_fmb;
256 /* Since we remove each miss on revalidation, their statistics won't be
257 * accounted to the appropriate 'facet's in the upper layer. In most
258 * cases, this is alright because we've already pushed the stats to the
259 * relevant rules. However, NetFlow requires absolute packet counts on
260 * 'facet's which could now be incorrect. */
261 atomic_add(&udpif->reval_seq, 1, &junk);
263 guarded_list_pop_all(&udpif->fmbs, &fmbs);
264 LIST_FOR_EACH_SAFE (fmb, next_fmb, list_node, &fmbs) {
265 list_remove(&fmb->list_node);
266 flow_miss_batch_destroy(fmb);
269 udpif_drop_key_clear(udpif);
272 /* Destroys and deallocates 'upcall'. */
274 upcall_destroy(struct upcall *upcall)
277 ofpbuf_uninit(&upcall->upcall_buf);
282 /* Retrieves the next batch of processed flow misses for 'udpif' to install.
283 * The caller is responsible for destroying it with flow_miss_batch_destroy().
285 struct flow_miss_batch *
286 flow_miss_batch_next(struct udpif *udpif)
290 for (i = 0; i < 50; i++) {
291 struct flow_miss_batch *next;
292 unsigned int reval_seq;
293 struct list *next_node;
295 next_node = guarded_list_pop_front(&udpif->fmbs);
300 next = CONTAINER_OF(next_node, struct flow_miss_batch, list_node);
301 atomic_read(&udpif->reval_seq, &reval_seq);
302 if (next->reval_seq == reval_seq) {
306 flow_miss_batch_destroy(next);
312 /* Destroys and deallocates 'fmb'. */
314 flow_miss_batch_destroy(struct flow_miss_batch *fmb)
316 struct flow_miss *miss, *next;
317 struct upcall *upcall, *next_upcall;
323 HMAP_FOR_EACH_SAFE (miss, next, hmap_node, &fmb->misses) {
324 hmap_remove(&fmb->misses, &miss->hmap_node);
328 LIST_FOR_EACH_SAFE (upcall, next_upcall, list_node, &fmb->upcalls) {
329 list_remove(&upcall->list_node);
330 upcall_destroy(upcall);
333 hmap_destroy(&fmb->misses);
337 /* Retrieves the next drop key which ofproto-dpif needs to process. The caller
338 * is responsible for destroying it with drop_key_destroy(). */
340 drop_key_next(struct udpif *udpif)
342 struct list *next = guarded_list_pop_front(&udpif->drop_keys);
343 return next ? CONTAINER_OF(next, struct drop_key, list_node) : NULL;
346 /* Destroys and deallocates 'drop_key'. */
348 drop_key_destroy(struct drop_key *drop_key)
356 /* Clears all drop keys waiting to be processed by drop_key_next(). */
358 udpif_drop_key_clear(struct udpif *udpif)
360 struct drop_key *drop_key, *next;
363 guarded_list_pop_all(&udpif->drop_keys, &list);
364 LIST_FOR_EACH_SAFE (drop_key, next, list_node, &list) {
365 list_remove(&drop_key->list_node);
366 drop_key_destroy(drop_key);
370 /* The dispatcher thread is responsible for receiving upcalls from the kernel,
371 * assigning them to a upcall_handler thread. */
373 udpif_dispatcher(void *arg)
375 struct udpif *udpif = arg;
377 set_subprogram_name("dispatcher");
378 while (!latch_is_set(&udpif->exit_latch)) {
380 dpif_recv_wait(udpif->dpif);
381 latch_wait(&udpif->exit_latch);
388 /* The miss handler thread is responsible for processing miss upcalls retrieved
389 * by the dispatcher thread. Once finished it passes the processed miss
390 * upcalls to ofproto-dpif where they're installed in the datapath. */
392 udpif_upcall_handler(void *arg)
394 struct handler *handler = arg;
396 set_subprogram_name("upcall_handler");
398 struct list misses = LIST_INITIALIZER(&misses);
401 ovs_mutex_lock(&handler->mutex);
403 if (latch_is_set(&handler->udpif->exit_latch)) {
404 ovs_mutex_unlock(&handler->mutex);
408 if (!handler->n_upcalls) {
409 ovs_mutex_cond_wait(&handler->wake_cond, &handler->mutex);
412 for (i = 0; i < FLOW_MISS_MAX_BATCH; i++) {
413 if (handler->n_upcalls) {
414 handler->n_upcalls--;
415 list_push_back(&misses, list_pop_front(&handler->upcalls));
420 ovs_mutex_unlock(&handler->mutex);
422 handle_upcalls(handler->udpif, &misses);
429 miss_destroy(struct flow_miss *miss)
431 xlate_out_uninit(&miss->xout);
434 static enum upcall_type
435 classify_upcall(const struct upcall *upcall)
437 const struct dpif_upcall *dpif_upcall = &upcall->dpif_upcall;
438 union user_action_cookie cookie;
441 /* First look at the upcall type. */
442 switch (dpif_upcall->type) {
449 case DPIF_N_UC_TYPES:
451 VLOG_WARN_RL(&rl, "upcall has unexpected type %"PRIu32,
456 /* "action" upcalls need a closer look. */
457 if (!dpif_upcall->userdata) {
458 VLOG_WARN_RL(&rl, "action upcall missing cookie");
461 userdata_len = nl_attr_get_size(dpif_upcall->userdata);
462 if (userdata_len < sizeof cookie.type
463 || userdata_len > sizeof cookie) {
464 VLOG_WARN_RL(&rl, "action upcall cookie has unexpected size %zu",
468 memset(&cookie, 0, sizeof cookie);
469 memcpy(&cookie, nl_attr_get(dpif_upcall->userdata), userdata_len);
470 if (userdata_len == sizeof cookie.sflow
471 && cookie.type == USER_ACTION_COOKIE_SFLOW) {
473 } else if (userdata_len == sizeof cookie.slow_path
474 && cookie.type == USER_ACTION_COOKIE_SLOW_PATH) {
476 } else if (userdata_len == sizeof cookie.flow_sample
477 && cookie.type == USER_ACTION_COOKIE_FLOW_SAMPLE) {
478 return FLOW_SAMPLE_UPCALL;
479 } else if (userdata_len == sizeof cookie.ipfix
480 && cookie.type == USER_ACTION_COOKIE_IPFIX) {
483 VLOG_WARN_RL(&rl, "invalid user cookie of type %"PRIu16
484 " and size %zu", cookie.type, userdata_len);
490 recv_upcalls(struct udpif *udpif)
495 uint32_t hash = udpif->secret;
496 struct handler *handler;
497 struct upcall *upcall;
498 size_t n_bytes, left;
502 upcall = xmalloc(sizeof *upcall);
503 ofpbuf_use_stub(&upcall->upcall_buf, upcall->upcall_stub,
504 sizeof upcall->upcall_stub);
505 error = dpif_recv(udpif->dpif, &upcall->dpif_upcall,
506 &upcall->upcall_buf);
508 upcall_destroy(upcall);
513 NL_ATTR_FOR_EACH (nla, left, upcall->dpif_upcall.key,
514 upcall->dpif_upcall.key_len) {
515 enum ovs_key_attr type = nl_attr_type(nla);
516 if (type == OVS_KEY_ATTR_IN_PORT
517 || type == OVS_KEY_ATTR_TCP
518 || type == OVS_KEY_ATTR_UDP) {
519 if (nl_attr_get_size(nla) == 4) {
520 hash = mhash_add(hash, nl_attr_get_u32(nla));
524 "Netlink attribute with incorrect size.");
528 hash = mhash_finish(hash, n_bytes);
530 handler = &udpif->handlers[hash % udpif->n_handlers];
532 ovs_mutex_lock(&handler->mutex);
533 if (handler->n_upcalls < MAX_QUEUE_LENGTH) {
534 list_push_back(&handler->upcalls, &upcall->list_node);
535 if (handler->n_upcalls == 0) {
536 handler->need_signal = true;
538 handler->n_upcalls++;
539 if (handler->need_signal &&
540 handler->n_upcalls >= FLOW_MISS_MAX_BATCH) {
541 handler->need_signal = false;
542 xpthread_cond_signal(&handler->wake_cond);
544 ovs_mutex_unlock(&handler->mutex);
545 if (!VLOG_DROP_DBG(&rl)) {
546 struct ds ds = DS_EMPTY_INITIALIZER;
548 odp_flow_key_format(upcall->dpif_upcall.key,
549 upcall->dpif_upcall.key_len,
551 VLOG_DBG("dispatcher: enqueue (%s)", ds_cstr(&ds));
555 ovs_mutex_unlock(&handler->mutex);
556 COVERAGE_INC(upcall_queue_overflow);
557 upcall_destroy(upcall);
561 for (n = 0; n < udpif->n_handlers; ++n) {
562 struct handler *handler = &udpif->handlers[n];
564 if (handler->need_signal) {
565 handler->need_signal = false;
566 ovs_mutex_lock(&handler->mutex);
567 xpthread_cond_signal(&handler->wake_cond);
568 ovs_mutex_unlock(&handler->mutex);
573 static struct flow_miss *
574 flow_miss_find(struct hmap *todo, const struct ofproto_dpif *ofproto,
575 const struct flow *flow, uint32_t hash)
577 struct flow_miss *miss;
579 HMAP_FOR_EACH_WITH_HASH (miss, hmap_node, hash, todo) {
580 if (miss->ofproto == ofproto && flow_equal(&miss->flow, flow)) {
589 handle_upcalls(struct udpif *udpif, struct list *upcalls)
591 struct dpif_op *opsp[FLOW_MISS_MAX_BATCH];
592 struct dpif_op ops[FLOW_MISS_MAX_BATCH];
593 struct upcall *upcall, *next;
594 struct flow_miss_batch *fmb;
595 size_t n_misses, n_ops, i;
596 struct flow_miss *miss;
597 unsigned int reval_seq;
598 enum upcall_type type;
601 /* Extract the flow from each upcall. Construct in fmb->misses a hash
602 * table that maps each unique flow to a 'struct flow_miss'.
604 * Most commonly there is a single packet per flow_miss, but there are
605 * several reasons why there might be more than one, e.g.:
607 * - The dpif packet interface does not support TSO (or UFO, etc.), so a
608 * large packet sent to userspace is split into a sequence of smaller
611 * - A stream of quickly arriving packets in an established "slow-pathed"
614 * - Rarely, a stream of quickly arriving packets in a flow not yet
615 * established. (This is rare because most protocols do not send
616 * multiple back-to-back packets before receiving a reply from the
617 * other end of the connection, which gives OVS a chance to set up a
620 fmb = xmalloc(sizeof *fmb);
621 atomic_read(&udpif->reval_seq, &fmb->reval_seq);
622 hmap_init(&fmb->misses);
623 list_init(&fmb->upcalls);
625 LIST_FOR_EACH_SAFE (upcall, next, list_node, upcalls) {
626 struct dpif_upcall *dupcall = &upcall->dpif_upcall;
627 struct ofpbuf *packet = dupcall->packet;
628 struct flow_miss *miss = &fmb->miss_buf[n_misses];
629 struct flow_miss *existing_miss;
630 struct ofproto_dpif *ofproto;
631 struct dpif_sflow *sflow;
632 struct dpif_ipfix *ipfix;
633 odp_port_t odp_in_port;
637 error = xlate_receive(udpif->backer, packet, dupcall->key,
638 dupcall->key_len, &flow, &miss->key_fitness,
639 &ofproto, &odp_in_port);
641 if (error == ENODEV) {
642 struct drop_key *drop_key;
644 /* Received packet on datapath port for which we couldn't
645 * associate an ofproto. This can happen if a port is removed
646 * while traffic is being received. Print a rate-limited
647 * message in case it happens frequently. Install a drop flow
648 * so that future packets of the flow are inexpensively dropped
650 VLOG_INFO_RL(&rl, "received packet on unassociated datapath "
651 "port %"PRIu32, odp_in_port);
653 drop_key = xmalloc(sizeof *drop_key);
654 drop_key->key = xmemdup(dupcall->key, dupcall->key_len);
655 drop_key->key_len = dupcall->key_len;
657 if (guarded_list_push_back(&udpif->drop_keys,
658 &drop_key->list_node,
660 seq_change(udpif->wait_seq);
662 COVERAGE_INC(drop_queue_overflow);
663 drop_key_destroy(drop_key);
666 list_remove(&upcall->list_node);
667 upcall_destroy(upcall);
671 type = classify_upcall(upcall);
672 if (type == MISS_UPCALL) {
675 flow_extract(packet, flow.skb_priority, flow.pkt_mark,
676 &flow.tunnel, &flow.in_port, &miss->flow);
678 hash = flow_hash(&miss->flow, 0);
679 existing_miss = flow_miss_find(&fmb->misses, ofproto, &miss->flow,
681 if (!existing_miss) {
682 hmap_insert(&fmb->misses, &miss->hmap_node, hash);
683 miss->ofproto = ofproto;
684 miss->key = dupcall->key;
685 miss->key_len = dupcall->key_len;
686 miss->upcall_type = dupcall->type;
687 miss->stats.n_packets = 0;
688 miss->stats.n_bytes = 0;
689 miss->stats.used = time_msec();
690 miss->stats.tcp_flags = 0;
694 miss = existing_miss;
696 miss->stats.tcp_flags |= packet_get_tcp_flags(packet, &miss->flow);
697 miss->stats.n_bytes += packet->size;
698 miss->stats.n_packets++;
700 upcall->flow_miss = miss;
706 sflow = xlate_get_sflow(ofproto);
708 union user_action_cookie cookie;
710 memset(&cookie, 0, sizeof cookie);
711 memcpy(&cookie, nl_attr_get(dupcall->userdata),
712 sizeof cookie.sflow);
713 dpif_sflow_received(sflow, dupcall->packet, &flow, odp_in_port,
715 dpif_sflow_unref(sflow);
719 ipfix = xlate_get_ipfix(ofproto);
721 dpif_ipfix_bridge_sample(ipfix, dupcall->packet, &flow);
722 dpif_ipfix_unref(ipfix);
725 case FLOW_SAMPLE_UPCALL:
726 ipfix = xlate_get_ipfix(ofproto);
728 union user_action_cookie cookie;
730 memset(&cookie, 0, sizeof cookie);
731 memcpy(&cookie, nl_attr_get(dupcall->userdata),
732 sizeof cookie.flow_sample);
734 /* The flow reflects exactly the contents of the packet.
735 * Sample the packet using it. */
736 dpif_ipfix_flow_sample(ipfix, dupcall->packet, &flow,
737 cookie.flow_sample.collector_set_id,
738 cookie.flow_sample.probability,
739 cookie.flow_sample.obs_domain_id,
740 cookie.flow_sample.obs_point_id);
741 dpif_ipfix_unref(ipfix);
750 list_remove(&upcall->list_node);
751 upcall_destroy(upcall);
754 /* Initialize each 'struct flow_miss's ->xout.
756 * We do this per-flow_miss rather than per-packet because, most commonly,
757 * all the packets in a flow can use the same translation.
759 * We can't do this in the previous loop because we need the TCP flags for
760 * all the packets in each miss. */
762 HMAP_FOR_EACH (miss, hmap_node, &fmb->misses) {
765 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL,
766 miss->stats.tcp_flags, NULL);
767 xin.may_learn = true;
768 xin.resubmit_stats = &miss->stats;
769 xlate_actions(&xin, &miss->xout);
770 fail_open = fail_open || miss->xout.fail_open;
773 /* Now handle the packets individually in order of arrival. In the common
774 * case each packet of a miss can share the same actions, but slow-pathed
775 * packets need to be translated individually:
777 * - For SLOW_CFM, SLOW_LACP, SLOW_STP, and SLOW_BFD, translation is what
778 * processes received packets for these protocols.
780 * - For SLOW_CONTROLLER, translation sends the packet to the OpenFlow
783 * The loop fills 'ops' with an array of operations to execute in the
786 LIST_FOR_EACH (upcall, list_node, upcalls) {
787 struct flow_miss *miss = upcall->flow_miss;
788 struct ofpbuf *packet = upcall->dpif_upcall.packet;
790 if (miss->xout.slow) {
793 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL, 0, packet);
794 xlate_actions_for_side_effects(&xin);
797 if (miss->xout.odp_actions.size) {
800 if (miss->flow.in_port.ofp_port
801 != vsp_realdev_to_vlandev(miss->ofproto,
802 miss->flow.in_port.ofp_port,
803 miss->flow.vlan_tci)) {
804 /* This packet was received on a VLAN splinter port. We
805 * added a VLAN to the packet to make the packet resemble
806 * the flow, but the actions were composed assuming that
807 * the packet contained no VLAN. So, we must remove the
808 * VLAN header from the packet before trying to execute the
810 eth_pop_vlan(packet);
814 op->type = DPIF_OP_EXECUTE;
815 op->u.execute.key = miss->key;
816 op->u.execute.key_len = miss->key_len;
817 op->u.execute.packet = packet;
818 op->u.execute.actions = miss->xout.odp_actions.data;
819 op->u.execute.actions_len = miss->xout.odp_actions.size;
820 op->u.execute.needs_help = (miss->xout.slow & SLOW_ACTION) != 0;
825 for (i = 0; i < n_ops; i++) {
828 dpif_operate(udpif->dpif, opsp, n_ops);
830 /* Special case for fail-open mode.
832 * If we are in fail-open mode, but we are connected to a controller too,
833 * then we should send the packet up to the controller in the hope that it
834 * will try to set up a flow and thereby allow us to exit fail-open.
836 * See the top-level comment in fail-open.c for more information. */
838 LIST_FOR_EACH (upcall, list_node, upcalls) {
839 struct flow_miss *miss = upcall->flow_miss;
840 struct ofpbuf *packet = upcall->dpif_upcall.packet;
841 struct ofputil_packet_in *pin;
843 pin = xmalloc(sizeof *pin);
844 pin->packet = xmemdup(packet->data, packet->size);
845 pin->packet_len = packet->size;
846 pin->reason = OFPR_NO_MATCH;
847 pin->controller_id = 0;
850 pin->send_len = 0; /* Not used for flow table misses. */
851 flow_get_metadata(&miss->flow, &pin->fmd);
852 ofproto_dpif_send_packet_in(miss->ofproto, pin);
856 list_move(&fmb->upcalls, upcalls);
858 atomic_read(&udpif->reval_seq, &reval_seq);
859 if (reval_seq != fmb->reval_seq) {
860 COVERAGE_INC(fmb_queue_revalidated);
861 flow_miss_batch_destroy(fmb);
862 } else if (!guarded_list_push_back(&udpif->fmbs, &fmb->list_node,
864 COVERAGE_INC(fmb_queue_overflow);
865 flow_miss_batch_destroy(fmb);
867 seq_change(udpif->wait_seq);