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"
25 #include "dynamic-string.h"
26 #include "fail-open.h"
27 #include "guarded-list.h"
32 #include "ofproto-dpif-ipfix.h"
33 #include "ofproto-dpif-sflow.h"
35 #include "poll-loop.h"
40 #define MAX_QUEUE_LENGTH 512
42 VLOG_DEFINE_THIS_MODULE(ofproto_dpif_upcall);
44 COVERAGE_DEFINE(drop_queue_overflow);
45 COVERAGE_DEFINE(upcall_queue_overflow);
46 COVERAGE_DEFINE(fmb_queue_overflow);
47 COVERAGE_DEFINE(fmb_queue_revalidated);
49 /* A thread that processes each upcall handed to it by the dispatcher thread,
50 * forwards the upcall's packet, and then queues it to the main ofproto_dpif
51 * to possibly set up a kernel flow as a cache. */
53 struct udpif *udpif; /* Parent udpif. */
54 pthread_t thread; /* Thread ID. */
55 char *name; /* Thread name. */
57 struct ovs_mutex mutex; /* Mutex guarding the following. */
59 /* Atomic queue of unprocessed upcalls. */
60 struct list upcalls OVS_GUARDED;
61 size_t n_upcalls OVS_GUARDED;
63 bool need_signal; /* Only changed by the dispatcher. */
65 pthread_cond_t wake_cond; /* Wakes 'thread' while holding
69 /* An upcall handler for ofproto_dpif.
71 * udpif is implemented as a "dispatcher" thread that reads upcalls from the
72 * kernel. It processes each upcall just enough to figure out its next
73 * destination. For a "miss" upcall (MISS_UPCALL), this is one of several
74 * "handler" threads (see struct handler). Other upcalls are queued to the
75 * main ofproto_dpif. */
77 struct list list_node; /* In all_udpifs list. */
79 struct dpif *dpif; /* Datapath handle. */
80 struct dpif_backer *backer; /* Opaque dpif_backer pointer. */
82 uint32_t secret; /* Random seed for upcall hash. */
84 pthread_t dispatcher; /* Dispatcher thread ID. */
86 struct handler *handlers; /* Upcall handlers. */
89 /* Queues to pass up to ofproto-dpif. */
90 struct guarded_list drop_keys; /* "struct drop key"s. */
91 struct guarded_list fmbs; /* "struct flow_miss_batch"es. */
94 struct seq *reval_seq;
96 struct latch exit_latch; /* Tells child threads to exit. */
100 BAD_UPCALL, /* Some kind of bug somewhere. */
101 MISS_UPCALL, /* A flow miss. */
102 SFLOW_UPCALL, /* sFlow sample. */
103 FLOW_SAMPLE_UPCALL, /* Per-flow sampling. */
104 IPFIX_UPCALL /* Per-bridge sampling. */
108 struct list list_node; /* For queuing upcalls. */
109 struct flow_miss *flow_miss; /* This upcall's flow_miss. */
111 /* Raw upcall plus data for keeping track of the memory backing it. */
112 struct dpif_upcall dpif_upcall; /* As returned by dpif_recv() */
113 struct ofpbuf upcall_buf; /* Owns some data in 'dpif_upcall'. */
114 uint64_t upcall_stub[512 / 8]; /* Buffer to reduce need for malloc(). */
117 static void upcall_destroy(struct upcall *);
119 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
120 static struct list all_udpifs = LIST_INITIALIZER(&all_udpifs);
122 static void recv_upcalls(struct udpif *);
123 static void handle_upcalls(struct udpif *, struct list *upcalls);
124 static void miss_destroy(struct flow_miss *);
125 static void *udpif_dispatcher(void *);
126 static void *udpif_upcall_handler(void *);
127 static void upcall_unixctl_show(struct unixctl_conn *conn, int argc,
128 const char *argv[], void *aux);
131 udpif_create(struct dpif_backer *backer, struct dpif *dpif)
133 static struct ovsthread_once once = OVSTHREAD_ONCE_INITIALIZER;
134 struct udpif *udpif = xzalloc(sizeof *udpif);
136 if (ovsthread_once_start(&once)) {
137 unixctl_command_register("upcall/show", "", 0, 0, upcall_unixctl_show,
139 ovsthread_once_done(&once);
143 udpif->backer = backer;
144 udpif->secret = random_uint32();
145 udpif->wait_seq = seq_create();
146 udpif->reval_seq = seq_create();
147 latch_init(&udpif->exit_latch);
148 guarded_list_init(&udpif->drop_keys);
149 guarded_list_init(&udpif->fmbs);
150 list_push_back(&all_udpifs, &udpif->list_node);
156 udpif_destroy(struct udpif *udpif)
158 struct flow_miss_batch *fmb;
159 struct drop_key *drop_key;
161 udpif_recv_set(udpif, 0, false);
162 list_remove(&udpif->list_node);
164 while ((drop_key = drop_key_next(udpif))) {
165 drop_key_destroy(drop_key);
168 while ((fmb = flow_miss_batch_next(udpif))) {
169 flow_miss_batch_destroy(fmb);
172 guarded_list_destroy(&udpif->drop_keys);
173 guarded_list_destroy(&udpif->fmbs);
174 latch_destroy(&udpif->exit_latch);
175 seq_destroy(udpif->wait_seq);
176 seq_destroy(udpif->reval_seq);
180 /* Tells 'udpif' to begin or stop handling flow misses depending on the value
181 * of 'enable'. 'n_handlers' is the number of upcall_handler threads to
182 * create. Passing 'n_handlers' as zero is equivalent to passing 'enable' as
185 udpif_recv_set(struct udpif *udpif, size_t n_handlers, bool enable)
187 n_handlers = enable ? n_handlers : 0;
189 /* Stop the old threads (if any). */
190 if (udpif->handlers && udpif->n_handlers != n_handlers) {
193 latch_set(&udpif->exit_latch);
195 /* Wake the handlers so they can exit. */
196 for (i = 0; i < udpif->n_handlers; i++) {
197 struct handler *handler = &udpif->handlers[i];
199 ovs_mutex_lock(&handler->mutex);
200 xpthread_cond_signal(&handler->wake_cond);
201 ovs_mutex_unlock(&handler->mutex);
204 xpthread_join(udpif->dispatcher, NULL);
205 for (i = 0; i < udpif->n_handlers; i++) {
206 struct handler *handler = &udpif->handlers[i];
207 struct upcall *miss, *next;
209 xpthread_join(handler->thread, NULL);
211 ovs_mutex_lock(&handler->mutex);
212 LIST_FOR_EACH_SAFE (miss, next, list_node, &handler->upcalls) {
213 list_remove(&miss->list_node);
214 upcall_destroy(miss);
216 ovs_mutex_unlock(&handler->mutex);
217 ovs_mutex_destroy(&handler->mutex);
219 xpthread_cond_destroy(&handler->wake_cond);
222 latch_poll(&udpif->exit_latch);
224 free(udpif->handlers);
225 udpif->handlers = NULL;
226 udpif->n_handlers = 0;
229 /* Start new threads (if necessary). */
230 if (!udpif->handlers && n_handlers) {
233 udpif->n_handlers = n_handlers;
234 udpif->handlers = xzalloc(udpif->n_handlers * sizeof *udpif->handlers);
235 for (i = 0; i < udpif->n_handlers; i++) {
236 struct handler *handler = &udpif->handlers[i];
238 handler->udpif = udpif;
239 list_init(&handler->upcalls);
240 handler->need_signal = false;
241 xpthread_cond_init(&handler->wake_cond, NULL);
242 ovs_mutex_init(&handler->mutex);
243 xpthread_create(&handler->thread, NULL, udpif_upcall_handler,
246 xpthread_create(&udpif->dispatcher, NULL, udpif_dispatcher, udpif);
251 udpif_wait(struct udpif *udpif)
253 uint64_t seq = seq_read(udpif->wait_seq);
254 if (!guarded_list_is_empty(&udpif->drop_keys) ||
255 !guarded_list_is_empty(&udpif->fmbs)) {
256 poll_immediate_wake();
258 seq_wait(udpif->wait_seq, seq);
262 /* Notifies 'udpif' that something changed which may render previous
263 * xlate_actions() results invalid. */
265 udpif_revalidate(struct udpif *udpif)
267 struct flow_miss_batch *fmb, *next_fmb;
270 /* Since we remove each miss on revalidation, their statistics won't be
271 * accounted to the appropriate 'facet's in the upper layer. In most
272 * cases, this is alright because we've already pushed the stats to the
274 seq_change(udpif->reval_seq);
276 guarded_list_pop_all(&udpif->fmbs, &fmbs);
277 LIST_FOR_EACH_SAFE (fmb, next_fmb, list_node, &fmbs) {
278 list_remove(&fmb->list_node);
279 flow_miss_batch_destroy(fmb);
282 udpif_drop_key_clear(udpif);
286 udpif_get_memory_usage(struct udpif *udpif, struct simap *usage)
290 simap_increase(usage, "dispatchers", 1);
291 simap_increase(usage, "flow_dumpers", 1);
293 simap_increase(usage, "handlers", udpif->n_handlers);
294 for (i = 0; i < udpif->n_handlers; i++) {
295 struct handler *handler = &udpif->handlers[i];
296 ovs_mutex_lock(&handler->mutex);
297 simap_increase(usage, "handler upcalls", handler->n_upcalls);
298 ovs_mutex_unlock(&handler->mutex);
302 /* Destroys and deallocates 'upcall'. */
304 upcall_destroy(struct upcall *upcall)
307 ofpbuf_uninit(&upcall->upcall_buf);
312 /* Retrieves the next batch of processed flow misses for 'udpif' to install.
313 * The caller is responsible for destroying it with flow_miss_batch_destroy().
315 struct flow_miss_batch *
316 flow_miss_batch_next(struct udpif *udpif)
320 for (i = 0; i < 50; i++) {
321 struct flow_miss_batch *next;
322 struct list *next_node;
324 next_node = guarded_list_pop_front(&udpif->fmbs);
329 next = CONTAINER_OF(next_node, struct flow_miss_batch, list_node);
330 if (next->reval_seq == seq_read(udpif->reval_seq)) {
334 flow_miss_batch_destroy(next);
340 /* Destroys and deallocates 'fmb'. */
342 flow_miss_batch_destroy(struct flow_miss_batch *fmb)
344 struct flow_miss *miss, *next;
345 struct upcall *upcall, *next_upcall;
351 HMAP_FOR_EACH_SAFE (miss, next, hmap_node, &fmb->misses) {
352 hmap_remove(&fmb->misses, &miss->hmap_node);
356 LIST_FOR_EACH_SAFE (upcall, next_upcall, list_node, &fmb->upcalls) {
357 list_remove(&upcall->list_node);
358 upcall_destroy(upcall);
361 hmap_destroy(&fmb->misses);
365 /* Retrieves the next drop key which ofproto-dpif needs to process. The caller
366 * is responsible for destroying it with drop_key_destroy(). */
368 drop_key_next(struct udpif *udpif)
370 struct list *next = guarded_list_pop_front(&udpif->drop_keys);
371 return next ? CONTAINER_OF(next, struct drop_key, list_node) : NULL;
374 /* Destroys and deallocates 'drop_key'. */
376 drop_key_destroy(struct drop_key *drop_key)
384 /* Clears all drop keys waiting to be processed by drop_key_next(). */
386 udpif_drop_key_clear(struct udpif *udpif)
388 struct drop_key *drop_key, *next;
391 guarded_list_pop_all(&udpif->drop_keys, &list);
392 LIST_FOR_EACH_SAFE (drop_key, next, list_node, &list) {
393 list_remove(&drop_key->list_node);
394 drop_key_destroy(drop_key);
398 /* The dispatcher thread is responsible for receiving upcalls from the kernel,
399 * assigning them to a upcall_handler thread. */
401 udpif_dispatcher(void *arg)
403 struct udpif *udpif = arg;
405 set_subprogram_name("dispatcher");
406 while (!latch_is_set(&udpif->exit_latch)) {
408 dpif_recv_wait(udpif->dpif);
409 latch_wait(&udpif->exit_latch);
416 /* The miss handler thread is responsible for processing miss upcalls retrieved
417 * by the dispatcher thread. Once finished it passes the processed miss
418 * upcalls to ofproto-dpif where they're installed in the datapath. */
420 udpif_upcall_handler(void *arg)
422 struct handler *handler = arg;
424 handler->name = xasprintf("handler_%u", ovsthread_id_self());
425 set_subprogram_name("%s", handler->name);
428 struct list misses = LIST_INITIALIZER(&misses);
431 ovs_mutex_lock(&handler->mutex);
433 if (latch_is_set(&handler->udpif->exit_latch)) {
434 ovs_mutex_unlock(&handler->mutex);
438 if (!handler->n_upcalls) {
439 ovs_mutex_cond_wait(&handler->wake_cond, &handler->mutex);
442 for (i = 0; i < FLOW_MISS_MAX_BATCH; i++) {
443 if (handler->n_upcalls) {
444 handler->n_upcalls--;
445 list_push_back(&misses, list_pop_front(&handler->upcalls));
450 ovs_mutex_unlock(&handler->mutex);
452 handle_upcalls(handler->udpif, &misses);
459 miss_destroy(struct flow_miss *miss)
461 xlate_out_uninit(&miss->xout);
464 static enum upcall_type
465 classify_upcall(const struct upcall *upcall)
467 const struct dpif_upcall *dpif_upcall = &upcall->dpif_upcall;
468 union user_action_cookie cookie;
471 /* First look at the upcall type. */
472 switch (dpif_upcall->type) {
479 case DPIF_N_UC_TYPES:
481 VLOG_WARN_RL(&rl, "upcall has unexpected type %"PRIu32,
486 /* "action" upcalls need a closer look. */
487 if (!dpif_upcall->userdata) {
488 VLOG_WARN_RL(&rl, "action upcall missing cookie");
491 userdata_len = nl_attr_get_size(dpif_upcall->userdata);
492 if (userdata_len < sizeof cookie.type
493 || userdata_len > sizeof cookie) {
494 VLOG_WARN_RL(&rl, "action upcall cookie has unexpected size %"PRIuSIZE,
498 memset(&cookie, 0, sizeof cookie);
499 memcpy(&cookie, nl_attr_get(dpif_upcall->userdata), userdata_len);
500 if (userdata_len == sizeof cookie.sflow
501 && cookie.type == USER_ACTION_COOKIE_SFLOW) {
503 } else if (userdata_len == sizeof cookie.slow_path
504 && cookie.type == USER_ACTION_COOKIE_SLOW_PATH) {
506 } else if (userdata_len == sizeof cookie.flow_sample
507 && cookie.type == USER_ACTION_COOKIE_FLOW_SAMPLE) {
508 return FLOW_SAMPLE_UPCALL;
509 } else if (userdata_len == sizeof cookie.ipfix
510 && cookie.type == USER_ACTION_COOKIE_IPFIX) {
513 VLOG_WARN_RL(&rl, "invalid user cookie of type %"PRIu16
514 " and size %"PRIuSIZE, cookie.type, userdata_len);
520 recv_upcalls(struct udpif *udpif)
525 uint32_t hash = udpif->secret;
526 struct handler *handler;
527 struct upcall *upcall;
528 size_t n_bytes, left;
532 upcall = xmalloc(sizeof *upcall);
533 ofpbuf_use_stub(&upcall->upcall_buf, upcall->upcall_stub,
534 sizeof upcall->upcall_stub);
535 error = dpif_recv(udpif->dpif, &upcall->dpif_upcall,
536 &upcall->upcall_buf);
538 upcall_destroy(upcall);
543 NL_ATTR_FOR_EACH (nla, left, upcall->dpif_upcall.key,
544 upcall->dpif_upcall.key_len) {
545 enum ovs_key_attr type = nl_attr_type(nla);
546 if (type == OVS_KEY_ATTR_IN_PORT
547 || type == OVS_KEY_ATTR_TCP
548 || type == OVS_KEY_ATTR_UDP) {
549 if (nl_attr_get_size(nla) == 4) {
550 hash = mhash_add(hash, nl_attr_get_u32(nla));
554 "Netlink attribute with incorrect size.");
558 hash = mhash_finish(hash, n_bytes);
560 handler = &udpif->handlers[hash % udpif->n_handlers];
562 ovs_mutex_lock(&handler->mutex);
563 if (handler->n_upcalls < MAX_QUEUE_LENGTH) {
564 list_push_back(&handler->upcalls, &upcall->list_node);
565 if (handler->n_upcalls == 0) {
566 handler->need_signal = true;
568 handler->n_upcalls++;
569 if (handler->need_signal &&
570 handler->n_upcalls >= FLOW_MISS_MAX_BATCH) {
571 handler->need_signal = false;
572 xpthread_cond_signal(&handler->wake_cond);
574 ovs_mutex_unlock(&handler->mutex);
575 if (!VLOG_DROP_DBG(&rl)) {
576 struct ds ds = DS_EMPTY_INITIALIZER;
578 odp_flow_key_format(upcall->dpif_upcall.key,
579 upcall->dpif_upcall.key_len,
581 VLOG_DBG("dispatcher: enqueue (%s)", ds_cstr(&ds));
585 ovs_mutex_unlock(&handler->mutex);
586 COVERAGE_INC(upcall_queue_overflow);
587 upcall_destroy(upcall);
591 for (n = 0; n < udpif->n_handlers; ++n) {
592 struct handler *handler = &udpif->handlers[n];
594 if (handler->need_signal) {
595 handler->need_signal = false;
596 ovs_mutex_lock(&handler->mutex);
597 xpthread_cond_signal(&handler->wake_cond);
598 ovs_mutex_unlock(&handler->mutex);
603 static struct flow_miss *
604 flow_miss_find(struct hmap *todo, const struct ofproto_dpif *ofproto,
605 const struct flow *flow, uint32_t hash)
607 struct flow_miss *miss;
609 HMAP_FOR_EACH_WITH_HASH (miss, hmap_node, hash, todo) {
610 if (miss->ofproto == ofproto && flow_equal(&miss->flow, flow)) {
619 handle_upcalls(struct udpif *udpif, struct list *upcalls)
621 struct dpif_op *opsp[FLOW_MISS_MAX_BATCH];
622 struct dpif_op ops[FLOW_MISS_MAX_BATCH];
623 struct upcall *upcall, *next;
624 struct flow_miss_batch *fmb;
625 size_t n_misses, n_ops, i;
626 struct flow_miss *miss;
627 enum upcall_type type;
630 /* Extract the flow from each upcall. Construct in fmb->misses a hash
631 * table that maps each unique flow to a 'struct flow_miss'.
633 * Most commonly there is a single packet per flow_miss, but there are
634 * several reasons why there might be more than one, e.g.:
636 * - The dpif packet interface does not support TSO (or UFO, etc.), so a
637 * large packet sent to userspace is split into a sequence of smaller
640 * - A stream of quickly arriving packets in an established "slow-pathed"
643 * - Rarely, a stream of quickly arriving packets in a flow not yet
644 * established. (This is rare because most protocols do not send
645 * multiple back-to-back packets before receiving a reply from the
646 * other end of the connection, which gives OVS a chance to set up a
649 fmb = xmalloc(sizeof *fmb);
650 fmb->reval_seq = seq_read(udpif->reval_seq);
651 hmap_init(&fmb->misses);
652 list_init(&fmb->upcalls);
654 LIST_FOR_EACH_SAFE (upcall, next, list_node, upcalls) {
655 struct dpif_upcall *dupcall = &upcall->dpif_upcall;
656 struct ofpbuf *packet = dupcall->packet;
657 struct flow_miss *miss = &fmb->miss_buf[n_misses];
658 struct flow_miss *existing_miss;
659 struct ofproto_dpif *ofproto;
660 struct dpif_sflow *sflow;
661 struct dpif_ipfix *ipfix;
662 odp_port_t odp_in_port;
666 error = xlate_receive(udpif->backer, packet, dupcall->key,
667 dupcall->key_len, &flow, &miss->key_fitness,
668 &ofproto, &ipfix, &sflow, NULL, &odp_in_port);
670 if (error == ENODEV) {
671 struct drop_key *drop_key;
673 /* Received packet on datapath port for which we couldn't
674 * associate an ofproto. This can happen if a port is removed
675 * while traffic is being received. Print a rate-limited
676 * message in case it happens frequently. Install a drop flow
677 * so that future packets of the flow are inexpensively dropped
679 VLOG_INFO_RL(&rl, "received packet on unassociated datapath "
680 "port %"PRIu32, odp_in_port);
682 drop_key = xmalloc(sizeof *drop_key);
683 drop_key->key = xmemdup(dupcall->key, dupcall->key_len);
684 drop_key->key_len = dupcall->key_len;
686 if (guarded_list_push_back(&udpif->drop_keys,
687 &drop_key->list_node,
689 seq_change(udpif->wait_seq);
691 COVERAGE_INC(drop_queue_overflow);
692 drop_key_destroy(drop_key);
695 list_remove(&upcall->list_node);
696 upcall_destroy(upcall);
700 type = classify_upcall(upcall);
701 if (type == MISS_UPCALL) {
704 flow_extract(packet, flow.skb_priority, flow.pkt_mark,
705 &flow.tunnel, &flow.in_port, &miss->flow);
707 hash = flow_hash(&miss->flow, 0);
708 existing_miss = flow_miss_find(&fmb->misses, ofproto, &miss->flow,
710 if (!existing_miss) {
711 hmap_insert(&fmb->misses, &miss->hmap_node, hash);
712 miss->ofproto = ofproto;
713 miss->key = dupcall->key;
714 miss->key_len = dupcall->key_len;
715 miss->upcall_type = dupcall->type;
716 miss->stats.n_packets = 0;
717 miss->stats.n_bytes = 0;
718 miss->stats.used = time_msec();
719 miss->stats.tcp_flags = 0;
723 miss = existing_miss;
725 miss->stats.tcp_flags |= packet_get_tcp_flags(packet, &miss->flow);
726 miss->stats.n_bytes += packet->size;
727 miss->stats.n_packets++;
729 upcall->flow_miss = miss;
736 union user_action_cookie cookie;
738 memset(&cookie, 0, sizeof cookie);
739 memcpy(&cookie, nl_attr_get(dupcall->userdata),
740 sizeof cookie.sflow);
741 dpif_sflow_received(sflow, dupcall->packet, &flow, odp_in_port,
747 dpif_ipfix_bridge_sample(ipfix, dupcall->packet, &flow);
750 case FLOW_SAMPLE_UPCALL:
752 union user_action_cookie cookie;
754 memset(&cookie, 0, sizeof cookie);
755 memcpy(&cookie, nl_attr_get(dupcall->userdata),
756 sizeof cookie.flow_sample);
758 /* The flow reflects exactly the contents of the packet.
759 * Sample the packet using it. */
760 dpif_ipfix_flow_sample(ipfix, dupcall->packet, &flow,
761 cookie.flow_sample.collector_set_id,
762 cookie.flow_sample.probability,
763 cookie.flow_sample.obs_domain_id,
764 cookie.flow_sample.obs_point_id);
773 dpif_ipfix_unref(ipfix);
774 dpif_sflow_unref(sflow);
776 list_remove(&upcall->list_node);
777 upcall_destroy(upcall);
780 /* Initialize each 'struct flow_miss's ->xout.
782 * We do this per-flow_miss rather than per-packet because, most commonly,
783 * all the packets in a flow can use the same translation.
785 * We can't do this in the previous loop because we need the TCP flags for
786 * all the packets in each miss. */
788 HMAP_FOR_EACH (miss, hmap_node, &fmb->misses) {
791 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL,
792 miss->stats.tcp_flags, NULL);
793 xin.may_learn = true;
794 xin.resubmit_stats = &miss->stats;
795 xlate_actions(&xin, &miss->xout);
796 fail_open = fail_open || miss->xout.fail_open;
799 /* Now handle the packets individually in order of arrival. In the common
800 * case each packet of a miss can share the same actions, but slow-pathed
801 * packets need to be translated individually:
803 * - For SLOW_CFM, SLOW_LACP, SLOW_STP, and SLOW_BFD, translation is what
804 * processes received packets for these protocols.
806 * - For SLOW_CONTROLLER, translation sends the packet to the OpenFlow
809 * The loop fills 'ops' with an array of operations to execute in the
812 LIST_FOR_EACH (upcall, list_node, upcalls) {
813 struct flow_miss *miss = upcall->flow_miss;
814 struct ofpbuf *packet = upcall->dpif_upcall.packet;
816 if (miss->xout.slow) {
819 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL, 0, packet);
820 xlate_actions_for_side_effects(&xin);
823 if (miss->xout.odp_actions.size) {
826 if (miss->flow.in_port.ofp_port
827 != vsp_realdev_to_vlandev(miss->ofproto,
828 miss->flow.in_port.ofp_port,
829 miss->flow.vlan_tci)) {
830 /* This packet was received on a VLAN splinter port. We
831 * added a VLAN to the packet to make the packet resemble
832 * the flow, but the actions were composed assuming that
833 * the packet contained no VLAN. So, we must remove the
834 * VLAN header from the packet before trying to execute the
836 eth_pop_vlan(packet);
840 op->type = DPIF_OP_EXECUTE;
841 op->u.execute.key = miss->key;
842 op->u.execute.key_len = miss->key_len;
843 op->u.execute.packet = packet;
844 op->u.execute.actions = miss->xout.odp_actions.data;
845 op->u.execute.actions_len = miss->xout.odp_actions.size;
846 op->u.execute.needs_help = (miss->xout.slow & SLOW_ACTION) != 0;
851 for (i = 0; i < n_ops; i++) {
854 dpif_operate(udpif->dpif, opsp, n_ops);
856 /* Special case for fail-open mode.
858 * If we are in fail-open mode, but we are connected to a controller too,
859 * then we should send the packet up to the controller in the hope that it
860 * will try to set up a flow and thereby allow us to exit fail-open.
862 * See the top-level comment in fail-open.c for more information. */
864 LIST_FOR_EACH (upcall, list_node, upcalls) {
865 struct flow_miss *miss = upcall->flow_miss;
866 struct ofpbuf *packet = upcall->dpif_upcall.packet;
867 struct ofproto_packet_in *pin;
869 pin = xmalloc(sizeof *pin);
870 pin->up.packet = xmemdup(packet->data, packet->size);
871 pin->up.packet_len = packet->size;
872 pin->up.reason = OFPR_NO_MATCH;
873 pin->up.table_id = 0;
874 pin->up.cookie = OVS_BE64_MAX;
875 flow_get_metadata(&miss->flow, &pin->up.fmd);
876 pin->send_len = 0; /* Not used for flow table misses. */
877 pin->generated_by_table_miss = false;
878 ofproto_dpif_send_packet_in(miss->ofproto, pin);
882 list_move(&fmb->upcalls, upcalls);
884 if (fmb->reval_seq != seq_read(udpif->reval_seq)) {
885 COVERAGE_INC(fmb_queue_revalidated);
886 flow_miss_batch_destroy(fmb);
887 } else if (!guarded_list_push_back(&udpif->fmbs, &fmb->list_node,
889 COVERAGE_INC(fmb_queue_overflow);
890 flow_miss_batch_destroy(fmb);
892 seq_change(udpif->wait_seq);
897 upcall_unixctl_show(struct unixctl_conn *conn, int argc OVS_UNUSED,
898 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
900 struct ds ds = DS_EMPTY_INITIALIZER;
903 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
906 ds_put_format(&ds, "%s:\n", dpif_name(udpif->dpif));
907 for (i = 0; i < udpif->n_handlers; i++) {
908 struct handler *handler = &udpif->handlers[i];
910 ovs_mutex_lock(&handler->mutex);
911 ds_put_format(&ds, "\t%s: (upcall queue %"PRIuSIZE")\n",
912 handler->name, handler->n_upcalls);
913 ovs_mutex_unlock(&handler->mutex);
917 unixctl_command_reply(conn, ds_cstr(&ds));