1 /* Copyright (c) 2009, 2010, 2011, 2012, 2013, 2014 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"
34 #include "ofproto-dpif-xlate.h"
37 #include "poll-loop.h"
42 #define MAX_QUEUE_LENGTH 512
43 #define FLOW_MISS_MAX_BATCH 50
44 #define REVALIDATE_MAX_BATCH 50
46 VLOG_DEFINE_THIS_MODULE(ofproto_dpif_upcall);
48 COVERAGE_DEFINE(upcall_queue_overflow);
50 /* A thread that processes each upcall handed to it by the dispatcher thread,
51 * forwards the upcall's packet, and possibly sets up a kernel flow as a
54 struct udpif *udpif; /* Parent udpif. */
55 pthread_t thread; /* Thread ID. */
56 char *name; /* Thread name. */
58 struct ovs_mutex mutex; /* Mutex guarding the following. */
60 /* Atomic queue of unprocessed upcalls. */
61 struct list upcalls OVS_GUARDED;
62 size_t n_upcalls OVS_GUARDED;
64 bool need_signal; /* Only changed by the dispatcher. */
66 pthread_cond_t wake_cond; /* Wakes 'thread' while holding
70 /* A thread that processes each kernel flow handed to it by the flow_dumper
71 * thread, updates OpenFlow statistics, and updates or removes the kernel flow
74 struct udpif *udpif; /* Parent udpif. */
75 char *name; /* Thread name. */
77 pthread_t thread; /* Thread ID. */
78 struct hmap ukeys; /* Datapath flow keys. */
82 struct ovs_mutex mutex; /* Mutex guarding the following. */
83 pthread_cond_t wake_cond;
84 struct list udumps OVS_GUARDED; /* Unprocessed udumps. */
85 size_t n_udumps OVS_GUARDED; /* Number of unprocessed udumps. */
88 /* An upcall handler for ofproto_dpif.
90 * udpif has two logically separate pieces:
92 * - A "dispatcher" thread that reads upcalls from the kernel and dispatches
93 * them to one of several "handler" threads (see struct handler).
95 * - A "flow_dumper" thread that reads the kernel flow table and dispatches
96 * flows to one of several "revalidator" threads (see struct
99 struct list list_node; /* In all_udpifs list. */
101 struct dpif *dpif; /* Datapath handle. */
102 struct dpif_backer *backer; /* Opaque dpif_backer pointer. */
104 uint32_t secret; /* Random seed for upcall hash. */
106 pthread_t dispatcher; /* Dispatcher thread ID. */
107 pthread_t flow_dumper; /* Flow dumper thread ID. */
109 struct handler *handlers; /* Upcall handlers. */
112 struct revalidator *revalidators; /* Flow revalidators. */
113 size_t n_revalidators;
115 uint64_t last_reval_seq; /* 'reval_seq' at last revalidation. */
116 struct seq *reval_seq; /* Incremented to force revalidation. */
118 struct seq *dump_seq; /* Increments each dump iteration. */
120 struct latch exit_latch; /* Tells child threads to exit. */
122 long long int dump_duration; /* Duration of the last flow dump. */
124 /* Datapath flow statistics. */
125 unsigned int max_n_flows;
126 unsigned int avg_n_flows;
128 /* Following fields are accessed and modified by different threads. */
129 atomic_uint flow_limit; /* Datapath flow hard limit. */
131 /* n_flows_mutex prevents multiple threads updating these concurrently. */
132 atomic_uint64_t n_flows; /* Number of flows in the datapath. */
133 atomic_llong n_flows_timestamp; /* Last time n_flows was updated. */
134 struct ovs_mutex n_flows_mutex;
138 BAD_UPCALL, /* Some kind of bug somewhere. */
139 MISS_UPCALL, /* A flow miss. */
140 SFLOW_UPCALL, /* sFlow sample. */
141 FLOW_SAMPLE_UPCALL, /* Per-flow sampling. */
142 IPFIX_UPCALL /* Per-bridge sampling. */
146 struct list list_node; /* For queuing upcalls. */
147 struct flow_miss *flow_miss; /* This upcall's flow_miss. */
149 /* Raw upcall plus data for keeping track of the memory backing it. */
150 struct dpif_upcall dpif_upcall; /* As returned by dpif_recv() */
151 struct ofpbuf upcall_buf; /* Owns some data in 'dpif_upcall'. */
152 uint64_t upcall_stub[512 / 8]; /* Buffer to reduce need for malloc(). */
155 /* 'udpif_key's are responsible for tracking the little bit of state udpif
156 * needs to do flow expiration which can't be pulled directly from the
157 * datapath. They are owned, created by, maintained, and destroyed by a single
158 * revalidator making them easy to efficiently handle with multiple threads. */
160 struct hmap_node hmap_node; /* In parent revalidator 'ukeys' map. */
162 struct nlattr *key; /* Datapath flow key. */
163 size_t key_len; /* Length of 'key'. */
165 struct dpif_flow_stats stats; /* Stats at most recent flow dump. */
166 long long int created; /* Estimation of creation time. */
168 bool mark; /* Used by mark and sweep GC algorithm. */
170 struct odputil_keybuf key_buf; /* Memory for 'key'. */
173 /* 'udpif_flow_dump's hold the state associated with one iteration in a flow
174 * dump operation. This is created by the flow_dumper thread and handed to the
175 * appropriate revalidator thread to be processed. */
176 struct udpif_flow_dump {
177 struct list list_node;
179 struct nlattr *key; /* Datapath flow key. */
180 size_t key_len; /* Length of 'key'. */
181 uint32_t key_hash; /* Hash of 'key'. */
183 struct odputil_keybuf mask_buf;
184 struct nlattr *mask; /* Datapath mask for 'key'. */
185 size_t mask_len; /* Length of 'mask'. */
187 struct dpif_flow_stats stats; /* Stats pulled from the datapath. */
189 bool need_revalidate; /* Key needs revalidation? */
191 struct odputil_keybuf key_buf;
194 /* Flow miss batching.
196 * Some dpifs implement operations faster when you hand them off in a batch.
197 * To allow batching, "struct flow_miss" queues the dpif-related work needed
198 * for a given flow. Each "struct flow_miss" corresponds to sending one or
199 * more packets, plus possibly installing the flow in the dpif. */
201 struct hmap_node hmap_node;
202 struct ofproto_dpif *ofproto;
205 const struct nlattr *key;
207 enum dpif_upcall_type upcall_type;
208 struct dpif_flow_stats stats;
209 odp_port_t odp_in_port;
211 uint64_t slow_path_buf[128 / 8];
212 struct odputil_keybuf mask_buf;
214 struct xlate_out xout;
219 static void upcall_destroy(struct upcall *);
221 static struct vlog_rate_limit rl = VLOG_RATE_LIMIT_INIT(1, 5);
222 static struct list all_udpifs = LIST_INITIALIZER(&all_udpifs);
224 static void recv_upcalls(struct udpif *);
225 static void handle_upcalls(struct handler *handler, struct list *upcalls);
226 static void *udpif_flow_dumper(void *);
227 static void *udpif_dispatcher(void *);
228 static void *udpif_upcall_handler(void *);
229 static void *udpif_revalidator(void *);
230 static uint64_t udpif_get_n_flows(struct udpif *);
231 static void revalidate_udumps(struct revalidator *, struct list *udumps);
232 static void revalidator_sweep(struct revalidator *);
233 static void revalidator_purge(struct revalidator *);
234 static void upcall_unixctl_show(struct unixctl_conn *conn, int argc,
235 const char *argv[], void *aux);
236 static void upcall_unixctl_disable_megaflows(struct unixctl_conn *, int argc,
237 const char *argv[], void *aux);
238 static void upcall_unixctl_enable_megaflows(struct unixctl_conn *, int argc,
239 const char *argv[], void *aux);
240 static void upcall_unixctl_set_flow_limit(struct unixctl_conn *conn, int argc,
241 const char *argv[], void *aux);
242 static void ukey_delete(struct revalidator *, struct udpif_key *);
244 static atomic_bool enable_megaflows = ATOMIC_VAR_INIT(true);
247 udpif_create(struct dpif_backer *backer, struct dpif *dpif)
249 static struct ovsthread_once once = OVSTHREAD_ONCE_INITIALIZER;
250 struct udpif *udpif = xzalloc(sizeof *udpif);
252 if (ovsthread_once_start(&once)) {
253 unixctl_command_register("upcall/show", "", 0, 0, upcall_unixctl_show,
255 unixctl_command_register("upcall/disable-megaflows", "", 0, 0,
256 upcall_unixctl_disable_megaflows, NULL);
257 unixctl_command_register("upcall/enable-megaflows", "", 0, 0,
258 upcall_unixctl_enable_megaflows, NULL);
259 unixctl_command_register("upcall/set-flow-limit", "", 1, 1,
260 upcall_unixctl_set_flow_limit, NULL);
261 ovsthread_once_done(&once);
265 udpif->backer = backer;
266 atomic_init(&udpif->flow_limit, MIN(ofproto_flow_limit, 10000));
267 udpif->secret = random_uint32();
268 udpif->reval_seq = seq_create();
269 udpif->dump_seq = seq_create();
270 latch_init(&udpif->exit_latch);
271 list_push_back(&all_udpifs, &udpif->list_node);
272 atomic_init(&udpif->n_flows, 0);
273 atomic_init(&udpif->n_flows_timestamp, LLONG_MIN);
274 ovs_mutex_init(&udpif->n_flows_mutex);
280 udpif_destroy(struct udpif *udpif)
282 udpif_set_threads(udpif, 0, 0);
285 list_remove(&udpif->list_node);
286 latch_destroy(&udpif->exit_latch);
287 seq_destroy(udpif->reval_seq);
288 seq_destroy(udpif->dump_seq);
289 ovs_mutex_destroy(&udpif->n_flows_mutex);
293 /* Tells 'udpif' how many threads it should use to handle upcalls. Disables
294 * all threads if 'n_handlers' and 'n_revalidators' is zero. 'udpif''s
295 * datapath handle must have packet reception enabled before starting threads.
298 udpif_set_threads(struct udpif *udpif, size_t n_handlers,
299 size_t n_revalidators)
301 ovsrcu_quiesce_start();
303 /* Stop the old threads (if any). */
304 if (udpif->handlers &&
305 (udpif->n_handlers != n_handlers
306 || udpif->n_revalidators != n_revalidators)) {
309 latch_set(&udpif->exit_latch);
311 for (i = 0; i < udpif->n_handlers; i++) {
312 struct handler *handler = &udpif->handlers[i];
314 ovs_mutex_lock(&handler->mutex);
315 xpthread_cond_signal(&handler->wake_cond);
316 ovs_mutex_unlock(&handler->mutex);
317 xpthread_join(handler->thread, NULL);
320 for (i = 0; i < udpif->n_revalidators; i++) {
321 struct revalidator *revalidator = &udpif->revalidators[i];
323 ovs_mutex_lock(&revalidator->mutex);
324 xpthread_cond_signal(&revalidator->wake_cond);
325 ovs_mutex_unlock(&revalidator->mutex);
326 xpthread_join(revalidator->thread, NULL);
329 xpthread_join(udpif->flow_dumper, NULL);
330 xpthread_join(udpif->dispatcher, NULL);
332 for (i = 0; i < udpif->n_revalidators; i++) {
333 struct revalidator *revalidator = &udpif->revalidators[i];
334 struct udpif_flow_dump *udump, *next_udump;
336 LIST_FOR_EACH_SAFE (udump, next_udump, list_node,
337 &revalidator->udumps) {
338 list_remove(&udump->list_node);
342 /* Delete ukeys, and delete all flows from the datapath to prevent
343 * double-counting stats. */
344 revalidator_purge(revalidator);
345 hmap_destroy(&revalidator->ukeys);
346 ovs_mutex_destroy(&revalidator->mutex);
348 free(revalidator->name);
351 for (i = 0; i < udpif->n_handlers; i++) {
352 struct handler *handler = &udpif->handlers[i];
353 struct upcall *miss, *next;
355 LIST_FOR_EACH_SAFE (miss, next, list_node, &handler->upcalls) {
356 list_remove(&miss->list_node);
357 upcall_destroy(miss);
359 ovs_mutex_destroy(&handler->mutex);
361 xpthread_cond_destroy(&handler->wake_cond);
364 latch_poll(&udpif->exit_latch);
366 free(udpif->revalidators);
367 udpif->revalidators = NULL;
368 udpif->n_revalidators = 0;
370 free(udpif->handlers);
371 udpif->handlers = NULL;
372 udpif->n_handlers = 0;
375 /* Start new threads (if necessary). */
376 if (!udpif->handlers && n_handlers) {
379 udpif->n_handlers = n_handlers;
380 udpif->n_revalidators = n_revalidators;
382 udpif->handlers = xzalloc(udpif->n_handlers * sizeof *udpif->handlers);
383 for (i = 0; i < udpif->n_handlers; i++) {
384 struct handler *handler = &udpif->handlers[i];
386 handler->udpif = udpif;
387 list_init(&handler->upcalls);
388 handler->need_signal = false;
389 xpthread_cond_init(&handler->wake_cond, NULL);
390 ovs_mutex_init(&handler->mutex);
391 xpthread_create(&handler->thread, NULL, udpif_upcall_handler,
395 udpif->revalidators = xzalloc(udpif->n_revalidators
396 * sizeof *udpif->revalidators);
397 for (i = 0; i < udpif->n_revalidators; i++) {
398 struct revalidator *revalidator = &udpif->revalidators[i];
400 revalidator->udpif = udpif;
401 list_init(&revalidator->udumps);
402 hmap_init(&revalidator->ukeys);
403 ovs_mutex_init(&revalidator->mutex);
404 xpthread_cond_init(&revalidator->wake_cond, NULL);
405 xpthread_create(&revalidator->thread, NULL, udpif_revalidator,
408 xpthread_create(&udpif->dispatcher, NULL, udpif_dispatcher, udpif);
409 xpthread_create(&udpif->flow_dumper, NULL, udpif_flow_dumper, udpif);
412 ovsrcu_quiesce_end();
415 /* Waits for all ongoing upcall translations to complete. This ensures that
416 * there are no transient references to any removed ofprotos (or other
417 * objects). In particular, this should be called after an ofproto is removed
418 * (e.g. via xlate_remove_ofproto()) but before it is destroyed. */
420 udpif_synchronize(struct udpif *udpif)
422 /* This is stronger than necessary. It would be sufficient to ensure
423 * (somehow) that each handler and revalidator thread had passed through
424 * its main loop once. */
425 size_t n_handlers = udpif->n_handlers;
426 size_t n_revalidators = udpif->n_revalidators;
427 udpif_set_threads(udpif, 0, 0);
428 udpif_set_threads(udpif, n_handlers, n_revalidators);
431 /* Notifies 'udpif' that something changed which may render previous
432 * xlate_actions() results invalid. */
434 udpif_revalidate(struct udpif *udpif)
436 seq_change(udpif->reval_seq);
439 /* Returns a seq which increments every time 'udpif' pulls stats from the
440 * datapath. Callers can use this to get a sense of when might be a good time
441 * to do periodic work which relies on relatively up to date statistics. */
443 udpif_dump_seq(struct udpif *udpif)
445 return udpif->dump_seq;
449 udpif_get_memory_usage(struct udpif *udpif, struct simap *usage)
453 simap_increase(usage, "dispatchers", 1);
454 simap_increase(usage, "flow_dumpers", 1);
456 simap_increase(usage, "handlers", udpif->n_handlers);
457 for (i = 0; i < udpif->n_handlers; i++) {
458 struct handler *handler = &udpif->handlers[i];
459 ovs_mutex_lock(&handler->mutex);
460 simap_increase(usage, "handler upcalls", handler->n_upcalls);
461 ovs_mutex_unlock(&handler->mutex);
464 simap_increase(usage, "revalidators", udpif->n_revalidators);
465 for (i = 0; i < udpif->n_revalidators; i++) {
466 struct revalidator *revalidator = &udpif->revalidators[i];
467 ovs_mutex_lock(&revalidator->mutex);
468 simap_increase(usage, "revalidator dumps", revalidator->n_udumps);
470 /* XXX: This isn't technically thread safe because the revalidator
471 * ukeys maps isn't protected by a mutex since it's per thread. */
472 simap_increase(usage, "revalidator keys",
473 hmap_count(&revalidator->ukeys));
474 ovs_mutex_unlock(&revalidator->mutex);
478 /* Remove flows from a single datapath. */
480 udpif_flush(struct udpif *udpif)
482 size_t n_handlers, n_revalidators;
484 n_handlers = udpif->n_handlers;
485 n_revalidators = udpif->n_revalidators;
487 udpif_set_threads(udpif, 0, 0);
488 dpif_flow_flush(udpif->dpif);
489 udpif_set_threads(udpif, n_handlers, n_revalidators);
492 /* Removes all flows from all datapaths. */
494 udpif_flush_all_datapaths(void)
498 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
504 /* Destroys and deallocates 'upcall'. */
506 upcall_destroy(struct upcall *upcall)
509 ofpbuf_uninit(&upcall->dpif_upcall.packet);
510 ofpbuf_uninit(&upcall->upcall_buf);
516 udpif_get_n_flows(struct udpif *udpif)
518 long long int time, now;
522 atomic_read(&udpif->n_flows_timestamp, &time);
523 if (time < now - 100 && !ovs_mutex_trylock(&udpif->n_flows_mutex)) {
524 struct dpif_dp_stats stats;
526 atomic_store(&udpif->n_flows_timestamp, now);
527 dpif_get_dp_stats(udpif->dpif, &stats);
528 flow_count = stats.n_flows;
529 atomic_store(&udpif->n_flows, flow_count);
530 ovs_mutex_unlock(&udpif->n_flows_mutex);
532 atomic_read(&udpif->n_flows, &flow_count);
537 /* The dispatcher thread is responsible for receiving upcalls from the kernel,
538 * assigning them to a upcall_handler thread. */
540 udpif_dispatcher(void *arg)
542 struct udpif *udpif = arg;
544 set_subprogram_name("dispatcher");
545 while (!latch_is_set(&udpif->exit_latch)) {
547 dpif_recv_wait(udpif->dpif);
548 latch_wait(&udpif->exit_latch);
556 udpif_flow_dumper(void *arg)
558 struct udpif *udpif = arg;
560 set_subprogram_name("flow_dumper");
561 while (!latch_is_set(&udpif->exit_latch)) {
562 const struct dpif_flow_stats *stats;
563 long long int start_time, duration;
564 const struct nlattr *key, *mask;
565 struct dpif_flow_dump dump;
566 size_t key_len, mask_len;
567 unsigned int flow_limit;
568 bool need_revalidate;
574 reval_seq = seq_read(udpif->reval_seq);
575 need_revalidate = udpif->last_reval_seq != reval_seq;
576 udpif->last_reval_seq = reval_seq;
578 n_flows = udpif_get_n_flows(udpif);
579 udpif->max_n_flows = MAX(n_flows, udpif->max_n_flows);
580 udpif->avg_n_flows = (udpif->avg_n_flows + n_flows) / 2;
582 start_time = time_msec();
583 error = dpif_flow_dump_start(&dump, udpif->dpif);
585 VLOG_INFO("Failed to start flow dump (%s)", ovs_strerror(error));
588 dpif_flow_dump_state_init(udpif->dpif, &state);
589 while (dpif_flow_dump_next(&dump, state, &key, &key_len,
590 &mask, &mask_len, NULL, NULL, &stats)
591 && !latch_is_set(&udpif->exit_latch)) {
592 struct udpif_flow_dump *udump = xmalloc(sizeof *udump);
593 struct revalidator *revalidator;
595 udump->key_hash = hash_bytes(key, key_len, udpif->secret);
596 memcpy(&udump->key_buf, key, key_len);
597 udump->key = (struct nlattr *) &udump->key_buf;
598 udump->key_len = key_len;
600 memcpy(&udump->mask_buf, mask, mask_len);
601 udump->mask = (struct nlattr *) &udump->mask_buf;
602 udump->mask_len = mask_len;
604 udump->stats = *stats;
605 udump->need_revalidate = need_revalidate;
607 revalidator = &udpif->revalidators[udump->key_hash
608 % udpif->n_revalidators];
610 ovs_mutex_lock(&revalidator->mutex);
611 while (revalidator->n_udumps >= REVALIDATE_MAX_BATCH * 3
612 && !latch_is_set(&udpif->exit_latch)) {
613 ovs_mutex_cond_wait(&revalidator->wake_cond,
614 &revalidator->mutex);
616 list_push_back(&revalidator->udumps, &udump->list_node);
617 revalidator->n_udumps++;
618 xpthread_cond_signal(&revalidator->wake_cond);
619 ovs_mutex_unlock(&revalidator->mutex);
621 dpif_flow_dump_state_uninit(udpif->dpif, state);
622 dpif_flow_dump_done(&dump);
624 /* Let all the revalidators finish and garbage collect. */
625 seq_change(udpif->dump_seq);
626 for (i = 0; i < udpif->n_revalidators; i++) {
627 struct revalidator *revalidator = &udpif->revalidators[i];
628 ovs_mutex_lock(&revalidator->mutex);
629 xpthread_cond_signal(&revalidator->wake_cond);
630 ovs_mutex_unlock(&revalidator->mutex);
633 for (i = 0; i < udpif->n_revalidators; i++) {
634 struct revalidator *revalidator = &udpif->revalidators[i];
636 ovs_mutex_lock(&revalidator->mutex);
637 while (revalidator->dump_seq != seq_read(udpif->dump_seq)
638 && !latch_is_set(&udpif->exit_latch)) {
639 ovs_mutex_cond_wait(&revalidator->wake_cond,
640 &revalidator->mutex);
642 ovs_mutex_unlock(&revalidator->mutex);
645 duration = MAX(time_msec() - start_time, 1);
646 udpif->dump_duration = duration;
647 atomic_read(&udpif->flow_limit, &flow_limit);
648 if (duration > 2000) {
649 flow_limit /= duration / 1000;
650 } else if (duration > 1300) {
651 flow_limit = flow_limit * 3 / 4;
652 } else if (duration < 1000 && n_flows > 2000
653 && flow_limit < n_flows * 1000 / duration) {
656 flow_limit = MIN(ofproto_flow_limit, MAX(flow_limit, 1000));
657 atomic_store(&udpif->flow_limit, flow_limit);
659 if (duration > 2000) {
660 VLOG_INFO("Spent an unreasonably long %lldms dumping flows",
665 poll_timer_wait_until(start_time + MIN(ofproto_max_idle, 500));
666 seq_wait(udpif->reval_seq, udpif->last_reval_seq);
667 latch_wait(&udpif->exit_latch);
674 /* The miss handler thread is responsible for processing miss upcalls retrieved
675 * by the dispatcher thread. Once finished it passes the processed miss
676 * upcalls to ofproto-dpif where they're installed in the datapath. */
678 udpif_upcall_handler(void *arg)
680 struct handler *handler = arg;
682 handler->name = xasprintf("handler_%u", ovsthread_id_self());
683 set_subprogram_name("%s", handler->name);
685 while (!latch_is_set(&handler->udpif->exit_latch)) {
686 struct list misses = LIST_INITIALIZER(&misses);
689 ovs_mutex_lock(&handler->mutex);
690 if (!handler->n_upcalls) {
691 ovs_mutex_cond_wait(&handler->wake_cond, &handler->mutex);
694 for (i = 0; i < FLOW_MISS_MAX_BATCH; i++) {
695 if (handler->n_upcalls) {
696 handler->n_upcalls--;
697 list_push_back(&misses, list_pop_front(&handler->upcalls));
702 ovs_mutex_unlock(&handler->mutex);
704 handle_upcalls(handler, &misses);
713 udpif_revalidator(void *arg)
715 struct revalidator *revalidator = arg;
717 revalidator->name = xasprintf("revalidator_%u", ovsthread_id_self());
718 set_subprogram_name("%s", revalidator->name);
720 struct list udumps = LIST_INITIALIZER(&udumps);
721 struct udpif *udpif = revalidator->udpif;
724 ovs_mutex_lock(&revalidator->mutex);
725 if (latch_is_set(&udpif->exit_latch)) {
726 ovs_mutex_unlock(&revalidator->mutex);
730 if (!revalidator->n_udumps) {
731 if (revalidator->dump_seq != seq_read(udpif->dump_seq)) {
732 revalidator->dump_seq = seq_read(udpif->dump_seq);
733 revalidator_sweep(revalidator);
735 ovs_mutex_cond_wait(&revalidator->wake_cond,
736 &revalidator->mutex);
740 for (i = 0; i < REVALIDATE_MAX_BATCH && revalidator->n_udumps; i++) {
741 list_push_back(&udumps, list_pop_front(&revalidator->udumps));
742 revalidator->n_udumps--;
745 /* Wake up the flow dumper. */
746 xpthread_cond_signal(&revalidator->wake_cond);
747 ovs_mutex_unlock(&revalidator->mutex);
749 if (!list_is_empty(&udumps)) {
750 revalidate_udumps(revalidator, &udumps);
757 static enum upcall_type
758 classify_upcall(const struct upcall *upcall)
760 const struct dpif_upcall *dpif_upcall = &upcall->dpif_upcall;
761 union user_action_cookie cookie;
764 /* First look at the upcall type. */
765 switch (dpif_upcall->type) {
772 case DPIF_N_UC_TYPES:
774 VLOG_WARN_RL(&rl, "upcall has unexpected type %"PRIu32,
779 /* "action" upcalls need a closer look. */
780 if (!dpif_upcall->userdata) {
781 VLOG_WARN_RL(&rl, "action upcall missing cookie");
784 userdata_len = nl_attr_get_size(dpif_upcall->userdata);
785 if (userdata_len < sizeof cookie.type
786 || userdata_len > sizeof cookie) {
787 VLOG_WARN_RL(&rl, "action upcall cookie has unexpected size %"PRIuSIZE,
791 memset(&cookie, 0, sizeof cookie);
792 memcpy(&cookie, nl_attr_get(dpif_upcall->userdata), userdata_len);
793 if (userdata_len == MAX(8, sizeof cookie.sflow)
794 && cookie.type == USER_ACTION_COOKIE_SFLOW) {
796 } else if (userdata_len == MAX(8, sizeof cookie.slow_path)
797 && cookie.type == USER_ACTION_COOKIE_SLOW_PATH) {
799 } else if (userdata_len == MAX(8, sizeof cookie.flow_sample)
800 && cookie.type == USER_ACTION_COOKIE_FLOW_SAMPLE) {
801 return FLOW_SAMPLE_UPCALL;
802 } else if (userdata_len == MAX(8, sizeof cookie.ipfix)
803 && cookie.type == USER_ACTION_COOKIE_IPFIX) {
806 VLOG_WARN_RL(&rl, "invalid user cookie of type %"PRIu16
807 " and size %"PRIuSIZE, cookie.type, userdata_len);
813 recv_upcalls(struct udpif *udpif)
818 uint32_t hash = udpif->secret;
819 struct handler *handler;
820 struct upcall *upcall;
821 size_t n_bytes, left;
825 upcall = xmalloc(sizeof *upcall);
826 ofpbuf_use_stub(&upcall->upcall_buf, upcall->upcall_stub,
827 sizeof upcall->upcall_stub);
828 error = dpif_recv(udpif->dpif, &upcall->dpif_upcall,
829 &upcall->upcall_buf);
831 /* upcall_destroy() can only be called on successfully received
833 ofpbuf_uninit(&upcall->upcall_buf);
839 NL_ATTR_FOR_EACH (nla, left, upcall->dpif_upcall.key,
840 upcall->dpif_upcall.key_len) {
841 enum ovs_key_attr type = nl_attr_type(nla);
842 if (type == OVS_KEY_ATTR_IN_PORT
843 || type == OVS_KEY_ATTR_TCP
844 || type == OVS_KEY_ATTR_UDP) {
845 if (nl_attr_get_size(nla) == 4) {
846 hash = mhash_add(hash, nl_attr_get_u32(nla));
850 "Netlink attribute with incorrect size.");
854 hash = mhash_finish(hash, n_bytes);
856 handler = &udpif->handlers[hash % udpif->n_handlers];
858 ovs_mutex_lock(&handler->mutex);
859 if (handler->n_upcalls < MAX_QUEUE_LENGTH) {
860 list_push_back(&handler->upcalls, &upcall->list_node);
861 if (handler->n_upcalls == 0) {
862 handler->need_signal = true;
864 handler->n_upcalls++;
865 if (handler->need_signal &&
866 handler->n_upcalls >= FLOW_MISS_MAX_BATCH) {
867 handler->need_signal = false;
868 xpthread_cond_signal(&handler->wake_cond);
870 ovs_mutex_unlock(&handler->mutex);
871 if (!VLOG_DROP_DBG(&rl)) {
872 struct ds ds = DS_EMPTY_INITIALIZER;
874 odp_flow_key_format(upcall->dpif_upcall.key,
875 upcall->dpif_upcall.key_len,
877 VLOG_DBG("dispatcher: enqueue (%s)", ds_cstr(&ds));
881 ovs_mutex_unlock(&handler->mutex);
882 COVERAGE_INC(upcall_queue_overflow);
883 upcall_destroy(upcall);
887 for (n = 0; n < udpif->n_handlers; ++n) {
888 struct handler *handler = &udpif->handlers[n];
890 if (handler->need_signal) {
891 handler->need_signal = false;
892 ovs_mutex_lock(&handler->mutex);
893 xpthread_cond_signal(&handler->wake_cond);
894 ovs_mutex_unlock(&handler->mutex);
899 /* Calculates slow path actions for 'xout'. 'buf' must statically be
900 * initialized with at least 128 bytes of space. */
902 compose_slow_path(struct udpif *udpif, struct xlate_out *xout,
903 odp_port_t odp_in_port, struct ofpbuf *buf)
905 union user_action_cookie cookie;
909 cookie.type = USER_ACTION_COOKIE_SLOW_PATH;
910 cookie.slow_path.unused = 0;
911 cookie.slow_path.reason = xout->slow;
913 port = xout->slow & (SLOW_CFM | SLOW_BFD | SLOW_LACP | SLOW_STP)
916 pid = dpif_port_get_pid(udpif->dpif, port);
917 odp_put_userspace_action(pid, &cookie, sizeof cookie.slow_path, buf);
920 static struct flow_miss *
921 flow_miss_find(struct hmap *todo, const struct ofproto_dpif *ofproto,
922 const struct flow *flow, uint32_t hash)
924 struct flow_miss *miss;
926 HMAP_FOR_EACH_WITH_HASH (miss, hmap_node, hash, todo) {
927 if (miss->ofproto == ofproto && flow_equal(&miss->flow, flow)) {
936 handle_upcalls(struct handler *handler, struct list *upcalls)
938 struct hmap misses = HMAP_INITIALIZER(&misses);
939 struct udpif *udpif = handler->udpif;
941 struct flow_miss miss_buf[FLOW_MISS_MAX_BATCH];
942 struct dpif_op *opsp[FLOW_MISS_MAX_BATCH * 2];
943 struct dpif_op ops[FLOW_MISS_MAX_BATCH * 2];
944 struct flow_miss *miss, *next_miss;
945 struct upcall *upcall, *next;
946 size_t n_misses, n_ops, i;
947 unsigned int flow_limit;
948 bool fail_open, may_put;
949 enum upcall_type type;
951 atomic_read(&udpif->flow_limit, &flow_limit);
952 may_put = udpif_get_n_flows(udpif) < flow_limit;
954 /* Extract the flow from each upcall. Construct in 'misses' a hash table
955 * that maps each unique flow to a 'struct flow_miss'.
957 * Most commonly there is a single packet per flow_miss, but there are
958 * several reasons why there might be more than one, e.g.:
960 * - The dpif packet interface does not support TSO (or UFO, etc.), so a
961 * large packet sent to userspace is split into a sequence of smaller
964 * - A stream of quickly arriving packets in an established "slow-pathed"
967 * - Rarely, a stream of quickly arriving packets in a flow not yet
968 * established. (This is rare because most protocols do not send
969 * multiple back-to-back packets before receiving a reply from the
970 * other end of the connection, which gives OVS a chance to set up a
974 LIST_FOR_EACH_SAFE (upcall, next, list_node, upcalls) {
975 struct dpif_upcall *dupcall = &upcall->dpif_upcall;
976 struct flow_miss *miss = &miss_buf[n_misses];
977 struct ofpbuf *packet = &dupcall->packet;
978 struct flow_miss *existing_miss;
979 struct ofproto_dpif *ofproto;
980 struct dpif_sflow *sflow;
981 struct dpif_ipfix *ipfix;
982 odp_port_t odp_in_port;
986 error = xlate_receive(udpif->backer, packet, dupcall->key,
987 dupcall->key_len, &flow,
988 &ofproto, &ipfix, &sflow, NULL, &odp_in_port);
990 if (error == ENODEV) {
991 /* Received packet on datapath port for which we couldn't
992 * associate an ofproto. This can happen if a port is removed
993 * while traffic is being received. Print a rate-limited
994 * message in case it happens frequently. Install a drop flow
995 * so that future packets of the flow are inexpensively dropped
997 VLOG_INFO_RL(&rl, "received packet on unassociated datapath "
998 "port %"PRIu32, odp_in_port);
999 dpif_flow_put(udpif->dpif, DPIF_FP_CREATE | DPIF_FP_MODIFY,
1000 dupcall->key, dupcall->key_len, NULL, 0, NULL, 0,
1003 list_remove(&upcall->list_node);
1004 upcall_destroy(upcall);
1008 type = classify_upcall(upcall);
1009 if (type == MISS_UPCALL) {
1011 struct pkt_metadata md = PKT_METADATA_INITIALIZER_FLOW(&flow);
1013 flow_extract(packet, &md, &miss->flow);
1014 hash = flow_hash(&miss->flow, 0);
1015 existing_miss = flow_miss_find(&misses, ofproto, &miss->flow,
1017 if (!existing_miss) {
1018 hmap_insert(&misses, &miss->hmap_node, hash);
1019 miss->ofproto = ofproto;
1020 miss->key = dupcall->key;
1021 miss->key_len = dupcall->key_len;
1022 miss->upcall_type = dupcall->type;
1023 miss->stats.n_packets = 0;
1024 miss->stats.n_bytes = 0;
1025 miss->stats.used = time_msec();
1026 miss->stats.tcp_flags = 0;
1027 miss->odp_in_port = odp_in_port;
1032 miss = existing_miss;
1034 miss->stats.tcp_flags |= packet_get_tcp_flags(packet, &miss->flow);
1035 miss->stats.n_bytes += packet->size;
1036 miss->stats.n_packets++;
1038 upcall->flow_miss = miss;
1045 union user_action_cookie cookie;
1047 memset(&cookie, 0, sizeof cookie);
1048 memcpy(&cookie, nl_attr_get(dupcall->userdata),
1049 sizeof cookie.sflow);
1050 dpif_sflow_received(sflow, packet, &flow, odp_in_port,
1056 dpif_ipfix_bridge_sample(ipfix, packet, &flow);
1059 case FLOW_SAMPLE_UPCALL:
1061 union user_action_cookie cookie;
1063 memset(&cookie, 0, sizeof cookie);
1064 memcpy(&cookie, nl_attr_get(dupcall->userdata),
1065 sizeof cookie.flow_sample);
1067 /* The flow reflects exactly the contents of the packet.
1068 * Sample the packet using it. */
1069 dpif_ipfix_flow_sample(ipfix, packet, &flow,
1070 cookie.flow_sample.collector_set_id,
1071 cookie.flow_sample.probability,
1072 cookie.flow_sample.obs_domain_id,
1073 cookie.flow_sample.obs_point_id);
1082 dpif_ipfix_unref(ipfix);
1083 dpif_sflow_unref(sflow);
1085 list_remove(&upcall->list_node);
1086 upcall_destroy(upcall);
1089 /* Initialize each 'struct flow_miss's ->xout.
1091 * We do this per-flow_miss rather than per-packet because, most commonly,
1092 * all the packets in a flow can use the same translation.
1094 * We can't do this in the previous loop because we need the TCP flags for
1095 * all the packets in each miss. */
1097 HMAP_FOR_EACH (miss, hmap_node, &misses) {
1098 struct xlate_in xin;
1100 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL,
1101 miss->stats.tcp_flags, NULL);
1102 xin.may_learn = true;
1104 if (miss->upcall_type == DPIF_UC_MISS) {
1105 xin.resubmit_stats = &miss->stats;
1107 /* For non-miss upcalls, there's a flow in the datapath which this
1108 * packet was accounted to. Presumably the revalidators will deal
1109 * with pushing its stats eventually. */
1112 xlate_actions(&xin, &miss->xout);
1113 fail_open = fail_open || miss->xout.fail_open;
1116 /* Now handle the packets individually in order of arrival. In the common
1117 * case each packet of a miss can share the same actions, but slow-pathed
1118 * packets need to be translated individually:
1120 * - For SLOW_CFM, SLOW_LACP, SLOW_STP, and SLOW_BFD, translation is what
1121 * processes received packets for these protocols.
1123 * - For SLOW_CONTROLLER, translation sends the packet to the OpenFlow
1126 * The loop fills 'ops' with an array of operations to execute in the
1129 LIST_FOR_EACH (upcall, list_node, upcalls) {
1130 struct flow_miss *miss = upcall->flow_miss;
1131 struct ofpbuf *packet = &upcall->dpif_upcall.packet;
1133 ovs_be16 flow_vlan_tci;
1135 /* Save a copy of flow.vlan_tci in case it is changed to
1136 * generate proper mega flow masks for VLAN splinter flows. */
1137 flow_vlan_tci = miss->flow.vlan_tci;
1139 if (miss->xout.slow) {
1140 struct xlate_in xin;
1142 xlate_in_init(&xin, miss->ofproto, &miss->flow, NULL, 0, packet);
1143 xlate_actions_for_side_effects(&xin);
1146 if (miss->flow.in_port.ofp_port
1147 != vsp_realdev_to_vlandev(miss->ofproto,
1148 miss->flow.in_port.ofp_port,
1149 miss->flow.vlan_tci)) {
1150 /* This packet was received on a VLAN splinter port. We
1151 * added a VLAN to the packet to make the packet resemble
1152 * the flow, but the actions were composed assuming that
1153 * the packet contained no VLAN. So, we must remove the
1154 * VLAN header from the packet before trying to execute the
1156 if (miss->xout.odp_actions.size) {
1157 eth_pop_vlan(packet);
1160 /* Remove the flow vlan tags inserted by vlan splinter logic
1161 * to ensure megaflow masks generated match the data path flow. */
1162 miss->flow.vlan_tci = 0;
1165 /* Do not install a flow into the datapath if:
1167 * - The datapath already has too many flows.
1169 * - An earlier iteration of this loop already put the same flow.
1171 * - We received this packet via some flow installed in the kernel
1175 && upcall->dpif_upcall.type == DPIF_UC_MISS) {
1181 atomic_read(&enable_megaflows, &megaflow);
1182 ofpbuf_use_stack(&mask, &miss->mask_buf, sizeof miss->mask_buf);
1186 max_mpls = ofproto_dpif_get_max_mpls_depth(miss->ofproto);
1187 odp_flow_key_from_mask(&mask, &miss->xout.wc.masks,
1188 &miss->flow, UINT32_MAX, max_mpls);
1192 op->type = DPIF_OP_FLOW_PUT;
1193 op->u.flow_put.flags = DPIF_FP_CREATE | DPIF_FP_MODIFY;
1194 op->u.flow_put.key = miss->key;
1195 op->u.flow_put.key_len = miss->key_len;
1196 op->u.flow_put.mask = mask.data;
1197 op->u.flow_put.mask_len = mask.size;
1198 op->u.flow_put.stats = NULL;
1200 if (!miss->xout.slow) {
1201 op->u.flow_put.actions = miss->xout.odp_actions.data;
1202 op->u.flow_put.actions_len = miss->xout.odp_actions.size;
1206 ofpbuf_use_stack(&buf, miss->slow_path_buf,
1207 sizeof miss->slow_path_buf);
1208 compose_slow_path(udpif, &miss->xout, miss->odp_in_port, &buf);
1209 op->u.flow_put.actions = buf.data;
1210 op->u.flow_put.actions_len = buf.size;
1215 * The 'miss' may be shared by multiple upcalls. Restore
1216 * the saved flow vlan_tci field before processing the next
1218 miss->flow.vlan_tci = flow_vlan_tci;
1220 if (miss->xout.odp_actions.size) {
1223 op->type = DPIF_OP_EXECUTE;
1224 op->u.execute.packet = packet;
1225 odp_key_to_pkt_metadata(miss->key, miss->key_len,
1227 op->u.execute.actions = miss->xout.odp_actions.data;
1228 op->u.execute.actions_len = miss->xout.odp_actions.size;
1229 op->u.execute.needs_help = (miss->xout.slow & SLOW_ACTION) != 0;
1233 /* Special case for fail-open mode.
1235 * If we are in fail-open mode, but we are connected to a controller too,
1236 * then we should send the packet up to the controller in the hope that it
1237 * will try to set up a flow and thereby allow us to exit fail-open.
1239 * See the top-level comment in fail-open.c for more information.
1241 * Copy packets before they are modified by execution. */
1243 LIST_FOR_EACH (upcall, list_node, upcalls) {
1244 struct flow_miss *miss = upcall->flow_miss;
1245 struct ofpbuf *packet = &upcall->dpif_upcall.packet;
1246 struct ofproto_packet_in *pin;
1248 pin = xmalloc(sizeof *pin);
1249 pin->up.packet = xmemdup(packet->data, packet->size);
1250 pin->up.packet_len = packet->size;
1251 pin->up.reason = OFPR_NO_MATCH;
1252 pin->up.table_id = 0;
1253 pin->up.cookie = OVS_BE64_MAX;
1254 flow_get_metadata(&miss->flow, &pin->up.fmd);
1255 pin->send_len = 0; /* Not used for flow table misses. */
1256 pin->generated_by_table_miss = false;
1257 ofproto_dpif_send_packet_in(miss->ofproto, pin);
1261 /* Execute batch. */
1262 for (i = 0; i < n_ops; i++) {
1265 dpif_operate(udpif->dpif, opsp, n_ops);
1267 HMAP_FOR_EACH_SAFE (miss, next_miss, hmap_node, &misses) {
1268 hmap_remove(&misses, &miss->hmap_node);
1269 xlate_out_uninit(&miss->xout);
1271 hmap_destroy(&misses);
1273 LIST_FOR_EACH_SAFE (upcall, next, list_node, upcalls) {
1274 list_remove(&upcall->list_node);
1275 upcall_destroy(upcall);
1279 static struct udpif_key *
1280 ukey_lookup(struct revalidator *revalidator, struct udpif_flow_dump *udump)
1282 struct udpif_key *ukey;
1284 HMAP_FOR_EACH_WITH_HASH (ukey, hmap_node, udump->key_hash,
1285 &revalidator->ukeys) {
1286 if (ukey->key_len == udump->key_len
1287 && !memcmp(ukey->key, udump->key, udump->key_len)) {
1294 static struct udpif_key *
1295 ukey_create(const struct nlattr *key, size_t key_len, long long int used)
1297 struct udpif_key *ukey = xmalloc(sizeof *ukey);
1299 ukey->key = (struct nlattr *) &ukey->key_buf;
1300 memcpy(&ukey->key_buf, key, key_len);
1301 ukey->key_len = key_len;
1304 ukey->created = used ? used : time_msec();
1305 memset(&ukey->stats, 0, sizeof ukey->stats);
1311 ukey_delete(struct revalidator *revalidator, struct udpif_key *ukey)
1313 hmap_remove(&revalidator->ukeys, &ukey->hmap_node);
1318 revalidate_ukey(struct udpif *udpif, struct udpif_flow_dump *udump,
1319 struct udpif_key *ukey)
1321 struct ofpbuf xout_actions, *actions;
1322 uint64_t slow_path_buf[128 / 8];
1323 struct xlate_out xout, *xoutp;
1324 struct flow flow, udump_mask;
1325 struct ofproto_dpif *ofproto;
1326 struct dpif_flow_stats push;
1327 uint32_t *udump32, *xout32;
1328 odp_port_t odp_in_port;
1329 struct xlate_in xin;
1338 /* If we don't need to revalidate, we can simply push the stats contained
1339 * in the udump, otherwise we'll have to get the actions so we can check
1341 if (udump->need_revalidate) {
1342 if (dpif_flow_get(udpif->dpif, ukey->key, ukey->key_len, &actions,
1348 push.used = udump->stats.used;
1349 push.tcp_flags = udump->stats.tcp_flags;
1350 push.n_packets = udump->stats.n_packets > ukey->stats.n_packets
1351 ? udump->stats.n_packets - ukey->stats.n_packets
1353 push.n_bytes = udump->stats.n_bytes > ukey->stats.n_bytes
1354 ? udump->stats.n_bytes - ukey->stats.n_bytes
1356 ukey->stats = udump->stats;
1358 if (!push.n_packets && !udump->need_revalidate) {
1363 error = xlate_receive(udpif->backer, NULL, ukey->key, ukey->key_len, &flow,
1364 &ofproto, NULL, NULL, NULL, &odp_in_port);
1369 xlate_in_init(&xin, ofproto, &flow, NULL, push.tcp_flags, NULL);
1370 xin.resubmit_stats = push.n_packets ? &push : NULL;
1371 xin.may_learn = push.n_packets > 0;
1372 xin.skip_wildcards = !udump->need_revalidate;
1373 xlate_actions(&xin, &xout);
1376 if (!udump->need_revalidate) {
1382 ofpbuf_use_const(&xout_actions, xout.odp_actions.data,
1383 xout.odp_actions.size);
1385 ofpbuf_use_stack(&xout_actions, slow_path_buf, sizeof slow_path_buf);
1386 compose_slow_path(udpif, &xout, odp_in_port, &xout_actions);
1389 if (!ofpbuf_equal(&xout_actions, actions)) {
1393 if (odp_flow_key_to_mask(udump->mask, udump->mask_len, &udump_mask, &flow)
1398 /* Since the kernel is free to ignore wildcarded bits in the mask, we can't
1399 * directly check that the masks are the same. Instead we check that the
1400 * mask in the kernel is more specific i.e. less wildcarded, than what
1401 * we've calculated here. This guarantees we don't catch any packets we
1402 * shouldn't with the megaflow. */
1403 udump32 = (uint32_t *) &udump_mask;
1404 xout32 = (uint32_t *) &xout.wc.masks;
1405 for (i = 0; i < FLOW_U32S; i++) {
1406 if ((udump32[i] | xout32[i]) != udump32[i]) {
1413 ofpbuf_delete(actions);
1414 xlate_out_uninit(xoutp);
1419 struct udpif_key *ukey;
1420 struct udpif_flow_dump *udump;
1421 struct dpif_flow_stats stats; /* Stats for 'op'. */
1422 struct dpif_op op; /* Flow del operation. */
1426 dump_op_init(struct dump_op *op, const struct nlattr *key, size_t key_len,
1427 struct udpif_key *ukey, struct udpif_flow_dump *udump)
1431 op->op.type = DPIF_OP_FLOW_DEL;
1432 op->op.u.flow_del.key = key;
1433 op->op.u.flow_del.key_len = key_len;
1434 op->op.u.flow_del.stats = &op->stats;
1438 push_dump_ops(struct revalidator *revalidator,
1439 struct dump_op *ops, size_t n_ops)
1441 struct udpif *udpif = revalidator->udpif;
1442 struct dpif_op *opsp[REVALIDATE_MAX_BATCH];
1445 ovs_assert(n_ops <= REVALIDATE_MAX_BATCH);
1446 for (i = 0; i < n_ops; i++) {
1447 opsp[i] = &ops[i].op;
1449 dpif_operate(udpif->dpif, opsp, n_ops);
1451 for (i = 0; i < n_ops; i++) {
1452 struct dump_op *op = &ops[i];
1453 struct dpif_flow_stats *push, *stats, push_buf;
1455 stats = op->op.u.flow_del.stats;
1458 push->used = MAX(stats->used, op->ukey->stats.used);
1459 push->tcp_flags = stats->tcp_flags | op->ukey->stats.tcp_flags;
1460 push->n_packets = stats->n_packets - op->ukey->stats.n_packets;
1461 push->n_bytes = stats->n_bytes - op->ukey->stats.n_bytes;
1466 if (push->n_packets || netflow_exists()) {
1467 struct ofproto_dpif *ofproto;
1468 struct netflow *netflow;
1471 if (!xlate_receive(udpif->backer, NULL, op->op.u.flow_del.key,
1472 op->op.u.flow_del.key_len, &flow, &ofproto,
1473 NULL, NULL, &netflow, NULL)) {
1474 struct xlate_in xin;
1476 xlate_in_init(&xin, ofproto, &flow, NULL, push->tcp_flags,
1478 xin.resubmit_stats = push->n_packets ? push : NULL;
1479 xin.may_learn = push->n_packets > 0;
1480 xin.skip_wildcards = true;
1481 xlate_actions_for_side_effects(&xin);
1484 netflow_expire(netflow, &flow);
1485 netflow_flow_clear(netflow, &flow);
1486 netflow_unref(netflow);
1492 for (i = 0; i < n_ops; i++) {
1493 struct udpif_key *ukey;
1495 /* If there's a udump, this ukey came directly from a datapath flow
1496 * dump. Sometimes a datapath can send duplicates in flow dumps, in
1497 * which case we wouldn't want to double-free a ukey, so avoid that by
1498 * looking up the ukey again.
1500 * If there's no udump then we know what we're doing. */
1501 ukey = (ops[i].udump
1502 ? ukey_lookup(revalidator, ops[i].udump)
1505 ukey_delete(revalidator, ukey);
1511 revalidate_udumps(struct revalidator *revalidator, struct list *udumps)
1513 struct udpif *udpif = revalidator->udpif;
1515 struct dump_op ops[REVALIDATE_MAX_BATCH];
1516 struct udpif_flow_dump *udump, *next_udump;
1517 size_t n_ops, n_flows;
1518 unsigned int flow_limit;
1519 long long int max_idle;
1522 atomic_read(&udpif->flow_limit, &flow_limit);
1524 n_flows = udpif_get_n_flows(udpif);
1527 max_idle = ofproto_max_idle;
1528 if (n_flows > flow_limit) {
1529 must_del = n_flows > 2 * flow_limit;
1534 LIST_FOR_EACH_SAFE (udump, next_udump, list_node, udumps) {
1535 long long int used, now;
1536 struct udpif_key *ukey;
1539 ukey = ukey_lookup(revalidator, udump);
1541 used = udump->stats.used;
1542 if (!used && ukey) {
1543 used = ukey->created;
1546 if (must_del || (used && used < now - max_idle)) {
1547 struct dump_op *dop = &ops[n_ops++];
1549 dump_op_init(dop, udump->key, udump->key_len, ukey, udump);
1554 ukey = ukey_create(udump->key, udump->key_len, used);
1555 hmap_insert(&revalidator->ukeys, &ukey->hmap_node,
1560 if (!revalidate_ukey(udpif, udump, ukey)) {
1561 dpif_flow_del(udpif->dpif, udump->key, udump->key_len, NULL);
1562 ukey_delete(revalidator, ukey);
1565 list_remove(&udump->list_node);
1569 push_dump_ops(revalidator, ops, n_ops);
1571 LIST_FOR_EACH_SAFE (udump, next_udump, list_node, udumps) {
1572 list_remove(&udump->list_node);
1578 revalidator_sweep__(struct revalidator *revalidator, bool purge)
1580 struct dump_op ops[REVALIDATE_MAX_BATCH];
1581 struct udpif_key *ukey, *next;
1586 HMAP_FOR_EACH_SAFE (ukey, next, hmap_node, &revalidator->ukeys) {
1587 if (!purge && ukey->mark) {
1590 struct dump_op *op = &ops[n_ops++];
1592 /* If we have previously seen a flow in the datapath, but didn't
1593 * see it during the most recent dump, delete it. This allows us
1594 * to clean up the ukey and keep the statistics consistent. */
1595 dump_op_init(op, ukey->key, ukey->key_len, ukey, NULL);
1596 if (n_ops == REVALIDATE_MAX_BATCH) {
1597 push_dump_ops(revalidator, ops, n_ops);
1604 push_dump_ops(revalidator, ops, n_ops);
1609 revalidator_sweep(struct revalidator *revalidator)
1611 revalidator_sweep__(revalidator, false);
1615 revalidator_purge(struct revalidator *revalidator)
1617 revalidator_sweep__(revalidator, true);
1621 upcall_unixctl_show(struct unixctl_conn *conn, int argc OVS_UNUSED,
1622 const char *argv[] OVS_UNUSED, void *aux OVS_UNUSED)
1624 struct ds ds = DS_EMPTY_INITIALIZER;
1625 struct udpif *udpif;
1627 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
1628 unsigned int flow_limit;
1631 atomic_read(&udpif->flow_limit, &flow_limit);
1633 ds_put_format(&ds, "%s:\n", dpif_name(udpif->dpif));
1634 ds_put_format(&ds, "\tflows : (current %"PRIu64")"
1635 " (avg %u) (max %u) (limit %u)\n", udpif_get_n_flows(udpif),
1636 udpif->avg_n_flows, udpif->max_n_flows, flow_limit);
1637 ds_put_format(&ds, "\tdump duration : %lldms\n", udpif->dump_duration);
1639 ds_put_char(&ds, '\n');
1640 for (i = 0; i < udpif->n_handlers; i++) {
1641 struct handler *handler = &udpif->handlers[i];
1643 ovs_mutex_lock(&handler->mutex);
1644 ds_put_format(&ds, "\t%s: (upcall queue %"PRIuSIZE")\n",
1645 handler->name, handler->n_upcalls);
1646 ovs_mutex_unlock(&handler->mutex);
1649 ds_put_char(&ds, '\n');
1650 for (i = 0; i < n_revalidators; i++) {
1651 struct revalidator *revalidator = &udpif->revalidators[i];
1653 /* XXX: The result of hmap_count(&revalidator->ukeys) may not be
1654 * accurate because it's not protected by the revalidator mutex. */
1655 ovs_mutex_lock(&revalidator->mutex);
1656 ds_put_format(&ds, "\t%s: (dump queue %"PRIuSIZE") (keys %"PRIuSIZE
1657 ")\n", revalidator->name, revalidator->n_udumps,
1658 hmap_count(&revalidator->ukeys));
1659 ovs_mutex_unlock(&revalidator->mutex);
1663 unixctl_command_reply(conn, ds_cstr(&ds));
1667 /* Disable using the megaflows.
1669 * This command is only needed for advanced debugging, so it's not
1670 * documented in the man page. */
1672 upcall_unixctl_disable_megaflows(struct unixctl_conn *conn,
1673 int argc OVS_UNUSED,
1674 const char *argv[] OVS_UNUSED,
1675 void *aux OVS_UNUSED)
1677 atomic_store(&enable_megaflows, false);
1678 udpif_flush_all_datapaths();
1679 unixctl_command_reply(conn, "megaflows disabled");
1682 /* Re-enable using megaflows.
1684 * This command is only needed for advanced debugging, so it's not
1685 * documented in the man page. */
1687 upcall_unixctl_enable_megaflows(struct unixctl_conn *conn,
1688 int argc OVS_UNUSED,
1689 const char *argv[] OVS_UNUSED,
1690 void *aux OVS_UNUSED)
1692 atomic_store(&enable_megaflows, true);
1693 udpif_flush_all_datapaths();
1694 unixctl_command_reply(conn, "megaflows enabled");
1697 /* Set the flow limit.
1699 * This command is only needed for advanced debugging, so it's not
1700 * documented in the man page. */
1702 upcall_unixctl_set_flow_limit(struct unixctl_conn *conn,
1703 int argc OVS_UNUSED,
1704 const char *argv[] OVS_UNUSED,
1705 void *aux OVS_UNUSED)
1707 struct ds ds = DS_EMPTY_INITIALIZER;
1708 struct udpif *udpif;
1709 unsigned int flow_limit = atoi(argv[1]);
1711 LIST_FOR_EACH (udpif, list_node, &all_udpifs) {
1712 atomic_store(&udpif->flow_limit, flow_limit);
1714 ds_put_format(&ds, "set flow_limit to %u\n", flow_limit);
1715 unixctl_command_reply(conn, ds_cstr(&ds));